TSTP Solution File: LCL201-1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : LCL201-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n007.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:36 EDT 2022
% Result : Unsatisfiable 0.14s 0.36s
% Output : Proof 0.14s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ theorem(or(not(not(or(p,q))),or(not(p),q))),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this)]) ).
cnf(g1,plain,
( ~ axiom(or(not(not(or(p,q))),or(q,not(or(p,q)))))
| ~ theorem(or(not(or(q,not(or(p,q)))),or(not(p),q)))
| theorem(or(not(not(or(p,q))),or(not(p),q))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_3)]) ).
cnf(g2,plain,
axiom(or(not(not(or(p,q))),or(q,not(or(p,q))))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_3)]) ).
cnf(g3,plain,
( ~ axiom(or(not(or(not(p),or(not(or(q,not(or(p,q)))),q))),or(not(or(q,not(or(p,q)))),or(not(p),q))))
| ~ theorem(or(not(p),or(not(or(q,not(or(p,q)))),q)))
| theorem(or(not(or(q,not(or(p,q)))),or(not(p),q))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_2)]) ).
cnf(g4,plain,
axiom(or(not(or(not(p),or(not(or(q,not(or(p,q)))),q))),or(not(or(q,not(or(p,q)))),or(not(p),q)))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_5)]) ).
cnf(g5,plain,
( ~ axiom(or(not(or(not(or(q,not(or(p,q)))),or(not(or(p,q)),q))),or(not(or(p,q)),or(not(or(q,not(or(p,q)))),q))))
| ~ theorem(or(not(or(q,not(or(p,q)))),or(not(or(p,q)),q)))
| theorem(or(not(or(p,q)),or(not(or(q,not(or(p,q)))),q))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_2)]) ).
cnf(g6,plain,
axiom(or(not(or(not(or(q,not(or(p,q)))),or(not(or(p,q)),q))),or(not(or(p,q)),or(not(or(q,not(or(p,q)))),q)))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_5)]) ).
cnf(g7,plain,
( ~ axiom(or(not(or(q,not(or(p,q)))),or(not(or(p,q)),q)))
| theorem(or(not(or(q,not(or(p,q)))),or(not(or(p,q)),q))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_1)]) ).
cnf(g8,plain,
axiom(or(not(or(q,not(or(p,q)))),or(not(or(p,q)),q))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_4)]) ).
cnf(g9,plain,
( ~ axiom(or(not(p),or(q,p)))
| ~ theorem(or(not(or(q,p)),or(not(or(q,not(or(p,q)))),q)))
| theorem(or(not(p),or(not(or(q,not(or(p,q)))),q))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_3)]) ).
cnf(g10,plain,
axiom(or(not(p),or(q,p))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_3)]) ).
cnf(g11,plain,
( ~ axiom(or(not(or(q,p)),or(p,q)))
| ~ theorem(or(not(or(p,q)),or(not(or(q,not(or(p,q)))),q)))
| theorem(or(not(or(q,p)),or(not(or(q,not(or(p,q)))),q))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_3)]) ).
cnf(g12,plain,
axiom(or(not(or(q,p)),or(p,q))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_4)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL201-1 : TPTP v8.1.0. Released v1.1.0.
% 0.06/0.13 % Command : satcop --statistics %s
% 0.14/0.34 % Computer : n007.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jul 3 13:34:41 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.36 % symbols: 8
% 0.14/0.36 % clauses: 9
% 0.14/0.36 % start clauses: 1
% 0.14/0.36 % iterative deepening steps: 469
% 0.14/0.36 % maximum path limit: 12
% 0.14/0.36 % literal attempts: 11471
% 0.14/0.36 % depth failures: 2474
% 0.14/0.36 % regularity failures: 112
% 0.14/0.36 % tautology failures: 75
% 0.14/0.36 % reductions: 0
% 0.14/0.36 % extensions: 11078
% 0.14/0.36 % SAT variables: 4491
% 0.14/0.36 % SAT clauses: 5170
% 0.14/0.36 % WalkSAT solutions: 5168
% 0.14/0.36 % CDCL solutions: 0
% 0.14/0.36 % SZS status Unsatisfiable for theBenchmark
% 0.14/0.36 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------