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


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


NO

Problem 1: 

(VAR x)
(RULES
a -> b
b -> a
f(x,x) -> a
g(x) -> a | g(x) -> b
)

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

Problem 1: 

Dependency Pairs Processor:

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

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

Shift to Dependency Pair Processor:
-> Pairs:
 A -> B
 B -> A
-> Rules:
 a -> b
 b -> a
 f(x,x) -> a

Problem 1: 

SCC Processor:
-> Pairs:
 A -> B
 B -> A
-> Rules:
 a -> b
 b -> a
 f(x,x) -> a
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 A -> B
 B -> A
->->-> Rules:
 a -> b
 b -> a
 f(x,x) -> a

Problem 1: 

Infinite Processor:
-> Pairs:
 A -> B
 B -> A
-> Rules:
 a -> b
 b -> a
 f(x,x) -> a
-> Pairs in cycle:
 A -> B
 B -> A

The problem is infinite.