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

% Computer : n010.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 7.55s 2.39s
% Output   : CNFRefutation 7.55s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   16 (   9 unt;   0 nHn;  11 RR)
%            Number of literals    :   27 (  13 equ;  14 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    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   29 (   7 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_12,plain,
    ( in(X1,X2)
    | X2 != set_union2(X3,X4)
    | ~ in(X1,X4) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-73yhk17f/lgb.p',i_0_12) ).

cnf(i_0_5,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != singleton(X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-73yhk17f/lgb.p',i_0_5) ).

cnf(i_0_21,negated_conjecture,
    set_union2(singleton(esk6_0),esk7_0) = empty_set,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-73yhk17f/lgb.p',i_0_21) ).

cnf(i_0_2,plain,
    set_union2(X1,X2) = set_union2(X2,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-73yhk17f/lgb.p',i_0_2) ).

cnf(i_0_8,plain,
    ( X1 != empty_set
    | ~ in(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-73yhk17f/lgb.p',i_0_8) ).

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

cnf(c_0_28,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != singleton(X3) ),
    i_0_5 ).

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

cnf(c_0_30,plain,
    in(X1,singleton(X1)),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_28])]) ).

cnf(c_0_31,negated_conjecture,
    set_union2(singleton(esk6_0),esk7_0) = empty_set,
    i_0_21 ).

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

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

cnf(c_0_34,plain,
    in(X1,set_union2(X2,singleton(X1))),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_35,negated_conjecture,
    set_union2(esk7_0,singleton(esk6_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,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET908+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n010.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 Jul 10 19:10:47 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 7.55/2.39  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.55/2.39  # No SInE strategy applied
% 7.55/2.39  # Trying AutoSched0 for 150 seconds
% 7.55/2.39  # AutoSched0-Mode selected heuristic G_____0026_C18_F1_SE_CS_SP_S4S
% 7.55/2.39  # and selection function SelectNewComplexAHPNS.
% 7.55/2.39  #
% 7.55/2.39  # Preprocessing time       : 0.020 s
% 7.55/2.39  
% 7.55/2.39  # Proof found!
% 7.55/2.39  # SZS status Theorem
% 7.55/2.39  # SZS output start CNFRefutation
% See solution above
% 7.55/2.39  # Training examples: 0 positive, 0 negative
% 7.55/2.39  
% 7.55/2.39  # -------------------------------------------------
% 7.55/2.39  # User time                : 0.021 s
% 7.55/2.39  # System time              : 0.006 s
% 7.55/2.39  # Total time               : 0.027 s
% 7.55/2.39  # Maximum resident set size: 7120 pages
% 7.55/2.39  
%------------------------------------------------------------------------------