%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : LCL204-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n027.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:23 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.44s
% Output : Proof 0.10s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ theorem(or(not(not(or(not(p),q))),or(not(not(p)),q))),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this)]) ).
cnf(g1,plain,
axiom(or(not(or(q,not(p))),or(not(p),q))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_4)]) ).
cnf(g2,plain,
axiom(or(not(not(p)),or(q,not(p)))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_3)]) ).
cnf(g3,plain,
( ~ axiom(or(not(not(or(not(p),q))),or(q,not(or(not(p),q)))))
| ~ theorem(or(not(or(q,not(or(not(p),q)))),or(not(not(p)),q)))
| theorem(or(not(not(or(not(p),q))),or(not(not(p)),q))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_3)]) ).
cnf(g4,plain,
axiom(or(not(not(or(not(p),q))),or(q,not(or(not(p),q))))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_3)]) ).
cnf(g5,plain,
( ~ axiom(or(not(or(not(not(p)),or(not(or(q,not(or(not(p),q)))),q))),or(not(or(q,not(or(not(p),q)))),or(not(not(p)),q))))
| ~ theorem(or(not(not(p)),or(not(or(q,not(or(not(p),q)))),q)))
| theorem(or(not(or(q,not(or(not(p),q)))),or(not(not(p)),q))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_2)]) ).
cnf(g6,plain,
axiom(or(not(or(not(not(p)),or(not(or(q,not(or(not(p),q)))),q))),or(not(or(q,not(or(not(p),q)))),or(not(not(p)),q)))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_5)]) ).
cnf(g7,plain,
( ~ axiom(or(not(or(not(or(q,not(or(not(p),q)))),or(not(or(not(p),q)),q))),or(not(or(not(p),q)),or(not(or(q,not(or(not(p),q)))),q))))
| ~ theorem(or(not(or(q,not(or(not(p),q)))),or(not(or(not(p),q)),q)))
| theorem(or(not(or(not(p),q)),or(not(or(q,not(or(not(p),q)))),q))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_2)]) ).
cnf(g8,plain,
axiom(or(not(or(not(or(q,not(or(not(p),q)))),or(not(or(not(p),q)),q))),or(not(or(not(p),q)),or(not(or(q,not(or(not(p),q)))),q)))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_5)]) ).
cnf(g9,plain,
( ~ axiom(or(not(or(q,not(or(not(p),q)))),or(not(or(not(p),q)),q)))
| theorem(or(not(or(q,not(or(not(p),q)))),or(not(or(not(p),q)),q))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_1)]) ).
cnf(g10,plain,
axiom(or(not(or(q,not(or(not(p),q)))),or(not(or(not(p),q)),q))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_4)]) ).
cnf(g11,plain,
( ~ axiom(or(not(not(p)),or(q,not(p))))
| ~ theorem(or(not(or(q,not(p))),or(not(or(q,not(or(not(p),q)))),q)))
| theorem(or(not(not(p)),or(not(or(q,not(or(not(p),q)))),q))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_3)]) ).
cnf(g12,plain,
( ~ axiom(or(not(or(q,not(p))),or(not(p),q)))
| ~ theorem(or(not(or(not(p),q)),or(not(or(q,not(or(not(p),q)))),q)))
| theorem(or(not(or(q,not(p))),or(not(or(q,not(or(not(p),q)))),q))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_3)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL204-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : satcop --statistics %s
% 0.10/0.36 % Computer : n027.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 : Sat Sep 5 03:06:42 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.44 % symbols: 8
% 0.10/0.44 % clauses: 9
% 0.10/0.44 % start clauses: 1
% 0.10/0.44 % iterative deepening steps: 1266
% 0.10/0.44 % maximum path limit: 28
% 0.10/0.44 % literal attempts: 44188
% 0.10/0.44 % depth failures: 4114
% 0.10/0.44 % regularity failures: 711
% 0.10/0.44 % tautology failures: 368
% 0.10/0.44 % reductions: 0
% 0.10/0.44 % extensions: 43279
% 0.10/0.44 % SAT variables: 20366
% 0.10/0.44 % SAT clauses: 23223
% 0.10/0.44 % WalkSAT solutions: 23220
% 0.10/0.44 % CDCL solutions: 0
% 0.10/0.44 % SZS status Unsatisfiable for theBenchmark
% 0.10/0.44 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------