TPTP Problem File: KLE155+1.p
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% File : KLE155+1 : TPTP v9.0.0. Released v4.0.0.
% Domain : Kleene Algebra (Demonic Refinement Algebra)
% Problem : Denesting of strong iteration
% Version : [Hoe08] axioms.
% English :
% Refs : [vW02] von Wright (2002), From Kleene Algebra to Refinement A
% : [Hoe08] Hoefner (2008), Email to G. Sutcliffe
% Source : [Hoe08]
% Names :
% Status : Theorem
% Rating : 1.00 v4.0.0
% Syntax : Number of formulae : 19 ( 15 unt; 0 def)
% Number of atoms : 23 ( 16 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 4 ( 0 ~; 0 |; 0 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 0 prp; 2-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 36 ( 36 !; 0 ?)
% SPC : FOF_THM_RFO_SEQ
% Comments :
%------------------------------------------------------------------------------
%---Include axioms for demonic refinement algebra
include('Axioms/KLE004+0.ax').
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X0,X1] : multiplication(strong_iteration(multiplication(star(X0),X1)),strong_iteration(X0)) = strong_iteration(addition(X0,X1)) ).
%------------------------------------------------------------------------------