%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : NUN062+2 : TPTP v8.1.0. Released v7.3.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 16:38:43 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(9,axiom,
    r3(u,v,skf18(v,u)),
    file('NUN062+2.p',unknown),
    [] ).

cnf(13,axiom,
    ( ~ r3(skc2,u,v)
    | r1(u) ),
    file('NUN062+2.p',unknown),
    [] ).

cnf(15,axiom,
    r2(skf18(u,v),skf16(v,u)),
    file('NUN062+2.p',unknown),
    [] ).

cnf(16,axiom,
    ( ~ r1(u)
    | ~ r2(v,u) ),
    file('NUN062+2.p',unknown),
    [] ).

cnf(35,plain,
    r1(u),
    inference(res,[status(thm),theory(equality)],[9,13]),
    [iquote('0:Res:9.0,13.0')] ).

cnf(37,plain,
    ~ r2(u,v),
    inference(mrr,[status(thm)],[16,35]),
    [iquote('0:MRR:16.0,35.0')] ).

cnf(39,plain,
    $false,
    inference(unc,[status(thm)],[37,15]),
    [iquote('0:UnC:37.0,15.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : NUN062+2 : TPTP v8.1.0. Released v7.3.0.
% 0.03/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n025.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 Jun  2 02:49:44 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.43  
% 0.19/0.43  SPASS V 3.9 
% 0.19/0.43  SPASS beiseite: Proof found.
% 0.19/0.43  % SZS status Theorem
% 0.19/0.43  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.19/0.43  SPASS derived 5 clauses, backtracked 0 clauses, performed 0 splits and kept 35 clauses.
% 0.19/0.43  SPASS allocated 97660 KBytes.
% 0.19/0.43  SPASS spent	0:00:00.08 on the problem.
% 0.19/0.43  		0:00:00.04 for the input.
% 0.19/0.43  		0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.43  		0:00:00.00 for inferences.
% 0.19/0.43  		0:00:00.00 for the backtracking.
% 0.19/0.43  		0:00:00.00 for the reduction.
% 0.19/0.43  
% 0.19/0.43  
% 0.19/0.43  Here is a proof with depth 1, length 7 :
% 0.19/0.43  % SZS output start Refutation
% See solution above
% 0.19/0.43  Formulae used in the proof : axiom_1a infiniteNumbers axiom_7a
% 0.19/0.43  
%------------------------------------------------------------------------------