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


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


NO

Problem 1: 

(VAR x)
(RULES
+(0,x) -> x
+(1,x) -> +(+(0,1),x)
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 +#(1,x) -> +#(+(0,1),x)
 +#(1,x) -> +#(0,1)
-> Rules:
 +(0,x) -> x
 +(1,x) -> +(+(0,1),x)

Problem 1: 

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

Problem 1: 

Narrowing Processor:
-> Pairs:
 +#(1,x) -> +#(+(0,1),x)
-> Rules:
 +(0,x) -> x
 +(1,x) -> +(+(0,1),x)
->Narrowed Pairs:
->->Original Pair:
 +#(1,x) -> +#(+(0,1),x)
->-> Narrowed pairs:
 +#(1,x1) -> +#(1,x1)

Problem 1: 

Infinite Processor:
-> Pairs:
 +#(1,x1) -> +#(1,x1)
-> Rules:
 +(0,x) -> x
 +(1,x) -> +(+(0,1),x)
-> Pairs in cycle:
 +#(1,x1) -> +#(1,x1)

The problem is infinite.