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


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


YES

Problem 1: 

(VAR v_NonEmpty:S x:S)
(RULES
a -> c
a -> d
b -> c
b -> d
c -> e
c -> k
d -> k
f(x:S) -> x:S | x:S ->* e
g(x:S,x:S) -> C | A ->* B
h(x:S) -> i(x:S,x:S)
)

Problem 1: 
Valid CTRS Processor:
-> Rules:
 a -> c
 a -> d
 b -> c
 b -> d
 c -> e
 c -> k
 d -> k
 f(x:S) -> x:S | x:S ->* e
 g(x:S,x:S) -> C | A ->* B
 h(x:S) -> i(x:S,x:S)
-> The system is a deterministic 3-CTRS.

Problem 1: 

Dependency Pairs Processor:

Conditional Termination Problem 1:
-> Pairs:
 a# -> c#
 a# -> D
 b# -> c#
 b# -> D
-> QPairs:
 Empty
-> Rules:
 a -> c
 a -> d
 b -> c
 b -> d
 c -> e
 c -> k
 d -> k
 f(x:S) -> x:S | x:S ->* e
 g(x:S,x:S) -> C | A ->* B
 h(x:S) -> i(x:S,x:S)

Conditional Termination Problem 2:
-> Pairs:
 Empty
-> QPairs:
 Empty
-> Rules:
 a -> c
 a -> d
 b -> c
 b -> d
 c -> e
 c -> k
 d -> k
 f(x:S) -> x:S | x:S ->* e
 g(x:S,x:S) -> C | A ->* B
 h(x:S) -> i(x:S,x:S)


The problem is decomposed in 2 subproblems.

Problem 1.1: 

SCC Processor:
-> Pairs:
 a# -> c#
 a# -> D
 b# -> c#
 b# -> D
-> QPairs:
 Empty
-> Rules:
 a -> c
 a -> d
 b -> c
 b -> d
 c -> e
 c -> k
 d -> k
 f(x:S) -> x:S | x:S ->* e
 g(x:S,x:S) -> C | A ->* B
 h(x:S) -> i(x:S,x:S)
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.2: 

SCC Processor:
-> Pairs:
 Empty
-> QPairs:
 Empty
-> Rules:
 a -> c
 a -> d
 b -> c
 b -> d
 c -> e
 c -> k
 d -> k
 f(x:S) -> x:S | x:S ->* e
 g(x:S,x:S) -> C | A ->* B
 h(x:S) -> i(x:S,x:S)
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.