## TPTP Problem File: KLE156+1.p

View Solutions - Solve Problem

```%------------------------------------------------------------------------------
% File     : KLE156+1 : TPTP v7.5.0. Released v4.0.0.
% Domain   : Kleene Algebra (Demonic Refinement Algebra)
% Problem  : Semicommuation law of finite iteration
% Version  : [Hoe08] axioms.
% English  : If x semicommutes over y every finite sequence of x's and y's can
%            be rearranged to a finite sequence of x's followed by finite
%            sequence of y's.

% Refs     : [vW02]  von Wright (2002), From Kleene Algebra to Refinement A
%          : [Coh00] Cohen (2000), Separation and Reduction
%          : [Hoe08] Hoefner (2008), Email to G. Sutcliffe
% Source   : [Hoe08]
% Names    :

% Status   : Theorem
% Rating   : 0.97 v7.4.0, 0.93 v7.1.0, 0.91 v7.0.0, 1.00 v6.3.0, 0.96 v6.2.0, 1.00 v4.0.1, 0.96 v4.0.0
% Syntax   : Number of formulae    :   19 (  14 unit)
%            Number of atoms       :   24 (  16 equality)
%            Maximal formula depth :    5 (   3 average)
%            Number of connectives :    5 (   0   ~;   0   |;   0   &)
%                                         (   1 <=>;   4  =>;   0  <=;   0 <~>)
%                                         (   0  ~|;   0  ~&)
%            Number of predicates  :    2 (   0 propositional; 2-2 arity)
%            Number of functors    :    6 (   2 constant; 0-2 arity)
%            Number of variables   :   36 (   0 sgn;  36   !;   0   ?)
%            Maximal term depth    :    4 (   2 average)
% SPC      : FOF_THM_RFO_SEQ