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

Problem 1: 

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

Problem 1: 

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


The problem is decomposed in 2 subproblems.

Problem 1.1: 

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

Problem 1.1: 

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

Problem 1.1: 

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

Problem 1.1: 

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

The problem is finite.

Problem 1.2: 

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

Problem 1.2: 

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

The problem is finite.