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

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

Problem 1: 

Dependency Pairs Processor:

Conditional Termination Problem 1:
-> Pairs:
 Empty
-> QPairs:
 Empty
-> Rules:
 f(x:S,x:S) -> a | g(x:S) ->* b

Conditional Termination Problem 2:
-> Pairs:
 Empty
-> QPairs:
 Empty
-> Rules:
 f(x:S,x:S) -> a | g(x:S) ->* b


The problem is decomposed in 2 subproblems.

Problem 1.1: 

SCC Processor:
-> Pairs:
 Empty
-> QPairs:
 Empty
-> Rules:
 f(x:S,x:S) -> a | g(x:S) ->* b
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.2: 

SCC Processor:
-> Pairs:
 Empty
-> QPairs:
 Empty
-> Rules:
 f(x:S,x:S) -> a | g(x:S) ->* b
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.