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

View Problem - Process Solution

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

% Computer : n026.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:52 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_20,negated_conjecture,
    union(difference(esk4_0,esk4_0),difference(esk4_0,esk4_0)) != empty_set,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ar45hosm/input.p',i_0_20) ).

cnf(i_0_3,plain,
    difference(X1,X1) = empty_set,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ar45hosm/input.p',i_0_3) ).

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

cnf(c_0_24,negated_conjecture,
    union(difference(esk4_0,esk4_0),difference(esk4_0,esk4_0)) != empty_set,
    i_0_20 ).

cnf(c_0_25,plain,
    difference(X1,X1) = empty_set,
    i_0_3 ).

cnf(c_0_26,negated_conjecture,
    union(empty_set,empty_set) != empty_set,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25]),c_0_25]) ).

cnf(c_0_27,plain,
    union(X1,X1) = X1,
    i_0_2 ).

cnf(c_0_28,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : SET618+3 : TPTP v8.1.0. Released v2.2.0.
% 0.00/0.11  % Command  : enigmatic-eprover.py %s %d 1
% 0.11/0.32  % Computer : n026.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Sun Jul 10 06:56:43 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 7.67/2.41  # ENIGMATIC: Solved by autoschedule:
% 7.67/2.41  # No SInE strategy applied
% 7.67/2.41  # Trying AutoSched0 for 150 seconds
% 7.67/2.41  # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 7.67/2.41  # and selection function SelectNewComplexAHP.
% 7.67/2.41  #
% 7.67/2.41  # Preprocessing time       : 0.023 s
% 7.67/2.41  # Presaturation interreduction done
% 7.67/2.41  
% 7.67/2.41  # Proof found!
% 7.67/2.41  # SZS status Theorem
% 7.67/2.41  # SZS output start CNFRefutation
% See solution above
% 7.67/2.41  # Training examples: 0 positive, 0 negative
% 7.67/2.41  
% 7.67/2.41  # -------------------------------------------------
% 7.67/2.41  # User time                : 0.028 s
% 7.67/2.41  # System time              : 0.001 s
% 7.67/2.41  # Total time               : 0.029 s
% 7.67/2.41  # Maximum resident set size: 7120 pages
% 7.67/2.41  
%------------------------------------------------------------------------------