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

% Computer : n032.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.57s 0.73s
% Output   : Refutation 0.57s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   13 (   6 unt;   0 nHn;  13 RR)
%            Number of literals    :   29 (   0 equ;  21 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   7 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

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

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

cnf(37,axiom,
    ( ~ aScalar0(u)
    | aScalar0(smndt0(u)) ),
    file('RNG060+1.p',unknown),
    [] ).

cnf(45,axiom,
    equal(sdtasdt0(xR,smndt0(xS)),smndt0(xN)),
    file('RNG060+1.p',unknown),
    [] ).

cnf(57,axiom,
    equal(sdtasdt0(smndt0(xS),smndt0(xS)),sdtasdt0(xS,xS)),
    file('RNG060+1.p',unknown),
    [] ).

cnf(64,axiom,
    ( ~ aScalar0(u)
    | ~ aScalar0(v)
    | equal(sdtasdt0(v,u),sdtasdt0(u,v)) ),
    file('RNG060+1.p',unknown),
    [] ).

cnf(83,axiom,
    ~ equal(sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS))),sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(smndt0(xN),sdtasdt0(xS,xS)))),
    file('RNG060+1.p',unknown),
    [] ).

cnf(90,axiom,
    ( ~ aScalar0(u)
    | ~ aScalar0(v)
    | ~ aScalar0(w)
    | ~ aScalar0(x)
    | equal(sdtasdt0(sdtpldt0(x,w),sdtpldt0(v,u)),sdtpldt0(sdtpldt0(sdtasdt0(x,v),sdtasdt0(x,u)),sdtpldt0(sdtasdt0(w,v),sdtasdt0(w,u)))) ),
    file('RNG060+1.p',unknown),
    [] ).

cnf(2091,plain,
    ( ~ aScalar0(smndt0(xS))
    | ~ aScalar0(xR)
    | ~ aScalar0(smndt0(xS))
    | ~ aScalar0(xR)
    | ~ equal(sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),sdtasdt0(xR,smndt0(xS))),sdtpldt0(sdtasdt0(smndt0(xS),xR),sdtasdt0(smndt0(xS),smndt0(xS)))),sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(smndt0(xN),sdtasdt0(xS,xS)))) ),
    inference(spl,[status(thm),theory(equality)],[90,83]),
    [iquote('0:SpL:90.4,83.0')] ).

cnf(2136,plain,
    ( ~ aScalar0(smndt0(xS))
    | ~ aScalar0(xR)
    | ~ equal(sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),sdtasdt0(xR,smndt0(xS))),sdtpldt0(sdtasdt0(smndt0(xS),xR),sdtasdt0(smndt0(xS),smndt0(xS)))),sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(smndt0(xN),sdtasdt0(xS,xS)))) ),
    inference(obv,[status(thm),theory(equality)],[2091]),
    [iquote('0:Obv:2091.1')] ).

cnf(2137,plain,
    ( ~ aScalar0(smndt0(xS))
    | ~ aScalar0(xR)
    | ~ equal(sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(smndt0(xN),sdtasdt0(xS,xS))),sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(smndt0(xN),sdtasdt0(xS,xS)))) ),
    inference(rew,[status(thm),theory(equality)],[45,2136,64,57]),
    [iquote('0:Rew:45.0,2136.2,64.2,2136.2,57.0,2136.2')] ).

cnf(2138,plain,
    ( ~ aScalar0(smndt0(xS))
    | ~ aScalar0(xR) ),
    inference(obv,[status(thm),theory(equality)],[2137]),
    [iquote('0:Obv:2137.2')] ).

cnf(2139,plain,
    $false,
    inference(ssi,[status(thm)],[2138,15,37,17]),
    [iquote('0:SSi:2138.1,2138.0,15.0,37.1,17.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.09  % Problem  : RNG060+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.09  % Command  : run_spass %d %s
% 0.10/0.28  % Computer : n032.cluster.edu
% 0.10/0.28  % Model    : x86_64 x86_64
% 0.10/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.28  % Memory   : 8042.1875MB
% 0.10/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.28  % CPULimit : 300
% 0.10/0.28  % WCLimit  : 600
% 0.10/0.28  % DateTime : Mon May 30 07:39:42 EDT 2022
% 0.10/0.28  % CPUTime  : 
% 0.57/0.73  
% 0.57/0.73  SPASS V 3.9 
% 0.57/0.73  SPASS beiseite: Proof found.
% 0.57/0.73  % SZS status Theorem
% 0.57/0.73  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.57/0.73  SPASS derived 1097 clauses, backtracked 0 clauses, performed 0 splits and kept 584 clauses.
% 0.57/0.73  SPASS allocated 100341 KBytes.
% 0.57/0.73  SPASS spent	0:00:00.42 on the problem.
% 0.57/0.73  		0:00:00.03 for the input.
% 0.57/0.73  		0:00:00.03 for the FLOTTER CNF translation.
% 0.57/0.73  		0:00:00.02 for inferences.
% 0.57/0.73  		0:00:00.00 for the backtracking.
% 0.57/0.73  		0:00:00.32 for the reduction.
% 0.57/0.73  
% 0.57/0.73  
% 0.57/0.73  Here is a proof with depth 1, length 13 :
% 0.57/0.73  % SZS output start Refutation
% See solution above
% 0.57/0.73  Formulae used in the proof : m__1892 m__1930 mNegSc m__2144 mArith m__ mDistr2
% 0.57/0.73  
%------------------------------------------------------------------------------