%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : LCL527+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n016.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:04:00 PM UTC 2026
% Result : Theorem 0.12s 0.40s
% Output : Proof 0.12s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ adjunction,
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_adjunction)]) ).
cnf(g1,plain,
( is_a_theorem(sK58)
| adjunction ),
inference(ground_cnf,[],[file('Axioms/LCL007+0.ax',adjunction)]) ).
cnf(g2,plain,
( ~ is_a_theorem(and(sK58,sK59))
| adjunction ),
inference(ground_cnf,[],[file('Axioms/LCL007+0.ax',adjunction)]) ).
cnf(g3,plain,
( is_a_theorem(sK59)
| adjunction ),
inference(ground_cnf,[],[file('Axioms/LCL007+0.ax',adjunction)]) ).
cnf(g4,plain,
modus_ponens,
inference(ground_cnf,[],[file('Axioms/LCL006+2.ax',hilbert_modus_ponens)]) ).
cnf(g5,plain,
( ~ modus_ponens
| ~ is_a_theorem(sK59)
| ~ is_a_theorem(implies(sK59,and(sK58,sK59)))
| is_a_theorem(and(sK58,sK59)) ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',modus_ponens)]) ).
cnf(g6,plain,
and_3,
inference(ground_cnf,[],[file('Axioms/LCL006+2.ax',hilbert_and_3)]) ).
cnf(g7,plain,
( ~ modus_ponens
| ~ is_a_theorem(sK58)
| ~ is_a_theorem(implies(sK58,implies(sK59,and(sK58,sK59))))
| is_a_theorem(implies(sK59,and(sK58,sK59))) ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',modus_ponens)]) ).
cnf(g8,plain,
( ~ and_3
| is_a_theorem(implies(sK58,implies(sK59,and(sK58,sK59)))) ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',and_3)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL527+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04 % Command : satcop --statistics %s
% 0.12/0.37 % Computer : n016.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Sun Sep 6 00:41:45 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.40 % symbols: 165
% 0.12/0.40 % clauses: 159
% 0.12/0.40 % start clauses: 1
% 0.12/0.40 % iterative deepening steps: 136
% 0.12/0.40 % maximum path limit: 4
% 0.12/0.40 % literal attempts: 23700
% 0.12/0.40 % depth failures: 14895
% 0.12/0.40 % regularity failures: 2178
% 0.12/0.40 % tautology failures: 779
% 0.12/0.40 % reductions: 2260
% 0.12/0.40 % extensions: 21325
% 0.12/0.40 % SAT variables: 11697
% 0.12/0.40 % SAT clauses: 12754
% 0.12/0.40 % WalkSAT solutions: 12753
% 0.12/0.40 % CDCL solutions: 0
% 0.12/0.40 % SZS status Theorem for theBenchmark
% 0.12/0.40 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------