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

View Problem - Process Solution

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

% Computer : n008.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:40 EDT 2022

% Result   : Theorem 7.54s 2.46s
% Output   : CNFRefutation 7.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   16
% Syntax   : Number of clauses     :   44 (  24 unt;   8 nHn;  44 RR)
%            Number of literals    :   77 (  45 equ;  36 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :   18 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_205,hypothesis,
    ( X1 = sz10
    | X1 = xp
    | sdtasdt0(X1,X2) != xp
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2gfvycyy/lgb.p',i_0_205) ).

cnf(i_0_221,hypothesis,
    sdtasdt0(xp,xk) = sdtasdt0(xn,xm),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2gfvycyy/lgb.p',i_0_221) ).

cnf(i_0_72,hypothesis,
    aNaturalNumber0(xm),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2gfvycyy/lgb.p',i_0_72) ).

cnf(i_0_73,hypothesis,
    aNaturalNumber0(xn),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2gfvycyy/lgb.p',i_0_73) ).

cnf(i_0_219,hypothesis,
    xp != xn,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2gfvycyy/lgb.p',i_0_219) ).

cnf(i_0_226,negated_conjecture,
    ( sdtasdt0(xp,X1) != xn
    | ~ aNaturalNumber0(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2gfvycyy/lgb.p',i_0_226) ).

cnf(i_0_16,plain,
    ( sdtasdt0(X1,sz00) = sz00
    | ~ aNaturalNumber0(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2gfvycyy/lgb.p',i_0_16) ).

cnf(i_0_2,plain,
    aNaturalNumber0(sz00),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2gfvycyy/lgb.p',i_0_2) ).

cnf(i_0_71,hypothesis,
    aNaturalNumber0(xp),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2gfvycyy/lgb.p',i_0_71) ).

cnf(i_0_224,negated_conjecture,
    ( sdtasdt0(xp,X1) != xm
    | ~ aNaturalNumber0(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2gfvycyy/lgb.p',i_0_224) ).

cnf(i_0_227,negated_conjecture,
    ( sz00 = xk
    | xk = sz10 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2gfvycyy/lgb.p',i_0_227) ).

cnf(i_0_25,plain,
    ( X1 = sz00
    | X2 = sz00
    | sdtasdt0(X2,X1) != sz00
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2gfvycyy/lgb.p',i_0_25) ).

cnf(i_0_14,plain,
    ( sdtasdt0(X1,sz10) = X1
    | ~ aNaturalNumber0(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2gfvycyy/lgb.p',i_0_14) ).

cnf(i_0_200,hypothesis,
    doDivides0(xp,sdtasdt0(xn,xm)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2gfvycyy/lgb.p',i_0_200) ).

cnf(i_0_13,plain,
    ( sdtasdt0(sz10,X1) = X1
    | ~ aNaturalNumber0(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2gfvycyy/lgb.p',i_0_13) ).

cnf(i_0_223,negated_conjecture,
    ~ doDivides0(xp,xm),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2gfvycyy/lgb.p',i_0_223) ).

cnf(c_0_244,hypothesis,
    ( X1 = sz10
    | X1 = xp
    | sdtasdt0(X1,X2) != xp
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2) ),
    i_0_205 ).

cnf(c_0_245,hypothesis,
    sdtasdt0(xp,xk) = sdtasdt0(xn,xm),
    i_0_221 ).

cnf(c_0_246,hypothesis,
    aNaturalNumber0(xm),
    i_0_72 ).

cnf(c_0_247,hypothesis,
    aNaturalNumber0(xn),
    i_0_73 ).

cnf(c_0_248,hypothesis,
    xp != xn,
    i_0_219 ).

cnf(c_0_249,negated_conjecture,
    ( sdtasdt0(xp,X1) != xn
    | ~ aNaturalNumber0(X1) ),
    i_0_226 ).

cnf(c_0_250,plain,
    ( sdtasdt0(X1,sz00) = sz00
    | ~ aNaturalNumber0(X1) ),
    i_0_16 ).

cnf(c_0_251,plain,
    aNaturalNumber0(sz00),
    i_0_2 ).

cnf(c_0_252,hypothesis,
    aNaturalNumber0(xp),
    i_0_71 ).

cnf(c_0_253,negated_conjecture,
    ( sdtasdt0(xp,X1) != xm
    | ~ aNaturalNumber0(X1) ),
    i_0_224 ).

cnf(c_0_254,hypothesis,
    ( xn = sz10
    | sdtasdt0(xp,xk) != xp ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_244,c_0_245]),c_0_246]),c_0_247])]),c_0_248]) ).

cnf(c_0_255,negated_conjecture,
    ( sz00 = xk
    | xk = sz10 ),
    i_0_227 ).

cnf(c_0_256,plain,
    ( X1 = sz00
    | X2 = sz00
    | sdtasdt0(X2,X1) != sz00
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2) ),
    i_0_25 ).

cnf(c_0_257,negated_conjecture,
    xn != sz00,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_249,c_0_250]),c_0_251]),c_0_252])]) ).

cnf(c_0_258,negated_conjecture,
    xm != sz00,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_253,c_0_250]),c_0_251]),c_0_252])]) ).

cnf(c_0_259,negated_conjecture,
    ( xk = sz00
    | xn = sz10
    | sdtasdt0(xp,sz10) != xp ),
    inference(spm,[status(thm)],[c_0_254,c_0_255]) ).

cnf(c_0_260,plain,
    ( sdtasdt0(X1,sz10) = X1
    | ~ aNaturalNumber0(X1) ),
    i_0_14 ).

cnf(c_0_261,hypothesis,
    sdtasdt0(xp,xk) != sz00,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_256,c_0_245]),c_0_247]),c_0_246])]),c_0_257]),c_0_258]) ).

