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


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


YES

Problem 1: 

(VAR x)
(RULES
a -> b
f(x) -> x | s(x) -> t(x)
s(a) -> t(b)
)

Problem 1: 
Valid CTRS Processor:
-> Rules:
 a -> b
 f(x) -> x | s(x) -> t(x)
 s(a) -> t(b)
-> The system is a deterministic 3-CTRS.

Problem 1: 

Dependency Pairs Processor:

Conditional Termination Problem 1:
-> Pairs:
 Empty
-> QPairs:
 Empty
-> Rules:
 a -> b
 f(x) -> x | s(x) -> t(x)
 s(a) -> t(b)

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


The problem is decomposed in 2 subproblems.

Problem 1.1: 

SCC Processor:
-> Pairs:
 Empty
-> QPairs:
 Empty
-> Rules:
 a -> b
 f(x) -> x | s(x) -> t(x)
 s(a) -> t(b)
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.2: 

SCC Processor:
-> Pairs:
 F(x) -> S(x)
-> QPairs:
 Empty
-> Rules:
 a -> b
 f(x) -> x | s(x) -> t(x)
 s(a) -> t(b)
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.