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

View Problem - Process Solution

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

% Computer : n005.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:38:22 EDT 2022

% Result   : Theorem 4.51s 2.27s
% Output   : CNFRefutation 4.51s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    4
% Syntax   : Number of clauses     :    9 (   7 unt;   0 nHn;   9 RR)
%            Number of literals    :   13 (   0 equ;   6 neg)
%            Maximal clause size   :    3 (   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 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_145,negated_conjecture,
    ~ finite(set_union2(esk27_0,esk28_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2uis4pl8/lgb.p',i_0_145) ).

cnf(i_0_59,plain,
    ( finite(set_union2(X1,X2))
    | ~ finite(X2)
    | ~ finite(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2uis4pl8/lgb.p',i_0_59) ).

cnf(i_0_146,negated_conjecture,
    finite(esk28_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2uis4pl8/lgb.p',i_0_146) ).

cnf(i_0_147,negated_conjecture,
    finite(esk27_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2uis4pl8/lgb.p',i_0_147) ).

cnf(c_0_152,negated_conjecture,
    ~ finite(set_union2(esk27_0,esk28_0)),
    i_0_145 ).

cnf(c_0_153,plain,
    ( finite(set_union2(X1,X2))
    | ~ finite(X2)
    | ~ finite(X1) ),
    i_0_59 ).

cnf(c_0_154,negated_conjecture,
    finite(esk28_0),
    i_0_146 ).

cnf(c_0_155,negated_conjecture,
    finite(esk27_0),
    i_0_147 ).

cnf(c_0_156,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_152,c_0_153]),c_0_154]),c_0_155])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SEU083+1 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.33  % Computer : n005.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Sun Jun 19 08:16:40 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 4.51/2.27  # ENIGMATIC: Solved by autoschedule-lgb:
% 4.51/2.27  # No SInE strategy applied
% 4.51/2.27  # Trying AutoSched0 for 150 seconds
% 4.51/2.27  # AutoSched0-Mode selected heuristic G_E___208_B07_F1_SE_CS_SP_PS_S2q
% 4.51/2.27  # and selection function SelectCQArNTNp.
% 4.51/2.27  #
% 4.51/2.27  # Preprocessing time       : 0.023 s
% 4.51/2.27  # Presaturation interreduction done
% 4.51/2.27  
% 4.51/2.27  # Proof found!
% 4.51/2.27  # SZS status Theorem
% 4.51/2.27  # SZS output start CNFRefutation
% See solution above
% 4.51/2.27  # Training examples: 0 positive, 0 negative
% 4.51/2.27  
% 4.51/2.27  # -------------------------------------------------
% 4.51/2.27  # User time                : 0.027 s
% 4.51/2.27  # System time              : 0.005 s
% 4.51/2.27  # Total time               : 0.032 s
% 4.51/2.27  # Maximum resident set size: 7124 pages
% 4.51/2.27  
%------------------------------------------------------------------------------