TSTP Solution File: LCL493+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL493+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:23 EDT 2022
% Result : Theorem 8.05s 2.58s
% Output : CNFRefutation 8.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 20
% Syntax : Number of clauses : 62 ( 36 unt; 0 nHn; 31 RR)
% Number of literals : 95 ( 16 equ; 36 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 13 ( 11 usr; 11 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 84 ( 7 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/sandbox2/tmp/enigma-theBenchmark.p-xu1eqdyh/lgb.p',i_0_38) ).
cnf(i_0_52,plain,
modus_ponens,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xu1eqdyh/lgb.p',i_0_52) ).
cnf(i_0_70,plain,
( is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))
| ~ r5 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xu1eqdyh/lgb.p',i_0_70) ).
cnf(i_0_60,plain,
r5,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xu1eqdyh/lgb.p',i_0_60) ).
cnf(i_0_44,plain,
( or(not(X1),X2) = implies(X1,X2)
| ~ op_implies_or ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xu1eqdyh/lgb.p',i_0_44) ).
cnf(i_0_55,plain,
op_implies_or,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xu1eqdyh/lgb.p',i_0_55) ).
cnf(i_0_64,plain,
( is_a_theorem(implies(X1,or(X2,X1)))
| ~ r2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xu1eqdyh/lgb.p',i_0_64) ).
cnf(i_0_57,plain,
r2,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xu1eqdyh/lgb.p',i_0_57) ).
cnf(i_0_66,plain,
( is_a_theorem(implies(or(X1,X2),or(X2,X1)))
| ~ r3 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xu1eqdyh/lgb.p',i_0_66) ).
cnf(i_0_58,plain,
r3,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xu1eqdyh/lgb.p',i_0_58) ).
cnf(i_0_43,plain,
( not(and(X1,not(X2))) = implies(X1,X2)
| ~ op_implies_and ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xu1eqdyh/lgb.p',i_0_43) ).
cnf(i_0_21,plain,
op_implies_and,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xu1eqdyh/lgb.p',i_0_21) ).
cnf(i_0_45,plain,
( not(and(not(X1),not(X2))) = or(X1,X2)
| ~ op_or ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xu1eqdyh/lgb.p',i_0_45) ).
cnf(i_0_22,plain,
op_or,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xu1eqdyh/lgb.p',i_0_22) ).
cnf(i_0_41,plain,
( not(or(not(X1),not(X2))) = and(X1,X2)
| ~ op_and ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xu1eqdyh/lgb.p',i_0_41) ).
cnf(i_0_53,plain,
op_and,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xu1eqdyh/lgb.p',i_0_53) ).
cnf(i_0_42,plain,
( and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2)
| ~ op_equiv ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xu1eqdyh/lgb.p',i_0_42) ).
cnf(i_0_54,plain,
op_equiv,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xu1eqdyh/lgb.p',i_0_54) ).
cnf(i_0_13,plain,
( equivalence_1
| ~ is_a_theorem(implies(equiv(esk13_0,esk14_0),implies(esk13_0,esk14_0))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xu1eqdyh/lgb.p',i_0_13) ).
cnf(i_0_19,negated_conjecture,
~ equivalence_1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xu1eqdyh/lgb.p',i_0_19) ).
cnf(c_0_91,plain,
( is_a_theorem(X1)
| ~ modus_ponens
| ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,X1)) ),
i_0_38 ).
cnf(c_0_92,plain,
modus_ponens,
i_0_52 ).
cnf(c_0_93,plain,
( is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))
| ~ r5 ),
i_0_70 ).
cnf(c_0_94,plain,
r5,
i_0_60 ).
cnf(c_0_95,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_91,c_0_92])]) ).
cnf(c_0_96,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_93,c_0_94])]) ).
cnf(c_0_97,plain,
( is_a_theorem(implies(or(X1,X2),or(X1,X3)))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_95,c_0_96]) ).
cnf(c_0_98,plain,
( or(not(X1),X2) = implies(X1,X2)
| ~ op_implies_or ),
i_0_44 ).
cnf(c_0_99,plain,
op_implies_or,
i_0_55 ).
cnf(c_0_100,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(or(X1,X3))
| ~ is_a_theorem(implies(X3,X2)) ),
inference(spm,[status(thm)],[c_0_95,c_0_97]) ).
cnf(c_0_101,plain,
or(not(X1),X2) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_98,c_0_99])]) ).
cnf(c_0_102,plain,
( is_a_theorem(implies(X1,or(X2,X1)))
| ~ r2 ),
i_0_64 ).
cnf(c_0_103,plain,
r2,
i_0_57 ).
cnf(c_0_104,plain,
( is_a_theorem(implies(or(X1,X2),or(X2,X1)))
| ~ r3 ),
i_0_66 ).
cnf(c_0_105,plain,
r3,
i_0_58 ).
cnf(c_0_106,plain,
( not(and(X1,not(X2))) = implies(X1,X2)
| ~ op_implies_and ),
i_0_43 ).
cnf(c_0_107,plain,
op_implies_and,
i_0_21 ).
cnf(c_0_108,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,X3))
| ~ is_a_theorem(implies(X3,X2)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_101]) ).
cnf(c_0_109,plain,
is_a_theorem(implies(X1,or(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_102,c_0_103])]) ).
cnf(c_0_110,plain,
is_a_theorem(implies(or(X1,X2),or(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_104,c_0_105])]) ).
cnf(c_0_111,plain,
( not(and(not(X1),not(X2))) = or(X1,X2)
| ~ op_or ),
i_0_45 ).
cnf(c_0_112,plain,
not(and(X1,not(X2))) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_106,c_0_107])]) ).
cnf(c_0_113,plain,
op_or,
i_0_22 ).
cnf(c_0_114,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(or(X3,X1),X2)) ),
inference(spm,[status(thm)],[c_0_108,c_0_109]) ).
cnf(c_0_115,plain,
is_a_theorem(implies(or(X1,not(X2)),implies(X2,X1))),
inference(spm,[status(thm)],[c_0_110,c_0_101]) ).
cnf(c_0_116,plain,
implies(not(X1),X2) = or(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_111,c_0_112]),c_0_113])]) ).
cnf(c_0_117,plain,
( not(or(not(X1),not(X2))) = and(X1,X2)
| ~ op_and ),
i_0_41 ).
cnf(c_0_118,plain,
op_and,
i_0_53 ).
cnf(c_0_119,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_95,c_0_110]) ).
cnf(c_0_120,plain,
is_a_theorem(or(X1,implies(X1,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_115]),c_0_116]) ).
cnf(c_0_121,plain,
not(implies(X1,not(X2))) = and(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_117,c_0_101]),c_0_118])]) ).
cnf(c_0_122,plain,
is_a_theorem(or(implies(X1,X2),X1)),
inference(spm,[status(thm)],[c_0_119,c_0_120]) ).
cnf(c_0_123,plain,
or(implies(X1,not(X2)),X3) = implies(and(X1,X2),X3),
inference(spm,[status(thm)],[c_0_116,c_0_121]) ).
cnf(c_0_124,plain,
( and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2)
| ~ op_equiv ),
i_0_42 ).
cnf(c_0_125,plain,
op_equiv,
i_0_54 ).
cnf(c_0_126,plain,
( equivalence_1
| ~ is_a_theorem(implies(equiv(esk13_0,esk14_0),implies(esk13_0,esk14_0))) ),
i_0_13 ).
cnf(c_0_127,negated_conjecture,
~ equivalence_1,
i_0_19 ).
cnf(c_0_128,plain,
is_a_theorem(implies(and(X1,X2),X1)),
inference(spm,[status(thm)],[c_0_122,c_0_123]) ).
cnf(c_0_129,plain,
and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_124,c_0_125])]) ).
cnf(c_0_130,plain,
~ is_a_theorem(implies(equiv(esk13_0,esk14_0),implies(esk13_0,esk14_0))),
inference(sr,[status(thm)],[c_0_126,c_0_127]) ).
cnf(c_0_131,plain,
is_a_theorem(implies(equiv(X1,X2),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_128,c_0_129]) ).
cnf(c_0_132,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_130,c_0_131])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : LCL493+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n004.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sat Jul 2 15:13:54 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.20/0.47 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.05/2.58 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.05/2.58 # No SInE strategy applied
% 8.05/2.58 # Trying AutoSched0 for 150 seconds
% 8.05/2.58 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 8.05/2.58 # and selection function SelectComplexExceptUniqMaxHorn.
% 8.05/2.58 #
% 8.05/2.58 # Preprocessing time : 0.026 s
% 8.05/2.58 # Presaturation interreduction done
% 8.05/2.58
% 8.05/2.58 # Proof found!
% 8.05/2.58 # SZS status Theorem
% 8.05/2.58 # SZS output start CNFRefutation
% See solution above
% 8.05/2.58 # Training examples: 0 positive, 0 negative
% 8.05/2.58
% 8.05/2.58 # -------------------------------------------------
% 8.05/2.58 # User time : 0.143 s
% 8.05/2.58 # System time : 0.014 s
% 8.05/2.58 # Total time : 0.156 s
% 8.05/2.58 # Maximum resident set size: 7124 pages
% 8.05/2.58
%------------------------------------------------------------------------------