TSTP Solution File: LCL513+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL513+1 : TPTP v8.1.0. Released v3.3.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 : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 09:26:32 EDT 2022
% Result : Theorem 23.64s 4.32s
% Output : CNFRefutation 23.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 16
% Syntax : Number of clauses : 63 ( 32 unt; 0 nHn; 33 RR)
% Number of literals : 105 ( 9 equ; 45 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 11 ( 9 usr; 9 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 97 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_43,plain,
( not(and(X1,not(X2))) = implies(X1,X2)
| ~ op_implies_and ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7sum4y1b/input.p',i_0_43) ).
cnf(i_0_21,plain,
op_implies_and,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7sum4y1b/input.p',i_0_21) ).
cnf(i_0_45,plain,
( not(and(not(X1),not(X2))) = or(X1,X2)
| ~ op_or ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7sum4y1b/input.p',i_0_45) ).
cnf(i_0_22,plain,
op_or,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7sum4y1b/input.p',i_0_22) ).
cnf(i_0_34,plain,
( is_a_theorem(implies(implies(X1,X2),implies(not(and(X2,X3)),not(and(X3,X1)))))
| ~ kn3 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7sum4y1b/input.p',i_0_34) ).
cnf(i_0_64,plain,
kn3,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7sum4y1b/input.p',i_0_64) ).
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-7sum4y1b/input.p',i_0_38) ).
cnf(i_0_65,plain,
modus_ponens,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7sum4y1b/input.p',i_0_65) ).
cnf(i_0_32,plain,
( is_a_theorem(implies(and(X1,X2),X1))
| ~ kn2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7sum4y1b/input.p',i_0_32) ).
cnf(i_0_63,plain,
kn2,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7sum4y1b/input.p',i_0_63) ).
cnf(i_0_30,plain,
( is_a_theorem(implies(X1,and(X1,X1)))
| ~ kn1 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7sum4y1b/input.p',i_0_30) ).
cnf(i_0_62,plain,
kn1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7sum4y1b/input.p',i_0_62) ).
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-7sum4y1b/input.p',i_0_42) ).
cnf(i_0_20,plain,
op_equiv,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7sum4y1b/input.p',i_0_20) ).
cnf(i_0_15,plain,
( equivalence_2
| ~ is_a_theorem(implies(equiv(esk15_0,esk16_0),implies(esk16_0,esk15_0))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7sum4y1b/input.p',i_0_15) ).
cnf(i_0_19,negated_conjecture,
~ equivalence_2,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7sum4y1b/input.p',i_0_19) ).
cnf(c_0_82,plain,
( not(and(X1,not(X2))) = implies(X1,X2)
| ~ op_implies_and ),
i_0_43 ).
cnf(c_0_83,plain,
op_implies_and,
i_0_21 ).
cnf(c_0_84,plain,
( not(and(not(X1),not(X2))) = or(X1,X2)
| ~ op_or ),
i_0_45 ).
cnf(c_0_85,plain,
not(and(X1,not(X2))) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_82,c_0_83])]) ).
cnf(c_0_86,plain,
op_or,
i_0_22 ).
cnf(c_0_87,plain,
( is_a_theorem(implies(implies(X1,X2),implies(not(and(X2,X3)),not(and(X3,X1)))))
| ~ kn3 ),
i_0_34 ).
cnf(c_0_88,plain,
implies(not(X1),X2) = or(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_85]),c_0_86])]) ).
cnf(c_0_89,plain,
kn3,
i_0_64 ).
cnf(c_0_90,plain,
( is_a_theorem(X1)
| ~ modus_ponens
| ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,X1)) ),
i_0_38 ).
cnf(c_0_91,plain,
modus_ponens,
i_0_65 ).
cnf(c_0_92,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_87,c_0_88]),c_0_89])]) ).
cnf(c_0_93,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_90,c_0_91])]) ).
cnf(c_0_94,plain,
is_a_theorem(implies(or(X1,X2),or(and(X2,X3),implies(X3,X1)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_85]),c_0_88]) ).
cnf(c_0_95,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(or(X2,X1))
| ~ is_a_theorem(not(X2)) ),
inference(spm,[status(thm)],[c_0_93,c_0_88]) ).
cnf(c_0_96,plain,
( is_a_theorem(or(and(X1,X2),implies(X2,X3)))
| ~ is_a_theorem(or(X3,X1)) ),
inference(spm,[status(thm)],[c_0_93,c_0_94]) ).
cnf(c_0_97,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(not(and(X3,X1)))
| ~ is_a_theorem(or(X2,X3)) ),
inference(spm,[status(thm)],[c_0_95,c_0_96]) ).
cnf(c_0_98,plain,
( is_a_theorem(implies(and(X1,X2),X1))
| ~ kn2 ),
i_0_32 ).
cnf(c_0_99,plain,
kn2,
i_0_63 ).
cnf(c_0_100,plain,
( is_a_theorem(implies(X1,and(X1,X1)))
| ~ kn1 ),
i_0_30 ).
cnf(c_0_101,plain,
kn1,
i_0_62 ).
cnf(c_0_102,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(implies(X3,X1))
| ~ is_a_theorem(or(X2,X3)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_85]),c_0_88]) ).
cnf(c_0_103,plain,
is_a_theorem(implies(and(X1,X2),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_98,c_0_99])]) ).
cnf(c_0_104,plain,
is_a_theorem(implies(X1,and(X1,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_100,c_0_101])]) ).
cnf(c_0_105,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(or(X2,and(X1,X3))) ),
inference(spm,[status(thm)],[c_0_102,c_0_103]) ).
cnf(c_0_106,plain,
is_a_theorem(or(X1,and(not(X1),not(X1)))),
inference(spm,[status(thm)],[c_0_104,c_0_88]) ).
cnf(c_0_107,plain,
( is_a_theorem(or(and(X1,X2),not(and(X2,X3))))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_93,c_0_92]) ).
cnf(c_0_108,plain,
is_a_theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_105,c_0_106]) ).
cnf(c_0_109,plain,
( is_a_theorem(not(and(X1,X2)))
| ~ is_a_theorem(not(and(X3,X1)))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_95,c_0_107]) ).
cnf(c_0_110,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(or(X2,not(X3)))
| ~ is_a_theorem(or(X3,X1)) ),
inference(spm,[status(thm)],[c_0_102,c_0_88]) ).
cnf(c_0_111,plain,
is_a_theorem(or(X1,not(and(X1,X2)))),
inference(spm,[status(thm)],[c_0_105,c_0_108]) ).
cnf(c_0_112,plain,
( is_a_theorem(not(and(not(X1),X2)))
| ~ is_a_theorem(implies(X3,X1))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_109,c_0_85]) ).
cnf(c_0_113,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(or(and(X2,X3),X1)) ),
inference(spm,[status(thm)],[c_0_110,c_0_111]) ).
cnf(c_0_114,plain,
( is_a_theorem(not(and(not(X1),X2)))
| ~ is_a_theorem(implies(X2,and(X1,X3))) ),
inference(spm,[status(thm)],[c_0_112,c_0_103]) ).
cnf(c_0_115,plain,
( is_a_theorem(or(not(and(X1,X2)),X3))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_113,c_0_107]) ).
cnf(c_0_116,plain,
is_a_theorem(not(and(not(X1),X1))),
inference(spm,[status(thm)],[c_0_114,c_0_104]) ).
cnf(c_0_117,plain,
( is_a_theorem(or(X1,not(and(X2,X3))))
| ~ is_a_theorem(implies(X3,and(X1,X4))) ),
inference(spm,[status(thm)],[c_0_105,c_0_115]) ).
cnf(c_0_118,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(or(X2,not(X1))) ),
inference(spm,[status(thm)],[c_0_97,c_0_116]) ).
cnf(c_0_119,plain,
is_a_theorem(or(X1,not(and(X2,X1)))),
inference(spm,[status(thm)],[c_0_117,c_0_104]) ).
cnf(c_0_120,plain,
( and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2)
| ~ op_equiv ),
i_0_42 ).
cnf(c_0_121,plain,
op_equiv,
i_0_20 ).
cnf(c_0_122,plain,
( equivalence_2
| ~ is_a_theorem(implies(equiv(esk15_0,esk16_0),implies(esk16_0,esk15_0))) ),
i_0_15 ).
cnf(c_0_123,negated_conjecture,
~ equivalence_2,
i_0_19 ).
cnf(c_0_124,plain,
is_a_theorem(implies(and(X1,X2),X2)),
inference(spm,[status(thm)],[c_0_118,c_0_119]) ).
cnf(c_0_125,plain,
and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_120,c_0_121])]) ).
cnf(c_0_126,plain,
~ is_a_theorem(implies(equiv(esk15_0,esk16_0),implies(esk16_0,esk15_0))),
inference(sr,[status(thm)],[c_0_122,c_0_123]) ).
cnf(c_0_127,plain,
is_a_theorem(implies(equiv(X1,X2),implies(X2,X1))),
inference(spm,[status(thm)],[c_0_124,c_0_125]) ).
cnf(c_0_128,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_126,c_0_127])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL513+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n004.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jul 3 18:27:54 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected SinE mode:
% 0.20/0.46 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 23.64/4.32 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d60-l8000-e0.15+coop-eprover73:
% 23.64/4.32 # 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)
% 23.64/4.32 # Preprocessing time : 1.189 s
% 23.64/4.32 # Presaturation interreduction done
% 23.64/4.32
% 23.64/4.32 # Proof found!
% 23.64/4.32 # SZS status Theorem
% 23.64/4.32 # SZS output start CNFRefutation
% See solution above
% 23.64/4.32 # Training examples: 0 positive, 0 negative
% 23.64/4.32
% 23.64/4.32 # -------------------------------------------------
% 23.64/4.32 # User time : 1.818 s
% 23.64/4.32 # System time : 0.145 s
% 23.64/4.32 # Total time : 1.963 s
% 23.64/4.32 # ...preprocessing : 1.189 s
% 23.64/4.32 # ...main loop : 0.774 s
% 23.64/4.32 # Maximum resident set size: 185972 pages
% 23.64/4.32
%------------------------------------------------------------------------------