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


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


NO

Problem 1: 

(VAR v_NonEmpty:S x:S z:S)
(RULES
a -> f(a)
f(x:S) -> b | f(x:S) ->* z:S, x:S ->* z:S
)

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

Problem 1: 

Dependency Pairs Processor:

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

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

Problem 1: 

SCC Processor:
-> Pairs:
 A -> A
 A -> F(a)
-> QPairs:
 Empty
-> Rules:
 a -> f(a)
 f(x:S) -> b | f(x:S) ->* z:S, x:S ->* z:S
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 A -> A
-> QPairs:
 Empty
->->-> Rules:
 a -> f(a)
 f(x:S) -> b | f(x:S) ->* z:S, x:S ->* z:S

Problem 1: 

Infinite Processor:
-> Pairs:
 A -> A
-> QPairs:
 Empty
-> Rules:
 a -> f(a)
 f(x:S) -> b | f(x:S) ->* z:S, x:S ->* z:S
-> Pairs in cycle:
 A -> A

The problem is infinite.