TSTP Solution File: LCL208-1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : LCL208-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n009.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:40 EDT 2022
% Result : Unsatisfiable 0.19s 0.48s
% Output : Proof 0.19s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ theorem(or(not(or(p,q)),or(not(not(p)),q))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this)]) ).
cnf(g1,plain,
( ~ axiom(or(not(or(not(not(p)),or(not(or(p,q)),q))),or(not(or(p,q)),or(not(not(p)),q))))
| ~ theorem(or(not(not(p)),or(not(or(p,q)),q)))
| theorem(or(not(or(p,q)),or(not(not(p)),q))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_2)]) ).
cnf(g2,plain,
axiom(or(not(or(not(not(p)),or(not(or(p,q)),q))),or(not(or(p,q)),or(not(not(p)),q)))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_5)]) ).
cnf(g3,plain,
axiom(or(not(or(p,q)),or(q,p))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_4)]) ).
cnf(g4,plain,
( ~ axiom(or(not(or(q,q)),q))
| theorem(or(not(or(q,q)),q)) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_1)]) ).
cnf(g5,plain,
axiom(or(not(or(q,q)),q)),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_2)]) ).
cnf(g6,plain,
axiom(or(not(or(q,not(p))),or(not(p),q))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_4)]) ).
cnf(g7,plain,
axiom(or(not(not(p)),or(q,not(p)))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_3)]) ).
cnf(g8,plain,
( ~ axiom(or(not(not(p)),or(q,not(p))))
| ~ theorem(or(not(or(q,not(p))),or(not(or(p,q)),q)))
| theorem(or(not(not(p)),or(not(or(p,q)),q))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_3)]) ).
cnf(g9,plain,
( ~ axiom(or(not(or(q,not(p))),or(not(p),q)))
| ~ theorem(or(not(or(not(p),q)),or(not(or(p,q)),q)))
| theorem(or(not(or(q,not(p))),or(not(or(p,q)),q))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_3)]) ).
cnf(g10,plain,
( ~ axiom(or(not(or(not(or(p,q)),or(not(or(not(p),q)),q))),or(not(or(not(p),q)),or(not(or(p,q)),q))))
| ~ theorem(or(not(or(p,q)),or(not(or(not(p),q)),q)))
| theorem(or(not(or(not(p),q)),or(not(or(p,q)),q))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_2)]) ).
cnf(g11,plain,
axiom(or(not(or(not(or(p,q)),or(not(or(not(p),q)),q))),or(not(or(not(p),q)),or(not(or(p,q)),q)))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_5)]) ).
cnf(g12,plain,
( ~ axiom(or(not(or(p,q)),or(q,p)))
| ~ theorem(or(not(or(q,p)),or(not(or(not(p),q)),q)))
| theorem(or(not(or(p,q)),or(not(or(not(p),q)),q))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_3)]) ).
cnf(g13,plain,
( ~ axiom(or(not(or(not(or(not(p),q)),or(not(or(q,p)),q))),or(not(or(q,p)),or(not(or(not(p),q)),q))))
| ~ theorem(or(not(or(not(p),q)),or(not(or(q,p)),q)))
| theorem(or(not(or(q,p)),or(not(or(not(p),q)),q))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_2)]) ).
cnf(g14,plain,
axiom(or(not(or(not(or(not(p),q)),or(not(or(q,p)),q))),or(not(or(q,p)),or(not(or(not(p),q)),q)))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_5)]) ).
cnf(g15,plain,
( ~ axiom(or(not(or(not(p),q)),or(not(or(q,p)),or(q,q))))
| ~ theorem(or(not(or(not(or(q,p)),or(q,q))),or(not(or(q,p)),q)))
| theorem(or(not(or(not(p),q)),or(not(or(q,p)),q))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_3)]) ).
cnf(g16,plain,
( ~ axiom(or(not(or(not(or(q,q)),q)),or(not(or(not(or(q,p)),or(q,q))),or(not(or(q,p)),q))))
| ~ theorem(or(not(or(q,q)),q))
| theorem(or(not(or(not(or(q,p)),or(q,q))),or(not(or(q,p)),q))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_2)]) ).
cnf(g17,plain,
axiom(or(not(or(not(or(q,q)),q)),or(not(or(not(or(q,p)),or(q,q))),or(not(or(q,p)),q)))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_6)]) ).
cnf(g18,plain,
axiom(or(not(or(not(p),q)),or(not(or(q,p)),or(q,q)))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_6)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL208-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.13 % Command : satcop --statistics %s
% 0.12/0.33 % Computer : n009.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jul 2 14:28:37 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.48 % symbols: 8
% 0.19/0.48 % clauses: 9
% 0.19/0.48 % start clauses: 1
% 0.19/0.48 % iterative deepening steps: 2426
% 0.19/0.48 % maximum path limit: 103
% 0.19/0.48 % literal attempts: 87970
% 0.19/0.48 % depth failures: 3534
% 0.19/0.48 % regularity failures: 1742
% 0.19/0.48 % tautology failures: 885
% 0.19/0.48 % reductions: 0
% 0.19/0.48 % extensions: 86404
% 0.19/0.48 % SAT variables: 38514
% 0.19/0.48 % SAT clauses: 44093
% 0.19/0.48 % WalkSAT solutions: 44092
% 0.19/0.48 % CDCL solutions: 0
% 0.19/0.48 % SZS status Unsatisfiable for theBenchmark
% 0.19/0.48 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------