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

% Computer : n028.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      :    8
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   16 (   5 unt;   0 nHn;  16 RR)
%            Number of literals    :   32 (   0 equ;  19 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_18_50190),
    file('KRS072+1.p',unknown),
    [] ).

cnf(4,axiom,
    cp1(skf7(u)),
    file('KRS072+1.p',unknown),
    [] ).

cnf(6,axiom,
    rr(skf6(u),skf7(u)),
    file('KRS072+1.p',unknown),
    [] ).

cnf(7,axiom,
    ( ~ cUnsatisfiable(u)
    | cp2(u) ),
    file('KRS072+1.p',unknown),
    [] ).

cnf(10,axiom,
    ( ~ cp1(u)
    | ~ cp2(u) ),
    file('KRS072+1.p',unknown),
    [] ).

cnf(19,axiom,
    ( ~ cUnsatisfiable(u)
    | rinvR(u,skf6(u)) ),
    file('KRS072+1.p',unknown),
    [] ).

cnf(20,axiom,
    ( ~ rinvR(u,v)
    | rr(v,u) ),
    file('KRS072+1.p',unknown),
    [] ).

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

cnf(29,plain,
    ( ~ cUnsatisfiable(u)
    | ~ rr(skf6(u),v)
    | equal(skf7(u),v) ),
    inference(res,[status(thm),theory(equality)],[6,22]),
    [iquote('0:Res:6.0,22.1')] ).

cnf(35,plain,
    ( ~ cUnsatisfiable(u)
    | ~ rinvR(v,skf6(u))
    | equal(skf7(u),v) ),
    inference(res,[status(thm),theory(equality)],[20,29]),
    [iquote('0:Res:20.1,29.1')] ).

cnf(36,plain,
    ( ~ cUnsatisfiable(u)
    | ~ cUnsatisfiable(u)
    | equal(skf7(u),u) ),
    inference(res,[status(thm),theory(equality)],[19,35]),
    [iquote('0:Res:19.1,35.1')] ).

cnf(38,plain,
    ( ~ cUnsatisfiable(u)
    | equal(skf7(u),u) ),
    inference(obv,[status(thm),theory(equality)],[36]),
    [iquote('0:Obv:36.0')] ).

cnf(41,plain,
    ( ~ cUnsatisfiable(u)
    | cp1(u) ),
    inference(spr,[status(thm),theory(equality)],[38,4]),
    [iquote('0:SpR:38.1,4.0')] ).

cnf(45,plain,
    ( ~ cUnsatisfiable(u)
    | ~ cUnsatisfiable(u) ),
    inference(ems,[status(thm)],[10,41,7]),
    [iquote('0:EmS:10.0,10.1,41.1,7.1')] ).

cnf(46,plain,
    ~ cUnsatisfiable(u),
    inference(obv,[status(thm),theory(equality)],[45]),
    [iquote('0:Obv:45.0')] ).

cnf(47,plain,
    $false,
    inference(unc,[status(thm)],[46,2]),
    [iquote('0:UnC:46.0,2.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : KRS072+1 : TPTP v8.1.0. Released v3.1.0.
% 0.04/0.13  % Command  : run_spass %d %s
% 0.12/0.34  % Computer : n028.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Tue Jun  7 20:30:45 EDT 2022
% 0.12/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/sandbox/benchmark/theBenchmark.p 
% 0.19/0.46  SPASS derived 18 clauses, backtracked 0 clauses, performed 0 splits and kept 38 clauses.
% 0.19/0.46  SPASS allocated 97945 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 16 :
% 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_3 axiom_7
% 0.19/0.46  
%------------------------------------------------------------------------------