%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL448+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n004.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:46 AM UTC 2026
% Result : Theorem 36.75s 6.99s
% Output : CNFRefutation 36.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 14
% Syntax : Number of clauses : 51 ( 26 unt; 0 nHn; 29 RR)
% Number of literals : 85 ( 3 equ; 38 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 10 ( 8 usr; 8 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 78 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_66,plain,
( is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))
| ~ r5 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_i1fpwz6/input.p',i_0_66) ).
cnf(i_0_56,plain,
r5,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_i1fpwz6/input.p',i_0_56) ).
cnf(i_0_40,plain,
( or(not(X1),X2) = implies(X1,X2)
| ~ op_implies_or ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_i1fpwz6/input.p',i_0_40) ).
cnf(i_0_51,plain,
op_implies_or,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_i1fpwz6/input.p',i_0_51) ).
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-_i1fpwz6/input.p',i_0_34) ).
cnf(i_0_48,plain,
modus_ponens,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_i1fpwz6/input.p',i_0_48) ).
cnf(i_0_60,plain,
( is_a_theorem(implies(X1,or(X2,X1)))
| ~ r2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_i1fpwz6/input.p',i_0_60) ).
cnf(i_0_53,plain,
r2,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_i1fpwz6/input.p',i_0_53) ).
cnf(i_0_62,plain,
( is_a_theorem(implies(or(X1,X2),or(X2,X1)))
| ~ r3 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_i1fpwz6/input.p',i_0_62) ).
cnf(i_0_54,plain,
r3,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_i1fpwz6/input.p',i_0_54) ).
cnf(i_0_58,plain,
( is_a_theorem(implies(or(X1,X1),X1))
| ~ r1 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_i1fpwz6/input.p',i_0_58) ).
cnf(i_0_52,plain,
r1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_i1fpwz6/input.p',i_0_52) ).
cnf(i_0_63,plain,
( r4
| ~ is_a_theorem(implies(or(esk48_0,or(esk49_0,esk50_0)),or(esk49_0,or(esk48_0,esk50_0)))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_i1fpwz6/input.p',i_0_63) ).
cnf(i_0_55,negated_conjecture,
~ r4,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_i1fpwz6/input.p',i_0_55) ).
cnf(c_0_81,plain,
( is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))
| ~ r5 ),
i_0_66 ).
cnf(c_0_82,plain,
r5,
i_0_56 ).
cnf(c_0_83,plain,
( or(not(X1),X2) = implies(X1,X2)
| ~ op_implies_or ),
i_0_40 ).
cnf(c_0_84,plain,
op_implies_or,
i_0_51 ).
cnf(c_0_85,plain,
( is_a_theorem(X1)
| ~ modus_ponens
| ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,X1)) ),
i_0_34 ).
cnf(c_0_86,plain,
modus_ponens,
i_0_48 ).
cnf(c_0_87,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_81,c_0_82])]) ).
cnf(c_0_88,plain,
or(not(X1),X2) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_83,c_0_84])]) ).
cnf(c_0_89,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_85,c_0_86])]) ).
cnf(c_0_90,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),implies(X3,X2)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_88]) ).
cnf(c_0_91,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X1,X3)))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_89,c_0_90]) ).
cnf(c_0_92,plain,
( is_a_theorem(implies(X1,or(X2,X1)))
| ~ r2 ),
i_0_60 ).
cnf(c_0_93,plain,
r2,
i_0_53 ).
cnf(c_0_94,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,X3))
| ~ is_a_theorem(implies(X3,X2)) ),
inference(spm,[status(thm)],[c_0_89,c_0_91]) ).
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_89,c_0_87]) ).
cnf(c_0_96,plain,
( is_a_theorem(implies(or(X1,X2),or(X2,X1)))
| ~ r3 ),
i_0_62 ).
cnf(c_0_97,plain,
r3,
i_0_54 ).
cnf(c_0_98,plain,
is_a_theorem(implies(X1,or(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_92,c_0_93])]) ).
cnf(c_0_99,plain,
( is_a_theorem(implies(or(X1,X2),X3))
| ~ is_a_theorem(implies(or(X1,X4),X3))
| ~ is_a_theorem(implies(X2,X4)) ),
inference(spm,[status(thm)],[c_0_94,c_0_95]) ).
cnf(c_0_100,plain,
is_a_theorem(implies(or(X1,X2),or(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_96,c_0_97])]) ).
cnf(c_0_101,plain,
( is_a_theorem(implies(or(X1,X1),X1))
| ~ r1 ),
i_0_58 ).
cnf(c_0_102,plain,
r1,
i_0_52 ).
cnf(c_0_103,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(or(X3,X1),X2)) ),
inference(spm,[status(thm)],[c_0_94,c_0_98]) ).
cnf(c_0_104,plain,
( is_a_theorem(implies(or(X1,X2),or(X3,X1)))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_99,c_0_100]) ).
cnf(c_0_105,plain,
is_a_theorem(implies(or(X1,X1),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_101,c_0_102])]) ).
cnf(c_0_106,plain,
is_a_theorem(implies(X1,or(X1,X2))),
inference(spm,[status(thm)],[c_0_103,c_0_100]) ).
cnf(c_0_107,plain,
( r4
| ~ is_a_theorem(implies(or(esk48_0,or(esk49_0,esk50_0)),or(esk49_0,or(esk48_0,esk50_0)))) ),
i_0_63 ).
cnf(c_0_108,negated_conjecture,
~ r4,
i_0_55 ).
cnf(c_0_109,plain,
( is_a_theorem(implies(or(X1,X2),X3))
| ~ is_a_theorem(implies(or(X4,X1),X3))
| ~ is_a_theorem(implies(X2,X4)) ),
inference(spm,[status(thm)],[c_0_94,c_0_104]) ).
cnf(c_0_110,plain,
( is_a_theorem(implies(or(X1,X2),X1))
| ~ is_a_theorem(implies(X2,X1)) ),
inference(spm,[status(thm)],[c_0_99,c_0_105]) ).
cnf(c_0_111,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(or(X1,X3),X2)) ),
inference(spm,[status(thm)],[c_0_94,c_0_106]) ).
cnf(c_0_112,plain,
~ is_a_theorem(implies(or(esk48_0,or(esk49_0,esk50_0)),or(esk49_0,or(esk48_0,esk50_0)))),
inference(sr,[status(thm)],[c_0_107,c_0_108]) ).
cnf(c_0_113,plain,
( is_a_theorem(implies(or(X1,X2),X3))
| ~ is_a_theorem(implies(X2,X3))
| ~ is_a_theorem(implies(X1,X3)) ),
inference(spm,[status(thm)],[c_0_109,c_0_110]) ).
cnf(c_0_114,plain,
is_a_theorem(implies(X1,or(X2,or(X1,X3)))),
inference(spm,[status(thm)],[c_0_111,c_0_98]) ).
cnf(c_0_115,plain,
~ is_a_theorem(implies(or(esk49_0,esk50_0),or(esk49_0,or(esk48_0,esk50_0)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_113]),c_0_114])]) ).
cnf(c_0_116,plain,
is_a_theorem(implies(X1,or(X2,or(X3,X1)))),
inference(spm,[status(thm)],[c_0_103,c_0_98]) ).
cnf(c_0_117,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_113]),c_0_116]),c_0_106])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL448+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.03 % Command : enigmatic-eprover.py %s %d 1
% 0.10/0.36 % Computer : n004.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Fri Sep 4 22:48:46 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.21/0.46 # ENIGMATIC: Selected SinE mode:
% 0.21/0.47 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 36.75/6.99 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d60-l8000-e0.15+coop-eprover73:
% 36.75/6.99 # ENIGMA: LightGBM model '/export/starexec/sandbox2/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d60-l8000-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 9; version: 991; iters: 150)
% 36.75/6.99 # Preprocessing time : 2.421 s
% 36.75/6.99 # Presaturation interreduction done
% 36.75/6.99
% 36.75/6.99 # Proof found!
% 36.75/6.99 # SZS status Theorem
% 36.75/6.99 # SZS output start CNFRefutation
% See solution above
% 36.75/6.99 # Training examples: 0 positive, 0 negative
% 36.75/6.99
% 36.75/6.99 # -------------------------------------------------
% 36.75/6.99 # User time : 2.137 s
% 36.75/6.99 # System time : 0.369 s
% 36.75/6.99 # Total time : 2.506 s
% 36.75/6.99 # ...preprocessing : 2.421 s
% 36.75/6.99 # ...main loop : 0.085 s
% 36.75/6.99 # Maximum resident set size: 186984 pages
% 36.75/6.99
%------------------------------------------------------------------------------