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

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

Problem 1: 

Dependency Pairs Processor:

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

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

Problem 1: 

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

Problem 1: 

Conditional Narrowing using Q Processor:
-> Pairs:
 F(x) -> G(x)
-> QPairs:
 B -> F(a)
 G(a) -> B
-> Rules:
 b -> f(a)
 f(x) -> y | g(x) -> c(y)
 g(a) -> c(b)
->Narrowed Pairs:
->->Original Pair:
 F(x) -> G(x)
->-> Narrowed pairs:
 F(a) -> B

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

Conditional Narrowing using Q Processor:
-> Pairs:
 F(a) -> B
-> QPairs:
 B -> F(a)
-> Rules:
 b -> f(a)
 f(x) -> y | g(x) -> c(y)
 g(a) -> c(b)
->Narrowed Pairs:
->->Original Pair:
 F(a) -> B
->-> Narrowed pairs:
 F(a) -> F(a)

Problem 1: 

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

The problem is infinite.