/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
0 -> 2
1 -> 2
f(0,1,x) -> f(x,x,x)
f(x,y,z) -> 2
g(x,x,y) -> y
g(x,y,y) -> x
) 
(STRATEGY INNERMOST)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 Empty
-> Rules:
 0 -> 2
 1 -> 2
 f(0,1,x) -> f(x,x,x)
 f(x,y,z) -> 2
 g(x,x,y) -> y
 g(x,y,y) -> x

Problem 1: 

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

The problem is finite.