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

View Problem - Process Solution

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

% Computer : n009.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:59 EDT 2022

% Result   : Theorem 9.50s 2.50s
% Output   : CNFRefutation 9.50s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   33 (   9 unt;  12 nHn;  29 RR)
%            Number of literals    :   72 (  19 equ;  33 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   47 (   6 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_41,plain,
    ( in(X1,X2)
    | ~ in(X1,X3)
    | ~ subset(X3,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yb2q4ecx/input.p',i_0_41) ).

cnf(i_0_125,negated_conjecture,
    ( in(esk20_0,esk22_0)
    | subset(unordered_pair(esk20_0,esk21_0),esk22_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yb2q4ecx/input.p',i_0_125) ).

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

cnf(i_0_124,negated_conjecture,
    ( in(esk21_0,esk22_0)
    | subset(unordered_pair(esk20_0,esk21_0),esk22_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yb2q4ecx/input.p',i_0_124) ).

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

cnf(i_0_126,negated_conjecture,
    ( ~ in(esk20_0,esk22_0)
    | ~ in(esk21_0,esk22_0)
    | ~ subset(unordered_pair(esk20_0,esk21_0),esk22_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yb2q4ecx/input.p',i_0_126) ).

cnf(i_0_39,plain,
    ( subset(X1,X2)
    | ~ in(esk11_2(X1,X2),X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yb2q4ecx/input.p',i_0_39) ).

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-yb2q4ecx/input.p',i_0_24) ).

cnf(i_0_40,plain,
    ( subset(X1,X2)
    | in(esk11_2(X1,X2),X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yb2q4ecx/input.p',i_0_40) ).

cnf(c_0_136,plain,
    ( in(X1,X2)
    | ~ in(X1,X3)
    | ~ subset(X3,X2) ),
    i_0_41 ).

cnf(c_0_137,negated_conjecture,
    ( in(esk20_0,esk22_0)
    | subset(unordered_pair(esk20_0,esk21_0),esk22_0) ),
    i_0_125 ).

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

cnf(c_0_139,negated_conjecture,
    ( in(esk20_0,esk22_0)
    | in(X1,esk22_0)
    | ~ in(X1,unordered_pair(esk20_0,esk21_0)) ),
    inference(spm,[status(thm)],[c_0_136,c_0_137]) ).

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

cnf(c_0_141,negated_conjecture,
    ( in(esk21_0,esk22_0)
    | subset(unordered_pair(esk20_0,esk21_0),esk22_0) ),
    i_0_124 ).

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

cnf(c_0_143,negated_conjecture,
    ( ~ in(esk20_0,esk22_0)
    | ~ in(esk21_0,esk22_0)
    | ~ subset(unordered_pair(esk20_0,esk21_0),esk22_0) ),
    i_0_126 ).

cnf(c_0_144,plain,
    in(esk20_0,esk22_0),
    inference(spm,[status(thm)],[c_0_139,c_0_140]) ).

cnf(c_0_145,negated_conjecture,
    ( in(esk21_0,esk22_0)
    | in(X1,esk22_0)
    | ~ in(X1,unordered_pair(esk20_0,esk21_0)) ),
    inference(spm,[status(thm)],[c_0_136,c_0_141]) ).

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

cnf(c_0_147,negated_conjecture,
    ( ~ in(esk21_0,esk22_0)
    | ~ subset(unordered_pair(esk20_0,esk21_0),esk22_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_143,c_0_144])]) ).

cnf(c_0_148,plain,
    in(esk21_0,esk22_0),
    inference(spm,[status(thm)],[c_0_145,c_0_146]) ).

cnf(c_0_149,plain,
    ( subset(X1,X2)
    | ~ in(esk11_2(X1,X2),X2) ),
    i_0_39 ).

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

cnf(c_0_151,negated_conjecture,
    ~ subset(unordered_pair(esk20_0,esk21_0),esk22_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_147,c_0_148])]) ).

cnf(c_0_152,plain,
    ( subset(X1,X2)
    | in(esk11_2(X1,X2),X1) ),
    i_0_40 ).

cnf(c_0_153,plain,
    ( ~ in(esk11_2(unordered_pair(esk20_0,esk21_0),esk22_0),esk22_0)
    | ~ in(esk21_0,esk22_0) ),
    inference(spm,[status(thm)],[c_0_147,c_0_149]) ).

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

cnf(c_0_155,negated_conjecture,
    in(esk11_2(unordered_pair(esk20_0,esk21_0),esk22_0),unordered_pair(esk20_0,esk21_0)),
    inference(spm,[status(thm)],[c_0_151,c_0_152]) ).

cnf(c_0_156,plain,
    ~ in(esk11_2(unordered_pair(esk20_0,esk21_0),esk22_0),esk22_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_153,c_0_148])]) ).

cnf(c_0_157,negated_conjecture,
    ( esk11_2(unordered_pair(esk20_0,esk21_0),esk22_0) = esk20_0
    | esk11_2(unordered_pair(esk20_0,esk21_0),esk22_0) = esk21_0 ),
    inference(spm,[status(thm)],[c_0_154,c_0_155]) ).

cnf(c_0_158,plain,
    esk11_2(unordered_pair(esk20_0,esk21_0),esk22_0) = esk20_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_156,c_0_157]),c_0_148])]) ).

cnf(c_0_159,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_156,c_0_158]),c_0_144])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SEU159+2 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n009.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 : Mon Jun 20 07:04:54 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.45  # ENIGMATIC: Selected complete mode:
% 9.50/2.50  # ENIGMATIC: Solved by autoschedule:
% 9.50/2.50  # No SInE strategy applied
% 9.50/2.50  # Trying AutoSched0 for 150 seconds
% 9.50/2.50  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 9.50/2.50  # and selection function SelectComplexExceptUniqMaxHorn.
% 9.50/2.50  #
% 9.50/2.50  # Preprocessing time       : 0.026 s
% 9.50/2.50  # Presaturation interreduction done
% 9.50/2.50  
% 9.50/2.50  # Proof found!
% 9.50/2.50  # SZS status Theorem
% 9.50/2.50  # SZS output start CNFRefutation
% See solution above
% 9.50/2.50  # Training examples: 0 positive, 0 negative
% 9.50/2.50  
% 9.50/2.50  # -------------------------------------------------
% 9.50/2.50  # User time                : 0.048 s
% 9.50/2.50  # System time              : 0.014 s
% 9.50/2.50  # Total time               : 0.062 s
% 9.50/2.50  # Maximum resident set size: 7120 pages
% 9.50/2.50  
%------------------------------------------------------------------------------