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

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

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_8,plain,
    ( in(X1,X2)
    | X2 != union(X3)
    | ~ in(X4,X3)
    | ~ in(X1,X4) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7r3_5lbt/lgb.p',i_0_8) ).

cnf(i_0_13,negated_conjecture,
    in(esk5_0,esk6_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7r3_5lbt/lgb.p',i_0_13) ).

cnf(i_0_12,negated_conjecture,
    ~ subset(esk5_0,union(esk6_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7r3_5lbt/lgb.p',i_0_12) ).

cnf(i_0_3,plain,
    ( subset(X1,X2)
    | in(esk1_2(X1,X2),X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7r3_5lbt/lgb.p',i_0_3) ).

cnf(i_0_2,plain,
    ( subset(X1,X2)
    | ~ in(esk1_2(X1,X2),X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7r3_5lbt/lgb.p',i_0_2) ).

cnf(c_0_19,plain,
    ( in(X1,X2)
    | X2 != union(X3)
    | ~ in(X4,X3)
    | ~ in(X1,X4) ),
    i_0_8 ).

cnf(c_0_20,plain,
    ( in(X1,union(X2))
    | ~ in(X3,X2)
    | ~ in(X1,X3) ),
    inference(er,[status(thm)],[c_0_19]) ).

cnf(c_0_21,negated_conjecture,
    in(esk5_0,esk6_0),
    i_0_13 ).

cnf(c_0_22,negated_conjecture,
    ~ subset(esk5_0,union(esk6_0)),
    i_0_12 ).

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

cnf(c_0_24,negated_conjecture,
    ( in(X1,union(esk6_0))
    | ~ in(X1,esk5_0) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_25,negated_conjecture,
    in(esk1_2(esk5_0,union(esk6_0)),esk5_0),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_26,plain,
    ( subset(X1,X2)
    | ~ in(esk1_2(X1,X2),X2) ),
    i_0_2 ).

cnf(c_0_27,negated_conjecture,
    in(esk1_2(esk5_0,union(esk6_0)),union(esk6_0)),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_28,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_22]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SEU155+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.14/0.33  % Computer : n017.cluster.edu
% 0.14/0.33  % Model    : x86_64 x86_64
% 0.14/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33  % Memory   : 8042.1875MB
% 0.14/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33  % CPULimit : 300
% 0.14/0.33  % WCLimit  : 600
% 0.14/0.33  % DateTime : Mon Jun 20 11:19:31 EDT 2022
% 0.14/0.33  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 7.35/2.27  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.35/2.27  # No SInE strategy applied
% 7.35/2.27  # Trying AutoSched0 for 150 seconds
% 7.35/2.27  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S00DA
% 7.35/2.27  # and selection function SelectSmallestOrientable.
% 7.35/2.27  #
% 7.35/2.27  # Preprocessing time       : 0.023 s
% 7.35/2.27  # Presaturation interreduction done
% 7.35/2.27  
% 7.35/2.27  # Proof found!
% 7.35/2.27  # SZS status Theorem
% 7.35/2.27  # SZS output start CNFRefutation
% See solution above
% 7.35/2.27  # Training examples: 0 positive, 0 negative
% 7.35/2.27  
% 7.35/2.27  # -------------------------------------------------
% 7.35/2.27  # User time                : 0.024 s
% 7.35/2.27  # System time              : 0.005 s
% 7.35/2.27  # Total time               : 0.029 s
% 7.35/2.27  # Maximum resident set size: 7120 pages
% 7.35/2.27  
%------------------------------------------------------------------------------