TSTP Solution File: SEU236+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU236+3 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n005.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:56 EDT 2022
% Result : Theorem 11.97s 2.89s
% Output : CNFRefutation 11.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 17
% Syntax : Number of clauses : 54 ( 17 unt; 10 nHn; 46 RR)
% Number of literals : 109 ( 12 equ; 48 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 66 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_42,plain,
( ordinal(set_union2(X1,singleton(X1)))
| ~ ordinal(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vgo5wjze/input.p',i_0_42) ).
cnf(i_0_97,negated_conjecture,
ordinal(esk18_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vgo5wjze/input.p',i_0_97) ).
cnf(i_0_19,plain,
( X1 = X2
| X3 != singleton(X2)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vgo5wjze/input.p',i_0_19) ).
cnf(i_0_87,plain,
( subset(X1,X2)
| ~ ordinal(X2)
| ~ ordinal(X1)
| ~ ordinal_subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vgo5wjze/input.p',i_0_87) ).
cnf(i_0_94,negated_conjecture,
( in(esk18_0,esk19_0)
| ordinal_subset(set_union2(esk18_0,singleton(esk18_0)),esk19_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vgo5wjze/input.p',i_0_94) ).
cnf(i_0_96,negated_conjecture,
ordinal(esk19_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vgo5wjze/input.p',i_0_96) ).
cnf(i_0_4,plain,
( epsilon_transitive(X1)
| ~ ordinal(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vgo5wjze/input.p',i_0_4) ).
cnf(i_0_24,plain,
( subset(X1,X2)
| in(esk3_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vgo5wjze/input.p',i_0_24) ).
cnf(i_0_25,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vgo5wjze/input.p',i_0_25) ).
cnf(i_0_90,plain,
in(X1,set_union2(X1,singleton(X1))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vgo5wjze/input.p',i_0_90) ).
cnf(i_0_22,plain,
( subset(X1,X2)
| ~ epsilon_transitive(X2)
| ~ in(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vgo5wjze/input.p',i_0_22) ).
cnf(i_0_23,plain,
( subset(X1,X2)
| ~ in(esk3_2(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vgo5wjze/input.p',i_0_23) ).
cnf(i_0_18,plain,
( in(X1,X2)
| X1 != X3
| X2 != singleton(X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vgo5wjze/input.p',i_0_18) ).
cnf(i_0_86,plain,
( ordinal_subset(X1,X2)
| ~ ordinal(X2)
| ~ ordinal(X1)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vgo5wjze/input.p',i_0_86) ).
cnf(i_0_95,negated_conjecture,
( ~ in(esk18_0,esk19_0)
| ~ ordinal_subset(set_union2(esk18_0,singleton(esk18_0)),esk19_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vgo5wjze/input.p',i_0_95) ).
cnf(i_0_105,plain,
( subset(set_union2(X1,X2),X3)
| ~ subset(X2,X3)
| ~ subset(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vgo5wjze/input.p',i_0_105) ).
cnf(i_0_13,plain,
set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vgo5wjze/input.p',i_0_13) ).
cnf(c_0_123,plain,
( ordinal(set_union2(X1,singleton(X1)))
| ~ ordinal(X1) ),
i_0_42 ).
cnf(c_0_124,negated_conjecture,
ordinal(esk18_0),
i_0_97 ).
cnf(c_0_125,plain,
( X1 = X2
| X3 != singleton(X2)
| ~ in(X1,X3) ),
i_0_19 ).
cnf(c_0_126,plain,
( subset(X1,X2)
| ~ ordinal(X2)
| ~ ordinal(X1)
| ~ ordinal_subset(X1,X2) ),
i_0_87 ).
cnf(c_0_127,negated_conjecture,
( in(esk18_0,esk19_0)
| ordinal_subset(set_union2(esk18_0,singleton(esk18_0)),esk19_0) ),
i_0_94 ).
cnf(c_0_128,negated_conjecture,
ordinal(esk19_0),
i_0_96 ).
cnf(c_0_129,negated_conjecture,
ordinal(set_union2(esk18_0,singleton(esk18_0))),
inference(spm,[status(thm)],[c_0_123,c_0_124]) ).
cnf(c_0_130,plain,
( epsilon_transitive(X1)
| ~ ordinal(X1) ),
i_0_4 ).
cnf(c_0_131,plain,
( X1 = X2
| ~ in(X1,singleton(X2)) ),
inference(er,[status(thm)],[c_0_125]) ).
cnf(c_0_132,plain,
( subset(X1,X2)
| in(esk3_2(X1,X2),X1) ),
i_0_24 ).
cnf(c_0_133,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
i_0_25 ).
cnf(c_0_134,plain,
in(X1,set_union2(X1,singleton(X1))),
i_0_90 ).
cnf(c_0_135,plain,
( subset(X1,X2)
| ~ epsilon_transitive(X2)
| ~ in(X1,X2) ),
i_0_22 ).
cnf(c_0_136,negated_conjecture,
( in(esk18_0,esk19_0)
| subset(set_union2(esk18_0,singleton(esk18_0)),esk19_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_126,c_0_127]),c_0_128])]),c_0_129])]) ).
cnf(c_0_137,negated_conjecture,
epsilon_transitive(esk19_0),
inference(spm,[status(thm)],[c_0_130,c_0_128]) ).
cnf(c_0_138,plain,
( subset(X1,X2)
| ~ in(esk3_2(X1,X2),X2) ),
i_0_23 ).
cnf(c_0_139,plain,
( esk3_2(singleton(X1),X2) = X1
| subset(singleton(X1),X2) ),
inference(spm,[status(thm)],[c_0_131,c_0_132]) ).
cnf(c_0_140,plain,
( in(X1,X2)
| X1 != X3
| X2 != singleton(X3) ),
i_0_18 ).
cnf(c_0_141,plain,
( in(X1,X2)
| ~ subset(set_union2(X1,singleton(X1)),X2) ),
inference(spm,[status(thm)],[c_0_133,c_0_134]) ).
cnf(c_0_142,plain,
( subset(set_union2(esk18_0,singleton(esk18_0)),esk19_0)
| subset(esk18_0,esk19_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_135,c_0_136]),c_0_137])]) ).
cnf(c_0_143,plain,
( ordinal_subset(X1,X2)
| ~ ordinal(X2)
| ~ ordinal(X1)
| ~ subset(X1,X2) ),
i_0_86 ).
cnf(c_0_144,plain,
( subset(singleton(X1),X2)
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_138,c_0_139]) ).
cnf(c_0_145,plain,
in(X1,singleton(X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_140])]) ).
cnf(c_0_146,negated_conjecture,
( ~ in(esk18_0,esk19_0)
| ~ ordinal_subset(set_union2(esk18_0,singleton(esk18_0)),esk19_0) ),
i_0_95 ).
cnf(c_0_147,plain,
( in(esk18_0,esk19_0)
| subset(esk18_0,esk19_0) ),
inference(spm,[status(thm)],[c_0_141,c_0_142]) ).
cnf(c_0_148,plain,
( ordinal_subset(set_union2(esk18_0,singleton(esk18_0)),esk19_0)
| subset(esk18_0,esk19_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_143,c_0_142]),c_0_128]),c_0_129])]) ).
cnf(c_0_149,negated_conjecture,
( subset(set_union2(esk18_0,singleton(esk18_0)),esk19_0)
| subset(singleton(esk18_0),esk19_0) ),
inference(spm,[status(thm)],[c_0_144,c_0_136]) ).
cnf(c_0_150,plain,
( in(X1,X2)
| ~ subset(singleton(X1),X2) ),
inference(spm,[status(thm)],[c_0_133,c_0_145]) ).
cnf(c_0_151,plain,
( subset(set_union2(X1,X2),X3)
| ~ subset(X2,X3)
| ~ subset(X1,X3) ),
i_0_105 ).
cnf(c_0_152,negated_conjecture,
subset(esk18_0,esk19_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_146,c_0_147]),c_0_148]) ).
cnf(c_0_153,plain,
in(esk18_0,esk19_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_141,c_0_149]),c_0_150]) ).
cnf(c_0_154,plain,
( subset(set_union2(X1,esk18_0),esk19_0)
| ~ subset(X1,esk19_0) ),
inference(spm,[status(thm)],[c_0_151,c_0_152]) ).
cnf(c_0_155,plain,
subset(singleton(esk18_0),esk19_0),
inference(spm,[status(thm)],[c_0_144,c_0_153]) ).
cnf(c_0_156,plain,
set_union2(X1,X2) = set_union2(X2,X1),
i_0_13 ).
cnf(c_0_157,plain,
subset(set_union2(esk18_0,singleton(esk18_0)),esk19_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_154,c_0_155]),c_0_156]) ).
cnf(c_0_158,negated_conjecture,
~ ordinal_subset(set_union2(esk18_0,singleton(esk18_0)),esk19_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_146,c_0_153])]) ).
cnf(c_0_159,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_143,c_0_157]),c_0_128]),c_0_129])]),c_0_158]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU236+3 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n005.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jun 19 10:37:25 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 11.97/2.89 # ENIGMATIC: Solved by autoschedule:
% 11.97/2.89 # No SInE strategy applied
% 11.97/2.89 # Trying AutoSched0 for 150 seconds
% 11.97/2.89 # AutoSched0-Mode selected heuristic G_E___200_B02_F1_SE_CS_SP_PI_S0S
% 11.97/2.89 # and selection function SelectComplexG.
% 11.97/2.89 #
% 11.97/2.89 # Preprocessing time : 0.013 s
% 11.97/2.89
% 11.97/2.89 # Proof found!
% 11.97/2.89 # SZS status Theorem
% 11.97/2.89 # SZS output start CNFRefutation
% See solution above
% 11.97/2.89 # Training examples: 0 positive, 0 negative
% 11.97/2.89
% 11.97/2.89 # -------------------------------------------------
% 11.97/2.89 # User time : 0.505 s
% 11.97/2.89 # System time : 0.026 s
% 11.97/2.89 # Total time : 0.532 s
% 11.97/2.89 # Maximum resident set size: 7120 pages
% 11.97/2.89
%------------------------------------------------------------------------------