%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : LCL186-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n017.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:20 PM UTC 2026
% Result : Unsatisfiable 4.16s 1.03s
% Output : Proof 4.16s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ theorem(implies(not(p),implies(p,q))),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this)]) ).
cnf(g1,plain,
sPE(not(p),not(p)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g2,plain,
sPE(implies(p,q),or(not(p),q)),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',implies_definition)]) ).
cnf(g3,plain,
sPE(implies(not(p),or(not(p),q)),or(not(not(p)),or(not(p),q))),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',implies_definition)]) ).
cnf(g4,plain,
( ~ sPE(not(p),not(p))
| ~ sPE(implies(p,q),or(not(p),q))
| sPE(implies(not(p),implies(p,q)),implies(not(p),or(not(p),q))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g5,plain,
( ~ axiom(implies(or(q,not(p)),or(not(p),q)))
| theorem(implies(or(q,not(p)),or(not(p),q))) ),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_1)]) ).
cnf(g6,plain,
axiom(implies(or(q,not(p)),or(not(p),q))),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',axiom_1_4)]) ).
cnf(g7,plain,
( ~ sPE(or(not(not(p)),or(not(p),q)),implies(not(p),implies(p,q)))
| ~ theorem(or(not(not(p)),or(not(p),q)))
| theorem(implies(not(p),implies(p,q))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g8,plain,
( ~ sPE(implies(not(p),implies(p,q)),or(not(not(p)),or(not(p),q)))
| sPE(or(not(not(p)),or(not(p),q)),implies(not(p),implies(p,q))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g9,plain,
( ~ sPE(implies(not(p),implies(p,q)),implies(not(p),or(not(p),q)))
| ~ sPE(implies(not(p),or(not(p),q)),or(not(not(p)),or(not(p),q)))
| sPE(implies(not(p),implies(p,q)),or(not(not(p)),or(not(p),q))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g10,plain,
( ~ theorem(or(not(not(p)),or(q,not(p))))
| ~ theorem(implies(or(not(not(p)),or(q,not(p))),or(not(not(p)),or(not(p),q))))
| theorem(or(not(not(p)),or(not(p),q))) ),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_2)]) ).
cnf(g11,plain,
( ~ theorem(implies(or(q,not(p)),or(not(p),q)))
| ~ theorem(implies(implies(or(q,not(p)),or(not(p),q)),implies(or(not(not(p)),or(q,not(p))),or(not(not(p)),or(not(p),q)))))
| theorem(implies(or(not(not(p)),or(q,not(p))),or(not(not(p)),or(not(p),q)))) ),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_2)]) ).
cnf(g12,plain,
( ~ axiom(implies(implies(or(q,not(p)),or(not(p),q)),implies(or(not(not(p)),or(q,not(p))),or(not(not(p)),or(not(p),q)))))
| theorem(implies(implies(or(q,not(p)),or(not(p),q)),implies(or(not(not(p)),or(q,not(p))),or(not(not(p)),or(not(p),q))))) ),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_1)]) ).
cnf(g13,plain,
axiom(implies(implies(or(q,not(p)),or(not(p),q)),implies(or(not(not(p)),or(q,not(p))),or(not(not(p)),or(not(p),q))))),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',axiom_1_6)]) ).
cnf(g14,plain,
( ~ axiom(or(not(not(p)),or(q,not(p))))
| theorem(or(not(not(p)),or(q,not(p)))) ),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_1)]) ).
cnf(g15,plain,
( ~ sPE(implies(not(p),or(q,not(p))),or(not(not(p)),or(q,not(p))))
| ~ axiom(implies(not(p),or(q,not(p))))
| axiom(or(not(not(p)),or(q,not(p)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g16,plain,
sPE(implies(not(p),or(q,not(p))),or(not(not(p)),or(q,not(p)))),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',implies_definition)]) ).
cnf(g17,plain,
axiom(implies(not(p),or(q,not(p)))),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',axiom_1_3)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL186-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.03 % Command : satcop --statistics %s
% 0.10/0.36 % Computer : n017.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Fri Sep 4 19:05:21 UTC 2026
% 0.10/0.36 % CPUTime :
% 4.16/1.03 % symbols: 9
% 4.16/1.03 % clauses: 17
% 4.16/1.03 % start clauses: 1
% 4.16/1.03 % iterative deepening steps: 2212
% 4.16/1.03 % maximum path limit: 7
% 4.16/1.03 % literal attempts: 483539
% 4.16/1.03 % depth failures: 232977
% 4.16/1.03 % regularity failures: 25222
% 4.16/1.03 % tautology failures: 47109
% 4.16/1.03 % reductions: 0
% 4.16/1.03 % extensions: 482118
% 4.16/1.03 % SAT variables: 104747
% 4.16/1.03 % SAT clauses: 176295
% 4.16/1.03 % WalkSAT solutions: 176294
% 4.16/1.03 % CDCL solutions: 0
% 4.16/1.03 % SZS status Unsatisfiable for theBenchmark
% 4.16/1.03 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------