/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
half(0) -> 0
half(s(s(x))) -> s(half(x))
log(s(0)) -> 0
log(s(s(x))) -> s(log(s(half(x))))
)

Problem 1: 

Innermost Equivalent Processor:
-> Rules:
 half(0) -> 0
 half(s(s(x))) -> s(half(x))
 log(s(0)) -> 0
 log(s(s(x))) -> s(log(s(half(x))))
-> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination.
 

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 HALF(s(s(x))) -> HALF(x)
 LOG(s(s(x))) -> HALF(x)
 LOG(s(s(x))) -> LOG(s(half(x)))
-> Rules:
 half(0) -> 0
 half(s(s(x))) -> s(half(x))
 log(s(0)) -> 0
 log(s(s(x))) -> s(log(s(half(x))))

Problem 1: 

SCC Processor:
-> Pairs:
 HALF(s(s(x))) -> HALF(x)
 LOG(s(s(x))) -> HALF(x)
 LOG(s(s(x))) -> LOG(s(half(x)))
-> Rules:
 half(0) -> 0
 half(s(s(x))) -> s(half(x))
 log(s(0)) -> 0
 log(s(s(x))) -> s(log(s(half(x))))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 HALF(s(s(x))) -> HALF(x)
->->-> Rules:
 half(0) -> 0
 half(s(s(x))) -> s(half(x))
 log(s(0)) -> 0
 log(s(s(x))) -> s(log(s(half(x))))
->->Cycle:
->->-> Pairs:
 LOG(s(s(x))) -> LOG(s(half(x)))
->->-> Rules:
 half(0) -> 0
 half(s(s(x))) -> s(half(x))
 log(s(0)) -> 0
 log(s(s(x))) -> s(log(s(half(x))))


The problem is decomposed in 2 subproblems.

Problem 1.1: 

Subterm Processor:
-> Pairs:
 HALF(s(s(x))) -> HALF(x)
-> Rules:
 half(0) -> 0
 half(s(s(x))) -> s(half(x))
 log(s(0)) -> 0
 log(s(s(x))) -> s(log(s(half(x))))
->Projection:
 pi(HALF) = 1

Problem 1.1: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 half(0) -> 0
 half(s(s(x))) -> s(half(x))
 log(s(0)) -> 0
 log(s(s(x))) -> s(log(s(half(x))))
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.2: 

Reduction Pairs Processor:
-> Pairs:
 LOG(s(s(x))) -> LOG(s(half(x)))
-> Rules:
 half(0) -> 0
 half(s(s(x))) -> s(half(x))
 log(s(0)) -> 0
 log(s(s(x))) -> s(log(s(half(x))))
-> Usable rules:
 half(0) -> 0
 half(s(s(x))) -> s(half(x))
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[half](X) = 2.X
[0] = 2
[s](X) = 2.X + 2
[LOG](X) = X

Problem 1.2: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 half(0) -> 0
 half(s(s(x))) -> s(half(x))
 log(s(0)) -> 0
 log(s(s(x))) -> s(log(s(half(x))))
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.