/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 z)
(RULES
a -> f(a)
f(x) -> b | f(x) -> z, x -> z
)

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

Problem 1: 

Dependency Pairs Processor:

Conditional Termination Problem 1:
-> Pairs:
 A -> A
 A -> F(a)
-> QPairs:
 Empty
-> Rules:
 a -> f(a)
 f(x) -> b | f(x) -> z, x -> z

Conditional Termination Problem 2:
-> Pairs:
 F(x) -> F(x)
-> QPairs:
 A -> A
 A -> F(a)
-> Rules:
 a -> f(a)
 f(x) -> b | f(x) -> z, x -> z

Problem 1: 

SCC Processor:
-> Pairs:
 A -> A
 A -> F(a)
-> QPairs:
 Empty
-> Rules:
 a -> f(a)
 f(x) -> b | f(x) -> z, x -> z
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 A -> A
->->-> Rules:
 a -> f(a)
 f(x) -> b | f(x) -> z, x -> z

Problem 1: 

Infinite Processor:
-> Pairs:
 A -> A
-> QPairs:
 Empty
-> Rules:
 a -> f(a)
 f(x) -> b | f(x) -> z, x -> z
-> Pairs in cycle:
 A -> A

The problem is infinite.