/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)
(STRATEGY CONTEXTSENSITIVE
(add 1 2)
(from 1)
(fst 1 2)
(len 1)
(0)
(cons 1)
(nil)
(s)
)
(RULES
add(0,X) -> X
add(s(X),Y) -> s(add(X,Y))
from(X) -> cons(X,from(s(X)))
fst(0,Z) -> nil
fst(s(X),cons(Y,Z)) -> cons(Y,fst(X,Z))
len(cons(X,Z)) -> s(len(Z))
len(nil) -> 0
)

Problem 1: 

Innermost Equivalent Processor:
-> Rules:
 add(0,X) -> X
 add(s(X),Y) -> s(add(X,Y))
 from(X) -> cons(X,from(s(X)))
 fst(0,Z) -> nil
 fst(s(X),cons(Y,Z)) -> cons(Y,fst(X,Z))
 len(cons(X,Z)) -> s(len(Z))
 len(nil) -> 0
-> The context-sensitive term rewriting system is an orthogonal system. Therefore, innermost cs-termination implies cs-termination.
 

Problem 1: 

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

Problem 1: 

Basic Processor:
-> Pairs:
 Empty
-> Rules:
 add(0,X) -> X
 add(s(X),Y) -> s(add(X,Y))
 from(X) -> cons(X,from(s(X)))
 fst(0,Z) -> nil
 fst(s(X),cons(Y,Z)) -> cons(Y,fst(X,Z))
 len(cons(X,Z)) -> s(len(Z))
 len(nil) -> 0
-> Unhiding rules:
 Empty
-> Result:
 Set P is empty

The problem is finite.