/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


NO

** BEGIN proof argument **
The following rule was generated while unfolding the analyzed TRS:
[iteration = 0] isPalListKind -> isPalListKind
Let l be the left-hand side and r be the right-hand side of this rule.
Let p = epsilon, theta1 = {} and theta2 = {}.
We have r|p = isPalListKind and theta2(theta1(l)) = theta1(r|p).
Hence, the term theta1(l) = isPalListKind loops w.r.t. the analyzed TRS.
** END proof argument **

** BEGIN proof description **
## Searching for a generalized rewrite rule
(a rule whose right-hand side contains a variable
that does not occur in the left-hand side)...
No generalized rewrite rule found!

## Applying the DP framework...
## 4 initial DP problems to solve.
## First, we try to decompose these problems into smaller problems.
## Round 1 [4 DP problems]:
  ## DP problem:
  Dependency pairs = [U71^#(tt) -> U72^#(isPalListKind), isNePal^# -> U71^#(isQid), U82^#(tt) -> isNePal^#, U81^#(tt) -> U82^#(isPalListKind), isPal^# -> U81^#(isPalListKind), U72^#(tt) -> isPal^#]
  TRS = {__(__(_0,_1),_2) -> __(_0,__(_1,_2)), __(_0,nil) -> _0, __(nil,_0) -> _0, U11(tt) -> U12(isPalListKind), U12(tt) -> U13(isNeList), U13(tt) -> tt, U21(tt) -> U22(isPalListKind), U22(tt) -> U23(isPalListKind), U23(tt) -> U24(isPalListKind), U24(tt) -> U25(isList), U25(tt) -> U26(isList), U26(tt) -> tt, U31(tt) -> U32(isPalListKind), U32(tt) -> U33(isQid), U33(tt) -> tt, U41(tt) -> U42(isPalListKind), U42(tt) -> U43(isPalListKind), U43(tt) -> U44(isPalListKind), U44(tt) -> U45(isList), U45(tt) -> U46(isNeList), U46(tt) -> tt, U51(tt) -> U52(isPalListKind), U52(tt) -> U53(isPalListKind), U53(tt) -> U54(isPalListKind), U54(tt) -> U55(isNeList), U55(tt) -> U56(isList), U56(tt) -> tt, U61(tt) -> U62(isPalListKind), U62(tt) -> U63(isQid), U63(tt) -> tt, U71(tt) -> U72(isPalListKind), U72(tt) -> U73(isPal), U73(tt) -> U74(isPalListKind), U74(tt) -> tt, U81(tt) -> U82(isPalListKind), U82(tt) -> U83(isNePal), U83(tt) -> tt, U91(tt) -> U92(isPalListKind), U92(tt) -> tt, isList -> U11(isPalListKind), isList -> tt, isList -> U21(isPalListKind), isNeList -> U31(isPalListKind), isNeList -> U41(isPalListKind), isNeList -> U51(isPalListKind), isNePal -> U61(isPalListKind), isNePal -> U71(isQid), isPal -> U81(isPalListKind), isPal -> tt, isPalListKind -> tt, isPalListKind -> U91(isPalListKind), isQid -> tt}
    ## Trying with homeomorphic embeddings... Failed!
    ## Trying with polynomial interpretations... This DP problem is too complex! Aborting!
    ## Trying with lexicographic path orders... Too many argument filtering possibilities (2147483647)! Aborting!
    ## Trying with Knuth-Bendix orders... This DP problem is too complex! Aborting!
  Don't know whether this DP problem is finite.
  ## DP problem:
  Dependency pairs = [U11^#(tt) -> U12^#(isPalListKind), isList^# -> U11^#(isPalListKind), U24^#(tt) -> isList^#, U23^#(tt) -> U24^#(isPalListKind), U22^#(tt) -> U23^#(isPalListKind), U21^#(tt) -> U22^#(isPalListKind), isList^# -> U21^#(isPalListKind), U55^#(tt) -> isList^#, U54^#(tt) -> U55^#(isNeList), U44^#(tt) -> isList^#, U43^#(tt) -> U44^#(isPalListKind), U42^#(tt) -> U43^#(isPalListKind), U41^#(tt) -> U42^#(isPalListKind), isNeList^# -> U41^#(isPalListKind), U54^#(tt) -> isNeList^#, U53^#(tt) -> U54^#(isPalListKind), U52^#(tt) -> U53^#(isPalListKind), U51^#(tt) -> U52^#(isPalListKind), isNeList^# -> U51^#(isPalListKind), U45^#(tt) -> isNeList^#, U44^#(tt) -> U45^#(isList), U12^#(tt) -> isNeList^#, U25^#(tt) -> isList^#, U24^#(tt) -> U25^#(isList)]
  TRS = {__(__(_0,_1),_2) -> __(_0,__(_1,_2)), __(_0,nil) -> _0, __(nil,_0) -> _0, U11(tt) -> U12(isPalListKind), U12(tt) -> U13(isNeList), U13(tt) -> tt, U21(tt) -> U22(isPalListKind), U22(tt) -> U23(isPalListKind), U23(tt) -> U24(isPalListKind), U24(tt) -> U25(isList), U25(tt) -> U26(isList), U26(tt) -> tt, U31(tt) -> U32(isPalListKind), U32(tt) -> U33(isQid), U33(tt) -> tt, U41(tt) -> U42(isPalListKind), U42(tt) -> U43(isPalListKind), U43(tt) -> U44(isPalListKind), U44(tt) -> U45(isList), U45(tt) -> U46(isNeList), U46(tt) -> tt, U51(tt) -> U52(isPalListKind), U52(tt) -> U53(isPalListKind), U53(tt) -> U54(isPalListKind), U54(tt) -> U55(isNeList), U55(tt) -> U56(isList), U56(tt) -> tt, U61(tt) -> U62(isPalListKind), U62(tt) -> U63(isQid), U63(tt) -> tt, U71(tt) -> U72(isPalListKind), U72(tt) -> U73(isPal), U73(tt) -> U74(isPalListKind), U74(tt) -> tt, U81(tt) -> U82(isPalListKind), U82(tt) -> U83(isNePal), U83(tt) -> tt, U91(tt) -> U92(isPalListKind), U92(tt) -> tt, isList -> U11(isPalListKind), isList -> tt, isList -> U21(isPalListKind), isNeList -> U31(isPalListKind), isNeList -> U41(isPalListKind), isNeList -> U51(isPalListKind), isNePal -> U61(isPalListKind), isNePal -> U71(isQid), isPal -> U81(isPalListKind), isPal -> tt, isPalListKind -> tt, isPalListKind -> U91(isPalListKind), isQid -> tt}
    ## Trying with homeomorphic embeddings... Failed!
    ## Trying with polynomial interpretations... This DP problem is too complex! Aborting!
    ## Trying with lexicographic path orders... Too many argument filtering possibilities (2147483647)! Aborting!
    ## Trying with Knuth-Bendix orders... This DP problem is too complex! Aborting!
  Don't know whether this DP problem is finite.
  ## DP problem:
  Dependency pairs = [isPalListKind^# -> U91^#(isPalListKind), isPalListKind^# -> isPalListKind^#, U91^#(tt) -> isPalListKind^#]
  TRS = {__(__(_0,_1),_2) -> __(_0,__(_1,_2)), __(_0,nil) -> _0, __(nil,_0) -> _0, U11(tt) -> U12(isPalListKind), U12(tt) -> U13(isNeList), U13(tt) -> tt, U21(tt) -> U22(isPalListKind), U22(tt) -> U23(isPalListKind), U23(tt) -> U24(isPalListKind), U24(tt) -> U25(isList), U25(tt) -> U26(isList), U26(tt) -> tt, U31(tt) -> U32(isPalListKind), U32(tt) -> U33(isQid), U33(tt) -> tt, U41(tt) -> U42(isPalListKind), U42(tt) -> U43(isPalListKind), U43(tt) -> U44(isPalListKind), U44(tt) -> U45(isList), U45(tt) -> U46(isNeList), U46(tt) -> tt, U51(tt) -> U52(isPalListKind), U52(tt) -> U53(isPalListKind), U53(tt) -> U54(isPalListKind), U54(tt) -> U55(isNeList), U55(tt) -> U56(isList), U56(tt) -> tt, U61(tt) -> U62(isPalListKind), U62(tt) -> U63(isQid), U63(tt) -> tt, U71(tt) -> U72(isPalListKind), U72(tt) -> U73(isPal), U73(tt) -> U74(isPalListKind), U74(tt) -> tt, U81(tt) -> U82(isPalListKind), U82(tt) -> U83(isNePal), U83(tt) -> tt, U91(tt) -> U92(isPalListKind), U92(tt) -> tt, isList -> U11(isPalListKind), isList -> tt, isList -> U21(isPalListKind), isNeList -> U31(isPalListKind), isNeList -> U41(isPalListKind), isNeList -> U51(isPalListKind), isNePal -> U61(isPalListKind), isNePal -> U71(isQid), isPal -> U81(isPalListKind), isPal -> tt, isPalListKind -> tt, isPalListKind -> U91(isPalListKind), isQid -> tt}
    ## Trying with homeomorphic embeddings... Failed!
    ## Trying with polynomial interpretations... This DP problem is too complex! Aborting!
    ## Trying with lexicographic path orders... Too many argument filtering possibilities (2147483647)! Aborting!
    ## Trying with Knuth-Bendix orders... This DP problem is too complex! Aborting!
  Don't know whether this DP problem is finite.
  ## DP problem:
  Dependency pairs = [__^#(__(_0,_1),_2) -> __^#(_0,__(_1,_2)), __^#(__(_0,_1),_2) -> __^#(_1,_2)]
  TRS = {__(__(_0,_1),_2) -> __(_0,__(_1,_2)), __(_0,nil) -> _0, __(nil,_0) -> _0, U11(tt) -> U12(isPalListKind), U12(tt) -> U13(isNeList), U13(tt) -> tt, U21(tt) -> U22(isPalListKind), U22(tt) -> U23(isPalListKind), U23(tt) -> U24(isPalListKind), U24(tt) -> U25(isList), U25(tt) -> U26(isList), U26(tt) -> tt, U31(tt) -> U32(isPalListKind), U32(tt) -> U33(isQid), U33(tt) -> tt, U41(tt) -> U42(isPalListKind), U42(tt) -> U43(isPalListKind), U43(tt) -> U44(isPalListKind), U44(tt) -> U45(isList), U45(tt) -> U46(isNeList), U46(tt) -> tt, U51(tt) -> U52(isPalListKind), U52(tt) -> U53(isPalListKind), U53(tt) -> U54(isPalListKind), U54(tt) -> U55(isNeList), U55(tt) -> U56(isList), U56(tt) -> tt, U61(tt) -> U62(isPalListKind), U62(tt) -> U63(isQid), U63(tt) -> tt, U71(tt) -> U72(isPalListKind), U72(tt) -> U73(isPal), U73(tt) -> U74(isPalListKind), U74(tt) -> tt, U81(tt) -> U82(isPalListKind), U82(tt) -> U83(isNePal), U83(tt) -> tt, U91(tt) -> U92(isPalListKind), U92(tt) -> tt, isList -> U11(isPalListKind), isList -> tt, isList -> U21(isPalListKind), isNeList -> U31(isPalListKind), isNeList -> U41(isPalListKind), isNeList -> U51(isPalListKind), isNePal -> U61(isPalListKind), isNePal -> U71(isQid), isPal -> U81(isPalListKind), isPal -> tt, isPalListKind -> tt, isPalListKind -> U91(isPalListKind), isQid -> tt}
    ## Trying with homeomorphic embeddings... Failed!
    ## Trying with polynomial interpretations... This DP problem is too complex! Aborting!
    ## Trying with lexicographic path orders... Too many argument filtering possibilities (2147483647)! Aborting!
    ## Trying with Knuth-Bendix orders... This DP problem is too complex! Aborting!
  Don't know whether this DP problem is finite.
## Some DP problems could not be proved finite.
## Now, we try to prove that one of these problems is infinite.
    ## Trying to find a loop (forward=true, backward=true, max=20)
      # max_depth=20, unfold_variables=false:
        # Iteration 0: success, found a loop, 2 unfolded rules generated.
        Here is the successful unfolding. Let IR be the TRS under analysis.
        L0 = isPalListKind^# -> isPalListKind^# [trans] is in U_IR^0.
  This DP problem is infinite.
Proof run on Linux version 3.10.0-1160.25.1.el7.x86_64 for amd64
using Java version 1.8.0_292
** END proof description **
Total number of generated unfolded rules = 601