/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 Y)
(RULES
*(X,+(Y,1)) -> +(*(X,+(Y,*(1,0))),X)
*(X,0) -> 0
*(X,0) -> X
*(X,1) -> X
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 *#(X,+(Y,1)) -> *#(1,0)
 *#(X,+(Y,1)) -> *#(X,+(Y,*(1,0)))
-> Rules:
 *(X,+(Y,1)) -> +(*(X,+(Y,*(1,0))),X)
 *(X,0) -> 0
 *(X,0) -> X
 *(X,1) -> X

Problem 1: 

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

Problem 1: 

Narrowing Processor:
-> Pairs:
 *#(X,+(Y,1)) -> *#(X,+(Y,*(1,0)))
-> Rules:
 *(X,+(Y,1)) -> +(*(X,+(Y,*(1,0))),X)
 *(X,0) -> 0
 *(X,0) -> X
 *(X,1) -> X
->Narrowed Pairs:
->->Original Pair:
 *#(X,+(Y,1)) -> *#(X,+(Y,*(1,0)))
->-> Narrowed pairs:
 *#(x2,+(x3,1)) -> *#(x2,+(x3,0))
 *#(x2,+(x3,1)) -> *#(x2,+(x3,1))

Problem 1: 

Infinite Processor:
-> Pairs:
 *#(x2,+(x3,1)) -> *#(x2,+(x3,0))
 *#(x2,+(x3,1)) -> *#(x2,+(x3,1))
-> Rules:
 *(X,+(Y,1)) -> +(*(X,+(Y,*(1,0))),X)
 *(X,0) -> 0
 *(X,0) -> X
 *(X,1) -> X
-> Pairs in cycle:
 *#(x2,+(x3,1)) -> *#(x2,+(x3,1))

The problem is infinite.