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

% Computer : n016.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:29 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(17,axiom,
    aSubsetOf0(xP,xS),
    file('NUM557+3.p',unknown),
    [] ).

cnf(30,axiom,
    equal(sbrdtbr0(xP),xk),
    file('NUM557+3.p',unknown),
    [] ).

cnf(60,axiom,
    ( ~ aSubsetOf0(xP,xS)
    | ~ equal(sbrdtbr0(xP),xk) ),
    file('NUM557+3.p',unknown),
    [] ).

cnf(168,plain,
    ( ~ aSubsetOf0(xP,xS)
    | ~ equal(xk,xk) ),
    inference(rew,[status(thm),theory(equality)],[30,60]),
    [iquote('0:Rew:30.0,60.1')] ).

cnf(169,plain,
    ~ aSubsetOf0(xP,xS),
    inference(obv,[status(thm),theory(equality)],[168]),
    [iquote('0:Obv:168.1')] ).

cnf(170,plain,
    $false,
    inference(mrr,[status(thm)],[169,17]),
    [iquote('0:MRR:169.0,17.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : NUM557+3 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n016.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Thu Jul  7 07:16:21 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.56  
% 0.19/0.56  SPASS V 3.9 
% 0.19/0.56  SPASS beiseite: Proof found.
% 0.19/0.56  % SZS status Theorem
% 0.19/0.56  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.19/0.56  SPASS derived 0 clauses, backtracked 0 clauses, performed 0 splits and kept 65 clauses.
% 0.19/0.56  SPASS allocated 99897 KBytes.
% 0.19/0.56  SPASS spent	0:00:00.22 on the problem.
% 0.19/0.56  		0:00:00.04 for the input.
% 0.19/0.56  		0:00:00.15 for the FLOTTER CNF translation.
% 0.19/0.56  		0:00:00.00 for inferences.
% 0.19/0.56  		0:00:00.00 for the backtracking.
% 0.19/0.56  		0:00:00.00 for the reduction.
% 0.19/0.56  
% 0.19/0.56  
% 0.19/0.56  Here is a proof with depth 0, length 6 :
% 0.19/0.56  % SZS output start Refutation
% See solution above
% 0.19/0.56  Formulae used in the proof : m__2431 m__
% 0.19/0.56  
%------------------------------------------------------------------------------