%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SEU230+2 : TPTP v8.1.0. Released v3.3.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:39:51 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_105,plain,
    ( in(X1,X2)
    | X2 != set_union2(X3,X4)
    | ~ in(X1,X4) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8qz5r4zk/lgb.p',i_0_105) ).

cnf(i_0_100,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != unordered_pair(X3,X4) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8qz5r4zk/lgb.p',i_0_100) ).

cnf(i_0_319,negated_conjecture,
    ~ in(esk75_0,set_union2(esk75_0,unordered_pair(esk75_0,esk75_0))),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8qz5r4zk/lgb.p',i_0_319) ).

cnf(c_0_323,plain,
    ( in(X1,X2)
    | X2 != set_union2(X3,X4)
    | ~ in(X1,X4) ),
    i_0_105 ).

cnf(c_0_324,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != unordered_pair(X3,X4) ),
    i_0_100 ).

cnf(c_0_325,negated_conjecture,
    ~ in(esk75_0,set_union2(esk75_0,unordered_pair(esk75_0,esk75_0))),
    i_0_319 ).

cnf(c_0_326,plain,
    ( in(X1,set_union2(X2,X3))
    | ~ in(X1,X3) ),
    inference(er,[status(thm)],[c_0_323]) ).

cnf(c_0_327,plain,
    in(X1,unordered_pair(X1,X2)),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_324])]) ).

cnf(c_0_328,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_325,c_0_326]),c_0_327])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SEU230+2 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n025.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 : Mon Jun 20 12:03:02 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 7.43/2.35  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.43/2.35  # No SInE strategy applied
% 7.43/2.35  # Trying AutoSched0 for 150 seconds
% 7.43/2.35  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.43/2.35  # and selection function SelectComplexExceptUniqMaxHorn.
% 7.43/2.35  #
% 7.43/2.35  # Preprocessing time       : 0.021 s
% 7.43/2.35  # Presaturation interreduction done
% 7.43/2.35  
% 7.43/2.35  # Proof found!
% 7.43/2.35  # SZS status Theorem
% 7.43/2.35  # SZS output start CNFRefutation
% See solution above
% 7.43/2.35  # Training examples: 0 positive, 0 negative
% 7.43/2.35  
% 7.43/2.35  # -------------------------------------------------
% 7.43/2.35  # User time                : 0.026 s
% 7.43/2.35  # System time              : 0.004 s
% 7.43/2.35  # Total time               : 0.030 s
% 7.43/2.35  # Maximum resident set size: 7124 pages
% 7.43/2.35  
%------------------------------------------------------------------------------