%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL384+2 : TPTP v9.3.1. Released v9.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n010.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:38 AM UTC 2026
% Result : Theorem 35.21s 6.83s
% Output : CNFRefutation 35.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 3
% Syntax : Number of clauses : 31 ( 15 unt; 0 nHn; 15 RR)
% Number of literals : 52 ( 0 equ; 24 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 144 ( 28 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-1f_14sd_/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(implies(X7,X8),implies(implies(X8,X9),implies(X7,X9))),implies(implies(implies(n(X10),X10),X10),X11)),X11),implies(implies(X12,implies(n(X12),X13)),X14)),X14),X15)),X15)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1f_14sd_/input.p',i_0_2) ).
cnf(i_0_3,negated_conjecture,
~ is_a_theorem(implies(implies(x,implies(y,z)),implies(implies(n(z),y),implies(x,z)))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1f_14sd_/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(implies(X7,X8),implies(implies(X8,X9),implies(X7,X9))),implies(implies(implies(n(X10),X10),X10),X11)),X11),implies(implies(X12,implies(n(X12),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(implies(X8,X9),implies(implies(X9,X10),implies(X8,X10))),implies(implies(implies(n(X11),X11),X11),X12)),X12),implies(implies(X13,implies(n(X13),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(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_7,c_0_10]) ).
cnf(c_0_12,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(implies(implies(implies(implies(implies(X2,X3),implies(implies(X3,X4),implies(X2,X4))),implies(implies(implies(n(X5),X5),X5),X6)),X6),implies(implies(X7,implies(n(X7),X8)),X9)),X9),X1)) ),
inference(spm,[status(thm)],[c_0_9,c_0_11]) ).
cnf(c_0_13,plain,
is_a_theorem(implies(X1,implies(implies(implies(implies(implies(implies(X2,X3),implies(implies(X3,X4),implies(X2,X4))),implies(implies(implies(n(X5),X5),X5),X6)),X6),implies(implies(X7,implies(n(X7),X8)),X9)),X9))),
inference(spm,[status(thm)],[c_0_12,c_0_10]) ).
cnf(c_0_14,plain,
is_a_theorem(implies(implies(implies(implies(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))),implies(implies(implies(n(X4),X4),X4),X5)),X5),implies(implies(X6,implies(n(X6),X7)),X8)),X8)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,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_16,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(implies(implies(implies(X2,X3),implies(implies(X3,X4),implies(X2,X4))),implies(implies(implies(n(X5),X5),X5),X6)),X6),implies(implies(X7,implies(n(X7),X8)),X1))) ),
inference(spm,[status(thm)],[c_0_7,c_0_14]) ).
cnf(c_0_17,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_15]) ).
cnf(c_0_18,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))),implies(implies(implies(n(X4),X4),X4),X5)),X5)),
inference(spm,[status(thm)],[c_0_16,c_0_10]) ).
cnf(c_0_19,plain,
is_a_theorem(implies(implies(implies(X1,implies(X2,X1)),X3),implies(X4,X3))),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
inference(spm,[status(thm)],[c_0_16,c_0_19]) ).
cnf(c_0_21,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_7,c_0_20]) ).
cnf(c_0_22,plain,
is_a_theorem(implies(X1,implies(implies(n(X2),X2),X2))),
inference(spm,[status(thm)],[c_0_12,c_0_15]) ).
cnf(c_0_23,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X3,X2))
| ~ is_a_theorem(implies(X1,X3)) ),
inference(spm,[status(thm)],[c_0_7,c_0_21]) ).
cnf(c_0_24,plain,
is_a_theorem(implies(implies(n(X1),X1),X1)),
inference(spm,[status(thm)],[c_0_12,c_0_22]) ).
cnf(c_0_25,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X1,implies(X4,X3)))
| ~ is_a_theorem(implies(X2,X4)) ),
inference(spm,[status(thm)],[c_0_23,c_0_21]) ).
cnf(c_0_26,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(n(X2),X2))) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,implies(X1,X4))))
| ~ is_a_theorem(implies(X3,implies(X2,X4))) ),
inference(spm,[status(thm)],[c_0_25,c_0_20]) ).
cnf(c_0_28,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X1,X3)))
| ~ is_a_theorem(implies(n(implies(X1,X3)),implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X1,X3)))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_28,c_0_11]) ).
cnf(c_0_30,negated_conjecture,
~ is_a_theorem(implies(implies(x,implies(y,z)),implies(implies(n(z),y),implies(x,z)))),
i_0_3 ).
cnf(c_0_31,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X1,implies(X2,X4)))
| ~ is_a_theorem(implies(X4,X3)) ),
inference(spm,[status(thm)],[c_0_23,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
~ is_a_theorem(implies(implies(n(z),y),implies(implies(y,z),z))),
inference(spm,[status(thm)],[c_0_30,c_0_27]) ).
cnf(c_0_33,plain,
( is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),X4)))
| ~ is_a_theorem(implies(implies(X1,X3),X4)) ),
inference(spm,[status(thm)],[c_0_31,c_0_20]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL384+2 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.03 % Command : enigmatic-eprover.py %s %d 1
% 0.08/0.34 % Computer : n010.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/0.34 % CPULimit : 300
% 0.08/0.34 % WCLimit : 300
% 0.08/0.34 % DateTime : Sat Sep 5 18:27:25 UTC 2026
% 0.08/0.34 % CPUTime :
% 0.12/0.39 # ENIGMATIC: Selected complete mode:
% 35.21/6.83 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d60-l8000-e0.15+coop-eprover73:
% 35.21/6.83 # ENIGMA: LightGBM model '/export/starexec/sandbox2/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d60-l8000-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 32; version: 991; iters: 150)
% 35.21/6.83 # Preprocessing time : 2.375 s
% 35.21/6.83 # Presaturation interreduction done
% 35.21/6.83
% 35.21/6.83 # Proof found!
% 35.21/6.83 # SZS status Theorem
% 35.21/6.83 # SZS output start CNFRefutation
% See solution above
% 35.21/6.83 # Training examples: 0 positive, 0 negative
% 35.21/6.83
% 35.21/6.83 # -------------------------------------------------
% 35.21/6.83 # User time : 2.149 s
% 35.21/6.83 # System time : 0.368 s
% 35.21/6.83 # Total time : 2.517 s
% 35.21/6.83 # ...preprocessing : 2.375 s
% 35.21/6.83 # ...main loop : 0.142 s
% 35.21/6.83 # Maximum resident set size: 186832 pages
% 35.21/6.83
%------------------------------------------------------------------------------