/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
f(g(x)) -> x | x -> s(0)
g(s(x)) -> g(x)
)

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

Problem 1: 

Dependency Pairs Processor:

Conditional Termination Problem 1:
-> Pairs:
 G(s(x)) -> G(x)
-> QPairs:
 Empty
-> Rules:
 f(g(x)) -> x | x -> s(0)
 g(s(x)) -> g(x)

Conditional Termination Problem 2:
-> Pairs:
 Empty
-> QPairs:
 G(s(x)) -> G(x)
-> Rules:
 f(g(x)) -> x | x -> s(0)
 g(s(x)) -> g(x)


The problem is decomposed in 2 subproblems.

Problem 1.1: 

SCC Processor:
-> Pairs:
 G(s(x)) -> G(x)
-> QPairs:
 Empty
-> Rules:
 f(g(x)) -> x | x -> s(0)
 g(s(x)) -> g(x)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 G(s(x)) -> G(x)
->->-> Rules:
 f(g(x)) -> x | x -> s(0)
 g(s(x)) -> g(x)

Problem 1.1: 

Conditional Subterm Processor:
-> Pairs:
 G(s(x)) -> G(x)
-> QPairs:
 Empty
-> Rules:
 f(g(x)) -> x | x -> s(0)
 g(s(x)) -> g(x)
->Projection:
 pi(G) = 1

Problem 1.1: 

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

The problem is finite.

Problem 1.2: 

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

The problem is finite.