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

View Problem - Process Solution

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

% Computer : n010.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:14 EDT 2022

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

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

cnf(i_0_43,negated_conjecture,
    sdtpldt0(xm,esk2_0) = xn,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rr8934k6/lgb.p',i_0_43) ).

cnf(i_0_44,negated_conjecture,
    aNaturalNumber0(esk2_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rr8934k6/lgb.p',i_0_44) ).

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

cnf(i_0_38,negated_conjecture,
    ( sdtpldt0(xm,X1) != xl
    | ~ aNaturalNumber0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rr8934k6/lgb.p',i_0_38) ).

cnf(i_0_40,negated_conjecture,
    sdtpldt0(xn,esk3_0) = xl,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rr8934k6/lgb.p',i_0_40) ).

cnf(i_0_41,negated_conjecture,
    aNaturalNumber0(esk3_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rr8934k6/lgb.p',i_0_41) ).

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

cnf(c_0_53,plain,
    ( sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3))
    | ~ aNaturalNumber0(X3)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    i_0_8 ).

cnf(c_0_54,negated_conjecture,
    sdtpldt0(xm,esk2_0) = xn,
    i_0_43 ).

cnf(c_0_55,negated_conjecture,
    aNaturalNumber0(esk2_0),
    i_0_44 ).

cnf(c_0_56,hypothesis,
    aNaturalNumber0(xm),
    i_0_36 ).

cnf(c_0_57,negated_conjecture,
    ( sdtpldt0(xm,X1) != xl
    | ~ aNaturalNumber0(X1) ),
    i_0_38 ).

cnf(c_0_58,negated_conjecture,
    ( sdtpldt0(xm,sdtpldt0(esk2_0,X1)) = sdtpldt0(xn,X1)
    | ~ aNaturalNumber0(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55]),c_0_56])]) ).

cnf(c_0_59,negated_conjecture,
    ( sdtpldt0(xn,X1) != xl
    | ~ aNaturalNumber0(sdtpldt0(esk2_0,X1))
    | ~ aNaturalNumber0(X1) ),
    inference(spm,[status(thm)],[c_0_57,c_0_58]) ).

cnf(c_0_60,negated_conjecture,
    sdtpldt0(xn,esk3_0) = xl,
    i_0_40 ).

cnf(c_0_61,negated_conjecture,
    aNaturalNumber0(esk3_0),
    i_0_41 ).

cnf(c_0_62,negated_conjecture,
    ~ aNaturalNumber0(sdtpldt0(esk2_0,esk3_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61])]) ).

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

cnf(c_0_64,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_61]),c_0_55])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : NUM460+2 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n010.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.34  % DateTime : Thu Jul  7 10:20:33 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 4.46/2.24  # ENIGMATIC: Solved by autoschedule-lgb:
% 4.46/2.24  # No SInE strategy applied
% 4.46/2.24  # Trying AutoSched0 for 150 seconds
% 4.46/2.24  # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_AE_Q4_CS_SP_S4d
% 4.46/2.24  # and selection function SelectCQIPrecWNTNp.
% 4.46/2.24  #
% 4.46/2.24  # Preprocessing time       : 0.012 s
% 4.46/2.24  
% 4.46/2.24  # Proof found!
% 4.46/2.24  # SZS status Theorem
% 4.46/2.24  # SZS output start CNFRefutation
% See solution above
% 4.46/2.24  # Training examples: 0 positive, 0 negative
% 4.46/2.24  
% 4.46/2.24  # -------------------------------------------------
% 4.46/2.24  # User time                : 0.017 s
% 4.46/2.24  # System time              : 0.004 s
% 4.46/2.24  # Total time               : 0.021 s
% 4.46/2.24  # Maximum resident set size: 7124 pages
% 4.46/2.24  
%------------------------------------------------------------------------------