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


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


NO

Problem 1: 

(RULES
a -> b | f(a) -> b
)

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

Problem 1: 

Dependency Pairs Processor:

Conditional Termination Problem 1:
-> Pairs:
 Empty
-> QPairs:
 Empty
-> Rules:
 a -> b | f(a) -> b

Conditional Termination Problem 2:
-> Pairs:
 A -> A
-> QPairs:
 Empty
-> Rules:
 a -> b | f(a) -> b

Problem 1: 

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

Problem 1: 

Unsatisfiable Rule Processor:
-> Pairs:
 A -> A
-> QPairs:
 Empty
-> Rules:
 a -> b | f(a) -> b
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[a] = 2
[b] = 1
[f](X) = 0
[A] = 0

Problem 1: 

Infinite Processor:
-> Pairs:
 A -> A
-> QPairs:
 Empty
-> Rules:
 Empty
-> Pairs in cycle:
 A -> A

The problem is infinite.