TPTP Problem File: DAT430_1.p

View Solutions - Solve Problem

%------------------------------------------------------------------------------
% File     : DAT430_1 : TPTP v9.3.1. Released v9.3.0.
% Domain   : Software Verification
% Problem  : Conflict detection of 2 conceptual schemata (e.g. UML-schemata)
% Version  : Especial.
% English  :

% Refs     : [BE04]  Boeva & Ekenberg (2004), A Transition Logic for Schema
% Source   : [BE04]
% Names    : 

% Status   : Satisfiable
% Rating   : ? v9.3.0
% Syntax   : Number of formulae    :    8 (   0 unt;   5 typ;   0 def)
%            Number of atoms       :   21 (   0 equ)
%            Maximal formula atoms :   11 (   7 avg)
%            Number of connectives :   27 (   6   ~;   2   |;   7   &)
%                                         (   2 <=>;   4  =>;   0  <=;   0 <~>)
%                                         (   3 {.};   0 {#})
%            Maximal formula depth :    8 (   6 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :    3 (   3 fml;   0 var)
%            Number of X terms     :    3 (   3  [];   0 ite;   0 let;   0 dis)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    2 (   2   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :    1 (   1   !;   0   ?;   1   :)
% SPC      : NX0_SAT_NEQ_NAR_NDT

% Comments :
%------------------------------------------------------------------------------
tff(modal_system,logic,
    $modal == 
      [ $domains == $constant,
        $designation == $rigid,
        $terms == $local,
        $modalities == [$modal_axiom_K,$modal_axiom_M] ] ).

tff(a_decl,type,
    a: $i ).

tff(b_decl,type,
    b: $i ).

tff(c_decl,type,
    c: $i ).

tff(p_decl,type,
    p: $i > $o ).

tff(r_decl,type,
    r: $i > $o ).

%----From example 1 on p.281 of [BE04]
tff(schema1,axiom-local,
    ( ( ~ r(a)
      | r(b) )
    & ( r(c)
    <=> r(a) )
    & ( r(a)
     => ( {$dia} @ (r(b)) ) )
    & ( ~ r(a)
     => ( {$dia}
        @ (( ~ r(b)
           & ~ r(c) )) ) ) ) ).

%----From example 4 on p.290 of [BE04]
tff(schema2,axiom-local,
    ( ( p(a)
     => p(b) )
    & ( p(c)
      | ~ p(b) )
    & ( ( p(a)
        & p(b) )
     => ( {$dia} @ (~ p(b)) ) ) ) ).

tff(integration_assertion,axiom-local,
    ! [X: $i] :
      ( p(X)
    <=> r(X) ) ).

%------------------------------------------------------------------------------