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

% Computer : n005.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:15:10 EDT 2022

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

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

cnf(i_0_24,negated_conjecture,
    set_union2(unordered_pair(esk6_0,esk7_0),esk8_0) = empty_set,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y_eyppz0/input.p',i_0_24) ).

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

cnf(i_0_5,plain,
    ( X1 != empty_set
    | ~ in(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y_eyppz0/input.p',i_0_5) ).

cnf(i_0_9,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != unordered_pair(X4,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y_eyppz0/input.p',i_0_9) ).

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

cnf(c_0_31,negated_conjecture,
    set_union2(unordered_pair(esk6_0,esk7_0),esk8_0) = empty_set,
    i_0_24 ).

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

cnf(c_0_33,plain,
    ( X1 != empty_set
    | ~ in(X2,X1) ),
    i_0_5 ).

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

cnf(c_0_35,negated_conjecture,
    set_union2(esk8_0,unordered_pair(esk6_0,esk7_0)) = empty_set,
    inference(rw,[status(thm)],[c_0_31,c_0_32]) ).

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

cnf(c_0_37,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != unordered_pair(X4,X3) ),
    i_0_9 ).

cnf(c_0_38,negated_conjecture,
    ~ in(X1,unordered_pair(esk6_0,esk7_0)),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).

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

cnf(c_0_40,plain,
    $false,
    inference(spm,[status(thm)],[c_0_38,c_0_39]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem  : SET909+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n005.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sun Jul 10 16:38:23 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.17/0.43  # ENIGMATIC: Selected complete mode:
% 6.89/2.19  # ENIGMATIC: Solved by autoschedule:
% 6.89/2.19  # No SInE strategy applied
% 6.89/2.19  # Trying AutoSched0 for 150 seconds
% 6.89/2.19  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S0Y_ni
% 6.89/2.19  # and selection function SelectMaxLComplexAvoidPosPred.
% 6.89/2.19  #
% 6.89/2.19  # Preprocessing time       : 0.012 s
% 6.89/2.19  # Presaturation interreduction done
% 6.89/2.19  
% 6.89/2.19  # Proof found!
% 6.89/2.19  # SZS status Theorem
% 6.89/2.19  # SZS output start CNFRefutation
% See solution above
% 6.89/2.19  # Training examples: 0 positive, 0 negative
% 6.89/2.19  
% 6.89/2.19  # -------------------------------------------------
% 6.89/2.19  # User time                : 0.016 s
% 6.89/2.19  # System time              : 0.001 s
% 6.89/2.19  # Total time               : 0.017 s
% 6.89/2.19  # Maximum resident set size: 7124 pages
% 6.89/2.19  
%------------------------------------------------------------------------------