-- I) Eventually

open ESTEP
-- assumptions
  eq pc(s,i) = l2 .
  eq top(queue(s)) = i .
-- successor state
  eq s' = try(s,i) .
-- check if the predicate holds
  red estep11(i) .
close


-- II) Unless

--> 1) want(s,k)
-- 1.1) pc(s,k) = l1
open USTEP
-- arbitrary chosen objects
  op k : -> Pid .
-- assumptions
  eq pc(s,k) = l1 .
--
  eq i = k .
-- successor state
  eq s' = want(s,k) .
-- check if the predicate holds
  red ustep11(i) .
close
--
open USTEP
-- arbitrary chosen objects
  op k : -> Pid .
-- assumptions
  eq pc(s,k) = l1 .
--
  eq (i = k) = false .
  eq queue(s) = empty .
  eq pc(s,i) = l2 . 
-- successor state
  eq s' = want(s,k) .
-- check if the predicate holds
  red inv3(s,i) implies ustep11(i) .
close
--
open USTEP
-- arbitrary chosen objects
  op k : -> Pid .
-- assumptions
  eq pc(s,k) = l1 .
--
  eq (i = k) = false .
  eq queue(s) = empty .
  eq (pc(s,i) = l2) = false . 
-- successor state
  eq s' = want(s,k) .
-- check if the predicate holds
  red ustep11(i) .
close
--
open USTEP
-- arbitrary chosen objects
  op k : -> Pid .
  op l : -> Pid .
  op q : -> Queue .
-- assumptions
  eq pc(s,k) = l1 .
--
  eq (i = k) = false .
  eq queue(s) = l q .
-- successor state
  eq s' = want(s,k) .
-- check if the predicate holds
  red ustep11(i) .
close
--
-- 1.2) not(pc(s,k) = l1)
open USTEP
-- arbitrary chosen objects
  op k : -> Pid .
-- assumptions
  eq not(pc(s,k) = l1) = true .
-- successor state
  eq s' = want(s,k) .
-- check if the predicate holds
  red ustep11(i) .
close

--> 2) try(s,k)
-- 2.1) pc(s,k) = l2 and top(queue(s)) = k 
open USTEP
-- arbitrary chosen objects
  op k : -> Pid .
-- assumptions
  eq pc(s,k) = l2 .
  eq top(queue(s)) = k .
--
  eq i = k .
-- successor state
  eq s' = try(s,k) .
-- check if the predicate holds
  red ustep11(i) .
close
--
open USTEP
-- arbitrary chosen objects
  op k : -> Pid .
-- assumptions
  eq pc(s,k) = l2 .
  eq top(queue(s)) = k .
--
  eq (i = k) = false .
-- successor state
  eq s' = try(s,k) .
-- check if the predicate holds
  red ustep11(i) .
close
--
-- 2.2) not(pc(s,k) = l2 and top(queue(s)) = k)
open USTEP
-- arbitrary chosen objects
  op k : -> Pid .
-- assumptions
  eq not(pc(s,k) = l2 and top(queue(s)) = k) = true .
-- successor state
  eq s' = try(s,k) .
-- check if the predicate holds
  red ustep11(i) .
close

--> 3) exit(s,k)
-- 3.1) pc(s,k) = cs 
open USTEP
-- arbitrary chosen objects
  op k : -> Pid .
-- assumptions
  eq pc(s,k) = cs .
--
  eq i = k .
-- successor state
  eq s' = exit(s,k) .
-- check if the predicate holds
  red ustep11(i) .
close
--
open USTEP
-- arbitrary chosen objects
  op k : -> Pid .
-- assumptions
  eq pc(s,k) = cs .
--
  eq (i = k) = false .
  eq queue(s) = empty .
-- successor state
  eq s' = exit(s,k) .
-- check if the predicate holds
  red ustep11(i) .
close
--
open USTEP
-- arbitrary chosen objects
  op k : -> Pid .
  op l : -> Pid .
  op q : -> Queue .
-- assumptions
  eq pc(s,k) = cs .
--
  eq (i = k) = false .
  eq queue(s) = l q .
  eq l = i .
-- successor state
  eq s' = exit(s,k) .
-- check if the predicate holds
  red inv2(s,k) implies ustep11(i) .
close
--
open USTEP
-- arbitrary chosen objects
  op k : -> Pid .
  op l : -> Pid .
  op q : -> Queue .
-- assumptions
  eq pc(s,k) = cs .
--
  eq (i = k) = false .
  eq queue(s) = l q .
  eq (l = i) = false .
-- successor state
  eq s' = exit(s,k) .
-- check if the predicate holds
  red ustep11(i) .
close
--
-- 3.2) not(pc(s,k) = cs)
open USTEP
-- arbitrary chosen objects
  op k : -> Pid .
-- assumptions
  eq not(pc(s,k) = cs) = true .
-- successor state
  eq s' = exit(s,k) .
-- check if the predicate holds
  red ustep11(i) .
close

--> Q.E.D.