TSTP Solution File: LCL236-3 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : LCL236-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n008.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:59 EDT 2022
% Result : Unsatisfiable 12.77s 2.00s
% Output : Proof 12.77s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ theorem(implies(or(not(p),not(q)),not(and(p,q)))),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this)]) ).
cnf(g1,plain,
( ~ sPE(or(not(or(not(p),not(q))),not(and(p,q))),implies(or(not(p),not(q)),not(and(p,q))))
| ~ theorem(or(not(or(not(p),not(q))),not(and(p,q))))
| theorem(implies(or(not(p),not(q)),not(and(p,q)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g2,plain,
( ~ sPE(implies(or(not(p),not(q)),not(and(p,q))),or(not(or(not(p),not(q))),not(and(p,q))))
| sPE(or(not(or(not(p),not(q))),not(and(p,q))),implies(or(not(p),not(q)),not(and(p,q)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g3,plain,
sPE(implies(or(not(p),not(q)),not(and(p,q))),or(not(or(not(p),not(q))),not(and(p,q)))),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',implies_definition)]) ).
cnf(g4,plain,
sPE(not(and(p,q)),not(and(p,q))),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g5,plain,
sPE(and(p,q),not(or(not(p),not(q)))),
inference(ground_cnf,[],[file('Axioms/LCL004-1.ax',and_defn)]) ).
cnf(g6,plain,
( ~ theorem(or(not(and(p,q)),not(or(not(p),not(q)))))
| ~ theorem(implies(or(not(and(p,q)),not(or(not(p),not(q)))),or(not(or(not(p),not(q))),not(and(p,q)))))
| theorem(or(not(or(not(p),not(q))),not(and(p,q)))) ),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_2)]) ).
cnf(g7,plain,
( ~ axiom(implies(or(not(and(p,q)),not(or(not(p),not(q)))),or(not(or(not(p),not(q))),not(and(p,q)))))
| theorem(implies(or(not(and(p,q)),not(or(not(p),not(q)))),or(not(or(not(p),not(q))),not(and(p,q))))) ),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_1)]) ).
cnf(g8,plain,
axiom(implies(or(not(and(p,q)),not(or(not(p),not(q)))),or(not(or(not(p),not(q))),not(and(p,q))))),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',axiom_1_4)]) ).
cnf(g9,plain,
( ~ sPE(or(not(and(p,q)),and(p,q)),or(not(and(p,q)),not(or(not(p),not(q)))))
| ~ theorem(or(not(and(p,q)),and(p,q)))
| theorem(or(not(and(p,q)),not(or(not(p),not(q))))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g10,plain,
( ~ sPE(not(and(p,q)),not(and(p,q)))
| ~ sPE(and(p,q),not(or(not(p),not(q))))
| sPE(or(not(and(p,q)),and(p,q)),or(not(and(p,q)),not(or(not(p),not(q))))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g11,plain,
( ~ theorem(or(not(and(p,q)),or(and(p,q),and(p,q))))
| ~ theorem(implies(or(not(and(p,q)),or(and(p,q),and(p,q))),or(not(and(p,q)),and(p,q))))
| theorem(or(not(and(p,q)),and(p,q))) ),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_2)]) ).
cnf(g12,plain,
( ~ theorem(implies(or(and(p,q),and(p,q)),and(p,q)))
| ~ theorem(implies(implies(or(and(p,q),and(p,q)),and(p,q)),implies(or(not(and(p,q)),or(and(p,q),and(p,q))),or(not(and(p,q)),and(p,q)))))
| theorem(implies(or(not(and(p,q)),or(and(p,q),and(p,q))),or(not(and(p,q)),and(p,q)))) ),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_2)]) ).
cnf(g13,plain,
( ~ axiom(implies(or(and(p,q),and(p,q)),and(p,q)))
| theorem(implies(or(and(p,q),and(p,q)),and(p,q))) ),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_1)]) ).
cnf(g14,plain,
axiom(implies(or(and(p,q),and(p,q)),and(p,q))),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',axiom_1_2)]) ).
cnf(g15,plain,
( ~ axiom(implies(implies(or(and(p,q),and(p,q)),and(p,q)),implies(or(not(and(p,q)),or(and(p,q),and(p,q))),or(not(and(p,q)),and(p,q)))))
| theorem(implies(implies(or(and(p,q),and(p,q)),and(p,q)),implies(or(not(and(p,q)),or(and(p,q),and(p,q))),or(not(and(p,q)),and(p,q))))) ),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_1)]) ).
cnf(g16,plain,
axiom(implies(implies(or(and(p,q),and(p,q)),and(p,q)),implies(or(not(and(p,q)),or(and(p,q),and(p,q))),or(not(and(p,q)),and(p,q))))),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',axiom_1_6)]) ).
cnf(g17,plain,
( ~ sPE(implies(and(p,q),or(and(p,q),and(p,q))),or(not(and(p,q)),or(and(p,q),and(p,q))))
| ~ theorem(implies(and(p,q),or(and(p,q),and(p,q))))
| theorem(or(not(and(p,q)),or(and(p,q),and(p,q)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g18,plain,
sPE(implies(and(p,q),or(and(p,q),and(p,q))),or(not(and(p,q)),or(and(p,q),and(p,q)))),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',implies_definition)]) ).
cnf(g19,plain,
( ~ axiom(implies(and(p,q),or(and(p,q),and(p,q))))
| theorem(implies(and(p,q),or(and(p,q),and(p,q)))) ),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_1)]) ).
cnf(g20,plain,
axiom(implies(and(p,q),or(and(p,q),and(p,q)))),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',axiom_1_3)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : LCL236-3 : TPTP v8.1.0. Released v2.3.0.
% 0.08/0.14 % Command : satcop --statistics %s
% 0.15/0.36 % Computer : n008.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 21:47:23 EDT 2022
% 0.15/0.36 % CPUTime :
% 12.77/2.00 % symbols: 10
% 12.77/2.00 % clauses: 19
% 12.77/2.00 % start clauses: 1
% 12.77/2.00 % iterative deepening steps: 3978
% 12.77/2.00 % maximum path limit: 8
% 12.77/2.00 % literal attempts: 1241164
% 12.77/2.00 % depth failures: 603192
% 12.77/2.00 % regularity failures: 71398
% 12.77/2.00 % tautology failures: 144446
% 12.77/2.00 % reductions: 0
% 12.77/2.00 % extensions: 1239068
% 12.77/2.00 % SAT variables: 306557
% 12.77/2.00 % SAT clauses: 513499
% 12.77/2.00 % WalkSAT solutions: 513500
% 12.77/2.00 % CDCL solutions: 0
% 12.77/2.00 % SZS status Unsatisfiable for theBenchmark
% 12.77/2.00 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------