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


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


YES

Problem 1: 

(VAR v_NonEmpty:S x:S y:S)
(RULES
a -> d
b -> d
f(x:S,y:S) -> g(x:S) | a ->* d
f(x:S,y:S) -> h(x:S) | b ->* d
g(s(x:S)) -> x:S
h(s(x:S)) -> x:S
)

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

Problem 1: 

Dependency Pairs Processor:

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

Conditional Termination Problem 2:
-> Pairs:
 F(x:S,y:S) -> A
 F(x:S,y:S) -> B
-> QPairs:
 Empty
-> Rules:
 a -> d
 b -> d
 f(x:S,y:S) -> g(x:S) | a ->* d
 f(x:S,y:S) -> h(x:S) | b ->* d
 g(s(x:S)) -> x:S
 h(s(x:S)) -> x:S


The problem is decomposed in 2 subproblems.

Problem 1.1: 

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

The problem is finite.

Problem 1.2: 

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

The problem is finite.