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


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


YES

Problem 1: 

(VAR l l1 l2 x)
(RULES
append(l1,l2) -> ifappend(l1,l2,l1)
hd(cons(x,l)) -> x
ifappend(l1,l2,cons(x,l)) -> cons(x,append(l,l2))
ifappend(l1,l2,nil) -> l2
is_empty(cons(x,l)) -> false
is_empty(nil) -> true
tl(cons(x,l)) -> l
)

Problem 1: 

Innermost Equivalent Processor:
-> Rules:
 append(l1,l2) -> ifappend(l1,l2,l1)
 hd(cons(x,l)) -> x
 ifappend(l1,l2,cons(x,l)) -> cons(x,append(l,l2))
 ifappend(l1,l2,nil) -> l2
 is_empty(cons(x,l)) -> false
 is_empty(nil) -> true
 tl(cons(x,l)) -> l
-> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination.
 

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 APPEND(l1,l2) -> IFAPPEND(l1,l2,l1)
 IFAPPEND(l1,l2,cons(x,l)) -> APPEND(l,l2)
-> Rules:
 append(l1,l2) -> ifappend(l1,l2,l1)
 hd(cons(x,l)) -> x
 ifappend(l1,l2,cons(x,l)) -> cons(x,append(l,l2))
 ifappend(l1,l2,nil) -> l2
 is_empty(cons(x,l)) -> false
 is_empty(nil) -> true
 tl(cons(x,l)) -> l

Problem 1: 

SCC Processor:
-> Pairs:
 APPEND(l1,l2) -> IFAPPEND(l1,l2,l1)
 IFAPPEND(l1,l2,cons(x,l)) -> APPEND(l,l2)
-> Rules:
 append(l1,l2) -> ifappend(l1,l2,l1)
 hd(cons(x,l)) -> x
 ifappend(l1,l2,cons(x,l)) -> cons(x,append(l,l2))
 ifappend(l1,l2,nil) -> l2
 is_empty(cons(x,l)) -> false
 is_empty(nil) -> true
 tl(cons(x,l)) -> l
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 APPEND(l1,l2) -> IFAPPEND(l1,l2,l1)
 IFAPPEND(l1,l2,cons(x,l)) -> APPEND(l,l2)
->->-> Rules:
 append(l1,l2) -> ifappend(l1,l2,l1)
 hd(cons(x,l)) -> x
 ifappend(l1,l2,cons(x,l)) -> cons(x,append(l,l2))
 ifappend(l1,l2,nil) -> l2
 is_empty(cons(x,l)) -> false
 is_empty(nil) -> true
 tl(cons(x,l)) -> l

Problem 1: 

Subterm Processor:
-> Pairs:
 APPEND(l1,l2) -> IFAPPEND(l1,l2,l1)
 IFAPPEND(l1,l2,cons(x,l)) -> APPEND(l,l2)
-> Rules:
 append(l1,l2) -> ifappend(l1,l2,l1)
 hd(cons(x,l)) -> x
 ifappend(l1,l2,cons(x,l)) -> cons(x,append(l,l2))
 ifappend(l1,l2,nil) -> l2
 is_empty(cons(x,l)) -> false
 is_empty(nil) -> true
 tl(cons(x,l)) -> l
->Projection:
 pi(APPEND) = 1
 pi(IFAPPEND) = 3

Problem 1: 

SCC Processor:
-> Pairs:
 APPEND(l1,l2) -> IFAPPEND(l1,l2,l1)
-> Rules:
 append(l1,l2) -> ifappend(l1,l2,l1)
 hd(cons(x,l)) -> x
 ifappend(l1,l2,cons(x,l)) -> cons(x,append(l,l2))
 ifappend(l1,l2,nil) -> l2
 is_empty(cons(x,l)) -> false
 is_empty(nil) -> true
 tl(cons(x,l)) -> l
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.