TSTP Solution File: LCL217-1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : LCL217-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n026.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:46 EDT 2022
% Result : Unsatisfiable 0.22s 0.47s
% Output : Proof 0.22s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ theorem(or(not(or(not(p),q)),or(not(or(not(p),not(q))),not(p)))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this)]) ).
cnf(g1,plain,
( ~ axiom(or(not(or(not(or(not(p),not(q))),or(not(or(not(p),q)),not(p)))),or(not(or(not(p),q)),or(not(or(not(p),not(q))),not(p)))))
| ~ theorem(or(not(or(not(p),not(q))),or(not(or(not(p),q)),not(p))))
| theorem(or(not(or(not(p),q)),or(not(or(not(p),not(q))),not(p)))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_2)]) ).
cnf(g2,plain,
axiom(or(not(or(not(or(not(p),not(q))),or(not(or(not(p),q)),not(p)))),or(not(or(not(p),q)),or(not(or(not(p),not(q))),not(p))))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_5)]) ).
cnf(g3,plain,
axiom(or(not(or(not(p),not(q))),or(not(q),not(p)))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_4)]) ).
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(p),not(p))),not(p))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_2)]) ).
cnf(g6,plain,
( ~ axiom(or(not(or(not(p),not(q))),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(not(p),not(q))),or(not(or(not(p),q)),not(p)))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_3)]) ).
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),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(g10,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)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : LCL217-1 : TPTP v8.1.0. Released v1.1.0.
% 0.08/0.14 % Command : satcop --statistics %s
% 0.15/0.36 % Computer : n026.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Sun Jul 3 18:38:06 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.22/0.47 % symbols: 8
% 0.22/0.47 % clauses: 9
% 0.22/0.47 % start clauses: 1
% 0.22/0.47 % iterative deepening steps: 1473
% 0.22/0.47 % maximum path limit: 39
% 0.22/0.47 % literal attempts: 44038
% 0.22/0.47 % depth failures: 3658
% 0.22/0.47 % regularity failures: 568
% 0.22/0.47 % tautology failures: 387
% 0.22/0.47 % reductions: 0
% 0.22/0.47 % extensions: 43050
% 0.22/0.47 % SAT variables: 20256
% 0.22/0.47 % SAT clauses: 23381
% 0.22/0.47 % WalkSAT solutions: 23378
% 0.22/0.47 % CDCL solutions: 0
% 0.22/0.47 % SZS status Unsatisfiable for theBenchmark
% 0.22/0.47 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------