TSTP Solution File: SEU156+2 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SEU156+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n006.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:38:57 EDT 2022

% Result   : Theorem 8.46s 2.62s
% Output   : CNFRefutation 8.46s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   57 (  19 unt;  23 nHn;  49 RR)
%            Number of literals    :  113 (  88 equ;  36 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   71 (  13 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_106,negated_conjecture,
    unordered_pair(unordered_pair(esk15_0,esk16_0),unordered_pair(esk15_0,esk15_0)) = unordered_pair(unordered_pair(esk17_0,esk18_0),unordered_pair(esk17_0,esk17_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yfaacrtz/lgb.p',i_0_106) ).

cnf(i_0_3,plain,
    unordered_pair(X1,X2) = unordered_pair(X2,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yfaacrtz/lgb.p',i_0_3) ).

cnf(i_0_23,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != unordered_pair(X3,X4) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yfaacrtz/lgb.p',i_0_23) ).

cnf(i_0_91,lemma,
    ( X1 = X2
    | X1 = X3
    | unordered_pair(X1,X4) != unordered_pair(X3,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yfaacrtz/lgb.p',i_0_91) ).

cnf(i_0_22,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != unordered_pair(X4,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yfaacrtz/lgb.p',i_0_22) ).

cnf(i_0_24,plain,
    ( X1 = X2
    | X1 = X3
    | X4 != unordered_pair(X3,X2)
    | ~ in(X1,X4) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yfaacrtz/lgb.p',i_0_24) ).

cnf(i_0_105,negated_conjecture,
    ( esk15_0 != esk17_0
    | esk16_0 != esk18_0 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yfaacrtz/lgb.p',i_0_105) ).

cnf(i_0_78,lemma,
    ( subset(unordered_pair(X1,X1),X2)
    | ~ in(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yfaacrtz/lgb.p',i_0_78) ).

cnf(i_0_13,plain,
    ( X1 = empty_set
    | in(esk2_1(X1),X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yfaacrtz/lgb.p',i_0_13) ).

cnf(i_0_126,lemma,
    ( X1 = X2
    | ~ subset(unordered_pair(X1,X1),unordered_pair(X2,X2)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yfaacrtz/lgb.p',i_0_126) ).

cnf(i_0_74,lemma,
    unordered_pair(X1,X1) != empty_set,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yfaacrtz/lgb.p',i_0_74) ).

cnf(c_0_138,negated_conjecture,
    unordered_pair(unordered_pair(esk15_0,esk16_0),unordered_pair(esk15_0,esk15_0)) = unordered_pair(unordered_pair(esk17_0,esk18_0),unordered_pair(esk17_0,esk17_0)),
    i_0_106 ).

cnf(c_0_139,plain,
    unordered_pair(X1,X2) = unordered_pair(X2,X1),
    i_0_3 ).

cnf(c_0_140,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != unordered_pair(X3,X4) ),
    i_0_23 ).

cnf(c_0_141,lemma,
    ( X1 = X2
    | X1 = X3
    | unordered_pair(X1,X4) != unordered_pair(X3,X2) ),
    i_0_91 ).

cnf(c_0_142,negated_conjecture,
    unordered_pair(unordered_pair(esk16_0,esk15_0),unordered_pair(esk15_0,esk15_0)) = unordered_pair(unordered_pair(esk18_0,esk17_0),unordered_pair(esk17_0,esk17_0)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_138,c_0_139]),c_0_139]) ).

cnf(c_0_143,plain,
    ( in(X1,X2)
    | X2 != unordered_pair(X1,X3) ),
    inference(er,[status(thm)],[c_0_140]) ).

cnf(c_0_144,negated_conjecture,
    ( unordered_pair(esk16_0,esk15_0) = X1
    | unordered_pair(esk16_0,esk15_0) = X2
    | unordered_pair(unordered_pair(esk18_0,esk17_0),unordered_pair(esk17_0,esk17_0)) != unordered_pair(X1,X2) ),
    inference(spm,[status(thm)],[c_0_141,c_0_142]) ).

cnf(c_0_145,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != unordered_pair(X4,X3) ),
    i_0_22 ).

cnf(c_0_146,plain,
    ( X1 = X2
    | X1 = X3
    | X4 != unordered_pair(X3,X2)
    | ~ in(X1,X4) ),
    i_0_24 ).

cnf(c_0_147,plain,
    in(X1,unordered_pair(X1,X2)),
    inference(er,[status(thm)],[c_0_143]) ).

cnf(c_0_148,negated_conjecture,
    ( unordered_pair(esk17_0,esk17_0) = unordered_pair(esk16_0,esk15_0)
    | unordered_pair(esk16_0,esk15_0) = unordered_pair(esk18_0,esk17_0) ),
    inference(er,[status(thm)],[c_0_144]) ).

cnf(c_0_149,plain,
    ( in(X1,X2)
    | X2 != unordered_pair(X3,X1) ),
    inference(er,[status(thm)],[c_0_145]) ).

cnf(c_0_150,negated_conjecture,
    ( X1 = unordered_pair(esk16_0,esk15_0)
    | X1 = unordered_pair(esk15_0,esk15_0)
    | unordered_pair(X1,X2) != unordered_pair(unordered_pair(esk18_0,esk17_0),unordered_pair(esk17_0,esk17_0)) ),
    inference(spm,[status(thm)],[c_0_141,c_0_142]) ).

cnf(c_0_151,plain,
    ( X1 = X2
    | X1 = X3
    | ~ in(X1,unordered_pair(X2,X3)) ),
    inference(er,[status(thm)],[c_0_146]) ).

cnf(c_0_152,plain,
    in(esk17_0,unordered_pair(esk16_0,esk15_0)),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_147,c_0_148]),c_0_149]) ).

cnf(c_0_153,negated_conjecture,
    ( unordered_pair(esk15_0,esk15_0) = unordered_pair(esk18_0,esk17_0)
    | unordered_pair(esk16_0,esk15_0) = unordered_pair(esk18_0,esk17_0) ),
    inference(er,[status(thm)],[c_0_150]) ).

cnf(c_0_154,plain,
    ( esk15_0 = esk17_0
    | esk17_0 = esk16_0 ),
    inference(spm,[status(thm)],[c_0_151,c_0_152]) ).

cnf(c_0_155,negated_conjecture,
    ( unordered_pair(esk16_0,esk17_0) = unordered_pair(esk18_0,esk17_0)
    | unordered_pair(esk17_0,esk17_0) = unordered_pair(esk18_0,esk17_0)
    | esk17_0 = esk16_0 ),
    inference(spm,[status(thm)],[c_0_153,c_0_154]) ).

cnf(c_0_156,negated_conjecture,
    ( unordered_pair(esk16_0,esk17_0) = unordered_pair(esk18_0,esk17_0)
    | unordered_pair(esk16_0,esk15_0) = unordered_pair(esk18_0,esk17_0)
    | esk17_0 = esk16_0 ),
    inference(spm,[status(thm)],[c_0_148,c_0_155]) ).

cnf(c_0_157,plain,
    in(esk15_0,unordered_pair(esk18_0,esk17_0)),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_147,c_0_153]),c_0_149]) ).

cnf(c_0_158,plain,
    ( unordered_pair(esk16_0,esk17_0) = unordered_pair(esk18_0,esk17_0)
    | esk17_0 = esk16_0 ),
    inference(spm,[status(thm)],[c_0_156,c_0_154]) ).

cnf(c_0_159,negated_conjecture,
    ( esk15_0 != esk17_0
    | esk16_0 != esk18_0 ),
    i_0_105 ).

cnf(c_0_160,plain,
    ( esk15_0 = esk17_0
    | esk15_0 = esk18_0 ),
    inference(spm,[status(thm)],[c_0_151,c_0_157]) ).

cnf(c_0_161,plain,
    ( esk17_0 = esk16_0
    | in(esk16_0,unordered_pair(esk18_0,esk17_0)) ),
    inference(spm,[status(thm)],[c_0_147,c_0_158]) ).

cnf(c_0_162,negated_conjecture,
    ( esk17_0 = esk16_0
    | esk16_0 != esk18_0 ),
    inference(spm,[status(thm)],[c_0_159,c_0_154]) ).

cnf(c_0_163,negated_conjecture,
    ( unordered_pair(esk16_0,esk17_0) = unordered_pair(esk18_0,esk17_0)
    | unordered_pair(esk17_0,esk17_0) = unordered_pair(esk18_0,esk17_0)
    | esk15_0 = esk18_0 ),
    inference(spm,[status(thm)],[c_0_153,c_0_160]) ).

cnf(c_0_164,plain,
    esk17_0 = esk16_0,
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_151,c_0_161]),c_0_162]) ).

cnf(c_0_165,negated_conjecture,
    ( unordered_pair(esk16_0,esk16_0) = unordered_pair(esk18_0,esk16_0)
    | esk15_0 = esk18_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_163,c_0_164]),c_0_164]),c_0_164]),c_0_164]),c_0_164])]) ).

