%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : LCL488+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n017.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:57 PM UTC 2026
% Result : Theorem 13.62s 2.09s
% Output : Proof 13.62s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ and_2,
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_and_2)]) ).
cnf(g1,plain,
( ~ is_a_theorem(implies(and(sK15,sK16),sK16))
| and_2 ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',and_2)]) ).
cnf(g2,plain,
r3,
inference(ground_cnf,[],[file('Axioms/LCL006+4.ax',principia_r3)]) ).
cnf(g3,plain,
r2,
inference(ground_cnf,[],[file('Axioms/LCL006+4.ax',principia_r2)]) ).
cnf(g4,plain,
sPE(sK16,sK16),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g5,plain,
( ~ op_and
| sPE(and(sK15,sK16),not(or(not(sK15),not(sK16)))) ),
inference(ground_cnf,[],[file('Axioms/LCL006+1.ax',op_and)]) ).
cnf(g6,plain,
( ~ sPE(implies(and(sK15,sK16),sK16),implies(not(or(not(sK15),not(sK16))),sK16))
| sPE(implies(not(or(not(sK15),not(sK16))),sK16),implies(and(sK15,sK16),sK16)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g7,plain,
( ~ sPE(and(sK15,sK16),not(or(not(sK15),not(sK16))))
| ~ sPE(sK16,sK16)
| sPE(implies(and(sK15,sK16),sK16),implies(not(or(not(sK15),not(sK16))),sK16)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g8,plain,
op_implies_and,
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_implies_and)]) ).
cnf(g9,plain,
modus_ponens,
inference(ground_cnf,[],[file('Axioms/LCL006+4.ax',principia_modus_ponens)]) ).
cnf(g10,plain,
op_or,
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_or)]) ).
cnf(g11,plain,
op_and,
inference(ground_cnf,[],[file('Axioms/LCL006+4.ax',principia_op_and)]) ).
cnf(g12,plain,
( ~ sPE(implies(not(or(not(sK15),not(sK16))),sK16),not(and(not(or(not(sK15),not(sK16))),not(sK16))))
| sPE(not(and(not(or(not(sK15),not(sK16))),not(sK16))),implies(not(or(not(sK15),not(sK16))),sK16)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g13,plain,
( ~ op_implies_and
| sPE(implies(not(or(not(sK15),not(sK16))),sK16),not(and(not(or(not(sK15),not(sK16))),not(sK16)))) ),
inference(ground_cnf,[],[file('Axioms/LCL006+1.ax',op_implies_and)]) ).
cnf(g14,plain,
( ~ op_or
| sPE(or(or(not(sK15),not(sK16)),sK16),not(and(not(or(not(sK15),not(sK16))),not(sK16)))) ),
inference(ground_cnf,[],[file('Axioms/LCL006+1.ax',op_or)]) ).
cnf(g15,plain,
( ~ sPE(or(or(not(sK15),not(sK16)),sK16),implies(and(sK15,sK16),sK16))
| ~ is_a_theorem(or(or(not(sK15),not(sK16)),sK16))
| is_a_theorem(implies(and(sK15,sK16),sK16)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g16,plain,
( ~ sPE(or(or(not(sK15),not(sK16)),sK16),implies(not(or(not(sK15),not(sK16))),sK16))
| ~ sPE(implies(not(or(not(sK15),not(sK16))),sK16),implies(and(sK15,sK16),sK16))
| sPE(or(or(not(sK15),not(sK16)),sK16),implies(and(sK15,sK16),sK16)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g17,plain,
( ~ sPE(or(or(not(sK15),not(sK16)),sK16),not(and(not(or(not(sK15),not(sK16))),not(sK16))))
| ~ sPE(not(and(not(or(not(sK15),not(sK16))),not(sK16))),implies(not(or(not(sK15),not(sK16))),sK16))
| sPE(or(or(not(sK15),not(sK16)),sK16),implies(not(or(not(sK15),not(sK16))),sK16)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g18,plain,
( ~ modus_ponens
| ~ is_a_theorem(or(sK16,or(not(sK15),not(sK16))))
| ~ is_a_theorem(implies(or(sK16,or(not(sK15),not(sK16))),or(or(not(sK15),not(sK16)),sK16)))
| is_a_theorem(or(or(not(sK15),not(sK16)),sK16)) ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',modus_ponens)]) ).
cnf(g19,plain,
( ~ r3
| is_a_theorem(implies(or(sK16,or(not(sK15),not(sK16))),or(or(not(sK15),not(sK16)),sK16))) ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',r3)]) ).
cnf(g20,plain,
( ~ sPE(not(and(not(sK16),not(or(not(sK15),not(sK16))))),or(sK16,or(not(sK15),not(sK16))))
| ~ is_a_theorem(not(and(not(sK16),not(or(not(sK15),not(sK16))))))
| is_a_theorem(or(sK16,or(not(sK15),not(sK16)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g21,plain,
( ~ sPE(or(sK16,or(not(sK15),not(sK16))),not(and(not(sK16),not(or(not(sK15),not(sK16))))))
| sPE(not(and(not(sK16),not(or(not(sK15),not(sK16))))),or(sK16,or(not(sK15),not(sK16)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g22,plain,
( ~ op_or
| sPE(or(sK16,or(not(sK15),not(sK16))),not(and(not(sK16),not(or(not(sK15),not(sK16)))))) ),
inference(ground_cnf,[],[file('Axioms/LCL006+1.ax',op_or)]) ).
cnf(g23,plain,
( ~ sPE(implies(not(sK16),or(not(sK15),not(sK16))),not(and(not(sK16),not(or(not(sK15),not(sK16))))))
| ~ is_a_theorem(implies(not(sK16),or(not(sK15),not(sK16))))
| is_a_theorem(not(and(not(sK16),not(or(not(sK15),not(sK16)))))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g24,plain,
( ~ op_implies_and
| sPE(implies(not(sK16),or(not(sK15),not(sK16))),not(and(not(sK16),not(or(not(sK15),not(sK16)))))) ),
inference(ground_cnf,[],[file('Axioms/LCL006+1.ax',op_implies_and)]) ).
cnf(g25,plain,
( ~ r2
| is_a_theorem(implies(not(sK16),or(not(sK15),not(sK16)))) ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',r2)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL488+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04 % Command : satcop --statistics %s
% 0.09/0.36 % Computer : n017.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sat Sep 5 07:06:51 UTC 2026
% 0.09/0.36 % CPUTime :
% 13.62/2.09 % symbols: 94
% 13.62/2.09 % clauses: 83
% 13.62/2.09 % start clauses: 1
% 13.62/2.09 % iterative deepening steps: 3633
% 13.62/2.09 % maximum path limit: 7
% 13.62/2.09 % literal attempts: 1375547
% 13.62/2.09 % depth failures: 784412
% 13.62/2.09 % regularity failures: 92820
% 13.62/2.09 % tautology failures: 70657
% 13.62/2.09 % reductions: 779
% 13.62/2.09 % extensions: 1371722
% 13.62/2.09 % SAT variables: 448215
% 13.62/2.09 % SAT clauses: 561851
% 13.62/2.09 % WalkSAT solutions: 561846
% 13.62/2.09 % CDCL solutions: 0
% 13.62/2.09 % SZS status Theorem for theBenchmark
% 13.62/2.09 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------