TSTP Solution File: LCL230-1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : LCL230-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n004.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:54 EDT 2022
% Result : Unsatisfiable 0.21s 0.44s
% Output : Proof 0.21s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ theorem(or(not(or(not(or(p,q)),or(p,r))),or(p,or(not(q),r)))),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this)]) ).
cnf(g1,plain,
( ~ axiom(or(not(or(not(or(p,q)),or(p,r))),or(p,or(not(or(p,q)),r))))
| ~ theorem(or(not(or(p,or(not(or(p,q)),r))),or(p,or(not(q),r))))
| theorem(or(not(or(not(or(p,q)),or(p,r))),or(p,or(not(q),r)))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_3)]) ).
cnf(g2,plain,
axiom(or(not(or(not(or(p,q)),or(p,r))),or(p,or(not(or(p,q)),r)))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_5)]) ).
cnf(g3,plain,
( ~ axiom(or(not(or(not(or(not(or(p,q)),r)),or(not(q),r))),or(not(or(p,or(not(or(p,q)),r))),or(p,or(not(q),r)))))
| ~ theorem(or(not(or(not(or(p,q)),r)),or(not(q),r)))
| theorem(or(not(or(p,or(not(or(p,q)),r))),or(p,or(not(q),r)))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_2)]) ).
cnf(g4,plain,
axiom(or(not(or(not(or(not(or(p,q)),r)),or(not(q),r))),or(not(or(p,or(not(or(p,q)),r))),or(p,or(not(q),r))))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_6)]) ).
cnf(g5,plain,
axiom(or(not(q),or(p,q))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_3)]) ).
cnf(g6,plain,
( ~ axiom(or(not(or(not(or(p,q)),r)),or(r,not(or(p,q)))))
| ~ theorem(or(not(or(r,not(or(p,q)))),or(not(q),r)))
| theorem(or(not(or(not(or(p,q)),r)),or(not(q),r))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_3)]) ).
cnf(g7,plain,
axiom(or(not(or(not(or(p,q)),r)),or(r,not(or(p,q))))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_4)]) ).
cnf(g8,plain,
axiom(or(not(or(r,not(or(p,q)))),or(not(or(p,q)),r))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_4)]) ).
cnf(g9,plain,
( ~ axiom(or(not(or(not(q),or(not(or(r,not(or(p,q)))),r))),or(not(or(r,not(or(p,q)))),or(not(q),r))))
| ~ theorem(or(not(q),or(not(or(r,not(or(p,q)))),r)))
| theorem(or(not(or(r,not(or(p,q)))),or(not(q),r))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_2)]) ).
cnf(g10,plain,
axiom(or(not(or(not(q),or(not(or(r,not(or(p,q)))),r))),or(not(or(r,not(or(p,q)))),or(not(q),r)))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_5)]) ).
cnf(g11,plain,
( ~ axiom(or(not(q),or(p,q)))
| ~ theorem(or(not(or(p,q)),or(not(or(r,not(or(p,q)))),r)))
| theorem(or(not(q),or(not(or(r,not(or(p,q)))),r))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_3)]) ).
cnf(g12,plain,
( ~ axiom(or(not(or(not(or(r,not(or(p,q)))),or(not(or(p,q)),r))),or(not(or(p,q)),or(not(or(r,not(or(p,q)))),r))))
| ~ theorem(or(not(or(r,not(or(p,q)))),or(not(or(p,q)),r)))
| theorem(or(not(or(p,q)),or(not(or(r,not(or(p,q)))),r))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_2)]) ).
cnf(g13,plain,
axiom(or(not(or(not(or(r,not(or(p,q)))),or(not(or(p,q)),r))),or(not(or(p,q)),or(not(or(r,not(or(p,q)))),r)))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_5)]) ).
cnf(g14,plain,
( ~ axiom(or(not(or(r,not(or(p,q)))),or(not(or(p,q)),r)))
| theorem(or(not(or(r,not(or(p,q)))),or(not(or(p,q)),r))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_1)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : LCL230-1 : TPTP v8.1.0. Released v1.1.0.
% 0.11/0.13 % Command : satcop --statistics %s
% 0.13/0.35 % Computer : n004.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jul 4 14:36:38 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.44 % symbols: 9
% 0.21/0.44 % clauses: 9
% 0.21/0.44 % start clauses: 1
% 0.21/0.44 % iterative deepening steps: 1473
% 0.21/0.44 % maximum path limit: 43
% 0.21/0.44 % literal attempts: 48090
% 0.21/0.44 % depth failures: 5407
% 0.21/0.44 % regularity failures: 921
% 0.21/0.44 % tautology failures: 257
% 0.21/0.44 % reductions: 0
% 0.21/0.44 % extensions: 46977
% 0.21/0.44 % SAT variables: 23725
% 0.21/0.44 % SAT clauses: 26150
% 0.21/0.44 % WalkSAT solutions: 26151
% 0.21/0.44 % CDCL solutions: 0
% 0.21/0.44 % SZS status Unsatisfiable for theBenchmark
% 0.21/0.44 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------