%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL487+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n017.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 21.95s 5.56s
% Output : CNFRefutation 21.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 18
% Syntax : Number of clauses : 56 ( 32 unt; 0 nHn; 29 RR)
% Number of literals : 87 ( 13 equ; 34 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 12 ( 10 usr; 10 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 76 ( 7 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-ls0d49vb/lgb.p',i_0_38) ).
cnf(i_0_52,plain,
modus_ponens,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ls0d49vb/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-ls0d49vb/lgb.p',i_0_70) ).
cnf(i_0_60,plain,
r5,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ls0d49vb/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-ls0d49vb/lgb.p',i_0_44) ).
cnf(i_0_55,plain,
op_implies_or,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ls0d49vb/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-ls0d49vb/lgb.p',i_0_64) ).
cnf(i_0_57,plain,
r2,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ls0d49vb/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-ls0d49vb/lgb.p',i_0_66) ).
cnf(i_0_58,plain,
r3,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ls0d49vb/lgb.p',i_0_58) ).
cnf(i_0_43,plain,
( not(and(X1,not(X2))) = implies(X1,X2)
| ~ op_implies_and ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ls0d49vb/lgb.p',i_0_43) ).
cnf(i_0_21,plain,
op_implies_and,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ls0d49vb/lgb.p',i_0_21) ).
cnf(i_0_45,plain,
( not(and(not(X1),not(X2))) = or(X1,X2)
| ~ op_or ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ls0d49vb/lgb.p',i_0_45) ).
cnf(i_0_22,plain,
op_or,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ls0d49vb/lgb.p',i_0_22) ).
cnf(i_0_41,plain,
( not(or(not(X1),not(X2))) = and(X1,X2)
| ~ op_and ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ls0d49vb/lgb.p',i_0_41) ).
cnf(i_0_53,plain,
op_and,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ls0d49vb/lgb.p',i_0_53) ).
cnf(i_0_1,plain,
( and_1
| ~ is_a_theorem(implies(and(esk1_0,esk2_0),esk1_0)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ls0d49vb/lgb.p',i_0_1) ).
cnf(i_0_19,negated_conjecture,
~ and_1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ls0d49vb/lgb.p',i_0_19) ).
cnf(c_0_89,plain,
( is_a_theorem(X1)
| ~ modus_ponens
| ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,X1)) ),
i_0_38 ).
cnf(c_0_90,plain,
modus_ponens,
i_0_52 ).
cnf(c_0_91,plain,
( is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))
| ~ r5 ),
i_0_70 ).
cnf(c_0_92,plain,
r5,
i_0_60 ).
cnf(c_0_93,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_89,c_0_90])]) ).
cnf(c_0_94,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_91,c_0_92])]) ).
cnf(c_0_95,plain,
( is_a_theorem(implies(or(X1,X2),or(X1,X3)))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_93,c_0_94]) ).
cnf(c_0_96,plain,
( or(not(X1),X2) = implies(X1,X2)
| ~ op_implies_or ),
i_0_44 ).
cnf(c_0_97,plain,
op_implies_or,
i_0_55 ).
cnf(c_0_98,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_93,c_0_95]) ).
cnf(c_0_99,plain,
or(not(X1),X2) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_96,c_0_97])]) ).
cnf(c_0_100,plain,
( is_a_theorem(implies(X1,or(X2,X1)))
| ~ r2 ),
i_0_64 ).
cnf(c_0_101,plain,
r2,
i_0_57 ).
cnf(c_0_102,plain,
( is_a_theorem(implies(or(X1,X2),or(X2,X1)))
| ~ r3 ),
i_0_66 ).
cnf(c_0_103,plain,
r3,
i_0_58 ).
cnf(c_0_104,plain,
( not(and(X1,not(X2))) = implies(X1,X2)
| ~ op_implies_and ),
i_0_43 ).
cnf(c_0_105,plain,
op_implies_and,
i_0_21 ).
cnf(c_0_106,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_98,c_0_99]),c_0_99]) ).
cnf(c_0_107,plain,
is_a_theorem(implies(X1,or(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_100,c_0_101])]) ).
cnf(c_0_108,plain,
is_a_theorem(implies(or(X1,X2),or(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_102,c_0_103])]) ).
cnf(c_0_109,plain,
( not(and(not(X1),not(X2))) = or(X1,X2)
| ~ op_or ),
i_0_45 ).
cnf(c_0_110,plain,
not(and(X1,not(X2))) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_104,c_0_105])]) ).
cnf(c_0_111,plain,
op_or,
i_0_22 ).
cnf(c_0_112,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(or(X3,X1),X2)) ),
inference(spm,[status(thm)],[c_0_106,c_0_107]) ).
cnf(c_0_113,plain,
is_a_theorem(implies(or(X1,not(X2)),implies(X2,X1))),
inference(spm,[status(thm)],[c_0_108,c_0_99]) ).
cnf(c_0_114,plain,
implies(not(X1),X2) = or(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_109,c_0_110]),c_0_111])]) ).
cnf(c_0_115,plain,
( not(or(not(X1),not(X2))) = and(X1,X2)
| ~ op_and ),
i_0_41 ).
cnf(c_0_116,plain,
op_and,
i_0_53 ).
cnf(c_0_117,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_93,c_0_108]) ).
cnf(c_0_118,plain,
is_a_theorem(or(X1,implies(X1,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_113]),c_0_114]) ).
cnf(c_0_119,plain,
not(implies(X1,not(X2))) = and(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_115,c_0_99]),c_0_116])]) ).
cnf(c_0_120,plain,
( and_1
| ~ is_a_theorem(implies(and(esk1_0,esk2_0),esk1_0)) ),
i_0_1 ).
cnf(c_0_121,negated_conjecture,
~ and_1,
i_0_19 ).
cnf(c_0_122,plain,
is_a_theorem(or(implies(X1,X2),X1)),
inference(spm,[status(thm)],[c_0_117,c_0_118]) ).
cnf(c_0_123,plain,
or(implies(X1,not(X2)),X3) = implies(and(X1,X2),X3),
inference(spm,[status(thm)],[c_0_114,c_0_119]) ).
cnf(c_0_124,plain,
~ is_a_theorem(implies(and(esk1_0,esk2_0),esk1_0)),
inference(sr,[status(thm)],[c_0_120,c_0_121]) ).
cnf(c_0_125,plain,
is_a_theorem(implies(and(X1,X2),X1)),
inference(spm,[status(thm)],[c_0_122,c_0_123]) ).
cnf(c_0_126,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_124,c_0_125])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL487+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.36 % Computer : n017.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8046.5625MB
% 0.12/0.36 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Sat Sep 5 14:10:54 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.24/0.50 # ENIGMATIC: Selected SinE mode:
% 0.24/0.50 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.24/0.50 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.24/0.50 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.24/0.50 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 21.95/5.56 # ENIGMATIC: Solved by autoschedule-lgb:
% 21.95/5.56 # No SInE strategy applied
% 21.95/5.56 # Trying AutoSched0 for 149 seconds
% 21.95/5.56 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 21.95/5.56 # and selection function SelectComplexExceptUniqMaxHorn.
% 21.95/5.56 #
% 21.95/5.56 # Preprocessing time : 0.045 s
% 21.95/5.56 # Presaturation interreduction done
% 21.95/5.56
% 21.95/5.56 # Proof found!
% 21.95/5.56 # SZS status Theorem
% 21.95/5.56 # SZS output start CNFRefutation
% See solution above
% 21.95/5.56 # Training examples: 0 positive, 0 negative
% 21.95/5.56
% 21.95/5.56 # -------------------------------------------------
% 21.95/5.56 # User time : 0.263 s
% 21.95/5.56 # System time : 0.014 s
% 21.95/5.56 # Total time : 0.276 s
% 21.95/5.56 # Maximum resident set size: 3584 pages
% 21.95/5.56
%------------------------------------------------------------------------------