TSTP Solution File: SEU238+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU238+3 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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 : Tue Jul 19 08:39:57 EDT 2022
% Result : Theorem 10.28s 2.68s
% Output : CNFRefutation 10.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 16
% Syntax : Number of clauses : 42 ( 7 unt; 9 nHn; 40 RR)
% Number of literals : 116 ( 10 equ; 71 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 49 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-unznw5tj/input.p',i_0_1) ).
cnf(i_0_85,plain,
in(X1,set_union2(X1,singleton(X1))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-unznw5tj/input.p',i_0_85) ).
cnf(i_0_88,plain,
( in(X1,X2)
| ~ ordinal(X2)
| ~ epsilon_transitive(X1)
| ~ proper_subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-unznw5tj/input.p',i_0_88) ).
cnf(i_0_17,plain,
( X1 = X2
| proper_subset(X1,X2)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-unznw5tj/input.p',i_0_17) ).
cnf(i_0_82,plain,
( subset(X1,X2)
| ~ ordinal(X2)
| ~ ordinal(X1)
| ~ ordinal_subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-unznw5tj/input.p',i_0_82) ).
cnf(i_0_91,plain,
( ordinal_subset(set_union2(X1,singleton(X1)),X2)
| ~ ordinal(X2)
| ~ ordinal(X1)
| ~ in(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-unznw5tj/input.p',i_0_91) ).
cnf(i_0_36,plain,
( ordinal(set_union2(X1,singleton(X1)))
| ~ ordinal(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-unznw5tj/input.p',i_0_36) ).
cnf(i_0_97,plain,
( in(set_union2(X1,singleton(X1)),X2)
| ~ ordinal(X1)
| ~ ordinal(X2)
| ~ being_limit_ordinal(X2)
| ~ in(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-unznw5tj/input.p',i_0_97) ).
cnf(i_0_38,plain,
( epsilon_transitive(set_union2(X1,singleton(X1)))
| ~ ordinal(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-unznw5tj/input.p',i_0_38) ).
cnf(i_0_94,plain,
( being_limit_ordinal(X1)
| ~ ordinal(X1)
| ~ in(set_union2(esk15_1(X1),singleton(esk15_1(X1))),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-unznw5tj/input.p',i_0_94) ).
cnf(i_0_96,plain,
( being_limit_ordinal(X1)
| ordinal(esk15_1(X1))
| ~ ordinal(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-unznw5tj/input.p',i_0_96) ).
cnf(i_0_95,plain,
( being_limit_ordinal(X1)
| in(esk15_1(X1),X1)
| ~ ordinal(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-unznw5tj/input.p',i_0_95) ).
cnf(i_0_102,negated_conjecture,
( set_union2(esk17_0,singleton(esk17_0)) = esk16_0
| ~ being_limit_ordinal(esk16_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-unznw5tj/input.p',i_0_102) ).
cnf(i_0_103,negated_conjecture,
( ordinal(esk17_0)
| ~ being_limit_ordinal(esk16_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-unznw5tj/input.p',i_0_103) ).
cnf(i_0_98,negated_conjecture,
( being_limit_ordinal(esk16_0)
| set_union2(X1,singleton(X1)) != esk16_0
| ~ ordinal(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-unznw5tj/input.p',i_0_98) ).
cnf(i_0_104,negated_conjecture,
ordinal(esk16_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-unznw5tj/input.p',i_0_104) ).
cnf(c_0_121,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
i_0_1 ).
cnf(c_0_122,plain,
in(X1,set_union2(X1,singleton(X1))),
i_0_85 ).
cnf(c_0_123,plain,
( in(X1,X2)
| ~ ordinal(X2)
| ~ epsilon_transitive(X1)
| ~ proper_subset(X1,X2) ),
i_0_88 ).
cnf(c_0_124,plain,
( X1 = X2
| proper_subset(X1,X2)
| ~ subset(X1,X2) ),
i_0_17 ).
cnf(c_0_125,plain,
( subset(X1,X2)
| ~ ordinal(X2)
| ~ ordinal(X1)
| ~ ordinal_subset(X1,X2) ),
i_0_82 ).
cnf(c_0_126,plain,
( ordinal_subset(set_union2(X1,singleton(X1)),X2)
| ~ ordinal(X2)
| ~ ordinal(X1)
| ~ in(X1,X2) ),
i_0_91 ).
cnf(c_0_127,plain,
( ordinal(set_union2(X1,singleton(X1)))
| ~ ordinal(X1) ),
i_0_36 ).
cnf(c_0_128,plain,
~ in(set_union2(X1,singleton(X1)),X1),
inference(spm,[status(thm)],[c_0_121,c_0_122]) ).
cnf(c_0_129,plain,
( in(set_union2(X1,singleton(X1)),X2)
| ~ ordinal(X1)
| ~ ordinal(X2)
| ~ being_limit_ordinal(X2)
| ~ in(X1,X2) ),
i_0_97 ).
cnf(c_0_130,plain,
( X1 = X2
| in(X1,X2)
| ~ subset(X1,X2)
| ~ epsilon_transitive(X1)
| ~ ordinal(X2) ),
inference(spm,[status(thm)],[c_0_123,c_0_124]) ).
cnf(c_0_131,plain,
( subset(set_union2(X1,singleton(X1)),X2)
| ~ in(X1,X2)
| ~ ordinal(X2)
| ~ ordinal(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_126]),c_0_127]) ).
cnf(c_0_132,plain,
( epsilon_transitive(set_union2(X1,singleton(X1)))
| ~ ordinal(X1) ),
i_0_38 ).
cnf(c_0_133,plain,
( ~ being_limit_ordinal(X1)
| ~ in(X1,X1)
| ~ ordinal(X1) ),
inference(spm,[status(thm)],[c_0_128,c_0_129]) ).
cnf(c_0_134,plain,
( being_limit_ordinal(X1)
| ~ ordinal(X1)
| ~ in(set_union2(esk15_1(X1),singleton(esk15_1(X1))),X1) ),
i_0_94 ).
cnf(c_0_135,plain,
( set_union2(X1,singleton(X1)) = X2
| in(set_union2(X1,singleton(X1)),X2)
| ~ in(X1,X2)
| ~ ordinal(X2)
| ~ ordinal(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_130,c_0_131]),c_0_132]) ).
cnf(c_0_136,plain,
( being_limit_ordinal(X1)
| ordinal(esk15_1(X1))
| ~ ordinal(X1) ),
i_0_96 ).
cnf(c_0_137,plain,
( being_limit_ordinal(X1)
| in(esk15_1(X1),X1)
| ~ ordinal(X1) ),
i_0_95 ).
cnf(c_0_138,plain,
( ~ being_limit_ordinal(set_union2(X1,singleton(X1)))
| ~ ordinal(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_133,c_0_129]),c_0_122])]),c_0_127]) ).
cnf(c_0_139,negated_conjecture,
( set_union2(esk17_0,singleton(esk17_0)) = esk16_0
| ~ being_limit_ordinal(esk16_0) ),
i_0_102 ).
cnf(c_0_140,negated_conjecture,
( ordinal(esk17_0)
| ~ being_limit_ordinal(esk16_0) ),
i_0_103 ).
cnf(c_0_141,negated_conjecture,
( being_limit_ordinal(esk16_0)
| set_union2(X1,singleton(X1)) != esk16_0
| ~ ordinal(X1) ),
i_0_98 ).
cnf(c_0_142,plain,
( set_union2(esk15_1(X1),singleton(esk15_1(X1))) = X1
| being_limit_ordinal(X1)
| ~ ordinal(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_135]),c_0_136]),c_0_137]) ).
cnf(c_0_143,negated_conjecture,
~ being_limit_ordinal(esk16_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_138,c_0_139]),c_0_140]) ).
cnf(c_0_144,negated_conjecture,
( being_limit_ordinal(X1)
| X1 != esk16_0
| ~ ordinal(X1) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_141,c_0_142]),c_0_143]),c_0_136]) ).
cnf(c_0_145,negated_conjecture,
ordinal(esk16_0),
i_0_104 ).
cnf(c_0_146,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_143,c_0_144]),c_0_145])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU238+3 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n028.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 : Sun Jun 19 09:40:01 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected complete mode:
% 10.28/2.68 # ENIGMATIC: Solved by autoschedule:
% 10.28/2.68 # No SInE strategy applied
% 10.28/2.68 # Trying AutoSched0 for 150 seconds
% 10.28/2.68 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 10.28/2.68 # and selection function SelectMaxLComplexAvoidPosPred.
% 10.28/2.68 #
% 10.28/2.68 # Preprocessing time : 0.014 s
% 10.28/2.68
% 10.28/2.68 # Proof found!
% 10.28/2.68 # SZS status Theorem
% 10.28/2.68 # SZS output start CNFRefutation
% See solution above
% 10.28/2.68 # Training examples: 0 positive, 0 negative
% 10.28/2.68
% 10.28/2.68 # -------------------------------------------------
% 10.28/2.68 # User time : 0.041 s
% 10.28/2.68 # System time : 0.007 s
% 10.28/2.68 # Total time : 0.049 s
% 10.28/2.68 # Maximum resident set size: 7124 pages
% 10.28/2.68
%------------------------------------------------------------------------------