%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : LCL321-3 : TPTP v9.3.1. Released v2.3.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 : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon Sep 7 01:03:36 PM UTC 2026
% Result : Unsatisfiable 1.95s 0.65s
% Output : Proof 1.95s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ theorem(or(implies(p,q),implies(p,not(q)))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this)]) ).
cnf(g1,plain,
sPE(implies(p,q),implies(p,q)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g2,plain,
sPE(implies(p,not(q)),or(not(p),not(q))),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',implies_definition)]) ).
cnf(g3,plain,
( ~ sPE(implies(p,not(q)),or(not(p),not(q)))
| sPE(or(not(p),not(q)),implies(p,not(q))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g4,plain,
sPE(implies(p,q),or(not(p),q)),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',implies_definition)]) ).
cnf(g5,plain,
( ~ sPE(implies(p,q),implies(p,q))
| ~ sPE(or(not(p),not(q)),implies(p,not(q)))
| sPE(or(implies(p,q),or(not(p),not(q))),or(implies(p,q),implies(p,not(q)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g6,plain,
( ~ sPE(or(or(not(p),q),or(not(p),not(q))),or(implies(p,q),implies(p,not(q))))
| ~ theorem(or(or(not(p),q),or(not(p),not(q))))
| theorem(or(implies(p,q),implies(p,not(q)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g7,plain,
sPE(or(not(p),not(q)),or(not(p),not(q))),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g8,plain,
( ~ sPE(implies(p,q),or(not(p),q))
| ~ sPE(or(not(p),not(q)),or(not(p),not(q)))
| sPE(or(implies(p,q),or(not(p),not(q))),or(or(not(p),q),or(not(p),not(q)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g9,plain,
axiom(implies(not(q),or(not(p),not(q)))),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',axiom_1_3)]) ).
cnf(g10,plain,
( ~ sPE(or(implies(p,q),or(not(p),not(q))),or(or(not(p),q),or(not(p),not(q))))
| sPE(or(or(not(p),q),or(not(p),not(q))),or(implies(p,q),or(not(p),not(q)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g11,plain,
( ~ theorem(or(not(q),or(not(p),q)))
| ~ theorem(implies(or(not(q),or(not(p),q)),or(or(not(p),q),not(q))))
| theorem(or(or(not(p),q),not(q))) ),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_2)]) ).
cnf(g12,plain,
( ~ sPE(implies(q,or(not(p),q)),or(not(q),or(not(p),q)))
| ~ theorem(implies(q,or(not(p),q)))
| theorem(or(not(q),or(not(p),q))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g13,plain,
( ~ axiom(implies(q,or(not(p),q)))
| theorem(implies(q,or(not(p),q))) ),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_1)]) ).
cnf(g14,plain,
axiom(implies(q,or(not(p),q))),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',axiom_1_3)]) ).
cnf(g15,plain,
sPE(implies(q,or(not(p),q)),or(not(q),or(not(p),q))),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',implies_definition)]) ).
cnf(g16,plain,
( ~ axiom(implies(or(not(q),or(not(p),q)),or(or(not(p),q),not(q))))
| theorem(implies(or(not(q),or(not(p),q)),or(or(not(p),q),not(q)))) ),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_1)]) ).
cnf(g17,plain,
axiom(implies(or(not(q),or(not(p),q)),or(or(not(p),q),not(q)))),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',axiom_1_4)]) ).
cnf(g18,plain,
( ~ sPE(or(or(not(p),q),or(not(p),not(q))),or(implies(p,q),or(not(p),not(q))))
| ~ sPE(or(implies(p,q),or(not(p),not(q))),or(implies(p,q),implies(p,not(q))))
| sPE(or(or(not(p),q),or(not(p),not(q))),or(implies(p,q),implies(p,not(q)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g19,plain,
( ~ axiom(implies(not(q),or(not(p),not(q))))
| theorem(implies(not(q),or(not(p),not(q)))) ),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_1)]) ).
cnf(g20,plain,
( ~ theorem(or(or(not(p),q),not(q)))
| ~ theorem(implies(or(or(not(p),q),not(q)),or(or(not(p),q),or(not(p),not(q)))))
| theorem(or(or(not(p),q),or(not(p),not(q)))) ),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_2)]) ).
cnf(g21,plain,
( ~ theorem(implies(not(q),or(not(p),not(q))))
| ~ theorem(implies(implies(not(q),or(not(p),not(q))),implies(or(or(not(p),q),not(q)),or(or(not(p),q),or(not(p),not(q))))))
| theorem(implies(or(or(not(p),q),not(q)),or(or(not(p),q),or(not(p),not(q))))) ),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_2)]) ).
cnf(g22,plain,
( ~ axiom(implies(implies(not(q),or(not(p),not(q))),implies(or(or(not(p),q),not(q)),or(or(not(p),q),or(not(p),not(q))))))
| theorem(implies(implies(not(q),or(not(p),not(q))),implies(or(or(not(p),q),not(q)),or(or(not(p),q),or(not(p),not(q)))))) ),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_1)]) ).
cnf(g23,plain,
axiom(implies(implies(not(q),or(not(p),not(q))),implies(or(or(not(p),q),not(q)),or(or(not(p),q),or(not(p),not(q)))))),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',axiom_1_6)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL321-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : satcop --statistics %s
% 0.09/0.36 % Computer : n009.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Fri Sep 4 22:33:21 UTC 2026
% 0.09/0.36 % CPUTime :
% 1.95/0.65 % symbols: 9
% 1.95/0.65 % clauses: 17
% 1.95/0.65 % start clauses: 1
% 1.95/0.65 % iterative deepening steps: 1407
% 1.95/0.65 % maximum path limit: 6
% 1.95/0.65 % literal attempts: 222735
% 1.95/0.65 % depth failures: 112462
% 1.95/0.65 % regularity failures: 10170
% 1.95/0.65 % tautology failures: 23469
% 1.95/0.65 % reductions: 0
% 1.95/0.65 % extensions: 221704
% 1.95/0.65 % SAT variables: 51415
% 1.95/0.65 % SAT clauses: 83912
% 1.95/0.65 % WalkSAT solutions: 83911
% 1.95/0.65 % CDCL solutions: 0
% 1.95/0.65 % SZS status Unsatisfiable for theBenchmark
% 1.95/0.65 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------