TSTP Solution File: LCL182-1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : LCL182-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:24 EDT 2022
% Result : Unsatisfiable 0.12s 0.35s
% Output : Proof 0.12s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ theorem(or(not(or(not(p),q)),or(not(not(q)),not(p)))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this)]) ).
cnf(g1,plain,
axiom(or(not(or(not(p),not(p))),not(p))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_2)]) ).
cnf(g2,plain,
( ~ axiom(or(not(or(not(not(q)),or(not(or(not(p),q)),not(p)))),or(not(or(not(p),q)),or(not(not(q)),not(p)))))
| ~ theorem(or(not(not(q)),or(not(or(not(p),q)),not(p))))
| theorem(or(not(or(not(p),q)),or(not(not(q)),not(p)))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_2)]) ).
cnf(g3,plain,
axiom(or(not(or(not(not(q)),or(not(or(not(p),q)),not(p)))),or(not(or(not(p),q)),or(not(not(q)),not(p))))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_5)]) ).
cnf(g4,plain,
( ~ axiom(or(not(or(not(p),not(p))),not(p)))
| theorem(or(not(or(not(p),not(p))),not(p))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_1)]) ).
cnf(g5,plain,
( ~ axiom(or(not(or(not(q),not(p))),or(not(or(not(p),q)),or(not(p),not(p)))))
| ~ theorem(or(not(or(not(or(not(p),q)),or(not(p),not(p)))),or(not(or(not(p),q)),not(p))))
| theorem(or(not(or(not(q),not(p))),or(not(or(not(p),q)),not(p)))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_3)]) ).
cnf(g6,plain,
axiom(or(not(or(not(q),not(p))),or(not(or(not(p),q)),or(not(p),not(p))))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_6)]) ).
cnf(g7,plain,
( ~ axiom(or(not(or(not(or(not(p),not(p))),not(p))),or(not(or(not(or(not(p),q)),or(not(p),not(p)))),or(not(or(not(p),q)),not(p)))))
| ~ theorem(or(not(or(not(p),not(p))),not(p)))
| theorem(or(not(or(not(or(not(p),q)),or(not(p),not(p)))),or(not(or(not(p),q)),not(p)))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_2)]) ).
cnf(g8,plain,
axiom(or(not(or(not(or(not(p),not(p))),not(p))),or(not(or(not(or(not(p),q)),or(not(p),not(p)))),or(not(or(not(p),q)),not(p))))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_6)]) ).
cnf(g9,plain,
( ~ axiom(or(not(or(not(q),or(or(not(q),not(p)),not(p)))),or(or(not(q),not(p)),or(not(q),not(p)))))
| ~ theorem(or(not(or(or(not(q),not(p)),or(not(q),not(p)))),or(not(or(not(p),q)),not(p))))
| theorem(or(not(or(not(q),or(or(not(q),not(p)),not(p)))),or(not(or(not(p),q)),not(p)))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_3)]) ).
cnf(g10,plain,
axiom(or(not(or(not(q),or(or(not(q),not(p)),not(p)))),or(or(not(q),not(p)),or(not(q),not(p))))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_5)]) ).
cnf(g11,plain,
( ~ axiom(or(not(or(or(not(q),not(p)),or(not(q),not(p)))),or(not(q),not(p))))
| ~ theorem(or(not(or(not(q),not(p))),or(not(or(not(p),q)),not(p))))
| theorem(or(not(or(or(not(q),not(p)),or(not(q),not(p)))),or(not(or(not(p),q)),not(p)))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_3)]) ).
cnf(g12,plain,
axiom(or(not(or(or(not(q),not(p)),or(not(q),not(p)))),or(not(q),not(p)))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_2)]) ).
cnf(g13,plain,
( ~ axiom(or(not(not(q)),or(or(or(not(q),not(p)),not(p)),not(q))))
| ~ theorem(or(not(or(or(or(not(q),not(p)),not(p)),not(q))),or(not(or(not(p),q)),not(p))))
| theorem(or(not(not(q)),or(not(or(not(p),q)),not(p)))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_3)]) ).
cnf(g14,plain,
axiom(or(not(not(q)),or(or(or(not(q),not(p)),not(p)),not(q)))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_3)]) ).
cnf(g15,plain,
( ~ axiom(or(not(or(or(or(not(q),not(p)),not(p)),not(q))),or(not(q),or(or(not(q),not(p)),not(p)))))
| ~ theorem(or(not(or(not(q),or(or(not(q),not(p)),not(p)))),or(not(or(not(p),q)),not(p))))
| theorem(or(not(or(or(or(not(q),not(p)),not(p)),not(q))),or(not(or(not(p),q)),not(p)))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_3)]) ).
cnf(g16,plain,
axiom(or(not(or(or(or(not(q),not(p)),not(p)),not(q))),or(not(q),or(or(not(q),not(p)),not(p))))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_4)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : LCL182-1 : TPTP v8.1.0. Released v1.1.0.
% 0.06/0.12 % Command : satcop --statistics %s
% 0.12/0.32 % Computer : n009.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Mon Jul 4 17:29:22 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.12/0.35 % symbols: 8
% 0.12/0.35 % clauses: 9
% 0.12/0.35 % start clauses: 1
% 0.12/0.35 % iterative deepening steps: 797
% 0.12/0.35 % maximum path limit: 21
% 0.12/0.35 % literal attempts: 22547
% 0.12/0.35 % depth failures: 3480
% 0.12/0.35 % regularity failures: 279
% 0.12/0.35 % tautology failures: 147
% 0.12/0.35 % reductions: 0
% 0.12/0.35 % extensions: 21955
% 0.12/0.35 % SAT variables: 10459
% 0.12/0.35 % SAT clauses: 11966
% 0.12/0.35 % WalkSAT solutions: 11966
% 0.12/0.35 % CDCL solutions: 0
% 0.12/0.35 % SZS status Unsatisfiable for theBenchmark
% 0.12/0.35 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------