/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
conv(0) -> cons(nil,0)
conv(s(x)) -> cons(conv(half(s(x))),lastbit(s(x)))
half(0) -> 0
half(s(0)) -> 0
half(s(s(x))) -> s(half(x))
lastbit(0) -> 0
lastbit(s(0)) -> s(0)
lastbit(s(s(x))) -> lastbit(x)
)

Problem 1: 

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

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 CONV(s(x)) -> CONV(half(s(x)))
 CONV(s(x)) -> HALF(s(x))
 CONV(s(x)) -> LASTBIT(s(x))
 HALF(s(s(x))) -> HALF(x)
 LASTBIT(s(s(x))) -> LASTBIT(x)
-> Rules:
 conv(0) -> cons(nil,0)
 conv(s(x)) -> cons(conv(half(s(x))),lastbit(s(x)))
 half(0) -> 0
 half(s(0)) -> 0
 half(s(s(x))) -> s(half(x))
 lastbit(0) -> 0
 lastbit(s(0)) -> s(0)
 lastbit(s(s(x))) -> lastbit(x)

Problem 1: 

SCC Processor:
-> Pairs:
 CONV(s(x)) -> CONV(half(s(x)))
 CONV(s(x)) -> HALF(s(x))
 CONV(s(x)) -> LASTBIT(s(x))
 HALF(s(s(x))) -> HALF(x)
 LASTBIT(s(s(x))) -> LASTBIT(x)
-> Rules:
 conv(0) -> cons(nil,0)
 conv(s(x)) -> cons(conv(half(s(x))),lastbit(s(x)))
 half(0) -> 0
 half(s(0)) -> 0
 half(s(s(x))) -> s(half(x))
 lastbit(0) -> 0
 lastbit(s(0)) -> s(0)
 lastbit(s(s(x))) -> lastbit(x)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 LASTBIT(s(s(x))) -> LASTBIT(x)
->->-> Rules:
 conv(0) -> cons(nil,0)
 conv(s(x)) -> cons(conv(half(s(x))),lastbit(s(x)))
 half(0) -> 0
 half(s(0)) -> 0
 half(s(s(x))) -> s(half(x))
 lastbit(0) -> 0
 lastbit(s(0)) -> s(0)
 lastbit(s(s(x))) -> lastbit(x)
->->Cycle:
->->-> Pairs:
 HALF(s(s(x))) -> HALF(x)
->->-> Rules:
 conv(0) -> cons(nil,0)
 conv(s(x)) -> cons(conv(half(s(x))),lastbit(s(x)))
 half(0) -> 0
 half(s(0)) -> 0
 half(s(s(x))) -> s(half(x))
 lastbit(0) -> 0
 lastbit(s(0)) -> s(0)
 lastbit(s(s(x))) -> lastbit(x)
->->Cycle:
->->-> Pairs:
 CONV(s(x)) -> CONV(half(s(x)))
->->-> Rules:
 conv(0) -> cons(nil,0)
 conv(s(x)) -> cons(conv(half(s(x))),lastbit(s(x)))
 half(0) -> 0
 half(s(0)) -> 0
 half(s(s(x))) -> s(half(x))
 lastbit(0) -> 0
 lastbit(s(0)) -> s(0)
 lastbit(s(s(x))) -> lastbit(x)


The problem is decomposed in 3 subproblems.

Problem 1.1: 

Subterm Processor:
-> Pairs:
 LASTBIT(s(s(x))) -> LASTBIT(x)
-> Rules:
 conv(0) -> cons(nil,0)
 conv(s(x)) -> cons(conv(half(s(x))),lastbit(s(x)))
 half(0) -> 0
 half(s(0)) -> 0
 half(s(s(x))) -> s(half(x))
 lastbit(0) -> 0
 lastbit(s(0)) -> s(0)
 lastbit(s(s(x))) -> lastbit(x)
->Projection:
 pi(LASTBIT) = 1

Problem 1.1: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 conv(0) -> cons(nil,0)
 conv(s(x)) -> cons(conv(half(s(x))),lastbit(s(x)))
 half(0) -> 0
 half(s(0)) -> 0
 half(s(s(x))) -> s(half(x))
 lastbit(0) -> 0
 lastbit(s(0)) -> s(0)
 lastbit(s(s(x))) -> lastbit(x)
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.2: 

Subterm Processor:
-> Pairs:
 HALF(s(s(x))) -> HALF(x)
-> Rules:
 conv(0) -> cons(nil,0)
 conv(s(x)) -> cons(conv(half(s(x))),lastbit(s(x)))
 half(0) -> 0
 half(s(0)) -> 0
 half(s(s(x))) -> s(half(x))
 lastbit(0) -> 0
 lastbit(s(0)) -> s(0)
 lastbit(s(s(x))) -> lastbit(x)
->Projection:
 pi(HALF) = 1

Problem 1.2: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 conv(0) -> cons(nil,0)
 conv(s(x)) -> cons(conv(half(s(x))),lastbit(s(x)))
 half(0) -> 0
 half(s(0)) -> 0
 half(s(s(x))) -> s(half(x))
 lastbit(0) -> 0
 lastbit(s(0)) -> s(0)
 lastbit(s(s(x))) -> lastbit(x)
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.3: 

Reduction Pairs Processor:
-> Pairs:
 CONV(s(x)) -> CONV(half(s(x)))
-> Rules:
 conv(0) -> cons(nil,0)
 conv(s(x)) -> cons(conv(half(s(x))),lastbit(s(x)))
 half(0) -> 0
 half(s(0)) -> 0
 half(s(s(x))) -> s(half(x))
 lastbit(0) -> 0
 lastbit(s(0)) -> s(0)
 lastbit(s(s(x))) -> lastbit(x)
-> Usable rules:
 half(0) -> 0
 half(s(0)) -> 0
 half(s(s(x))) -> s(half(x))
->Interpretation type:
 Linear
->Coefficients:
 All rationals
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[half](X) = 1/2.X
[0] = 0
[s](X) = X + 1/2
[CONV](X) = X

Problem 1.3: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 conv(0) -> cons(nil,0)
 conv(s(x)) -> cons(conv(half(s(x))),lastbit(s(x)))
 half(0) -> 0
 half(s(0)) -> 0
 half(s(s(x))) -> s(half(x))
 lastbit(0) -> 0
 lastbit(s(0)) -> s(0)
 lastbit(s(s(x))) -> lastbit(x)
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.