%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : NUN069+2 : TPTP v8.1.0. Released v7.3.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n028.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:45 EDT 2022

% Result   : Theorem 0.20s 0.44s
% Output   : Refutation 0.20s
% 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    :    9 (   0 equ;   6 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    r1(skf22(u)),
    file('NUN069+2.p',unknown),
    [] ).

cnf(6,axiom,
    r2(u,skf20(v,u)),
    file('NUN069+2.p',unknown),
    [] ).

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

cnf(34,plain,
    ( ~ r1(u)
    | ~ r2(u,v) ),
    inference(obv,[status(thm),theory(equality)],[26]),
    [iquote('0:Obv:26.1')] ).

cnf(38,plain,
    ~ r1(u),
    inference(res,[status(thm),theory(equality)],[6,34]),
    [iquote('0:Res:6.0,34.1')] ).

cnf(41,plain,
    $false,
    inference(unc,[status(thm)],[38,1]),
    [iquote('0:UnC:38.0,1.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : NUN069+2 : TPTP v8.1.0. Released v7.3.0.
% 0.12/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n028.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 : Thu Jun  2 05:00:53 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.44  
% 0.20/0.44  SPASS V 3.9 
% 0.20/0.44  SPASS beiseite: Proof found.
% 0.20/0.44  % SZS status Theorem
% 0.20/0.44  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.20/0.44  SPASS derived 6 clauses, backtracked 0 clauses, performed 0 splits and kept 34 clauses.
% 0.20/0.44  SPASS allocated 97685 KBytes.
% 0.20/0.44  SPASS spent	0:00:00.09 on the problem.
% 0.20/0.44  		0:00:00.03 for the input.
% 0.20/0.44  		0:00:00.03 for the FLOTTER CNF translation.
% 0.20/0.44  		0:00:00.00 for inferences.
% 0.20/0.44  		0:00:00.00 for the backtracking.
% 0.20/0.44  		0:00:00.00 for the reduction.
% 0.20/0.44  
% 0.20/0.44  
% 0.20/0.44  Here is a proof with depth 1, length 6 :
% 0.20/0.44  % SZS output start Refutation
% See solution above
% 0.20/0.44  Formulae used in the proof : axiom_4a axiom_2a oneeqone
% 0.20/0.44  
%------------------------------------------------------------------------------