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

% Computer : n019.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 7.33s 2.23s
% Output   : CNFRefutation 7.33s
% 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 (   4 equ;   4 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   :    4 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_138,negated_conjecture,
    set_union2(unordered_pair(esk21_0,esk21_0),esk22_0) != esk22_0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-13okjqia/lgb.p',i_0_138) ).

cnf(i_0_84,lemma,
    ( set_union2(unordered_pair(X1,X1),X2) = X2
    | ~ in(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-13okjqia/lgb.p',i_0_84) ).

cnf(i_0_139,negated_conjecture,
    in(esk21_0,esk22_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-13okjqia/lgb.p',i_0_139) ).

cnf(c_0_143,negated_conjecture,
    set_union2(unordered_pair(esk21_0,esk21_0),esk22_0) != esk22_0,
    i_0_138 ).

cnf(c_0_144,lemma,
    ( set_union2(unordered_pair(X1,X1),X2) = X2
    | ~ in(X1,X2) ),
    i_0_84 ).

cnf(c_0_145,negated_conjecture,
    in(esk21_0,esk22_0),
    i_0_139 ).

cnf(c_0_146,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_143,c_0_144]),c_0_145])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : SEU161+2 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.11  % Command  : enigmatic-eprover.py %s %d 1
% 0.11/0.32  % Computer : n019.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 600
% 0.11/0.32  % DateTime : Mon Jun 20 01:59:26 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 7.33/2.23  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.33/2.23  # No SInE strategy applied
% 7.33/2.23  # Trying AutoSched0 for 150 seconds
% 7.33/2.23  # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y
% 7.33/2.23  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.33/2.23  #
% 7.33/2.23  # Preprocessing time       : 0.024 s
% 7.33/2.23  # Presaturation interreduction done
% 7.33/2.23  
% 7.33/2.23  # Proof found!
% 7.33/2.23  # SZS status Theorem
% 7.33/2.23  # SZS output start CNFRefutation
% See solution above
% 7.33/2.23  # Training examples: 0 positive, 0 negative
% 7.33/2.23  
% 7.33/2.23  # -------------------------------------------------
% 7.33/2.23  # User time                : 0.030 s
% 7.33/2.23  # System time              : 0.007 s
% 7.33/2.23  # Total time               : 0.037 s
% 7.33/2.23  # Maximum resident set size: 7128 pages
% 7.33/2.23  
%------------------------------------------------------------------------------