Termination w.r.t. Q proof of ../tpdb/secret2007/aprove/aprove10.trs

YES Termination w.r.t. Q proof of ../tpdb/secret2007/aprove/aprove10.trs
Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

lessElements(l, t) → lessE(l, t, 0)
lessE(l, t, n) → if(le(length(l), n), le(length(toList(t)), n), l, t, n)
if(true, b, l, t, n) → l
if(false, true, l, t, n) → t
if(false, false, l, t, n) → lessE(l, t, s(n))
length(nil) → 0
length(cons(n, l)) → s(length(l))
toList(leaf) → nil
toList(node(t1, n, t2)) → append(toList(t1), cons(n, toList(t2)))
append(nil, l2) → l2
append(cons(n, l1), l2) → cons(n, append(l1, l2))
le(s(n), 0) → false
le(0, m) → true
le(s(n), s(m)) → le(n, m)
a → c
a → d

Q is empty.

↳ QTRS

  ↳ AAECC Innermost

Q restricted rewrite system:
The TRS R consists of the following rules:

lessElements(l, t) → lessE(l, t, 0)
lessE(l, t, n) → if(le(length(l), n), le(length(toList(t)), n), l, t, n)
if(true, b, l, t, n) → l
if(false, true, l, t, n) → t
if(false, false, l, t, n) → lessE(l, t, s(n))
length(nil) → 0
length(cons(n, l)) → s(length(l))
toList(leaf) → nil
toList(node(t1, n, t2)) → append(toList(t1), cons(n, toList(t2)))
append(nil, l2) → l2
append(cons(n, l1), l2) → cons(n, append(l1, l2))
le(s(n), 0) → false
le(0, m) → true
le(s(n), s(m)) → le(n, m)
a → c
a → d

Q is empty.

We have applied [19,8] to switch to innermost. The TRS R 1 is

if(true, b, l, t, n) → l
if(false, true, l, t, n) → t
if(false, false, l, t, n) → lessE(l, t, s(n))
length(nil) → 0
length(cons(n, l)) → s(length(l))
toList(leaf) → nil
toList(node(t1, n, t2)) → append(toList(t1), cons(n, toList(t2)))
append(nil, l2) → l2
append(cons(n, l1), l2) → cons(n, append(l1, l2))
le(s(n), 0) → false
le(0, m) → true
le(s(n), s(m)) → le(n, m)
lessElements(l, t) → lessE(l, t, 0)
lessE(l, t, n) → if(le(length(l), n), le(length(toList(t)), n), l, t, n)

The TRS R 2 is

a → c
a → d

The signature Sigma is {d, a, c}

↳ QTRS

  ↳ AAECC Innermost

    ↳ QTRS

      ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

lessElements(l, t) → lessE(l, t, 0)
lessE(l, t, n) → if(le(length(l), n), le(length(toList(t)), n), l, t, n)
if(true, b, l, t, n) → l
if(false, true, l, t, n) → t
if(false, false, l, t, n) → lessE(l, t, s(n))
length(nil) → 0
length(cons(n, l)) → s(length(l))
toList(leaf) → nil
toList(node(t1, n, t2)) → append(toList(t1), cons(n, toList(t2)))
append(nil, l2) → l2
append(cons(n, l1), l2) → cons(n, append(l1, l2))
le(s(n), 0) → false
le(0, m) → true
le(s(n), s(m)) → le(n, m)
a → c
a → d

The set Q consists of the following terms:

lessElements(x0, x1)
lessE(x0, x1, x2)
if(true, x0, x1, x2, x3)
if(false, true, x0, x1, x2)
if(false, false, x0, x1, x2)
length(nil)
length(cons(x0, x1))
toList(leaf)
toList(node(x0, x1, x2))
append(nil, x0)
append(cons(x0, x1), x2)
le(s(x0), 0)
le(0, x0)
le(s(x0), s(x1))
a

Using Dependency Pairs [1,15] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

LESSE(l, t, n) → TOLIST(t)
TOLIST(node(t1, n, t2)) → TOLIST(t2)
LESSE(l, t, n) → LENGTH(toList(t))
LESSE(l, t, n) → IF(le(length(l), n), le(length(toList(t)), n), l, t, n)
LENGTH(cons(n, l)) → LENGTH(l)
LESSELEMENTS(l, t) → LESSE(l, t, 0)
TOLIST(node(t1, n, t2)) → TOLIST(t1)
IF(false, false, l, t, n) → LESSE(l, t, s(n))
TOLIST(node(t1, n, t2)) → APPEND(toList(t1), cons(n, toList(t2)))
LE(s(n), s(m)) → LE(n, m)
LESSE(l, t, n) → LE(length(l), n)
APPEND(cons(n, l1), l2) → APPEND(l1, l2)
LESSE(l, t, n) → LENGTH(l)
LESSE(l, t, n) → LE(length(toList(t)), n)

The TRS R consists of the following rules:

lessElements(l, t) → lessE(l, t, 0)
lessE(l, t, n) → if(le(length(l), n), le(length(toList(t)), n), l, t, n)
if(true, b, l, t, n) → l
if(false, true, l, t, n) → t
if(false, false, l, t, n) → lessE(l, t, s(n))
length(nil) → 0
length(cons(n, l)) → s(length(l))
toList(leaf) → nil
toList(node(t1, n, t2)) → append(toList(t1), cons(n, toList(t2)))
append(nil, l2) → l2
append(cons(n, l1), l2) → cons(n, append(l1, l2))
le(s(n), 0) → false
le(0, m) → true
le(s(n), s(m)) → le(n, m)
a → c
a → d

The set Q consists of the following terms:

lessElements(x0, x1)
lessE(x0, x1, x2)
if(true, x0, x1, x2, x3)
if(false, true, x0, x1, x2)
if(false, false, x0, x1, x2)
length(nil)
length(cons(x0, x1))
toList(leaf)
toList(node(x0, x1, x2))
append(nil, x0)
append(cons(x0, x1), x2)
le(s(x0), 0)
le(0, x0)
le(s(x0), s(x1))
a

We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ AAECC Innermost

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

LESSE(l, t, n) → TOLIST(t)
TOLIST(node(t1, n, t2)) → TOLIST(t2)
LESSE(l, t, n) → LENGTH(toList(t))
LESSE(l, t, n) → IF(le(length(l), n), le(length(toList(t)), n), l, t, n)
LENGTH(cons(n, l)) → LENGTH(l)
LESSELEMENTS(l, t) → LESSE(l, t, 0)
TOLIST(node(t1, n, t2)) → TOLIST(t1)
IF(false, false, l, t, n) → LESSE(l, t, s(n))
TOLIST(node(t1, n, t2)) → APPEND(toList(t1), cons(n, toList(t2)))
LE(s(n), s(m)) → LE(n, m)
LESSE(l, t, n) → LE(length(l), n)
APPEND(cons(n, l1), l2) → APPEND(l1, l2)
LESSE(l, t, n) → LENGTH(l)
LESSE(l, t, n) → LE(length(toList(t)), n)

The TRS R consists of the following rules:

