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

Problem 1: 
Valid CTRS Processor:
-> Rules:
 a(x) -> b | p(x) -> 0
 c -> c
 p(q(x)) -> 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) -> b | p(x) -> 0
 c -> c
 p(q(x)) -> 0

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

Problem 1: 

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

Problem 1: 

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

The problem is infinite.