/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
a -> c
b -> c | b -> c
)

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

Problem 1: 

Dependency Pairs Processor:

Conditional Termination Problem 1:
-> Pairs:
 A -> B
-> QPairs:
 Empty
-> Rules:
 a -> b
 a -> c
 b -> c | b -> c

Conditional Termination Problem 2:
-> Pairs:
 B -> B
-> QPairs:
 A -> B
-> Rules:
 a -> b
 a -> c
 b -> c | b -> c

Problem 1: 

SCC Processor:
-> Pairs:
 B -> B
-> QPairs:
 A -> B
-> Rules:
 a -> b
 a -> c
 b -> c | b -> c
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 B -> B
->->-> Rules:
 a -> b
 a -> c
 b -> c | b -> c

Problem 1: 

Reduction Triple Processor:
-> Pairs:
 B -> B
-> QPairs:
 A -> B
-> Rules:
 a -> b
 a -> c
 b -> c | b -> c
-> Usable rules:
 Empty
->Interpretation type:
 Linear
->Coefficients:
 Integer Numbers
->Dimension:
 1
->Convex Domain:
 D[(x_1)] = ((-1+x_1 >= 0) /\ (0 >= 0))
->Interpretation:
 
[delta] = 1
[A] = 2
[B] = 1

Problem 1: 

Infinite Processor:
-> Pairs:
 B -> B
-> QPairs:
 Empty
-> Rules:
 a -> b
 a -> c
 b -> c | b -> c
-> Pairs in cycle:
 B -> B

The problem is infinite.