TSTP Solution File: NUM401+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM401+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n013.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 : Mon Jul 18 08:35:41 EDT 2022
% Result : Theorem 8.39s 2.49s
% Output : CNFRefutation 8.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 16
% Syntax : Number of clauses : 52 ( 10 unt; 11 nHn; 47 RR)
% Number of literals : 129 ( 24 equ; 70 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 73 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_30,plain,
( in(X1,X2)
| X2 != set_union2(X3,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xsm_3trl/lgb.p',i_0_30) ).
cnf(i_0_103,negated_conjecture,
( ~ ordinal_subset(esk18_0,esk19_0)
| ~ in(esk18_0,set_union2(esk19_0,singleton(esk19_0))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xsm_3trl/lgb.p',i_0_103) ).
cnf(i_0_92,plain,
( ordinal_subset(X1,X2)
| ~ ordinal(X2)
| ~ ordinal(X1)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xsm_3trl/lgb.p',i_0_92) ).
cnf(i_0_104,negated_conjecture,
ordinal(esk19_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xsm_3trl/lgb.p',i_0_104) ).
cnf(i_0_105,negated_conjecture,
ordinal(esk18_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xsm_3trl/lgb.p',i_0_105) ).
cnf(i_0_31,plain,
( in(X1,X2)
| in(X1,X3)
| X4 != set_union2(X3,X2)
| ~ in(X1,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xsm_3trl/lgb.p',i_0_31) ).
cnf(i_0_25,plain,
( subset(X1,X2)
| ~ epsilon_transitive(X2)
| ~ in(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xsm_3trl/lgb.p',i_0_25) ).
cnf(i_0_102,negated_conjecture,
( ordinal_subset(esk18_0,esk19_0)
| in(esk18_0,set_union2(esk19_0,singleton(esk19_0))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xsm_3trl/lgb.p',i_0_102) ).
cnf(i_0_4,plain,
( epsilon_transitive(X1)
| ~ ordinal(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xsm_3trl/lgb.p',i_0_4) ).
cnf(i_0_93,plain,
( subset(X1,X2)
| ~ ordinal(X2)
| ~ ordinal(X1)
| ~ ordinal_subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xsm_3trl/lgb.p',i_0_93) ).
cnf(i_0_22,plain,
( X1 = X2
| X3 != singleton(X2)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xsm_3trl/lgb.p',i_0_22) ).
cnf(i_0_15,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xsm_3trl/lgb.p',i_0_15) ).
cnf(i_0_29,plain,
( in(X1,X2)
| X2 != set_union2(X3,X4)
| ~ in(X1,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xsm_3trl/lgb.p',i_0_29) ).
cnf(i_0_100,plain,
( X1 = X2
| in(X2,X1)
| in(X1,X2)
| ~ ordinal(X2)
| ~ ordinal(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xsm_3trl/lgb.p',i_0_100) ).
cnf(i_0_21,plain,
( in(X1,X2)
| X1 != X3
| X2 != singleton(X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xsm_3trl/lgb.p',i_0_21) ).
cnf(i_0_95,plain,
subset(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xsm_3trl/lgb.p',i_0_95) ).
cnf(c_0_122,plain,
( in(X1,X2)
| X2 != set_union2(X3,X4)
| ~ in(X1,X3) ),
i_0_30 ).
cnf(c_0_123,negated_conjecture,
( ~ ordinal_subset(esk18_0,esk19_0)
| ~ in(esk18_0,set_union2(esk19_0,singleton(esk19_0))) ),
i_0_103 ).
cnf(c_0_124,plain,
( in(X1,set_union2(X2,X3))
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_122]) ).
cnf(c_0_125,negated_conjecture,
( ~ in(esk18_0,esk19_0)
| ~ ordinal_subset(esk18_0,esk19_0) ),
inference(spm,[status(thm)],[c_0_123,c_0_124]) ).
cnf(c_0_126,plain,
( ordinal_subset(X1,X2)
| ~ ordinal(X2)
| ~ ordinal(X1)
| ~ subset(X1,X2) ),
i_0_92 ).
cnf(c_0_127,negated_conjecture,
ordinal(esk19_0),
i_0_104 ).
cnf(c_0_128,negated_conjecture,
ordinal(esk18_0),
i_0_105 ).
cnf(c_0_129,plain,
( in(X1,X2)
| in(X1,X3)
| X4 != set_union2(X3,X2)
| ~ in(X1,X4) ),
i_0_31 ).
cnf(c_0_130,plain,
( ~ subset(esk18_0,esk19_0)
| ~ in(esk18_0,esk19_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_126]),c_0_127]),c_0_128])]) ).
cnf(c_0_131,plain,
( subset(X1,X2)
| ~ epsilon_transitive(X2)
| ~ in(X1,X2) ),
i_0_25 ).
cnf(c_0_132,plain,
( in(X1,X2)
| in(X1,X3)
| ~ in(X1,set_union2(X2,X3)) ),
inference(er,[status(thm)],[c_0_129]) ).
cnf(c_0_133,negated_conjecture,
( ordinal_subset(esk18_0,esk19_0)
| in(esk18_0,set_union2(esk19_0,singleton(esk19_0))) ),
i_0_102 ).
cnf(c_0_134,plain,
( ~ epsilon_transitive(esk19_0)
| ~ in(esk18_0,esk19_0) ),
inference(spm,[status(thm)],[c_0_130,c_0_131]) ).
cnf(c_0_135,plain,
( epsilon_transitive(X1)
| ~ ordinal(X1) ),
i_0_4 ).
cnf(c_0_136,negated_conjecture,
( in(esk18_0,singleton(esk19_0))
| in(esk18_0,esk19_0)
| ordinal_subset(esk18_0,esk19_0) ),
inference(spm,[status(thm)],[c_0_132,c_0_133]) ).
cnf(c_0_137,plain,
~ in(esk18_0,esk19_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_135]),c_0_127])]) ).
cnf(c_0_138,plain,
( subset(X1,X2)
| ~ ordinal(X2)
| ~ ordinal(X1)
| ~ ordinal_subset(X1,X2) ),
i_0_93 ).
cnf(c_0_139,negated_conjecture,
( in(esk18_0,singleton(esk19_0))
| ordinal_subset(esk18_0,esk19_0) ),
inference(sr,[status(thm)],[c_0_136,c_0_137]) ).
cnf(c_0_140,plain,
( X1 = X2
| X3 != singleton(X2)
| ~ in(X1,X3) ),
i_0_22 ).
cnf(c_0_141,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
i_0_15 ).
cnf(c_0_142,plain,
( subset(esk18_0,esk19_0)
| in(esk18_0,singleton(esk19_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_138,c_0_139]),c_0_127]),c_0_128])]) ).
cnf(c_0_143,plain,
( X1 = X2
| ~ in(X1,singleton(X2)) ),
inference(er,[status(thm)],[c_0_140]) ).
cnf(c_0_144,plain,
( in(X1,X2)
| X2 != set_union2(X3,X4)
| ~ in(X1,X4) ),
i_0_29 ).
cnf(c_0_145,plain,
( esk18_0 = esk19_0
| ~ subset(esk19_0,esk18_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_141,c_0_142]),c_0_143]) ).
cnf(c_0_146,plain,
( in(X1,set_union2(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_144]) ).
cnf(c_0_147,plain,
( X1 = X2
| in(X2,X1)
| in(X1,X2)
| ~ ordinal(X2)
| ~ ordinal(X1) ),
i_0_100 ).
cnf(c_0_148,plain,
( esk18_0 = esk19_0
| ~ epsilon_transitive(esk18_0)
| ~ in(esk19_0,esk18_0) ),
inference(spm,[status(thm)],[c_0_145,c_0_131]) ).
cnf(c_0_149,negated_conjecture,
( ~ in(esk18_0,singleton(esk19_0))
| ~ ordinal_subset(esk18_0,esk19_0) ),
inference(spm,[status(thm)],[c_0_123,c_0_146]) ).
cnf(c_0_150,negated_conjecture,
( X1 = esk19_0
| in(X1,esk19_0)
| in(esk19_0,X1)
| ~ ordinal(X1) ),
inference(spm,[status(thm)],[c_0_147,c_0_127]) ).
cnf(c_0_151,plain,
( esk18_0 = esk19_0
| ~ in(esk19_0,esk18_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_148,c_0_135]),c_0_128])]) ).
cnf(c_0_152,plain,
( in(X1,X2)
| X1 != X3
| X2 != singleton(X3) ),
i_0_21 ).
cnf(c_0_153,plain,
( ~ subset(esk18_0,esk19_0)
| ~ in(esk18_0,singleton(esk19_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_149,c_0_126]),c_0_127]),c_0_128])]) ).
cnf(c_0_154,negated_conjecture,
esk18_0 = esk19_0,
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_150,c_0_128]),c_0_137]),c_0_151]) ).
cnf(c_0_155,plain,
subset(X1,X1),
i_0_95 ).
cnf(c_0_156,plain,
in(X1,singleton(X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_152])]) ).
cnf(c_0_157,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_153,c_0_154]),c_0_155]),c_0_154]),c_0_156])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM401+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n013.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jul 7 08:57:01 EDT 2022
% 0.12/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected complete mode:
% 8.39/2.49 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.39/2.49 # No SInE strategy applied
% 8.39/2.49 # Trying AutoSched0 for 150 seconds
% 8.39/2.49 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN
% 8.39/2.49 # and selection function SelectComplexExceptUniqMaxHorn.
% 8.39/2.49 #
% 8.39/2.49 # Preprocessing time : 0.024 s
% 8.39/2.49 # Presaturation interreduction done
% 8.39/2.49
% 8.39/2.49 # Proof found!
% 8.39/2.49 # SZS status Theorem
% 8.39/2.49 # SZS output start CNFRefutation
% See solution above
% 8.39/2.49 # Training examples: 0 positive, 0 negative
% 8.39/2.49
% 8.39/2.49 # -------------------------------------------------
% 8.39/2.49 # User time : 0.036 s
% 8.39/2.49 # System time : 0.009 s
% 8.39/2.49 # Total time : 0.045 s
% 8.39/2.49 # Maximum resident set size: 7120 pages
% 8.39/2.49
%------------------------------------------------------------------------------