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

% Computer : n027.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:38 EDT 2022

% Result   : Unsatisfiable 0.22s 0.47s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   18 (   5 unt;   0 nHn;  18 RR)
%            Number of literals    :   37 (   0 equ;  23 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    :    7 (   7 usr;   4 con; 0-1 aty)
%            Number of variables   :    0 (   0 sgn)

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

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

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

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

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

cnf(12,axiom,
    ( ~ cUnsatisfiable(u)
    | rr(u,skf7(u)) ),
    file('KRS127+1.p',unknown),
    [] ).

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

cnf(14,axiom,
    ( ~ cdxcomp(u)
    | ra_Px1(u,skf11(u)) ),
    file('KRS127+1.p',unknown),
    [] ).

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

cnf(22,plain,
    ( ~ cdxcomp(u)
    | ~ cd(u) ),
    inference(res,[status(thm),theory(equality)],[14,13]),
    [iquote('0:Res:14.1,13.1')] ).

cnf(25,plain,
    ( ~ cUnsatisfiable(u)
    | ~ cUnsatisfiable(u)
    | ~ rr(u,v)
    | equal(skf7(u),v) ),
    inference(res,[status(thm),theory(equality)],[12,15]),
    [iquote('0:Res:12.1,15.1')] ).

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

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

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

cnf(35,plain,
    ( ~ cUnsatisfiable(u)
    | cd(skf6(u)) ),
    inference(spr,[status(thm),theory(equality)],[31,4]),
    [iquote('0:SpR:31.1,4.0')] ).

cnf(37,plain,
    ( ~ cc(skf6(u))
    | ~ cUnsatisfiable(u) ),
    inference(ems,[status(thm)],[22,7,35]),
    [iquote('0:EmS:22.0,22.1,7.1,35.1')] ).

cnf(39,plain,
    ~ cUnsatisfiable(u),
    inference(ssi,[status(thm)],[37,5,35]),
    [iquote('0:SSi:37.0,5.1,35.0')] ).

cnf(40,plain,
    $false,
    inference(unc,[status(thm)],[39,2]),
    [iquote('0:UnC:39.0,2.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14  % Problem  : KRS127+1 : TPTP v8.1.0. Released v3.1.0.
% 0.08/0.14  % Command  : run_spass %d %s
% 0.15/0.36  % Computer : n027.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 600
% 0.15/0.36  % DateTime : Tue Jun  7 09:16:55 EDT 2022
% 0.15/0.36  % CPUTime  : 
% 0.22/0.47  
% 0.22/0.47  SPASS V 3.9 
% 0.22/0.47  SPASS beiseite: Proof found.
% 0.22/0.47  % SZS status Theorem
% 0.22/0.47  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.22/0.47  SPASS derived 17 clauses, backtracked 0 clauses, performed 0 splits and kept 26 clauses.
% 0.22/0.47  SPASS allocated 97894 KBytes.
% 0.22/0.47  SPASS spent	0:00:00.10 on the problem.
% 0.22/0.47  		0:00:00.03 for the input.
% 0.22/0.47  		0:00:00.04 for the FLOTTER CNF translation.
% 0.22/0.47  		0:00:00.00 for inferences.
% 0.22/0.47  		0:00:00.00 for the backtracking.
% 0.22/0.47  		0:00:00.00 for the reduction.
% 0.22/0.47  
% 0.22/0.47  
% 0.22/0.47  Here is a proof with depth 4, length 18 :
% 0.22/0.47  % SZS output start Refutation
% See solution above
% 0.22/0.47  Formulae used in the proof : axiom_6 axiom_2 axiom_4 axiom_3 axiom_5
% 0.22/0.47  
%------------------------------------------------------------------------------