%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : LCL499+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n001.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:58 PM UTC 2026
% Result : Theorem 1.02s 0.55s
% Output : Proof 1.02s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ kn1,
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_kn1)]) ).
cnf(g1,plain,
( ~ is_a_theorem(implies(sK32,and(sK32,sK32)))
| kn1 ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',kn1)]) ).
cnf(g2,plain,
r1,
inference(ground_cnf,[],[file('Axioms/LCL006+4.ax',principia_r1)]) ).
cnf(g3,plain,
r3,
inference(ground_cnf,[],[file('Axioms/LCL006+4.ax',principia_r3)]) ).
cnf(g4,plain,
( ~ sPE(implies(sK32,and(sK32,sK32)),or(not(sK32),and(sK32,sK32)))
| sPE(or(not(sK32),and(sK32,sK32)),implies(sK32,and(sK32,sK32))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g5,plain,
( ~ op_implies_or
| sPE(implies(sK32,and(sK32,sK32)),or(not(sK32),and(sK32,sK32))) ),
inference(ground_cnf,[],[file('Axioms/LCL006+1.ax',op_implies_or)]) ).
cnf(g6,plain,
( ~ op_and
| sPE(and(sK32,sK32),not(or(not(sK32),not(sK32)))) ),
inference(ground_cnf,[],[file('Axioms/LCL006+1.ax',op_and)]) ).
cnf(g7,plain,
modus_ponens,
inference(ground_cnf,[],[file('Axioms/LCL006+4.ax',principia_modus_ponens)]) ).
cnf(g8,plain,
op_implies_or,
inference(ground_cnf,[],[file('Axioms/LCL006+4.ax',principia_op_implies_or)]) ).
cnf(g9,plain,
sPE(not(sK32),not(sK32)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g10,plain,
( ~ r3
| is_a_theorem(implies(or(and(sK32,sK32),not(sK32)),or(not(sK32),and(sK32,sK32)))) ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',r3)]) ).
cnf(g11,plain,
( ~ modus_ponens
| ~ is_a_theorem(or(not(or(not(sK32),not(sK32))),not(sK32)))
| ~ is_a_theorem(implies(or(not(or(not(sK32),not(sK32))),not(sK32)),implies(sK32,and(sK32,sK32))))
| is_a_theorem(implies(sK32,and(sK32,sK32))) ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',modus_ponens)]) ).
cnf(g12,plain,
( ~ sPE(implies(or(and(sK32,sK32),not(sK32)),or(not(sK32),and(sK32,sK32))),implies(or(not(or(not(sK32),not(sK32))),not(sK32)),implies(sK32,and(sK32,sK32))))
| ~ is_a_theorem(implies(or(and(sK32,sK32),not(sK32)),or(not(sK32),and(sK32,sK32))))
| is_a_theorem(implies(or(not(or(not(sK32),not(sK32))),not(sK32)),implies(sK32,and(sK32,sK32)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g13,plain,
( ~ sPE(or(and(sK32,sK32),not(sK32)),or(not(or(not(sK32),not(sK32))),not(sK32)))
| ~ sPE(or(not(sK32),and(sK32,sK32)),implies(sK32,and(sK32,sK32)))
| sPE(implies(or(and(sK32,sK32),not(sK32)),or(not(sK32),and(sK32,sK32))),implies(or(not(or(not(sK32),not(sK32))),not(sK32)),implies(sK32,and(sK32,sK32)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g14,plain,
( ~ sPE(and(sK32,sK32),not(or(not(sK32),not(sK32))))
| ~ sPE(not(sK32),not(sK32))
| sPE(or(and(sK32,sK32),not(sK32)),or(not(or(not(sK32),not(sK32))),not(sK32))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g15,plain,
op_and,
inference(ground_cnf,[],[file('Axioms/LCL006+4.ax',principia_op_and)]) ).
cnf(g16,plain,
( ~ sPE(implies(or(not(sK32),not(sK32)),not(sK32)),or(not(or(not(sK32),not(sK32))),not(sK32)))
| ~ is_a_theorem(implies(or(not(sK32),not(sK32)),not(sK32)))
| is_a_theorem(or(not(or(not(sK32),not(sK32))),not(sK32))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g17,plain,
( ~ op_implies_or
| sPE(implies(or(not(sK32),not(sK32)),not(sK32)),or(not(or(not(sK32),not(sK32))),not(sK32))) ),
inference(ground_cnf,[],[file('Axioms/LCL006+1.ax',op_implies_or)]) ).
cnf(g18,plain,
( ~ r1
| is_a_theorem(implies(or(not(sK32),not(sK32)),not(sK32))) ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',r1)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL499+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04 % Command : satcop --statistics %s
% 0.10/0.35 % Computer : n001.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Sat Sep 5 02:58:00 UTC 2026
% 0.10/0.35 % CPUTime :
% 1.02/0.55 % symbols: 94
% 1.02/0.55 % clauses: 83
% 1.02/0.55 % start clauses: 1
% 1.02/0.55 % iterative deepening steps: 1373
% 1.02/0.55 % maximum path limit: 6
% 1.02/0.55 % literal attempts: 217624
% 1.02/0.55 % depth failures: 124847
% 1.02/0.55 % regularity failures: 13676
% 1.02/0.55 % tautology failures: 10972
% 1.02/0.55 % reductions: 8
% 1.02/0.55 % extensions: 216324
% 1.02/0.55 % SAT variables: 64495
% 1.02/0.55 % SAT clauses: 79418
% 1.02/0.55 % WalkSAT solutions: 79415
% 1.02/0.55 % CDCL solutions: 0
% 1.02/0.55 % SZS status Theorem for theBenchmark
% 1.02/0.55 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------