TSTP Solution File: SET900+1 by Enigma---0.5.1

View Problem - Process Solution

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

% Computer : n027.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:06 EDT 2022

% Result   : Theorem 7.25s 2.31s
% Output   : CNFRefutation 7.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   12 (   5 unt;   5 nHn;   9 RR)
%            Number of literals    :   23 (  18 equ;   8 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    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   11 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_5,negated_conjecture,
    ( X1 = esk4_0
    | ~ in(X1,esk3_0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zrqjl_j6/input.p',i_0_5) ).

cnf(i_0_9,plain,
    ( X1 = empty_set
    | X1 = singleton(X2)
    | in(esk5_2(X1,X2),X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zrqjl_j6/input.p',i_0_9) ).

cnf(i_0_6,negated_conjecture,
    esk3_0 != empty_set,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zrqjl_j6/input.p',i_0_6) ).

cnf(i_0_8,plain,
    ( X1 = empty_set
    | X1 = singleton(X2)
    | esk5_2(X1,X2) != X2 ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zrqjl_j6/input.p',i_0_8) ).

cnf(i_0_7,negated_conjecture,
    singleton(esk4_0) != esk3_0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zrqjl_j6/input.p',i_0_7) ).

cnf(c_0_15,negated_conjecture,
    ( X1 = esk4_0
    | ~ in(X1,esk3_0) ),
    i_0_5 ).

cnf(c_0_16,plain,
    ( X1 = empty_set
    | X1 = singleton(X2)
    | in(esk5_2(X1,X2),X1) ),
    i_0_9 ).

cnf(c_0_17,negated_conjecture,
    esk3_0 != empty_set,
    i_0_6 ).

cnf(c_0_18,plain,
    ( X1 = empty_set
    | X1 = singleton(X2)
    | esk5_2(X1,X2) != X2 ),
    i_0_8 ).

cnf(c_0_19,negated_conjecture,
    ( esk5_2(esk3_0,X1) = esk4_0
    | singleton(X1) = esk3_0 ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).

cnf(c_0_20,negated_conjecture,
    singleton(esk4_0) != esk3_0,
    i_0_7 ).

cnf(c_0_21,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_17])]),c_0_20]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SET900+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 : n027.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.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sun Jul 10 01:08:19 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 7.25/2.31  # ENIGMATIC: Solved by autoschedule:
% 7.25/2.31  # No SInE strategy applied
% 7.25/2.31  # Trying AutoSched0 for 150 seconds
% 7.25/2.31  # AutoSched0-Mode selected heuristic G_____0010_evo
% 7.25/2.31  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.25/2.31  #
% 7.25/2.31  # Preprocessing time       : 0.023 s
% 7.25/2.31  
% 7.25/2.31  # Proof found!
% 7.25/2.31  # SZS status Theorem
% 7.25/2.31  # SZS output start CNFRefutation
% See solution above
% 7.25/2.32  # Training examples: 0 positive, 0 negative
% 7.25/2.32  
% 7.25/2.32  # -------------------------------------------------
% 7.25/2.32  # User time                : 0.023 s
% 7.25/2.32  # System time              : 0.006 s
% 7.25/2.32  # Total time               : 0.029 s
% 7.25/2.32  # Maximum resident set size: 7120 pages
% 7.25/2.32  
%------------------------------------------------------------------------------