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

% Computer : n004.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:01 EDT 2022

% Result   : Theorem 4.39s 2.28s
% Output   : CNFRefutation 4.39s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   17 (   9 unt;   3 nHn;  16 RR)
%            Number of literals    :   34 (  16 equ;  18 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    2 (   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   :   25 (   0 sgn)

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

cnf(i_0_21,negated_conjecture,
    subset(singleton(esk6_0),unordered_pair(esk7_0,esk8_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y2pwnld0/input.p',i_0_21) ).

cnf(i_0_5,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != singleton(X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y2pwnld0/input.p',i_0_5) ).

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

cnf(i_0_19,negated_conjecture,
    esk8_0 != esk6_0,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y2pwnld0/input.p',i_0_19) ).

cnf(i_0_20,negated_conjecture,
    esk7_0 != esk6_0,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y2pwnld0/input.p',i_0_20) ).

cnf(c_0_28,plain,
    ( in(X1,X2)
    | ~ in(X1,X3)
    | ~ subset(X3,X2) ),
    i_0_15 ).

cnf(c_0_29,negated_conjecture,
    subset(singleton(esk6_0),unordered_pair(esk7_0,esk8_0)),
    i_0_21 ).

cnf(c_0_30,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != singleton(X3) ),
    i_0_5 ).

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

cnf(c_0_32,negated_conjecture,
    ( in(X1,unordered_pair(esk7_0,esk8_0))
    | ~ in(X1,singleton(esk6_0)) ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_33,plain,
    in(X1,singleton(X1)),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_30])]) ).

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

cnf(c_0_35,plain,
    in(esk6_0,unordered_pair(esk7_0,esk8_0)),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_36,negated_conjecture,
    esk8_0 != esk6_0,
    i_0_19 ).

cnf(c_0_37,negated_conjecture,
    esk7_0 != esk6_0,
    i_0_20 ).

cnf(c_0_38,plain,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),c_0_37]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SET884+1 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n004.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 Jul 11 06:38:24 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 4.39/2.28  # ENIGMATIC: Solved by autoschedule:
% 4.39/2.28  # No SInE strategy applied
% 4.39/2.28  # Trying AutoSched0 for 150 seconds
% 4.39/2.28  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S0Y_ni
% 4.39/2.28  # and selection function SelectMaxLComplexAvoidPosPred.
% 4.39/2.28  #
% 4.39/2.28  # Preprocessing time       : 0.014 s
% 4.39/2.28  # Presaturation interreduction done
% 4.39/2.28  
% 4.39/2.28  # Proof found!
% 4.39/2.28  # SZS status Theorem
% 4.39/2.28  # SZS output start CNFRefutation
% See solution above
% 4.39/2.28  # Training examples: 0 positive, 0 negative
% 4.39/2.28  
% 4.39/2.28  # -------------------------------------------------
% 4.39/2.28  # User time                : 0.017 s
% 4.39/2.28  # System time              : 0.003 s
% 4.39/2.28  # Total time               : 0.020 s
% 4.39/2.28  # Maximum resident set size: 7120 pages
% 4.39/2.28  
%------------------------------------------------------------------------------