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

% Computer : n005.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:20:01 EDT 2022

% Result   : Unsatisfiable 0.18s 0.45s
% Output   : Refutation 0.18s
% 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    :   18 (   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    :    7 (   7 usr;   7 con; 0-0 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ~ q1(d,d,a),
    file('SYN293-1.p',unknown),
    [] ).

cnf(15,axiom,
    p0(b,u),
    file('SYN293-1.p',unknown),
    [] ).

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

cnf(35,axiom,
    n0(c,d),
    file('SYN293-1.p',unknown),
    [] ).

cnf(40,axiom,
    ( ~ n0(u,v)
    | k1(v) ),
    file('SYN293-1.p',unknown),
    [] ).

cnf(148,axiom,
    ( ~ k1(u)
    | ~ p0(v,v)
    | ~ q0(w,u)
    | q1(u,u,w) ),
    file('SYN293-1.p',unknown),
    [] ).

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

cnf(423,plain,
    ( ~ k1(d)
    | ~ p0(u,u) ),
    inference(mrr,[status(thm)],[419,18]),
    [iquote('0:MRR:419.1,18.0')] ).

cnf(461,plain,
    k1(d),
    inference(res,[status(thm),theory(equality)],[35,40]),
    [iquote('0:Res:35.0,40.0')] ).

cnf(469,plain,
    ~ p0(u,u),
    inference(mrr,[status(thm)],[423,461]),
    [iquote('0:MRR:423.0,461.0')] ).

cnf(476,plain,
    $false,
    inference(unc,[status(thm)],[469,15]),
    [iquote('0:UnC:469.0,15.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : SYN293-1 : TPTP v8.1.0. Released v1.1.0.
% 0.06/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n005.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 : Mon Jul 11 22:52:37 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.45  
% 0.18/0.45  SPASS V 3.9 
% 0.18/0.45  SPASS beiseite: Proof found.
% 0.18/0.45  % SZS status Theorem
% 0.18/0.45  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.18/0.45  SPASS derived 22 clauses, backtracked 0 clauses, performed 0 splits and kept 352 clauses.
% 0.18/0.45  SPASS allocated 76108 KBytes.
% 0.18/0.45  SPASS spent	0:00:00.11 on the problem.
% 0.18/0.45  		0:00:00.04 for the input.
% 0.18/0.45  		0:00:00.00 for the FLOTTER CNF translation.
% 0.18/0.45  		0:00:00.00 for inferences.
% 0.18/0.45  		0:00:00.00 for the backtracking.
% 0.18/0.45  		0:00:00.03 for the reduction.
% 0.18/0.45  
% 0.18/0.45  
% 0.18/0.45  Here is a proof with depth 1, length 11 :
% 0.18/0.45  % SZS output start Refutation
% See solution above
% 0.18/0.45  Formulae used in the proof : prove_this axiom_14 axiom_17 axiom_34 rule_001 rule_109
% 0.18/0.45  
%------------------------------------------------------------------------------