/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
fac(0) -> s(0)
fac(s(x)) -> times(s(x),fac(p(s(x))))
p(s(x)) -> x
)

Problem 1: 

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

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 FAC(s(x)) -> FAC(p(s(x)))
 FAC(s(x)) -> P(s(x))
-> Rules:
 fac(0) -> s(0)
 fac(s(x)) -> times(s(x),fac(p(s(x))))
 p(s(x)) -> x

Problem 1: 

SCC Processor:
-> Pairs:
 FAC(s(x)) -> FAC(p(s(x)))
 FAC(s(x)) -> P(s(x))
-> Rules:
 fac(0) -> s(0)
 fac(s(x)) -> times(s(x),fac(p(s(x))))
 p(s(x)) -> x
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 FAC(s(x)) -> FAC(p(s(x)))
->->-> Rules:
 fac(0) -> s(0)
 fac(s(x)) -> times(s(x),fac(p(s(x))))
 p(s(x)) -> x

Problem 1: 

Reduction Pairs Processor:
-> Pairs:
 FAC(s(x)) -> FAC(p(s(x)))
-> Rules:
 fac(0) -> s(0)
 fac(s(x)) -> times(s(x),fac(p(s(x))))
 p(s(x)) -> x
-> Usable rules:
 p(s(x)) -> x
->Interpretation type:
 Linear
->Coefficients:
 All rationals
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[p](X) = 1/2.X
[s](X) = 2.X + 1/2
[FAC](X) = 2.X

Problem 1: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 fac(0) -> s(0)
 fac(s(x)) -> times(s(x),fac(p(s(x))))
 p(s(x)) -> x
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.