%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SEU148+3 : TPTP v8.1.0. Released v3.2.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 08:38:52 EDT 2022

% Result   : Theorem 10.30s 3.63s
% Output   : CNFRefutation 10.30s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   17 (  10 unt;   2 nHn;  16 RR)
%            Number of literals    :   30 (  18 equ;  15 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-1 aty)
%            Number of variables   :   21 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_4,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != singleton(X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-44v35u3p/input.p',i_0_4) ).

cnf(i_0_10,plain,
    ( X1 = empty_set
    | X1 = singleton(X2)
    | ~ subset(X1,singleton(X2)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-44v35u3p/input.p',i_0_10) ).

cnf(i_0_15,negated_conjecture,
    subset(singleton(esk4_0),singleton(esk5_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-44v35u3p/input.p',i_0_15) ).

cnf(i_0_7,plain,
    singleton(X1) != empty_set,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-44v35u3p/input.p',i_0_7) ).

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

cnf(i_0_14,negated_conjecture,
    esk5_0 != esk4_0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-44v35u3p/input.p',i_0_14) ).

cnf(c_0_22,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != singleton(X3) ),
    i_0_4 ).

cnf(c_0_23,plain,
    ( X1 = empty_set
    | X1 = singleton(X2)
    | ~ subset(X1,singleton(X2)) ),
    i_0_10 ).

cnf(c_0_24,negated_conjecture,
    subset(singleton(esk4_0),singleton(esk5_0)),
    i_0_15 ).

cnf(c_0_25,plain,
    singleton(X1) != empty_set,
    i_0_7 ).

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

cnf(c_0_27,plain,
    in(X1,singleton(X1)),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_22])]) ).

cnf(c_0_28,negated_conjecture,
    singleton(esk5_0) = singleton(esk4_0),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).

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

cnf(c_0_30,plain,
    in(esk5_0,singleton(esk4_0)),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_31,negated_conjecture,
    esk5_0 != esk4_0,
    i_0_14 ).

cnf(c_0_32,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09  % Problem  : SEU148+3 : TPTP v8.1.0. Released v3.2.0.
% 0.02/0.09  % Command  : enigmatic-eprover.py %s %d 1
% 0.09/0.29  % Computer : n029.cluster.edu
% 0.09/0.29  % Model    : x86_64 x86_64
% 0.09/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29  % Memory   : 8042.1875MB
% 0.09/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29  % CPULimit : 300
% 0.09/0.29  % WCLimit  : 600
% 0.09/0.29  % DateTime : Sun Jun 19 12:59:46 EDT 2022
% 0.09/0.29  % CPUTime  : 
% 0.13/0.39  # ENIGMATIC: Selected complete mode:
% 10.30/3.63  # ENIGMATIC: Solved by autoschedule:
% 10.30/3.63  # No SInE strategy applied
% 10.30/3.63  # Trying AutoSched0 for 150 seconds
% 10.30/3.63  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S0Y_ni
% 10.30/3.63  # and selection function SelectMaxLComplexAvoidPosPred.
% 10.30/3.63  #
% 10.30/3.63  # Preprocessing time       : 0.022 s
% 10.30/3.63  # Presaturation interreduction done
% 10.30/3.63  
% 10.30/3.63  # Proof found!
% 10.30/3.63  # SZS status Theorem
% 10.30/3.63  # SZS output start CNFRefutation
% See solution above
% 10.30/3.63  # Training examples: 0 positive, 0 negative
% 10.30/3.63  
% 10.30/3.63  # -------------------------------------------------
% 10.30/3.63  # User time                : 0.022 s
% 10.30/3.63  # System time              : 0.005 s
% 10.30/3.63  # Total time               : 0.027 s
% 10.30/3.63  # Maximum resident set size: 7124 pages
% 10.30/3.63  
%------------------------------------------------------------------------------