lessElements(l, t) → lessE(l, t, 0)
lessE(l, t, n) → if(le(length(l), n), le(length(toList(t)), n), l, t, n)
if(true, b, l, t, n) → l
if(false, true, l, t, n) → t
if(false, false, l, t, n) → lessE(l, t, s(n))
length(nil) → 0
length(cons(n, l)) → s(length(l))
toList(leaf) → nil
toList(node(t1, n, t2)) → append(toList(t1), cons(n, toList(t2)))
append(nil, l2) → l2
append(cons(n, l1), l2) → cons(n, append(l1, l2))
le(s(n), 0) → false
le(0, m) → true
le(s(n), s(m)) → le(n, m)
a → c
a → d

The set Q consists of the following terms:

lessElements(x0, x1)
lessE(x0, x1, x2)
if(true, x0, x1, x2, x3)
if(false, true, x0, x1, x2)
if(false, false, x0, x1, x2)
length(nil)
length(cons(x0, x1))
toList(leaf)
toList(node(x0, x1, x2))
append(nil, x0)
append(cons(x0, x1), x2)
le(s(x0), 0)
le(0, x0)
le(s(x0), s(x1))
a

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 5 SCCs with 7 less nodes.

↳ QTRS

  ↳ AAECC Innermost

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

                ↳ UsableRulesProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

LE(s(n), s(m)) → LE(n, m)

The TRS R consists of the following rules:

lessElements(l, t) → lessE(l, t, 0)
lessE(l, t, n) → if(le(length(l), n), le(length(toList(t)), n), l, t, n)
if(true, b, l, t, n) → l
if(false, true, l, t, n) → t
if(false, false, l, t, n) → lessE(l, t, s(n))
length(nil) → 0
length(cons(n, l)) → s(length(l))
toList(leaf) → nil
toList(node(t1, n, t2)) → append(toList(t1), cons(n, toList(t2)))
append(nil, l2) → l2
append(cons(n, l1), l2) → cons(n, append(l1, l2))
le(s(n), 0) → false
le(0, m) → true
le(s(n), s(m)) → le(n, m)
a → c
a → d

The set Q consists of the following terms:

lessElements(x0, x1)
lessE(x0, x1, x2)
if(true, x0, x1, x2, x3)
if(false, true, x0, x1, x2)
if(false, false, x0, x1, x2)
length(nil)
length(cons(x0, x1))
toList(leaf)
toList(node(x0, x1, x2))
append(nil, x0)
append(cons(x0, x1), x2)
le(s(x0), 0)
le(0, x0)
le(s(x0), s(x1))
a

We have to consider all minimal (P,Q,R)-chains.
As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [15] we can delete all non-usable rules [17] from R.

↳ QTRS

  ↳ AAECC Innermost

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

                ↳ UsableRulesProof

                  ↳ QDP

                    ↳ QReductionProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

LE(s(n), s(m)) → LE(n, m)

R is empty.
The set Q consists of the following terms:

lessElements(x0, x1)
lessE(x0, x1, x2)
if(true, x0, x1, x2, x3)
if(false, true, x0, x1, x2)
if(false, false, x0, x1, x2)
length(nil)
length(cons(x0, x1))
toList(leaf)
toList(node(x0, x1, x2))
append(nil, x0)
append(cons(x0, x1), x2)
le(s(x0), 0)
le(0, x0)
le(s(x0), s(x1))
a

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

lessElements(x0, x1)
lessE(x0, x1, x2)
if(true, x0, x1, x2, x3)
if(false, true, x0, x1, x2)
if(false, false, x0, x1, x2)
length(nil)
length(cons(x0, x1))
toList(leaf)
toList(node(x0, x1, x2))
append(nil, x0)
append(cons(x0, x1), x2)
le(s(x0), 0)
le(0, x0)
le(s(x0), s(x1))
a

↳ QTRS

  ↳ AAECC Innermost

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

                ↳ UsableRulesProof

                  ↳ QDP

                    ↳ QReductionProof

                      ↳ QDP

                        ↳ QDPSizeChangeProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

LE(s(n), s(m)) → LE(n, m)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

LE(s(n), s(m)) → LE(n, m)
The graph contains the following edges 1 > 1, 2 > 2

↳ QTRS

  ↳ AAECC Innermost

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

                ↳ UsableRulesProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

APPEND(cons(n, l1), l2) → APPEND(l1, l2)

The TRS R consists of the following rules:

lessElements(l, t) → lessE(l, t, 0)
lessE(l, t, n) → if(le(length(l), n), le(length(toList(t)), n), l, t, n)
if(true, b, l, t, n) → l
if(false, true, l, t, n) → t
if(false, false, l, t, n) → lessE(l, t, s(n))
length(nil) → 0
length(cons(n, l)) → s(length(l))
toList(leaf) → nil
toList(node(t1, n, t2)) → append(toList(t1), cons(n, toList(t2)))
append(nil, l2) → l2
append(cons(n, l1), l2) → cons(n, append(l1, l2))
le(s(n), 0) → false
le(0, m) → true
le(s(n), s(m)) → le(n, m)
a → c
a → d

The set Q consists of the following terms:

lessElements(x0, x1)
lessE(x0, x1, x2)
if(true, x0, x1, x2, x3)
if(false, true, x0, x1, x2)
if(false, false, x0, x1, x2)
length(nil)
length(cons(x0, x1))
toList(leaf)
toList(node(x0, x1, x2))
append(nil, x0)
append(cons(x0, x1), x2)
le(s(x0), 0)
le(0, x0)
le(s(x0), s(x1))
a

↳ QTRS

  ↳ AAECC Innermost

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

                ↳ UsableRulesProof

                  ↳ QDP

                    ↳ QReductionProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

APPEND(cons(n, l1), l2) → APPEND(l1, l2)

R is empty.
The set Q consists of the following terms:

lessElements(x0, x1)
lessE(x0, x1, x2)
if(true, x0, x1, x2, x3)
if(false, true, x0, x1, x2)
if(false, false, x0, x1, x2)
length(nil)
length(cons(x0, x1))
toList(leaf)
toList(node(x0, x1, x2))
append(nil, x0)
append(cons(x0, x1), x2)
le(s(x0), 0)
le(0, x0)
le(s(x0), s(x1))
a

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

lessElements(x0, x1)
lessE(x0, x1, x2)
if(true, x0, x1, x2, x3)
if(false, true, x0, x1, x2)
if(false, false, x0, x1, x2)
length(nil)
length(cons(x0, x1))
toList(leaf)
toList(node(x0, x1, x2))
append(nil, x0)
append(cons(x0, x1), x2)
le(s(x0), 0)
le(0, x0)
le(s(x0), s(x1))
a

↳ QTRS

  ↳ AAECC Innermost

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

                ↳ UsableRulesProof

                  ↳ QDP

                    ↳ QReductionProof

                      ↳ QDP

                        ↳ QDPSizeChangeProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

APPEND(cons(n, l1), l2) → APPEND(l1, l2)

From the DPs we obtained the following set of size-change graphs:

APPEND(cons(n, l1), l2) → APPEND(l1, l2)
The graph contains the following edges 1 > 1, 2 >= 2

↳ QTRS

  ↳ AAECC Innermost

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ UsableRulesProof

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

