%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL490+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n006.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:51 AM UTC 2026
% Result : Theorem 15.58s 4.19s
% Output : CNFRefutation 15.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of clauses : 36 ( 19 unt; 0 nHn; 22 RR)
% Number of literals : 60 ( 3 equ; 27 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 9 ( 7 usr; 7 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 47 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_38,plain,
( is_a_theorem(X1)
| ~ modus_ponens
| ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_3hxshv4/lgb.p',i_0_38) ).
cnf(i_0_52,plain,
modus_ponens,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_3hxshv4/lgb.p',i_0_52) ).
cnf(i_0_70,plain,
( is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))
| ~ r5 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_3hxshv4/lgb.p',i_0_70) ).
cnf(i_0_60,plain,
r5,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_3hxshv4/lgb.p',i_0_60) ).
cnf(i_0_44,plain,
( or(not(X1),X2) = implies(X1,X2)
| ~ op_implies_or ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_3hxshv4/lgb.p',i_0_44) ).
cnf(i_0_55,plain,
op_implies_or,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_3hxshv4/lgb.p',i_0_55) ).
cnf(i_0_64,plain,
( is_a_theorem(implies(X1,or(X2,X1)))
| ~ r2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_3hxshv4/lgb.p',i_0_64) ).
cnf(i_0_57,plain,
r2,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_3hxshv4/lgb.p',i_0_57) ).
cnf(i_0_66,plain,
( is_a_theorem(implies(or(X1,X2),or(X2,X1)))
| ~ r3 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_3hxshv4/lgb.p',i_0_66) ).
cnf(i_0_58,plain,
r3,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_3hxshv4/lgb.p',i_0_58) ).
cnf(i_0_46,plain,
( or_1
| ~ is_a_theorem(implies(esk36_0,or(esk36_0,esk37_0))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_3hxshv4/lgb.p',i_0_46) ).
cnf(i_0_22,negated_conjecture,
~ or_1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_3hxshv4/lgb.p',i_0_22) ).
cnf(c_0_83,plain,
( is_a_theorem(X1)
| ~ modus_ponens
| ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,X1)) ),
i_0_38 ).
cnf(c_0_84,plain,
modus_ponens,
i_0_52 ).
cnf(c_0_85,plain,
( is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))
| ~ r5 ),
i_0_70 ).
cnf(c_0_86,plain,
r5,
i_0_60 ).
cnf(c_0_87,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_83,c_0_84])]) ).
cnf(c_0_88,plain,
is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_85,c_0_86])]) ).
cnf(c_0_89,plain,
( is_a_theorem(implies(or(X1,X2),or(X1,X3)))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_87,c_0_88]) ).
cnf(c_0_90,plain,
( or(not(X1),X2) = implies(X1,X2)
| ~ op_implies_or ),
i_0_44 ).
cnf(c_0_91,plain,
op_implies_or,
i_0_55 ).
cnf(c_0_92,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(or(X1,X3))
| ~ is_a_theorem(implies(X3,X2)) ),
inference(spm,[status(thm)],[c_0_87,c_0_89]) ).
cnf(c_0_93,plain,
or(not(X1),X2) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_90,c_0_91])]) ).
cnf(c_0_94,plain,
( is_a_theorem(implies(X1,or(X2,X1)))
| ~ r2 ),
i_0_64 ).
cnf(c_0_95,plain,
r2,
i_0_57 ).
cnf(c_0_96,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,X3))
| ~ is_a_theorem(implies(X3,X2)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_93]) ).
cnf(c_0_97,plain,
is_a_theorem(implies(X1,or(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_94,c_0_95])]) ).
cnf(c_0_98,plain,
( is_a_theorem(implies(or(X1,X2),or(X2,X1)))
| ~ r3 ),
i_0_66 ).
cnf(c_0_99,plain,
r3,
i_0_58 ).
cnf(c_0_100,plain,
( or_1
| ~ is_a_theorem(implies(esk36_0,or(esk36_0,esk37_0))) ),
i_0_46 ).
cnf(c_0_101,negated_conjecture,
~ or_1,
i_0_22 ).
cnf(c_0_102,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(or(X3,X1),X2)) ),
inference(spm,[status(thm)],[c_0_96,c_0_97]) ).
cnf(c_0_103,plain,
is_a_theorem(implies(or(X1,X2),or(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_98,c_0_99])]) ).
cnf(c_0_104,plain,
~ is_a_theorem(implies(esk36_0,or(esk36_0,esk37_0))),
inference(sr,[status(thm)],[c_0_100,c_0_101]) ).
cnf(c_0_105,plain,
is_a_theorem(implies(X1,or(X1,X2))),
inference(spm,[status(thm)],[c_0_102,c_0_103]) ).
cnf(c_0_106,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_104,c_0_105])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL490+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.03 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.36 % Computer : n006.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sat Sep 5 13:36:33 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.22/0.47 # ENIGMATIC: Selected SinE mode:
% 0.22/0.47 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.22/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.22/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 15.58/4.19 # ENIGMATIC: Solved by autoschedule-lgb:
% 15.58/4.19 # No SInE strategy applied
% 15.58/4.19 # Trying AutoSched0 for 150 seconds
% 15.58/4.19 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 15.58/4.19 # and selection function SelectComplexExceptUniqMaxHorn.
% 15.58/4.19 #
% 15.58/4.19 # Preprocessing time : 0.024 s
% 15.58/4.19 # Presaturation interreduction done
% 15.58/4.19
% 15.58/4.19 # Proof found!
% 15.58/4.19 # SZS status Theorem
% 15.58/4.19 # SZS output start CNFRefutation
% See solution above
% 15.58/4.19 # Training examples: 0 positive, 0 negative
% 15.58/4.19
% 15.58/4.19 # -------------------------------------------------
% 15.58/4.19 # User time : 0.140 s
% 15.58/4.19 # System time : 0.015 s
% 15.58/4.19 # Total time : 0.156 s
% 15.58/4.19 # Maximum resident set size: 3584 pages
% 15.58/4.19
%------------------------------------------------------------------------------