%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL028+2 : TPTP v9.3.1. Released v9.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% 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 11:44:06 AM UTC 2026
% Result : Theorem 74.05s 11.69s
% Output : CNFRefutation 74.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 3
% Syntax : Number of clauses : 43 ( 21 unt; 0 nHn; 20 RR)
% Number of literals : 69 ( 0 equ; 30 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 12 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 163 ( 37 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-68hz_t61/input.p',i_0_1) ).
cnf(i_0_2,plain,
is_a_theorem(implies(implies(implies(implies(implies(X1,implies(X2,X1)),implies(implies(X3,implies(X4,implies(X5,X4))),X6)),X6),implies(implies(implies(implies(implies(implies(X7,implies(X8,X7)),implies(implies(implies(implies(X9,falsehood),falsehood),X9),X10)),X10),implies(implies(implies(X11,implies(X12,X13)),implies(implies(X11,X12),implies(X11,X13))),X14)),X14),X15)),X15)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-68hz_t61/input.p',i_0_2) ).
cnf(i_0_3,negated_conjecture,
~ is_a_theorem(implies(implies(implies(implies(implies(a,b),implies(c,falsehood)),e),falsehood),implies(implies(falsehood,a),implies(c,a)))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-68hz_t61/input.p',i_0_3) ).
cnf(c_0_7,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,X1)) ),
i_0_1 ).
cnf(c_0_8,plain,
is_a_theorem(implies(implies(implies(implies(implies(X1,implies(X2,X1)),implies(implies(X3,implies(X4,implies(X5,X4))),X6)),X6),implies(implies(implies(implies(implies(implies(X7,implies(X8,X7)),implies(implies(implies(implies(X9,falsehood),falsehood),X9),X10)),X10),implies(implies(implies(X11,implies(X12,X13)),implies(implies(X11,X12),implies(X11,X13))),X14)),X14),X15)),X15)),
i_0_2 ).
cnf(c_0_9,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(implies(implies(X2,implies(X3,X2)),implies(implies(X4,implies(X5,implies(X6,X5))),X7)),X7),implies(implies(implies(implies(implies(implies(X8,implies(X9,X8)),implies(implies(implies(implies(X10,falsehood),falsehood),X10),X11)),X11),implies(implies(implies(X12,implies(X13,X14)),implies(implies(X12,X13),implies(X12,X14))),X15)),X15),X1))) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,plain,
is_a_theorem(implies(X1,implies(X2,X1))),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_11,plain,
is_a_theorem(implies(implies(implies(X1,implies(X2,X1)),implies(implies(X3,implies(X4,implies(X5,X4))),X6)),X6)),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,X2)))),
inference(spm,[status(thm)],[c_0_9,c_0_11]) ).
cnf(c_0_13,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(X2,implies(X3,X2)),implies(implies(X4,implies(X5,implies(X6,X5))),X1))) ),
inference(spm,[status(thm)],[c_0_7,c_0_11]) ).
cnf(c_0_14,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_7,c_0_10]) ).
cnf(c_0_15,plain,
is_a_theorem(implies(X1,implies(implies(implies(implies(implies(X2,implies(X3,X2)),implies(implies(implies(implies(X4,falsehood),falsehood),X4),X5)),X5),implies(implies(implies(X6,implies(X7,X8)),implies(implies(X6,X7),implies(X6,X8))),X9)),X9))),
inference(spm,[status(thm)],[c_0_9,c_0_12]) ).
cnf(c_0_16,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(X2,implies(X3,implies(X4,X3))),X1)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
is_a_theorem(implies(X1,implies(implies(X2,implies(X3,X4)),implies(implies(X2,X3),implies(X2,X4))))),
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
cnf(c_0_18,plain,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3)))),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X1,X3)))
| ~ is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_7,c_0_18]) ).
cnf(c_0_20,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(X3,X2)))
| ~ is_a_theorem(implies(X1,X3)) ),
inference(spm,[status(thm)],[c_0_7,c_0_19]) ).
cnf(c_0_21,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(implies(implies(implies(implies(X2,implies(X3,X2)),implies(implies(implies(implies(X4,falsehood),falsehood),X4),X5)),X5),implies(implies(implies(X6,implies(X7,X8)),implies(implies(X6,X7),implies(X6,X8))),X9)),X9),X1)) ),
inference(spm,[status(thm)],[c_0_9,c_0_14]) ).
cnf(c_0_22,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,X3))
| ~ is_a_theorem(implies(X3,X2)) ),
inference(spm,[status(thm)],[c_0_20,c_0_14]) ).
cnf(c_0_23,plain,
( is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X1,X3)))
| ~ is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X1,X2))) ),
inference(spm,[status(thm)],[c_0_20,c_0_18]) ).
cnf(c_0_24,plain,
is_a_theorem(implies(X1,implies(implies(implies(X2,falsehood),falsehood),X2))),
inference(spm,[status(thm)],[c_0_21,c_0_11]) ).
cnf(c_0_25,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(X3,X1),X2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_10]) ).
cnf(c_0_26,plain,
( is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X1,X3)))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_23,c_0_14]) ).
cnf(c_0_27,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(implies(X2,falsehood),falsehood))) ),
inference(spm,[status(thm)],[c_0_20,c_0_24]) ).
cnf(c_0_28,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),implies(X3,X2)))),
inference(spm,[status(thm)],[c_0_25,c_0_18]) ).
cnf(c_0_30,plain,
is_a_theorem(implies(implies(X1,implies(implies(X2,X1),X3)),implies(X1,X3))),
inference(spm,[status(thm)],[c_0_23,c_0_12]) ).
cnf(c_0_31,plain,
is_a_theorem(implies(implies(X1,X2),implies(X1,implies(X3,X2)))),
inference(spm,[status(thm)],[c_0_13,c_0_17]) ).
cnf(c_0_32,plain,
( is_a_theorem(implies(implies(X1,falsehood),X2))
| ~ is_a_theorem(implies(implies(X2,falsehood),X1)) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X1,X3)))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_7,c_0_29]) ).
cnf(c_0_34,plain,
is_a_theorem(implies(falsehood,X1)),
inference(spm,[status(thm)],[c_0_27,c_0_10]) ).
cnf(c_0_35,plain,
( is_a_theorem(implies(implies(X1,implies(X2,X3)),X4))
| ~ is_a_theorem(implies(implies(implies(X1,X2),implies(X1,X3)),X4)) ),
inference(spm,[status(thm)],[c_0_22,c_0_18]) ).
cnf(c_0_36,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3))),
inference(spm,[status(thm)],[c_0_25,c_0_30]) ).
cnf(c_0_37,negated_conjecture,
~ is_a_theorem(implies(implies(implies(implies(implies(a,b),implies(c,falsehood)),e),falsehood),implies(implies(falsehood,a),implies(c,a)))),
i_0_3 ).
cnf(c_0_38,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X1,X3)) ),
inference(spm,[status(thm)],[c_0_7,c_0_31]) ).
cnf(c_0_39,plain,
is_a_theorem(implies(implies(implies(X1,X2),falsehood),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).
cnf(c_0_40,plain,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3)))),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,negated_conjecture,
~ is_a_theorem(implies(implies(implies(implies(implies(a,b),implies(c,falsehood)),e),falsehood),implies(c,a))),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,plain,
( is_a_theorem(implies(implies(implies(X1,X2),falsehood),X3))
| ~ is_a_theorem(implies(X1,X3)) ),
inference(spm,[status(thm)],[c_0_22,c_0_39]) ).
cnf(c_0_43,plain,
( is_a_theorem(implies(implies(X1,implies(X2,X3)),X4))
| ~ is_a_theorem(implies(implies(X2,implies(X1,X3)),X4)) ),
inference(spm,[status(thm)],[c_0_22,c_0_40]) ).
cnf(c_0_44,negated_conjecture,
~ is_a_theorem(implies(implies(implies(a,b),implies(c,falsehood)),implies(c,a))),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,plain,
( is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X2,X4)))
| ~ is_a_theorem(implies(implies(X1,X3),X4)) ),
inference(spm,[status(thm)],[c_0_43,c_0_33]) ).
cnf(c_0_46,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_39])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL028+2 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.04 % Command : enigmatic-eprover.py %s %d 1
% 0.09/0.35 % Computer : n001.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Sat Sep 5 14:58:36 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.13/0.44 # ENIGMATIC: Selected complete mode:
% 74.05/11.69 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d45-l8000-e0.15+coop-mzr02:
% 74.05/11.69 # ENIGMA: LightGBM model '/export/starexec/sandbox2/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d45-l8000-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 26; version: 991; iters: 150)
% 74.05/11.69 # Preprocessing time : 1.207 s
% 74.05/11.69
% 74.05/11.69 # Proof found!
% 74.05/11.69 # SZS status Theorem
% 74.05/11.69 # SZS output start CNFRefutation
% See solution above
% 74.05/11.69 # Training examples: 0 positive, 0 negative
% 74.05/11.69
% 74.05/11.69 # -------------------------------------------------
% 74.05/11.69 # User time : 7.094 s
% 74.05/11.69 # System time : 0.276 s
% 74.05/11.69 # Total time : 7.371 s
% 74.05/11.69 # ...preprocessing : 1.207 s
% 74.05/11.69 # ...main loop : 6.163 s
% 74.05/11.69 # Maximum resident set size: 176104 pages
% 74.05/11.69
%------------------------------------------------------------------------------