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

% Computer : n014.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 : Mon Jul 18 08:35:37 EDT 2022

% Result   : Theorem 4.46s 2.08s
% Output   : CNFRefutation 4.46s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    3
% Syntax   : Number of clauses     :    8 (   6 unt;   0 nHn;   6 RR)
%            Number of literals    :   10 (   2 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    :    3 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :    6 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_43,plain,
    in(X1,set_union2(X1,singleton(X1))),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-we3qwm2f/lgb.p',i_0_43) ).

cnf(i_0_44,negated_conjecture,
    set_union2(esk12_0,singleton(esk12_0)) = esk12_0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-we3qwm2f/lgb.p',i_0_44) ).

cnf(i_0_1,plain,
    ( ~ in(X1,X2)
    | ~ in(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-we3qwm2f/lgb.p',i_0_1) ).

cnf(c_0_48,plain,
    in(X1,set_union2(X1,singleton(X1))),
    i_0_43 ).

cnf(c_0_49,negated_conjecture,
    set_union2(esk12_0,singleton(esk12_0)) = esk12_0,
    i_0_44 ).

cnf(c_0_50,plain,
    ( ~ in(X1,X2)
    | ~ in(X2,X1) ),
    i_0_1 ).

cnf(c_0_51,negated_conjecture,
    in(esk12_0,esk12_0),
    inference(spm,[status(thm)],[c_0_48,c_0_49]) ).

cnf(c_0_52,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_51])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : NUM387+1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n014.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 : Tue Jul  5 11:54:55 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.17/0.44  # ENIGMATIC: Selected complete mode:
% 4.46/2.08  # ENIGMATIC: Solved by autoschedule-lgb:
% 4.46/2.08  # No SInE strategy applied
% 4.46/2.08  # Trying AutoSched0 for 150 seconds
% 4.46/2.08  # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 4.46/2.08  # and selection function SelectNewComplexAHP.
% 4.46/2.08  #
% 4.46/2.08  # Preprocessing time       : 0.023 s
% 4.46/2.08  # Presaturation interreduction done
% 4.46/2.08  
% 4.46/2.08  # Proof found!
% 4.46/2.08  # SZS status Theorem
% 4.46/2.08  # SZS output start CNFRefutation
% See solution above
% 4.46/2.08  # Training examples: 0 positive, 0 negative
% 4.46/2.08  
% 4.46/2.08  # -------------------------------------------------
% 4.46/2.08  # User time                : 0.021 s
% 4.46/2.08  # System time              : 0.007 s
% 4.46/2.08  # Total time               : 0.029 s
% 4.46/2.08  # Maximum resident set size: 7124 pages
% 4.46/2.08  
%------------------------------------------------------------------------------