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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SEU295+3 : TPTP v8.1.0. Released v3.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 08:40:31 EDT 2022

% Result   : Theorem 7.79s 2.30s
% Output   : CNFRefutation 7.79s
% 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 (   0 equ;   4 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :    4 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_135,negated_conjecture,
    ~ finite(set_intersection2(esk27_0,esk28_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g_k5y11x/lgb.p',i_0_135) ).

cnf(i_0_29,plain,
    ( finite(set_intersection2(X1,X2))
    | ~ finite(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g_k5y11x/lgb.p',i_0_29) ).

cnf(i_0_136,negated_conjecture,
    finite(esk27_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g_k5y11x/lgb.p',i_0_136) ).

cnf(c_0_140,negated_conjecture,
    ~ finite(set_intersection2(esk27_0,esk28_0)),
    i_0_135 ).

cnf(c_0_141,plain,
    ( finite(set_intersection2(X1,X2))
    | ~ finite(X1) ),
    i_0_29 ).

cnf(c_0_142,negated_conjecture,
    finite(esk27_0),
    i_0_136 ).

cnf(c_0_143,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_140,c_0_141]),c_0_142])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : SEU295+3 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.11  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.32  % Computer : n029.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 600
% 0.12/0.32  % DateTime : Sun Jun 19 20:44:02 EDT 2022
% 0.12/0.32  % CPUTime  : 
% 0.18/0.43  # ENIGMATIC: Selected complete mode:
% 7.79/2.30  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.79/2.30  # No SInE strategy applied
% 7.79/2.30  # Trying AutoSched0 for 150 seconds
% 7.79/2.30  # AutoSched0-Mode selected heuristic H_____102_C18_F1_PI_AE_CS_SP_PS_S2S
% 7.79/2.30  # and selection function SelectNewComplexAHP.
% 7.79/2.30  #
% 7.79/2.30  # Preprocessing time       : 0.023 s
% 7.79/2.30  # Presaturation interreduction done
% 7.79/2.30  
% 7.79/2.30  # Proof found!
% 7.79/2.30  # SZS status Theorem
% 7.79/2.30  # SZS output start CNFRefutation
% See solution above
% 7.79/2.30  # Training examples: 0 positive, 0 negative
% 7.79/2.30  
% 7.79/2.30  # -------------------------------------------------
% 7.79/2.30  # User time                : 0.027 s
% 7.79/2.30  # System time              : 0.005 s
% 7.79/2.30  # Total time               : 0.031 s
% 7.79/2.30  # Maximum resident set size: 7124 pages
% 7.79/2.30  
%------------------------------------------------------------------------------