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

We start by computing the following initial DP problem:

  P1. (1) f91#(n) => cond#(n <= 100, n)
      (2) cond#(true, n) => f91#(n + 11)
      (3) cond#(true, n) => f91#(f91(n + 11))

***** We apply the Theory Arguments Processor on P1.

We use the following theory arguments function:

  cond# : [1, 2]
  f91#  : []

This yields the following new DP problems:

  P2. (1) f91#(n) => cond#(n <= 100, n)
      (2) cond#(true, n) => f91#(n + 11) { n }
      (3) cond#(true, n) => f91#(f91(n + 11)) { n }

  P3. (1) cond#(true, n) => f91#(n + 11)
      (2) cond#(true, n) => f91#(f91(n + 11))

***** No progress could be made on DP problem P2.