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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : NUM505+1 : 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:36:44 EDT 2022

% Result   : Theorem 8.17s 2.50s
% Output   : CNFRefutation 8.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   37 (  19 unt;   8 nHn;  37 RR)
%            Number of literals    :   75 (  18 equ;  35 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   20 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_55,plain,
    ( X1 = sz00
    | aNaturalNumber0(X2)
    | X2 != sdtsldt0(X3,X1)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X3)
    | ~ doDivides0(X1,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-epp0fyyf/lgb.p',i_0_55) ).

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

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

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

cnf(i_0_93,negated_conjecture,
    ( xk = xp
    | ~ sdtlseqdt0(xk,xp) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-epp0fyyf/lgb.p',i_0_93) ).

cnf(i_0_35,plain,
    ( sdtlseqdt0(X1,X2)
    | sdtlseqdt0(X2,X1)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-epp0fyyf/lgb.p',i_0_35) ).

cnf(i_0_94,negated_conjecture,
    ~ sdtlseqdt0(xp,xk),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-epp0fyyf/lgb.p',i_0_94) ).

cnf(i_0_6,plain,
    ( aNaturalNumber0(sdtasdt0(X1,X2))
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-epp0fyyf/lgb.p',i_0_6) ).

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

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

cnf(i_0_32,plain,
    ( sdtlseqdt0(X1,X1)
    | ~ aNaturalNumber0(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-epp0fyyf/lgb.p',i_0_32) ).

cnf(i_0_67,plain,
    ( X1 != sz00
    | ~ aNaturalNumber0(X1)
    | ~ isPrime0(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-epp0fyyf/lgb.p',i_0_67) ).

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

cnf(i_0_76,hypothesis,
    isPrime0(xp),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-epp0fyyf/lgb.p',i_0_76) ).

cnf(c_0_109,plain,
    ( X1 = sz00
    | aNaturalNumber0(X2)
    | X2 != sdtsldt0(X3,X1)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X3)
    | ~ doDivides0(X1,X3) ),
    i_0_55 ).

cnf(c_0_110,plain,
    ( X1 = sz00
    | aNaturalNumber0(sdtsldt0(X2,X1))
    | ~ doDivides0(X1,X2)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    inference(er,[status(thm)],[c_0_109]) ).

cnf(c_0_111,hypothesis,
    doDivides0(xp,sdtasdt0(xn,xm)),
    i_0_75 ).

cnf(c_0_112,hypothesis,
    sdtsldt0(sdtasdt0(xn,xm),xp) = xk,
    i_0_83 ).

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

cnf(c_0_114,negated_conjecture,
    ( xk = xp
    | ~ sdtlseqdt0(xk,xp) ),
    i_0_93 ).

cnf(c_0_115,plain,
    ( sdtlseqdt0(X1,X2)
    | sdtlseqdt0(X2,X1)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2) ),
    i_0_35 ).

cnf(c_0_116,negated_conjecture,
    ~ sdtlseqdt0(xp,xk),
    i_0_94 ).

cnf(c_0_117,hypothesis,
    ( xp = sz00
    | aNaturalNumber0(xk)
    | ~ aNaturalNumber0(sdtasdt0(xn,xm)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_111]),c_0_112]),c_0_113])]) ).

cnf(c_0_118,plain,
    ( aNaturalNumber0(sdtasdt0(X1,X2))
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    i_0_6 ).

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

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

cnf(c_0_121,negated_conjecture,
    ( xk = xp
    | ~ aNaturalNumber0(xk) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_115]),c_0_113])]),c_0_116]) ).

cnf(c_0_122,plain,
    ( xp = sz00
    | aNaturalNumber0(xk) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_118]),c_0_119]),c_0_120])]) ).

cnf(c_0_123,negated_conjecture,
    ( xp = sz00
    | xk = xp ),
    inference(spm,[status(thm)],[c_0_121,c_0_122]) ).

cnf(c_0_124,negated_conjecture,
    ( xp = sz00
    | ~ sdtlseqdt0(xp,xp) ),
    inference(spm,[status(thm)],[c_0_116,c_0_123]) ).

cnf(c_0_125,plain,
    ( sdtlseqdt0(X1,X1)
    | ~ aNaturalNumber0(X1) ),
    i_0_32 ).

cnf(c_0_126,plain,
    ( X1 != sz00
    | ~ aNaturalNumber0(X1)
    | ~ isPrime0(X1) ),
    i_0_67 ).

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

cnf(c_0_128,hypothesis,
    isPrime0(xp),
    i_0_76 ).

cnf(c_0_129,plain,
    xp = sz00,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_125]),c_0_113])]) ).

cnf(c_0_130,plain,
    ~ isPrime0(sz00),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_126]),c_0_127])]) ).

cnf(c_0_131,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_128,c_0_129]),c_0_130]),
    [proof] ).

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