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

% Computer : n025.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:32 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_29,plain,
    ( finite(X1)
    | ~ element(X1,finite_subsets(X2)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-i8f38w7z/input.p',i_0_29) ).

cnf(i_0_60,negated_conjecture,
    element(esk12_0,finite_subsets(esk11_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-i8f38w7z/input.p',i_0_60) ).

cnf(i_0_59,negated_conjecture,
    ~ finite(esk12_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-i8f38w7z/input.p',i_0_59) ).

cnf(c_0_64,plain,
    ( finite(X1)
    | ~ element(X1,finite_subsets(X2)) ),
    i_0_29 ).

cnf(c_0_65,negated_conjecture,
    element(esk12_0,finite_subsets(esk11_0)),
    i_0_60 ).

cnf(c_0_66,negated_conjecture,
    ~ finite(esk12_0),
    i_0_59 ).

cnf(c_0_67,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SEU116+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n025.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sun Jun 19 11:54:00 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.45  # ENIGMATIC: Selected complete mode:
% 7.84/2.38  # ENIGMATIC: Solved by autoschedule:
% 7.84/2.38  # No SInE strategy applied
% 7.84/2.38  # Trying AutoSched0 for 150 seconds
% 7.84/2.38  # AutoSched0-Mode selected heuristic G_E___300_C18_F1_SE_CS_SP_S0Y
% 7.84/2.38  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.84/2.38  #
% 7.84/2.38  # Preprocessing time       : 0.019 s
% 7.84/2.38  
% 7.84/2.38  # Proof found!
% 7.84/2.38  # SZS status Theorem
% 7.84/2.38  # SZS output start CNFRefutation
% See solution above
% 7.84/2.38  # Training examples: 0 positive, 0 negative
% 7.84/2.38  
% 7.84/2.38  # -------------------------------------------------
% 7.84/2.38  # User time                : 0.019 s
% 7.84/2.38  # System time              : 0.005 s
% 7.84/2.38  # Total time               : 0.024 s
% 7.84/2.38  # Maximum resident set size: 7120 pages
% 7.84/2.38  
%------------------------------------------------------------------------------