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

% Computer : n025.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:22 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(5,axiom,
    aSet0(xT),
    file('NUM547+1.p',unknown),
    [] ).

cnf(7,axiom,
    aElementOf0(xk,szNzAzT0),
    file('NUM547+1.p',unknown),
    [] ).

cnf(13,axiom,
    ~ aElementOf0(u,slbdtsldtrb0(xS,xk)),
    file('NUM547+1.p',unknown),
    [] ).

cnf(18,axiom,
    ~ equal(slbdtsldtrb0(xS,xk),slcrc0),
    file('NUM547+1.p',unknown),
    [] ).

cnf(24,axiom,
    aSubsetOf0(slbdtsldtrb0(xS,xk),slbdtsldtrb0(xT,xk)),
    file('NUM547+1.p',unknown),
    [] ).

cnf(32,axiom,
    ( ~ aSet0(u)
    | ~ aSubsetOf0(v,u)
    | aSet0(v) ),
    file('NUM547+1.p',unknown),
    [] ).

cnf(38,axiom,
    ( ~ aSet0(u)
    | equal(u,slcrc0)
    | aElementOf0(skf11(u),u) ),
    file('NUM547+1.p',unknown),
    [] ).

cnf(65,axiom,
    ( ~ aSet0(u)
    | ~ aElementOf0(v,szNzAzT0)
    | ~ equal(w,slbdtsldtrb0(u,v))
    | aSet0(w) ),
    file('NUM547+1.p',unknown),
    [] ).

cnf(131,plain,
    ( ~ aSet0(slbdtsldtrb0(xS,xk))
    | equal(slbdtsldtrb0(xS,xk),slcrc0) ),
    inference(res,[status(thm),theory(equality)],[38,13]),
    [iquote('0:Res:38.1,13.0')] ).

cnf(144,plain,
    ~ aSet0(slbdtsldtrb0(xS,xk)),
    inference(mrr,[status(thm)],[131,18]),
    [iquote('0:MRR:131.1,18.0')] ).

cnf(188,plain,
    ( ~ aSet0(slbdtsldtrb0(xT,xk))
    | aSet0(slbdtsldtrb0(xS,xk)) ),
    inference(res,[status(thm),theory(equality)],[24,32]),
    [iquote('0:Res:24.0,32.1')] ).

cnf(189,plain,
    ~ aSet0(slbdtsldtrb0(xT,xk)),
    inference(mrr,[status(thm)],[188,144]),
    [iquote('0:MRR:188.1,144.0')] ).

cnf(865,plain,
    ( ~ aSet0(u)
    | ~ aElementOf0(v,szNzAzT0)
    | aSet0(slbdtsldtrb0(u,v)) ),
    inference(eqr,[status(thm),theory(equality)],[65]),
    [iquote('0:EqR:65.2')] ).

cnf(921,plain,
    ( ~ aSet0(xT)
    | ~ aElementOf0(xk,szNzAzT0) ),
    inference(sor,[status(thm)],[189,865]),
    [iquote('0:SoR:189.0,865.2')] ).

cnf(924,plain,
    ~ aElementOf0(xk,szNzAzT0),
    inference(ssi,[status(thm)],[921,5]),
    [iquote('0:SSi:921.0,5.0')] ).

cnf(925,plain,
    $false,
    inference(mrr,[status(thm)],[924,7]),
    [iquote('0:MRR:924.0,7.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : NUM547+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12  % Command  : run_spass %d %s
% 0.13/0.33  % Computer : n025.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 20:00:29 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.43/0.59  
% 0.43/0.59  SPASS V 3.9 
% 0.43/0.59  SPASS beiseite: Proof found.
% 0.43/0.59  % SZS status Theorem
% 0.43/0.59  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.43/0.59  SPASS derived 576 clauses, backtracked 44 clauses, performed 5 splits and kept 377 clauses.
% 0.43/0.59  SPASS allocated 99356 KBytes.
% 0.43/0.59  SPASS spent	0:00:00.24 on the problem.
% 0.43/0.59  		0:00:00.04 for the input.
% 0.43/0.59  		0:00:00.11 for the FLOTTER CNF translation.
% 0.43/0.59  		0:00:00.01 for inferences.
% 0.43/0.59  		0:00:00.00 for the backtracking.
% 0.43/0.59  		0:00:00.05 for the reduction.
% 0.43/0.59  
% 0.43/0.59  
% 0.43/0.59  Here is a proof with depth 2, length 16 :
% 0.43/0.59  % SZS output start Refutation
% See solution above
% 0.43/0.59  Formulae used in the proof : m__2202_02 m__2202 m__ m__2227 mDefSub mDefEmp mDefSel
% 0.43/0.59  
%------------------------------------------------------------------------------