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

% Computer : n007.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:29 EDT 2022

% Result   : Theorem 8.63s 2.42s
% Output   : CNFRefutation 8.63s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   16 (   9 unt;   0 nHn;  16 RR)
%            Number of literals    :   32 (   6 equ;  18 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   11 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_14,plain,
    ( sdtasdt0(X1,sz10) = X1
    | ~ aNaturalNumber0(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p1i6gnxp/lgb.p',i_0_14) ).

cnf(i_0_68,hypothesis,
    aNaturalNumber0(xk),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p1i6gnxp/lgb.p',i_0_68) ).

cnf(i_0_50,plain,
    ( doDivides0(X1,X2)
    | X2 != sdtasdt0(X1,X3)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p1i6gnxp/lgb.p',i_0_50) ).

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

cnf(i_0_74,negated_conjecture,
    ( ~ aNaturalNumber0(X1)
    | ~ isPrime0(X1)
    | ~ doDivides0(X1,xk) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p1i6gnxp/lgb.p',i_0_74) ).

cnf(i_0_75,negated_conjecture,
    isPrime0(xk),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p1i6gnxp/lgb.p',i_0_75) ).

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

cnf(c_0_83,hypothesis,
    aNaturalNumber0(xk),
    i_0_68 ).

cnf(c_0_84,plain,
    ( doDivides0(X1,X2)
    | X2 != sdtasdt0(X1,X3)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X3) ),
    i_0_50 ).

cnf(c_0_85,hypothesis,
    sdtasdt0(xk,sz10) = xk,
    inference(spm,[status(thm)],[c_0_82,c_0_83]) ).

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

cnf(c_0_87,plain,
    ( doDivides0(xk,X1)
    | X1 != xk
    | ~ aNaturalNumber0(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_86]),c_0_83])]) ).

cnf(c_0_88,negated_conjecture,
    ( ~ aNaturalNumber0(X1)
    | ~ isPrime0(X1)
    | ~ doDivides0(X1,xk) ),
    i_0_74 ).

cnf(c_0_89,hypothesis,
    doDivides0(xk,xk),
    inference(spm,[status(thm)],[c_0_87,c_0_83]) ).

cnf(c_0_90,negated_conjecture,
    isPrime0(xk),
    i_0_75 ).

cnf(c_0_91,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_90]),c_0_83])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : NUM482+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.33  % Computer : n007.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 05:29:45 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 8.63/2.42  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.63/2.42  # No SInE strategy applied
% 8.63/2.42  # Trying AutoSched0 for 150 seconds
% 8.63/2.42  # AutoSched0-Mode selected heuristic G_E___200_C45_F1_AE_CS_SP_PI_S0S
% 8.63/2.42  # and selection function SelectComplexG.
% 8.63/2.42  #
% 8.63/2.42  # Preprocessing time       : 0.024 s
% 8.63/2.42  
% 8.63/2.42  # Proof found!
% 8.63/2.42  # SZS status Theorem
% 8.63/2.42  # SZS output start CNFRefutation
% See solution above
% 8.63/2.42  # Training examples: 0 positive, 0 negative
% 8.63/2.42  
% 8.63/2.42  # -------------------------------------------------
% 8.63/2.42  # User time                : 0.022 s
% 8.63/2.42  # System time              : 0.010 s
% 8.63/2.42  # Total time               : 0.033 s
% 8.63/2.42  # Maximum resident set size: 7120 pages
% 8.63/2.42  
%------------------------------------------------------------------------------