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

% Computer : n032.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:46 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(2,axiom,
    r1(skc6),
    file('NUN073+2.p',unknown),
    [] ).

cnf(3,axiom,
    r2(skc8,skc7),
    file('NUN073+2.p',unknown),
    [] ).

cnf(4,axiom,
    r2(skc6,skc5),
    file('NUN073+2.p',unknown),
    [] ).

cnf(5,axiom,
    r2(skc7,skc5),
    file('NUN073+2.p',unknown),
    [] ).

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

cnf(35,axiom,
    ( ~ r2(u,v)
    | ~ r2(w,v)
    | equal(w,u) ),
    file('NUN073+2.p',unknown),
    [] ).

cnf(39,plain,
    ~ r2(u,skc6),
    inference(res,[status(thm),theory(equality)],[2,20]),
    [iquote('0:Res:2.0,20.0')] ).

cnf(42,plain,
    ( ~ r2(u,skc5)
    | equal(skc7,u) ),
    inference(res,[status(thm),theory(equality)],[5,35]),
    [iquote('0:Res:5.0,35.0')] ).

cnf(56,plain,
    equal(skc7,skc6),
    inference(res,[status(thm),theory(equality)],[4,42]),
    [iquote('0:Res:4.0,42.0')] ).

cnf(60,plain,
    r2(skc8,skc6),
    inference(rew,[status(thm),theory(equality)],[56,3]),
    [iquote('0:Rew:56.0,3.0')] ).

cnf(65,plain,
    $false,
    inference(mrr,[status(thm)],[60,39]),
    [iquote('0:MRR:60.0,39.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09  % Problem  : NUN073+2 : TPTP v8.1.0. Released v7.3.0.
% 0.02/0.09  % Command  : run_spass %d %s
% 0.09/0.28  % Computer : n032.cluster.edu
% 0.09/0.28  % Model    : x86_64 x86_64
% 0.09/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28  % Memory   : 8042.1875MB
% 0.09/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28  % CPULimit : 300
% 0.09/0.28  % WCLimit  : 600
% 0.09/0.28  % DateTime : Thu Jun  2 06:32:30 EDT 2022
% 0.09/0.28  % CPUTime  : 
% 0.13/0.36  
% 0.13/0.36  SPASS V 3.9 
% 0.13/0.36  SPASS beiseite: Proof found.
% 0.13/0.36  % SZS status Theorem
% 0.13/0.36  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.13/0.36  SPASS derived 27 clauses, backtracked 0 clauses, performed 0 splits and kept 51 clauses.
% 0.13/0.36  SPASS allocated 97688 KBytes.
% 0.13/0.36  SPASS spent	0:00:00.07 on the problem.
% 0.13/0.36  		0:00:00.03 for the input.
% 0.13/0.36  		0:00:00.02 for the FLOTTER CNF translation.
% 0.13/0.36  		0:00:00.00 for inferences.
% 0.13/0.36  		0:00:00.00 for the backtracking.
% 0.13/0.36  		0:00:00.00 for the reduction.
% 0.13/0.36  
% 0.13/0.36  
% 0.13/0.36  Here is a proof with depth 2, length 11 :
% 0.13/0.36  % SZS output start Refutation
% See solution above
% 0.13/0.36  Formulae used in the proof : oneuneqtwo axiom_7a axiom_3a
% 0.13/0.36  
%------------------------------------------------------------------------------