%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : LCL186-1 : TPTP v9.3.1. Released v1.1.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 : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon Sep 7 01:03:19 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.37s
% Output : Proof 0.10s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ theorem(or(not(not(p)),or(not(p),q))),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this)]) ).
cnf(g1,plain,
( ~ axiom(or(not(not(p)),or(q,not(p))))
| ~ theorem(or(not(or(q,not(p))),or(not(p),q)))
| theorem(or(not(not(p)),or(not(p),q))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_3)]) ).
cnf(g2,plain,
( ~ axiom(or(not(or(q,not(p))),or(not(p),q)))
| theorem(or(not(or(q,not(p))),or(not(p),q))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_1)]) ).
cnf(g3,plain,
axiom(or(not(or(q,not(p))),or(not(p),q))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_4)]) ).
cnf(g4,plain,
axiom(or(not(not(p)),or(q,not(p)))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_3)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL186-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : satcop --statistics %s
% 0.10/0.36 % Computer : n008.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 23:44:53 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 % symbols: 8
% 0.10/0.37 % clauses: 9
% 0.10/0.37 % start clauses: 1
% 0.10/0.37 % iterative deepening steps: 51
% 0.10/0.37 % maximum path limit: 3
% 0.10/0.37 % literal attempts: 482
% 0.10/0.37 % depth failures: 245
% 0.10/0.37 % regularity failures: 1
% 0.10/0.37 % tautology failures: 0
% 0.10/0.37 % reductions: 0
% 0.10/0.37 % extensions: 432
% 0.10/0.37 % SAT variables: 254
% 0.10/0.37 % SAT clauses: 270
% 0.10/0.37 % WalkSAT solutions: 263
% 0.10/0.37 % CDCL solutions: 0
% 0.10/0.37 % SZS status Unsatisfiable for theBenchmark
% 0.10/0.37 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------