%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : NUM425+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n018.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 14:26:03 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(3,axiom,
    aInteger0(xa),
    file('NUM425+1.p',unknown),
    [] ).

cnf(4,axiom,
    aInteger0(xb),
    file('NUM425+1.p',unknown),
    [] ).

cnf(5,axiom,
    aInteger0(xq),
    file('NUM425+1.p',unknown),
    [] ).

cnf(6,axiom,
    aInteger0(skf1(u,v)),
    file('NUM425+1.p',unknown),
    [] ).

cnf(7,axiom,
    ~ equal(xq,sz00),
    file('NUM425+1.p',unknown),
    [] ).

cnf(8,axiom,
    sdteqdtlpzmzozddtrp0(xa,xb,xq),
    file('NUM425+1.p',unknown),
    [] ).

cnf(9,axiom,
    ( ~ aInteger0(u)
    | aInteger0(smndt0(u)) ),
    file('NUM425+1.p',unknown),
    [] ).

cnf(19,axiom,
    ( ~ aInteger0(u)
    | ~ aInteger0(v)
    | aInteger0(sdtpldt0(v,u)) ),
    file('NUM425+1.p',unknown),
    [] ).

cnf(24,axiom,
    ( ~ aInteger0(u)
    | ~ equal(sdtasdt0(xq,u),sdtpldt0(xa,smndt0(xb))) ),
    file('NUM425+1.p',unknown),
    [] ).

cnf(28,axiom,
    ( ~ aInteger0(u)
    | ~ aDivisorOf0(v,u)
    | equal(sdtasdt0(v,skf1(u,v)),u) ),
    file('NUM425+1.p',unknown),
    [] ).

cnf(36,axiom,
    ( ~ aInteger0(u)
    | ~ aInteger0(v)
    | ~ aInteger0(w)
    | ~ sdteqdtlpzmzozddtrp0(w,v,u)
    | equal(u,sz00)
    | aDivisorOf0(u,sdtpldt0(w,smndt0(v))) ),
    file('NUM425+1.p',unknown),
    [] ).

cnf(42,plain,
    ~ equal(sdtasdt0(xq,skf1(u,v)),sdtpldt0(xa,smndt0(xb))),
    inference(res,[status(thm),theory(equality)],[6,24]),
    [iquote('0:Res:6.0,24.0')] ).

cnf(179,plain,
    ( ~ aInteger0(u)
    | ~ aDivisorOf0(xq,u)
    | ~ equal(u,sdtpldt0(xa,smndt0(xb))) ),
    inference(spl,[status(thm),theory(equality)],[28,42]),
    [iquote('0:SpL:28.2,42.0')] ).

cnf(189,plain,
    ( ~ aInteger0(sdtpldt0(xa,smndt0(xb)))
    | ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))) ),
    inference(eqr,[status(thm),theory(equality)],[179]),
    [iquote('0:EqR:179.2')] ).

cnf(190,plain,
    ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))),
    inference(ssi,[status(thm)],[189,19,3,9,4]),
    [iquote('0:SSi:189.0,19.0,3.1,9.0,4.2')] ).

cnf(723,plain,
    ( ~ aInteger0(xq)
    | ~ aInteger0(xb)
    | ~ aInteger0(xa)
    | equal(xq,sz00)
    | aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))) ),
    inference(res,[status(thm),theory(equality)],[8,36]),
    [iquote('0:Res:8.0,36.3')] ).

cnf(726,plain,
    ( equal(xq,sz00)
    | aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))) ),
    inference(ssi,[status(thm)],[723,3,4,5]),
    [iquote('0:SSi:723.2,723.1,723.0,3.0,4.0,5.0')] ).

cnf(727,plain,
    $false,
    inference(mrr,[status(thm)],[726,7,190]),
    [iquote('0:MRR:726.0,726.1,7.0,190.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : NUM425+1 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n018.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Wed Jul  6 20:36:38 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.51  
% 0.19/0.51  SPASS V 3.9 
% 0.19/0.51  SPASS beiseite: Proof found.
% 0.19/0.51  % SZS status Theorem
% 0.19/0.51  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.19/0.51  SPASS derived 355 clauses, backtracked 0 clauses, performed 1 splits and kept 162 clauses.
% 0.19/0.51  SPASS allocated 98418 KBytes.
% 0.19/0.51  SPASS spent	0:00:00.16 on the problem.
% 0.19/0.51  		0:00:00.04 for the input.
% 0.19/0.51  		0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.51  		0:00:00.01 for inferences.
% 0.19/0.51  		0:00:00.00 for the backtracking.
% 0.19/0.51  		0:00:00.06 for the reduction.
% 0.19/0.51  
% 0.19/0.51  
% 0.19/0.51  Here is a proof with depth 3, length 18 :
% 0.19/0.51  % SZS output start Refutation
% See solution above
% 0.19/0.51  Formulae used in the proof : m__704 mDivisor m__724 mIntNeg mIntPlus m__ mEquMod
% 0.19/0.51  
%------------------------------------------------------------------------------