%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL390+1 : TPTP v9.3.1. Released v9.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n011.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:39 AM UTC 2026
% Result : Theorem 32.75s 6.49s
% Output : CNFRefutation 32.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 5
% Syntax : Number of clauses : 72 ( 32 unt; 0 nHn; 21 RR)
% Number of literals : 124 ( 0 equ; 57 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 170 ( 41 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-w8iiuoyi/lgb.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-w8iiuoyi/lgb.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-w8iiuoyi/lgb.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-w8iiuoyi/lgb.p',i_0_4) ).
cnf(i_0_5,negated_conjecture,
~ is_a_theorem(implies(implies(not(x),y),implies(implies(x,y),y))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-w8iiuoyi/lgb.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(implies(not(X1),X1),X1)),
i_0_3 ).
cnf(c_0_16,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_17,plain,
is_a_theorem(implies(X1,implies(not(X1),X2))),
i_0_4 ).
cnf(c_0_18,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_15]) ).
cnf(c_0_19,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,not(X1))) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(not(X2),not(X1))) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
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(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,X4))
| ~ is_a_theorem(implies(X4,X3)) ),
inference(spm,[status(thm)],[c_0_16,c_0_22]) ).
cnf(c_0_24,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(not(X1),X1)) ),
inference(spm,[status(thm)],[c_0_11,c_0_15]) ).
cnf(c_0_25,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_26,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X4,X3))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_23,c_0_22]) ).
cnf(c_0_27,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_28,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(not(implies(implies(X1,X2),implies(X3,X2))),implies(X3,X1))) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_31,plain,
( is_a_theorem(implies(X1,implies(not(X2),X3)))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
cnf(c_0_32,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_30]) ).
cnf(c_0_33,plain,
( is_a_theorem(implies(not(X1),X2))
| ~ is_a_theorem(implies(X3,X1))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_11,c_0_31]) ).
cnf(c_0_34,plain,
( is_a_theorem(implies(X1,implies(not(X2),X3)))
| ~ is_a_theorem(implies(X1,X4))
| ~ is_a_theorem(implies(X4,X2)) ),
inference(spm,[status(thm)],[c_0_14,c_0_31]) ).
cnf(c_0_35,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(X3,X2)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_14,c_0_32]) ).
cnf(c_0_36,plain,
( is_a_theorem(implies(not(implies(X1,X2)),X3))
| ~ is_a_theorem(implies(X4,X2))
| ~ is_a_theorem(implies(X1,X4)) ),
inference(spm,[status(thm)],[c_0_33,c_0_13]) ).
cnf(c_0_37,plain,
( is_a_theorem(implies(X1,implies(not(X2),X3)))
| ~ is_a_theorem(implies(implies(not(X1),X4),X2)) ),
inference(spm,[status(thm)],[c_0_34,c_0_17]) ).
cnf(c_0_38,plain,
is_a_theorem(implies(implies(not(implies(not(X1),X1)),implies(not(X1),X1)),X1)),
inference(spm,[status(thm)],[c_0_18,c_0_15]) ).
cnf(c_0_39,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(implies(X3,X1))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_35,c_0_13]) ).
cnf(c_0_40,plain,
( is_a_theorem(implies(not(implies(X1,X2)),X3))
| ~ is_a_theorem(implies(X1,implies(not(X2),X2))) ),
inference(spm,[status(thm)],[c_0_36,c_0_15]) ).
cnf(c_0_41,plain,
is_a_theorem(implies(implies(not(X1),X1),implies(not(X1),X2))),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(implies(not(X1),X1)) ),
inference(spm,[status(thm)],[c_0_39,c_0_15]) ).
cnf(c_0_43,plain,
is_a_theorem(implies(not(implies(implies(not(X1),X1),X1)),X2)),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,plain,
( is_a_theorem(implies(implies(X1,X2),implies(not(X3),X4)))
| ~ is_a_theorem(implies(implies(implies(X2,X5),implies(X1,X5)),X3)) ),
inference(spm,[status(thm)],[c_0_34,c_0_12]) ).
cnf(c_0_45,plain,
is_a_theorem(implies(implies(implies(implies(not(X1),X1),X1),X2),X2)),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,plain,
( is_a_theorem(implies(implies(not(X1),X1),implies(not(X2),X3)))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_34,c_0_15]) ).
cnf(c_0_47,plain,
is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(not(implies(X1,X2)),X3))),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,plain,
( is_a_theorem(implies(implies(not(X1),X1),X2))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_46]) ).
cnf(c_0_49,plain,
is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_18,c_0_47]) ).
cnf(c_0_50,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(not(X3),X3)) ),
inference(spm,[status(thm)],[c_0_26,c_0_15]) ).
cnf(c_0_51,plain,
( is_a_theorem(implies(not(X1),X2))
| ~ is_a_theorem(implies(not(X1),X1)) ),
inference(spm,[status(thm)],[c_0_33,c_0_15]) ).
cnf(c_0_52,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(not(X3),X3)))
| ~ is_a_theorem(implies(X3,X2)) ),
inference(spm,[status(thm)],[c_0_14,c_0_48]) ).
cnf(c_0_53,plain,
is_a_theorem(implies(implies(not(X1),X2),implies(not(implies(implies(X2,X1),X1)),X3))),
inference(spm,[status(thm)],[c_0_44,c_0_49]) ).
cnf(c_0_54,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(not(X1),X1)) ),
inference(spm,[status(thm)],[c_0_28,c_0_50]) ).
cnf(c_0_55,plain,
is_a_theorem(implies(not(implies(X1,X1)),X2)),
inference(spm,[status(thm)],[c_0_40,c_0_17]) ).
cnf(c_0_56,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(not(X2),X2)) ),
inference(spm,[status(thm)],[c_0_20,c_0_51]) ).
cnf(c_0_57,plain,
is_a_theorem(implies(X1,implies(not(implies(not(X1),X2)),X3))),
inference(spm,[status(thm)],[c_0_37,c_0_27]) ).
cnf(c_0_58,plain,
( is_a_theorem(implies(implies(not(X1),X2),X3))
| ~ is_a_theorem(implies(implies(implies(X2,X1),X1),X3)) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_59,plain,
is_a_theorem(implies(implies(implies(X1,X1),X2),implies(X3,X2))),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_60,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(not(implies(X3,X1)),implies(X3,X1))) ),
inference(spm,[status(thm)],[c_0_28,c_0_56]) ).
cnf(c_0_61,plain,
is_a_theorem(implies(not(implies(X1,implies(not(X1),X2))),X3)),
inference(spm,[status(thm)],[c_0_40,c_0_57]) ).
cnf(c_0_62,plain,
is_a_theorem(implies(implies(not(X1),X2),implies(implies(X2,X1),X1))),
inference(spm,[status(thm)],[c_0_18,c_0_53]) ).
cnf(c_0_63,plain,
is_a_theorem(implies(implies(not(X1),X1),implies(X2,X1))),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_64,plain,
is_a_theorem(implies(implies(implies(not(X1),X2),X3),implies(X1,X3))),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_65,negated_conjecture,
~ is_a_theorem(implies(implies(not(x),y),implies(implies(x,y),y))),
i_0_5 ).
cnf(c_0_66,plain,
( is_a_theorem(implies(X1,implies(implies(X2,X3),X3)))
| ~ is_a_theorem(implies(X1,implies(not(X3),X2))) ),
inference(spm,[status(thm)],[c_0_14,c_0_62]) ).
cnf(c_0_67,plain,
is_a_theorem(implies(X1,implies(not(implies(X2,X1)),X3))),
inference(spm,[status(thm)],[c_0_37,c_0_63]) ).
cnf(c_0_68,plain,
is_a_theorem(implies(implies(implies(not(not(X1)),X2),X1),X1)),
inference(spm,[status(thm)],[c_0_18,c_0_64]) ).
cnf(c_0_69,negated_conjecture,
~ is_a_theorem(implies(implies(not(x),y),implies(not(y),x))),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_70,plain,
( is_a_theorem(implies(implies(not(X1),X2),implies(X3,X1)))
| ~ is_a_theorem(implies(X3,implies(X2,X1))) ),
inference(spm,[status(thm)],[c_0_16,c_0_62]) ).
cnf(c_0_71,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(X3,X1),X2)) ),
inference(spm,[status(thm)],[c_0_52,c_0_67]) ).
cnf(c_0_72,plain,
is_a_theorem(implies(implies(not(X1),not(not(X1))),X1)),
inference(spm,[status(thm)],[c_0_58,c_0_68]) ).
cnf(c_0_73,plain,
~ is_a_theorem(implies(not(y),implies(y,x))),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_74,plain,
is_a_theorem(implies(not(not(X1)),X1)),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_75,plain,
~ is_a_theorem(implies(y,not(not(y)))),
inference(spm,[status(thm)],[c_0_73,c_0_19]) ).
cnf(c_0_76,plain,
is_a_theorem(implies(X1,not(not(X1)))),
inference(spm,[status(thm)],[c_0_20,c_0_74]) ).
cnf(c_0_77,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_76])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL390+1 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.04 % Command : enigmatic-eprover.py %s %d 1
% 0.10/0.36 % Computer : n011.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 15:49:30 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.42 # ENIGMATIC: Selected complete mode:
% 32.75/6.49 # ENIGMATIC: Solved by autoschedule-lgb:
% 32.75/6.49 # No SInE strategy applied
% 32.75/6.49 # Trying AutoSched0 for 150 seconds
% 32.75/6.49 # AutoSched0-Mode selected heuristic H_____011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V
% 32.75/6.49 # and selection function PSelectComplexExceptRRHorn.
% 32.75/6.49 #
% 32.75/6.49 # Preprocessing time : 0.023 s
% 32.75/6.49 # Presaturation interreduction done
% 32.75/6.49
% 32.75/6.49 # Proof found!
% 32.75/6.49 # SZS status Theorem
% 32.75/6.49 # SZS output start CNFRefutation
% See solution above
% 32.75/6.49 # Training examples: 0 positive, 0 negative
% 32.75/6.49
% 32.75/6.49 # -------------------------------------------------
% 32.75/6.49 # User time : 2.195 s
% 32.75/6.49 # System time : 0.115 s
% 32.75/6.49 # Total time : 2.310 s
% 32.75/6.49 # Maximum resident set size: 3328 pages
% 32.75/6.49
%------------------------------------------------------------------------------