TSTP Solution File: SET957+1 by Enigma---0.5.1

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SET957+1 : TPTP v8.1.0. Bugfixed v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n029.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 00:15:31 EDT 2022

% Result   : Theorem 7.58s 2.41s
% Output   : CNFRefutation 7.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   29 (  11 unt;   3 nHn;  24 RR)
%            Number of literals    :   59 (  12 equ;  27 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   6 con; 0-4 aty)
%            Number of variables   :   47 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_12,negated_conjecture,
    ( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk5_0)
    | ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk8_0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nbzk6qc2/input.p',i_0_12) ).

cnf(i_0_2,plain,
    unordered_pair(X1,X2) = unordered_pair(X2,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nbzk6qc2/input.p',i_0_2) ).

cnf(i_0_8,plain,
    ( unordered_pair(unordered_pair(esk3_4(X1,X2,X3,X4),esk4_4(X1,X2,X3,X4)),singleton(esk3_4(X1,X2,X3,X4))) = X4
    | ~ in(X4,X1)
    | ~ subset(X1,cartesian_product2(X2,X3)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nbzk6qc2/input.p',i_0_8) ).

cnf(i_0_14,negated_conjecture,
    subset(esk8_0,cartesian_product2(esk9_0,esk10_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nbzk6qc2/input.p',i_0_14) ).

cnf(i_0_16,plain,
    ( X1 = X2
    | in(esk11_2(X1,X2),X2)
    | in(esk11_2(X1,X2),X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nbzk6qc2/input.p',i_0_16) ).

cnf(i_0_13,negated_conjecture,
    ( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk8_0)
    | ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk5_0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nbzk6qc2/input.p',i_0_13) ).

cnf(i_0_11,negated_conjecture,
    esk8_0 != esk5_0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nbzk6qc2/input.p',i_0_11) ).

cnf(i_0_17,plain,
    ( X1 = X2
    | ~ in(esk11_2(X1,X2),X2)
    | ~ in(esk11_2(X1,X2),X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nbzk6qc2/input.p',i_0_17) ).

cnf(i_0_15,negated_conjecture,
    subset(esk5_0,cartesian_product2(esk6_0,esk7_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nbzk6qc2/input.p',i_0_15) ).

cnf(c_0_27,negated_conjecture,
    ( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk5_0)
    | ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk8_0) ),
    i_0_12 ).

cnf(c_0_28,plain,
    unordered_pair(X1,X2) = unordered_pair(X2,X1),
    i_0_2 ).

cnf(c_0_29,plain,
    ( unordered_pair(unordered_pair(esk3_4(X1,X2,X3,X4),esk4_4(X1,X2,X3,X4)),singleton(esk3_4(X1,X2,X3,X4))) = X4
    | ~ in(X4,X1)
    | ~ subset(X1,cartesian_product2(X2,X3)) ),
    i_0_8 ).

cnf(c_0_30,plain,
    ( in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),esk5_0)
    | ~ in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),esk8_0) ),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_31,plain,
    ( unordered_pair(singleton(esk3_4(X1,X2,X3,X4)),unordered_pair(esk3_4(X1,X2,X3,X4),esk4_4(X1,X2,X3,X4))) = X4
    | ~ in(X4,X1)
    | ~ subset(X1,cartesian_product2(X2,X3)) ),
    inference(rw,[status(thm)],[c_0_29,c_0_28]) ).

cnf(c_0_32,plain,
    ( in(X1,esk5_0)
    | ~ in(X1,esk8_0)
    | ~ in(X1,X2)
    | ~ subset(X2,cartesian_product2(X3,X4)) ),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_33,negated_conjecture,
    subset(esk8_0,cartesian_product2(esk9_0,esk10_0)),
    i_0_14 ).

cnf(c_0_34,negated_conjecture,
    ( in(X1,esk5_0)
    | ~ in(X1,esk8_0) ),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_35,plain,
    ( X1 = X2
    | in(esk11_2(X1,X2),X2)
    | in(esk11_2(X1,X2),X1) ),
    i_0_16 ).

cnf(c_0_36,negated_conjecture,
    ( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk8_0)
    | ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk5_0) ),
    i_0_13 ).

cnf(c_0_37,plain,
    ( esk8_0 = X1
    | in(esk11_2(esk8_0,X1),esk5_0)
    | in(esk11_2(esk8_0,X1),X1) ),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_38,negated_conjecture,
    esk8_0 != esk5_0,
    i_0_11 ).

cnf(c_0_39,plain,
    ( in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),esk8_0)
    | ~ in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),esk5_0) ),
    inference(spm,[status(thm)],[c_0_36,c_0_28]) ).

cnf(c_0_40,plain,
    ( X1 = X2
    | ~ in(esk11_2(X1,X2),X2)
    | ~ in(esk11_2(X1,X2),X1) ),
    i_0_17 ).

cnf(c_0_41,plain,
    in(esk11_2(esk8_0,esk5_0),esk5_0),
    inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_37]),c_0_38]) ).

cnf(c_0_42,plain,
    ( in(X1,esk8_0)
    | ~ in(X1,esk5_0)
    | ~ in(X1,X2)
    | ~ subset(X2,cartesian_product2(X3,X4)) ),
    inference(spm,[status(thm)],[c_0_39,c_0_31]) ).

cnf(c_0_43,negated_conjecture,
    subset(esk5_0,cartesian_product2(esk6_0,esk7_0)),
    i_0_15 ).

cnf(c_0_44,plain,
    ~ in(esk11_2(esk8_0,esk5_0),esk8_0),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_38]) ).

cnf(c_0_45,negated_conjecture,
    ( in(X1,esk8_0)
    | ~ in(X1,esk5_0) ),
    inference(spm,[status(thm)],[c_0_42,c_0_43]) ).

cnf(c_0_46,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_41])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SET957+1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.06/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n029.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 : Sun Jul 10 07:57:48 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.46  # ENIGMATIC: Selected complete mode:
% 7.58/2.41  # ENIGMATIC: Solved by autoschedule:
% 7.58/2.41  # No SInE strategy applied
% 7.58/2.41  # Trying AutoSched0 for 150 seconds
% 7.58/2.41  # AutoSched0-Mode selected heuristic G_____0003_C18_F1_SE_CS_SP_S0Y
% 7.58/2.41  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.58/2.41  #
% 7.58/2.41  # Preprocessing time       : 0.013 s
% 7.58/2.41  
% 7.58/2.41  # Proof found!
% 7.58/2.41  # SZS status Theorem
% 7.58/2.41  # SZS output start CNFRefutation
% See solution above
% 7.58/2.41  # Training examples: 0 positive, 0 negative
% 7.58/2.41  
% 7.58/2.41  # -------------------------------------------------
% 7.58/2.41  # User time                : 0.015 s
% 7.58/2.41  # System time              : 0.005 s
% 7.58/2.41  # Total time               : 0.020 s
% 7.58/2.41  # Maximum resident set size: 7124 pages
% 7.58/2.41  
%------------------------------------------------------------------------------