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

% Computer : n018.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:37 EDT 2022

% Result   : Unsatisfiable 0.20s 0.43s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   10 (   3 unt;   0 nHn;  10 RR)
%            Number of literals    :   17 (   0 equ;  11 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-1 aty)
%            Number of variables   :    0 (   0 sgn)

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

cnf(5,axiom,
    ( ~ cUnsatisfiable(u)
    | cc(u) ),
    file('KRS123+1.p',unknown),
    [] ).

cnf(6,axiom,
    ( ~ cUnsatisfiable(u)
    | cd(u) ),
    file('KRS123+1.p',unknown),
    [] ).

cnf(7,axiom,
    ( ~ cc(u)
    | cdxcomp(u) ),
    file('KRS123+1.p',unknown),
    [] ).

cnf(17,axiom,
    ( ~ cd(u)
    | ~ ra_Px1(u,v) ),
    file('KRS123+1.p',unknown),
    [] ).

cnf(18,axiom,
    ( ~ cdxcomp(u)
    | ra_Px1(u,skf5(u)) ),
    file('KRS123+1.p',unknown),
    [] ).

cnf(48,plain,
    ( ~ cdxcomp(u)
    | ~ cd(u) ),
    inference(res,[status(thm),theory(equality)],[18,17]),
    [iquote('0:Res:18.1,17.1')] ).

cnf(51,plain,
    ( ~ cc(u)
    | ~ cUnsatisfiable(u) ),
    inference(ems,[status(thm)],[48,7,6]),
    [iquote('0:EmS:48.0,48.1,7.1,6.1')] ).

cnf(53,plain,
    ~ cUnsatisfiable(u),
    inference(ssi,[status(thm)],[51,5]),
    [iquote('0:SSi:51.0,5.1')] ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : KRS123+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.13  % Command  : run_spass %d %s
% 0.14/0.34  % Computer : n018.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Tue Jun  7 05:27:50 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.20/0.43  
% 0.20/0.43  SPASS V 3.9 
% 0.20/0.43  SPASS beiseite: Proof found.
% 0.20/0.43  % SZS status Theorem
% 0.20/0.43  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.20/0.43  SPASS derived 14 clauses, backtracked 0 clauses, performed 0 splits and kept 26 clauses.
% 0.20/0.43  SPASS allocated 97596 KBytes.
% 0.20/0.43  SPASS spent	0:00:00.08 on the problem.
% 0.20/0.43  		0:00:00.03 for the input.
% 0.20/0.43  		0:00:00.02 for the FLOTTER CNF translation.
% 0.20/0.43  		0:00:00.00 for inferences.
% 0.20/0.43  		0:00:00.00 for the backtracking.
% 0.20/0.43  		0:00:00.00 for the reduction.
% 0.20/0.43  
% 0.20/0.43  
% 0.20/0.43  Here is a proof with depth 2, length 10 :
% 0.20/0.43  % SZS output start Refutation
% See solution above
% 0.20/0.43  Formulae used in the proof : axiom_12 axiom_2 axiom_3 axiom_6 axiom_7
% 0.20/0.43  
%------------------------------------------------------------------------------