TOLIST(node(t1, n, t2)) → TOLIST(t2)
TOLIST(node(t1, n, t2)) → TOLIST(t1)

The TRS R consists of the following rules:

lessElements(l, t) → lessE(l, t, 0)
lessE(l, t, n) → if(le(length(l), n), le(length(toList(t)), n), l, t, n)
if(true, b, l, t, n) → l
if(false, true, l, t, n) → t
if(false, false, l, t, n) → lessE(l, t, s(n))
length(nil) → 0
length(cons(n, l)) → s(length(l))
toList(leaf) → nil
toList(node(t1, n, t2)) → append(toList(t1), cons(n, toList(t2)))
append(nil, l2) → l2
append(cons(n, l1), l2) → cons(n, append(l1, l2))
le(s(n), 0) → false
le(0, m) → true
le(s(n), s(m)) → le(n, m)
a → c
a → d

The set Q consists of the following terms:

lessElements(x0, x1)
lessE(x0, x1, x2)
if(true, x0, x1, x2, x3)
if(false, true, x0, x1, x2)
if(false, false, x0, x1, x2)
length(nil)
length(cons(x0, x1))
toList(leaf)
toList(node(x0, x1, x2))
append(nil, x0)
append(cons(x0, x1), x2)
le(s(x0), 0)
le(0, x0)
le(s(x0), s(x1))
a

↳ QTRS

  ↳ AAECC Innermost

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ UsableRulesProof

                  ↳ QDP

                    ↳ QReductionProof

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

TOLIST(node(t1, n, t2)) → TOLIST(t2)
TOLIST(node(t1, n, t2)) → TOLIST(t1)

R is empty.
The set Q consists of the following terms:

lessElements(x0, x1)
lessE(x0, x1, x2)
if(true, x0, x1, x2, x3)
if(false, true, x0, x1, x2)
if(false, false, x0, x1, x2)
length(nil)
length(cons(x0, x1))
toList(leaf)
toList(node(x0, x1, x2))
append(nil, x0)
append(cons(x0, x1), x2)
le(s(x0), 0)
le(0, x0)
le(s(x0), s(x1))
a

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

lessElements(x0, x1)
lessE(x0, x1, x2)
if(true, x0, x1, x2, x3)
if(false, true, x0, x1, x2)
if(false, false, x0, x1, x2)
length(nil)
length(cons(x0, x1))
toList(leaf)
toList(node(x0, x1, x2))
append(nil, x0)
append(cons(x0, x1), x2)
le(s(x0), 0)
le(0, x0)
le(s(x0), s(x1))
a

↳ QTRS

  ↳ AAECC Innermost

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ UsableRulesProof

                  ↳ QDP

                    ↳ QReductionProof

                      ↳ QDP

                        ↳ QDPSizeChangeProof

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

TOLIST(node(t1, n, t2)) → TOLIST(t2)
TOLIST(node(t1, n, t2)) → TOLIST(t1)

From the DPs we obtained the following set of size-change graphs:

TOLIST(node(t1, n, t2)) → TOLIST(t2)
The graph contains the following edges 1 > 1
TOLIST(node(t1, n, t2)) → TOLIST(t1)
The graph contains the following edges 1 > 1

↳ QTRS

  ↳ AAECC Innermost

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ UsableRulesProof

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

LENGTH(cons(n, l)) → LENGTH(l)

The TRS R consists of the following rules:

lessElements(l, t) → lessE(l, t, 0)
lessE(l, t, n) → if(le(length(l), n), le(length(toList(t)), n), l, t, n)
if(true, b, l, t, n) → l
if(false, true, l, t, n) → t
if(false, false, l, t, n) → lessE(l, t, s(n))
length(nil) → 0
length(cons(n, l)) → s(length(l))
toList(leaf) → nil
toList(node(t1, n, t2)) → append(toList(t1), cons(n, toList(t2)))
append(nil, l2) → l2
append(cons(n, l1), l2) → cons(n, append(l1, l2))
le(s(n), 0) → false
le(0, m) → true
le(s(n), s(m)) → le(n, m)
a → c
a → d

The set Q consists of the following terms:

lessElements(x0, x1)
lessE(x0, x1, x2)
if(true, x0, x1, x2, x3)
if(false, true, x0, x1, x2)
if(false, false, x0, x1, x2)
length(nil)
length(cons(x0, x1))
toList(leaf)
toList(node(x0, x1, x2))
append(nil, x0)
append(cons(x0, x1), x2)
le(s(x0), 0)
le(0, x0)
le(s(x0), s(x1))
a

↳ QTRS

  ↳ AAECC Innermost

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ UsableRulesProof

                  ↳ QDP

                    ↳ QReductionProof

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

LENGTH(cons(n, l)) → LENGTH(l)

R is empty.
The set Q consists of the following terms:

lessElements(x0, x1)
lessE(x0, x1, x2)
if(true, x0, x1, x2, x3)
if(false, true, x0, x1, x2)
if(false, false, x0, x1, x2)
length(nil)
length(cons(x0, x1))
toList(leaf)
toList(node(x0, x1, x2))
append(nil, x0)
append(cons(x0, x1), x2)
le(s(x0), 0)
le(0, x0)
le(s(x0), s(x1))
a

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

lessElements(x0, x1)
lessE(x0, x1, x2)
if(true, x0, x1, x2, x3)
if(false, true, x0, x1, x2)
if(false, false, x0, x1, x2)
length(nil)
length(cons(x0, x1))
toList(leaf)
toList(node(x0, x1, x2))
append(nil, x0)
append(cons(x0, x1), x2)
le(s(x0), 0)
le(0, x0)
le(s(x0), s(x1))
a

↳ QTRS

  ↳ AAECC Innermost

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ UsableRulesProof

                  ↳ QDP

                    ↳ QReductionProof

                      ↳ QDP

                        ↳ QDPSizeChangeProof

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

LENGTH(cons(n, l)) → LENGTH(l)

From the DPs we obtained the following set of size-change graphs:

LENGTH(cons(n, l)) → LENGTH(l)
The graph contains the following edges 1 > 1

↳ QTRS

  ↳ AAECC Innermost

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ UsableRulesProof

Q DP problem:
The TRS P consists of the following rules:

IF(false, false, l, t, n) → LESSE(l, t, s(n))
LESSE(l, t, n) → IF(le(length(l), n), le(length(toList(t)), n), l, t, n)

The TRS R consists of the following rules:

lessElements(l, t) → lessE(l, t, 0)
lessE(l, t, n) → if(le(length(l), n), le(length(toList(t)), n), l, t, n)
if(true, b, l, t, n) → l
if(false, true, l, t, n) → t
if(false, false, l, t, n) → lessE(l, t, s(n))
length(nil) → 0
length(cons(n, l)) → s(length(l))
toList(leaf) → nil
toList(node(t1, n, t2)) → append(toList(t1), cons(n, toList(t2)))
append(nil, l2) → l2
append(cons(n, l1), l2) → cons(n, append(l1, l2))
le(s(n), 0) → false
le(0, m) → true
le(s(n), s(m)) → le(n, m)
a → c
a → d

The set Q consists of the following terms:

