TSTP Solution File: NUM491+3 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : NUM491+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s

% Computer : n011.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  : 300s
% DateTime : Thu Aug 31 10:38:02 EDT 2023

% Result   : Theorem 0.21s 0.69s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   28
% Syntax   : Number of formulae    :   33 (   2 unt;  26 typ;   0 def)
%            Number of atoms       :   16 (   4 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   15 (   6   ~;   4   |;   5   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   34 (  17   >;  17   *;   0   +;   0  <<)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :   21 (  21 usr;   9 con; 0-3 aty)
%            Number of variables   :    4 (   0 sgn;   1   !;   2   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    aNaturalNumber0: $i > $o ).

tff(decl_23,type,
    sz00: $i ).

tff(decl_24,type,
    sz10: $i ).

tff(decl_25,type,
    sdtpldt0: ( $i * $i ) > $i ).

tff(decl_26,type,
    sdtasdt0: ( $i * $i ) > $i ).

tff(decl_27,type,
    sdtlseqdt0: ( $i * $i ) > $o ).

tff(decl_28,type,
    sdtmndt0: ( $i * $i ) > $i ).

tff(decl_29,type,
    iLess0: ( $i * $i ) > $o ).

tff(decl_30,type,
    doDivides0: ( $i * $i ) > $o ).

tff(decl_31,type,
    sdtsldt0: ( $i * $i ) > $i ).

tff(decl_32,type,
    isPrime0: $i > $o ).

tff(decl_33,type,
    xn: $i ).

tff(decl_34,type,
    xm: $i ).

tff(decl_35,type,
    xp: $i ).

tff(decl_36,type,
    xr: $i ).

tff(decl_37,type,
    esk1_2: ( $i * $i ) > $i ).

tff(decl_38,type,
    esk2_2: ( $i * $i ) > $i ).

tff(decl_39,type,
    esk3_1: $i > $i ).

tff(decl_40,type,
    esk4_1: $i > $i ).

tff(decl_41,type,
    esk5_3: ( $i * $i * $i ) > $i ).

tff(decl_42,type,
    esk6_3: ( $i * $i * $i ) > $i ).

tff(decl_43,type,
    esk7_3: ( $i * $i * $i ) > $i ).

tff(decl_44,type,
    esk8_3: ( $i * $i * $i ) > $i ).

tff(decl_45,type,
    esk9_0: $i ).

tff(decl_46,type,
    esk10_0: $i ).

tff(decl_47,type,
    esk11_0: $i ).

fof(m__,conjecture,
    ( ? [X1] :
        ( aNaturalNumber0(X1)
        & sdtasdt0(xp,xm) = sdtasdt0(xp,X1) )
    | doDivides0(xp,sdtasdt0(xp,xm)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

fof(m__1837,hypothesis,
    ( aNaturalNumber0(xn)
    & aNaturalNumber0(xm)
    & aNaturalNumber0(xp) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1837) ).

fof(c_0_2,negated_conjecture,
    ~ ( ? [X1] :
          ( aNaturalNumber0(X1)
          & sdtasdt0(xp,xm) = sdtasdt0(xp,X1) )
      | doDivides0(xp,sdtasdt0(xp,xm)) ),
    inference(assume_negation,[status(cth)],[m__]) ).

fof(c_0_3,negated_conjecture,
    ! [X101] :
      ( ( ~ aNaturalNumber0(X101)
        | sdtasdt0(xp,xm) != sdtasdt0(xp,X101) )
      & ~ doDivides0(xp,sdtasdt0(xp,xm)) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).

cnf(c_0_4,negated_conjecture,
    ( ~ aNaturalNumber0(X1)
    | sdtasdt0(xp,xm) != sdtasdt0(xp,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_5,hypothesis,
    aNaturalNumber0(xm),
    inference(split_conjunct,[status(thm)],[m__1837]) ).

cnf(c_0_6,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_4]),c_0_5])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : NUM491+3 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.35  % Computer : n011.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Fri Aug 25 14:22:53 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 0.21/0.60  start to proof: theBenchmark
% 0.21/0.69  % Version  : CSE_E---1.5
% 0.21/0.69  % Problem  : theBenchmark.p
% 0.21/0.69  % Proof found
% 0.21/0.69  % SZS status Theorem for theBenchmark.p
% 0.21/0.69  % SZS output start Proof
% See solution above
% 0.21/0.70  % Total time : 0.067000 s
% 0.21/0.70  % SZS output end Proof
% 0.21/0.70  % Total time : 0.073000 s
%------------------------------------------------------------------------------