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

% Computer : n024.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:39:26 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_32,plain,
    ( in(X1,X2)
    | ~ relation(X3)
    | ~ in(X1,relation_rng(relation_rng_restriction(X2,X3))) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ltmelafc/input.p',i_0_32) ).

cnf(i_0_4,plain,
    ( subset(X1,X2)
    | in(esk1_2(X1,X2),X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ltmelafc/input.p',i_0_4) ).

cnf(i_0_34,negated_conjecture,
    relation(esk10_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ltmelafc/input.p',i_0_34) ).

cnf(i_0_3,plain,
    ( subset(X1,X2)
    | ~ in(esk1_2(X1,X2),X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ltmelafc/input.p',i_0_3) ).

cnf(i_0_33,negated_conjecture,
    ~ subset(relation_rng(relation_rng_restriction(esk9_0,esk10_0)),esk9_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ltmelafc/input.p',i_0_33) ).

cnf(c_0_40,plain,
    ( in(X1,X2)
    | ~ relation(X3)
    | ~ in(X1,relation_rng(relation_rng_restriction(X2,X3))) ),
    i_0_32 ).

cnf(c_0_41,plain,
    ( subset(X1,X2)
    | in(esk1_2(X1,X2),X1) ),
    i_0_4 ).

cnf(c_0_42,plain,
    ( in(esk1_2(relation_rng(relation_rng_restriction(X1,X2)),X3),X1)
    | subset(relation_rng(relation_rng_restriction(X1,X2)),X3)
    | ~ relation(X2) ),
    inference(spm,[status(thm)],[c_0_40,c_0_41]) ).

cnf(c_0_43,negated_conjecture,
    relation(esk10_0),
    i_0_34 ).

cnf(c_0_44,plain,
    ( subset(X1,X2)
    | ~ in(esk1_2(X1,X2),X2) ),
    i_0_3 ).

cnf(c_0_45,negated_conjecture,
    ( in(esk1_2(relation_rng(relation_rng_restriction(X1,esk10_0)),X2),X1)
    | subset(relation_rng(relation_rng_restriction(X1,esk10_0)),X2) ),
    inference(spm,[status(thm)],[c_0_42,c_0_43]) ).

cnf(c_0_46,negated_conjecture,
    ~ subset(relation_rng(relation_rng_restriction(esk9_0,esk10_0)),esk9_0),
    i_0_33 ).

cnf(c_0_47,plain,
    subset(relation_rng(relation_rng_restriction(X1,esk10_0)),X1),
    inference(spm,[status(thm)],[c_0_44,c_0_45]) ).

cnf(c_0_48,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SEU198+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n024.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 : Sun Jun 19 21:26:34 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 4.59/2.25  # ENIGMATIC: Solved by autoschedule:
% 4.59/2.25  # No SInE strategy applied
% 4.59/2.25  # Trying AutoSched0 for 150 seconds
% 4.59/2.25  # AutoSched0-Mode selected heuristic G_E___200_B02_F1_SE_CS_SP_PI_S0S
% 4.59/2.25  # and selection function SelectComplexG.
% 4.59/2.25  #
% 4.59/2.25  # Preprocessing time       : 0.012 s
% 4.59/2.25  
% 4.59/2.25  # Proof found!
% 4.59/2.25  # SZS status Theorem
% 4.59/2.25  # SZS output start CNFRefutation
% See solution above
% 4.59/2.25  # Training examples: 0 positive, 0 negative
% 4.59/2.25  
% 4.59/2.25  # -------------------------------------------------
% 4.59/2.25  # User time                : 0.024 s
% 4.59/2.25  # System time              : 0.007 s
% 4.59/2.25  # Total time               : 0.031 s
% 4.59/2.25  # Maximum resident set size: 7124 pages
% 4.59/2.25  
%------------------------------------------------------------------------------