%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : KRS096+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:32 EDT 2022

% Result   : Unsatisfiable 0.20s 0.42s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   14 (   5 unt;   0 nHn;  14 RR)
%            Number of literals    :   29 (   0 equ;  17 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   5 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_20_18265),
    file('KRS096+1.p',unknown),
    [] ).

cnf(4,axiom,
    cd(skf5(u)),
    file('KRS096+1.p',unknown),
    [] ).

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

cnf(8,axiom,
    ( ~ cd(u)
    | ~ cc(u) ),
    file('KRS096+1.p',unknown),
    [] ).

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

cnf(10,axiom,
    ( ~ cUnsatisfiable(u)
    | rr(u,skf5(u)) ),
    file('KRS096+1.p',unknown),
    [] ).

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

cnf(15,plain,
    ( ~ cUnsatisfiable(u)
    | ~ cUnsatisfiable(u)
    | ~ rr(u,v)
    | equal(skf5(u),v) ),
    inference(res,[status(thm),theory(equality)],[10,11]),
    [iquote('0:Res:10.1,11.1')] ).

cnf(17,plain,
    ( ~ cUnsatisfiable(u)
    | ~ rr(u,v)
    | equal(skf5(u),v) ),
    inference(obv,[status(thm),theory(equality)],[15]),
    [iquote('0:Obv:15.0')] ).

cnf(20,plain,
    ( ~ cUnsatisfiable(u)
    | ~ cUnsatisfiable(u)
    | equal(skf5(u),skf4(u)) ),
    inference(res,[status(thm),theory(equality)],[9,17]),
    [iquote('0:Res:9.1,17.1')] ).

cnf(21,plain,
    ( ~ cUnsatisfiable(u)
    | equal(skf5(u),skf4(u)) ),
    inference(obv,[status(thm),theory(equality)],[20]),
    [iquote('0:Obv:20.0')] ).

cnf(24,plain,
    ( ~ cUnsatisfiable(u)
    | cd(skf4(u)) ),
    inference(spr,[status(thm),theory(equality)],[21,4]),
    [iquote('0:SpR:21.1,4.0')] ).

cnf(26,plain,
    ~ cUnsatisfiable(u),
    inference(ems,[status(thm)],[8,24,5]),
    [iquote('0:EmS:8.0,8.1,24.1,5.0')] ).

cnf(27,plain,
    $false,
    inference(unc,[status(thm)],[26,2]),
    [iquote('0:UnC:26.0,2.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : KRS096+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n024.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 15:53:19 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.20/0.42  
% 0.20/0.42  SPASS V 3.9 
% 0.20/0.42  SPASS beiseite: Proof found.
% 0.20/0.42  % SZS status Theorem
% 0.20/0.42  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.20/0.42  SPASS derived 9 clauses, backtracked 0 clauses, performed 0 splits and kept 19 clauses.
% 0.20/0.42  SPASS allocated 97886 KBytes.
% 0.20/0.42  SPASS spent	0:00:00.08 on the problem.
% 0.20/0.42  		0:00:00.03 for the input.
% 0.20/0.42  		0:00:00.03 for the FLOTTER CNF translation.
% 0.20/0.42  		0:00:00.00 for inferences.
% 0.20/0.42  		0:00:00.00 for the backtracking.
% 0.20/0.42  		0:00:00.00 for the reduction.
% 0.20/0.42  
% 0.20/0.42  
% 0.20/0.42  Here is a proof with depth 4, length 14 :
% 0.20/0.42  % SZS output start Refutation
% See solution above
% 0.20/0.42  Formulae used in the proof : axiom_4 axiom_2 axiom_3
% 0.20/0.42  
%------------------------------------------------------------------------------