%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWX240_1 : TPTP v9.3.0. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 06:59:53 PM UTC 2026
% Result : Theorem 8.54s 2.58s
% Output : CNFRefutation 8.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 28
% Syntax : Number of clauses : 90 ( 34 unt; 24 nHn; 46 RR)
% Number of literals : 182 ( 39 equ; 79 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 6 con; 0-3 aty)
% Number of variables : 173 ( 37 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_69,negated_conjecture,
( elem(l,run(X1,X2))
| ~ typeCorrect(X2)
| ~ elem(l,run(cons(h,X1),X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mvltyugg/input.p',i_0_69) ).
cnf(i_0_64,plain,
( run(X1,assign(X2,X3)) = cons(X2,X1)
| ~ eval(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mvltyugg/input.p',i_0_64) ).
cnf(i_0_51,plain,
( elem(X1,cons(X2,X3))
| X2 != X1 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mvltyugg/input.p',i_0_51) ).
cnf(i_0_58,plain,
( eval(X1,var(X2))
| ~ elem(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mvltyugg/input.p',i_0_58) ).
cnf(i_0_50,plain,
( elem(X1,cons(X2,X3))
| ~ elem(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mvltyugg/input.p',i_0_50) ).
cnf(i_0_39,plain,
( secret(X1)
| typeCorrect(assign(low(X2),X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mvltyugg/input.p',i_0_39) ).
cnf(i_0_47,plain,
low(zero) = l,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mvltyugg/input.p',i_0_47) ).
cnf(i_0_70,negated_conjecture,
( elem(l,run(cons(h,X1),X2))
| ~ typeCorrect(X2)
| ~ elem(l,run(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mvltyugg/input.p',i_0_70) ).
cnf(i_0_63,plain,
run(X1,skip) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mvltyugg/input.p',i_0_63) ).
cnf(i_0_37,plain,
typeCorrect(skip),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mvltyugg/input.p',i_0_37) ).
cnf(i_0_36,plain,
~ secret(var(low(X1))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mvltyugg/input.p',i_0_36) ).
cnf(i_0_67,plain,
( run(X1,ifThenElse(X2,X3,X4)) = run(X1,X3)
| ~ eval(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mvltyugg/input.p',i_0_67) ).
cnf(i_0_44,plain,
( typeCorrect(ifThenElse(X1,X2,X3))
| ~ typeCorrect(X3)
| ~ typeCorrect(X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mvltyugg/input.p',i_0_44) ).
cnf(i_0_68,plain,
( run(X1,ifThenElse(X2,X3,X4)) = run(X1,X4)
| eval(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mvltyugg/input.p',i_0_68) ).
cnf(i_0_59,plain,
( elem(X1,X2)
| ~ eval(X2,var(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mvltyugg/input.p',i_0_59) ).
cnf(i_0_66,plain,
run(run(X1,X2),X3) = run(X1,seq(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mvltyugg/input.p',i_0_66) ).
cnf(i_0_41,plain,
( typeCorrect(seq(X1,X2))
| ~ typeCorrect(X2)
| ~ typeCorrect(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mvltyugg/input.p',i_0_41) ).
cnf(i_0_61,plain,
( del(X1,cons(X2,X3)) = del(X1,X3)
| X1 != X2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mvltyugg/input.p',i_0_61) ).
cnf(i_0_65,plain,
( run(X1,assign(X2,X3)) = del(X2,X1)
| eval(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mvltyugg/input.p',i_0_65) ).
cnf(i_0_8,plain,
low(X1) != high(X2),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mvltyugg/input.p',i_0_8) ).
cnf(i_0_48,plain,
high(zero) = h,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mvltyugg/input.p',i_0_48) ).
cnf(i_0_60,plain,
del(X1,nil) = nil,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mvltyugg/input.p',i_0_60) ).
cnf(i_0_49,plain,
~ elem(X1,nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mvltyugg/input.p',i_0_49) ).
cnf(i_0_52,plain,
( X1 = X2
| elem(X1,X3)
| ~ elem(X1,cons(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mvltyugg/input.p',i_0_52) ).
cnf(i_0_57,plain,
~ eval(X1,fF),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mvltyugg/input.p',i_0_57) ).
cnf(i_0_31,plain,
( var(proj1Var(X1)) = X1
| nand(proj1Nand(X1),proj2Nand(X1)) = X1
| ~ secret(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mvltyugg/input.p',i_0_31) ).
cnf(i_0_13,plain,
nand(X1,X2) != fF,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mvltyugg/input.p',i_0_13) ).
cnf(i_0_17,plain,
var(X1) != fF,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mvltyugg/input.p',i_0_17) ).
cnf(c_0_99,negated_conjecture,
( elem(l,run(X1,X2))
| ~ typeCorrect(X2)
| ~ elem(l,run(cons(h,X1),X2)) ),
i_0_69 ).
cnf(c_0_100,plain,
( run(X1,assign(X2,X3)) = cons(X2,X1)
| ~ eval(X1,X3) ),
i_0_64 ).
cnf(c_0_101,plain,
( elem(X1,cons(X2,X3))
| X2 != X1 ),
i_0_51 ).
cnf(c_0_102,negated_conjecture,
( elem(l,run(X1,assign(X2,X3)))
| ~ elem(l,cons(X2,cons(h,X1)))
| ~ eval(cons(h,X1),X3)
| ~ typeCorrect(assign(X2,X3)) ),
inference(spm,[status(thm)],[c_0_99,c_0_100]) ).
cnf(c_0_103,plain,
elem(X1,cons(X1,X2)),
inference(er,[status(thm)],[c_0_101]) ).
cnf(c_0_104,plain,
( eval(X1,var(X2))
| ~ elem(X2,X1) ),
i_0_58 ).
cnf(c_0_105,plain,
( elem(X1,cons(X2,X3))
| ~ elem(X1,X3) ),
i_0_50 ).
cnf(c_0_106,plain,
( elem(l,run(X1,assign(l,X2)))
| ~ eval(cons(h,X1),X2)
| ~ typeCorrect(assign(l,X2)) ),
inference(spm,[status(thm)],[c_0_102,c_0_103]) ).
cnf(c_0_107,plain,
( eval(cons(X1,X2),var(X3))
| ~ elem(X3,X2) ),
inference(spm,[status(thm)],[c_0_104,c_0_105]) ).
cnf(c_0_108,plain,
( secret(X1)
| typeCorrect(assign(low(X2),X1)) ),
i_0_39 ).
cnf(c_0_109,plain,
low(zero) = l,
i_0_47 ).
cnf(c_0_110,negated_conjecture,
( elem(l,run(cons(h,X1),X2))
| ~ typeCorrect(X2)
| ~ elem(l,run(X1,X2)) ),
i_0_70 ).
cnf(c_0_111,plain,
run(X1,skip) = X1,
i_0_63 ).
cnf(c_0_112,plain,
typeCorrect(skip),
i_0_37 ).
cnf(c_0_113,plain,
( elem(l,run(X1,assign(l,var(X2))))
| ~ elem(X2,X1)
| ~ typeCorrect(assign(l,var(X2))) ),
inference(spm,[status(thm)],[c_0_106,c_0_107]) ).
cnf(c_0_114,plain,
( secret(X1)
| typeCorrect(assign(l,X1)) ),
inference(spm,[status(thm)],[c_0_108,c_0_109]) ).
cnf(c_0_115,plain,
( elem(l,cons(h,X1))
| ~ elem(l,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_111]),c_0_111]),c_0_112])]) ).
cnf(c_0_116,plain,
~ secret(var(low(X1))),
i_0_36 ).
cnf(c_0_117,plain,
( run(X1,ifThenElse(X2,X3,X4)) = run(X1,X3)
| ~ eval(X1,X2) ),
i_0_67 ).
cnf(c_0_118,plain,
( elem(l,run(X1,assign(l,var(X2))))
| secret(var(X2))
| ~ elem(X2,X1) ),
inference(spm,[status(thm)],[c_0_113,c_0_114]) ).
cnf(c_0_119,plain,
elem(l,cons(h,cons(l,X1))),
inference(spm,[status(thm)],[c_0_115,c_0_103]) ).
cnf(c_0_120,plain,
~ secret(var(l)),
inference(spm,[status(thm)],[c_0_116,c_0_109]) ).
cnf(c_0_121,negated_conjecture,
( elem(l,run(X1,ifThenElse(X2,X3,X4)))
| ~ elem(l,run(cons(h,X1),X3))
| ~ eval(cons(h,X1),X2)
| ~ typeCorrect(ifThenElse(X2,X3,X4)) ),
inference(spm,[status(thm)],[c_0_99,c_0_117]) ).
cnf(c_0_122,plain,
elem(l,run(cons(h,cons(l,X1)),assign(l,var(l)))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_119]),c_0_120]) ).
cnf(c_0_123,plain,
( elem(l,run(cons(l,X1),ifThenElse(X2,assign(l,var(l)),X3)))
| ~ eval(cons(h,cons(l,X1)),X2)
| ~ typeCorrect(ifThenElse(X2,assign(l,var(l)),X3)) ),
inference(spm,[status(thm)],[c_0_121,c_0_122]) ).
cnf(c_0_124,plain,
( typeCorrect(ifThenElse(X1,X2,X3))
| ~ typeCorrect(X3)
| ~ typeCorrect(X2) ),
i_0_44 ).
cnf(c_0_125,plain,
( elem(l,run(cons(l,X1),ifThenElse(X2,assign(l,var(l)),X3)))
| ~ eval(cons(h,cons(l,X1)),X2)
| ~ typeCorrect(assign(l,var(l)))
| ~ typeCorrect(X3) ),
inference(spm,[status(thm)],[c_0_123,c_0_124]) ).
cnf(c_0_126,plain,
( elem(l,run(cons(l,X1),ifThenElse(X2,assign(l,var(l)),X3)))
| ~ eval(cons(h,cons(l,X1)),X2)
| ~ typeCorrect(X3) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_114]),c_0_120]) ).
cnf(c_0_127,plain,
eval(cons(X1,X2),var(X1)),
inference(spm,[status(thm)],[c_0_104,c_0_103]) ).
cnf(c_0_128,plain,
( elem(l,run(cons(l,X1),ifThenElse(var(h),assign(l,var(l)),X2)))
| ~ typeCorrect(X2) ),
inference(spm,[status(thm)],[c_0_126,c_0_127]) ).
cnf(c_0_129,plain,
( run(X1,ifThenElse(X2,X3,X4)) = run(X1,X4)
| eval(X1,X2) ),
i_0_68 ).
cnf(c_0_130,plain,
( elem(X1,X2)
| ~ eval(X2,var(X1)) ),
i_0_59 ).
cnf(c_0_131,plain,
( elem(l,run(cons(l,X1),X2))
| eval(cons(l,X1),var(h))
| ~ typeCorrect(X2) ),
inference(spm,[status(thm)],[c_0_128,c_0_129]) ).
cnf(c_0_132,plain,
( elem(l,run(cons(l,X1),X2))
| elem(h,cons(l,X1))
| ~ typeCorrect(X2) ),
inference(spm,[status(thm)],[c_0_130,c_0_131]) ).
cnf(c_0_133,plain,
run(run(X1,X2),X3) = run(X1,seq(X2,X3)),
i_0_66 ).
cnf(c_0_134,plain,
( elem(l,run(run(cons(l,X1),X2),X3))
| elem(h,cons(l,X1))
| ~ typeCorrect(seq(X2,X3)) ),
inference(spm,[status(thm)],[c_0_132,c_0_133]) ).
cnf(c_0_135,plain,
( elem(l,run(cons(l,X1),X2))
| elem(h,cons(l,X1))
| ~ typeCorrect(seq(skip,X2)) ),
inference(spm,[status(thm)],[c_0_134,c_0_111]) ).
cnf(c_0_136,plain,
( typeCorrect(seq(X1,X2))
| ~ typeCorrect(X2)
| ~ typeCorrect(X1) ),
i_0_41 ).
cnf(c_0_137,plain,
( elem(l,run(run(cons(l,X1),X2),X3))
| elem(h,cons(l,X1))
| ~ typeCorrect(seq(skip,seq(X2,X3))) ),
inference(spm,[status(thm)],[c_0_135,c_0_133]) ).
cnf(c_0_138,plain,
( secret(X1)
| typeCorrect(seq(X2,assign(l,X1)))
| ~ typeCorrect(X2) ),
inference(spm,[status(thm)],[c_0_136,c_0_114]) ).
cnf(c_0_139,plain,
( elem(l,run(cons(l,X1),X2))
| elem(h,cons(l,X1))
| ~ typeCorrect(seq(skip,seq(skip,X2))) ),
inference(spm,[status(thm)],[c_0_137,c_0_111]) ).
cnf(c_0_140,plain,
( secret(X1)
| typeCorrect(seq(X2,seq(X3,assign(l,X1))))
| ~ typeCorrect(X2)
| ~ typeCorrect(X3) ),
inference(spm,[status(thm)],[c_0_136,c_0_138]) ).
cnf(c_0_141,plain,
( del(X1,cons(X2,X3)) = del(X1,X3)
| X1 != X2 ),
i_0_61 ).
cnf(c_0_142,plain,
( elem(l,run(cons(l,X1),assign(l,X2)))
| elem(h,cons(l,X1))
| secret(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_139,c_0_140]),c_0_112])]) ).
cnf(c_0_143,plain,
( run(X1,assign(X2,X3)) = del(X2,X1)
| eval(X1,X3) ),
i_0_65 ).
cnf(c_0_144,plain,
del(X1,cons(X1,X2)) = del(X1,X2),
inference(er,[status(thm)],[c_0_141]) ).
cnf(c_0_145,plain,
low(X1) != high(X2),
i_0_8 ).
cnf(c_0_146,plain,
high(zero) = h,
i_0_48 ).
cnf(c_0_147,plain,
( elem(h,cons(l,X1))
| elem(l,del(l,X1))
| secret(X2)
| eval(cons(l,X1),X2) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_142,c_0_143]),c_0_144]) ).
cnf(c_0_148,plain,
del(X1,nil) = nil,
i_0_60 ).
cnf(c_0_149,plain,
~ elem(X1,nil),
i_0_49 ).
cnf(c_0_150,plain,
low(X1) != h,
inference(spm,[status(thm)],[c_0_145,c_0_146]) ).
cnf(c_0_151,plain,
( X1 = X2
| elem(X1,X3)
| ~ elem(X1,cons(X2,X3)) ),
i_0_52 ).
cnf(c_0_152,plain,
( elem(h,cons(l,nil))
| secret(X1)
| eval(cons(l,nil),X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_147,c_0_148]),c_0_149]) ).
cnf(c_0_153,plain,
h != l,
inference(spm,[status(thm)],[c_0_150,c_0_109]) ).
cnf(c_0_154,plain,
~ eval(X1,fF),
i_0_57 ).
cnf(c_0_155,plain,
( secret(X1)
| eval(cons(l,nil),X1) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_151,c_0_152]),c_0_153]),c_0_149]) ).
cnf(c_0_156,plain,
( var(proj1Var(X1)) = X1
| nand(proj1Nand(X1),proj2Nand(X1)) = X1
| ~ secret(X1) ),
i_0_31 ).
cnf(c_0_157,plain,
secret(fF),
inference(spm,[status(thm)],[c_0_154,c_0_155]) ).
cnf(c_0_158,plain,
nand(X1,X2) != fF,
i_0_13 ).
cnf(c_0_159,plain,
var(X1) != fF,
i_0_17 ).
cnf(c_0_160,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_156,c_0_157]),c_0_158]),c_0_159]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWX240_1 : TPTP v9.3.0. Released v9.3.0.
% 0.13/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.16/0.34 % Computer : n026.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Tue May 5 13:22:25 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected complete mode:
% 8.54/2.58 # ENIGMATIC: Solved by autoschedule:
% 8.54/2.58 # No SInE strategy applied
% 8.54/2.58 # Trying AutoSched0 for 150 seconds
% 8.54/2.58 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S02CN
% 8.54/2.58 # and selection function SelectAntiRROptimalLit.
% 8.54/2.58 #
% 8.54/2.58 # Preprocessing time : 0.024 s
% 8.54/2.58 # Presaturation interreduction done
% 8.54/2.58
% 8.54/2.58 # Proof found!
% 8.54/2.58 # SZS status Theorem
% 8.54/2.58 # SZS output start CNFRefutation
% See solution above
% 8.54/2.58 # Training examples: 0 positive, 0 negative
% 8.54/2.58
% 8.54/2.58 # -------------------------------------------------
% 8.54/2.58 # User time : 0.142 s
% 8.54/2.58 # System time : 0.010 s
% 8.54/2.58 # Total time : 0.152 s
% 8.54/2.58 # Maximum resident set size: 7124 pages
% 8.54/2.58
%------------------------------------------------------------------------------