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

% Computer : n020.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:14:56 EDT 2022

% Result   : Theorem 7.63s 2.44s
% Output   : CNFRefutation 7.63s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   15 (   4 unt;   3 nHn;  11 RR)
%            Number of literals    :   30 (  10 equ;  14 neg)
%            Maximal clause size   :    3 (   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;   2 con; 0-2 aty)
%            Number of variables   :   30 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_6,plain,
    ( X1 = X2
    | X3 != singleton(X2)
    | ~ in(X1,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5v9rco76/input.p',i_0_6) ).

cnf(i_0_14,plain,
    ( subset(X1,X2)
    | in(esk3_2(X1,X2),X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5v9rco76/input.p',i_0_14) ).

cnf(i_0_13,plain,
    ( subset(X1,X2)
    | ~ in(esk3_2(X1,X2),X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5v9rco76/input.p',i_0_13) ).

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

cnf(i_0_19,negated_conjecture,
    ~ subset(singleton(esk6_0),unordered_pair(esk6_0,esk7_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5v9rco76/input.p',i_0_19) ).

cnf(c_0_25,plain,
    ( X1 = X2
    | X3 != singleton(X2)
    | ~ in(X1,X3) ),
    i_0_6 ).

cnf(c_0_26,plain,
    ( X1 = X2
    | ~ in(X1,singleton(X2)) ),
    inference(er,[status(thm)],[c_0_25]) ).

cnf(c_0_27,plain,
    ( subset(X1,X2)
    | in(esk3_2(X1,X2),X1) ),
    i_0_14 ).

cnf(c_0_28,plain,
    ( subset(X1,X2)
    | ~ in(esk3_2(X1,X2),X2) ),
    i_0_13 ).

cnf(c_0_29,plain,
    ( esk3_2(singleton(X1),X2) = X1
    | subset(singleton(X1),X2) ),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_30,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != unordered_pair(X3,X4) ),
    i_0_11 ).

cnf(c_0_31,negated_conjecture,
    ~ subset(singleton(esk6_0),unordered_pair(esk6_0,esk7_0)),
    i_0_19 ).

cnf(c_0_32,plain,
    ( subset(singleton(X1),X2)
    | ~ in(X1,X2) ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

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

cnf(c_0_34,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SET872+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n020.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 14:06:44 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.20/0.45  # ENIGMATIC: Selected complete mode:
% 7.63/2.44  # ENIGMATIC: Solved by autoschedule:
% 7.63/2.44  # No SInE strategy applied
% 7.63/2.44  # Trying AutoSched0 for 150 seconds
% 7.63/2.44  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S0Y_ni
% 7.63/2.44  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.63/2.44  #
% 7.63/2.44  # Preprocessing time       : 0.023 s
% 7.63/2.44  # Presaturation interreduction done
% 7.63/2.44  
% 7.63/2.44  # Proof found!
% 7.63/2.44  # SZS status Theorem
% 7.63/2.44  # SZS output start CNFRefutation
% See solution above
% 7.63/2.44  # Training examples: 0 positive, 0 negative
% 7.63/2.44  
% 7.63/2.44  # -------------------------------------------------
% 7.63/2.44  # User time                : 0.025 s
% 7.63/2.44  # System time              : 0.004 s
% 7.63/2.44  # Total time               : 0.028 s
% 7.63/2.44  # Maximum resident set size: 7116 pages
% 7.63/2.44  
%------------------------------------------------------------------------------