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


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


YES

Problem 1: 

(VAR x)
(RULES
A -> B
f(x) -> x | x -> a
g(x) -> C | A -> B
)

Problem 1: 
Valid CTRS Processor:
-> Rules:
 A -> B
 f(x) -> x | x -> a
 g(x) -> C | A -> 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 | x -> a
 g(x) -> C | A -> B

Conditional Termination Problem 2:
-> Pairs:
 G(x) -> A#
-> QPairs:
 Empty
-> Rules:
 A -> B
 f(x) -> x | x -> a
 g(x) -> C | A -> B


The problem is decomposed in 2 subproblems.

Problem 1.1: 

SCC Processor:
-> Pairs:
 Empty
-> QPairs:
 Empty
-> Rules:
 A -> B
 f(x) -> x | x -> a
 g(x) -> C | A -> B
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.2: 

SCC Processor:
-> Pairs:
 G(x) -> A#
-> QPairs:
 Empty
-> Rules:
 A -> B
 f(x) -> x | x -> a
 g(x) -> C | A -> B
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.