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

View Problem - Process Solution

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

% Computer : n013.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:56 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_4281,negated_conjecture,
    ( sdtlpdtrp0(xe,X1) != xp
    | ~ aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-suyeu68s/lgb.p',i_0_4281) ).

cnf(i_0_4274,hypothesis,
    aElementOf0(esk41_0,sdtlbdtrb0(xd,szDzizrdt0(xd))),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-suyeu68s/lgb.p',i_0_4274) ).

cnf(i_0_4273,hypothesis,
    sdtlpdtrp0(xe,esk41_0) = xp,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-suyeu68s/lgb.p',i_0_4273) ).

cnf(c_0_4285,negated_conjecture,
    ( sdtlpdtrp0(xe,X1) != xp
    | ~ aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
    i_0_4281 ).

cnf(c_0_4286,hypothesis,
    aElementOf0(esk41_0,sdtlbdtrb0(xd,szDzizrdt0(xd))),
    i_0_4274 ).

cnf(c_0_4287,hypothesis,
    sdtlpdtrp0(xe,esk41_0) = xp,
    i_0_4273 ).

cnf(c_0_4288,hypothesis,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4285,c_0_4286]),c_0_4287])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14  % Problem  : NUM615+3 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.14  % Command  : enigmatic-eprover.py %s %d 1
% 0.15/0.36  % Computer : n013.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 600
% 0.15/0.36  % DateTime : Wed Jul  6 12:59:31 EDT 2022
% 0.15/0.36  % CPUTime  : 
% 0.23/0.48  # ENIGMATIC: Selected complete mode:
% 6.42/3.69  # ENIGMATIC: Solved by autoschedule-lgb:
% 6.42/3.69  # No SInE strategy applied
% 6.42/3.69  # Trying AutoSched0 for 150 seconds
% 6.42/3.69  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 6.42/3.69  # and selection function SelectComplexExceptUniqMaxHorn.
% 6.42/3.69  #
% 6.42/3.69  # Preprocessing time       : 0.023 s
% 6.42/3.69  # Presaturation interreduction done
% 6.42/3.69  
% 6.42/3.69  # Proof found!
% 6.42/3.69  # SZS status Theorem
% 6.42/3.69  # SZS output start CNFRefutation
% See solution above
% 6.42/3.69  # Training examples: 0 positive, 0 negative
% 6.42/3.69  
% 6.42/3.69  # -------------------------------------------------
% 6.42/3.69  # User time                : 0.027 s
% 6.42/3.69  # System time              : 0.006 s
% 6.42/3.69  # Total time               : 0.032 s
% 6.42/3.69  # Maximum resident set size: 7132 pages
% 6.42/3.69  
%------------------------------------------------------------------------------