%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : NUM427+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 : n025.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:20 EDT 2023

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

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

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

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

fof(m__767,hypothesis,
    sdtasdt0(xq,smndt0(xn)) = sdtpldt0(xb,smndt0(xa)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__767) ).

fof(mIntNeg,axiom,
    ! [X1] :
      ( aInteger0(X1)
     => aInteger0(smndt0(X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mIntNeg) ).

fof(m__747,hypothesis,
    ( aInteger0(xn)
    & sdtasdt0(xq,xn) = sdtpldt0(xa,smndt0(xb)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__747) ).

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

fof(c_0_5,negated_conjecture,
    ! [X40] :
      ( ( ~ aInteger0(X40)
        | sdtasdt0(xq,X40) != sdtpldt0(xb,smndt0(xa)) )
      & ~ aDivisorOf0(xq,sdtpldt0(xb,smndt0(xa)))
      & ~ sdteqdtlpzmzozddtrp0(xb,xa,xq) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).

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

cnf(c_0_7,hypothesis,
    sdtasdt0(xq,smndt0(xn)) = sdtpldt0(xb,smndt0(xa)),
    inference(split_conjunct,[status(thm)],[m__767]) ).

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

fof(c_0_9,plain,
    ! [X4] :
      ( ~ aInteger0(X4)
      | aInteger0(smndt0(X4)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIntNeg])]) ).

cnf(c_0_10,negated_conjecture,
    ~ aInteger0(smndt0(xn)),
    inference(er,[status(thm)],[c_0_8]) ).

cnf(c_0_11,plain,
    ( aInteger0(smndt0(X1))
    | ~ aInteger0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_12,hypothesis,
    aInteger0(xn),
    inference(split_conjunct,[status(thm)],[m__747]) ).

cnf(c_0_13,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : NUM427+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.14/0.34  % Computer : n025.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Fri Aug 25 16:11:22 EDT 2023
% 0.14/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.58  % Total time : 0.008000 s
% 0.20/0.58  % SZS output end Proof
% 0.20/0.58  % Total time : 0.011000 s
%------------------------------------------------------------------------------