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


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


YES

Problem 1: 

(VAR a k ls x)
(RULES
r1(cons(x,k),a) -> r1(k,cons(x,a))
r1(empty,a) -> a
rev(ls) -> r1(ls,empty)
)

Problem 1: 

Innermost Equivalent Processor:
-> Rules:
 r1(cons(x,k),a) -> r1(k,cons(x,a))
 r1(empty,a) -> a
 rev(ls) -> r1(ls,empty)
-> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination.
 

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 R1(cons(x,k),a) -> R1(k,cons(x,a))
 REV(ls) -> R1(ls,empty)
-> Rules:
 r1(cons(x,k),a) -> r1(k,cons(x,a))
 r1(empty,a) -> a
 rev(ls) -> r1(ls,empty)

Problem 1: 

SCC Processor:
-> Pairs:
 R1(cons(x,k),a) -> R1(k,cons(x,a))
 REV(ls) -> R1(ls,empty)
-> Rules:
 r1(cons(x,k),a) -> r1(k,cons(x,a))
 r1(empty,a) -> a
 rev(ls) -> r1(ls,empty)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 R1(cons(x,k),a) -> R1(k,cons(x,a))
->->-> Rules:
 r1(cons(x,k),a) -> r1(k,cons(x,a))
 r1(empty,a) -> a
 rev(ls) -> r1(ls,empty)

Problem 1: 

Subterm Processor:
-> Pairs:
 R1(cons(x,k),a) -> R1(k,cons(x,a))
-> Rules:
 r1(cons(x,k),a) -> r1(k,cons(x,a))
 r1(empty,a) -> a
 rev(ls) -> r1(ls,empty)
->Projection:
 pi(R1) = 1

Problem 1: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 r1(cons(x,k),a) -> r1(k,cons(x,a))
 r1(empty,a) -> a
 rev(ls) -> r1(ls,empty)
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.