lessElements(x0, x1)
lessE(x0, x1, x2)
if(true, x0, x1, x2, x3)
if(false, true, x0, x1, x2)
if(false, false, x0, x1, x2)
length(nil)
length(cons(x0, x1))
toList(leaf)
toList(node(x0, x1, x2))
append(nil, x0)
append(cons(x0, x1), x2)
le(s(x0), 0)
le(0, x0)
le(s(x0), s(x1))
a

↳ QTRS

  ↳ AAECC Innermost

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ UsableRulesProof

                  ↳ QDP

                    ↳ QReductionProof

Q DP problem:
The TRS P consists of the following rules:

IF(false, false, l, t, n) → LESSE(l, t, s(n))
LESSE(l, t, n) → IF(le(length(l), n), le(length(toList(t)), n), l, t, n)

The TRS R consists of the following rules:

length(nil) → 0
length(cons(n, l)) → s(length(l))
le(s(n), 0) → false
le(0, m) → true
le(s(n), s(m)) → le(n, m)
toList(leaf) → nil
toList(node(t1, n, t2)) → append(toList(t1), cons(n, toList(t2)))
append(nil, l2) → l2
append(cons(n, l1), l2) → cons(n, append(l1, l2))

The set Q consists of the following terms:

lessElements(x0, x1)
lessE(x0, x1, x2)
if(true, x0, x1, x2, x3)
if(false, true, x0, x1, x2)
if(false, false, x0, x1, x2)
length(nil)
length(cons(x0, x1))
toList(leaf)
toList(node(x0, x1, x2))
append(nil, x0)
append(cons(x0, x1), x2)
le(s(x0), 0)
le(0, x0)
le(s(x0), s(x1))
a

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

lessElements(x0, x1)
lessE(x0, x1, x2)
if(true, x0, x1, x2, x3)
if(false, true, x0, x1, x2)
if(false, false, x0, x1, x2)
a

↳ QTRS

  ↳ AAECC Innermost

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ UsableRulesProof

                  ↳ QDP

                    ↳ QReductionProof

                      ↳ QDP

                        ↳ NonInfProof

Q DP problem:
The TRS P consists of the following rules:

IF(false, false, l, t, n) → LESSE(l, t, s(n))
LESSE(l, t, n) → IF(le(length(l), n), le(length(toList(t)), n), l, t, n)

The TRS R consists of the following rules:

length(nil) → 0
length(cons(n, l)) → s(length(l))
le(s(n), 0) → false
le(0, m) → true
le(s(n), s(m)) → le(n, m)
toList(leaf) → nil
toList(node(t1, n, t2)) → append(toList(t1), cons(n, toList(t2)))
append(nil, l2) → l2
append(cons(n, l1), l2) → cons(n, append(l1, l2))

The set Q consists of the following terms:

length(nil)
length(cons(x0, x1))
toList(leaf)
toList(node(x0, x1, x2))
append(nil, x0)
append(cons(x0, x1), x2)
le(s(x0), 0)
le(0, x0)
le(s(x0), s(x1))

We have to consider all minimal (P,Q,R)-chains.
The DP Problem is simplified using the Induction Calculus [18] with the following steps:
Note that final constraints are written in bold face.

For Pair IF(false, false, l, t, n) → LESSE(l, t, s(n)) the following chains were created:

We consider the chain LESSE(l, t, n) → IF(le(length(l), n), le(length(toList(t)), n), l, t, n), IF(false, false, l, t, n) → LESSE(l, t, s(n)) which results in the following constraint:
(1)    (IF(le(length(x3), x5), le(length(toList(x4)), x5), x3, x4, x5)=IF(false, false, x6, x7, x8) ⇒ IF(false, false, x6, x7, x8)≥LESSE(x6, x7, s(x8)))

We simplified constraint (1) using rules (I), (II), (III), (IV), (VII) which results in the following new constraint:
(2)    (length(x3)=x18∧le(x18, x5)=false∧length(x20)=x19∧le(x19, x5)=false ⇒ IF(false, false, x3, x4, x5)≥LESSE(x3, x4, s(x5)))

We simplified constraint (2) using rule (V) (with possible (I) afterwards) using induction on le(x18, x5)=false which results in the following new constraints:
(3)    (false=false∧length(x3)=s(x21)∧length(x20)=x19∧le(x19, 0)=false ⇒ IF(false, false, x3, x4, 0)≥LESSE(x3, x4, s(0)))

(4)    (le(x23, x24)=false∧length(x3)=s(x23)∧length(x20)=x19∧le(x19, s(x24))=false∧(∀x25,x26,x27,x28:le(x23, x24)=false∧length(x25)=x23∧length(x26)=x27∧le(x27, x24)=false ⇒ IF(false, false, x25, x28, x24)≥LESSE(x25, x28, s(x24))) ⇒ IF(false, false, x3, x4, s(x24))≥LESSE(x3, x4, s(s(x24))))

We simplified constraint (3) using rules (I), (II), (VII) which results in the following new constraint:
(5)    (length(x3)=s(x21)∧length(x20)=x19∧0=x29∧le(x19, x29)=false ⇒ IF(false, false, x3, x4, 0)≥LESSE(x3, x4, s(0)))

We simplified constraint (4) using rule (VII) which results in the following new constraint:
(6)    (le(x23, x24)=false∧length(x3)=s(x23)∧length(x20)=x19∧s(x24)=x54∧le(x19, x54)=false∧(∀x25,x26,x27,x28:le(x23, x24)=false∧length(x25)=x23∧length(x26)=x27∧le(x27, x24)=false ⇒ IF(false, false, x25, x28, x24)≥LESSE(x25, x28, s(x24))) ⇒ IF(false, false, x3, x4, s(x24))≥LESSE(x3, x4, s(s(x24))))

We simplified constraint (5) using rule (V) (with possible (I) afterwards) using induction on le(x19, x29)=false which results in the following new constraints:
(7)    (false=false∧length(x3)=s(x21)∧length(x20)=s(x30)∧0=0 ⇒ IF(false, false, x3, x4, 0)≥LESSE(x3, x4, s(0)))

(8)    (le(x32, x33)=false∧length(x3)=s(x21)∧length(x20)=s(x32)∧0=s(x33)∧(∀x34,x35,x36,x37:le(x32, x33)=false∧length(x34)=s(x35)∧length(x36)=x32∧0=x33 ⇒ IF(false, false, x34, x37, 0)≥LESSE(x34, x37, s(0))) ⇒ IF(false, false, x3, x4, 0)≥LESSE(x3, x4, s(0)))

We simplified constraint (7) using rules (I), (II) which results in the following new constraint:
(9)    (length(x3)=s(x21)∧length(x20)=s(x30) ⇒ IF(false, false, x3, x4, 0)≥LESSE(x3, x4, s(0)))

We solved constraint (8) using rules (I), (II).We simplified constraint (9) using rule (V) (with possible (I) afterwards) using induction on length(x3)=s(x21) which results in the following new constraint:
(10)    (s(length(x39))=s(x21)∧length(x20)=s(x30)∧(∀x40,x41,x42,x43:length(x39)=s(x40)∧length(x41)=s(x42) ⇒ IF(false, false, x39, x43, 0)≥LESSE(x39, x43, s(0))) ⇒ IF(false, false, cons(x38, x39), x4, 0)≥LESSE(cons(x38, x39), x4, s(0)))

