/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)
(RULES
.(i(x),x) -> 1
.(i(y),.(y,z)) -> z
.(1,x) -> x
.(x,i(x)) -> 1
.(x,1) -> x
.(y,.(i(y),z)) -> z
i(i(x)) -> x
i(1) -> 1
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 Empty
-> Rules:
 .(i(x),x) -> 1
 .(i(y),.(y,z)) -> z
 .(1,x) -> x
 .(x,i(x)) -> 1
 .(x,1) -> x
 .(y,.(i(y),z)) -> z
 i(i(x)) -> x
 i(1) -> 1

Problem 1: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 .(i(x),x) -> 1
 .(i(y),.(y,z)) -> z
 .(1,x) -> x
 .(x,i(x)) -> 1
 .(x,1) -> x
 .(y,.(i(y),z)) -> z
 i(i(x)) -> x
 i(1) -> 1
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.