TPTP Problem File: KLE145+2.p
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% File : KLE145+2 : TPTP v9.0.0. Released v4.0.0.
% Domain : Kleene Algebra (Demonic Refinement Algebra)
% Problem : Finite iteration after strong iteration is 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 : 0.58 v9.0.0, 0.67 v8.2.0, 0.64 v8.1.0, 0.58 v7.5.0, 0.59 v7.4.0, 0.57 v7.3.0, 0.62 v7.2.0, 0.66 v7.1.0, 0.57 v6.4.0, 0.62 v6.3.0, 0.54 v6.2.0, 0.68 v6.1.0, 0.80 v6.0.0, 0.70 v5.5.0, 0.74 v5.4.0, 0.75 v5.3.0, 0.78 v5.2.0, 0.70 v5.1.0, 0.71 v4.1.0, 0.70 v4.0.1, 0.74 v4.0.0
% Syntax : Number of formulae : 19 ( 14 unt; 0 def)
% Number of atoms : 24 ( 15 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 5 ( 0 ~; 0 |; 1 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 4 ( 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 : 35 ( 35 !; 0 ?)
% SPC : FOF_THM_RFO_SEQ
% Comments :
%------------------------------------------------------------------------------
%---Include axioms for demonic refinement algebra
include('Axioms/KLE004+0.ax').
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X0] :
( leq(star(strong_iteration(X0)),strong_iteration(X0))
& leq(strong_iteration(X0),star(strong_iteration(X0))) ) ).
%------------------------------------------------------------------------------