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

% Computer : n013.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:05 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(7,axiom,
    aInteger0(xn),
    file('NUM427+3.p',unknown),
    [] ).

cnf(12,axiom,
    ( ~ aInteger0(u)
    | aInteger0(smndt0(u)) ),
    file('NUM427+3.p',unknown),
    [] ).

cnf(26,axiom,
    equal(sdtasdt0(xq,smndt0(xn)),sdtpldt0(xb,smndt0(xa))),
    file('NUM427+3.p',unknown),
    [] ).

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

cnf(56,plain,
    ~ aInteger0(smndt0(xn)),
    inference(res,[status(thm),theory(equality)],[26,32]),
    [iquote('0:Res:26.0,32.1')] ).

cnf(59,plain,
    ~ aInteger0(xn),
    inference(sor,[status(thm)],[56,12]),
    [iquote('0:SoR:56.0,12.1')] ).

cnf(60,plain,
    $false,
    inference(ssi,[status(thm)],[59,7]),
    [iquote('0:SSi:59.0,7.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : NUM427+3 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13  % Command  : run_spass %d %s
% 0.13/0.33  % Computer : n013.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Thu Jul  7 12:14:29 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.18/0.44  
% 0.18/0.44  SPASS V 3.9 
% 0.18/0.44  SPASS beiseite: Proof found.
% 0.18/0.44  % SZS status Theorem
% 0.18/0.44  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.18/0.44  SPASS derived 13 clauses, backtracked 0 clauses, performed 0 splits and kept 53 clauses.
% 0.18/0.44  SPASS allocated 97760 KBytes.
% 0.18/0.44  SPASS spent	0:00:00.09 on the problem.
% 0.18/0.44  		0:00:00.04 for the input.
% 0.18/0.44  		0:00:00.03 for the FLOTTER CNF translation.
% 0.18/0.44  		0:00:00.00 for inferences.
% 0.18/0.44  		0:00:00.00 for the backtracking.
% 0.18/0.44  		0:00:00.00 for the reduction.
% 0.18/0.44  
% 0.18/0.44  
% 0.18/0.44  Here is a proof with depth 2, length 7 :
% 0.18/0.44  % SZS output start Refutation
% See solution above
% 0.18/0.44  Formulae used in the proof : m__747 mIntNeg m__767 m__
% 0.18/0.44  
%------------------------------------------------------------------------------