%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : LCL484+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n007.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:56 PM UTC 2026
% Result : Theorem 0.18s 0.46s
% Output : Proof 0.18s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ implies_1,
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_implies_1)]) ).
cnf(g1,plain,
( ~ is_a_theorem(implies(sK6,implies(sK7,sK6)))
| implies_1 ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',implies_1)]) ).
cnf(g2,plain,
r2,
inference(ground_cnf,[],[file('Axioms/LCL006+4.ax',principia_r2)]) ).
cnf(g3,plain,
sPE(sK6,sK6),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g4,plain,
( ~ sPE(implies(sK6,or(not(sK7),sK6)),implies(sK6,implies(sK7,sK6)))
| ~ is_a_theorem(implies(sK6,or(not(sK7),sK6)))
| is_a_theorem(implies(sK6,implies(sK7,sK6))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g5,plain,
( ~ op_implies_or
| sPE(implies(sK7,sK6),or(not(sK7),sK6)) ),
inference(ground_cnf,[],[file('Axioms/LCL006+1.ax',op_implies_or)]) ).
cnf(g6,plain,
( ~ is_a_theorem(implies(sK22,or(sK21,sK22)))
| or_2 ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',or_2)]) ).
cnf(g7,plain,
( ~ r2
| is_a_theorem(implies(sK22,or(sK21,sK22))) ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',r2)]) ).
cnf(g8,plain,
( ~ or_2
| is_a_theorem(implies(sK6,or(not(sK7),sK6))) ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',or_2)]) ).
cnf(g9,plain,
( ~ sPE(implies(sK6,implies(sK7,sK6)),implies(sK6,or(not(sK7),sK6)))
| sPE(implies(sK6,or(not(sK7),sK6)),implies(sK6,implies(sK7,sK6))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g10,plain,
( ~ sPE(sK6,sK6)
| ~ sPE(implies(sK7,sK6),or(not(sK7),sK6))
| sPE(implies(sK6,implies(sK7,sK6)),implies(sK6,or(not(sK7),sK6))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g11,plain,
op_implies_or,
inference(ground_cnf,[],[file('Axioms/LCL006+4.ax',principia_op_implies_or)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL484+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.06 % Command : satcop --statistics %s
% 0.18/0.44 % Computer : n007.cluster.edu
% 0.18/0.44 % Model : x86_64 x86_64
% 0.18/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44 % Memory : 8046.5625MB
% 0.18/0.44 % OS : Linux 6.8.0-71-generic
% 0.18/0.44 % CPULimit : 300
% 0.18/0.44 % WCLimit : 300
% 0.18/0.44 % DateTime : Sat Sep 5 09:41:24 UTC 2026
% 0.18/0.45 % CPUTime :
% 0.18/0.46 % symbols: 94
% 0.18/0.46 % clauses: 83
% 0.18/0.46 % start clauses: 1
% 0.18/0.46 % iterative deepening steps: 169
% 0.18/0.46 % maximum path limit: 5
% 0.18/0.46 % literal attempts: 8065
% 0.18/0.46 % depth failures: 5297
% 0.18/0.46 % regularity failures: 416
% 0.18/0.46 % tautology failures: 359
% 0.18/0.46 % reductions: 0
% 0.18/0.46 % extensions: 7900
% 0.18/0.46 % SAT variables: 4178
% 0.18/0.46 % SAT clauses: 4593
% 0.18/0.46 % WalkSAT solutions: 4587
% 0.18/0.46 % CDCL solutions: 0
% 0.18/0.46 % SZS status Theorem for theBenchmark
% 0.18/0.46 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------