↑ Up

SPASS---3.9.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : KRS165+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n023.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:45 EDT 2022

% Result   : Theorem 0.19s 0.43s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   33 (  17 unt;   7 nHn;  33 RR)
%            Number of literals    :   59 (   0 equ;  29 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    9 (   8 usr;   3 prp; 0-1 aty)
%            Number of functors    :    6 (   6 usr;   6 con; 0-0 aty)
%            Number of variables   :    0 (   0 sgn)

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

cnf(2,axiom,
    ( skC1
    | cAutomobile(skc9) ),
    file('KRS165+1.p',unknown),
    [] ).

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

cnf(4,axiom,
    ( ~ cCar(skc9)
    | skC1 ),
    file('KRS165+1.p',unknown),
    [] ).

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

cnf(6,axiom,
    ( ~ cCar(u)
    | cAutomobile(u) ),
    file('KRS165+1.p',unknown),
    [] ).

cnf(7,axiom,
    ( ~ cAutomobile(u)
    | cCar(u) ),
    file('KRS165+1.p',unknown),
    [] ).

cnf(8,axiom,
    ( ~ xsd_integer(skc8)
    | xsd_string(skc8)
    | skC0 ),
    file('KRS165+1.p',unknown),
    [] ).

cnf(9,axiom,
    ( ~ xsd_string(skc8)
    | xsd_integer(skc8)
    | skC0 ),
    file('KRS165+1.p',unknown),
    [] ).

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

cnf(11,axiom,
    ( ~ cowlThing(skc5)
    | ~ skC0
    | ~ skC1
    | cCar(skc7)
    | cowlNothing(skc6) ),
    file('KRS165+1.p',unknown),
    [] ).

cnf(12,axiom,
    ( ~ cAutomobile(skc7)
    | ~ cowlThing(skc5)
    | ~ skC0
    | ~ skC1
    | cowlNothing(skc6) ),
    file('KRS165+1.p',unknown),
    [] ).

cnf(13,plain,
    ( skC0
    | xsd_integer(skc8) ),
    inference(mrr,[status(thm)],[9,5]),
    [iquote('0:MRR:9.0,5.1')] ).

cnf(14,plain,
    ( skC0
    | xsd_string(skc8) ),
    inference(mrr,[status(thm)],[8,13]),
    [iquote('0:MRR:8.0,13.0')] ).

cnf(15,plain,
    ( ~ skC1
    | ~ skC0
    | cCar(skc7) ),
    inference(mrr,[status(thm)],[11,1,3]),
    [iquote('0:MRR:11.0,11.4,1.0,3.0')] ).

cnf(16,plain,
    ( ~ skC1
    | ~ skC0
    | ~ cAutomobile(skc7) ),
    inference(mrr,[status(thm)],[12,1,3]),
    [iquote('0:MRR:12.1,12.4,1.0,3.0')] ).

cnf(26,plain,
    ~ skC1,
    inference(spt,[spt(split,[position(s1)])],[15]),
    [iquote('1:Spt:15.0')] ).

cnf(27,plain,
    cAutomobile(skc9),
    inference(mrr,[status(thm)],[2,26]),
    [iquote('1:MRR:2.0,26.0')] ).

cnf(28,plain,
    ~ cCar(skc9),
    inference(mrr,[status(thm)],[4,26]),
    [iquote('1:MRR:4.1,26.0')] ).

cnf(30,plain,
    ~ cAutomobile(skc9),
    inference(res,[status(thm),theory(equality)],[7,28]),
    [iquote('1:Res:7.1,28.0')] ).

cnf(31,plain,
    $false,
    inference(ssi,[status(thm)],[30,27]),
    [iquote('1:SSi:30.0,27.0')] ).

cnf(32,plain,
    skC1,
    inference(spt,[spt(split,[position(sa)])],[31,26]),
    [iquote('1:Spt:31.0,15.0,26.0')] ).

cnf(33,plain,
    ( ~ skC0
    | cCar(skc7) ),
    inference(spt,[spt(split,[position(s2)])],[15]),
    [iquote('1:Spt:31.0,15.1,15.2')] ).

cnf(34,plain,
    ( ~ skC0
    | ~ cAutomobile(skc7) ),
    inference(mrr,[status(thm)],[16,32]),
    [iquote('1:MRR:16.0,32.0')] ).

cnf(35,plain,
    skC0,
    inference(spt,[spt(split,[position(s2s1)])],[14]),
    [iquote('2:Spt:14.0')] ).

cnf(36,plain,
    cCar(skc7),
    inference(mrr,[status(thm)],[33,35]),
    [iquote('2:MRR:33.0,35.0')] ).

cnf(37,plain,
    ~ cAutomobile(skc7),
    inference(mrr,[status(thm)],[34,35]),
    [iquote('2:MRR:34.0,35.0')] ).

cnf(38,plain,
    ~ cCar(skc7),
    inference(res,[status(thm),theory(equality)],[6,37]),
    [iquote('2:Res:6.1,37.0')] ).

cnf(39,plain,
    $false,
    inference(ssi,[status(thm)],[38,36]),
    [iquote('2:SSi:38.0,36.0')] ).

cnf(40,plain,
    ~ skC0,
    inference(spt,[spt(split,[position(s2sa)])],[39,35]),
    [iquote('2:Spt:39.0,14.0,35.0')] ).

cnf(41,plain,
    xsd_string(skc8),
    inference(spt,[spt(split,[position(s2s2)])],[14]),
    [iquote('2:Spt:39.0,14.1')] ).

cnf(42,plain,
    xsd_integer(skc8),
    inference(mrr,[status(thm)],[13,40]),
    [iquote('2:MRR:13.0,40.0')] ).

cnf(43,plain,
    $false,
    inference(ems,[status(thm)],[10,42,41]),
    [iquote('2:EmS:10.0,10.1,42.0,41.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem  : KRS165+1 : TPTP v8.1.0. Released v3.1.0.
% 0.10/0.12  % Command  : run_spass %d %s
% 0.11/0.33  % Computer : n023.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Tue Jun  7 19:51:38 EDT 2022
% 0.11/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/sandbox/benchmark/theBenchmark.p 
% 0.19/0.43  SPASS derived 11 clauses, backtracked 12 clauses, performed 3 splits and kept 29 clauses.
% 0.19/0.43  SPASS allocated 97865 KBytes.
% 0.19/0.43  SPASS spent	0:00:00.09 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 33 :
% 0.19/0.43  % SZS output start Refutation
% See solution above
% 0.19/0.43  Formulae used in the proof : axiom_0 the_axiom axiom_1 axiom_2
% 0.19/0.43  
%------------------------------------------------------------------------------