%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL520+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n019.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:55 AM UTC 2026
% Result : Theorem 26.90s 5.72s
% Output : CNFRefutation 26.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 18
% Syntax : Number of clauses : 60 ( 34 unt; 0 nHn; 28 RR)
% Number of literals : 92 ( 16 equ; 35 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 5 ( 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 : 84 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_40,plain,
( or(not(X1),X2) = implies(X1,X2)
| ~ op_implies_or ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h02w5ahx/input.p',i_0_40) ).
cnf(i_0_50,plain,
op_implies_or,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h02w5ahx/input.p',i_0_50) ).
cnf(i_0_39,plain,
( not(and(X1,not(X2))) = implies(X1,X2)
| ~ op_implies_and ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h02w5ahx/input.p',i_0_39) ).
cnf(i_0_67,plain,
op_implies_and,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h02w5ahx/input.p',i_0_67) ).
cnf(i_0_37,plain,
( not(or(not(X1),not(X2))) = and(X1,X2)
| ~ op_and ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h02w5ahx/input.p',i_0_37) ).
cnf(i_0_48,plain,
op_and,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h02w5ahx/input.p',i_0_48) ).
cnf(i_0_41,plain,
( not(and(not(X1),not(X2))) = or(X1,X2)
| ~ op_or ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h02w5ahx/input.p',i_0_41) ).
cnf(i_0_68,plain,
op_or,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h02w5ahx/input.p',i_0_68) ).
cnf(i_0_30,plain,
( is_a_theorem(implies(implies(X1,X2),implies(not(and(X2,X3)),not(and(X3,X1)))))
| ~ kn3 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h02w5ahx/input.p',i_0_30) ).
cnf(i_0_64,plain,
kn3,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h02w5ahx/input.p',i_0_64) ).
cnf(i_0_34,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-h02w5ahx/input.p',i_0_34) ).
cnf(i_0_65,plain,
modus_ponens,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h02w5ahx/input.p',i_0_65) ).
cnf(i_0_28,plain,
( is_a_theorem(implies(and(X1,X2),X1))
| ~ kn2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h02w5ahx/input.p',i_0_28) ).
cnf(i_0_63,plain,
kn2,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h02w5ahx/input.p',i_0_63) ).
cnf(i_0_26,plain,
( is_a_theorem(implies(X1,and(X1,X1)))
| ~ kn1 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h02w5ahx/input.p',i_0_26) ).
cnf(i_0_62,plain,
kn1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h02w5ahx/input.p',i_0_62) ).
cnf(i_0_56,plain,
( r3
| ~ is_a_theorem(implies(or(esk46_0,esk47_0),or(esk47_0,esk46_0))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h02w5ahx/input.p',i_0_56) ).
cnf(i_0_51,negated_conjecture,
~ r3,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h02w5ahx/input.p',i_0_51) ).
cnf(c_0_87,plain,
( or(not(X1),X2) = implies(X1,X2)
| ~ op_implies_or ),
i_0_40 ).
cnf(c_0_88,plain,
op_implies_or,
i_0_50 ).
cnf(c_0_89,plain,
( not(and(X1,not(X2))) = implies(X1,X2)
| ~ op_implies_and ),
i_0_39 ).
cnf(c_0_90,plain,
op_implies_and,
i_0_67 ).
cnf(c_0_91,plain,
( not(or(not(X1),not(X2))) = and(X1,X2)
| ~ op_and ),
i_0_37 ).
cnf(c_0_92,plain,
or(not(X1),X2) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_87,c_0_88])]) ).
cnf(c_0_93,plain,
op_and,
i_0_48 ).
cnf(c_0_94,plain,
( not(and(not(X1),not(X2))) = or(X1,X2)
| ~ op_or ),
i_0_41 ).
cnf(c_0_95,plain,
not(and(X1,not(X2))) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_89,c_0_90])]) ).
cnf(c_0_96,plain,
op_or,
i_0_68 ).
cnf(c_0_97,plain,
not(implies(X1,not(X2))) = and(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_91,c_0_92]),c_0_93])]) ).
cnf(c_0_98,plain,
( is_a_theorem(implies(implies(X1,X2),implies(not(and(X2,X3)),not(and(X3,X1)))))
| ~ kn3 ),
i_0_30 ).
cnf(c_0_99,plain,
implies(not(X1),X2) = or(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_94,c_0_95]),c_0_96])]) ).
cnf(c_0_100,plain,
kn3,
i_0_64 ).
cnf(c_0_101,plain,
( is_a_theorem(X1)
| ~ modus_ponens
| ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,X1)) ),
i_0_34 ).
cnf(c_0_102,plain,
modus_ponens,
i_0_65 ).
cnf(c_0_103,plain,
or(and(X1,X2),X3) = implies(implies(X1,not(X2)),X3),
inference(spm,[status(thm)],[c_0_92,c_0_97]) ).
cnf(c_0_104,plain,
is_a_theorem(implies(implies(X1,X2),or(and(X2,X3),not(and(X3,X1))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_98,c_0_99]),c_0_100])]) ).
cnf(c_0_105,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_101,c_0_102])]) ).
cnf(c_0_106,plain,
implies(implies(X1,not(not(X2))),X3) = implies(implies(X1,X2),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_95]),c_0_103]) ).
cnf(c_0_107,plain,
( is_a_theorem(implies(and(X1,X2),X1))
| ~ kn2 ),
i_0_28 ).
cnf(c_0_108,plain,
kn2,
i_0_63 ).
cnf(c_0_109,plain,
not(or(X1,not(X2))) = and(not(X1),X2),
inference(spm,[status(thm)],[c_0_97,c_0_99]) ).
cnf(c_0_110,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,not(X3)),not(and(X3,X1))))),
inference(rw,[status(thm)],[c_0_104,c_0_103]) ).
cnf(c_0_111,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X2,not(not(X3))))
| ~ is_a_theorem(implies(implies(X2,X3),X1)) ),
inference(spm,[status(thm)],[c_0_105,c_0_106]) ).
cnf(c_0_112,plain,
is_a_theorem(implies(and(X1,X2),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_107,c_0_108])]) ).
cnf(c_0_113,plain,
and(not(not(X1)),X2) = and(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_92]),c_0_97]) ).
cnf(c_0_114,plain,
( is_a_theorem(implies(implies(X1,not(X2)),not(and(X2,X3))))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_105,c_0_110]) ).
cnf(c_0_115,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(and(X2,X3),X2),X1)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_112]),c_0_113]) ).
cnf(c_0_116,plain,
( is_a_theorem(implies(X1,and(X1,X1)))
| ~ kn1 ),
i_0_26 ).
cnf(c_0_117,plain,
kn1,
i_0_62 ).
cnf(c_0_118,plain,
( is_a_theorem(implies(implies(X1,not(X2)),implies(X2,X3)))
| ~ is_a_theorem(or(X3,X1)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_95]),c_0_99]) ).
cnf(c_0_119,plain,
( is_a_theorem(not(and(X1,X2)))
| ~ is_a_theorem(implies(X2,and(not(X1),X3))) ),
inference(spm,[status(thm)],[c_0_115,c_0_114]) ).
cnf(c_0_120,plain,
is_a_theorem(implies(X1,and(X1,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_116,c_0_117])]) ).
cnf(c_0_121,plain,
( r3
| ~ is_a_theorem(implies(or(esk46_0,esk47_0),or(esk47_0,esk46_0))) ),
i_0_56 ).
cnf(c_0_122,negated_conjecture,
~ r3,
i_0_51 ).
cnf(c_0_123,plain,
( is_a_theorem(implies(implies(X1,X2),or(X2,X3)))
| ~ is_a_theorem(or(X3,X1)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_99]),c_0_106]) ).
cnf(c_0_124,plain,
is_a_theorem(implies(X1,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_120]),c_0_95]) ).
cnf(c_0_125,plain,
~ is_a_theorem(implies(or(esk46_0,esk47_0),or(esk47_0,esk46_0))),
inference(sr,[status(thm)],[c_0_121,c_0_122]) ).
cnf(c_0_126,plain,
( is_a_theorem(implies(or(X1,X2),or(X2,X3)))
| ~ is_a_theorem(or(X3,not(X1))) ),
inference(spm,[status(thm)],[c_0_123,c_0_99]) ).
cnf(c_0_127,plain,
is_a_theorem(or(X1,not(X1))),
inference(spm,[status(thm)],[c_0_124,c_0_99]) ).
cnf(c_0_128,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_126]),c_0_127])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL520+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.03 % Command : enigmatic-eprover.py %s %d 1
% 0.09/0.36 % Computer : n019.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Fri Sep 4 13:24:48 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.21/0.46 # ENIGMATIC: Selected SinE mode:
% 0.21/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 26.90/5.72 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d45-l8000-e0.15+coop-mzr02:
% 26.90/5.72 # ENIGMA: LightGBM model '/export/starexec/sandbox2/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d45-l8000-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 9; version: 991; iters: 150)
% 26.90/5.72 # Preprocessing time : 1.300 s
% 26.90/5.72
% 26.90/5.72 # Proof found!
% 26.90/5.72 # SZS status Theorem
% 26.90/5.72 # SZS output start CNFRefutation
% See solution above
% 26.90/5.73 # Training examples: 0 positive, 0 negative
% 26.90/5.73
% 26.90/5.73 # -------------------------------------------------
% 26.90/5.73 # User time : 1.237 s
% 26.90/5.73 # System time : 0.272 s
% 26.90/5.73 # Total time : 1.509 s
% 26.90/5.73 # ...preprocessing : 1.300 s
% 26.90/5.73 # ...main loop : 0.208 s
% 26.90/5.73 # Maximum resident set size: 176532 pages
% 26.90/5.73
%------------------------------------------------------------------------------