/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)
(RULES
+(0,s(y)) -> s(y)
+(x,s(y)) -> s(+(x,y))
+(x,0) -> x
s(+(0,y)) -> s(y)
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 +#(x,s(y)) -> +#(x,y)
 +#(x,s(y)) -> S(+(x,y))
 S(+(0,y)) -> S(y)
-> Rules:
 +(0,s(y)) -> s(y)
 +(x,s(y)) -> s(+(x,y))
 +(x,0) -> x
 s(+(0,y)) -> s(y)

Problem 1: 

SCC Processor:
-> Pairs:
 +#(x,s(y)) -> +#(x,y)
 +#(x,s(y)) -> S(+(x,y))
 S(+(0,y)) -> S(y)
-> Rules:
 +(0,s(y)) -> s(y)
 +(x,s(y)) -> s(+(x,y))
 +(x,0) -> x
 s(+(0,y)) -> s(y)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 S(+(0,y)) -> S(y)
->->-> Rules:
 +(0,s(y)) -> s(y)
 +(x,s(y)) -> s(+(x,y))
 +(x,0) -> x
 s(+(0,y)) -> s(y)
->->Cycle:
->->-> Pairs:
 +#(x,s(y)) -> +#(x,y)
->->-> Rules:
 +(0,s(y)) -> s(y)
 +(x,s(y)) -> s(+(x,y))
 +(x,0) -> x
 s(+(0,y)) -> s(y)


The problem is decomposed in 2 subproblems.

Problem 1.1: 

Subterm Processor:
-> Pairs:
 S(+(0,y)) -> S(y)
-> Rules:
 +(0,s(y)) -> s(y)
 +(x,s(y)) -> s(+(x,y))
 +(x,0) -> x
 s(+(0,y)) -> s(y)
->Projection:
 pi(S) = 1

Problem 1.1: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 +(0,s(y)) -> s(y)
 +(x,s(y)) -> s(+(x,y))
 +(x,0) -> x
 s(+(0,y)) -> s(y)
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.2: 

Subterm Processor:
-> Pairs:
 +#(x,s(y)) -> +#(x,y)
-> Rules:
 +(0,s(y)) -> s(y)
 +(x,s(y)) -> s(+(x,y))
 +(x,0) -> x
 s(+(0,y)) -> s(y)
->Projection:
 pi(+#) = 2

Problem 1.2: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 +(0,s(y)) -> s(y)
 +(x,s(y)) -> s(+(x,y))
 +(x,0) -> x
 s(+(0,y)) -> s(y)
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.