TSTP Solution File: LCL186-1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : LCL186-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 14:13:27 EDT 2022
% Result : Unsatisfiable 0.11s 0.33s
% Output : Proof 0.11s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ theorem(or(not(not(p)),or(not(p),q))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this)]) ).
cnf(g1,plain,
( ~ axiom(or(not(not(p)),or(q,not(p))))
| ~ theorem(or(not(or(q,not(p))),or(not(p),q)))
| theorem(or(not(not(p)),or(not(p),q))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_3)]) ).
cnf(g2,plain,
axiom(or(not(not(p)),or(q,not(p)))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_3)]) ).
cnf(g3,plain,
( ~ axiom(or(not(or(q,not(p))),or(not(p),q)))
| theorem(or(not(or(q,not(p))),or(not(p),q))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_1)]) ).
cnf(g4,plain,
axiom(or(not(or(q,not(p))),or(not(p),q))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_4)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : LCL186-1 : TPTP v8.1.0. Released v1.1.0.
% 0.02/0.12 % Command : satcop --statistics %s
% 0.11/0.33 % Computer : n017.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Sun Jul 3 13:16:26 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.11/0.33 % symbols: 8
% 0.11/0.33 % clauses: 9
% 0.11/0.33 % start clauses: 1
% 0.11/0.33 % iterative deepening steps: 58
% 0.11/0.33 % maximum path limit: 3
% 0.11/0.33 % literal attempts: 549
% 0.11/0.33 % depth failures: 277
% 0.11/0.33 % regularity failures: 1
% 0.11/0.33 % tautology failures: 0
% 0.11/0.33 % reductions: 0
% 0.11/0.33 % extensions: 492
% 0.11/0.33 % SAT variables: 288
% 0.11/0.33 % SAT clauses: 307
% 0.11/0.33 % WalkSAT solutions: 299
% 0.11/0.33 % CDCL solutions: 0
% 0.11/0.33 % SZS status Unsatisfiable for theBenchmark
% 0.11/0.33 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------