We simplified constraint (10) using rules (I), (II), (IV) which results in the following new constraint:
(11)    (length(x20)=s(x30)∧(∀x40,x41,x42,x43:length(x39)=s(x40)∧length(x41)=s(x42) ⇒ IF(false, false, x39, x43, 0)≥LESSE(x39, x43, s(0))) ⇒ IF(false, false, cons(x38, x39), x4, 0)≥LESSE(cons(x38, x39), x4, s(0)))

We simplified constraint (11) using rule (V) (with possible (I) afterwards) using induction on length(x20)=s(x30) which results in the following new constraint:
(12)    (s(length(x45))=s(x30)∧(∀x40,x41,x42,x43:length(x39)=s(x40)∧length(x41)=s(x42) ⇒ IF(false, false, x39, x43, 0)≥LESSE(x39, x43, s(0)))∧(∀x46,x47,x48,x49,x50,x51,x52,x53:length(x45)=s(x46)∧(∀x48,x49,x50,x51:length(x47)=s(x48)∧length(x49)=s(x50) ⇒ IF(false, false, x47, x51, 0)≥LESSE(x47, x51, s(0))) ⇒ IF(false, false, cons(x52, x47), x53, 0)≥LESSE(cons(x52, x47), x53, s(0))) ⇒ IF(false, false, cons(x38, x39), x4, 0)≥LESSE(cons(x38, x39), x4, s(0)))

We simplified constraint (12) using rules (I), (II), (IV) which results in the following new constraint:
(13)    (IF(false, false, cons(x38, x39), x4, 0)≥LESSE(cons(x38, x39), x4, s(0)))

We simplified constraint (6) using rule (V) (with possible (I) afterwards) using induction on le(x19, x54)=false which results in the following new constraints:
(14)    (false=false∧le(x23, x24)=false∧length(x3)=s(x23)∧length(x20)=s(x55)∧s(x24)=0∧(∀x25,x26,x27,x28:le(x23, x24)=false∧length(x25)=x23∧length(x26)=x27∧le(x27, x24)=false ⇒ IF(false, false, x25, x28, x24)≥LESSE(x25, x28, s(x24))) ⇒ IF(false, false, x3, x4, s(x24))≥LESSE(x3, x4, s(s(x24))))

(15)    (le(x57, x58)=false∧le(x23, x24)=false∧length(x3)=s(x23)∧length(x20)=s(x57)∧s(x24)=s(x58)∧(∀x25,x26,x27,x28:le(x23, x24)=false∧length(x25)=x23∧length(x26)=x27∧le(x27, x24)=false ⇒ IF(false, false, x25, x28, x24)≥LESSE(x25, x28, s(x24)))∧(∀x59,x60,x61,x62,x63,x64,x65,x66,x67:le(x57, x58)=false∧le(x59, x60)=false∧length(x61)=s(x59)∧length(x62)=x57∧s(x60)=x58∧(∀x63,x64,x65,x66:le(x59, x60)=false∧length(x63)=x59∧length(x64)=x65∧le(x65, x60)=false ⇒ IF(false, false, x63, x66, x60)≥LESSE(x63, x66, s(x60))) ⇒ IF(false, false, x61, x67, s(x60))≥LESSE(x61, x67, s(s(x60)))) ⇒ IF(false, false, x3, x4, s(x24))≥LESSE(x3, x4, s(s(x24))))

We solved constraint (14) using rules (I), (II).We simplified constraint (15) using rules (I), (II), (III) which results in the following new constraint:
(16)    (le(x57, x58)=false∧le(x23, x58)=false∧length(x3)=s(x23)∧length(x20)=s(x57)∧(∀x25,x26,x27,x28:le(x23, x58)=false∧length(x25)=x23∧length(x26)=x27∧le(x27, x58)=false ⇒ IF(false, false, x25, x28, x58)≥LESSE(x25, x28, s(x58)))∧(∀x59,x60,x61,x62,x63,x64,x65,x66,x67:le(x57, x58)=false∧le(x59, x60)=false∧length(x61)=s(x59)∧length(x62)=x57∧s(x60)=x58∧(∀x63,x64,x65,x66:le(x59, x60)=false∧length(x63)=x59∧length(x64)=x65∧le(x65, x60)=false ⇒ IF(false, false, x63, x66, x60)≥LESSE(x63, x66, s(x60))) ⇒ IF(false, false, x61, x67, s(x60))≥LESSE(x61, x67, s(s(x60)))) ⇒ IF(false, false, x3, x4, s(x58))≥LESSE(x3, x4, s(s(x58))))

We simplified constraint (16) using rule (V) (with possible (I) afterwards) using induction on length(x3)=s(x23) which results in the following new constraint:
(17)    (s(length(x69))=s(x23)∧le(x57, x58)=false∧le(x23, x58)=false∧length(x20)=s(x57)∧(∀x25,x26,x27,x28:le(x23, x58)=false∧length(x25)=x23∧length(x26)=x27∧le(x27, x58)=false ⇒ IF(false, false, x25, x28, x58)≥LESSE(x25, x28, s(x58)))∧(∀x59,x60,x61,x62,x63,x64,x65,x66,x67:le(x57, x58)=false∧le(x59, x60)=false∧length(x61)=s(x59)∧length(x62)=x57∧s(x60)=x58∧(∀x63,x64,x65,x66:le(x59, x60)=false∧length(x63)=x59∧length(x64)=x65∧le(x65, x60)=false ⇒ IF(false, false, x63, x66, x60)≥LESSE(x63, x66, s(x60))) ⇒ IF(false, false, x61, x67, s(x60))≥LESSE(x61, x67, s(s(x60))))∧(∀x70,x71,x72,x73,x74,x75,x76,x77,x78,x79,x80,x81,x82,x83,x84,x85,x86,x87:length(x69)=s(x70)∧le(x71, x72)=false∧le(x70, x72)=false∧length(x73)=s(x71)∧(∀x74,x75,x76,x77:le(x70, x72)=false∧length(x74)=x70∧length(x75)=x76∧le(x76, x72)=false ⇒ IF(false, false, x74, x77, x72)≥LESSE(x74, x77, s(x72)))∧(∀x78,x79,x80,x81,x82,x83,x84,x85,x86:le(x71, x72)=false∧le(x78, x79)=false∧length(x80)=s(x78)∧length(x81)=x71∧s(x79)=x72∧(∀x82,x83,x84,x85:le(x78, x79)=false∧length(x82)=x78∧length(x83)=x84∧le(x84, x79)=false ⇒ IF(false, false, x82, x85, x79)≥LESSE(x82, x85, s(x79))) ⇒ IF(false, false, x80, x86, s(x79))≥LESSE(x80, x86, s(s(x79)))) ⇒ IF(false, false, x69, x87, s(x72))≥LESSE(x69, x87, s(s(x72)))) ⇒ IF(false, false, cons(x68, x69), x4, s(x58))≥LESSE(cons(x68, x69), x4, s(s(x58))))

