%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL368+1 : TPTP v9.3.1. Released v9.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.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:34 AM UTC 2026
% Result : Theorem 26.63s 4.87s
% Output : CNFRefutation 26.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 5
% Syntax : Number of clauses : 44 ( 28 unt; 0 nHn; 10 RR)
% Number of literals : 63 ( 0 equ; 21 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 : 117 ( 27 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qxsuaqbc/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/sandbox/tmp/enigma-theBenchmark.p-qxsuaqbc/input.p',i_0_2) ).
cnf(i_0_3,plain,
is_a_theorem(implies(implies(not(X1),X1),X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qxsuaqbc/input.p',i_0_3) ).
cnf(i_0_4,plain,
is_a_theorem(implies(X1,implies(not(X1),X2))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qxsuaqbc/input.p',i_0_4) ).
cnf(i_0_5,negated_conjecture,
~ is_a_theorem(implies(implies(implies(x,implies(y,z)),u),implies(implies(y,implies(x,z)),u))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qxsuaqbc/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(implies(not(X1),X1),X1)),
i_0_3 ).
cnf(c_0_15,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X3,X2)),X4),implies(implies(X3,X1),X4))),
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_16,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(not(X1),X1),X2))),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
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),X3))
| ~ is_a_theorem(implies(implies(implies(X2,X4),implies(X1,X4)),X3)) ),
inference(spm,[status(thm)],[c_0_11,c_0_15]) ).
cnf(c_0_19,plain,
is_a_theorem(implies(implies(implies(implies(not(X1),X1),X2),X3),implies(implies(X1,X2),X3))),
inference(spm,[status(thm)],[c_0_13,c_0_16]) ).
cnf(c_0_20,plain,
is_a_theorem(implies(implies(implies(not(X1),X2),X3),implies(X1,X3))),
inference(spm,[status(thm)],[c_0_13,c_0_17]) ).
cnf(c_0_21,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_22,plain,
is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(implies(X2,X3),implies(X1,X3)))),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(not(X1),X3),X2)) ),
inference(spm,[status(thm)],[c_0_11,c_0_20]) ).
cnf(c_0_24,plain,
( is_a_theorem(implies(implies(X1,X2),implies(not(X3),X2)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_13,c_0_21]) ).
cnf(c_0_25,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(X3,implies(not(X1),X1))) ),
inference(spm,[status(thm)],[c_0_11,c_0_22]) ).
cnf(c_0_26,plain,
( is_a_theorem(implies(X1,implies(not(X2),X3)))
| ~ is_a_theorem(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,X2)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,plain,
is_a_theorem(implies(implies(X1,not(X2)),implies(X2,implies(X1,X3)))),
inference(spm,[status(thm)],[c_0_18,c_0_20]) ).
cnf(c_0_29,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X3,X2))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_11,c_0_27]) ).
cnf(c_0_30,plain,
( is_a_theorem(implies(implies(not(X1),X1),X2))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_11,c_0_16]) ).
cnf(c_0_31,plain,
is_a_theorem(implies(X1,implies(X2,implies(not(X1),X3)))),
inference(spm,[status(thm)],[c_0_23,c_0_28]) ).
cnf(c_0_32,plain,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(implies(X4,X2),implies(X1,implies(X4,X3))))),
inference(spm,[status(thm)],[c_0_18,c_0_15]) ).
cnf(c_0_33,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(implies(not(X2),X4),X3)) ),
inference(spm,[status(thm)],[c_0_29,c_0_20]) ).
cnf(c_0_34,plain,
is_a_theorem(implies(implies(not(implies(not(X1),X1)),implies(not(X1),X1)),X1)),
inference(spm,[status(thm)],[c_0_30,c_0_14]) ).
cnf(c_0_35,plain,
is_a_theorem(implies(implies(implies(X1,implies(not(X2),X3)),X4),implies(X2,X4))),
inference(spm,[status(thm)],[c_0_13,c_0_31]) ).
cnf(c_0_36,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_11,c_0_32]) ).
cnf(c_0_37,plain,
is_a_theorem(implies(X1,implies(implies(not(X2),X2),X2))),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(X3,implies(not(X1),X4)),X2)) ),
inference(spm,[status(thm)],[c_0_11,c_0_35]) ).
cnf(c_0_39,plain,
is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(X3,implies(X1,X2)))),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,X1)))),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_41,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3))),
inference(spm,[status(thm)],[c_0_25,c_0_40]) ).
cnf(c_0_42,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(X3,X1),X2)) ),
inference(spm,[status(thm)],[c_0_11,c_0_41]) ).
cnf(c_0_43,plain,
is_a_theorem(implies(implies(not(X1),X2),implies(X3,implies(implies(X2,X1),X1)))),
inference(spm,[status(thm)],[c_0_18,c_0_39]) ).
cnf(c_0_44,plain,
is_a_theorem(implies(X1,implies(X2,implies(implies(X1,X3),X3)))),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_45,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),X2),X3),implies(X1,X3))),
inference(spm,[status(thm)],[c_0_25,c_0_44]) ).
cnf(c_0_46,plain,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3)))),
inference(spm,[status(thm)],[c_0_18,c_0_45]) ).
cnf(c_0_47,negated_conjecture,
~ is_a_theorem(implies(implies(implies(x,implies(y,z)),u),implies(implies(y,implies(x,z)),u))),
i_0_5 ).
cnf(c_0_48,plain,
is_a_theorem(implies(implies(implies(X1,implies(X2,X3)),X4),implies(implies(X2,implies(X1,X3)),X4))),
inference(spm,[status(thm)],[c_0_13,c_0_46]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL368+1 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.03 % Command : enigmatic-eprover.py %s %d 1
% 0.07/0.33 % Computer : n018.cluster.edu
% 0.07/0.33 % Model : x86_64 x86_64
% 0.07/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.33 % Memory : 8046.5625MB
% 0.07/0.33 % OS : Linux 6.8.0-71-generic
% 0.07/0.33 % CPULimit : 300
% 0.07/0.33 % WCLimit : 300
% 0.07/0.33 % DateTime : Fri Sep 4 21:47:34 UTC 2026
% 0.07/0.34 % CPUTime :
% 0.11/0.43 # ENIGMATIC: Selected complete mode:
% 26.63/4.87 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d30-l6400-e0.15+coop-eprover66:
% 26.63/4.87 # ENIGMA: LightGBM model '/export/starexec/sandbox/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d30-l6400-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 27; version: 991; iters: 150)
% 26.63/4.87 # Preprocessing time : 1.658 s
% 26.63/4.87 # Presaturation interreduction done
% 26.63/4.87
% 26.63/4.87 # Proof found!
% 26.63/4.87 # SZS status Theorem
% 26.63/4.87 # SZS output start CNFRefutation
% See solution above
% 26.63/4.87 # Training examples: 0 positive, 0 negative
% 26.63/4.87
% 26.63/4.87 # -------------------------------------------------
% 26.63/4.87 # User time : 1.597 s
% 26.63/4.87 # System time : 0.298 s
% 26.63/4.87 # Total time : 1.895 s
% 26.63/4.87 # ...preprocessing : 1.658 s
% 26.63/4.87 # ...main loop : 0.237 s
% 26.63/4.87 # Maximum resident set size: 169884 pages
% 26.63/4.87
%------------------------------------------------------------------------------