|
problem.path
|
|
|
problem.expected_res
|
unknown
|
|
res
|
sat
|
|
rtime
|
0.131s
|
|
stime
|
0.000s
|
|
utime
|
0.000s
|
|
errcode
|
10
|
WARNING: for repeatability, setting FPU to use double precision ============================[ Problem Statistics ]============================= | | | Number of variables: 758 | | Number of clauses: 47820 | | Parse time: 0.02 s | | Eliminated vars: 4 | | Vars set : 48 | | Eliminated clauses: 0.00 Mb | | Simplification time: 0.04 s | | | ============================[ Search Statistics ]============================== | Conflicts | ORIGINAL | LEARNT | Progress | | | Vars Clauses Literals | Limit Clauses Lit/Cl | | =============================================================================== | 100 | 703 24038 63195 | 8813 99 23 | 6.748 % | | 250 | 687 24038 63195 | 9695 247 24 | 8.839 % | | 475 | 686 24038 63195 | 10664 471 27 | 8.971 % | | 812 | 686 24038 63195 | 11731 808 29 | 8.971 % | | 1318 | 686 24038 63195 | 12904 1314 32 | 8.971 % | =============================================================================== restarts : 10 conflicts : 1581 (15044 /sec) decisions : 7786 (0.00 % random) (74089 /sec) propagations : 90572 (861852 /sec) conflict literals : 51804 (20.57 % deleted) Memory used : 13.36 MB CPU time : 0.10509 s SATISFIABLE
|
prover.name
|
minisat
|
|
prover.cmd
|
<unknown>
|
|
prover.version
|
<unknown>
|
|
prover.sat
|
^SATISFIABLE
|
|
prover.unsat
|
^UNSATISFIABLE
|
|
prover.unknown
|
INDETERMINATE
|
|
prover.timeout
|
<none>
|
|
prover.memory
|
<none>
|