We consider termination of the MSTRS with no additional rule schemes:

  Signature: a :: o
             b :: o
             f :: o -> o -> o -> o
             g :: o -> o

  Rules: f(x, a, y) -> f(b, x, g(y))

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, i, c), where:

  P1. (1) f#(x, a, y) => f#(b, x, g(y))

***** We apply the Reduction Pair [with HORPO] Processor on D1 = (P1, R, i, c).

Constrained HORPO yields:

  f#(x, a, y) (>) f#(b, x, g(y))
  f(x, a, y) (>=) f(b, x, g(y))

We do this using the following settings:

* Disregarded arguments:

  f# 3 
  g  1 

* Precedence and permutation:

    a   { }
  > b   { }
  = f#  { 1 2 }
  = f   { 1 2 3 }
  = g   { }

* Well-founded theory orderings:

  [>]_{Bool} = {(true,false)}
  [>]_{Int}  = {(x,y) | x < 1000 /\ x < y }

All dependency pairs were removed.

Processor output: { }.