TRS Stand 20472 pair #381714700

details

property	value
status	complete
benchmark	PALINDROME_complete_FR.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n075.star.cs.uiowa.edu
space	Transformed_CSR_04

run statistics

property	value
solver	NaTT
configuration	Default
runtime (wallclock)	0.333182096481 seconds
cpu usage	0.368518983
max memory	1.7494016E7

stage attributes

key	value
output-size	16126
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


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


YES
Input TRS:
    1: __(__(X,Y),Z) -> __(X,__(Y,Z))
    2: __(X,nil()) -> X
    3: __(nil(),X) -> X
    4: U11(tt(),V) -> U12(isNeList(activate(V)))
    5: U12(tt()) -> tt()
    6: U21(tt(),V1,V2) -> U22(isList(activate(V1)),activate(V2))
    7: U22(tt(),V2) -> U23(isList(activate(V2)))
    8: U23(tt()) -> tt()
    9: U31(tt(),V) -> U32(isQid(activate(V)))
    10: U32(tt()) -> tt()
    11: U41(tt(),V1,V2) -> U42(isList(activate(V1)),activate(V2))
    12: U42(tt(),V2) -> U43(isNeList(activate(V2)))
    13: U43(tt()) -> tt()
    14: U51(tt(),V1,V2) -> U52(isNeList(activate(V1)),activate(V2))
    15: U52(tt(),V2) -> U53(isList(activate(V2)))
    16: U53(tt()) -> tt()
    17: U61(tt(),V) -> U62(isQid(activate(V)))
    18: U62(tt()) -> tt()
    19: U71(tt(),V) -> U72(isNePal(activate(V)))
    20: U72(tt()) -> tt()
    21: and(tt(),X) -> activate(X)
    22: isList(V) -> U11(isPalListKind(activate(V)),activate(V))
    23: isList(n__nil()) -> tt()
    24: isList(n____(V1,V2)) -> U21(and(isPalListKind(activate(V1)),n__isPalListKind(activate(V2))),activate(V1),activate(V2))
    25: isNeList(V) -> U31(isPalListKind(activate(V)),activate(V))
    26: isNeList(n____(V1,V2)) -> U41(and(isPalListKind(activate(V1)),n__isPalListKind(activate(V2))),activate(V1),activate(V2))
    27: isNeList(n____(V1,V2)) -> U51(and(isPalListKind(activate(V1)),n__isPalListKind(activate(V2))),activate(V1),activate(V2))
    28: isNePal(V) -> U61(isPalListKind(activate(V)),activate(V))
    29: isNePal(n____(I,n____(P,I))) -> and(and(isQid(activate(I)),n__isPalListKind(activate(I))),n__and(n__isPal(activate(P)),n__isPalListKind(activate(P))))
    30: isPal(V) -> U71(isPalListKind(activate(V)),activate(V))
    31: isPal(n__nil()) -> tt()
    32: isPalListKind(n__a()) -> tt()
    33: isPalListKind(n__e()) -> tt()
    34: isPalListKind(n__i()) -> tt()
    35: isPalListKind(n__nil()) -> tt()
    36: isPalListKind(n__o()) -> tt()
    37: isPalListKind(n__u()) -> tt()
    38: isPalListKind(n____(V1,V2)) -> and(isPalListKind(activate(V1)),n__isPalListKind(activate(V2)))
    39: isQid(n__a()) -> tt()
    40: isQid(n__e()) -> tt()
    41: isQid(n__i()) -> tt()
    42: isQid(n__o()) -> tt()
    43: isQid(n__u()) -> tt()
    44: nil() -> n__nil()
    45: __(X1,X2) -> n____(X1,X2)
    46: isPalListKind(X) -> n__isPalListKind(X)
    47: and(X1,X2) -> n__and(X1,X2)
    48: isPal(X) -> n__isPal(X)
    49: a() -> n__a()
    50: e() -> n__e()
    51: i() -> n__i()
    52: o() -> n__o()
    53: u() -> n__u()
    54: activate(n__nil()) -> nil()
    55: activate(n____(X1,X2)) -> __(activate(X1),activate(X2))
    56: activate(n__isPalListKind(X)) -> isPalListKind(X)
    57: activate(n__and(X1,X2)) -> and(activate(X1),X2)
    58: activate(n__isPal(X)) -> isPal(X)
    59: activate(n__a()) -> a()
    60: activate(n__e()) -> e()
    61: activate(n__i()) -> i()
    62: activate(n__o()) -> o()
    63: activate(n__u()) -> u()
    64: activate(X) -> X
Number of strict rules: 64
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #isNePal(n____(I,n____(P,I))) -> #and(and(isQid(activate(I)),n__isPalListKind(activate(I))),n__and(n__isPal(activate(P)),n__isPalListKind(activate(P))))
   #2: #isNePal(n____(I,n____(P,I))) -> #and(isQid(activate(I)),n__isPalListKind(activate(I)))
   #3: #isNePal(n____(I,n____(P,I))) -> #isQid(activate(I))
   #4: #isNePal(n____(I,n____(P,I))) -> #activate(I)
   #5: #isNePal(n____(I,n____(P,I))) -> #activate(I)
   #6: #isNePal(n____(I,n____(P,I))) -> #activate(P)
   #7: #isNePal(n____(I,n____(P,I))) -> #activate(P)
   #8: #activate(n__isPal(X)) -> #isPal(X)
   #9: #activate(n__i()) -> #i()
   #10: #isPalListKind(n____(V1,V2)) -> #and(isPalListKind(activate(V1)),n__isPalListKind(activate(V2)))
   #11: #isPalListKind(n____(V1,V2)) -> #isPalListKind(activate(V1))
   #12: #isPalListKind(n____(V1,V2)) -> #activate(V1)
   #13: #isPalListKind(n____(V1,V2)) -> #activate(V2)
   #14: #U21(tt(),V1,V2) -> #U22(isList(activate(V1)),activate(V2))
   #15: #U21(tt(),V1,V2) -> #isList(activate(V1))
   #16: #U21(tt(),V1,V2) -> #activate(V1)
   #17: #U21(tt(),V1,V2) -> #activate(V2)
   #18: #activate(n__a()) -> #a()
   #19: #activate(n____(X1,X2)) -> #__(activate(X1),activate(X2))
   #20: #activate(n____(X1,X2)) -> #activate(X1)
   #21: #activate(n____(X1,X2)) -> #activate(X2)
   #22: #U31(tt(),V) -> #U32(isQid(activate(V)))
   #23: #U31(tt(),V) -> #isQid(activate(V))
   #24: #U31(tt(),V) -> #activate(V)

popout

output may be truncated. 'popout' for the full output.

job log

popout

actions all output return to TRS Stand 20472