cnf(c_0_166,lemma,
    ( esk15_0 = esk18_0
    | X1 = esk16_0
    | unordered_pair(X1,X2) != unordered_pair(esk18_0,esk16_0) ),
    inference(spm,[status(thm)],[c_0_141,c_0_165]) ).

cnf(c_0_167,negated_conjecture,
    ( esk15_0 = esk18_0
    | esk16_0 != esk18_0 ),
    inference(spm,[status(thm)],[c_0_159,c_0_160]) ).

cnf(c_0_168,lemma,
    esk15_0 = esk18_0,
    inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_166]),c_0_167]) ).

cnf(c_0_169,plain,
    in(X1,unordered_pair(X2,X1)),
    inference(er,[status(thm)],[c_0_149]) ).

cnf(c_0_170,negated_conjecture,
    unordered_pair(unordered_pair(esk18_0,esk16_0),unordered_pair(esk16_0,esk16_0)) = unordered_pair(unordered_pair(esk18_0,esk18_0),unordered_pair(esk18_0,esk16_0)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_142,c_0_164]),c_0_164]),c_0_164]),c_0_168]),c_0_139]),c_0_168]),c_0_168]),c_0_139]) ).

cnf(c_0_171,plain,
    in(unordered_pair(esk16_0,esk16_0),unordered_pair(unordered_pair(esk18_0,esk18_0),unordered_pair(esk18_0,esk16_0))),
    inference(spm,[status(thm)],[c_0_169,c_0_170]) ).