We simplified constraint (17) using rules (I), (II) which results in the following new constraint:
(18)    (length(x69)=x23∧le(x57, x58)=false∧le(x23, x58)=false∧length(x20)=s(x57)∧(∀x25,x26,x27,x28:le(x23, x58)=false∧length(x25)=x23∧length(x26)=x27∧le(x27, x58)=false ⇒ IF(false, false, x25, x28, x58)≥LESSE(x25, x28, s(x58)))∧(∀x59,x60,x61,x62,x63,x64,x65,x66,x67:le(x57, x58)=false∧le(x59, x60)=false∧length(x61)=s(x59)∧length(x62)=x57∧s(x60)=x58∧(∀x63,x64,x65,x66:le(x59, x60)=false∧length(x63)=x59∧length(x64)=x65∧le(x65, x60)=false ⇒ IF(false, false, x63, x66, x60)≥LESSE(x63, x66, s(x60))) ⇒ IF(false, false, x61, x67, s(x60))≥LESSE(x61, x67, s(s(x60))))∧(∀x70,x71,x72,x73,x74,x75,x76,x77,x78,x79,x80,x81,x82,x83,x84,x85,x86,x87:length(x69)=s(x70)∧le(x71, x72)=false∧le(x70, x72)=false∧length(x73)=s(x71)∧(∀x74,x75,x76,x77:le(x70, x72)=false∧length(x74)=x70∧length(x75)=x76∧le(x76, x72)=false ⇒ IF(false, false, x74, x77, x72)≥LESSE(x74, x77, s(x72)))∧(∀x78,x79,x80,x81,x82,x83,x84,x85,x86:le(x71, x72)=false∧le(x78, x79)=false∧length(x80)=s(x78)∧length(x81)=x71∧s(x79)=x72∧(∀x82,x83,x84,x85:le(x78, x79)=false∧length(x82)=x78∧length(x83)=x84∧le(x84, x79)=false ⇒ IF(false, false, x82, x85, x79)≥LESSE(x82, x85, s(x79))) ⇒ IF(false, false, x80, x86, s(x79))≥LESSE(x80, x86, s(s(x79)))) ⇒ IF(false, false, x69, x87, s(x72))≥LESSE(x69, x87, s(s(x72)))) ⇒ IF(false, false, cons(x68, x69), x4, s(x58))≥LESSE(cons(x68, x69), x4, s(s(x58))))

We simplified constraint (18) using rule (V) (with possible (I) afterwards) using induction on length(x20)=s(x57) which results in the following new constraint:
(19)    (s(length(x89))=s(x57)∧length(x69)=x23∧le(x57, x58)=false∧le(x23, x58)=false∧(∀x25,x26,x27,x28:le(x23, x58)=false∧length(x25)=x23∧length(x26)=x27∧le(x27, x58)=false ⇒ IF(false, false, x25, x28, x58)≥LESSE(x25, x28, s(x58)))∧(∀x59,x60,x61,x62,x63,x64,x65,x66,x67:le(x57, x58)=false∧le(x59, x60)=false∧length(x61)=s(x59)∧length(x62)=x57∧s(x60)=x58∧(∀x63,x64,x65,x66:le(x59, x60)=false∧length(x63)=x59∧length(x64)=x65∧le(x65, x60)=false ⇒ IF(false, false, x63, x66, x60)≥LESSE(x63, x66, s(x60))) ⇒ IF(false, false, x61, x67, s(x60))≥LESSE(x61, x67, s(s(x60))))∧(∀x70,x71,x72,x73,x74,x75,x76,x77,x78,x79,x80,x81,x82,x83,x84,x85,x86,x87:length(x69)=s(x70)∧le(x71, x72)=false∧le(x70, x72)=false∧length(x73)=s(x71)∧(∀x74,x75,x76,x77:le(x70, x72)=false∧length(x74)=x70∧length(x75)=x76∧le(x76, x72)=false ⇒ IF(false, false, x74, x77, x72)≥LESSE(x74, x77, s(x72)))∧(∀x78,x79,x80,x81,x82,x83,x84,x85,x86:le(x71, x72)=false∧le(x78, x79)=false∧length(x80)=s(x78)∧length(x81)=x71∧s(x79)=x72∧(∀x82,x83,x84,x85:le(x78, x79)=false∧length(x82)=x78∧length(x83)=x84∧le(x84, x79)=false ⇒ IF(false, false, x82, x85, x79)≥LESSE(x82, x85, s(x79))) ⇒ IF(false, false, x80, x86, s(x79))≥LESSE(x80, x86, s(s(x79)))) ⇒ IF(false, false, x69, x87, s(x72))≥LESSE(x69, x87, s(s(x72))))∧(∀x90,x91,x92,x93,x94,x95,x96,x97,x98,x99,x100,x101,x102,x103,x104,x105,x106,x107,x108,x109,x110,x111,x112,x113,x114,x115,x116,x117,x118,x119,x120,x121,x122,x123,x124,x125,x126:length(x89)=s(x90)∧length(x91)=x92∧le(x90, x93)=false∧le(x92, x93)=false∧(∀x94,x95,x96,x97:le(x92, x93)=false∧length(x94)=x92∧length(x95)=x96∧le(x96, x93)=false ⇒ IF(false, false, x94, x97, x93)≥LESSE(x94, x97, s(x93)))∧(∀x98,x99,x100,x101,x102,x103,x104,x105,x106:le(x90, x93)=false∧le(x98, x99)=false∧length(x100)=s(x98)∧length(x101)=x90∧s(x99)=x93∧(∀x102,x103,x104,x105:le(x98, x99)=false∧length(x102)=x98∧length(x103)=x104∧le(x104, x99)=false ⇒ IF(false, false, x102, x105, x99)≥LESSE(x102, x105, s(x99))) ⇒ IF(false, false, x100, x106, s(x99))≥LESSE(x100, x106, s(s(x99))))∧(∀x107,x108,x109,x110,x111,x112,x113,x114,x115,x116,x117,x118,x119,x120,x121,x122,x123,x124:length(x91)=s(x107)∧le(x108, x109)=false∧le(x107, x109)=false∧length(x110)=s(x108)∧(∀x111,x112,x113,x114:le(x107, x109)=false∧length(x111)=x107∧length(x112)=x113∧le(x113, x109)=false ⇒ IF(false, false, x111, x114, x109)≥LESSE(x111, x114, s(x109)))∧(∀x115,x116,x117,x118,x119,x120,x121,x122,x123:le(x108, x109)=false∧le(x115, x116)=false∧length(x117)=s(x115)∧length(x118)=x108∧s(x116)=x109∧(∀x119,x120,x121,x122:le(x115, x116)=false∧length(x119)=x115∧length(x120)=x121∧le(x121, x116)=false ⇒ IF(false, false, x119, x122, x116)≥LESSE(x119, x122, s(x116))) ⇒ IF(false, false, x117, x123, s(x116))≥LESSE(x117, x123, s(s(x116)))) ⇒ IF(false, false, x91, x124, s(x109))≥LESSE(x91, x124, s(s(x109)))) ⇒ IF(false, false, cons(x125, x91), x126, s(x93))≥LESSE(cons(x125, x91), x126, s(s(x93)))) ⇒ IF(false, false, cons(x68, x69), x4, s(x58))≥LESSE(cons(x68, x69), x4, s(s(x58))))

