TSTP Solution File: LCL202-1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : LCL202-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n020.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:37 EDT 2022
% Result : Unsatisfiable 0.20s 0.43s
% Output : Proof 0.20s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ theorem(or(not(not(or(p,q))),or(p,not(q)))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this)]) ).
cnf(g1,plain,
( ~ axiom(or(not(not(or(p,q))),or(not(or(p,q)),not(or(p,q)))))
| ~ theorem(or(not(or(not(or(p,q)),not(or(p,q)))),or(p,not(q))))
| theorem(or(not(not(or(p,q))),or(p,not(q)))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_3)]) ).
cnf(g2,plain,
axiom(or(not(not(or(p,q))),or(not(or(p,q)),not(or(p,q))))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_3)]) ).
cnf(g3,plain,
axiom(or(not(or(not(or(p,q)),not(or(p,q)))),not(or(p,q)))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_2)]) ).
cnf(g4,plain,
( ~ axiom(or(not(or(p,or(not(or(not(or(p,q)),not(or(p,q)))),not(q)))),or(not(or(not(or(p,q)),not(or(p,q)))),or(p,not(q)))))
| ~ theorem(or(p,or(not(or(not(or(p,q)),not(or(p,q)))),not(q))))
| theorem(or(not(or(not(or(p,q)),not(or(p,q)))),or(p,not(q)))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_2)]) ).
cnf(g5,plain,
axiom(or(not(or(p,or(not(or(not(or(p,q)),not(or(p,q)))),not(q)))),or(not(or(not(or(p,q)),not(or(p,q)))),or(p,not(q))))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_5)]) ).
cnf(g6,plain,
( ~ axiom(or(not(or(not(or(not(or(p,q)),not(or(p,q)))),not(q))),or(p,or(not(or(not(or(p,q)),not(or(p,q)))),not(q)))))
| ~ theorem(or(not(or(not(or(p,q)),not(or(p,q)))),not(q)))
| theorem(or(p,or(not(or(not(or(p,q)),not(or(p,q)))),not(q)))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_2)]) ).
cnf(g7,plain,
axiom(or(not(or(not(or(not(or(p,q)),not(or(p,q)))),not(q))),or(p,or(not(or(not(or(p,q)),not(or(p,q)))),not(q))))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_3)]) ).
cnf(g8,plain,
axiom(or(not(q),or(p,q))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_3)]) ).
cnf(g9,plain,
( ~ axiom(or(not(or(not(q),not(or(not(or(p,q)),not(or(p,q)))))),or(not(or(not(or(p,q)),not(or(p,q)))),not(q))))
| ~ theorem(or(not(q),not(or(not(or(p,q)),not(or(p,q))))))
| theorem(or(not(or(not(or(p,q)),not(or(p,q)))),not(q))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_2)]) ).
cnf(g10,plain,
axiom(or(not(or(not(q),not(or(not(or(p,q)),not(or(p,q)))))),or(not(or(not(or(p,q)),not(or(p,q)))),not(q)))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_4)]) ).
cnf(g11,plain,
( ~ axiom(or(not(q),or(p,q)))
| ~ theorem(or(not(or(p,q)),not(or(not(or(p,q)),not(or(p,q))))))
| theorem(or(not(q),not(or(not(or(p,q)),not(or(p,q)))))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_3)]) ).
cnf(g12,plain,
( ~ axiom(or(not(or(not(or(not(or(p,q)),not(or(p,q)))),not(or(p,q)))),or(not(or(p,q)),not(or(not(or(p,q)),not(or(p,q)))))))
| ~ theorem(or(not(or(not(or(p,q)),not(or(p,q)))),not(or(p,q))))
| theorem(or(not(or(p,q)),not(or(not(or(p,q)),not(or(p,q)))))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_2)]) ).
cnf(g13,plain,
( ~ axiom(or(not(or(not(or(p,q)),not(or(p,q)))),not(or(p,q))))
| theorem(or(not(or(not(or(p,q)),not(or(p,q)))),not(or(p,q)))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_1)]) ).
cnf(g14,plain,
axiom(or(not(or(not(or(not(or(p,q)),not(or(p,q)))),not(or(p,q)))),or(not(or(p,q)),not(or(not(or(p,q)),not(or(p,q))))))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_4)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL202-1 : TPTP v8.1.0. Released v1.1.0.
% 0.12/0.12 % Command : satcop --statistics %s
% 0.14/0.34 % Computer : n020.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:46:15 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.43 % symbols: 8
% 0.20/0.43 % clauses: 9
% 0.20/0.43 % start clauses: 1
% 0.20/0.43 % iterative deepening steps: 1031
% 0.20/0.43 % maximum path limit: 22
% 0.20/0.43 % literal attempts: 34485
% 0.20/0.43 % depth failures: 5401
% 0.20/0.43 % regularity failures: 632
% 0.20/0.43 % tautology failures: 202
% 0.20/0.43 % reductions: 0
% 0.20/0.43 % extensions: 33688
% 0.20/0.43 % SAT variables: 13825
% 0.20/0.43 % SAT clauses: 15409
% 0.20/0.43 % WalkSAT solutions: 15407
% 0.20/0.43 % CDCL solutions: 0
% 0.20/0.43 % SZS status Unsatisfiable for theBenchmark
% 0.20/0.43 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------