problem.path
|
|
problem.expected_res
|
unknown
|
res
|
sat
|
rtime
|
0.109s
|
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: 7 | | 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 | 243 1056 3230 | 387 100 17 | 0.002 % | | 250 | 243 1056 3230 | 425 250 17 | 0.002 % | | 475 | 243 1056 3230 | 468 248 15 | 0.002 % | | 812 | 243 1056 3230 | 515 338 12 | 0.002 % | | 1318 | 243 1056 3230 | 566 297 11 | 0.002 % | | 2077 | 243 1056 3230 | 623 467 12 | 0.002 % | | 3216 | 243 1056 3230 | 685 319 10 | 0.002 % | | 4924 | 243 1056 3230 | 754 607 11 | 0.002 % | =============================================================================== restarts : 31 conflicts : 7017 (85635 /sec) decisions : 8793 (0.00 % random) (107309 /sec) propagations : 315855 (3854664 /sec) conflict literals : 97491 (18.40 % deleted) Memory used : 10.50 MB CPU time : 0.081941 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>
|