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

View Problem - Process Solution

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

% Computer : n020.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:16 EDT 2022

% Result   : Theorem 8.49s 2.40s
% Output   : CNFRefutation 8.49s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   39 (  18 unt;  12 nHn;  39 RR)
%            Number of literals    :   85 (  27 equ;  34 neg)
%            Maximal clause size   :    7 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   25 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_45,plain,
    ( X1 = sz00
    | X1 = sz10
    | sdtlseqdt0(sz10,X1)
    | ~ aNaturalNumber0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wtyyt5oh/lgb.p',i_0_45) ).

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

cnf(i_0_50,negated_conjecture,
    sz00 != xm,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wtyyt5oh/lgb.p',i_0_50) ).

cnf(i_0_43,plain,
    ( X1 = X2
    | X3 = sz00
    | sdtlseqdt0(sdtasdt0(X3,X1),sdtasdt0(X3,X2))
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X3)
    | ~ sdtlseqdt0(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wtyyt5oh/lgb.p',i_0_43) ).

cnf(i_0_4,plain,
    aNaturalNumber0(sz10),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wtyyt5oh/lgb.p',i_0_4) ).

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

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

cnf(i_0_49,negated_conjecture,
    ~ sdtlseqdt0(xn,sdtasdt0(xn,xm)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wtyyt5oh/lgb.p',i_0_49) ).

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

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

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

cnf(i_0_15,plain,
    ( sdtasdt0(sz00,X1) = sz00
    | ~ aNaturalNumber0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wtyyt5oh/lgb.p',i_0_15) ).

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

cnf(c_0_64,plain,
    ( X1 = sz00
    | X1 = sz10
    | sdtlseqdt0(sz10,X1)
    | ~ aNaturalNumber0(X1) ),
    i_0_45 ).

cnf(c_0_65,hypothesis,
    aNaturalNumber0(xm),
    i_0_48 ).

cnf(c_0_66,negated_conjecture,
    sz00 != xm,
    i_0_50 ).

cnf(c_0_67,plain,
    ( X1 = X2
    | X3 = sz00
    | sdtlseqdt0(sdtasdt0(X3,X1),sdtasdt0(X3,X2))
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X3)
    | ~ sdtlseqdt0(X1,X2) ),
    i_0_43 ).

cnf(c_0_68,hypothesis,
    ( xm = sz10
    | sdtlseqdt0(sz10,xm) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66]) ).

cnf(c_0_69,plain,
    aNaturalNumber0(sz10),
    i_0_4 ).

cnf(c_0_70,hypothesis,
    ( xm = sz10
    | X1 = sz00
    | sdtlseqdt0(sdtasdt0(X1,sz10),sdtasdt0(X1,xm))
    | ~ aNaturalNumber0(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_65]),c_0_69])]) ).

cnf(c_0_71,hypothesis,
    aNaturalNumber0(xn),
    i_0_47 ).

cnf(c_0_72,hypothesis,
    ( xn = sz00
    | xm = sz10
    | sdtlseqdt0(sdtasdt0(xn,sz10),sdtasdt0(xn,xm)) ),
    inference(spm,[status(thm)],[c_0_70,c_0_71]) ).

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

cnf(c_0_74,negated_conjecture,
    ~ sdtlseqdt0(xn,sdtasdt0(xn,xm)),
    i_0_49 ).

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

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

cnf(c_0_77,plain,
    ( xm = sz10
    | xn = sz00 ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_71])]),c_0_74]) ).

cnf(c_0_78,plain,
    ( sdtlseqdt0(X1,sz00)
    | sdtlseqdt0(sz00,X1)
    | ~ aNaturalNumber0(X1) ),
    inference(spm,[status(thm)],[c_0_75,c_0_76]) ).

cnf(c_0_79,plain,
    ( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    i_0_11 ).

cnf(c_0_80,negated_conjecture,
    ( xm = sz10
    | ~ sdtlseqdt0(sz00,sdtasdt0(sz00,xm)) ),
    inference(spm,[status(thm)],[c_0_74,c_0_77]) ).

cnf(c_0_81,plain,
    ( sdtasdt0(sz00,X1) = sz00
    | ~ aNaturalNumber0(X1) ),
    i_0_15 ).

cnf(c_0_82,plain,
    sdtlseqdt0(sz00,sz00),
    inference(spm,[status(thm)],[c_0_78,c_0_76]) ).

cnf(c_0_83,negated_conjecture,
    ~ sdtlseqdt0(xn,sdtasdt0(xm,xn)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_79]),c_0_71]),c_0_65])]) ).

cnf(c_0_84,plain,
    xm = sz10,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_82]),c_0_65])]) ).

cnf(c_0_85,hypothesis,
    ( sdtlseqdt0(X1,xn)
    | sdtlseqdt0(xn,X1)
    | ~ aNaturalNumber0(X1) ),
    inference(spm,[status(thm)],[c_0_75,c_0_71]) ).

cnf(c_0_86,negated_conjecture,
    ~ sdtlseqdt0(xn,sdtasdt0(sz10,xn)),
    inference(rw,[status(thm)],[c_0_83,c_0_84]) ).

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

cnf(c_0_88,hypothesis,
    sdtlseqdt0(xn,xn),
    inference(spm,[status(thm)],[c_0_85,c_0_71]) ).

cnf(c_0_89,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_88]),c_0_71])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : NUM463+1 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.33  % Computer : n020.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Thu Jul  7 23:59:15 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.45  # ENIGMATIC: Selected complete mode:
% 8.49/2.40  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.49/2.40  # No SInE strategy applied
% 8.49/2.40  # Trying AutoSched0 for 150 seconds
% 8.49/2.40  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S04AN
% 8.49/2.40  # and selection function SelectComplexExceptUniqMaxHorn.
% 8.49/2.40  #
% 8.49/2.40  # Preprocessing time       : 0.025 s
% 8.49/2.40  # Presaturation interreduction done
% 8.49/2.40  
% 8.49/2.40  # Proof found!
% 8.49/2.40  # SZS status Theorem
% 8.49/2.40  # SZS output start CNFRefutation
% See solution above
% 8.49/2.40  # Training examples: 0 positive, 0 negative
% 8.49/2.40  
% 8.49/2.40  # -------------------------------------------------
% 8.49/2.40  # User time                : 0.182 s
% 8.49/2.40  # System time              : 0.010 s
% 8.49/2.40  # Total time               : 0.192 s
% 8.49/2.40  # Maximum resident set size: 7128 pages
% 8.49/2.40  
%------------------------------------------------------------------------------