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

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

Problem 1: 

Dependency Pairs Processor:

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

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

Shift to Dependency Pair Processor:
-> Pairs:
 F(x) -> G(a)
 G(x) -> F(x)
-> Rules:
 f(x) -> g(a)
 g(x) -> f(x)

Problem 1: 

SCC Processor:
-> Pairs:
 F(x) -> G(a)
 G(x) -> F(x)
-> Rules:
 f(x) -> g(a)
 g(x) -> f(x)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 F(x) -> G(a)
 G(x) -> F(x)
->->-> Rules:
 f(x) -> g(a)
 g(x) -> f(x)

Problem 1: 

Infinite Processor:
-> Pairs:
 F(x) -> G(a)
 G(x) -> F(x)
-> Rules:
 f(x) -> g(a)
 g(x) -> f(x)
-> Pairs in cycle:
 F(a) -> G(a)
 G(a) -> F(a)

The problem is infinite.