We simplified constraint (19) using rules (I), (II) which results in the following new constraint:
(20)    (length(x89)=x57∧length(x69)=x23∧le(x57, x58)=false∧le(x23, x58)=false∧(∀x25,x26,x27,x28:le(x23, x58)=false∧length(x25)=x23∧length(x26)=x27∧le(x27, x58)=false ⇒ IF(false, false, x25, x28, x58)≥LESSE(x25, x28, s(x58)))∧(∀x59,x60,x61,x62,x63,x64,x65,x66,x67:le(x57, x58)=false∧le(x59, x60)=false∧length(x61)=s(x59)∧length(x62)=x57∧s(x60)=x58∧(∀x63,x64,x65,x66:le(x59, x60)=false∧length(x63)=x59∧length(x64)=x65∧le(x65, x60)=false ⇒ IF(false, false, x63, x66, x60)≥LESSE(x63, x66, s(x60))) ⇒ IF(false, false, x61, x67, s(x60))≥LESSE(x61, x67, s(s(x60))))∧(∀x70,x71,x72,x73,x74,x75,x76,x77,x78,x79,x80,x81,x82,x83,x84,x85,x86,x87:length(x69)=s(x70)∧le(x71, x72)=false∧le(x70, x72)=false∧length(x73)=s(x71)∧(∀x74,x75,x76,x77:le(x70, x72)=false∧length(x74)=x70∧length(x75)=x76∧le(x76, x72)=false ⇒ IF(false, false, x74, x77, x72)≥LESSE(x74, x77, s(x72)))∧(∀x78,x79,x80,x81,x82,x83,x84,x85,x86:le(x71, x72)=false∧le(x78, x79)=false∧length(x80)=s(x78)∧length(x81)=x71∧s(x79)=x72∧(∀x82,x83,x84,x85:le(x78, x79)=false∧length(x82)=x78∧length(x83)=x84∧le(x84, x79)=false ⇒ IF(false, false, x82, x85, x79)≥LESSE(x82, x85, s(x79))) ⇒ IF(false, false, x80, x86, s(x79))≥LESSE(x80, x86, s(s(x79)))) ⇒ IF(false, false, x69, x87, s(x72))≥LESSE(x69, x87, s(s(x72))))∧(∀x90,x91,x92,x93,x94,x95,x96,x97,x98,x99,x100,x101,x102,x103,x104,x105,x106,x107,x108,x109,x110,x111,x112,x113,x114,x115,x116,x117,x118,x119,x120,x121,x122,x123,x124,x125,x126:length(x89)=s(x90)∧length(x91)=x92∧le(x90, x93)=false∧le(x92, x93)=false∧(∀x94,x95,x96,x97:le(x92, x93)=false∧length(x94)=x92∧length(x95)=x96∧le(x96, x93)=false ⇒ IF(false, false, x94, x97, x93)≥LESSE(x94, x97, s(x93)))∧(∀x98,x99,x100,x101,x102,x103,x104,x105,x106:le(x90, x93)=false∧le(x98, x99)=false∧length(x100)=s(x98)∧length(x101)=x90∧s(x99)=x93∧(∀x102,x103,x104,x105:le(x98, x99)=false∧length(x102)=x98∧length(x103)=x104∧le(x104, x99)=false ⇒ IF(false, false, x102, x105, x99)≥LESSE(x102, x105, s(x99))) ⇒ IF(false, false, x100, x106, s(x99))≥LESSE(x100, x106, s(s(x99))))∧(∀x107,x108,x109,x110,x111,x112,x113,x114,x115,x116,x117,x118,x119,x120,x121,x122,x123,x124:length(x91)=s(x107)∧le(x108, x109)=false∧le(x107, x109)=false∧length(x110)=s(x108)∧(∀x111,x112,x113,x114:le(x107, x109)=false∧length(x111)=x107∧length(x112)=x113∧le(x113, x109)=false ⇒ IF(false, false, x111, x114, x109)≥LESSE(x111, x114, s(x109)))∧(∀x115,x116,x117,x118,x119,x120,x121,x122,x123:le(x108, x109)=false∧le(x115, x116)=false∧length(x117)=s(x115)∧length(x118)=x108∧s(x116)=x109∧(∀x119,x120,x121,x122:le(x115, x116)=false∧length(x119)=x115∧length(x120)=x121∧le(x121, x116)=false ⇒ IF(false, false, x119, x122, x116)≥LESSE(x119, x122, s(x116))) ⇒ IF(false, false, x117, x123, s(x116))≥LESSE(x117, x123, s(s(x116)))) ⇒ IF(false, false, x91, x124, s(x109))≥LESSE(x91, x124, s(s(x109)))) ⇒ IF(false, false, cons(x125, x91), x126, s(x93))≥LESSE(cons(x125, x91), x126, s(s(x93)))) ⇒ IF(false, false, cons(x68, x69), x4, s(x58))≥LESSE(cons(x68, x69), x4, s(s(x58))))

