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

% Computer : n017.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 20:41:21 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(15,axiom,
    aScalar0(xR),
    file('RNG059+2.p',unknown),
    [] ).

cnf(17,axiom,
    aScalar0(xS),
    file('RNG059+2.p',unknown),
    [] ).

cnf(34,axiom,
    equal(sdtasdt0(xR,xS),xN),
    file('RNG059+2.p',unknown),
    [] ).

cnf(47,axiom,
    ~ equal(sdtasdt0(smndt0(xS),xR),smndt0(xN)),
    file('RNG059+2.p',unknown),
    [] ).

cnf(66,axiom,
    ( ~ aScalar0(u)
    | ~ aScalar0(v)
    | equal(sdtasdt0(v,u),sdtasdt0(u,v)) ),
    file('RNG059+2.p',unknown),
    [] ).

cnf(70,axiom,
    ( ~ aScalar0(u)
    | ~ aScalar0(v)
    | equal(sdtasdt0(smndt0(v),u),smndt0(sdtasdt0(v,u))) ),
    file('RNG059+2.p',unknown),
    [] ).

cnf(312,plain,
    ( ~ aScalar0(xR)
    | ~ aScalar0(xS)
    | ~ equal(smndt0(sdtasdt0(xS,xR)),smndt0(xN)) ),
    inference(spl,[status(thm),theory(equality)],[70,47]),
    [iquote('0:SpL:70.2,47.0')] ).

cnf(314,plain,
    ( ~ aScalar0(xR)
    | ~ aScalar0(xS)
    | ~ equal(smndt0(xN),smndt0(xN)) ),
    inference(rew,[status(thm),theory(equality)],[34,312,66]),
    [iquote('0:Rew:34.0,312.2,66.2,312.2')] ).

cnf(315,plain,
    ( ~ aScalar0(xR)
    | ~ aScalar0(xS) ),
    inference(obv,[status(thm),theory(equality)],[314]),
    [iquote('0:Obv:314.2')] ).

cnf(316,plain,
    $false,
    inference(ssi,[status(thm)],[315,17,15]),
    [iquote('0:SSi:315.1,315.0,17.0,15.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : RNG059+2 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n017.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Mon May 30 12:14:25 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.47  
% 0.19/0.47  SPASS V 3.9 
% 0.19/0.47  SPASS beiseite: Proof found.
% 0.19/0.47  % SZS status Theorem
% 0.19/0.47  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.19/0.47  SPASS derived 154 clauses, backtracked 0 clauses, performed 0 splits and kept 115 clauses.
% 0.19/0.47  SPASS allocated 97899 KBytes.
% 0.19/0.47  SPASS spent	0:00:00.11 on the problem.
% 0.19/0.47  		0:00:00.04 for the input.
% 0.19/0.47  		0:00:00.04 for the FLOTTER CNF translation.
% 0.19/0.47  		0:00:00.00 for inferences.
% 0.19/0.47  		0:00:00.00 for the backtracking.
% 0.19/0.47  		0:00:00.01 for the reduction.
% 0.19/0.47  
% 0.19/0.47  
% 0.19/0.47  Here is a proof with depth 1, length 10 :
% 0.19/0.47  % SZS output start Refutation
% See solution above
% 0.19/0.47  Formulae used in the proof : m__1892 m__1930 m__1949 m__ mArith mMNeg
% 0.19/0.47  
%------------------------------------------------------------------------------