TSTP Solution File: KRS131+1 by SPASS---3.9

View Problem - Process Solution

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

% Computer : n017.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:39 EDT 2022

% Result   : Theorem 0.17s 0.43s
% Output   : Refutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   37 (  15 unt;   9 nHn;  37 RR)
%            Number of literals    :   71 (   0 equ;  34 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   11 (  10 usr;   2 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   6 con; 0-1 aty)
%            Number of variables   :    0 (   0 sgn)

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

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

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

cnf(6,axiom,
    ( ~ xsd_integer(skc7)
    | xsd_string(skc7)
    | skC0 ),
    file('KRS131+1.p',unknown),
    [] ).

cnf(7,axiom,
    ( ~ xsd_string(skc7)
    | xsd_integer(skc7)
    | skC0 ),
    file('KRS131+1.p',unknown),
    [] ).

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

cnf(9,axiom,
    ( cnotA(u)
    | rq(u,skf5(u)) ),
    file('KRS131+1.p',unknown),
    [] ).

cnf(10,axiom,
    ( ~ cA(u)
    | rq(u,skf3(u)) ),
    file('KRS131+1.p',unknown),
    [] ).

cnf(11,axiom,
    ( ~ cNothing(u)
    | ~ rp(u,v) ),
    file('KRS131+1.p',unknown),
    [] ).

cnf(12,axiom,
    ( ~ cNothing(u)
    | rp(u,skf4(u)) ),
    file('KRS131+1.p',unknown),
    [] ).

cnf(13,axiom,
    ( ~ cowlThing(u)
    | ~ rq(v,u)
    | cA(v) ),
    file('KRS131+1.p',unknown),
    [] ).

cnf(14,axiom,
    ( ~ cnotA(u)
    | ~ rq(u,v)
    | cNothing(v) ),
    file('KRS131+1.p',unknown),
    [] ).

cnf(15,axiom,
    ( ~ cA(skc6)
    | ~ cowlThing(skc4)
    | ~ skC0
    | cnotA(skc6)
    | cowlNothing(skc5) ),
    file('KRS131+1.p',unknown),
    [] ).

cnf(16,axiom,
    ( ~ cnotA(skc6)
    | ~ cowlThing(skc4)
    | ~ skC0
    | cA(skc6)
    | cowlNothing(skc5) ),
    file('KRS131+1.p',unknown),
    [] ).

cnf(17,plain,
    ( skC0
    | xsd_integer(skc7) ),
    inference(mrr,[status(thm)],[7,4]),
    [iquote('0:MRR:7.0,4.1')] ).

cnf(18,plain,
    ( skC0
    | xsd_string(skc7) ),
    inference(mrr,[status(thm)],[6,17]),
    [iquote('0:MRR:6.0,17.0')] ).

cnf(19,plain,
    ~ cNothing(u),
    inference(mrr,[status(thm)],[12,11]),
    [iquote('0:MRR:12.1,11.1')] ).

cnf(20,plain,
    ( ~ cnotA(u)
    | ~ rq(u,v) ),
    inference(mrr,[status(thm)],[14,19]),
    [iquote('0:MRR:14.2,19.0')] ).

cnf(21,plain,
    ( ~ rq(u,v)
    | cA(u) ),
    inference(mrr,[status(thm)],[13,1]),
    [iquote('0:MRR:13.0,1.0')] ).

cnf(22,plain,
    ( ~ skC0
    | ~ cnotA(skc6)
    | cA(skc6) ),
    inference(mrr,[status(thm)],[16,1,2]),
    [iquote('0:MRR:16.1,16.4,1.0,2.0')] ).

cnf(23,plain,
    ( ~ skC0
    | ~ cA(skc6)
    | cnotA(skc6) ),
    inference(mrr,[status(thm)],[15,1,2]),
    [iquote('0:MRR:15.1,15.4,1.0,2.0')] ).

cnf(33,plain,
    ~ skC0,
    inference(spt,[spt(split,[position(s1)])],[22]),
    [iquote('1:Spt:22.0')] ).

cnf(34,plain,
    xsd_integer(skc7),
    inference(mrr,[status(thm)],[17,33]),
    [iquote('1:MRR:17.0,33.0')] ).

cnf(35,plain,
    xsd_string(skc7),
    inference(mrr,[status(thm)],[18,33]),
    [iquote('1:MRR:18.0,33.0')] ).

cnf(37,plain,
    $false,
    inference(ems,[status(thm)],[8,34,35]),
    [iquote('1:EmS:8.0,8.1,34.0,35.0')] ).

cnf(38,plain,
    skC0,
    inference(spt,[spt(split,[position(sa)])],[37,33]),
    [iquote('1:Spt:37.0,22.0,33.0')] ).

cnf(39,plain,
    ( ~ cnotA(skc6)
    | cA(skc6) ),
    inference(spt,[spt(split,[position(s2)])],[22]),
    [iquote('1:Spt:37.0,22.1,22.2')] ).

cnf(40,plain,
    ( ~ cA(skc6)
    | cnotA(skc6) ),
    inference(mrr,[status(thm)],[23,38]),
    [iquote('1:MRR:23.0,38.0')] ).

cnf(41,plain,
    ~ cA(skc6),
    inference(spt,[spt(split,[position(s2s1)])],[40]),
    [iquote('2:Spt:40.0')] ).

cnf(42,plain,
    ~ cnotA(skc6),
    inference(mrr,[status(thm)],[39,41]),
    [iquote('2:MRR:39.1,41.0')] ).

cnf(43,plain,
    ( cnotA(u)
    | cA(u) ),
    inference(res,[status(thm),theory(equality)],[9,21]),
    [iquote('0:Res:9.1,21.0')] ).

cnf(44,plain,
    cA(skc6),
    inference(res,[status(thm),theory(equality)],[43,42]),
    [iquote('2:Res:43.0,42.0')] ).

cnf(45,plain,
    $false,
    inference(mrr,[status(thm)],[44,41]),
    [iquote('2:MRR:44.0,41.0')] ).

cnf(46,plain,
    cA(skc6),
    inference(spt,[spt(split,[position(s2sa)])],[45,41]),
    [iquote('2:Spt:45.0,40.0,41.0')] ).

cnf(47,plain,
    cnotA(skc6),
    inference(spt,[spt(split,[position(s2s2)])],[40]),
    [iquote('2:Spt:45.0,40.1')] ).

cnf(50,plain,
    ( ~ cA(u)
    | ~ cnotA(u) ),
    inference(res,[status(thm),theory(equality)],[10,20]),
    [iquote('0:Res:10.1,20.1')] ).

cnf(51,plain,
    $false,
    inference(ems,[status(thm)],[50,46,47]),
    [iquote('2:EmS:50.0,50.1,46.0,47.0')] ).

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