/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 y)
(RULES
if(false,x,y) -> y
if(true,x,y) -> x
le(0,y) -> true
le(s(x),0) -> false
le(s(x),s(y)) -> le(x,y)
minus(x,0) -> x
minus(x,s(y)) -> if(le(x,s(y)),0,p(minus(x,p(s(y)))))
p(0) -> 0
p(s(x)) -> x
)

Problem 1: 

Innermost Equivalent Processor:
-> Rules:
 if(false,x,y) -> y
 if(true,x,y) -> x
 le(0,y) -> true
 le(s(x),0) -> false
 le(s(x),s(y)) -> le(x,y)
 minus(x,0) -> x
 minus(x,s(y)) -> if(le(x,s(y)),0,p(minus(x,p(s(y)))))
 p(0) -> 0
 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:
 LE(s(x),s(y)) -> LE(x,y)
 MINUS(x,s(y)) -> IF(le(x,s(y)),0,p(minus(x,p(s(y)))))
 MINUS(x,s(y)) -> LE(x,s(y))
 MINUS(x,s(y)) -> MINUS(x,p(s(y)))
 MINUS(x,s(y)) -> P(minus(x,p(s(y))))
 MINUS(x,s(y)) -> P(s(y))
-> Rules:
 if(false,x,y) -> y
 if(true,x,y) -> x
 le(0,y) -> true
 le(s(x),0) -> false
 le(s(x),s(y)) -> le(x,y)
 minus(x,0) -> x
 minus(x,s(y)) -> if(le(x,s(y)),0,p(minus(x,p(s(y)))))
 p(0) -> 0
 p(s(x)) -> x

Problem 1: 

SCC Processor:
-> Pairs:
 LE(s(x),s(y)) -> LE(x,y)
 MINUS(x,s(y)) -> IF(le(x,s(y)),0,p(minus(x,p(s(y)))))
 MINUS(x,s(y)) -> LE(x,s(y))
 MINUS(x,s(y)) -> MINUS(x,p(s(y)))
 MINUS(x,s(y)) -> P(minus(x,p(s(y))))
 MINUS(x,s(y)) -> P(s(y))
-> Rules:
 if(false,x,y) -> y
 if(true,x,y) -> x
 le(0,y) -> true
 le(s(x),0) -> false
 le(s(x),s(y)) -> le(x,y)
 minus(x,0) -> x
 minus(x,s(y)) -> if(le(x,s(y)),0,p(minus(x,p(s(y)))))
 p(0) -> 0
 p(s(x)) -> x
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 LE(s(x),s(y)) -> LE(x,y)
->->-> Rules:
 if(false,x,y) -> y
 if(true,x,y) -> x
 le(0,y) -> true
 le(s(x),0) -> false
 le(s(x),s(y)) -> le(x,y)
 minus(x,0) -> x
 minus(x,s(y)) -> if(le(x,s(y)),0,p(minus(x,p(s(y)))))
 p(0) -> 0
 p(s(x)) -> x
->->Cycle:
->->-> Pairs:
 MINUS(x,s(y)) -> MINUS(x,p(s(y)))
->->-> Rules:
 if(false,x,y) -> y
 if(true,x,y) -> x
 le(0,y) -> true
 le(s(x),0) -> false
 le(s(x),s(y)) -> le(x,y)
 minus(x,0) -> x
 minus(x,s(y)) -> if(le(x,s(y)),0,p(minus(x,p(s(y)))))
 p(0) -> 0
 p(s(x)) -> x


The problem is decomposed in 2 subproblems.

Problem 1.1: 

Subterm Processor:
-> Pairs:
 LE(s(x),s(y)) -> LE(x,y)
-> Rules:
 if(false,x,y) -> y
 if(true,x,y) -> x
 le(0,y) -> true
 le(s(x),0) -> false
 le(s(x),s(y)) -> le(x,y)
 minus(x,0) -> x
 minus(x,s(y)) -> if(le(x,s(y)),0,p(minus(x,p(s(y)))))
 p(0) -> 0
 p(s(x)) -> x
->Projection:
 pi(LE) = 1

Problem 1.1: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 if(false,x,y) -> y
 if(true,x,y) -> x
 le(0,y) -> true
 le(s(x),0) -> false
 le(s(x),s(y)) -> le(x,y)
 minus(x,0) -> x
 minus(x,s(y)) -> if(le(x,s(y)),0,p(minus(x,p(s(y)))))
 p(0) -> 0
 p(s(x)) -> x
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.2: 

Reduction Pairs Processor:
-> Pairs:
 MINUS(x,s(y)) -> MINUS(x,p(s(y)))
-> Rules:
 if(false,x,y) -> y
 if(true,x,y) -> x
 le(0,y) -> true
 le(s(x),0) -> false
 le(s(x),s(y)) -> le(x,y)
 minus(x,0) -> x
 minus(x,s(y)) -> if(le(x,s(y)),0,p(minus(x,p(s(y)))))
 p(0) -> 0
 p(s(x)) -> x
-> Usable rules:
 p(0) -> 0
 p(s(x)) -> x
->Interpretation type:
 Linear
->Coefficients:
 All rationals
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[p](X) = 1/2.X + 1/2
[0] = 1/2
[s](X) = 2.X + 2
[MINUS](X1,X2) = 2.X2

Problem 1.2: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 if(false,x,y) -> y
 if(true,x,y) -> x
 le(0,y) -> true
 le(s(x),0) -> false
 le(s(x),s(y)) -> le(x,y)
 minus(x,0) -> x
 minus(x,s(y)) -> if(le(x,s(y)),0,p(minus(x,p(s(y)))))
 p(0) -> 0
 p(s(x)) -> x
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.