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

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

Problem 1: 

Dependency Pairs Processor:

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

Conditional Termination Problem 2:
-> Pairs:
 F(x) -> F(x)
-> QPairs:
 C -> A
 C -> F(a)
 F(a) -> C
-> Rules:
 a -> b
 c -> f(a)
 c -> g(b)
 f(a) -> c
 f(x) -> g(x) | f(x) -> g(b)

Problem 1: 

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

Problem 1: 

Infinite Processor:
-> Pairs:
 C -> F(a)
 F(a) -> C
-> QPairs:
 Empty
-> Rules:
 a -> b
 c -> f(a)
 c -> g(b)
 f(a) -> c
 f(x) -> g(x) | f(x) -> g(b)
-> Pairs in cycle:
 C -> F(a)
 F(a) -> C

The problem is infinite.