%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : LCL453+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n006.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:53 PM UTC 2026
% Result : Theorem 8.15s 1.49s
% Output : Proof 8.15s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ cn3,
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',luka_cn3)]) ).
cnf(g1,plain,
( ~ is_a_theorem(implies(implies(not(sK43),sK43),sK43))
| cn3 ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',cn3)]) ).
cnf(g2,plain,
modus_ponens,
inference(ground_cnf,[],[file('Axioms/LCL006+2.ax',hilbert_modus_ponens)]) ).
cnf(g3,plain,
sPE(sK43,sK43),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g4,plain,
implies_1,
inference(ground_cnf,[],[file('Axioms/LCL006+2.ax',hilbert_implies_1)]) ).
cnf(g5,plain,
implies_2,
inference(ground_cnf,[],[file('Axioms/LCL006+2.ax',hilbert_implies_2)]) ).
cnf(g6,plain,
or_3,
inference(ground_cnf,[],[file('Axioms/LCL006+2.ax',hilbert_or_3)]) ).
cnf(g7,plain,
( ~ sPE(implies(not(and(not(sK43),not(sK43))),sK43),implies(implies(not(sK43),sK43),sK43))
| ~ is_a_theorem(implies(not(and(not(sK43),not(sK43))),sK43))
| is_a_theorem(implies(implies(not(sK43),sK43),sK43)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g8,plain,
( ~ op_implies_and
| sPE(implies(not(sK43),sK43),not(and(not(sK43),not(sK43)))) ),
inference(ground_cnf,[],[file('Axioms/LCL006+1.ax',op_implies_and)]) ).
cnf(g9,plain,
op_implies_and,
inference(ground_cnf,[],[file('Axioms/LCL006+2.ax',hilbert_op_implies_and)]) ).
cnf(g10,plain,
( ~ sPE(implies(implies(not(sK43),sK43),sK43),implies(not(and(not(sK43),not(sK43))),sK43))
| sPE(implies(not(and(not(sK43),not(sK43))),sK43),implies(implies(not(sK43),sK43),sK43)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g11,plain,
( ~ sPE(implies(not(sK43),sK43),not(and(not(sK43),not(sK43))))
| ~ sPE(sK43,sK43)
| sPE(implies(implies(not(sK43),sK43),sK43),implies(not(and(not(sK43),not(sK43))),sK43)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g12,plain,
( ~ sPE(implies(or(sK43,sK43),sK43),implies(not(and(not(sK43),not(sK43))),sK43))
| ~ is_a_theorem(implies(or(sK43,sK43),sK43))
| is_a_theorem(implies(not(and(not(sK43),not(sK43))),sK43)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g13,plain,
( ~ sPE(or(sK43,sK43),not(and(not(sK43),not(sK43))))
| ~ sPE(sK43,sK43)
| sPE(implies(or(sK43,sK43),sK43),implies(not(and(not(sK43),not(sK43))),sK43)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g14,plain,
( ~ op_or
| sPE(or(sK43,sK43),not(and(not(sK43),not(sK43)))) ),
inference(ground_cnf,[],[file('Axioms/LCL006+1.ax',op_or)]) ).
cnf(g15,plain,
op_or,
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',luka_op_or)]) ).
cnf(g16,plain,
( ~ modus_ponens
| ~ is_a_theorem(implies(sK43,implies(sK43,sK43)))
| ~ is_a_theorem(implies(implies(sK43,implies(sK43,sK43)),implies(sK43,sK43)))
| is_a_theorem(implies(sK43,sK43)) ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',modus_ponens)]) ).
cnf(g17,plain,
( ~ implies_1
| is_a_theorem(implies(sK43,implies(sK43,sK43))) ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',implies_1)]) ).
cnf(g18,plain,
( ~ implies_2
| is_a_theorem(implies(implies(sK43,implies(sK43,sK43)),implies(sK43,sK43))) ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',implies_2)]) ).
cnf(g19,plain,
( ~ modus_ponens
| ~ is_a_theorem(implies(sK43,sK43))
| ~ is_a_theorem(implies(implies(sK43,sK43),implies(or(sK43,sK43),sK43)))
| is_a_theorem(implies(or(sK43,sK43),sK43)) ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',modus_ponens)]) ).
cnf(g20,plain,
( ~ modus_ponens
| ~ is_a_theorem(implies(sK43,sK43))
| ~ is_a_theorem(implies(implies(sK43,sK43),implies(implies(sK43,sK43),implies(or(sK43,sK43),sK43))))
| is_a_theorem(implies(implies(sK43,sK43),implies(or(sK43,sK43),sK43))) ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',modus_ponens)]) ).
cnf(g21,plain,
( ~ or_3
| is_a_theorem(implies(implies(sK43,sK43),implies(implies(sK43,sK43),implies(or(sK43,sK43),sK43)))) ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',or_3)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL453+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04 % Command : satcop --statistics %s
% 0.08/0.35 % Computer : n006.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sat Sep 5 12:38:16 UTC 2026
% 0.12/0.36 % CPUTime :
% 8.15/1.49 % symbols: 95
% 8.15/1.49 % clauses: 91
% 8.15/1.49 % start clauses: 1
% 8.15/1.49 % iterative deepening steps: 5453
% 8.15/1.49 % maximum path limit: 7
% 8.15/1.49 % literal attempts: 970114
% 8.15/1.49 % depth failures: 533924
% 8.15/1.49 % regularity failures: 54624
% 8.15/1.49 % tautology failures: 75147
% 8.15/1.49 % reductions: 279
% 8.15/1.49 % extensions: 964860
% 8.15/1.49 % SAT variables: 289465
% 8.15/1.49 % SAT clauses: 376868
% 8.15/1.49 % WalkSAT solutions: 376866
% 8.15/1.49 % CDCL solutions: 0
% 8.15/1.49 % SZS status Theorem for theBenchmark
% 8.15/1.49 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------