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

% Computer : n014.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:48 EDT 2022

% Result   : Theorem 7.59s 2.30s
% Output   : CNFRefutation 7.59s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    3
% Syntax   : Number of clauses     :    9 (   5 unt;   0 nHn;   8 RR)
%            Number of literals    :   15 (   8 equ;   9 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-1 aty)
%            Number of variables   :   12 (   3 sgn)

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

cnf(i_0_7,plain,
    ( X1 != empty_set
    | ~ in(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x1sia0sh/input.p',i_0_7) ).

cnf(i_0_11,negated_conjecture,
    singleton(esk3_0) = empty_set,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x1sia0sh/input.p',i_0_11) ).

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

cnf(c_0_16,plain,
    ( X1 != empty_set
    | ~ in(X2,X1) ),
    i_0_7 ).

cnf(c_0_17,plain,
    in(X1,singleton(X1)),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_15])]) ).

cnf(c_0_18,negated_conjecture,
    singleton(esk3_0) = empty_set,
    i_0_11 ).

cnf(c_0_19,plain,
    ~ in(X1,empty_set),
    inference(er,[status(thm)],[c_0_16]) ).

cnf(c_0_20,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SEU143+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n014.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 09:35:49 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 7.59/2.30  # ENIGMATIC: Solved by autoschedule:
% 7.59/2.30  # No SInE strategy applied
% 7.59/2.30  # Trying AutoSched0 for 150 seconds
% 7.59/2.30  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S0Y_ni
% 7.59/2.30  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.59/2.30  #
% 7.59/2.30  # Preprocessing time       : 0.023 s
% 7.59/2.30  # Presaturation interreduction done
% 7.59/2.30  
% 7.59/2.30  # Proof found!
% 7.59/2.30  # SZS status Theorem
% 7.59/2.30  # SZS output start CNFRefutation
% See solution above
% 7.59/2.30  # Training examples: 0 positive, 0 negative
% 7.59/2.30  
% 7.59/2.30  # -------------------------------------------------
% 7.59/2.30  # User time                : 0.025 s
% 7.59/2.30  # System time              : 0.004 s
% 7.59/2.30  # Total time               : 0.029 s
% 7.59/2.30  # Maximum resident set size: 7124 pages
% 7.59/2.30  
%------------------------------------------------------------------------------