TSTP Solution File: NUM540+2 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : NUM540+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n016.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 : Mon Jul 18 08:37:08 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_93,negated_conjecture,
    aElementOf0(esk10_0,slbdtrb0(sz00)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-yov7pei8/lgb.p',i_0_93) ).

cnf(i_0_94,negated_conjecture,
    ~ aElementOf0(X1,slbdtrb0(sz00)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-yov7pei8/lgb.p',i_0_94) ).

cnf(c_0_97,negated_conjecture,
    aElementOf0(esk10_0,slbdtrb0(sz00)),
    i_0_93 ).

cnf(c_0_98,negated_conjecture,
    ~ aElementOf0(X1,slbdtrb0(sz00)),
    i_0_94 ).

cnf(c_0_99,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[c_0_97,c_0_98]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : NUM540+2 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.32  % Computer : n016.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 : Thu Jul  7 16:07:53 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 9.08/2.54  # ENIGMATIC: Solved by autoschedule-lgb:
% 9.08/2.54  # No SInE strategy applied
% 9.08/2.54  # Trying AutoSched0 for 150 seconds
% 9.08/2.54  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 9.08/2.54  # and selection function SelectComplexExceptUniqMaxHorn.
% 9.08/2.54  #
% 9.08/2.54  # Preprocessing time       : 0.023 s
% 9.08/2.54  # Presaturation interreduction done
% 9.08/2.54  
% 9.08/2.54  # Proof found!
% 9.08/2.54  # SZS status Theorem
% 9.08/2.54  # SZS output start CNFRefutation
% See solution above
% 9.08/2.54  # Training examples: 0 positive, 0 negative
% 9.08/2.54  
% 9.08/2.54  # -------------------------------------------------
% 9.08/2.54  # User time                : 0.023 s
% 9.08/2.54  # System time              : 0.005 s
% 9.08/2.54  # Total time               : 0.028 s
% 9.08/2.54  # Maximum resident set size: 7124 pages
% 9.08/2.54  
%------------------------------------------------------------------------------