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

% Computer : n011.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:11 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    aSet0(slcrc0),
    file('NUM531+2.p',unknown),
    [] ).

cnf(2,axiom,
    isCountable0(slcrc0),
    file('NUM531+2.p',unknown),
    [] ).

cnf(3,axiom,
    isFinite0(slcrc0),
    file('NUM531+2.p',unknown),
    [] ).

cnf(8,axiom,
    ( ~ isFinite0(u)
    | ~ isCountable0(u)
    | ~ aSet0(u) ),
    file('NUM531+2.p',unknown),
    [] ).

cnf(10,plain,
    ( ~ aSet0(slcrc0)
    | ~ isFinite0(slcrc0) ),
    inference(res,[status(thm),theory(equality)],[2,8]),
    [iquote('0:Res:2.0,8.1')] ).

cnf(15,plain,
    $false,
    inference(mrr,[status(thm)],[10,1,3]),
    [iquote('0:MRR:10.0,10.1,1.0,3.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14  % Problem  : NUM531+2 : TPTP v8.1.0. Released v4.0.0.
% 0.09/0.15  % Command  : run_spass %d %s
% 0.15/0.37  % Computer : n011.cluster.edu
% 0.15/0.37  % Model    : x86_64 x86_64
% 0.15/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37  % Memory   : 8042.1875MB
% 0.15/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37  % CPULimit : 300
% 0.15/0.37  % WCLimit  : 600
% 0.15/0.37  % DateTime : Thu Jul  7 04:11:53 EDT 2022
% 0.15/0.37  % CPUTime  : 
% 0.22/0.46  
% 0.22/0.46  SPASS V 3.9 
% 0.22/0.46  SPASS beiseite: Proof found.
% 0.22/0.46  % SZS status Theorem
% 0.22/0.46  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.22/0.46  SPASS derived 5 clauses, backtracked 0 clauses, performed 0 splits and kept 10 clauses.
% 0.22/0.46  SPASS allocated 97569 KBytes.
% 0.22/0.46  SPASS spent	0:00:00.08 on the problem.
% 0.22/0.46  		0:00:00.03 for the input.
% 0.22/0.46  		0:00:00.03 for the FLOTTER CNF translation.
% 0.22/0.46  		0:00:00.00 for inferences.
% 0.22/0.46  		0:00:00.00 for the backtracking.
% 0.22/0.46  		0:00:00.00 for the reduction.
% 0.22/0.46  
% 0.22/0.46  
% 0.22/0.46  Here is a proof with depth 1, length 6 :
% 0.22/0.46  % SZS output start Refutation
% See solution above
% 0.22/0.46  Formulae used in the proof : m__ mEmpFin mCountNFin
% 0.22/0.46  
%------------------------------------------------------------------------------