|
problem.path
|
|
|
problem.expected_res
|
unknown
|
|
res
|
sat
|
|
rtime
|
0.059s
|
|
stime
|
0.000s
|
|
utime
|
0.000s
|
|
errcode
|
10
|
WARNING: for repeatability, setting FPU to use double precision ============================[ Problem Statistics ]============================= | | | Number of variables: 250 | | Number of clauses: 1065 | | Parse time: 0.00 s | | Eliminated vars: 13 | | Vars set : 0 | | Eliminated clauses: 0.00 Mb | | Simplification time: 0.00 s | | | ============================[ Search Statistics ]============================== | Conflicts | ORIGINAL | LEARNT | Progress | | | Vars Clauses Literals | Limit Clauses Lit/Cl | | =============================================================================== | 100 | 237 1047 3258 | 383 100 18 | 0.002 % | | 250 | 237 1047 3258 | 422 250 17 | 0.002 % | | 475 | 237 1047 3258 | 464 252 14 | 0.002 % | | 812 | 237 1047 3258 | 510 344 13 | 0.002 % | | 1318 | 237 1047 3258 | 562 317 11 | 0.002 % | | 2077 | 237 1047 3258 | 618 482 12 | 0.002 % | =============================================================================== restarts : 15 conflicts : 2777 (77735 /sec) decisions : 3599 (0.00 % random) (100745 /sec) propagations : 120938 (3385343 /sec) conflict literals : 40776 (15.65 % deleted) Memory used : 10.50 MB CPU time : 0.035724 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>
|