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

% Computer : n005.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:34 EDT 2022

% Result   : Theorem 0.68s 0.90s
% Output   : Refutation 0.68s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   11 (   8 unt;   0 nHn;  11 RR)
%            Number of literals    :   16 (   0 equ;   7 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    :    8 (   8 usr;   6 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    aSet0(skc1),
    file('NUM565+3.p',unknown),
    [] ).

cnf(16,axiom,
    equal(sz00,xK),
    file('NUM565+3.p',unknown),
    [] ).

cnf(18,axiom,
    equal(sbrdtbr0(skc1),sz00),
    file('NUM565+3.p',unknown),
    [] ).

cnf(45,axiom,
    ~ equal(sdtlpdtrp0(xc,slcrc0),sdtlpdtrp0(xc,skc1)),
    file('NUM565+3.p',unknown),
    [] ).

cnf(70,axiom,
    ( ~ aSet0(u)
    | ~ equal(sbrdtbr0(u),sz00)
    | equal(u,slcrc0) ),
    file('NUM565+3.p',unknown),
    [] ).

cnf(204,plain,
    equal(sbrdtbr0(skc1),xK),
    inference(rew,[status(thm),theory(equality)],[16,18]),
    [iquote('0:Rew:16.0,18.0')] ).

cnf(215,plain,
    ( ~ aSet0(u)
    | ~ equal(sbrdtbr0(u),xK)
    | equal(u,slcrc0) ),
    inference(rew,[status(thm),theory(equality)],[16,70]),
    [iquote('0:Rew:16.0,70.1')] ).

cnf(318,plain,
    ( ~ aSet0(skc1)
    | equal(slcrc0,skc1) ),
    inference(res,[status(thm),theory(equality)],[204,215]),
    [iquote('0:Res:204.0,215.1')] ).

cnf(383,plain,
    equal(slcrc0,skc1),
    inference(mrr,[status(thm)],[318,1]),
    [iquote('0:MRR:318.0,1.0')] ).

cnf(398,plain,
    ~ equal(sdtlpdtrp0(xc,skc1),sdtlpdtrp0(xc,skc1)),
    inference(rew,[status(thm),theory(equality)],[383,45]),
    [iquote('0:Rew:383.0,45.0')] ).

cnf(409,plain,
    $false,
    inference(obv,[status(thm),theory(equality)],[398]),
    [iquote('0:Obv:398.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : NUM565+3 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n005.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 : Fri Jul  8 02:16:37 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.68/0.90  
% 0.68/0.90  SPASS V 3.9 
% 0.68/0.90  SPASS beiseite: Proof found.
% 0.68/0.90  % SZS status Theorem
% 0.68/0.90  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.68/0.90  SPASS derived 157 clauses, backtracked 0 clauses, performed 0 splits and kept 222 clauses.
% 0.68/0.90  SPASS allocated 102343 KBytes.
% 0.68/0.90  SPASS spent	0:00:00.54 on the problem.
% 0.68/0.90  		0:00:00.04 for the input.
% 0.68/0.90  		0:00:00.45 for the FLOTTER CNF translation.
% 0.68/0.90  		0:00:00.00 for inferences.
% 0.68/0.90  		0:00:00.00 for the backtracking.
% 0.68/0.90  		0:00:00.02 for the reduction.
% 0.68/0.90  
% 0.68/0.90  
% 0.68/0.90  Here is a proof with depth 1, length 11 :
% 0.68/0.90  % SZS output start Refutation
% See solution above
% 0.68/0.90  Formulae used in the proof : m__ m__3462 mCardEmpty
% 0.68/0.90  
%------------------------------------------------------------------------------