cnf(c_0_262,plain,
    ( xn = sz10
    | xk = sz00 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_259,c_0_260]),c_0_252])]) ).

cnf(c_0_263,hypothesis,
    ( xn = sz10
    | sdtasdt0(xp,sz00) != sz00 ),
    inference(spm,[status(thm)],[c_0_261,c_0_262]) ).

cnf(c_0_264,plain,
    xn = sz10,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_263,c_0_250]),c_0_252])]) ).

cnf(c_0_265,hypothesis,
    doDivides0(xp,sdtasdt0(xn,xm)),
    i_0_200 ).

cnf(c_0_266,plain,
    ( sdtasdt0(sz10,X1) = X1
    | ~ aNaturalNumber0(X1) ),
    i_0_13 ).

cnf(c_0_267,hypothesis,
    sdtasdt0(sz10,xm) = sdtasdt0(xp,xk),
    inference(rw,[status(thm)],[c_0_245,c_0_264]) ).

cnf(c_0_268,hypothesis,
    doDivides0(xp,sdtasdt0(xp,xk)),
    inference(rw,[status(thm)],[c_0_265,c_0_245]) ).

cnf(c_0_269,plain,
    sdtasdt0(xp,xk) = xm,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_266,c_0_267]),c_0_246])]) ).

cnf(c_0_270,negated_conjecture,
    ~ doDivides0(xp,xm),
    i_0_223 ).

cnf(c_0_271,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_268,c_0_269]),c_0_270]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : NUM498+3 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n008.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Tue Jul  5 12:22:55 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 7.54/2.46  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.54/2.46  # No SInE strategy applied
% 7.54/2.46  # Trying AutoSched0 for 150 seconds
% 7.54/2.46  # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 7.54/2.46  # and selection function SelectNewComplexAHP.
% 7.54/2.46  #
% 7.54/2.46  # Preprocessing time       : 0.025 s
% 7.54/2.46  # Presaturation interreduction done
% 7.54/2.46  
% 7.54/2.46  # Proof found!
% 7.54/2.46  # SZS status Theorem
% 7.54/2.46  # SZS output start CNFRefutation
% See solution above
% 7.54/2.46  # Training examples: 0 positive, 0 negative
% 7.54/2.46  
% 7.54/2.46  # -------------------------------------------------
% 7.54/2.46  # User time                : 0.036 s
% 7.54/2.46  # System time              : 0.010 s
% 7.54/2.46  # Total time               : 0.046 s
% 7.54/2.46  # Maximum resident set size: 7124 pages
% 7.54/2.46  
%------------------------------------------------------------------------------