We simplified constraint (20) using rule (VI) where we applied the induction hypothesis (∀x25,x26,x27,x28:le(x23, x58)=false∧length(x25)=x23∧length(x26)=x27∧le(x27, x58)=false ⇒ IF(false, false, x25, x28, x58)≥LESSE(x25, x28, s(x58))) with σ = [x27 / x57, x25 / x69, x26 / x89, x28 / x4] which results in the following new constraint:
(21)    (IF(false, false, x69, x4, x58)≥LESSE(x69, x4, s(x58))∧(∀x59,x60,x61,x62,x63,x64,x65,x66,x67:le(x57, x58)=false∧le(x59, x60)=false∧length(x61)=s(x59)∧length(x62)=x57∧s(x60)=x58∧(∀x63,x64,x65,x66:le(x59, x60)=false∧length(x63)=x59∧length(x64)=x65∧le(x65, x60)=false ⇒ IF(false, false, x63, x66, x60)≥LESSE(x63, x66, s(x60))) ⇒ IF(false, false, x61, x67, s(x60))≥LESSE(x61, x67, s(s(x60))))∧(∀x70,x71,x72,x73,x74,x75,x76,x77,x78,x79,x80,x81,x82,x83,x84,x85,x86,x87:length(x69)=s(x70)∧le(x71, x72)=false∧le(x70, x72)=false∧length(x73)=s(x71)∧(∀x74,x75,x76,x77:le(x70, x72)=false∧length(x74)=x70∧length(x75)=x76∧le(x76, x72)=false ⇒ IF(false, false, x74, x77, x72)≥LESSE(x74, x77, s(x72)))∧(∀x78,x79,x80,x81,x82,x83,x84,x85,x86:le(x71, x72)=false∧le(x78, x79)=false∧length(x80)=s(x78)∧length(x81)=x71∧s(x79)=x72∧(∀x82,x83,x84,x85:le(x78, x79)=false∧length(x82)=x78∧length(x83)=x84∧le(x84, x79)=false ⇒ IF(false, false, x82, x85, x79)≥LESSE(x82, x85, s(x79))) ⇒ IF(false, false, x80, x86, s(x79))≥LESSE(x80, x86, s(s(x79)))) ⇒ IF(false, false, x69, x87, s(x72))≥LESSE(x69, x87, s(s(x72))))∧(∀x90,x91,x92,x93,x94,x95,x96,x97,x98,x99,x100,x101,x102,x103,x104,x105,x106,x107,x108,x109,x110,x111,x112,x113,x114,x115,x116,x117,x118,x119,x120,x121,x122,x123,x124,x125,x126:length(x89)=s(x90)∧length(x91)=x92∧le(x90, x93)=false∧le(x92, x93)=false∧(∀x94,x95,x96,x97:le(x92, x93)=false∧length(x94)=x92∧length(x95)=x96∧le(x96, x93)=false ⇒ IF(false, false, x94, x97, x93)≥LESSE(x94, x97, s(x93)))∧(∀x98,x99,x100,x101,x102,x103,x104,x105,x106:le(x90, x93)=false∧le(x98, x99)=false∧length(x100)=s(x98)∧length(x101)=x90∧s(x99)=x93∧(∀x102,x103,x104,x105:le(x98, x99)=false∧length(x102)=x98∧length(x103)=x104∧le(x104, x99)=false ⇒ IF(false, false, x102, x105, x99)≥LESSE(x102, x105, s(x99))) ⇒ IF(false, false, x100, x106, s(x99))≥LESSE(x100, x106, s(s(x99))))∧(∀x107,x108,x109,x110,x111,x112,x113,x114,x115,x116,x117,x118,x119,x120,x121,x122,x123,x124:length(x91)=s(x107)∧le(x108, x109)=false∧le(x107, x109)=false∧length(x110)=s(x108)∧(∀x111,x112,x113,x114:le(x107, x109)=false∧length(x111)=x107∧length(x112)=x113∧le(x113, x109)=false ⇒ IF(false, false, x111, x114, x109)≥LESSE(x111, x114, s(x109)))∧(∀x115,x116,x117,x118,x119,x120,x121,x122,x123:le(x108, x109)=false∧le(x115, x116)=false∧length(x117)=s(x115)∧length(x118)=x108∧s(x116)=x109∧(∀x119,x120,x121,x122:le(x115, x116)=false∧length(x119)=x115∧length(x120)=x121∧le(x121, x116)=false ⇒ IF(false, false, x119, x122, x116)≥LESSE(x119, x122, s(x116))) ⇒ IF(false, false, x117, x123, s(x116))≥LESSE(x117, x123, s(s(x116)))) ⇒ IF(false, false, x91, x124, s(x109))≥LESSE(x91, x124, s(s(x109)))) ⇒ IF(false, false, cons(x125, x91), x126, s(x93))≥LESSE(cons(x125, x91), x126, s(s(x93)))) ⇒ IF(false, false, cons(x68, x69), x4, s(x58))≥LESSE(cons(x68, x69), x4, s(s(x58))))

We simplified constraint (21) using rule (IV) which results in the following new constraint:
(22)    (IF(false, false, x69, x4, x58)≥LESSE(x69, x4, s(x58)) ⇒ IF(false, false, cons(x68, x69), x4, s(x58))≥LESSE(cons(x68, x69), x4, s(s(x58))))

For Pair LESSE(l, t, n) → IF(le(length(l), n), le(length(toList(t)), n), l, t, n) the following chains were created:

We consider the chain IF(false, false, l, t, n) → LESSE(l, t, s(n)), LESSE(l, t, n) → IF(le(length(l), n), le(length(toList(t)), n), l, t, n) which results in the following constraint:
(23) (LESSE(x9, x10, s(x11))=LESSE(x12, x13, x14) ⇒ LESSE(x12, x13, x14)≥IF(le(length(x12), x14), le(length(toList(x13)), x14), x12, x13, x14))

We simplified constraint (23) using rules (I), (II), (III) which results in the following new constraint:
(24) (LESSE(x9, x10, s(x11))≥IF(le(length(x9), s(x11)), le(length(toList(x10)), s(x11)), x9, x10, s(x11)))

To summarize, we get the following constraints P_≥ for the following pairs.

IF(false, false, l, t, n) → LESSE(l, t, s(n))
- (IF(false, false, cons(x38, x39), x4, 0)≥LESSE(cons(x38, x39), x4, s(0)))
- (IF(false, false, x69, x4, x58)≥LESSE(x69, x4, s(x58)) ⇒ IF(false, false, cons(x68, x69), x4, s(x58))≥LESSE(cons(x68, x69), x4, s(s(x58))))
LESSE(l, t, n) → IF(le(length(l), n), le(length(toList(t)), n), l, t, n)
- (LESSE(x9, x10, s(x11))≥IF(le(length(x9), s(x11)), le(length(toList(x10)), s(x11)), x9, x10, s(x11)))

The constraints for P_> respective P_bound are constructed from P_≥ where we just replace every occurence of "t ≥ s" in P_≥ by "t > s" respective "t ≥ c". Here c stands for the fresh constant used for P_bound.
Using the following integer polynomial ordering the resulting constraints can be solved
Polynomial interpretation [18]:

POL(0) = 0
POL(IF(x₁, x₂, x₃, x₄, x₅)) = -1 + x₁ + x₂ + x₃ - x₅
POL(LESSE(x₁, x₂, x₃)) = -1 + x₁ - x₃
POL(append(x₁, x₂)) = 1 + x₂
POL(c) = -2
POL(cons(x₁, x₂)) = 1 + x₂
POL(false) = 0
POL(le(x₁, x₂)) = 0
POL(leaf) = 1
POL(length(x₁)) = 0
POL(nil) = 1
POL(node(x₁, x₂, x₃)) = 1 + x₃
POL(s(x₁)) = 1 + x₁
POL(toList(x₁)) = x₁
POL(true) = 0

The following pairs are in P_>:

IF(false, false, l, t, n) → LESSE(l, t, s(n))

The following pairs are in P_bound:

IF(false, false, l, t, n) → LESSE(l, t, s(n))

The following rules are usable:

le(s(n), 0) → false
le(s(n), s(m)) → le(n, m)
le(0, m) → true

↳ QTRS

  ↳ AAECC Innermost

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ UsableRulesProof

                  ↳ QDP

                    ↳ QReductionProof

                      ↳ QDP

                        ↳ NonInfProof

                          ↳ QDP

                            ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

LESSE(l, t, n) → IF(le(length(l), n), le(length(toList(t)), n), l, t, n)

The TRS R consists of the following rules:

length(nil) → 0
length(cons(n, l)) → s(length(l))
le(s(n), 0) → false
le(0, m) → true
le(s(n), s(m)) → le(n, m)
toList(leaf) → nil
toList(node(t1, n, t2)) → append(toList(t1), cons(n, toList(t2)))
append(nil, l2) → l2
append(cons(n, l1), l2) → cons(n, append(l1, l2))

The set Q consists of the following terms:

length(nil)
length(cons(x0, x1))
toList(leaf)
toList(node(x0, x1, x2))
append(nil, x0)
append(cons(x0, x1), x2)
le(s(x0), 0)
le(0, x0)
le(s(x0), s(x1))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 0 SCCs with 1 less node.