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

% Computer : n029.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:08:50 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
    ~ member(X1,empty_set),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wm32r0ln/lgb.p',i_0_1) ).

cnf(i_0_3,plain,
    ( subset(X1,X2)
    | member(esk1_2(X1,X2),X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wm32r0ln/lgb.p',i_0_3) ).

cnf(i_0_8,negated_conjecture,
    ~ subset(empty_set,esk3_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wm32r0ln/lgb.p',i_0_8) ).

cnf(c_0_12,plain,
    ~ member(X1,empty_set),
    i_0_1 ).

cnf(c_0_13,plain,
    ( subset(X1,X2)
    | member(esk1_2(X1,X2),X1) ),
    i_0_3 ).

cnf(c_0_14,negated_conjecture,
    ~ subset(empty_set,esk3_0),
    i_0_8 ).

cnf(c_0_15,plain,
    subset(empty_set,X1),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_16,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET062+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n029.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sun Jul 10 12:26:03 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 7.50/2.32  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.50/2.32  # No SInE strategy applied
% 7.50/2.32  # Trying AutoSched0 for 150 seconds
% 7.50/2.32  # AutoSched0-Mode selected heuristic G_E___092_C01_F1_AE_CS_SP_PS_CO_S0Y
% 7.50/2.32  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.50/2.32  #
% 7.50/2.32  # Preprocessing time       : 0.023 s
% 7.50/2.32  # Presaturation interreduction done
% 7.50/2.32  
% 7.50/2.32  # Proof found!
% 7.50/2.32  # SZS status Theorem
% 7.50/2.32  # SZS output start CNFRefutation
% See solution above
% 7.50/2.32  # Training examples: 0 positive, 0 negative
% 7.50/2.32  
% 7.50/2.32  # -------------------------------------------------
% 7.50/2.32  # User time                : 0.024 s
% 7.50/2.32  # System time              : 0.006 s
% 7.50/2.32  # Total time               : 0.030 s
% 7.50/2.32  # Maximum resident set size: 7124 pages
% 7.50/2.32  
%------------------------------------------------------------------------------