%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : LCL218-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n019.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:25 PM UTC 2026
% Result : Unsatisfiable 0.15s 0.39s
% Output : Proof 0.15s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ theorem(or(not(or(not(or(p,q)),q)),or(not(p),q))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this)]) ).
cnf(g1,plain,
axiom(or(not(or(not(or(p,q)),q)),or(q,not(or(p,q))))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_4)]) ).
cnf(g2,plain,
axiom(or(not(or(q,not(or(p,q)))),or(not(or(p,q)),q))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_4)]) ).
cnf(g3,plain,
( ~ axiom(or(not(or(not(p),or(not(or(not(or(p,q)),q)),q))),or(not(or(not(or(p,q)),q)),or(not(p),q))))
| ~ theorem(or(not(p),or(not(or(not(or(p,q)),q)),q)))
| theorem(or(not(or(not(or(p,q)),q)),or(not(p),q))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_2)]) ).
cnf(g4,plain,
( ~ axiom(or(not(p),or(q,p)))
| ~ theorem(or(not(or(q,p)),or(not(or(not(or(p,q)),q)),q)))
| theorem(or(not(p),or(not(or(not(or(p,q)),q)),q))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_3)]) ).
cnf(g5,plain,
axiom(or(not(p),or(q,p))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_3)]) ).
cnf(g6,plain,
axiom(or(not(or(not(p),or(not(or(not(or(p,q)),q)),q))),or(not(or(not(or(p,q)),q)),or(not(p),q)))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_5)]) ).
cnf(g7,plain,
axiom(or(not(or(q,p)),or(p,q))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_4)]) ).
cnf(g8,plain,
( ~ axiom(or(not(or(q,p)),or(p,q)))
| ~ theorem(or(not(or(p,q)),or(not(or(not(or(p,q)),q)),q)))
| theorem(or(not(or(q,p)),or(not(or(not(or(p,q)),q)),q))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_3)]) ).
cnf(g9,plain,
( ~ axiom(or(not(or(not(or(not(or(p,q)),q)),or(not(or(p,q)),q))),or(not(or(p,q)),or(not(or(not(or(p,q)),q)),q))))
| ~ theorem(or(not(or(not(or(p,q)),q)),or(not(or(p,q)),q)))
| theorem(or(not(or(p,q)),or(not(or(not(or(p,q)),q)),q))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_2)]) ).
cnf(g10,plain,
axiom(or(not(or(not(or(not(or(p,q)),q)),or(not(or(p,q)),q))),or(not(or(p,q)),or(not(or(not(or(p,q)),q)),q)))),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_5)]) ).
cnf(g11,plain,
( ~ axiom(or(not(or(not(or(p,q)),q)),or(q,not(or(p,q)))))
| ~ theorem(or(not(or(q,not(or(p,q)))),or(not(or(p,q)),q)))
| theorem(or(not(or(not(or(p,q)),q)),or(not(or(p,q)),q))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_3)]) ).
cnf(g12,plain,
( ~ axiom(or(not(or(q,not(or(p,q)))),or(not(or(p,q)),q)))
| theorem(or(not(or(q,not(or(p,q)))),or(not(or(p,q)),q))) ),
inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_1)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL218-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : satcop --statistics %s
% 0.09/0.37 % Computer : n019.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sat Sep 5 15:05:53 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.15/0.39 % symbols: 8
% 0.15/0.39 % clauses: 9
% 0.15/0.39 % start clauses: 1
% 0.15/0.39 % iterative deepening steps: 463
% 0.15/0.39 % maximum path limit: 6
% 0.15/0.39 % literal attempts: 13010
% 0.15/0.39 % depth failures: 3944
% 0.15/0.39 % regularity failures: 213
% 0.15/0.39 % tautology failures: 29
% 0.15/0.39 % reductions: 0
% 0.15/0.39 % extensions: 12602
% 0.15/0.39 % SAT variables: 4784
% 0.15/0.39 % SAT clauses: 5344
% 0.15/0.39 % WalkSAT solutions: 5342
% 0.15/0.39 % CDCL solutions: 0
% 0.15/0.39 % SZS status Unsatisfiable for theBenchmark
% 0.15/0.39 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------