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

% Computer : n020.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 00:14:54 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_3,plain,
    ( X1 != empty_set
    | ~ in(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6avg2bnd/lgb.p',i_0_3) ).

cnf(i_0_4,plain,
    ( X1 = union(X2)
    | in(esk3_2(X2,X1),X1)
    | in(esk4_2(X2,X1),X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6avg2bnd/lgb.p',i_0_4) ).

cnf(i_0_13,negated_conjecture,
    union(empty_set) != empty_set,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6avg2bnd/lgb.p',i_0_13) ).

cnf(c_0_17,plain,
    ( X1 != empty_set
    | ~ in(X2,X1) ),
    i_0_3 ).

cnf(c_0_18,plain,
    ~ in(X1,empty_set),
    inference(er,[status(thm)],[c_0_17]) ).

cnf(c_0_19,plain,
    ( X1 = union(X2)
    | in(esk3_2(X2,X1),X1)
    | in(esk4_2(X2,X1),X2) ),
    i_0_4 ).

cnf(c_0_20,plain,
    ( X1 = union(empty_set)
    | in(esk3_2(empty_set,X1),X1) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_21,negated_conjecture,
    union(empty_set) != empty_set,
    i_0_13 ).

cnf(c_0_22,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_20]),c_0_21]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : SET867+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.11/0.33  % Computer : n020.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Mon Jul 11 02:23:15 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.11/0.38  # ENIGMATIC: Selected complete mode:
% 7.19/2.24  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.19/2.24  # No SInE strategy applied
% 7.19/2.24  # Trying AutoSched0 for 150 seconds
% 7.19/2.24  # AutoSched0-Mode selected heuristic G_E___300_C18_F1_SE_CS_SP_S0Y
% 7.19/2.24  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.19/2.24  #
% 7.19/2.24  # Preprocessing time       : 0.012 s
% 7.19/2.24  
% 7.19/2.24  # Proof found!
% 7.19/2.24  # SZS status Theorem
% 7.19/2.24  # SZS output start CNFRefutation
% See solution above
% 7.19/2.24  # Training examples: 0 positive, 0 negative
% 7.19/2.24  
% 7.19/2.24  # -------------------------------------------------
% 7.19/2.24  # User time                : 0.014 s
% 7.19/2.24  # System time              : 0.003 s
% 7.19/2.24  # Total time               : 0.017 s
% 7.19/2.24  # Maximum resident set size: 7124 pages
% 7.19/2.24  
%------------------------------------------------------------------------------