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

View Problem - Process Solution

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

% Computer : n028.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:36:41 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_227,negated_conjecture,
    ( ~ aNaturalNumber0(X1)
    | ~ isPrime0(X1)
    | ~ doDivides0(X1,xk) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m7z1pq_q/lgb.p',i_0_227) ).

cnf(i_0_69,plain,
    ( X1 = sz00
    | X1 = sz10
    | doDivides0(esk4_1(X1),X1)
    | ~ aNaturalNumber0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m7z1pq_q/lgb.p',i_0_69) ).

cnf(i_0_222,hypothesis,
    aNaturalNumber0(xk),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m7z1pq_q/lgb.p',i_0_222) ).

cnf(i_0_226,hypothesis,
    sz00 != xk,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m7z1pq_q/lgb.p',i_0_226) ).

cnf(i_0_225,hypothesis,
    xk != sz10,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m7z1pq_q/lgb.p',i_0_225) ).

cnf(i_0_68,plain,
    ( X1 = sz00
    | X1 = sz10
    | isPrime0(esk4_1(X1))
    | ~ aNaturalNumber0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m7z1pq_q/lgb.p',i_0_68) ).

cnf(i_0_70,plain,
    ( X1 = sz00
    | X1 = sz10
    | aNaturalNumber0(esk4_1(X1))
    | ~ aNaturalNumber0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m7z1pq_q/lgb.p',i_0_70) ).

cnf(c_0_235,negated_conjecture,
    ( ~ aNaturalNumber0(X1)
    | ~ isPrime0(X1)
    | ~ doDivides0(X1,xk) ),
    i_0_227 ).

cnf(c_0_236,plain,
    ( X1 = sz00
    | X1 = sz10
    | doDivides0(esk4_1(X1),X1)
    | ~ aNaturalNumber0(X1) ),
    i_0_69 ).

cnf(c_0_237,hypothesis,
    aNaturalNumber0(xk),
    i_0_222 ).

cnf(c_0_238,hypothesis,
    sz00 != xk,
    i_0_226 ).

cnf(c_0_239,hypothesis,
    xk != sz10,
    i_0_225 ).

cnf(c_0_240,negated_conjecture,
    ( ~ isPrime0(esk4_1(xk))
    | ~ aNaturalNumber0(esk4_1(xk)) ),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_235,c_0_236]),c_0_237])]),c_0_238]),c_0_239]) ).

cnf(c_0_241,plain,
    ( X1 = sz00
    | X1 = sz10
    | isPrime0(esk4_1(X1))
    | ~ aNaturalNumber0(X1) ),
    i_0_68 ).

cnf(c_0_242,plain,
    ~ aNaturalNumber0(esk4_1(xk)),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_240,c_0_241]),c_0_237])]),c_0_238]),c_0_239]) ).

cnf(c_0_243,plain,
    ( X1 = sz00
    | X1 = sz10
    | aNaturalNumber0(esk4_1(X1))
    | ~ aNaturalNumber0(X1) ),
    i_0_70 ).

cnf(c_0_244,plain,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_242,c_0_243]),c_0_237])]),c_0_238]),c_0_239]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : NUM500+3 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n028.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Thu Jul  7 02:03:55 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 8.23/2.35  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.23/2.35  # No SInE strategy applied
% 8.23/2.35  # Trying AutoSched0 for 150 seconds
% 8.23/2.35  # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 8.23/2.35  # and selection function SelectNewComplexAHP.
% 8.23/2.35  #
% 8.23/2.35  # Preprocessing time       : 0.024 s
% 8.23/2.35  # Presaturation interreduction done
% 8.23/2.35  
% 8.23/2.35  # Proof found!
% 8.23/2.35  # SZS status Theorem
% 8.23/2.35  # SZS output start CNFRefutation
% See solution above
% 8.23/2.35  # Training examples: 0 positive, 0 negative
% 8.23/2.35  
% 8.23/2.35  # -------------------------------------------------
% 8.23/2.35  # User time                : 0.035 s
% 8.23/2.35  # System time              : 0.007 s
% 8.23/2.35  # Total time               : 0.042 s
% 8.23/2.35  # Maximum resident set size: 7128 pages
% 8.23/2.35  
%------------------------------------------------------------------------------