TSTP Solution File: SET604+3 by Enigma---0.5.1

View Problem - Process Solution

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

% Computer : n009.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:12:40 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_17,negated_conjecture,
    difference(empty_set,esk3_0) != empty_set,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zcdn2hoe/input.p',i_0_17) ).

cnf(i_0_2,plain,
    ( difference(X1,X2) = empty_set
    | ~ subset(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zcdn2hoe/input.p',i_0_2) ).

cnf(i_0_1,plain,
    subset(empty_set,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zcdn2hoe/input.p',i_0_1) ).

cnf(c_0_21,negated_conjecture,
    difference(empty_set,esk3_0) != empty_set,
    i_0_17 ).

cnf(c_0_22,plain,
    ( difference(X1,X2) = empty_set
    | ~ subset(X1,X2) ),
    i_0_2 ).

cnf(c_0_23,plain,
    subset(empty_set,X1),
    i_0_1 ).

cnf(c_0_24,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET604+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n009.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 14:05:23 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 7.75/2.37  # ENIGMATIC: Solved by autoschedule:
% 7.75/2.37  # No SInE strategy applied
% 7.75/2.37  # Trying AutoSched0 for 150 seconds
% 7.75/2.37  # AutoSched0-Mode selected heuristic G_E___205_C45_F1_AE_CS_SP_PI_S0Y
% 7.75/2.37  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.75/2.37  #
% 7.75/2.37  # Preprocessing time       : 0.012 s
% 7.75/2.37  
% 7.75/2.37  # Proof found!
% 7.75/2.37  # SZS status Theorem
% 7.75/2.37  # SZS output start CNFRefutation
% See solution above
% 7.75/2.37  # Training examples: 0 positive, 0 negative
% 7.75/2.37  
% 7.75/2.37  # -------------------------------------------------
% 7.75/2.37  # User time                : 0.011 s
% 7.75/2.37  # System time              : 0.005 s
% 7.75/2.37  # Total time               : 0.016 s
% 7.75/2.37  # Maximum resident set size: 7120 pages
% 7.75/2.37  
%------------------------------------------------------------------------------