TIMEOUT
The TRS could not be proven terminating. The proof attempt took 60001 ms.
The following DP Processors were used
Problem 1 was processed with processor DependencyGraph (395ms).
| – Problem 2 remains open; application of the following processors failed [SubtermCriterion (0ms), DependencyGraph (121ms), PolynomialLinearRange4iUR (1623ms), DependencyGraph (84ms), PolynomialLinearRange8NegiUR (4988ms), DependencyGraph (90ms), ReductionPairSAT (2347ms), DependencyGraph (83ms), SizeChangePrinciple (timeout)].
| – Problem 3 remains open; application of the following processors failed [SubtermCriterion (0ms), DependencyGraph (3ms), PolynomialLinearRange4iUR (1251ms), DependencyGraph (1ms), PolynomialLinearRange8NegiUR (7505ms), DependencyGraph (2ms), ReductionPairSAT (1519ms), DependencyGraph (2ms)].
| – Problem 4 remains open; application of the following processors failed [SubtermCriterion (0ms), DependencyGraph (4ms), PolynomialLinearRange4iUR (471ms), DependencyGraph (0ms), PolynomialLinearRange8NegiUR (5ms), DependencyGraph (2ms), ReductionPairSAT (1371ms), DependencyGraph (1ms)].
| – Problem 5 remains open; application of the following processors failed [SubtermCriterion (1ms), DependencyGraph (2ms), PolynomialLinearRange4iUR (350ms), DependencyGraph (0ms), PolynomialLinearRange8NegiUR (5ms), DependencyGraph (1ms), ReductionPairSAT (1539ms), DependencyGraph (0ms)].
The following open problems remain:
Open Dependency Pair Problem 2
Dependency Pairs
| sel#(s(X), cons(Y, Z)) | → | sel#(activate(X), activate(Z)) | | dbl#(s(X)) | → | activate#(X) |
| activate#(n__indx(X1, X2)) | → | indx#(X1, X2) | | activate#(n__from(X)) | → | from#(X) |
| activate#(n__sel(X1, X2)) | → | sel#(X1, X2) | | dbls#(cons(X, Y)) | → | activate#(X) |
| from#(X) | → | activate#(X) | | sel#(s(X), cons(Y, Z)) | → | activate#(Z) |
| indx#(cons(X, Y), Z) | → | activate#(Y) | | activate#(n__dbl(X)) | → | dbl#(X) |
| dbls#(cons(X, Y)) | → | activate#(Y) | | sel#(0, cons(X, Y)) | → | activate#(X) |
| indx#(cons(X, Y), Z) | → | activate#(X) | | sel#(s(X), cons(Y, Z)) | → | activate#(X) |
| indx#(cons(X, Y), Z) | → | activate#(Z) | | activate#(n__dbls(X)) | → | dbls#(X) |
Rewrite Rules
| dbl(0) | → | 0 | | dbl(s(X)) | → | s(n__s(n__dbl(activate(X)))) |
| dbls(nil) | → | nil | | dbls(cons(X, Y)) | → | cons(n__dbl(activate(X)), n__dbls(activate(Y))) |
| sel(0, cons(X, Y)) | → | activate(X) | | sel(s(X), cons(Y, Z)) | → | sel(activate(X), activate(Z)) |
| indx(nil, X) | → | nil | | indx(cons(X, Y), Z) | → | cons(n__sel(activate(X), activate(Z)), n__indx(activate(Y), activate(Z))) |
| from(X) | → | cons(activate(X), n__from(n__s(activate(X)))) | | dbl1(0) | → | 01 |
| dbl1(s(X)) | → | s1(s1(dbl1(activate(X)))) | | sel1(0, cons(X, Y)) | → | activate(X) |
| sel1(s(X), cons(Y, Z)) | → | sel1(activate(X), activate(Z)) | | quote(0) | → | 01 |
| quote(s(X)) | → | s1(quote(activate(X))) | | quote(dbl(X)) | → | dbl1(X) |
| quote(sel(X, Y)) | → | sel1(X, Y) | | s(X) | → | n__s(X) |
| dbl(X) | → | n__dbl(X) | | dbls(X) | → | n__dbls(X) |
| sel(X1, X2) | → | n__sel(X1, X2) | | indx(X1, X2) | → | n__indx(X1, X2) |
| from(X) | → | n__from(X) | | activate(n__s(X)) | → | s(X) |
| activate(n__dbl(X)) | → | dbl(X) | | activate(n__dbls(X)) | → | dbls(X) |
| activate(n__sel(X1, X2)) | → | sel(X1, X2) | | activate(n__indx(X1, X2)) | → | indx(X1, X2) |
| activate(n__from(X)) | → | from(X) | | activate(X) | → | X |
Original Signature
Termination of terms over the following signature is verified: n__indx, s1, n__from, dbl1, dbl, from, 01, n__sel, dbls, activate, n__s, n__dbls, 0, sel1, s, indx, quote, n__dbl, sel, nil, cons
Open Dependency Pair Problem 3
Dependency Pairs
| sel1#(s(X), cons(Y, Z)) | → | sel1#(activate(X), activate(Z)) |
Rewrite Rules
| dbl(0) | → | 0 | | dbl(s(X)) | → | s(n__s(n__dbl(activate(X)))) |
| dbls(nil) | → | nil | | dbls(cons(X, Y)) | → | cons(n__dbl(activate(X)), n__dbls(activate(Y))) |
| sel(0, cons(X, Y)) | → | activate(X) | | sel(s(X), cons(Y, Z)) | → | sel(activate(X), activate(Z)) |
| indx(nil, X) | → | nil | | indx(cons(X, Y), Z) | → | cons(n__sel(activate(X), activate(Z)), n__indx(activate(Y), activate(Z))) |
| from(X) | → | cons(activate(X), n__from(n__s(activate(X)))) | | dbl1(0) | → | 01 |
| dbl1(s(X)) | → | s1(s1(dbl1(activate(X)))) | | sel1(0, cons(X, Y)) | → | activate(X) |
| sel1(s(X), cons(Y, Z)) | → | sel1(activate(X), activate(Z)) | | quote(0) | → | 01 |
| quote(s(X)) | → | s1(quote(activate(X))) | | quote(dbl(X)) | → | dbl1(X) |
| quote(sel(X, Y)) | → | sel1(X, Y) | | s(X) | → | n__s(X) |
| dbl(X) | → | n__dbl(X) | | dbls(X) | → | n__dbls(X) |
| sel(X1, X2) | → | n__sel(X1, X2) | | indx(X1, X2) | → | n__indx(X1, X2) |
| from(X) | → | n__from(X) | | activate(n__s(X)) | → | s(X) |
| activate(n__dbl(X)) | → | dbl(X) | | activate(n__dbls(X)) | → | dbls(X) |
| activate(n__sel(X1, X2)) | → | sel(X1, X2) | | activate(n__indx(X1, X2)) | → | indx(X1, X2) |
| activate(n__from(X)) | → | from(X) | | activate(X) | → | X |
Original Signature
Termination of terms over the following signature is verified: n__indx, s1, n__from, dbl1, dbl, from, 01, n__sel, dbls, activate, n__s, n__dbls, 0, sel1, s, indx, quote, n__dbl, sel, nil, cons
Open Dependency Pair Problem 4
Dependency Pairs
| quote#(s(X)) | → | quote#(activate(X)) |
Rewrite Rules
| dbl(0) | → | 0 | | dbl(s(X)) | → | s(n__s(n__dbl(activate(X)))) |
| dbls(nil) | → | nil | | dbls(cons(X, Y)) | → | cons(n__dbl(activate(X)), n__dbls(activate(Y))) |
| sel(0, cons(X, Y)) | → | activate(X) | | sel(s(X), cons(Y, Z)) | → | sel(activate(X), activate(Z)) |
| indx(nil, X) | → | nil | | indx(cons(X, Y), Z) | → | cons(n__sel(activate(X), activate(Z)), n__indx(activate(Y), activate(Z))) |
| from(X) | → | cons(activate(X), n__from(n__s(activate(X)))) | | dbl1(0) | → | 01 |
| dbl1(s(X)) | → | s1(s1(dbl1(activate(X)))) | | sel1(0, cons(X, Y)) | → | activate(X) |
| sel1(s(X), cons(Y, Z)) | → | sel1(activate(X), activate(Z)) | | quote(0) | → | 01 |
| quote(s(X)) | → | s1(quote(activate(X))) | | quote(dbl(X)) | → | dbl1(X) |
| quote(sel(X, Y)) | → | sel1(X, Y) | | s(X) | → | n__s(X) |
| dbl(X) | → | n__dbl(X) | | dbls(X) | → | n__dbls(X) |
| sel(X1, X2) | → | n__sel(X1, X2) | | indx(X1, X2) | → | n__indx(X1, X2) |
| from(X) | → | n__from(X) | | activate(n__s(X)) | → | s(X) |
| activate(n__dbl(X)) | → | dbl(X) | | activate(n__dbls(X)) | → | dbls(X) |
| activate(n__sel(X1, X2)) | → | sel(X1, X2) | | activate(n__indx(X1, X2)) | → | indx(X1, X2) |
| activate(n__from(X)) | → | from(X) | | activate(X) | → | X |
Original Signature
Termination of terms over the following signature is verified: n__indx, s1, n__from, dbl1, dbl, from, 01, n__sel, dbls, activate, n__s, n__dbls, 0, sel1, s, indx, quote, n__dbl, sel, nil, cons
Open Dependency Pair Problem 5
Dependency Pairs
| dbl1#(s(X)) | → | dbl1#(activate(X)) |
Rewrite Rules
| dbl(0) | → | 0 | | dbl(s(X)) | → | s(n__s(n__dbl(activate(X)))) |
| dbls(nil) | → | nil | | dbls(cons(X, Y)) | → | cons(n__dbl(activate(X)), n__dbls(activate(Y))) |
| sel(0, cons(X, Y)) | → | activate(X) | | sel(s(X), cons(Y, Z)) | → | sel(activate(X), activate(Z)) |
| indx(nil, X) | → | nil | | indx(cons(X, Y), Z) | → | cons(n__sel(activate(X), activate(Z)), n__indx(activate(Y), activate(Z))) |
| from(X) | → | cons(activate(X), n__from(n__s(activate(X)))) | | dbl1(0) | → | 01 |
| dbl1(s(X)) | → | s1(s1(dbl1(activate(X)))) | | sel1(0, cons(X, Y)) | → | activate(X) |
| sel1(s(X), cons(Y, Z)) | → | sel1(activate(X), activate(Z)) | | quote(0) | → | 01 |
| quote(s(X)) | → | s1(quote(activate(X))) | | quote(dbl(X)) | → | dbl1(X) |
| quote(sel(X, Y)) | → | sel1(X, Y) | | s(X) | → | n__s(X) |
| dbl(X) | → | n__dbl(X) | | dbls(X) | → | n__dbls(X) |
| sel(X1, X2) | → | n__sel(X1, X2) | | indx(X1, X2) | → | n__indx(X1, X2) |
| from(X) | → | n__from(X) | | activate(n__s(X)) | → | s(X) |
| activate(n__dbl(X)) | → | dbl(X) | | activate(n__dbls(X)) | → | dbls(X) |
| activate(n__sel(X1, X2)) | → | sel(X1, X2) | | activate(n__indx(X1, X2)) | → | indx(X1, X2) |
| activate(n__from(X)) | → | from(X) | | activate(X) | → | X |
Original Signature
Termination of terms over the following signature is verified: n__indx, s1, n__from, dbl1, dbl, from, 01, n__sel, dbls, activate, n__s, n__dbls, 0, sel1, s, indx, quote, n__dbl, sel, nil, cons
Problem 1: DependencyGraph
Dependency Pair Problem
Dependency Pairs
| dbl#(s(X)) | → | s#(n__s(n__dbl(activate(X)))) | | dbl#(s(X)) | → | activate#(X) |
| activate#(n__indx(X1, X2)) | → | indx#(X1, X2) | | quote#(s(X)) | → | activate#(X) |
| quote#(sel(X, Y)) | → | sel1#(X, Y) | | quote#(dbl(X)) | → | dbl1#(X) |
| activate#(n__sel(X1, X2)) | → | sel#(X1, X2) | | sel#(s(X), cons(Y, Z)) | → | activate#(Z) |
| activate#(n__dbl(X)) | → | dbl#(X) | | indx#(cons(X, Y), Z) | → | activate#(Y) |
| dbls#(cons(X, Y)) | → | activate#(Y) | | sel#(0, cons(X, Y)) | → | activate#(X) |
| indx#(cons(X, Y), Z) | → | activate#(X) | | sel#(s(X), cons(Y, Z)) | → | activate#(X) |
| indx#(cons(X, Y), Z) | → | activate#(Z) | | quote#(s(X)) | → | quote#(activate(X)) |
| sel#(s(X), cons(Y, Z)) | → | sel#(activate(X), activate(Z)) | | sel1#(s(X), cons(Y, Z)) | → | activate#(Z) |
| dbl1#(s(X)) | → | dbl1#(activate(X)) | | sel1#(s(X), cons(Y, Z)) | → | activate#(X) |
| activate#(n__from(X)) | → | from#(X) | | sel1#(0, cons(X, Y)) | → | activate#(X) |
| activate#(n__s(X)) | → | s#(X) | | dbls#(cons(X, Y)) | → | activate#(X) |
| from#(X) | → | activate#(X) | | sel1#(s(X), cons(Y, Z)) | → | sel1#(activate(X), activate(Z)) |
| dbl1#(s(X)) | → | activate#(X) | | activate#(n__dbls(X)) | → | dbls#(X) |
Rewrite Rules
| dbl(0) | → | 0 | | dbl(s(X)) | → | s(n__s(n__dbl(activate(X)))) |
| dbls(nil) | → | nil | | dbls(cons(X, Y)) | → | cons(n__dbl(activate(X)), n__dbls(activate(Y))) |
| sel(0, cons(X, Y)) | → | activate(X) | | sel(s(X), cons(Y, Z)) | → | sel(activate(X), activate(Z)) |
| indx(nil, X) | → | nil | | indx(cons(X, Y), Z) | → | cons(n__sel(activate(X), activate(Z)), n__indx(activate(Y), activate(Z))) |
| from(X) | → | cons(activate(X), n__from(n__s(activate(X)))) | | dbl1(0) | → | 01 |
| dbl1(s(X)) | → | s1(s1(dbl1(activate(X)))) | | sel1(0, cons(X, Y)) | → | activate(X) |
| sel1(s(X), cons(Y, Z)) | → | sel1(activate(X), activate(Z)) | | quote(0) | → | 01 |
| quote(s(X)) | → | s1(quote(activate(X))) | | quote(dbl(X)) | → | dbl1(X) |
| quote(sel(X, Y)) | → | sel1(X, Y) | | s(X) | → | n__s(X) |
| dbl(X) | → | n__dbl(X) | | dbls(X) | → | n__dbls(X) |
| sel(X1, X2) | → | n__sel(X1, X2) | | indx(X1, X2) | → | n__indx(X1, X2) |
| from(X) | → | n__from(X) | | activate(n__s(X)) | → | s(X) |
| activate(n__dbl(X)) | → | dbl(X) | | activate(n__dbls(X)) | → | dbls(X) |
| activate(n__sel(X1, X2)) | → | sel(X1, X2) | | activate(n__indx(X1, X2)) | → | indx(X1, X2) |
| activate(n__from(X)) | → | from(X) | | activate(X) | → | X |
Original Signature
Termination of terms over the following signature is verified: n__indx, s1, n__from, dbl1, dbl, from, 01, n__sel, dbls, activate, n__s, n__dbls, 0, indx, s, sel1, quote, sel, n__dbl, cons, nil
Strategy
The following SCCs where found
| sel1#(s(X), cons(Y, Z)) → sel1#(activate(X), activate(Z)) |
| dbl1#(s(X)) → dbl1#(activate(X)) |
| quote#(s(X)) → quote#(activate(X)) |
| dbl#(s(X)) → activate#(X) | sel#(s(X), cons(Y, Z)) → sel#(activate(X), activate(Z)) |
| activate#(n__indx(X1, X2)) → indx#(X1, X2) | activate#(n__from(X)) → from#(X) |
| activate#(n__sel(X1, X2)) → sel#(X1, X2) | dbls#(cons(X, Y)) → activate#(X) |
| from#(X) → activate#(X) | sel#(s(X), cons(Y, Z)) → activate#(Z) |
| activate#(n__dbl(X)) → dbl#(X) | indx#(cons(X, Y), Z) → activate#(Y) |
| dbls#(cons(X, Y)) → activate#(Y) | sel#(0, cons(X, Y)) → activate#(X) |
| indx#(cons(X, Y), Z) → activate#(X) | sel#(s(X), cons(Y, Z)) → activate#(X) |
| activate#(n__dbls(X)) → dbls#(X) | indx#(cons(X, Y), Z) → activate#(Z) |