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

% Computer : n024.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.19s 0.45s
% 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    :   10 (   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,
    id__dfg(u,u),
    file('NUN069+1.p',unknown),
    [] ).

cnf(2,axiom,
    r1(skf31(u)),
    file('NUN069+1.p',unknown),
    [] ).

cnf(8,axiom,
    r2(u,skf28(v,u)),
    file('NUN069+1.p',unknown),
    [] ).

cnf(42,axiom,
    ( ~ r1(u)
    | ~ id__dfg(v,v)
    | ~ r2(u,v) ),
    file('NUN069+1.p',unknown),
    [] ).

cnf(60,plain,
    ( ~ r1(u)
    | ~ r2(u,v) ),
    inference(mrr,[status(thm)],[42,1]),
    [iquote('0:MRR:42.1,1.0')] ).

cnf(65,plain,
    ~ r1(u),
    inference(res,[status(thm),theory(equality)],[8,60]),
    [iquote('0:Res:8.0,60.1')] ).

cnf(68,plain,
    $false,
    inference(unc,[status(thm)],[65,2]),
    [iquote('0:UnC:65.0,2.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : NUN069+1 : TPTP v8.1.0. Released v7.3.0.
% 0.06/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n024.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 10:44:06 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.45  
% 0.19/0.45  SPASS V 3.9 
% 0.19/0.45  SPASS beiseite: Proof found.
% 0.19/0.45  % SZS status Theorem
% 0.19/0.45  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.19/0.45  SPASS derived 7 clauses, backtracked 0 clauses, performed 0 splits and kept 59 clauses.
% 0.19/0.45  SPASS allocated 97818 KBytes.
% 0.19/0.45  SPASS spent	0:00:00.10 on the problem.
% 0.19/0.45  		0:00:00.04 for the input.
% 0.19/0.45  		0:00:00.04 for the FLOTTER CNF translation.
% 0.19/0.45  		0:00:00.00 for inferences.
% 0.19/0.45  		0:00:00.00 for the backtracking.
% 0.19/0.45  		0:00:00.00 for the reduction.
% 0.19/0.45  
% 0.19/0.45  
% 0.19/0.45  Here is a proof with depth 1, length 7 :
% 0.19/0.45  % SZS output start Refutation
% See solution above
% 0.19/0.45  Formulae used in the proof : axiom_5 axiom_4a axiom_2a oneidone
% 0.19/0.45  
%------------------------------------------------------------------------------