TSTP Solution File: NUM475+2 by Enigma---0.5.1

View Problem - Process Solution

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

% Computer : n021.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:24 EDT 2022

% Result   : Theorem 11.33s 2.96s
% Output   : CNFRefutation 11.33s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   30 (  20 unt;   0 nHn;  30 RR)
%            Number of literals    :   60 (  17 equ;  33 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    :    9 (   9 usr;   6 con; 0-2 aty)
%            Number of variables   :   24 (   0 sgn)

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

cnf(i_0_5,plain,
    ( aNaturalNumber0(sdtpldt0(X1,X2))
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tcsw5mlc/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/sandbox2/tmp/enigma-theBenchmark.p-tcsw5mlc/lgb.p',i_0_29) ).

cnf(i_0_80,hypothesis,
    sdtpldt0(sdtasdt0(xl,xp),sdtasdt0(xl,xr)) = sdtpldt0(sdtasdt0(xl,xp),xn),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tcsw5mlc/lgb.p',i_0_80) ).

cnf(i_0_69,hypothesis,
    sdtasdt0(xl,xp) = xm,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tcsw5mlc/lgb.p',i_0_69) ).

cnf(i_0_72,hypothesis,
    sdtpldt0(xm,xn) = sdtasdt0(xl,xq),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tcsw5mlc/lgb.p',i_0_72) ).

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

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

cnf(i_0_81,negated_conjecture,
    sdtasdt0(xl,xr) != xn,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tcsw5mlc/lgb.p',i_0_81) ).

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

cnf(i_0_79,hypothesis,
    aNaturalNumber0(xr),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tcsw5mlc/lgb.p',i_0_79) ).

cnf(i_0_60,hypothesis,
    aNaturalNumber0(xl),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tcsw5mlc/lgb.p',i_0_60) ).

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

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

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

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

cnf(c_0_98,hypothesis,
    sdtpldt0(sdtasdt0(xl,xp),sdtasdt0(xl,xr)) = sdtpldt0(sdtasdt0(xl,xp),xn),
    i_0_80 ).

cnf(c_0_99,hypothesis,
    sdtasdt0(xl,xp) = xm,
    i_0_69 ).

cnf(c_0_100,hypothesis,
    sdtpldt0(xm,xn) = sdtasdt0(xl,xq),
    i_0_72 ).

cnf(c_0_101,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_96]),c_0_95]),c_0_97]) ).

cnf(c_0_102,hypothesis,
    aNaturalNumber0(xm),
    i_0_59 ).

cnf(c_0_103,hypothesis,
    aNaturalNumber0(xn),
    i_0_58 ).

cnf(c_0_104,hypothesis,
    sdtpldt0(xm,sdtasdt0(xl,xr)) = sdtasdt0(xl,xq),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_98,c_0_99]),c_0_99]),c_0_100]) ).

cnf(c_0_105,hypothesis,
    sdtmndt0(sdtasdt0(xl,xq),xm) = xn,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_100]),c_0_102]),c_0_103])]) ).

cnf(c_0_106,negated_conjecture,
    sdtasdt0(xl,xr) != xn,
    i_0_81 ).

cnf(c_0_107,hypothesis,
    ~ aNaturalNumber0(sdtasdt0(xl,xr)),
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_104]),c_0_102])]),c_0_105]),c_0_106]) ).

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

cnf(c_0_109,hypothesis,
    aNaturalNumber0(xr),
    i_0_79 ).

cnf(c_0_110,hypothesis,
    aNaturalNumber0(xl),
    i_0_60 ).

cnf(c_0_111,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_108]),c_0_109]),c_0_110])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.08  % Problem  : NUM475+2 : TPTP v8.1.0. Released v4.0.0.
% 0.02/0.09  % Command  : enigmatic-eprover.py %s %d 1
% 0.09/0.28  % Computer : n021.cluster.edu
% 0.09/0.28  % Model    : x86_64 x86_64
% 0.09/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28  % Memory   : 8042.1875MB
% 0.09/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28  % CPULimit : 300
% 0.09/0.28  % WCLimit  : 600
% 0.09/0.28  % DateTime : Thu Jul  7 07:08:06 EDT 2022
% 0.09/0.28  % CPUTime  : 
% 0.13/0.38  # ENIGMATIC: Selected complete mode:
% 11.33/2.96  # ENIGMATIC: Solved by autoschedule-lgb:
% 11.33/2.96  # No SInE strategy applied
% 11.33/2.96  # Trying AutoSched0 for 150 seconds
% 11.33/2.96  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2m
% 11.33/2.96  # and selection function SelectCQArNTNpEqFirst.
% 11.33/2.96  #
% 11.33/2.96  # Preprocessing time       : 0.024 s
% 11.33/2.96  # Presaturation interreduction done
% 11.33/2.96  
% 11.33/2.96  # Proof found!
% 11.33/2.96  # SZS status Theorem
% 11.33/2.96  # SZS output start CNFRefutation
% See solution above
% 11.33/2.96  # Training examples: 0 positive, 0 negative
% 11.33/2.96  
% 11.33/2.96  # -------------------------------------------------
% 11.33/2.96  # User time                : 0.036 s
% 11.33/2.96  # System time              : 0.003 s
% 11.33/2.96  # Total time               : 0.039 s
% 11.33/2.96  # Maximum resident set size: 7124 pages
% 11.33/2.96  
%------------------------------------------------------------------------------