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

% Computer : n024.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 : Sun Jul 17 03:30:27 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(2,axiom,
    cUnsatisfiable(i2003_11_14_17_18_32242),
    file('KRS070+1.p',unknown),
    [] ).

cnf(5,axiom,
    cc1(skf4(u)),
    file('KRS070+1.p',unknown),
    [] ).

cnf(6,axiom,
    cc2(skf3(u)),
    file('KRS070+1.p',unknown),
    [] ).

cnf(9,axiom,
    ( ~ cUnsatisfiable(u)
    | rrx4(u,skf3(u)) ),
    file('KRS070+1.p',unknown),
    [] ).

cnf(10,axiom,
    ( ~ cUnsatisfiable(u)
    | rrx3(u,skf4(u)) ),
    file('KRS070+1.p',unknown),
    [] ).

cnf(11,axiom,
    ( ~ rrx3(u,v)
    | rrx(u,v) ),
    file('KRS070+1.p',unknown),
    [] ).

cnf(18,axiom,
    ( ~ rrx4(u,v)
    | rrx(u,v) ),
    file('KRS070+1.p',unknown),
    [] ).

cnf(19,axiom,
    ( ~ rrx(u,v)
    | ~ rrx(u,w)
    | equal(w,v) ),
    file('KRS070+1.p',unknown),
    [] ).

cnf(24,axiom,
    ( ~ cUnsatisfiable(u)
    | ~ cc1(v)
    | ~ cc2(v)
    | ~ rrx3(u,v) ),
    file('KRS070+1.p',unknown),
    [] ).

cnf(27,plain,
    ( ~ rrx3(u,v)
    | ~ rrx(u,w)
    | equal(w,v) ),
    inference(res,[status(thm),theory(equality)],[11,19]),
    [iquote('0:Res:11.1,19.0')] ).

cnf(36,plain,
    ( ~ cUnsatisfiable(u)
    | ~ rrx(u,v)
    | equal(v,skf4(u)) ),
    inference(res,[status(thm),theory(equality)],[10,27]),
    [iquote('0:Res:10.1,27.0')] ).

cnf(38,plain,
    ( ~ cUnsatisfiable(u)
    | ~ rrx4(u,v)
    | equal(v,skf4(u)) ),
    inference(res,[status(thm),theory(equality)],[18,36]),
    [iquote('0:Res:18.1,36.1')] ).

cnf(40,plain,
    ( ~ cUnsatisfiable(u)
    | ~ cUnsatisfiable(u)
    | equal(skf4(u),skf3(u)) ),
    inference(res,[status(thm),theory(equality)],[9,38]),
    [iquote('0:Res:9.1,38.1')] ).

cnf(41,plain,
    ( ~ cUnsatisfiable(u)
    | equal(skf4(u),skf3(u)) ),
    inference(obv,[status(thm),theory(equality)],[40]),
    [iquote('0:Obv:40.0')] ).

cnf(42,plain,
    ( ~ cUnsatisfiable(u)
    | rrx3(u,skf3(u)) ),
    inference(rew,[status(thm),theory(equality)],[41,10]),
    [iquote('0:Rew:41.1,10.1')] ).

cnf(47,plain,
    ( ~ cUnsatisfiable(u)
    | ~ cUnsatisfiable(u)
    | ~ cc1(skf3(u))
    | ~ cc2(skf3(u)) ),
    inference(res,[status(thm),theory(equality)],[42,24]),
    [iquote('0:Res:42.1,24.3')] ).

cnf(49,plain,
    ( ~ cUnsatisfiable(u)
    | ~ cc1(skf3(u))
    | ~ cc2(skf3(u)) ),
    inference(obv,[status(thm),theory(equality)],[47]),
    [iquote('0:Obv:47.0')] ).

cnf(50,plain,
    ( ~ cUnsatisfiable(u)
    | ~ cc1(skf3(u)) ),
    inference(ssi,[status(thm)],[49,6]),
    [iquote('0:SSi:49.2,6.0')] ).

cnf(51,plain,
    ( ~ cUnsatisfiable(u)
    | cc1(skf3(u)) ),
    inference(spr,[status(thm),theory(equality)],[41,5]),
    [iquote('0:SpR:41.1,5.0')] ).

cnf(53,plain,
    ~ cUnsatisfiable(u),
    inference(mrr,[status(thm)],[51,50]),
    [iquote('0:MRR:51.1,50.1')] ).

cnf(54,plain,
    $false,
    inference(unc,[status(thm)],[53,2]),
    [iquote('0:UnC:53.0,2.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : KRS070+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n024.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 Jun  7 10:31:35 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.46  
% 0.19/0.46  SPASS V 3.9 
% 0.19/0.46  SPASS beiseite: Proof found.
% 0.19/0.46  % SZS status Theorem
% 0.19/0.46  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.19/0.46  SPASS derived 21 clauses, backtracked 0 clauses, performed 0 splits and kept 39 clauses.
% 0.19/0.46  SPASS allocated 97805 KBytes.
% 0.19/0.46  SPASS spent	0:00:00.11 on the problem.
% 0.19/0.46  		0:00:00.04 for the input.
% 0.19/0.46  		0:00:00.04 for the FLOTTER CNF translation.
% 0.19/0.46  		0:00:00.00 for inferences.
% 0.19/0.46  		0:00:00.00 for the backtracking.
% 0.19/0.46  		0:00:00.00 for the reduction.
% 0.19/0.46  
% 0.19/0.46  
% 0.19/0.46  Here is a proof with depth 5, length 21 :
% 0.19/0.46  % SZS output start Refutation
% See solution above
% 0.19/0.46  Formulae used in the proof : axiom_8 axiom_2 axiom_9 axiom_16 axiom_3
% 0.19/0.46  
%------------------------------------------------------------------------------