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


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


YES

Problem 1: 

(VAR a b c k l x)
(RULES
f(cons(x,k),l) -> g(k,l,cons(x,k))
f(empty,l) -> l
g(a,b,c) -> f(a,cons(b,c))
)

Problem 1: 

Innermost Equivalent Processor:
-> Rules:
 f(cons(x,k),l) -> g(k,l,cons(x,k))
 f(empty,l) -> l
 g(a,b,c) -> f(a,cons(b,c))
-> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination.
 

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 F(cons(x,k),l) -> G(k,l,cons(x,k))
 G(a,b,c) -> F(a,cons(b,c))
-> Rules:
 f(cons(x,k),l) -> g(k,l,cons(x,k))
 f(empty,l) -> l
 g(a,b,c) -> f(a,cons(b,c))

Problem 1: 

SCC Processor:
-> Pairs:
 F(cons(x,k),l) -> G(k,l,cons(x,k))
 G(a,b,c) -> F(a,cons(b,c))
-> Rules:
 f(cons(x,k),l) -> g(k,l,cons(x,k))
 f(empty,l) -> l
 g(a,b,c) -> f(a,cons(b,c))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 F(cons(x,k),l) -> G(k,l,cons(x,k))
 G(a,b,c) -> F(a,cons(b,c))
->->-> Rules:
 f(cons(x,k),l) -> g(k,l,cons(x,k))
 f(empty,l) -> l
 g(a,b,c) -> f(a,cons(b,c))

Problem 1: 

Subterm Processor:
-> Pairs:
 F(cons(x,k),l) -> G(k,l,cons(x,k))
 G(a,b,c) -> F(a,cons(b,c))
-> Rules:
 f(cons(x,k),l) -> g(k,l,cons(x,k))
 f(empty,l) -> l
 g(a,b,c) -> f(a,cons(b,c))
->Projection:
 pi(F) = 1
 pi(G) = 1

Problem 1: 

SCC Processor:
-> Pairs:
 G(a,b,c) -> F(a,cons(b,c))
-> Rules:
 f(cons(x,k),l) -> g(k,l,cons(x,k))
 f(empty,l) -> l
 g(a,b,c) -> f(a,cons(b,c))
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.