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

% Computer : n015.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 : Thu Jul 21 12:32:31 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    r(u,zero,succ(u)),
    file('SYN986+1.001.p',unknown),
    [] ).

cnf(2,axiom,
    ( ~ r(zero,u,v)
    | ~ r(zero,zero,u) ),
    file('SYN986+1.001.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ r(u,v,w)
    | ~ r(x,v,u)
    | r(x,succ(v),w) ),
    file('SYN986+1.001.p',unknown),
    [] ).

cnf(5,plain,
    ~ r(zero,succ(zero),u),
    inference(res,[status(thm),theory(equality)],[1,2]),
    [iquote('0:Res:1.0,2.1')] ).

cnf(7,plain,
    ( ~ r(u,zero,v)
    | r(u,succ(zero),succ(v)) ),
    inference(res,[status(thm),theory(equality)],[1,3]),
    [iquote('0:Res:1.0,3.0')] ).

cnf(8,plain,
    ~ r(zero,zero,u),
    inference(res,[status(thm),theory(equality)],[7,5]),
    [iquote('0:Res:7.1,5.0')] ).

cnf(11,plain,
    $false,
    inference(unc,[status(thm)],[8,1]),
    [iquote('0:UnC:8.0,1.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN986+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n015.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 : Mon Jul 11 23:32:24 EDT 2022
% 0.13/0.34  % 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/sandbox2/benchmark/theBenchmark.p 
% 0.19/0.43  SPASS derived 7 clauses, backtracked 0 clauses, performed 0 splits and kept 9 clauses.
% 0.19/0.43  SPASS allocated 85060 KBytes.
% 0.19/0.43  SPASS spent	0:00:00.08 on the problem.
% 0.19/0.43  		0:00:00.03 for the input.
% 0.19/0.43  		0:00:00.02 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 2, length 7 :
% 0.19/0.43  % SZS output start Refutation
% See solution above
% 0.19/0.43  Formulae used in the proof : hyp1 ck hyp2
% 0.19/0.43  
%------------------------------------------------------------------------------