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

View Problem - Process Solution

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

% Computer : n003.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:36 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_16,negated_conjecture,
    ~ subset(difference(esk3_0,esk4_0),union(difference(esk3_0,esk4_0),difference(esk4_0,esk3_0))),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tpug3go1/input.p',i_0_16) ).

cnf(i_0_2,plain,
    subset(X1,union(X1,X2)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tpug3go1/input.p',i_0_2) ).

cnf(c_0_19,negated_conjecture,
    ~ subset(difference(esk3_0,esk4_0),union(difference(esk3_0,esk4_0),difference(esk4_0,esk3_0))),
    i_0_16 ).

cnf(c_0_20,plain,
    subset(X1,union(X1,X2)),
    i_0_2 ).

cnf(c_0_21,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : SET599+3 : TPTP v8.1.0. Released v2.2.0.
% 0.00/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n003.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 : Sun Jul 10 21:29:31 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.45  # ENIGMATIC: Selected complete mode:
% 7.40/2.38  # ENIGMATIC: Solved by autoschedule:
% 7.40/2.38  # No SInE strategy applied
% 7.40/2.38  # Trying AutoSched0 for 150 seconds
% 7.40/2.38  # AutoSched0-Mode selected heuristic C12_02_nc_SAT001_MinMin_rr
% 7.40/2.38  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.40/2.38  #
% 7.40/2.38  # Preprocessing time       : 0.023 s
% 7.40/2.38  # Presaturation interreduction done
% 7.40/2.38  
% 7.40/2.38  # Proof found!
% 7.40/2.38  # SZS status Theorem
% 7.40/2.38  # SZS output start CNFRefutation
% See solution above
% 7.40/2.38  # Training examples: 0 positive, 0 negative
% 7.40/2.38  
% 7.40/2.38  # -------------------------------------------------
% 7.40/2.38  # User time                : 0.026 s
% 7.40/2.38  # System time              : 0.002 s
% 7.40/2.38  # Total time               : 0.028 s
% 7.40/2.38  # Maximum resident set size: 7116 pages
% 7.40/2.38  
%------------------------------------------------------------------------------