%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL499+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n013.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:53 AM UTC 2026
% Result : Theorem 13.46s 3.78s
% Output : CNFRefutation 13.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of clauses : 35 ( 19 unt; 0 nHn; 22 RR)
% Number of literals : 56 ( 6 equ; 24 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; 1 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_34,plain,
( is_a_theorem(X1)
| ~ modus_ponens
| ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ka2mnb3v/lgb.p',i_0_34) ).
cnf(i_0_48,plain,
modus_ponens,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ka2mnb3v/lgb.p',i_0_48) ).
cnf(i_0_62,plain,
( is_a_theorem(implies(or(X1,X2),or(X2,X1)))
| ~ r3 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ka2mnb3v/lgb.p',i_0_62) ).
cnf(i_0_54,plain,
r3,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ka2mnb3v/lgb.p',i_0_54) ).
cnf(i_0_40,plain,
( or(not(X1),X2) = implies(X1,X2)
| ~ op_implies_or ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ka2mnb3v/lgb.p',i_0_40) ).
cnf(i_0_51,plain,
op_implies_or,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ka2mnb3v/lgb.p',i_0_51) ).
cnf(i_0_58,plain,
( is_a_theorem(implies(or(X1,X1),X1))
| ~ r1 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ka2mnb3v/lgb.p',i_0_58) ).
cnf(i_0_52,plain,
r1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ka2mnb3v/lgb.p',i_0_52) ).
cnf(i_0_37,plain,
( not(or(not(X1),not(X2))) = and(X1,X2)
| ~ op_and ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ka2mnb3v/lgb.p',i_0_37) ).
cnf(i_0_49,plain,
op_and,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ka2mnb3v/lgb.p',i_0_49) ).
cnf(i_0_25,plain,
( kn1
| ~ is_a_theorem(implies(esk26_0,and(esk26_0,esk26_0))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ka2mnb3v/lgb.p',i_0_25) ).
cnf(i_0_67,negated_conjecture,
~ kn1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ka2mnb3v/lgb.p',i_0_67) ).
cnf(c_0_80,plain,
( is_a_theorem(X1)
| ~ modus_ponens
| ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,X1)) ),
i_0_34 ).
cnf(c_0_81,plain,
modus_ponens,
i_0_48 ).
cnf(c_0_82,plain,
( is_a_theorem(implies(or(X1,X2),or(X2,X1)))
| ~ r3 ),
i_0_62 ).
cnf(c_0_83,plain,
r3,
i_0_54 ).
cnf(c_0_84,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_80,c_0_81])]) ).
cnf(c_0_85,plain,
is_a_theorem(implies(or(X1,X2),or(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_82,c_0_83])]) ).
cnf(c_0_86,plain,
( or(not(X1),X2) = implies(X1,X2)
| ~ op_implies_or ),
i_0_40 ).
cnf(c_0_87,plain,
op_implies_or,
i_0_51 ).
cnf(c_0_88,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_84,c_0_85]) ).
cnf(c_0_89,plain,
or(not(X1),X2) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_87])]) ).
cnf(c_0_90,plain,
( is_a_theorem(or(X1,not(X2)))
| ~ is_a_theorem(implies(X2,X1)) ),
inference(spm,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_91,plain,
( is_a_theorem(implies(or(X1,X1),X1))
| ~ r1 ),
i_0_58 ).
cnf(c_0_92,plain,
r1,
i_0_52 ).
cnf(c_0_93,plain,
( not(or(not(X1),not(X2))) = and(X1,X2)
| ~ op_and ),
i_0_37 ).
cnf(c_0_94,plain,
op_and,
i_0_49 ).
cnf(c_0_95,plain,
( kn1
| ~ is_a_theorem(implies(esk26_0,and(esk26_0,esk26_0))) ),
i_0_25 ).
cnf(c_0_96,negated_conjecture,
~ kn1,
i_0_67 ).
cnf(c_0_97,plain,
( is_a_theorem(implies(X1,not(X2)))
| ~ is_a_theorem(implies(X2,not(X1))) ),
inference(spm,[status(thm)],[c_0_90,c_0_89]) ).
cnf(c_0_98,plain,
is_a_theorem(implies(or(X1,X1),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_91,c_0_92])]) ).
cnf(c_0_99,plain,
not(implies(X1,not(X2))) = and(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_93,c_0_89]),c_0_94])]) ).
cnf(c_0_100,plain,
~ is_a_theorem(implies(esk26_0,and(esk26_0,esk26_0))),
inference(sr,[status(thm)],[c_0_95,c_0_96]) ).
cnf(c_0_101,plain,
is_a_theorem(implies(X1,and(X1,X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_89]),c_0_99]) ).
cnf(c_0_102,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_100,c_0_101])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL499+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04 % Command : enigmatic-eprover.py %s %d 1
% 0.07/0.34 % Computer : n013.cluster.edu
% 0.07/0.34 % Model : x86_64 x86_64
% 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34 % Memory : 8046.5625MB
% 0.07/0.34 % OS : Linux 6.8.0-71-generic
% 0.07/0.34 % CPULimit : 300
% 0.07/0.34 % WCLimit : 300
% 0.07/0.34 % DateTime : Sat Sep 5 02:52:21 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.12/0.44 # ENIGMATIC: Selected SinE mode:
% 0.12/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.12/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.12/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 13.46/3.78 # ENIGMATIC: Solved by autoschedule-lgb:
% 13.46/3.78 # No SInE strategy applied
% 13.46/3.78 # Trying AutoSched0 for 150 seconds
% 13.46/3.78 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 13.46/3.78 # and selection function SelectComplexExceptUniqMaxHorn.
% 13.46/3.78 #
% 13.46/3.78 # Preprocessing time : 0.024 s
% 13.46/3.78 # Presaturation interreduction done
% 13.46/3.78
% 13.46/3.78 # Proof found!
% 13.46/3.78 # SZS status Theorem
% 13.46/3.78 # SZS output start CNFRefutation
% See solution above
% 13.46/3.78 # Training examples: 0 positive, 0 negative
% 13.46/3.78
% 13.46/3.78 # -------------------------------------------------
% 13.46/3.78 # User time : 0.033 s
% 13.46/3.78 # System time : 0.006 s
% 13.46/3.78 # Total time : 0.040 s
% 13.46/3.78 # Maximum resident set size: 3584 pages
% 13.46/3.78
%------------------------------------------------------------------------------