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

% Computer : n012.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:01 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_8,negated_conjecture,
    set_union2(singleton(esk3_0),esk4_0) != esk4_0,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bp5peqlw/input.p',i_0_8) ).

cnf(i_0_3,plain,
    set_union2(X1,X2) = set_union2(X2,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bp5peqlw/input.p',i_0_3) ).

cnf(i_0_10,plain,
    ( set_union2(singleton(X1),X2) = X2
    | ~ in(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bp5peqlw/input.p',i_0_10) ).

cnf(i_0_9,negated_conjecture,
    in(esk3_0,esk4_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bp5peqlw/input.p',i_0_9) ).

cnf(c_0_15,negated_conjecture,
    set_union2(singleton(esk3_0),esk4_0) != esk4_0,
    i_0_8 ).

cnf(c_0_16,plain,
    set_union2(X1,X2) = set_union2(X2,X1),
    i_0_3 ).

cnf(c_0_17,plain,
    ( set_union2(singleton(X1),X2) = X2
    | ~ in(X1,X2) ),
    i_0_10 ).

cnf(c_0_18,negated_conjecture,
    set_union2(esk4_0,singleton(esk3_0)) != esk4_0,
    inference(rw,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_19,plain,
    ( set_union2(X1,singleton(X2)) = X1
    | ~ in(X2,X1) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_20,negated_conjecture,
    in(esk3_0,esk4_0),
    i_0_9 ).

cnf(c_0_21,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),
    [proof] ).

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