TSTP Solution File: LCL457+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL457+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n009.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 : 600s
% DateTime : Sun Jul 17 09:26:11 EDT 2022
% Result : Theorem 25.44s 4.47s
% Output : CNFRefutation 25.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 28
% Syntax : Number of clauses : 96 ( 53 unt; 0 nHn; 47 RR)
% Number of literals : 150 ( 22 equ; 59 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 17 ( 15 usr; 15 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 141 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_56,plain,
( not(and(X1,not(X2))) = implies(X1,X2)
| ~ op_implies_and ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nar_ok9c/input.p',i_0_56) ).
cnf(i_0_31,plain,
op_implies_and,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nar_ok9c/input.p',i_0_31) ).
cnf(i_0_57,plain,
( or(not(X1),X2) = implies(X1,X2)
| ~ op_implies_or ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nar_ok9c/input.p',i_0_57) ).
cnf(i_0_67,plain,
op_implies_or,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nar_ok9c/input.p',i_0_67) ).
cnf(i_0_58,plain,
( not(and(not(X1),not(X2))) = or(X1,X2)
| ~ op_or ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nar_ok9c/input.p',i_0_58) ).
cnf(i_0_32,plain,
op_or,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nar_ok9c/input.p',i_0_32) ).
cnf(i_0_54,plain,
( not(or(not(X1),not(X2))) = and(X1,X2)
| ~ op_and ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nar_ok9c/input.p',i_0_54) ).
cnf(i_0_65,plain,
op_and,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nar_ok9c/input.p',i_0_65) ).
cnf(i_0_51,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-nar_ok9c/input.p',i_0_51) ).
cnf(i_0_28,plain,
modus_ponens,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nar_ok9c/input.p',i_0_28) ).
cnf(i_0_18,plain,
( is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X1),equiv(X1,X2))))
| ~ equivalence_3 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nar_ok9c/input.p',i_0_18) ).
cnf(i_0_24,plain,
equivalence_3,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nar_ok9c/input.p',i_0_24) ).
cnf(i_0_53,plain,
( is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1)))
| ~ modus_tollens ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nar_ok9c/input.p',i_0_53) ).
cnf(i_0_29,plain,
modus_tollens,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nar_ok9c/input.p',i_0_29) ).
cnf(i_0_82,plain,
( X1 = X2
| ~ substitution_of_equivalents
| ~ is_a_theorem(equiv(X1,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nar_ok9c/input.p',i_0_82) ).
cnf(i_0_79,plain,
substitution_of_equivalents,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nar_ok9c/input.p',i_0_79) ).
cnf(i_0_41,plain,
( is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))
| ~ implies_3 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nar_ok9c/input.p',i_0_41) ).
cnf(i_0_27,plain,
implies_3,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nar_ok9c/input.p',i_0_27) ).
cnf(i_0_64,plain,
( is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X2),implies(or(X1,X3),X2))))
| ~ or_3 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nar_ok9c/input.p',i_0_64) ).
cnf(i_0_35,plain,
or_3,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nar_ok9c/input.p',i_0_35) ).
cnf(i_0_77,plain,
( r5
| ~ is_a_theorem(implies(implies(esk52_0,esk53_0),implies(or(esk51_0,esk52_0),or(esk51_0,esk53_0)))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nar_ok9c/input.p',i_0_77) ).
cnf(i_0_75,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/sandbox/tmp/enigma-theBenchmark.p-nar_ok9c/input.p',i_0_75) ).
cnf(i_0_68,negated_conjecture,
~ r4,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nar_ok9c/input.p',i_0_68) ).
cnf(i_0_78,plain,
( is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))
| ~ r5 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nar_ok9c/input.p',i_0_78) ).
cnf(i_0_62,plain,
( is_a_theorem(implies(X1,or(X2,X1)))
| ~ or_2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nar_ok9c/input.p',i_0_62) ).
cnf(i_0_34,plain,
or_2,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nar_ok9c/input.p',i_0_34) ).
cnf(i_0_60,plain,
( is_a_theorem(implies(X1,or(X1,X2)))
| ~ or_1 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nar_ok9c/input.p',i_0_60) ).
cnf(i_0_33,plain,
or_1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nar_ok9c/input.p',i_0_33) ).
cnf(c_0_111,plain,
( not(and(X1,not(X2))) = implies(X1,X2)
| ~ op_implies_and ),
i_0_56 ).
cnf(c_0_112,plain,
op_implies_and,
i_0_31 ).
cnf(c_0_113,plain,
( or(not(X1),X2) = implies(X1,X2)
| ~ op_implies_or ),
i_0_57 ).
cnf(c_0_114,plain,
op_implies_or,
i_0_67 ).
cnf(c_0_115,plain,
( not(and(not(X1),not(X2))) = or(X1,X2)
| ~ op_or ),
i_0_58 ).
cnf(c_0_116,plain,
not(and(X1,not(X2))) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_111,c_0_112])]) ).
cnf(c_0_117,plain,
op_or,
i_0_32 ).
cnf(c_0_118,plain,
( not(or(not(X1),not(X2))) = and(X1,X2)
| ~ op_and ),
i_0_54 ).
cnf(c_0_119,plain,
or(not(X1),X2) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_113,c_0_114])]) ).
cnf(c_0_120,plain,
op_and,
i_0_65 ).
cnf(c_0_121,plain,
( is_a_theorem(X1)
| ~ modus_ponens
| ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,X1)) ),
i_0_51 ).
cnf(c_0_122,plain,
modus_ponens,
i_0_28 ).
cnf(c_0_123,plain,
( is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X1),equiv(X1,X2))))
| ~ equivalence_3 ),
i_0_18 ).
cnf(c_0_124,plain,
equivalence_3,
i_0_24 ).
cnf(c_0_125,plain,
implies(not(X1),X2) = or(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_115,c_0_116]),c_0_117])]) ).
cnf(c_0_126,plain,
not(implies(X1,not(X2))) = and(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_118,c_0_119]),c_0_120])]) ).
cnf(c_0_127,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_121,c_0_122])]) ).
cnf(c_0_128,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X1),equiv(X1,X2)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_123,c_0_124])]) ).
cnf(c_0_129,plain,
( is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1)))
| ~ modus_tollens ),
i_0_53 ).
cnf(c_0_130,plain,
modus_tollens,
i_0_29 ).
cnf(c_0_131,plain,
or(and(X1,not(X2)),X3) = implies(implies(X1,X2),X3),
inference(spm,[status(thm)],[c_0_125,c_0_116]) ).
cnf(c_0_132,plain,
or(and(X1,X2),X3) = implies(implies(X1,not(X2)),X3),
inference(spm,[status(thm)],[c_0_119,c_0_126]) ).
cnf(c_0_133,plain,
( X1 = X2
| ~ substitution_of_equivalents
| ~ is_a_theorem(equiv(X1,X2)) ),
i_0_82 ).
cnf(c_0_134,plain,
substitution_of_equivalents,
i_0_79 ).
cnf(c_0_135,plain,
( is_a_theorem(implies(implies(X1,X2),equiv(X2,X1)))
| ~ is_a_theorem(implies(X2,X1)) ),
inference(spm,[status(thm)],[c_0_127,c_0_128]) ).
cnf(c_0_136,plain,
is_a_theorem(implies(or(X1,not(X2)),implies(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_129,c_0_125]),c_0_130])]) ).
cnf(c_0_137,plain,
implies(implies(X1,not(not(X2))),X3) = implies(implies(X1,X2),X3),
inference(rw,[status(thm)],[c_0_131,c_0_132]) ).
cnf(c_0_138,plain,
( X1 = X2
| ~ is_a_theorem(equiv(X1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_133,c_0_134])]) ).
cnf(c_0_139,plain,
( is_a_theorem(equiv(X1,X2))
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_127,c_0_135]) ).
cnf(c_0_140,plain,
is_a_theorem(implies(or(X1,not(not(X2))),or(X2,X1))),
inference(spm,[status(thm)],[c_0_136,c_0_125]) ).
cnf(c_0_141,plain,
implies(or(X1,not(not(X2))),X3) = implies(or(X1,X2),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_137,c_0_125]),c_0_125]) ).
cnf(c_0_142,plain,
( is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))
| ~ implies_3 ),
i_0_41 ).
cnf(c_0_143,plain,
implies_3,
i_0_27 ).
cnf(c_0_144,plain,
is_a_theorem(implies(implies(X1,not(X2)),implies(X2,not(X1)))),
inference(spm,[status(thm)],[c_0_136,c_0_119]) ).
cnf(c_0_145,plain,
( X1 = X2
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_138,c_0_139]) ).
cnf(c_0_146,plain,
is_a_theorem(implies(or(X1,X2),or(X2,X1))),
inference(rw,[status(thm)],[c_0_140,c_0_141]) ).
cnf(c_0_147,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_142,c_0_143])]) ).
cnf(c_0_148,plain,
is_a_theorem(implies(implies(X1,X2),or(X2,not(X1)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_144,c_0_137]),c_0_125]) ).
cnf(c_0_149,plain,
( is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X2),implies(or(X1,X3),X2))))
| ~ or_3 ),
i_0_64 ).
cnf(c_0_150,plain,
or_3,
i_0_35 ).
cnf(c_0_151,plain,
( r5
| ~ is_a_theorem(implies(implies(esk52_0,esk53_0),implies(or(esk51_0,esk52_0),or(esk51_0,esk53_0)))) ),
i_0_77 ).
cnf(c_0_152,plain,
or(X1,X2) = or(X2,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_145,c_0_146]),c_0_146])]) ).
cnf(c_0_153,plain,
is_a_theorem(implies(or(X1,X2),implies(implies(X2,X3),or(X1,X3)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_147,c_0_125]),c_0_125]) ).
cnf(c_0_154,plain,
or(X1,not(X2)) = implies(X2,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_145,c_0_136]),c_0_148])]) ).
cnf(c_0_155,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X2),implies(or(X1,X3),X2)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_149,c_0_150])]) ).
cnf(c_0_156,plain,
( r5
| ~ is_a_theorem(implies(implies(esk52_0,esk53_0),implies(or(esk52_0,esk51_0),or(esk53_0,esk51_0)))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_151,c_0_152]),c_0_152]) ).
cnf(c_0_157,plain,
is_a_theorem(implies(implies(X1,X2),implies(or(X1,X3),or(X2,X3)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_153,c_0_125]),c_0_154]) ).
cnf(c_0_158,plain,
( r4
| ~ is_a_theorem(implies(or(esk48_0,or(esk49_0,esk50_0)),or(esk49_0,or(esk48_0,esk50_0)))) ),
i_0_75 ).
cnf(c_0_159,negated_conjecture,
~ r4,
i_0_68 ).
cnf(c_0_160,plain,
( is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),X2)))
| ~ is_a_theorem(implies(X3,X2)) ),
inference(spm,[status(thm)],[c_0_127,c_0_155]) ).
cnf(c_0_161,plain,
( is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))
| ~ r5 ),
i_0_78 ).
cnf(c_0_162,plain,
r5,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_156,c_0_157])]) ).
cnf(c_0_163,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_158,c_0_159]) ).
cnf(c_0_164,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_127,c_0_160]) ).
cnf(c_0_165,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_161,c_0_162])]) ).
cnf(c_0_166,plain,
( is_a_theorem(implies(X1,or(X2,X1)))
| ~ or_2 ),
i_0_62 ).
cnf(c_0_167,plain,
or_2,
i_0_34 ).
cnf(c_0_168,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_127,c_0_147]) ).
cnf(c_0_169,plain,
( ~ is_a_theorem(implies(or(esk49_0,esk50_0),or(esk49_0,or(esk48_0,esk50_0))))
| ~ is_a_theorem(implies(esk48_0,or(esk49_0,or(esk48_0,esk50_0)))) ),
inference(spm,[status(thm)],[c_0_163,c_0_164]) ).
cnf(c_0_170,plain,
( is_a_theorem(implies(or(X1,X2),or(X1,X3)))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_127,c_0_165]) ).
cnf(c_0_171,plain,
is_a_theorem(implies(X1,or(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_166,c_0_167])]) ).
cnf(c_0_172,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X3,X2))
| ~ is_a_theorem(implies(X1,X3)) ),
inference(spm,[status(thm)],[c_0_127,c_0_168]) ).
cnf(c_0_173,plain,
( is_a_theorem(implies(X1,or(X1,X2)))
| ~ or_1 ),
i_0_60 ).
cnf(c_0_174,plain,
or_1,
i_0_33 ).
cnf(c_0_175,plain,
~ is_a_theorem(implies(esk48_0,or(esk49_0,or(esk48_0,esk50_0)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_169,c_0_170]),c_0_171])]) ).
cnf(c_0_176,plain,
( is_a_theorem(implies(X1,or(X2,X3)))
| ~ is_a_theorem(implies(X1,X3)) ),
inference(spm,[status(thm)],[c_0_172,c_0_171]) ).
cnf(c_0_177,plain,
is_a_theorem(implies(X1,or(X1,X2))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_173,c_0_174])]) ).
cnf(c_0_178,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_175,c_0_176]),c_0_177])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LCL457+1 : TPTP v8.1.0. Released v3.3.0.
% 0.00/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.32 % Computer : n009.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Sun Jul 3 16:27:54 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.17/0.43 # ENIGMATIC: Selected SinE mode:
% 0.17/0.44 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.44 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.17/0.44 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.17/0.44 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 25.44/4.47 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d60-l8000-e0.15+coop-eprover73:
% 25.44/4.47 # ENIGMA: LightGBM model '/export/starexec/sandbox/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)
% 25.44/4.47 # Preprocessing time : 1.217 s
% 25.44/4.47 # Presaturation interreduction done
% 25.44/4.47
% 25.44/4.47 # Proof found!
% 25.44/4.47 # SZS status Theorem
% 25.44/4.47 # SZS output start CNFRefutation
% See solution above
% 25.44/4.47 # Training examples: 0 positive, 0 negative
% 25.44/4.47
% 25.44/4.47 # -------------------------------------------------
% 25.44/4.47 # User time : 2.314 s
% 25.44/4.47 # System time : 0.139 s
% 25.44/4.47 # Total time : 2.453 s
% 25.44/4.47 # ...preprocessing : 1.217 s
% 25.44/4.47 # ...main loop : 1.236 s
% 25.44/4.47 # Maximum resident set size: 186164 pages
% 25.44/4.47
%------------------------------------------------------------------------------