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

% Computer : n026.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:28 EDT 2022

% Result   : Unsatisfiable 0.19s 0.46s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   19 (   3 unt;   0 nHn;  19 RR)
%            Number of literals    :   42 (   0 equ;  25 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    7 (   6 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_19_09372),
    file('KRS077+1.p',unknown),
    [] ).

cnf(8,axiom,
    ( ~ cUnsatisfiable(u)
    | ~ cp(u) ),
    file('KRS077+1.p',unknown),
    [] ).

cnf(9,axiom,
    ( ~ cUnsatisfiable(u)
    | rr(u,skf6(u)) ),
    file('KRS077+1.p',unknown),
    [] ).

cnf(10,axiom,
    ( ~ cUnsatisfiable(u)
    | rs(u,skf7(u)) ),
    file('KRS077+1.p',unknown),
    [] ).

cnf(12,axiom,
    ( ~ rs(u,v)
    | rinvS(v,u) ),
    file('KRS077+1.p',unknown),
    [] ).

cnf(13,axiom,
    ( ~ rs(u,v)
    | rr(u,v) ),
    file('KRS077+1.p',unknown),
    [] ).

cnf(14,axiom,
    ( ~ cUnsatisfiable(u)
    | ~ rinvS(skf6(v),w)
    | cp(w) ),
    file('KRS077+1.p',unknown),
    [] ).

cnf(15,axiom,
    ( ~ cUnsatisfiable(u)
    | ~ rr(u,v)
    | ~ rr(u,w)
    | equal(v,w) ),
    file('KRS077+1.p',unknown),
    [] ).

cnf(19,plain,
    ( ~ cUnsatisfiable(u)
    | rinvS(skf7(u),u) ),
    inference(res,[status(thm),theory(equality)],[10,12]),
    [iquote('0:Res:10.1,12.0')] ).

cnf(21,plain,
    ( ~ cUnsatisfiable(u)
    | rr(u,skf7(u)) ),
    inference(res,[status(thm),theory(equality)],[10,13]),
    [iquote('0:Res:10.1,13.0')] ).

cnf(23,plain,
    ( ~ rinvS(skf6(u),v)
    | cp(v) ),
    inference(ems,[status(thm)],[14,2]),
    [iquote('0:EmS:14.0,2.0')] ).

cnf(24,plain,
    ( ~ cUnsatisfiable(u)
    | ~ cUnsatisfiable(u)
    | ~ rr(u,v)
    | equal(skf6(u),v) ),
    inference(res,[status(thm),theory(equality)],[9,15]),
    [iquote('0:Res:9.1,15.1')] ).

cnf(27,plain,
    ( ~ cUnsatisfiable(u)
    | ~ rr(u,v)
    | equal(skf6(u),v) ),
    inference(obv,[status(thm),theory(equality)],[24]),
    [iquote('0:Obv:24.0')] ).

cnf(33,plain,
    ( ~ cUnsatisfiable(u)
    | ~ cUnsatisfiable(u)
    | equal(skf7(u),skf6(u)) ),
    inference(res,[status(thm),theory(equality)],[21,27]),
    [iquote('0:Res:21.1,27.1')] ).

cnf(35,plain,
    ( ~ cUnsatisfiable(u)
    | equal(skf7(u),skf6(u)) ),
    inference(obv,[status(thm),theory(equality)],[33]),
    [iquote('0:Obv:33.0')] ).

cnf(37,plain,
    ( ~ cUnsatisfiable(u)
    | rinvS(skf6(u),u) ),
    inference(rew,[status(thm),theory(equality)],[35,19]),
    [iquote('0:Rew:35.1,19.1')] ).

cnf(42,plain,
    ( ~ cUnsatisfiable(u)
    | cp(u) ),
    inference(res,[status(thm),theory(equality)],[37,23]),
    [iquote('0:Res:37.1,23.0')] ).

cnf(43,plain,
    ~ cUnsatisfiable(u),
    inference(mrr,[status(thm)],[42,8]),
    [iquote('0:MRR:42.1,8.1')] ).

cnf(44,plain,
    $false,
    inference(unc,[status(thm)],[43,2]),
    [iquote('0:UnC:43.0,2.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : KRS077+1 : TPTP v8.1.0. Released v3.1.0.
% 0.12/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n026.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 Jun  7 13:28:01 EDT 2022
% 0.18/0.33  % 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/sandbox/benchmark/theBenchmark.p 
% 0.19/0.46  SPASS derived 21 clauses, backtracked 0 clauses, performed 0 splits and kept 31 clauses.
% 0.19/0.46  SPASS allocated 98147 KBytes.
% 0.19/0.46  SPASS spent	0:00:00.12 on the problem.
% 0.19/0.46  		0:00:00.04 for the input.
% 0.19/0.46  		0:00:00.06 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 2, length 19 :
% 0.19/0.46  % SZS output start Refutation
% See solution above
% 0.19/0.46  Formulae used in the proof : axiom_4 axiom_2 axiom_3 axiom_5
% 0.19/0.46  
%------------------------------------------------------------------------------