/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 y)
(RULES
a -> d
b -> d
e -> e
f(x,y) -> g(x) | a -> d
f(x,y) -> h(x) | b -> d
g(s(x)) -> x
h(s(x)) -> x
)

Problem 1: 
Valid CTRS Processor:
-> Rules:
 a -> d
 b -> d
 e -> e
 f(x,y) -> g(x) | a -> d
 f(x,y) -> h(x) | b -> d
 g(s(x)) -> x
 h(s(x)) -> x
-> The system is a deterministic 3-CTRS.

Problem 1: 

Dependency Pairs Processor:

Conditional Termination Problem 1:
-> Pairs:
 E -> E
 F(x,y) -> G(x) | a -> d
 F(x,y) -> H(x) | b -> d
-> QPairs:
 Empty
-> Rules:
 a -> d
 b -> d
 e -> e
 f(x,y) -> g(x) | a -> d
 f(x,y) -> h(x) | b -> d
 g(s(x)) -> x
 h(s(x)) -> x

Conditional Termination Problem 2:
-> Pairs:
 F(x,y) -> A
 F(x,y) -> B
-> QPairs:
 E -> E
 F(x,y) -> G(x) | a -> d
 F(x,y) -> H(x) | b -> d
-> Rules:
 a -> d
 b -> d
 e -> e
 f(x,y) -> g(x) | a -> d
 f(x,y) -> h(x) | b -> d
 g(s(x)) -> x
 h(s(x)) -> x

Problem 1: 

SCC Processor:
-> Pairs:
 E -> E
 F(x,y) -> G(x) | a -> d
 F(x,y) -> H(x) | b -> d
-> QPairs:
 Empty
-> Rules:
 a -> d
 b -> d
 e -> e
 f(x,y) -> g(x) | a -> d
 f(x,y) -> h(x) | b -> d
 g(s(x)) -> x
 h(s(x)) -> x
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 E -> E
->->-> Rules:
 a -> d
 b -> d
 e -> e
 f(x,y) -> g(x) | a -> d
 f(x,y) -> h(x) | b -> d
 g(s(x)) -> x
 h(s(x)) -> x

Problem 1: 

Infinite Processor:
-> Pairs:
 E -> E
-> QPairs:
 Empty
-> Rules:
 a -> d
 b -> d
 e -> e
 f(x,y) -> g(x) | a -> d
 f(x,y) -> h(x) | b -> d
 g(s(x)) -> x
 h(s(x)) -> x
-> Pairs in cycle:
 E -> E

The problem is infinite.