%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SYN009-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n007.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:17:13 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ~ p(c,u,v),
    file('SYN009-1.p',unknown),
    [] ).

cnf(2,axiom,
    ~ q(u,c,v),
    file('SYN009-1.p',unknown),
    [] ).

cnf(3,axiom,
    ~ r(u,v,c),
    file('SYN009-1.p',unknown),
    [] ).

cnf(6,axiom,
    s(c),
    file('SYN009-1.p',unknown),
    [] ).

cnf(7,axiom,
    ( ~ s(u)
    | ~ s(v)
    | ~ s(w)
    | r(w,v,u)
    | q(w,v,u)
    | p(w,v,u) ),
    file('SYN009-1.p',unknown),
    [] ).

cnf(11,plain,
    ( ~ s(u)
    | ~ s(v)
    | ~ s(c)
    | r(c,v,u)
    | q(c,v,u) ),
    inference(res,[status(thm),theory(equality)],[7,1]),
    [iquote('0:Res:7.5,1.0')] ).

cnf(12,plain,
    ( ~ s(u)
    | ~ s(v)
    | r(c,v,u)
    | q(c,v,u) ),
    inference(ssi,[status(thm)],[11,6]),
    [iquote('0:SSi:11.2,6.0')] ).

cnf(13,plain,
    ( ~ s(u)
    | ~ s(c)
    | r(c,c,u) ),
    inference(res,[status(thm),theory(equality)],[12,2]),
    [iquote('0:Res:12.3,2.0')] ).

cnf(14,plain,
    ( ~ s(u)
    | r(c,c,u) ),
    inference(ssi,[status(thm)],[13,6]),
    [iquote('0:SSi:13.1,6.0')] ).

cnf(15,plain,
    ~ s(c),
    inference(res,[status(thm),theory(equality)],[14,3]),
    [iquote('0:Res:14.1,3.0')] ).

cnf(16,plain,
    $false,
    inference(ssi,[status(thm)],[15,6]),
    [iquote('0:SSi:15.0,6.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SYN009-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n007.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 : Tue Jul 12 02:16:03 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.40  
% 0.18/0.40  SPASS V 3.9 
% 0.18/0.40  SPASS beiseite: Proof found.
% 0.18/0.40  % SZS status Theorem
% 0.18/0.40  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.18/0.40  SPASS derived 3 clauses, backtracked 0 clauses, performed 0 splits and kept 10 clauses.
% 0.18/0.40  SPASS allocated 75589 KBytes.
% 0.18/0.40  SPASS spent	0:00:00.05 on the problem.
% 0.18/0.40  		0:00:00.03 for the input.
% 0.18/0.40  		0:00:00.00 for the FLOTTER CNF translation.
% 0.18/0.40  		0:00:00.00 for inferences.
% 0.18/0.40  		0:00:00.00 for the backtracking.
% 0.18/0.40  		0:00:00.00 for the reduction.
% 0.18/0.40  
% 0.18/0.40  
% 0.18/0.40  Here is a proof with depth 3, length 11 :
% 0.18/0.40  % SZS output start Refutation
% See solution above
% 0.18/0.40  Formulae used in the proof : clause_1 clause_2 clause_3 clause_6 clause_7
% 0.18/0.40  
%------------------------------------------------------------------------------