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

% Computer : n007.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:27:24 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(8,axiom,
    equal(slcrc0,xQ),
    file('NUM550+1.p',unknown),
    [] ).

cnf(15,axiom,
    ~ equal(xk,sz00),
    file('NUM550+1.p',unknown),
    [] ).

cnf(16,axiom,
    equal(sbrdtbr0(xQ),xk),
    file('NUM550+1.p',unknown),
    [] ).

cnf(18,axiom,
    ( ~ equal(u,slcrc0)
    | aSet0(u) ),
    file('NUM550+1.p',unknown),
    [] ).

cnf(49,axiom,
    ( ~ aSet0(u)
    | ~ equal(u,slcrc0)
    | equal(sbrdtbr0(u),sz00) ),
    file('NUM550+1.p',unknown),
    [] ).

cnf(122,plain,
    ( ~ equal(u,xQ)
    | aSet0(u) ),
    inference(rew,[status(thm),theory(equality)],[8,18]),
    [iquote('0:Rew:8.0,18.0')] ).

cnf(125,plain,
    ( ~ aSet0(u)
    | ~ equal(u,xQ)
    | equal(sbrdtbr0(u),sz00) ),
    inference(rew,[status(thm),theory(equality)],[8,49]),
    [iquote('0:Rew:8.0,49.1')] ).

cnf(126,plain,
    ( ~ equal(u,xQ)
    | equal(sbrdtbr0(u),sz00) ),
    inference(mrr,[status(thm)],[125,122]),
    [iquote('0:MRR:125.0,122.1')] ).

cnf(147,plain,
    equal(sbrdtbr0(slcrc0),sz00),
    inference(res,[status(thm),theory(equality)],[8,126]),
    [iquote('0:Res:8.0,126.0')] ).

cnf(264,plain,
    equal(xk,sz00),
    inference(rew,[status(thm),theory(equality)],[16,147,8]),
    [iquote('0:Rew:16.0,147.0,8.0,147.0')] ).

cnf(265,plain,
    $false,
    inference(mrr,[status(thm)],[264,15]),
    [iquote('0:MRR:264.0,15.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : NUM550+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.14  % Command  : run_spass %d %s
% 0.14/0.36  % Computer : n007.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 600
% 0.14/0.36  % DateTime : Tue Jul  5 19:26:58 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 0.37/0.57  
% 0.37/0.57  SPASS V 3.9 
% 0.37/0.57  SPASS beiseite: Proof found.
% 0.37/0.57  % SZS status Theorem
% 0.37/0.57  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.37/0.57  SPASS derived 84 clauses, backtracked 0 clauses, performed 0 splits and kept 117 clauses.
% 0.37/0.57  SPASS allocated 99340 KBytes.
% 0.37/0.57  SPASS spent	0:00:00.20 on the problem.
% 0.37/0.57  		0:00:00.04 for the input.
% 0.37/0.57  		0:00:00.12 for the FLOTTER CNF translation.
% 0.37/0.57  		0:00:00.00 for inferences.
% 0.37/0.57  		0:00:00.00 for the backtracking.
% 0.37/0.57  		0:00:00.02 for the reduction.
% 0.37/0.57  
% 0.37/0.57  
% 0.37/0.57  Here is a proof with depth 1, length 11 :
% 0.37/0.57  % SZS output start Refutation
% See solution above
% 0.37/0.57  Formulae used in the proof : m__ m__2202_02 m__2291 mDefEmp mCardEmpty
% 0.37/0.57  
%------------------------------------------------------------------------------