-- I) Base case

open INV
  red inv100(init) .
close

-- II) Inductive ceses

--> 1) send1(s)
open ISTEP
-- arbitrary objects
-- assumptions
-- successor state
  eq s' = send1(s) .
-- check if the predicate is true.
  red istep100 .
close

--> 2) rec1(s)
-- 2.1) c-rec1(s)
open ISTEP
-- arbitrary objects
-- assumptions
  -- eq c-rec1(s) = true .
  eq empty?(fifo2(s)) = false .
--
  eq tag1(s) = top(fifo2(s)) .
-- successor state
  eq s' = rec1(s) .
-- check if the predicate is true.
  red istep100 .
close
--
open ISTEP
-- arbitrary objects
-- assumptions
  -- eq c-rec1(s) = true .
  eq empty?(fifo2(s)) = false .
--
  eq (tag1(s) = top(fifo2(s))) = false .
  eq tag2(s) = top(fifo2(s)) .
-- successor state
  eq s' = rec1(s) .
-- check if the predicate is true.
  red istep100 .
close
--
open ISTEP
-- arbitrary objects
-- assumptions
  -- eq c-rec1(s) = true .
  eq empty?(fifo2(s)) = false .
--
  eq (tag1(s) = top(fifo2(s))) = false .
  eq (tag2(s) = top(fifo2(s))) = false .
-- successor state
  eq s' = rec1(s) .
-- check if the predicate is true.
  red inv110(s) implies istep100 .
close
--
-- 2.2) not c-rec1(s)
open ISTEP
-- arbitrary objects
-- assumptions
  eq c-rec1(s) = false .
-- successor state
  eq s' = rec1(s) .
-- check if the predicate is true.
  red istep100 .
close

--> 3) send2(s)
open ISTEP
-- arbitrary objects
-- assumptions
-- successor state
  eq s' = send2(s) .
-- check if the predicate is true.
  red istep100 .
close

--> 4) rec2(s)
-- 4.1) c-rec2(s)
open ISTEP
-- arbitrary objects
-- assumptions
  -- eq c-rec2(s) = true .
  eq empty?(fifo1(s)) = false .
--
  eq (tag2(s) = 1st(top(fifo1(s)))) = false .
-- successor state
  eq s' = rec2(s) .
-- check if the predicate is true.
  red istep100 .
close
--
open ISTEP
-- arbitrary objects
-- assumptions
  -- eq c-rec2(s) = true .
  eq empty?(fifo1(s)) = false .
--
  eq tag2(s) = 1st(top(fifo1(s))) .
  eq (next(s) = 2nd(top(fifo1(s)))) = false .
-- successor state
  eq s' = rec2(s) .
-- check if the predicate is true.
  red inv120(s) implies istep100 .
close
--
open ISTEP
-- arbitrary objects
-- assumptions
  -- eq c-rec2(s) = true .
  eq empty?(fifo1(s)) = false .
--
  eq tag2(s) = 1st(top(fifo1(s))) .
  eq (tag1(s) = 1st(top(fifo1(s)))) = false .
-- successor state
  eq s' = rec2(s) .
-- check if the predicate is true.
  red inv120(s) implies istep100 .
close
--
open ISTEP
-- arbitrary objects
-- assumptions
  -- eq c-rec2(s) = true .
  eq empty?(fifo1(s)) = false .
--
  eq tag2(s) = 1st(top(fifo1(s))) .
  eq next(s) = 2nd(top(fifo1(s))) .
  eq tag1(s) = 1st(top(fifo1(s))) .
  eq 1st(top(fifo1(s))) = up .
-- successor state
  eq s' = rec2(s) .
-- check if the predicate is true.
  red istep100 .
close
--
open ISTEP
-- arbitrary objects
-- assumptions
  -- eq c-rec2(s) = true .
  eq empty?(fifo1(s)) = false .
--
  eq tag2(s) = 1st(top(fifo1(s))) .
  eq next(s) = 2nd(top(fifo1(s))) .
  eq tag1(s) = 1st(top(fifo1(s))) .
  eq 1st(top(fifo1(s))) = down .
-- successor state
  eq s' = rec2(s) .
-- check if the predicate is true.
  red istep100 .
close
--
-- 4.2) c-rec2(s)
open ISTEP
-- arbitrary objects
-- assumptions
  eq c-rec2(s) = false .
-- successor state
  eq s' = rec2(s) .
-- check if the predicate is true.
  red istep100 .
close

--> 5) drop1(s)
-- 5.1) c-drop1(s)
open ISTEP
-- arbitrary objects
-- assumptions
  -- eq c-drop1(s) = true .
  eq empty?(fifo1(s)) = false .
-- successor state
  eq s' = drop1(s) .
-- check if the predicate is true.
  red istep100 .
close
--
-- 5.2) not c-drop1(s)
open ISTEP
-- arbitrary objects
-- assumptions
  eq c-drop1(s) = false .
-- successor state
  eq s' = drop1(s) .
-- check if the predicate is true.
  red istep100 .
close

--> 6) dup1(s)
-- 6.1) c-dup1(s)
open ISTEP
-- arbitrary objects
-- assumptions
  -- eq c-dup1(s) = true .
  eq empty?(fifo1(s)) = false .
-- successor state
  eq s' = dup1(s) .
-- check if the predicate is true.
  red istep100 .
close
--
-- 6.2) not c-dup1(s)
open ISTEP
-- arbitrary objects
-- assumptions
  eq c-dup1(s) = false .
-- successor state
  eq s' = dup1(s) .
-- check if the predicate is true.
  red istep100 .
close

--> 7) drop2(s)
-- 7.1) c-drop2(s)
open ISTEP
-- arbitrary objects
-- assumptions
  -- eq c-drop2(s) = true .
  eq empty?(fifo2(s)) = false .
-- successor state
  eq s' = drop2(s) .
-- check if the predicate is true.
  red istep100 .
close
--
-- 7.2) not c-drop2(s)
open ISTEP
-- arbitrary objects
-- assumptions
  eq c-drop2(s) = false .
-- successor state
  eq s' = drop2(s) .
-- check if the predicate is true.
  red istep100 .
close

--> 8) dup2(s)
-- 8.1) c-dup2(s)
open ISTEP
-- arbitrary objects
-- assumptions
  -- eq c-dup2(s) = true .
  eq empty?(fifo2(s)) = false .
-- successor state
  eq s' = dup2(s) .
-- check if the predicate is true.
  red istep100 .
close
--
-- 8.2) not c-dup2(s)
open ISTEP
-- arbitrary objects
-- assumptions
  eq c-dup2(s) = false .
-- successor state
  eq s' = dup2(s) .
-- check if the predicate is true.
  red istep100 .
close

--> Q.E.D.