%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL365+1 : TPTP v9.3.1. Released v9.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n015.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:33 AM UTC 2026
% Result : Theorem 19.99s 5.01s
% Output : CNFRefutation 19.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of clauses : 24 ( 10 unt; 0 nHn; 9 RR)
% Number of literals : 43 ( 0 equ; 22 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 : 57 ( 7 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-c_rsvojk/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-c_rsvojk/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-c_rsvojk/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-c_rsvojk/input.p',i_0_3) ).
cnf(i_0_5,negated_conjecture,
~ is_a_theorem(implies(implies(implies(x,implies(implies(y,z),z)),u),implies(implies(not(z),y),u))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-c_rsvojk/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(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_17,plain,
is_a_theorem(implies(X1,implies(not(X1),X2))),
i_0_4 ).
cnf(c_0_18,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_16,c_0_12]) ).
cnf(c_0_19,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_20,plain,
is_a_theorem(implies(implies(not(X1),X1),X1)),
i_0_3 ).
cnf(c_0_21,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_17]) ).
cnf(c_0_22,plain,
( is_a_theorem(implies(not(X1),X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
~ is_a_theorem(implies(implies(implies(x,implies(implies(y,z),z)),u),implies(implies(not(z),y),u))),
i_0_5 ).
cnf(c_0_24,plain,
( is_a_theorem(implies(implies(implies(X1,implies(implies(X2,X3),X4)),X5),implies(implies(X6,X2),X5)))
| ~ is_a_theorem(implies(X1,implies(implies(X6,X3),X4))) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,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_20]) ).
cnf(c_0_26,plain,
( is_a_theorem(implies(X1,implies(not(X2),X3)))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
~ is_a_theorem(implies(x,implies(implies(not(z),z),z))),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL365+1 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.03 % Command : enigmatic-eprover.py %s %d 1
% 0.10/0.36 % Computer : n015.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sat Sep 5 23:54:46 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.14/0.46 # ENIGMATIC: Selected complete mode:
% 19.99/5.01 # ENIGMATIC: Solved by Enigma+tptp-cade20-model02-h2e15+lgb-t150-d30-l6400-e0.15+coop-mzr02:
% 19.99/5.01 # ENIGMA: LightGBM model '/export/starexec/sandbox2/solver/bin/data/Enigma/tptp-cade20-model02-h2e15/lgb-t150-d30-l6400-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 33; version: 991; iters: 150)
% 19.99/5.01 # Preprocessing time : 1.323 s
% 19.99/5.01
% 19.99/5.01 # Proof found!
% 19.99/5.01 # SZS status Theorem
% 19.99/5.01 # SZS output start CNFRefutation
% See solution above
% 19.99/5.01 # Training examples: 0 positive, 0 negative
% 19.99/5.01
% 19.99/5.01 # -------------------------------------------------
% 19.99/5.01 # User time : 1.121 s
% 19.99/5.01 # System time : 0.244 s
% 19.99/5.01 # Total time : 1.364 s
% 19.99/5.01 # ...preprocessing : 1.323 s
% 19.99/5.01 # ...main loop : 0.041 s
% 19.99/5.01 # Maximum resident set size: 170444 pages
% 19.99/5.01
%------------------------------------------------------------------------------