%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL372+1 : TPTP v9.3.1. Released v9.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n005.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:35 AM UTC 2026
% Result : Theorem 32.92s 6.97s
% Output : CNFRefutation 32.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of clauses : 36 ( 15 unt; 0 nHn; 11 RR)
% Number of literals : 63 ( 0 equ; 29 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 96 ( 18 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-eje9obrr/input.p',i_0_1) ).
cnf(i_0_2,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eje9obrr/input.p',i_0_2) ).
cnf(i_0_4,plain,
is_a_theorem(implies(X1,implies(not(X1),X2))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eje9obrr/input.p',i_0_4) ).
cnf(i_0_3,plain,
is_a_theorem(implies(implies(not(X1),X1),X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eje9obrr/input.p',i_0_3) ).
cnf(i_0_5,negated_conjecture,
~ is_a_theorem(implies(implies(implies(implies(x,y),y),z),implies(implies(implies(y,u),x),z))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eje9obrr/input.p',i_0_5) ).
cnf(c_0_11,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,X1)) ),
i_0_1 ).
cnf(c_0_12,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
i_0_2 ).
cnf(c_0_13,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,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_11,c_0_13]) ).
cnf(c_0_15,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_14,c_0_13]) ).
cnf(c_0_16,plain,
is_a_theorem(implies(X1,implies(not(X1),X2))),
i_0_4 ).
cnf(c_0_17,plain,
( is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X4,X3))))
| ~ is_a_theorem(implies(X1,implies(X4,X2))) ),
inference(spm,[status(thm)],[c_0_14,c_0_12]) ).
cnf(c_0_18,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,not(X1))) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
is_a_theorem(implies(implies(not(X1),X1),X1)),
i_0_3 ).
cnf(c_0_20,plain,
( is_a_theorem(implies(X1,implies(X2,implies(X3,X4))))
| ~ is_a_theorem(implies(X2,implies(X5,X4)))
| ~ is_a_theorem(implies(X1,implies(X3,X5))) ),
inference(spm,[status(thm)],[c_0_15,c_0_17]) ).
cnf(c_0_21,plain,
is_a_theorem(implies(X1,implies(implies(not(not(X1)),not(X1)),X2))),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
( is_a_theorem(implies(X1,implies(X2,implies(X3,X4))))
| ~ is_a_theorem(implies(X1,implies(X3,not(X2)))) ),
inference(spm,[status(thm)],[c_0_20,c_0_16]) ).
cnf(c_0_23,plain,
( is_a_theorem(implies(not(X1),X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_16]) ).
cnf(c_0_24,plain,
( is_a_theorem(implies(X1,implies(X2,implies(X3,X4))))
| ~ is_a_theorem(implies(X1,implies(X3,implies(not(not(X2)),not(X2))))) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
is_a_theorem(implies(X1,implies(X2,implies(not(X1),X3)))),
inference(spm,[status(thm)],[c_0_22,c_0_16]) ).
cnf(c_0_26,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(not(X2),X2))) ),
inference(spm,[status(thm)],[c_0_14,c_0_19]) ).
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_15,c_0_12]) ).
cnf(c_0_28,plain,
( is_a_theorem(implies(X1,implies(not(X2),X3)))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_23]) ).
cnf(c_0_29,plain,
is_a_theorem(implies(not(X1),implies(X1,implies(X2,X3)))),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(X3,X4))
| ~ is_a_theorem(implies(X4,X1)) ),
inference(spm,[status(thm)],[c_0_15,c_0_13]) ).
cnf(c_0_31,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X1,X3)))
| ~ is_a_theorem(implies(not(implies(X1,X3)),implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_28]) ).
cnf(c_0_33,plain,
is_a_theorem(implies(not(X1),implies(X2,implies(X1,X3)))),
inference(spm,[status(thm)],[c_0_24,c_0_29]) ).
cnf(c_0_34,plain,
( is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X4),X2)))
| ~ is_a_theorem(implies(implies(implies(X4,X5),implies(X3,X5)),X1)) ),
inference(spm,[status(thm)],[c_0_30,c_0_12]) ).
cnf(c_0_35,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X1,X3)))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(implies(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_26,c_0_13]) ).
cnf(c_0_37,plain,
is_a_theorem(implies(not(X1),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_26,c_0_33]) ).
cnf(c_0_38,negated_conjecture,
~ is_a_theorem(implies(implies(implies(implies(x,y),y),z),implies(implies(implies(y,u),x),z))),
i_0_5 ).
cnf(c_0_39,plain,
( is_a_theorem(implies(implies(implies(implies(X1,X2),X3),X4),implies(implies(X5,X1),X4)))
| ~ is_a_theorem(implies(implies(X5,X2),X3)) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,plain,
is_a_theorem(implies(implies(implies(X1,X2),X1),X1)),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL372+1 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.03 % Command : enigmatic-eprover.py %s %d 1
% 0.10/0.35 % Computer : n005.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Sat Sep 5 23:00:37 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.12/0.45 # ENIGMATIC: Selected complete mode:
% 32.92/6.97 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d60-l8000-e0.15+coop-eprover73:
% 32.92/6.97 # 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: 26; version: 991; iters: 150)
% 32.92/6.97 # Preprocessing time : 2.404 s
% 32.92/6.97 # Presaturation interreduction done
% 32.92/6.97
% 32.92/6.97 # Proof found!
% 32.92/6.97 # SZS status Theorem
% 32.92/6.97 # SZS output start CNFRefutation
% See solution above
% 32.92/6.97 # Training examples: 0 positive, 0 negative
% 32.92/6.97
% 32.92/6.97 # -------------------------------------------------
% 32.92/6.97 # User time : 2.245 s
% 32.92/6.97 # System time : 0.359 s
% 32.92/6.97 # Total time : 2.604 s
% 32.92/6.97 # ...preprocessing : 2.404 s
% 32.92/6.97 # ...main loop : 0.200 s
% 32.92/6.97 # Maximum resident set size: 186560 pages
% 32.92/6.97
%------------------------------------------------------------------------------