%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : LCL490+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:57 PM UTC 2026
% Result : Theorem 0.09s 0.42s
% Output : Proof 0.09s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ or_1,
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_or_1)]) ).
cnf(g1,plain,
( ~ is_a_theorem(implies(sK19,or(sK19,sK20)))
| or_1 ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',or_1)]) ).
cnf(g2,plain,
modus_ponens,
inference(ground_cnf,[],[file('Axioms/LCL006+4.ax',principia_modus_ponens)]) ).
cnf(g3,plain,
( ~ sPE(or(not(sK19),or(sK19,sK20)),implies(sK19,or(sK19,sK20)))
| ~ is_a_theorem(or(not(sK19),or(sK19,sK20)))
| is_a_theorem(implies(sK19,or(sK19,sK20))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g4,plain,
( ~ sPE(implies(sK19,or(sK19,sK20)),or(not(sK19),or(sK19,sK20)))
| sPE(or(not(sK19),or(sK19,sK20)),implies(sK19,or(sK19,sK20))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g5,plain,
( ~ op_implies_or
| sPE(implies(sK19,or(sK19,sK20)),or(not(sK19),or(sK19,sK20))) ),
inference(ground_cnf,[],[file('Axioms/LCL006+1.ax',op_implies_or)]) ).
cnf(g6,plain,
r3,
inference(ground_cnf,[],[file('Axioms/LCL006+4.ax',principia_r3)]) ).
cnf(g7,plain,
r2,
inference(ground_cnf,[],[file('Axioms/LCL006+4.ax',principia_r2)]) ).
cnf(g8,plain,
( ~ r3
| is_a_theorem(implies(or(sK20,sK19),or(sK19,sK20))) ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',r3)]) ).
cnf(g9,plain,
( ~ r2
| is_a_theorem(implies(sK19,or(sK20,sK19))) ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',r2)]) ).
cnf(g10,plain,
r5,
inference(ground_cnf,[],[file('Axioms/LCL006+4.ax',principia_r5)]) ).
cnf(g11,plain,
op_implies_or,
inference(ground_cnf,[],[file('Axioms/LCL006+4.ax',principia_op_implies_or)]) ).
cnf(g12,plain,
( ~ modus_ponens
| ~ is_a_theorem(or(not(sK19),or(sK20,sK19)))
| ~ is_a_theorem(implies(or(not(sK19),or(sK20,sK19)),or(not(sK19),or(sK19,sK20))))
| is_a_theorem(or(not(sK19),or(sK19,sK20))) ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',modus_ponens)]) ).
cnf(g13,plain,
( ~ modus_ponens
| ~ is_a_theorem(implies(or(sK20,sK19),or(sK19,sK20)))
| ~ is_a_theorem(implies(implies(or(sK20,sK19),or(sK19,sK20)),implies(or(not(sK19),or(sK20,sK19)),or(not(sK19),or(sK19,sK20)))))
| is_a_theorem(implies(or(not(sK19),or(sK20,sK19)),or(not(sK19),or(sK19,sK20)))) ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',modus_ponens)]) ).
cnf(g14,plain,
( ~ r5
| is_a_theorem(implies(implies(or(sK20,sK19),or(sK19,sK20)),implies(or(not(sK19),or(sK20,sK19)),or(not(sK19),or(sK19,sK20))))) ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',r5)]) ).
cnf(g15,plain,
( ~ sPE(implies(sK19,or(sK20,sK19)),or(not(sK19),or(sK20,sK19)))
| ~ is_a_theorem(implies(sK19,or(sK20,sK19)))
| is_a_theorem(or(not(sK19),or(sK20,sK19))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g16,plain,
( ~ op_implies_or
| sPE(implies(sK19,or(sK20,sK19)),or(not(sK19),or(sK20,sK19))) ),
inference(ground_cnf,[],[file('Axioms/LCL006+1.ax',op_implies_or)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL490+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04 % Command : satcop --statistics %s
% 0.09/0.37 % Computer : n001.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 13:42:17 UTC 2026
% 0.09/0.38 % CPUTime :
% 0.09/0.42 % symbols: 94
% 0.09/0.42 % clauses: 83
% 0.09/0.42 % start clauses: 1
% 0.09/0.42 % iterative deepening steps: 427
% 0.09/0.42 % maximum path limit: 5
% 0.09/0.42 % literal attempts: 42881
% 0.09/0.42 % depth failures: 25690
% 0.09/0.42 % regularity failures: 2535
% 0.09/0.42 % tautology failures: 2259
% 0.09/0.42 % reductions: 0
% 0.09/0.42 % extensions: 42477
% 0.09/0.42 % SAT variables: 18241
% 0.09/0.42 % SAT clauses: 22240
% 0.09/0.42 % WalkSAT solutions: 22238
% 0.09/0.42 % CDCL solutions: 0
% 0.09/0.42 % SZS status Theorem for theBenchmark
% 0.09/0.42 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------