%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : LCL197-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n004.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:22 PM UTC 2026
% Result : Unsatisfiable 0.13s 0.45s
% Output : Proof 0.13s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ theorem(implies(or(q,or(p,q)),or(p,q))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this)]) ).
cnf(g1,plain,
sPE(implies(or(q,or(p,q)),or(p,q)),or(not(or(q,or(p,q))),or(p,q))),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',implies_definition)]) ).
cnf(g2,plain,
( ~ axiom(implies(or(q,q),q))
| theorem(implies(or(q,q),q)) ),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_1)]) ).
cnf(g3,plain,
axiom(implies(or(q,q),q)),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',axiom_1_2)]) ).
cnf(g4,plain,
( ~ axiom(implies(or(q,or(p,q)),or(p,or(q,q))))
| theorem(implies(or(q,or(p,q)),or(p,or(q,q)))) ),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_1)]) ).
cnf(g5,plain,
axiom(implies(or(q,or(p,q)),or(p,or(q,q)))),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',axiom_1_5)]) ).
cnf(g6,plain,
sPE(implies(or(q,or(p,q)),or(p,or(q,q))),or(not(or(q,or(p,q))),or(p,or(q,q)))),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',implies_definition)]) ).
cnf(g7,plain,
( ~ theorem(implies(or(q,q),q))
| ~ theorem(implies(implies(or(q,q),q),implies(or(p,or(q,q)),or(p,q))))
| theorem(implies(or(p,or(q,q)),or(p,q))) ),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_2)]) ).
cnf(g8,plain,
( ~ axiom(implies(implies(or(q,q),q),implies(or(p,or(q,q)),or(p,q))))
| theorem(implies(implies(or(q,q),q),implies(or(p,or(q,q)),or(p,q)))) ),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_1)]) ).
cnf(g9,plain,
axiom(implies(implies(or(q,q),q),implies(or(p,or(q,q)),or(p,q)))),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',axiom_1_6)]) ).
cnf(g10,plain,
( ~ theorem(implies(or(q,or(p,q)),or(p,or(q,q))))
| ~ theorem(implies(implies(or(q,or(p,q)),or(p,or(q,q))),implies(or(q,or(p,q)),or(p,q))))
| theorem(implies(or(q,or(p,q)),or(p,q))) ),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_2)]) ).
cnf(g11,plain,
( ~ sPE(implies(or(not(or(q,or(p,q))),or(p,or(q,q))),or(not(or(q,or(p,q))),or(p,q))),implies(implies(or(q,or(p,q)),or(p,or(q,q))),implies(or(q,or(p,q)),or(p,q))))
| ~ theorem(implies(or(not(or(q,or(p,q))),or(p,or(q,q))),or(not(or(q,or(p,q))),or(p,q))))
| theorem(implies(implies(or(q,or(p,q)),or(p,or(q,q))),implies(or(q,or(p,q)),or(p,q)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g12,plain,
( ~ sPE(implies(implies(or(q,or(p,q)),or(p,or(q,q))),implies(or(q,or(p,q)),or(p,q))),implies(or(not(or(q,or(p,q))),or(p,or(q,q))),or(not(or(q,or(p,q))),or(p,q))))
| sPE(implies(or(not(or(q,or(p,q))),or(p,or(q,q))),or(not(or(q,or(p,q))),or(p,q))),implies(implies(or(q,or(p,q)),or(p,or(q,q))),implies(or(q,or(p,q)),or(p,q)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g13,plain,
( ~ sPE(implies(or(q,or(p,q)),or(p,or(q,q))),or(not(or(q,or(p,q))),or(p,or(q,q))))
| ~ sPE(implies(or(q,or(p,q)),or(p,q)),or(not(or(q,or(p,q))),or(p,q)))
| sPE(implies(implies(or(q,or(p,q)),or(p,or(q,q))),implies(or(q,or(p,q)),or(p,q))),implies(or(not(or(q,or(p,q))),or(p,or(q,q))),or(not(or(q,or(p,q))),or(p,q)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g14,plain,
( ~ theorem(implies(or(p,or(q,q)),or(p,q)))
| ~ theorem(implies(implies(or(p,or(q,q)),or(p,q)),implies(or(not(or(q,or(p,q))),or(p,or(q,q))),or(not(or(q,or(p,q))),or(p,q)))))
| theorem(implies(or(not(or(q,or(p,q))),or(p,or(q,q))),or(not(or(q,or(p,q))),or(p,q)))) ),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_2)]) ).
cnf(g15,plain,
( ~ axiom(implies(implies(or(p,or(q,q)),or(p,q)),implies(or(not(or(q,or(p,q))),or(p,or(q,q))),or(not(or(q,or(p,q))),or(p,q)))))
| theorem(implies(implies(or(p,or(q,q)),or(p,q)),implies(or(not(or(q,or(p,q))),or(p,or(q,q))),or(not(or(q,or(p,q))),or(p,q))))) ),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_1)]) ).
cnf(g16,plain,
axiom(implies(implies(or(p,or(q,q)),or(p,q)),implies(or(not(or(q,or(p,q))),or(p,or(q,q))),or(not(or(q,or(p,q))),or(p,q))))),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',axiom_1_6)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL197-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : satcop --statistics %s
% 0.11/0.36 % Computer : n004.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Sat Sep 5 13:34:14 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.13/0.45 % symbols: 9
% 0.13/0.45 % clauses: 17
% 0.13/0.45 % start clauses: 1
% 0.13/0.45 % iterative deepening steps: 564
% 0.13/0.45 % maximum path limit: 8
% 0.13/0.45 % literal attempts: 59063
% 0.13/0.45 % depth failures: 29415
% 0.13/0.45 % regularity failures: 2999
% 0.13/0.45 % tautology failures: 6192
% 0.13/0.45 % reductions: 0
% 0.13/0.45 % extensions: 58762
% 0.13/0.45 % SAT variables: 17047
% 0.13/0.45 % SAT clauses: 27531
% 0.13/0.45 % WalkSAT solutions: 27530
% 0.13/0.45 % CDCL solutions: 0
% 0.13/0.45 % SZS status Unsatisfiable for theBenchmark
% 0.13/0.45 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------