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

View Problem - Process Solution

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

% Computer : n003.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:34 EDT 2022

% Result   : Theorem 8.26s 2.34s
% Output   : CNFRefutation 8.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   31 (  17 unt;   0 nHn;  31 RR)
%            Number of literals    :   73 (  15 equ;  46 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   32 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_26,plain,
    ( sdtlseqdt0(X1,X2)
    | sdtpldt0(X1,X3) != X2
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-589pi5q5/lgb.p',i_0_26) ).

cnf(i_0_5,plain,
    ( aNaturalNumber0(sdtpldt0(X1,X2))
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-589pi5q5/lgb.p',i_0_5) ).

cnf(i_0_29,plain,
    ( X1 = sdtmndt0(X2,X3)
    | sdtpldt0(X3,X1) != X2
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X3)
    | ~ aNaturalNumber0(X1)
    | ~ sdtlseqdt0(X3,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-589pi5q5/lgb.p',i_0_29) ).

cnf(i_0_82,hypothesis,
    sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)) = sdtasdt0(xn,xm),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-589pi5q5/lgb.p',i_0_82) ).

cnf(i_0_83,negated_conjecture,
    sdtmndt0(sdtasdt0(xn,xm),sdtasdt0(xp,xm)) != sdtasdt0(xr,xm),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-589pi5q5/lgb.p',i_0_83) ).

cnf(i_0_31,plain,
    ( aNaturalNumber0(X1)
    | X1 != sdtmndt0(X2,X3)
    | ~ aNaturalNumber0(X3)
    | ~ aNaturalNumber0(X2)
    | ~ sdtlseqdt0(X3,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-589pi5q5/lgb.p',i_0_31) ).

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

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

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

cnf(i_0_77,hypothesis,
    sdtlseqdt0(xp,xn),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-589pi5q5/lgb.p',i_0_77) ).

cnf(i_0_78,hypothesis,
    sdtmndt0(xn,xp) = xr,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-589pi5q5/lgb.p',i_0_78) ).

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

cnf(c_0_96,plain,
    ( sdtlseqdt0(X1,X2)
    | sdtpldt0(X1,X3) != X2
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X3) ),
    i_0_26 ).

cnf(c_0_97,plain,
    ( aNaturalNumber0(sdtpldt0(X1,X2))
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    i_0_5 ).

cnf(c_0_98,plain,
    ( X1 = sdtmndt0(X2,X3)
    | sdtpldt0(X3,X1) != X2
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X3)
    | ~ aNaturalNumber0(X1)
    | ~ sdtlseqdt0(X3,X2) ),
    i_0_29 ).

cnf(c_0_99,plain,
    ( sdtlseqdt0(X1,sdtpldt0(X1,X2))
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_96]),c_0_97]) ).

cnf(c_0_100,plain,
    ( sdtmndt0(sdtpldt0(X1,X2),X1) = X2
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_98]),c_0_97]),c_0_99]) ).

cnf(c_0_101,hypothesis,
    sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)) = sdtasdt0(xn,xm),
    i_0_82 ).

cnf(c_0_102,negated_conjecture,
    sdtmndt0(sdtasdt0(xn,xm),sdtasdt0(xp,xm)) != sdtasdt0(xr,xm),
    i_0_83 ).

cnf(c_0_103,plain,
    ( aNaturalNumber0(X1)
    | X1 != sdtmndt0(X2,X3)
    | ~ aNaturalNumber0(X3)
    | ~ aNaturalNumber0(X2)
    | ~ sdtlseqdt0(X3,X2) ),
    i_0_31 ).

cnf(c_0_104,hypothesis,
    ( ~ aNaturalNumber0(sdtasdt0(xp,xm))
    | ~ aNaturalNumber0(sdtasdt0(xr,xm)) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_102]) ).

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

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

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

cnf(c_0_108,plain,
    ( aNaturalNumber0(sdtmndt0(X1,X2))
    | ~ sdtlseqdt0(X2,X1)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    inference(er,[status(thm)],[c_0_103]) ).

cnf(c_0_109,hypothesis,
    sdtlseqdt0(xp,xn),
    i_0_77 ).

cnf(c_0_110,hypothesis,
    sdtmndt0(xn,xp) = xr,
    i_0_78 ).

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

cnf(c_0_112,plain,
    ~ aNaturalNumber0(sdtasdt0(xr,xm)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_105]),c_0_106]),c_0_107])]) ).

cnf(c_0_113,hypothesis,
    aNaturalNumber0(xr),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_109]),c_0_110]),c_0_107]),c_0_111])]) ).

cnf(c_0_114,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_105]),c_0_106]),c_0_113])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : NUM490+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n003.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 : Tue Jul  5 11:41:42 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 8.26/2.34  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.26/2.34  # No SInE strategy applied
% 8.26/2.34  # Trying AutoSched0 for 150 seconds
% 8.26/2.34  # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 8.26/2.34  # and selection function SelectNewComplexAHP.
% 8.26/2.34  #
% 8.26/2.34  # Preprocessing time       : 0.021 s
% 8.26/2.34  # Presaturation interreduction done
% 8.26/2.34  
% 8.26/2.34  # Proof found!
% 8.26/2.34  # SZS status Theorem
% 8.26/2.34  # SZS output start CNFRefutation
% See solution above
% 8.26/2.34  # Training examples: 0 positive, 0 negative
% 8.26/2.34  
% 8.26/2.34  # -------------------------------------------------
% 8.26/2.34  # User time                : 0.028 s
% 8.26/2.34  # System time              : 0.007 s
% 8.26/2.34  # Total time               : 0.035 s
% 8.26/2.34  # Maximum resident set size: 7128 pages
% 8.26/2.34  
%------------------------------------------------------------------------------