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


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


YES

Problem 1: 

(VAR x y z)
(RULES
f(x,y) -> z | x -> z
g(x) -> b | h(x) -> d
h(c) -> d
)

Problem 1: 
Valid CTRS Processor:
-> Rules:
 f(x,y) -> z | x -> z
 g(x) -> b | h(x) -> d
 h(c) -> d
-> The system is a deterministic 3-CTRS.

Problem 1: 

Dependency Pairs Processor:

Conditional Termination Problem 1:
-> Pairs:
 Empty
-> QPairs:
 Empty
-> Rules:
 f(x,y) -> z | x -> z
 g(x) -> b | h(x) -> d
 h(c) -> d

Conditional Termination Problem 2:
-> Pairs:
 G(x) -> H(x)
-> QPairs:
 Empty
-> Rules:
 f(x,y) -> z | x -> z
 g(x) -> b | h(x) -> d
 h(c) -> d


The problem is decomposed in 2 subproblems.

Problem 1.1: 

SCC Processor:
-> Pairs:
 Empty
-> QPairs:
 Empty
-> Rules:
 f(x,y) -> z | x -> z
 g(x) -> b | h(x) -> d
 h(c) -> d
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.2: 

SCC Processor:
-> Pairs:
 G(x) -> H(x)
-> QPairs:
 Empty
-> Rules:
 f(x,y) -> z | x -> z
 g(x) -> b | h(x) -> d
 h(c) -> d
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.