We consider universal computability of the STRS with no additional rule schemes:

  Signature: 0     :: nat
             false :: bool
             h     :: (nat -> bool) -> (nat -> nat) -> nat -> nat
             if    :: bool -> nat -> nat -> nat
             s     :: nat -> nat
             true  :: bool

  Rules: if(true, X, Y) -> X
         if(false, X, Y) -> Y
         h(F, G, 0) -> 0
         h(F, G, s(Y)) -> G(h(F, G, if(F(Y), Y, 0)))

The system is accessible function passing by a sort ordering that equates all sorts.

We start by computing the initial DP problem D1 = (P1, R UNION R_?, i, c), where:

  P1. (1) h#(F, G, s(Y)) => if#(F(Y), Y, 0)
      (2) h#(F, G, s(Y)) => h#(F, G, if(F(Y), Y, 0))

***** We apply the Graph Processor on D1 = (P1, R UNION R_?, i, c).

We compute a graph approximation with the following edges:

  1:
  2: 1 2 

There is only one SCC, so all DPs not inside the SCC can be removed.

Processor output: { D2 = (P2, R UNION R_?, i, c) }, where:

  P2. (1) h#(F, G, s(Y)) => h#(F, G, if(F(Y), Y, 0))

***** No progress could be made on DP problem D2 = (P2, R UNION R_?, i, c).