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

View Problem - Process Solution

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

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

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_50,plain,
    ( doDivides0(X1,X2)
    | X2 != sdtasdt0(X1,X3)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ep55xzz8/input.p',i_0_50) ).

cnf(i_0_6,plain,
    ( aNaturalNumber0(sdtasdt0(X1,X2))
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ep55xzz8/input.p',i_0_6) ).

cnf(i_0_79,hypothesis,
    sdtasdt0(xp,sdtasdt0(xm,xm)) = sdtasdt0(xn,xn),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ep55xzz8/input.p',i_0_79) ).

cnf(i_0_75,hypothesis,
    aNaturalNumber0(xp),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ep55xzz8/input.p',i_0_75) ).

cnf(i_0_76,hypothesis,
    aNaturalNumber0(xm),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ep55xzz8/input.p',i_0_76) ).

cnf(i_0_81,negated_conjecture,
    ( ~ doDivides0(xp,xn)
    | ~ doDivides0(xp,sdtasdt0(xn,xn)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ep55xzz8/input.p',i_0_81) ).

cnf(i_0_71,plain,
    ( doDivides0(X1,X2)
    | doDivides0(X1,X3)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X3)
    | ~ isPrime0(X1)
    | ~ doDivides0(X1,sdtasdt0(X3,X2)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ep55xzz8/input.p',i_0_71) ).

cnf(i_0_80,hypothesis,
    isPrime0(xp),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ep55xzz8/input.p',i_0_80) ).

cnf(i_0_77,hypothesis,
    aNaturalNumber0(xn),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ep55xzz8/input.p',i_0_77) ).

cnf(c_0_91,plain,
    ( doDivides0(X1,X2)
    | X2 != sdtasdt0(X1,X3)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X3) ),
    i_0_50 ).

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

cnf(c_0_93,plain,
    ( doDivides0(X1,sdtasdt0(X1,X2))
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_91]),c_0_92]) ).

cnf(c_0_94,hypothesis,
    sdtasdt0(xp,sdtasdt0(xm,xm)) = sdtasdt0(xn,xn),
    i_0_79 ).

cnf(c_0_95,hypothesis,
    aNaturalNumber0(xp),
    i_0_75 ).

cnf(c_0_96,hypothesis,
    ( doDivides0(xp,sdtasdt0(xn,xn))
    | ~ aNaturalNumber0(sdtasdt0(xm,xm)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_95])]) ).

cnf(c_0_97,hypothesis,
    aNaturalNumber0(xm),
    i_0_76 ).

cnf(c_0_98,negated_conjecture,
    ( ~ doDivides0(xp,xn)
    | ~ doDivides0(xp,sdtasdt0(xn,xn)) ),
    i_0_81 ).

cnf(c_0_99,plain,
    doDivides0(xp,sdtasdt0(xn,xn)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_92]),c_0_97])]) ).

cnf(c_0_100,plain,
    ( doDivides0(X1,X2)
    | doDivides0(X1,X3)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X3)
    | ~ isPrime0(X1)
    | ~ doDivides0(X1,sdtasdt0(X3,X2)) ),
    i_0_71 ).

cnf(c_0_101,hypothesis,
    isPrime0(xp),
    i_0_80 ).

cnf(c_0_102,hypothesis,
    aNaturalNumber0(xn),
    i_0_77 ).

cnf(c_0_103,negated_conjecture,
    ~ doDivides0(xp,xn),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_98,c_0_99])]) ).

cnf(c_0_104,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_99]),c_0_101]),c_0_102]),c_0_95])]),c_0_103]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : NUM523+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.14/0.33  % Computer : n004.cluster.edu
% 0.14/0.33  % Model    : x86_64 x86_64
% 0.14/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33  % Memory   : 8042.1875MB
% 0.14/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33  % CPULimit : 300
% 0.14/0.33  % WCLimit  : 600
% 0.14/0.33  % DateTime : Wed Jul  6 15:02:54 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.20/0.45  # ENIGMATIC: Selected complete mode:
% 7.91/2.52  # ENIGMATIC: Solved by autoschedule:
% 7.91/2.52  # No SInE strategy applied
% 7.91/2.52  # Trying AutoSched0 for 150 seconds
% 7.91/2.52  # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 7.91/2.52  # and selection function SelectNewComplexAHP.
% 7.91/2.52  #
% 7.91/2.52  # Preprocessing time       : 0.014 s
% 7.91/2.52  # Presaturation interreduction done
% 7.91/2.52  
% 7.91/2.52  # Proof found!
% 7.91/2.52  # SZS status Theorem
% 7.91/2.52  # SZS output start CNFRefutation
% See solution above
% 7.91/2.52  # Training examples: 0 positive, 0 negative
% 7.91/2.52  
% 7.91/2.52  # -------------------------------------------------
% 7.91/2.52  # User time                : 0.022 s
% 7.91/2.52  # System time              : 0.004 s
% 7.91/2.52  # Total time               : 0.026 s
% 7.91/2.52  # Maximum resident set size: 7120 pages
% 7.91/2.52  
%------------------------------------------------------------------------------