TSTP Solution File: LCL203-1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : LCL203-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n029.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.42s
% Output : Proof 0.20s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ theorem(or(not(not(or(p,q))),or(not(p),not(q)))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this)]) ).
cnf(g1,plain,
( ~ axiom(or(not(or(not(p),or(not(not(or(p,q))),not(q)))),or(not(not(or(p,q))),or(not(p),not(q)))))
| ~ theorem(or(not(p),or(not(not(or(p,q))),not(q))))
| theorem(or(not(not(or(p,q))),or(not(p),not(q)))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_2)]) ).
cnf(g2,plain,
axiom(or(not(or(not(p),or(not(not(or(p,q))),not(q)))),or(not(not(or(p,q))),or(not(p),not(q))))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_5)]) ).
cnf(g3,plain,
( ~ axiom(or(not(or(not(not(or(p,q))),not(q))),or(not(p),or(not(not(or(p,q))),not(q)))))
| ~ theorem(or(not(not(or(p,q))),not(q)))
| theorem(or(not(p),or(not(not(or(p,q))),not(q)))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_2)]) ).
cnf(g4,plain,
axiom(or(not(or(not(not(or(p,q))),not(q))),or(not(p),or(not(not(or(p,q))),not(q))))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_3)]) ).
cnf(g5,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(g6,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(g7,plain,
axiom(or(not(q),or(p,q))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_3)]) ).
cnf(g8,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)))),not(q)))
| theorem(or(not(not(or(p,q))),not(q))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_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(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)]) ).
cnf(g14,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)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : LCL203-1 : TPTP v8.1.0. Released v1.1.0.
% 0.03/0.13 % Command : satcop --statistics %s
% 0.13/0.35 % Computer : n029.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 22:12:12 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.42 % symbols: 8
% 0.20/0.42 % clauses: 9
% 0.20/0.42 % start clauses: 1
% 0.20/0.42 % iterative deepening steps: 930
% 0.20/0.42 % maximum path limit: 23
% 0.20/0.42 % literal attempts: 26468
% 0.20/0.42 % depth failures: 3309
% 0.20/0.42 % regularity failures: 317
% 0.20/0.42 % tautology failures: 205
% 0.20/0.42 % reductions: 0
% 0.20/0.42 % extensions: 25783
% 0.20/0.42 % SAT variables: 10645
% 0.20/0.42 % SAT clauses: 12358
% 0.20/0.42 % WalkSAT solutions: 12353
% 0.20/0.42 % CDCL solutions: 0
% 0.20/0.42 % SZS status Unsatisfiable for theBenchmark
% 0.20/0.42 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------