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

% Computer : n025.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   : Theorem 0.19s 0.43s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   17 (   6 unt;   3 nHn;  17 RR)
%            Number of literals    :   35 (   0 equ;  19 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   7 con; 0-0 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    cowlThing(u),
    file('KRS129+1.p',unknown),
    [] ).

cnf(9,axiom,
    ~ cowlNothing(u),
    file('KRS129+1.p',unknown),
    [] ).

cnf(11,axiom,
    rhasEuroMP(iUK,iKinnock),
    file('KRS129+1.p',unknown),
    [] ).

cnf(12,axiom,
    ( xsd_string(u)
    | xsd_integer(u) ),
    file('KRS129+1.p',unknown),
    [] ).

cnf(13,axiom,
    ( ~ xsd_integer(u)
    | ~ xsd_string(u) ),
    file('KRS129+1.p',unknown),
    [] ).

cnf(23,axiom,
    ( ~ rhasEuroMP(u,v)
    | risEuroMPFrom(v,u) ),
    file('KRS129+1.p',unknown),
    [] ).

cnf(24,axiom,
    ( ~ cowlThing(u)
    | ~ risEuroMPFrom(v,u)
    | cEuroMP(v) ),
    file('KRS129+1.p',unknown),
    [] ).

cnf(25,axiom,
    ( ~ xsd_integer(skc5)
    | ~ cowlThing(skc3)
    | ~ cEuroMP(iKinnock)
    | xsd_string(skc5)
    | cowlNothing(skc4) ),
    file('KRS129+1.p',unknown),
    [] ).

cnf(26,axiom,
    ( ~ xsd_string(skc5)
    | ~ cowlThing(skc3)
    | ~ cEuroMP(iKinnock)
    | xsd_integer(skc5)
    | cowlNothing(skc4) ),
    file('KRS129+1.p',unknown),
    [] ).

cnf(28,plain,
    ( ~ risEuroMPFrom(u,v)
    | cEuroMP(u) ),
    inference(mrr,[status(thm)],[24,1]),
    [iquote('0:MRR:24.0,1.0')] ).

cnf(29,plain,
    ( ~ cEuroMP(iKinnock)
    | xsd_integer(skc5) ),
    inference(mrr,[status(thm)],[26,12,1,9]),
    [iquote('0:MRR:26.0,26.1,26.4,12.1,1.0,9.0')] ).

cnf(30,plain,
    ( ~ cEuroMP(iKinnock)
    | xsd_string(skc5) ),
    inference(mrr,[status(thm)],[25,29,1,9]),
    [iquote('0:MRR:25.0,25.1,25.4,29.1,1.0,9.0')] ).

cnf(31,plain,
    ( ~ cEuroMP(iKinnock)
    | ~ cEuroMP(iKinnock) ),
    inference(ems,[status(thm)],[13,29,30]),
    [iquote('0:EmS:13.0,13.1,29.1,30.1')] ).

cnf(33,plain,
    ~ cEuroMP(iKinnock),
    inference(obv,[status(thm),theory(equality)],[31]),
    [iquote('0:Obv:31.0')] ).

cnf(36,plain,
    ( ~ rhasEuroMP(u,v)
    | cEuroMP(v) ),
    inference(res,[status(thm),theory(equality)],[23,28]),
    [iquote('0:Res:23.1,28.0')] ).

cnf(37,plain,
    cEuroMP(iKinnock),
    inference(res,[status(thm),theory(equality)],[11,36]),
    [iquote('0:Res:11.0,36.0')] ).

cnf(38,plain,
    $false,
    inference(mrr,[status(thm)],[37,33]),
    [iquote('0:MRR:37.0,33.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : KRS129+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12  % Command  : run_spass %d %s
% 0.13/0.33  % Computer : n025.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Tue Jun  7 15:50:49 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.19/0.43  
% 0.19/0.43  SPASS V 3.9 
% 0.19/0.43  SPASS beiseite: Proof found.
% 0.19/0.43  % SZS status Theorem
% 0.19/0.43  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.19/0.43  SPASS derived 6 clauses, backtracked 0 clauses, performed 0 splits and kept 30 clauses.
% 0.19/0.43  SPASS allocated 97766 KBytes.
% 0.19/0.43  SPASS spent	0:00:00.08 on the problem.
% 0.19/0.43  		0:00:00.03 for the input.
% 0.19/0.43  		0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.43  		0:00:00.00 for inferences.
% 0.19/0.43  		0:00:00.00 for the backtracking.
% 0.19/0.43  		0:00:00.00 for the reduction.
% 0.19/0.43  
% 0.19/0.43  
% 0.19/0.43  Here is a proof with depth 2, length 17 :
% 0.19/0.43  % SZS output start Refutation
% See solution above
% 0.19/0.43  Formulae used in the proof : axiom_0 axiom_13 axiom_1 axiom_5 axiom_3 the_axiom
% 0.19/0.43  
%------------------------------------------------------------------------------