TSTP Solution File: LCL485+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL485+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n008.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:21 EDT 2022
% Result : Theorem 23.02s 4.34s
% Output : CNFRefutation 23.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 22
% Syntax : Number of clauses : 87 ( 49 unt; 0 nHn; 43 RR)
% Number of literals : 134 ( 20 equ; 50 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 14 ( 12 usr; 12 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 132 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_38,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-tbhzi357/input.p',i_0_38) ).
cnf(i_0_52,plain,
modus_ponens,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tbhzi357/input.p',i_0_52) ).
cnf(i_0_68,plain,
( is_a_theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3))))
| ~ r4 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tbhzi357/input.p',i_0_68) ).
cnf(i_0_59,plain,
r4,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tbhzi357/input.p',i_0_59) ).
cnf(i_0_44,plain,
( or(not(X1),X2) = implies(X1,X2)
| ~ op_implies_or ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tbhzi357/input.p',i_0_44) ).
cnf(i_0_55,plain,
op_implies_or,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tbhzi357/input.p',i_0_55) ).
cnf(i_0_62,plain,
( is_a_theorem(implies(or(X1,X1),X1))
| ~ r1 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tbhzi357/input.p',i_0_62) ).
cnf(i_0_56,plain,
r1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tbhzi357/input.p',i_0_56) ).
cnf(i_0_64,plain,
( is_a_theorem(implies(X1,or(X2,X1)))
| ~ r2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tbhzi357/input.p',i_0_64) ).
cnf(i_0_57,plain,
r2,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tbhzi357/input.p',i_0_57) ).
cnf(i_0_66,plain,
( is_a_theorem(implies(or(X1,X2),or(X2,X1)))
| ~ r3 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tbhzi357/input.p',i_0_66) ).
cnf(i_0_58,plain,
r3,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tbhzi357/input.p',i_0_58) ).
cnf(i_0_70,plain,
( is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))
| ~ r5 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tbhzi357/input.p',i_0_70) ).
cnf(i_0_60,plain,
r5,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tbhzi357/input.p',i_0_60) ).
cnf(i_0_41,plain,
( not(or(not(X1),not(X2))) = and(X1,X2)
| ~ op_and ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tbhzi357/input.p',i_0_41) ).
cnf(i_0_53,plain,
op_and,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tbhzi357/input.p',i_0_53) ).
cnf(i_0_42,plain,
( and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2)
| ~ op_equiv ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tbhzi357/input.p',i_0_42) ).
cnf(i_0_20,plain,
op_equiv,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tbhzi357/input.p',i_0_20) ).
cnf(i_0_74,plain,
( X1 = X2
| ~ substitution_of_equivalents
| ~ is_a_theorem(equiv(X1,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tbhzi357/input.p',i_0_74) ).
cnf(i_0_71,plain,
substitution_of_equivalents,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tbhzi357/input.p',i_0_71) ).
cnf(i_0_25,plain,
( implies_2
| ~ is_a_theorem(implies(implies(esk21_0,implies(esk21_0,esk22_0)),implies(esk21_0,esk22_0))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tbhzi357/input.p',i_0_25) ).
cnf(i_0_19,negated_conjecture,
~ implies_2,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tbhzi357/input.p',i_0_19) ).
cnf(c_0_97,plain,
( is_a_theorem(X1)
| ~ modus_ponens
| ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,X1)) ),
i_0_38 ).
cnf(c_0_98,plain,
modus_ponens,
i_0_52 ).
cnf(c_0_99,plain,
( is_a_theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3))))
| ~ r4 ),
i_0_68 ).
cnf(c_0_100,plain,
r4,
i_0_59 ).
cnf(c_0_101,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_97,c_0_98])]) ).
cnf(c_0_102,plain,
is_a_theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_99,c_0_100])]) ).
cnf(c_0_103,plain,
( or(not(X1),X2) = implies(X1,X2)
| ~ op_implies_or ),
i_0_44 ).
cnf(c_0_104,plain,
op_implies_or,
i_0_55 ).
cnf(c_0_105,plain,
( is_a_theorem(implies(or(X1,X1),X1))
| ~ r1 ),
i_0_62 ).
cnf(c_0_106,plain,
r1,
i_0_56 ).
cnf(c_0_107,plain,
( is_a_theorem(or(X1,or(X2,X3)))
| ~ is_a_theorem(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_101,c_0_102]) ).
cnf(c_0_108,plain,
or(not(X1),X2) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_103,c_0_104])]) ).
cnf(c_0_109,plain,
( is_a_theorem(implies(X1,or(X2,X1)))
| ~ r2 ),
i_0_64 ).
cnf(c_0_110,plain,
r2,
i_0_57 ).
cnf(c_0_111,plain,
( is_a_theorem(implies(or(X1,X2),or(X2,X1)))
| ~ r3 ),
i_0_66 ).
cnf(c_0_112,plain,
r3,
i_0_58 ).
cnf(c_0_113,plain,
is_a_theorem(implies(or(X1,X1),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_105,c_0_106])]) ).
cnf(c_0_114,plain,
( is_a_theorem(or(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,or(X1,X3))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_108]),c_0_108]) ).
cnf(c_0_115,plain,
is_a_theorem(implies(X1,or(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_109,c_0_110])]) ).
cnf(c_0_116,plain,
is_a_theorem(implies(or(X1,X2),or(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_111,c_0_112])]) ).
cnf(c_0_117,plain,
( is_a_theorem(implies(X1,or(X2,X3)))
| ~ is_a_theorem(or(X2,implies(X1,X3))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_108]),c_0_108]) ).
cnf(c_0_118,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(or(X1,X1)) ),
inference(spm,[status(thm)],[c_0_101,c_0_113]) ).
cnf(c_0_119,plain,
is_a_theorem(or(X1,implies(X2,X2))),
inference(spm,[status(thm)],[c_0_114,c_0_115]) ).
cnf(c_0_120,plain,
( is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))
| ~ r5 ),
i_0_70 ).
cnf(c_0_121,plain,
r5,
i_0_60 ).
cnf(c_0_122,plain,
is_a_theorem(implies(or(X1,not(X2)),implies(X2,X1))),
inference(spm,[status(thm)],[c_0_116,c_0_108]) ).
cnf(c_0_123,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,implies(X1,X3))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_108]),c_0_108]) ).
cnf(c_0_124,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_118,c_0_119]) ).
cnf(c_0_125,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_120,c_0_121])]) ).
cnf(c_0_126,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(or(X2,not(X1))) ),
inference(spm,[status(thm)],[c_0_101,c_0_122]) ).
cnf(c_0_127,plain,
is_a_theorem(implies(X1,implies(implies(X1,X2),X2))),
inference(spm,[status(thm)],[c_0_123,c_0_124]) ).
cnf(c_0_128,plain,
( not(or(not(X1),not(X2))) = and(X1,X2)
| ~ op_and ),
i_0_41 ).
cnf(c_0_129,plain,
op_and,
i_0_53 ).
cnf(c_0_130,plain,
( is_a_theorem(implies(or(X1,X2),or(X1,X3)))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_101,c_0_125]) ).
cnf(c_0_131,plain,
( is_a_theorem(implies(X1,not(X2)))
| ~ is_a_theorem(implies(X2,not(X1))) ),
inference(spm,[status(thm)],[c_0_126,c_0_108]) ).
cnf(c_0_132,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_101,c_0_127]) ).
cnf(c_0_133,plain,
not(implies(X1,not(X2))) = and(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_128,c_0_108]),c_0_129])]) ).
cnf(c_0_134,plain,
is_a_theorem(implies(or(X1,or(X2,X3)),or(X1,or(X3,X2)))),
inference(spm,[status(thm)],[c_0_130,c_0_116]) ).
cnf(c_0_135,plain,
( is_a_theorem(implies(X1,and(X2,X1)))
| ~ is_a_theorem(X2) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_132]),c_0_133]) ).
cnf(c_0_136,plain,
( and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2)
| ~ op_equiv ),
i_0_42 ).
cnf(c_0_137,plain,
op_equiv,
i_0_20 ).
cnf(c_0_138,plain,
( is_a_theorem(or(X1,or(X2,X3)))
| ~ is_a_theorem(or(X1,or(X3,X2))) ),
inference(spm,[status(thm)],[c_0_101,c_0_134]) ).
cnf(c_0_139,plain,
( is_a_theorem(and(X1,X2))
| ~ is_a_theorem(X2)
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_101,c_0_135]) ).
cnf(c_0_140,plain,
and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_136,c_0_137])]) ).
cnf(c_0_141,plain,
( is_a_theorem(implies(X1,or(X2,X3)))
| ~ is_a_theorem(implies(X1,or(X3,X2))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_138,c_0_108]),c_0_108]) ).
cnf(c_0_142,plain,
( X1 = X2
| ~ substitution_of_equivalents
| ~ is_a_theorem(equiv(X1,X2)) ),
i_0_74 ).
cnf(c_0_143,plain,
substitution_of_equivalents,
i_0_71 ).
cnf(c_0_144,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_139,c_0_140]) ).
cnf(c_0_145,plain,
is_a_theorem(implies(X1,or(X1,X2))),
inference(spm,[status(thm)],[c_0_141,c_0_115]) ).
cnf(c_0_146,plain,
( X1 = X2
| ~ is_a_theorem(equiv(X1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_142,c_0_143])]) ).
cnf(c_0_147,plain,
is_a_theorem(equiv(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_144,c_0_102]),c_0_102])]) ).
cnf(c_0_148,plain,
is_a_theorem(equiv(X1,or(X1,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_144,c_0_113]),c_0_145])]) ).
cnf(c_0_149,plain,
is_a_theorem(equiv(or(X1,X2),or(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_144,c_0_116]),c_0_116])]) ).
cnf(c_0_150,plain,
or(X1,or(X2,X3)) = or(X2,or(X1,X3)),
inference(spm,[status(thm)],[c_0_146,c_0_147]) ).
cnf(c_0_151,plain,
or(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_146,c_0_148]) ).
cnf(c_0_152,plain,
or(X1,X2) = or(X2,X1),
inference(spm,[status(thm)],[c_0_146,c_0_149]) ).
cnf(c_0_153,plain,
( implies_2
| ~ is_a_theorem(implies(implies(esk21_0,implies(esk21_0,esk22_0)),implies(esk21_0,esk22_0))) ),
i_0_25 ).
cnf(c_0_154,negated_conjecture,
~ implies_2,
i_0_19 ).
cnf(c_0_155,plain,
or(X1,implies(X2,X3)) = implies(X2,or(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_150]),c_0_108]) ).
cnf(c_0_156,plain,
implies(X1,not(X1)) = not(X1),
inference(spm,[status(thm)],[c_0_108,c_0_151]) ).
cnf(c_0_157,plain,
or(X1,not(X2)) = implies(X2,X1),
inference(spm,[status(thm)],[c_0_108,c_0_152]) ).
cnf(c_0_158,plain,
~ is_a_theorem(implies(implies(esk21_0,implies(esk21_0,esk22_0)),implies(esk21_0,esk22_0))),
inference(sr,[status(thm)],[c_0_153,c_0_154]) ).
cnf(c_0_159,plain,
implies(X1,implies(X2,X3)) = implies(X2,implies(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_155]),c_0_108]) ).
cnf(c_0_160,plain,
implies(X1,implies(X1,X2)) = implies(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_155,c_0_156]),c_0_157]),c_0_157]) ).
cnf(c_0_161,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_158,c_0_159]),c_0_160]),c_0_127])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL485+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n008.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jul 2 15:57:24 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected SinE mode:
% 0.18/0.46 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 23.02/4.34 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d30-l6400-e0.15+coop-eprover66:
% 23.02/4.34 # ENIGMA: LightGBM model '/export/starexec/sandbox/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d30-l6400-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 9; version: 991; iters: 150)
% 23.02/4.34 # Preprocessing time : 0.837 s
% 23.02/4.34 # Presaturation interreduction done
% 23.02/4.34
% 23.02/4.34 # Proof found!
% 23.02/4.34 # SZS status Theorem
% 23.02/4.34 # SZS output start CNFRefutation
% See solution above
% 23.02/4.34 # Training examples: 0 positive, 0 negative
% 23.02/4.34
% 23.02/4.34 # -------------------------------------------------
% 23.02/4.34 # User time : 1.759 s
% 23.02/4.34 # System time : 0.115 s
% 23.02/4.34 # Total time : 1.874 s
% 23.02/4.34 # ...preprocessing : 0.837 s
% 23.02/4.34 # ...main loop : 1.037 s
% 23.02/4.34 # Maximum resident set size: 167592 pages
% 23.02/4.34
%------------------------------------------------------------------------------