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

% Computer : n006.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:19:18 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ~ r1(a),
    file('SYN186-1.p',unknown),
    [] ).

cnf(2,axiom,
    s0(d),
    file('SYN186-1.p',unknown),
    [] ).

cnf(18,axiom,
    q0(u,d),
    file('SYN186-1.p',unknown),
    [] ).

cnf(29,axiom,
    k0(e),
    file('SYN186-1.p',unknown),
    [] ).

cnf(156,axiom,
    ( ~ k0(e)
    | ~ s0(d)
    | q1(d,d,d) ),
    file('SYN186-1.p',unknown),
    [] ).

cnf(163,axiom,
    ( ~ q0(u,v)
    | ~ s0(d)
    | ~ q1(d,v,d)
    | r1(u) ),
    file('SYN186-1.p',unknown),
    [] ).

cnf(380,plain,
    q1(d,d,d),
    inference(mrr,[status(thm)],[156,29,2]),
    [iquote('0:MRR:156.0,156.1,29.0,2.0')] ).

cnf(401,plain,
    ( ~ q0(u,v)
    | ~ q1(d,v,d)
    | r1(u) ),
    inference(mrr,[status(thm)],[163,2]),
    [iquote('0:MRR:163.1,2.0')] ).

cnf(419,plain,
    ( ~ q0(a,u)
    | ~ q1(d,u,d) ),
    inference(res,[status(thm),theory(equality)],[401,1]),
    [iquote('0:Res:401.2,1.0')] ).

cnf(586,plain,
    ~ q0(a,d),
    inference(res,[status(thm),theory(equality)],[380,419]),
    [iquote('0:Res:380.0,419.1')] ).

cnf(590,plain,
    $false,
    inference(mrr,[status(thm)],[586,18]),
    [iquote('0:MRR:586.0,18.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYN186-1 : TPTP v8.1.0. Released v1.1.0.
% 0.03/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n006.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 : Tue Jul 12 02:35:05 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.48  
% 0.19/0.48  SPASS V 3.9 
% 0.19/0.48  SPASS beiseite: Proof found.
% 0.19/0.48  % SZS status Theorem
% 0.19/0.48  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.19/0.48  SPASS derived 136 clauses, backtracked 0 clauses, performed 0 splits and kept 418 clauses.
% 0.19/0.48  SPASS allocated 76157 KBytes.
% 0.19/0.48  SPASS spent	0:00:00.13 on the problem.
% 0.19/0.48  		0:00:00.05 for the input.
% 0.19/0.48  		0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.48  		0:00:00.00 for inferences.
% 0.19/0.48  		0:00:00.00 for the backtracking.
% 0.19/0.48  		0:00:00.04 for the reduction.
% 0.19/0.48  
% 0.19/0.48  
% 0.19/0.48  Here is a proof with depth 2, length 11 :
% 0.19/0.48  % SZS output start Refutation
% See solution above
% 0.19/0.48  Formulae used in the proof : prove_this axiom_1 axiom_17 axiom_28 rule_117 rule_124
% 0.19/0.48  
%------------------------------------------------------------------------------