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

View Problem - Process Solution

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

% Computer : n027.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.08s 2.38s
% Output   : CNFRefutation 8.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   14 (  11 unt;   0 nHn;  14 RR)
%            Number of literals    :   25 (   9 equ;  13 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :    8 (   0 sgn)

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

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

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

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

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

cnf(i_0_81,negated_conjecture,
    sdtpldt0(xp,xr) != xn,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bbas8le4/lgb.p',i_0_81) ).

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

cnf(c_0_89,plain,
    ( sdtpldt0(X1,sdtmndt0(X2,X1)) = X2
    | ~ sdtlseqdt0(X1,X2)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    inference(er,[status(thm)],[c_0_88]) ).

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

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

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

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

cnf(c_0_94,negated_conjecture,
    sdtpldt0(xp,xr) != xn,
    i_0_81 ).

cnf(c_0_95,hypothesis,
    $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_89,c_0_90]),c_0_91]),c_0_92]),c_0_93])]),c_0_94]),
    [proof] ).

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