%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : NUM430+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 : n002.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:37:21 EDT 2023

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

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

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

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

tff(decl_25,type,
    smndt0: $i > $i ).

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

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

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

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

tff(decl_30,type,
    xa: $i ).

tff(decl_31,type,
    xb: $i ).

tff(decl_32,type,
    xq: $i ).

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

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

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

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

tff(decl_37,type,
    esk3_0: $i ).

fof(m__,conjecture,
    ? [X1] :
      ( aInteger0(X1)
      & sdtasdt0(xq,X1) = sdtpldt0(xb,smndt0(xc)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

fof(m__853,hypothesis,
    ( ? [X1] :
        ( aInteger0(X1)
        & sdtasdt0(xq,X1) = sdtpldt0(xa,smndt0(xb)) )
    & aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
    & sdteqdtlpzmzozddtrp0(xa,xb,xq)
    & ? [X1] :
        ( aInteger0(X1)
        & sdtasdt0(xq,X1) = sdtpldt0(xb,smndt0(xc)) )
    & aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc)))
    & sdteqdtlpzmzozddtrp0(xb,xc,xq) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__853) ).

fof(c_0_2,negated_conjecture,
    ~ ? [X1] :
        ( aInteger0(X1)
        & sdtasdt0(xq,X1) = sdtpldt0(xb,smndt0(xc)) ),
    inference(assume_negation,[status(cth)],[m__]) ).

fof(c_0_3,negated_conjecture,
    ! [X44] :
      ( ~ aInteger0(X44)
      | sdtasdt0(xq,X44) != sdtpldt0(xb,smndt0(xc)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])]) ).

fof(c_0_4,hypothesis,
    ( aInteger0(esk2_0)
    & sdtasdt0(xq,esk2_0) = sdtpldt0(xa,smndt0(xb))
    & aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
    & sdteqdtlpzmzozddtrp0(xa,xb,xq)
    & aInteger0(esk3_0)
    & sdtasdt0(xq,esk3_0) = sdtpldt0(xb,smndt0(xc))
    & aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc)))
    & sdteqdtlpzmzozddtrp0(xb,xc,xq) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__853])]) ).

cnf(c_0_5,negated_conjecture,
    ( ~ aInteger0(X1)
    | sdtasdt0(xq,X1) != sdtpldt0(xb,smndt0(xc)) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,hypothesis,
    sdtasdt0(xq,esk3_0) = sdtpldt0(xb,smndt0(xc)),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    ( sdtasdt0(xq,X1) != sdtasdt0(xq,esk3_0)
    | ~ aInteger0(X1) ),
    inference(rw,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_8,hypothesis,
    aInteger0(esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_9,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_7]),c_0_8])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.15  % Problem    : NUM430+3 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.16  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.15/0.36  % Computer : n002.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Fri Aug 25 10:51:47 EDT 2023
% 0.15/0.37  % CPUTime  : 
% 0.23/0.59  start to proof: theBenchmark
% 0.23/0.62  % Version  : CSE_E---1.5
% 0.23/0.62  % Problem  : theBenchmark.p
% 0.23/0.62  % Proof found
% 0.23/0.62  % SZS status Theorem for theBenchmark.p
% 0.23/0.62  % SZS output start Proof
% See solution above
% 0.23/0.62  % Total time : 0.010000 s
% 0.23/0.62  % SZS output end Proof
% 0.23/0.62  % Total time : 0.013000 s
%------------------------------------------------------------------------------