/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)
(RULES
a(x:S) -> b | p(x:S) ->* 0
c -> c
p(q(x:S)) -> 0
)

Problem 1: 
Valid CTRS Processor:
-> Rules:
 a(x:S) -> b | p(x:S) ->* 0
 c -> c
 p(q(x:S)) -> 0
-> The system is a deterministic 3-CTRS.

Problem 1: 

Dependency Pairs Processor:

Conditional Termination Problem 1:
-> Pairs:
 C -> C
-> QPairs:
 Empty
-> Rules:
 a(x:S) -> b | p(x:S) ->* 0
 c -> c
 p(q(x:S)) -> 0

Conditional Termination Problem 2:
-> Pairs:
 A(x:S) -> P(x:S)
-> QPairs:
 Empty
-> Rules:
 a(x:S) -> b | p(x:S) ->* 0
 c -> c
 p(q(x:S)) -> 0

Problem 1: 

SCC Processor:
-> Pairs:
 C -> C
-> QPairs:
 Empty
-> Rules:
 a(x:S) -> b | p(x:S) ->* 0
 c -> c
 p(q(x:S)) -> 0
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 C -> C
-> QPairs:
 Empty
->->-> Rules:
 a(x:S) -> b | p(x:S) ->* 0
 c -> c
 p(q(x:S)) -> 0

Problem 1: 

Infinite Processor:
-> Pairs:
 C -> C
-> QPairs:
 Empty
-> Rules:
 a(x:S) -> b | p(x:S) ->* 0
 c -> c
 p(q(x:S)) -> 0
-> Pairs in cycle:
 C -> C

The problem is infinite.