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


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


YES

Problem 1: 

(VAR X Y Z)
(RULES
add(0,X) -> X
add(s,Y) -> s
from(X) -> cons(X)
fst(0,Z) -> nil
fst(s,cons(Y)) -> cons(Y)
len(cons(X)) -> s
len(nil) -> 0
)

Problem 1: 

Innermost Equivalent Processor:
-> Rules:
 add(0,X) -> X
 add(s,Y) -> s
 from(X) -> cons(X)
 fst(0,Z) -> nil
 fst(s,cons(Y)) -> cons(Y)
 len(cons(X)) -> s
 len(nil) -> 0
-> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination.
 

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 Empty
-> Rules:
 add(0,X) -> X
 add(s,Y) -> s
 from(X) -> cons(X)
 fst(0,Z) -> nil
 fst(s,cons(Y)) -> cons(Y)
 len(cons(X)) -> s
 len(nil) -> 0

Problem 1: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 add(0,X) -> X
 add(s,Y) -> s
 from(X) -> cons(X)
 fst(0,Z) -> nil
 fst(s,cons(Y)) -> cons(Y)
 len(cons(X)) -> s
 len(nil) -> 0
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.