cnf(c_0_172,lemma,
    ( subset(unordered_pair(X1,X1),X2)
    | ~ in(X1,X2) ),
    i_0_78 ).

cnf(c_0_173,plain,
    ( X1 = empty_set
    | in(esk2_1(X1),X1) ),
    i_0_13 ).

cnf(c_0_174,plain,
    ( unordered_pair(esk16_0,esk16_0) = unordered_pair(esk18_0,esk16_0)
    | unordered_pair(esk16_0,esk16_0) = unordered_pair(esk18_0,esk18_0) ),
    inference(spm,[status(thm)],[c_0_151,c_0_171]) ).

cnf(c_0_175,negated_conjecture,
    ( esk15_0 != esk16_0
    | esk16_0 != esk18_0 ),
    inference(rw,[status(thm)],[c_0_159,c_0_164]) ).

cnf(c_0_176,lemma,
    ( X1 = X2
    | ~ subset(unordered_pair(X1,X1),unordered_pair(X2,X2)) ),
    i_0_126 ).

cnf(c_0_177,plain,
    ( X1 = empty_set
    | subset(unordered_pair(esk2_1(X1),esk2_1(X1)),X1) ),
    inference(spm,[status(thm)],[c_0_172,c_0_173]) ).

cnf(c_0_178,lemma,
    unordered_pair(X1,X1) != empty_set,
    i_0_74 ).

cnf(c_0_179,lemma,
    ( unordered_pair(esk16_0,esk16_0) = unordered_pair(esk18_0,esk18_0)
    | X1 = esk16_0
    | unordered_pair(X1,X2) != unordered_pair(esk18_0,esk16_0) ),
    inference(spm,[status(thm)],[c_0_141,c_0_174]) ).

cnf(c_0_180,negated_conjecture,
    esk16_0 != esk18_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_175,c_0_168])]) ).

cnf(c_0_181,lemma,
    esk2_1(unordered_pair(X1,X1)) = X1,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_176,c_0_177]),c_0_178]) ).

cnf(c_0_182,lemma,
    unordered_pair(esk16_0,esk16_0) = unordered_pair(esk18_0,esk18_0),
    inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_179]),c_0_180]) ).

cnf(c_0_183,lemma,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_181,c_0_182]),c_0_181]),c_0_180]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14  % Problem  : SEU156+2 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.14  % Command  : enigmatic-eprover.py %s %d 1
% 0.16/0.36  % Computer : n006.cluster.edu
% 0.16/0.36  % Model    : x86_64 x86_64
% 0.16/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36  % Memory   : 8042.1875MB
% 0.16/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36  % CPULimit : 300
% 0.16/0.36  % WCLimit  : 600
% 0.16/0.36  % DateTime : Sun Jun 19 10:29:57 EDT 2022
% 0.16/0.37  % CPUTime  : 
% 0.23/0.48  # ENIGMATIC: Selected complete mode:
% 8.46/2.62  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.46/2.62  # No SInE strategy applied
% 8.46/2.62  # Trying AutoSched0 for 150 seconds
% 8.46/2.62  # AutoSched0-Mode selected heuristic G_E___024_B31_F1_PI_AE_Q4_CS_SP_S2S
% 8.46/2.62  # and selection function SelectNewComplexAHP.
% 8.46/2.62  #
% 8.46/2.62  # Preprocessing time       : 0.023 s
% 8.46/2.62  
% 8.46/2.62  # Proof found!
% 8.46/2.62  # SZS status Theorem
% 8.46/2.62  # SZS output start CNFRefutation
% See solution above
% 8.46/2.62  # Training examples: 0 positive, 0 negative
% 8.46/2.62  
% 8.46/2.62  # -------------------------------------------------
% 8.46/2.62  # User time                : 0.083 s
% 8.46/2.62  # System time              : 0.006 s
% 8.46/2.62  # Total time               : 0.089 s
% 8.46/2.62  # Maximum resident set size: 7124 pages
% 8.46/2.62  
%------------------------------------------------------------------------------