%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : LCL542+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n028.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:01 PM UTC 2026
% Result : Theorem 0.10s 0.41s
% Output : Proof 0.10s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ axiom_m2,
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_axiom_m2)]) ).
cnf(g1,plain,
( ~ is_a_theorem(strict_implies(and(sK78,sK79),sK78))
| axiom_m2 ),
inference(ground_cnf,[],[file('Axioms/LCL007+0.ax',axiom_m2)]) ).
cnf(g2,plain,
and_1,
inference(ground_cnf,[],[file('Axioms/LCL006+2.ax',hilbert_and_1)]) ).
cnf(g3,plain,
( ~ sPE(necessarily(implies(and(sK78,sK79),sK78)),strict_implies(and(sK78,sK79),sK78))
| ~ is_a_theorem(necessarily(implies(and(sK78,sK79),sK78)))
| is_a_theorem(strict_implies(and(sK78,sK79),sK78)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g4,plain,
( ~ sPE(strict_implies(and(sK78,sK79),sK78),necessarily(implies(and(sK78,sK79),sK78)))
| sPE(necessarily(implies(and(sK78,sK79),sK78)),strict_implies(and(sK78,sK79),sK78)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g5,plain,
( ~ op_strict_implies
| sPE(strict_implies(and(sK78,sK79),sK78),necessarily(implies(and(sK78,sK79),sK78))) ),
inference(ground_cnf,[],[file('Axioms/LCL007+1.ax',op_strict_implies)]) ).
cnf(g6,plain,
op_strict_implies,
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_op_strict_implies)]) ).
cnf(g7,plain,
necessitation,
inference(ground_cnf,[],[file('Axioms/LCL007+3.ax',km4b_necessitation)]) ).
cnf(g8,plain,
( ~ is_a_theorem(implies(and(sK78,sK79),sK78))
| ~ necessitation
| is_a_theorem(necessarily(implies(and(sK78,sK79),sK78))) ),
inference(ground_cnf,[],[file('Axioms/LCL007+0.ax',necessitation)]) ).
cnf(g9,plain,
( ~ and_1
| is_a_theorem(implies(and(sK78,sK79),sK78)) ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',and_1)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL542+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04 % Command : satcop --statistics %s
% 0.10/0.38 % Computer : n028.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sat Sep 5 21:52:00 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.41 % symbols: 165
% 0.10/0.41 % clauses: 160
% 0.10/0.41 % start clauses: 1
% 0.10/0.41 % iterative deepening steps: 404
% 0.10/0.41 % maximum path limit: 4
% 0.10/0.41 % literal attempts: 33812
% 0.10/0.41 % depth failures: 23393
% 0.10/0.41 % regularity failures: 1631
% 0.10/0.41 % tautology failures: 1125
% 0.10/0.41 % reductions: 36
% 0.10/0.41 % extensions: 33386
% 0.10/0.41 % SAT variables: 16336
% 0.10/0.41 % SAT clauses: 17591
% 0.10/0.41 % WalkSAT solutions: 17590
% 0.10/0.41 % CDCL solutions: 0
% 0.10/0.41 % SZS status Theorem for theBenchmark
% 0.10/0.41 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------