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

% Computer : n015.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:23 EDT 2023

% Result   : Theorem 0.20s 0.58s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   24 (   3 unt;  14 typ;   0 def)
%            Number of atoms       :   23 (  10 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   22 (   9   ~;   3   |;  10   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    3 (   2 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    :   11 (  11 usr;   7 con; 0-2 aty)
%            Number of variables   :    6 (   0 sgn;   1   !;   3   ?;   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,
    xp: $i ).

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

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

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

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

fof(m__1003,hypothesis,
    ( sdtasdt0(xp,xq) != sz00
    & ? [X1] :
        ( aInteger0(X1)
        & sdtasdt0(sdtasdt0(xp,xq),X1) = sdtpldt0(xa,smndt0(xb)) )
    & aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
    & sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1003) ).

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

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

fof(c_0_4,hypothesis,
    ( sdtasdt0(xp,xq) != sz00
    & aInteger0(esk2_0)
    & sdtasdt0(sdtasdt0(xp,xq),esk2_0) = sdtpldt0(xa,smndt0(xb))
    & aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
    & sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq)) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__1003])]) ).

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

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

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

cnf(c_0_8,hypothesis,
    aInteger0(esk2_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.00/0.12  % Problem    : NUM434+3 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34  % Computer : n015.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    : 300
% 0.12/0.34  % DateTime   : Fri Aug 25 10:38:51 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 0.20/0.56  start to proof: theBenchmark
% 0.20/0.58  % Version  : CSE_E---1.5
% 0.20/0.58  % Problem  : theBenchmark.p
% 0.20/0.58  % Proof found
% 0.20/0.58  % SZS status Theorem for theBenchmark.p
% 0.20/0.58  % SZS output start Proof
% See solution above
% 0.20/0.59  % Total time : 0.010000 s
% 0.20/0.59  % SZS output end Proof
% 0.20/0.59  % Total time : 0.013000 s
%------------------------------------------------------------------------------