Term Rewriting System R:
[x, y, n, m]
eq(0, 0) -> true
eq(0, s(x)) -> false
eq(s(x), 0) -> false
eq(s(x), s(y)) -> eq(x, y)
le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
min(add(n, nil)) -> n
min(add(n, add(m, x))) -> ifmin(le(n, m), add(n, add(m, x)))
ifmin(true, add(n, add(m, x))) -> min(add(n, x))
ifmin(false, add(n, add(m, x))) -> min(add(m, x))
rm(n, nil) -> nil
rm(n, add(m, x)) -> ifrm(eq(n, m), n, add(m, x))
ifrm(true, n, add(m, x)) -> rm(n, x)
ifrm(false, n, add(m, x)) -> add(m, rm(n, x))
minsort(nil, nil) -> nil
minsort(add(n, x), y) -> ifminsort(eq(n, min(add(n, x))), add(n, x), y)
ifminsort(true, add(n, x), y) -> add(n, minsort(app(rm(n, x), y), nil))
ifminsort(false, add(n, x), y) -> minsort(x, add(n, y))

Termination of R to be shown.



   R
Dependency Pair Analysis



R contains the following Dependency Pairs:

EQ(s(x), s(y)) -> EQ(x, y)
LE(s(x), s(y)) -> LE(x, y)
APP(add(n, x), y) -> APP(x, y)
MIN(add(n, add(m, x))) -> IFMIN(le(n, m), add(n, add(m, x)))
MIN(add(n, add(m, x))) -> LE(n, m)
IFMIN(true, add(n, add(m, x))) -> MIN(add(n, x))
IFMIN(false, add(n, add(m, x))) -> MIN(add(m, x))
RM(n, add(m, x)) -> IFRM(eq(n, m), n, add(m, x))
RM(n, add(m, x)) -> EQ(n, m)
IFRM(true, n, add(m, x)) -> RM(n, x)
IFRM(false, n, add(m, x)) -> RM(n, x)
MINSORT(add(n, x), y) -> IFMINSORT(eq(n, min(add(n, x))), add(n, x), y)
MINSORT(add(n, x), y) -> EQ(n, min(add(n, x)))
MINSORT(add(n, x), y) -> MIN(add(n, x))
IFMINSORT(true, add(n, x), y) -> MINSORT(app(rm(n, x), y), nil)
IFMINSORT(true, add(n, x), y) -> APP(rm(n, x), y)
IFMINSORT(true, add(n, x), y) -> RM(n, x)
IFMINSORT(false, add(n, x), y) -> MINSORT(x, add(n, y))

Furthermore, R contains six SCCs.


   R
DPs
       →DP Problem 1
Argument Filtering and Ordering
       →DP Problem 2
AFS
       →DP Problem 3
AFS
       →DP Problem 4
AFS
       →DP Problem 5
AFS
       →DP Problem 6
AFS


Dependency Pair:

EQ(s(x), s(y)) -> EQ(x, y)


Rules:


eq(0, 0) -> true
eq(0, s(x)) -> false
eq(s(x), 0) -> false
eq(s(x), s(y)) -> eq(x, y)
le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
min(add(n, nil)) -> n
min(add(n, add(m, x))) -> ifmin(le(n, m), add(n, add(m, x)))
ifmin(true, add(n, add(m, x))) -> min(add(n, x))
ifmin(false, add(n, add(m, x))) -> min(add(m, x))
rm(n, nil) -> nil
rm(n, add(m, x)) -> ifrm(eq(n, m), n, add(m, x))
ifrm(true, n, add(m, x)) -> rm(n, x)
ifrm(false, n, add(m, x)) -> add(m, rm(n, x))
minsort(nil, nil) -> nil
minsort(add(n, x), y) -> ifminsort(eq(n, min(add(n, x))), add(n, x), y)
ifminsort(true, add(n, x), y) -> add(n, minsort(app(rm(n, x), y), nil))
ifminsort(false, add(n, x), y) -> minsort(x, add(n, y))





The following dependency pair can be strictly oriented:

EQ(s(x), s(y)) -> EQ(x, y)


There are no usable rules using the Ce-refinement that need to be oriented.
Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(EQ(x1, x2))=  x1 + x2  
  POL(s(x1))=  1 + x1  

resulting in one new DP problem.
Used Argument Filtering System:
EQ(x1, x2) -> EQ(x1, x2)
s(x1) -> s(x1)


   R
DPs
       →DP Problem 1
AFS
           →DP Problem 7
Dependency Graph
       →DP Problem 2
AFS
       →DP Problem 3
AFS
       →DP Problem 4
AFS
       →DP Problem 5
AFS
       →DP Problem 6
AFS


Dependency Pair:


Rules:


eq(0, 0) -> true
eq(0, s(x)) -> false
eq(s(x), 0) -> false
eq(s(x), s(y)) -> eq(x, y)
le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
min(add(n, nil)) -> n
min(add(n, add(m, x))) -> ifmin(le(n, m), add(n, add(m, x)))
ifmin(true, add(n, add(m, x))) -> min(add(n, x))
ifmin(false, add(n, add(m, x))) -> min(add(m, x))
rm(n, nil) -> nil
rm(n, add(m, x)) -> ifrm(eq(n, m), n, add(m, x))
ifrm(true, n, add(m, x)) -> rm(n, x)
ifrm(false, n, add(m, x)) -> add(m, rm(n, x))
minsort(nil, nil) -> nil
minsort(add(n, x), y) -> ifminsort(eq(n, min(add(n, x))), add(n, x), y)
ifminsort(true, add(n, x), y) -> add(n, minsort(app(rm(n, x), y), nil))
ifminsort(false, add(n, x), y) -> minsort(x, add(n, y))





Using the Dependency Graph resulted in no new DP problems.


   R
DPs
       →DP Problem 1
AFS
       →DP Problem 2
Argument Filtering and Ordering
       →DP Problem 3
AFS
       →DP Problem 4
AFS
       →DP Problem 5
AFS
       →DP Problem 6
AFS


Dependency Pair:

LE(s(x), s(y)) -> LE(x, y)


Rules:


eq(0, 0) -> true
eq(0, s(x)) -> false
eq(s(x), 0) -> false
eq(s(x), s(y)) -> eq(x, y)
le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
min(add(n, nil)) -> n
min(add(n, add(m, x))) -> ifmin(le(n, m), add(n, add(m, x)))
ifmin(true, add(n, add(m, x))) -> min(add(n, x))
ifmin(false, add(n, add(m, x))) -> min(add(m, x))
rm(n, nil) -> nil
rm(n, add(m, x)) -> ifrm(eq(n, m), n, add(m, x))
ifrm(true, n, add(m, x)) -> rm(n, x)
ifrm(false, n, add(m, x)) -> add(m, rm(n, x))
minsort(nil, nil) -> nil
minsort(add(n, x), y) -> ifminsort(eq(n, min(add(n, x))), add(n, x), y)
ifminsort(true, add(n, x), y) -> add(n, minsort(app(rm(n, x), y), nil))
ifminsort(false, add(n, x), y) -> minsort(x, add(n, y))





The following dependency pair can be strictly oriented:

LE(s(x), s(y)) -> LE(x, y)


There are no usable rules using the Ce-refinement that need to be oriented.
Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(LE(x1, x2))=  x1 + x2  
  POL(s(x1))=  1 + x1  

resulting in one new DP problem.
Used Argument Filtering System:
LE(x1, x2) -> LE(x1, x2)
s(x1) -> s(x1)


   R
DPs
       →DP Problem 1
AFS
       →DP Problem 2
AFS
           →DP Problem 8
Dependency Graph
       →DP Problem 3
AFS
       →DP Problem 4
AFS
       →DP Problem 5
AFS
       →DP Problem 6
AFS


Dependency Pair:


Rules:


eq(0, 0) -> true
eq(0, s(x)) -> false
eq(s(x), 0) -> false
eq(s(x), s(y)) -> eq(x, y)
le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
min(add(n, nil)) -> n
min(add(n, add(m, x))) -> ifmin(le(n, m), add(n, add(m, x)))
ifmin(true, add(n, add(m, x))) -> min(add(n, x))
ifmin(false, add(n, add(m, x))) -> min(add(m, x))
rm(n, nil) -> nil
rm(n, add(m, x)) -> ifrm(eq(n, m), n, add(m, x))
ifrm(true, n, add(m, x)) -> rm(n, x)
ifrm(false, n, add(m, x)) -> add(m, rm(n, x))
minsort(nil, nil) -> nil
minsort(add(n, x), y) -> ifminsort(eq(n, min(add(n, x))), add(n, x), y)
ifminsort(true, add(n, x), y) -> add(n, minsort(app(rm(n, x), y), nil))
ifminsort(false, add(n, x), y) -> minsort(x, add(n, y))





Using the Dependency Graph resulted in no new DP problems.


   R
DPs
       →DP Problem 1
AFS
       →DP Problem 2
AFS
       →DP Problem 3
Argument Filtering and Ordering
       →DP Problem 4
AFS
       →DP Problem 5
AFS
       →DP Problem 6
AFS


Dependency Pair:

APP(add(n, x), y) -> APP(x, y)


Rules:


eq(0, 0) -> true
eq(0, s(x)) -> false
eq(s(x), 0) -> false
eq(s(x), s(y)) -> eq(x, y)
le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
min(add(n, nil)) -> n
min(add(n, add(m, x))) -> ifmin(le(n, m), add(n, add(m, x)))
ifmin(true, add(n, add(m, x))) -> min(add(n, x))
ifmin(false, add(n, add(m, x))) -> min(add(m, x))
rm(n, nil) -> nil
rm(n, add(m, x)) -> ifrm(eq(n, m), n, add(m, x))
ifrm(true, n, add(m, x)) -> rm(n, x)
ifrm(false, n, add(m, x)) -> add(m, rm(n, x))
minsort(nil, nil) -> nil
minsort(add(n, x), y) -> ifminsort(eq(n, min(add(n, x))), add(n, x), y)
ifminsort(true, add(n, x), y) -> add(n, minsort(app(rm(n, x), y), nil))
ifminsort(false, add(n, x), y) -> minsort(x, add(n, y))





The following dependency pair can be strictly oriented:

APP(add(n, x), y) -> APP(x, y)


There are no usable rules using the Ce-refinement that need to be oriented.
Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(APP(x1, x2))=  x1 + x2  
  POL(add(x1, x2))=  1 + x1 + x2  

resulting in one new DP problem.
Used Argument Filtering System:
APP(x1, x2) -> APP(x1, x2)
add(x1, x2) -> add(x1, x2)


   R
DPs
       →DP Problem 1
AFS
       →DP Problem 2
AFS
       →DP Problem 3
AFS
           →DP Problem 9
Dependency Graph
       →DP Problem 4
AFS
       →DP Problem 5
AFS
       →DP Problem 6
AFS


Dependency Pair:


Rules:


eq(0, 0) -> true
eq(0, s(x)) -> false
eq(s(x), 0) -> false
eq(s(x), s(y)) -> eq(x, y)
le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
min(add(n, nil)) -> n
min(add(n, add(m, x))) -> ifmin(le(n, m), add(n, add(m, x)))
ifmin(true, add(n, add(m, x))) -> min(add(n, x))
ifmin(false, add(n, add(m, x))) -> min(add(m, x))
rm(n, nil) -> nil
rm(n, add(m, x)) -> ifrm(eq(n, m), n, add(m, x))
ifrm(true, n, add(m, x)) -> rm(n, x)
ifrm(false, n, add(m, x)) -> add(m, rm(n, x))
minsort(nil, nil) -> nil
minsort(add(n, x), y) -> ifminsort(eq(n, min(add(n, x))), add(n, x), y)
ifminsort(true, add(n, x), y) -> add(n, minsort(app(rm(n, x), y), nil))
ifminsort(false, add(n, x), y) -> minsort(x, add(n, y))





Using the Dependency Graph resulted in no new DP problems.


   R
DPs
       →DP Problem 1
AFS
       →DP Problem 2
AFS
       →DP Problem 3
AFS
       →DP Problem 4
Argument Filtering and Ordering
       →DP Problem 5
AFS
       →DP Problem 6
AFS


Dependency Pairs:

IFRM(false, n, add(m, x)) -> RM(n, x)
IFRM(true, n, add(m, x)) -> RM(n, x)
RM(n, add(m, x)) -> IFRM(eq(n, m), n, add(m, x))


Rules:


eq(0, 0) -> true
eq(0, s(x)) -> false
eq(s(x), 0) -> false
eq(s(x), s(y)) -> eq(x, y)
le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
min(add(n, nil)) -> n
min(add(n, add(m, x))) -> ifmin(le(n, m), add(n, add(m, x)))
ifmin(true, add(n, add(m, x))) -> min(add(n, x))
ifmin(false, add(n, add(m, x))) -> min(add(m, x))
rm(n, nil) -> nil
rm(n, add(m, x)) -> ifrm(eq(n, m), n, add(m, x))
ifrm(true, n, add(m, x)) -> rm(n, x)
ifrm(false, n, add(m, x)) -> add(m, rm(n, x))
minsort(nil, nil) -> nil
minsort(add(n, x), y) -> ifminsort(eq(n, min(add(n, x))), add(n, x), y)
ifminsort(true, add(n, x), y) -> add(n, minsort(app(rm(n, x), y), nil))
ifminsort(false, add(n, x), y) -> minsort(x, add(n, y))





The following dependency pairs can be strictly oriented:

IFRM(false, n, add(m, x)) -> RM(n, x)
IFRM(true, n, add(m, x)) -> RM(n, x)


The following usable rules using the Ce-refinement can be oriented:

eq(0, 0) -> true
eq(0, s(x)) -> false
eq(s(x), 0) -> false
eq(s(x), s(y)) -> eq(x, y)


Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(IF_RM(x1, x2, x3))=  x1 + x2 + x3  
  POL(eq)=  0  
  POL(false)=  0  
  POL(true)=  0  
  POL(RM(x1, x2))=  x1 + x2  
  POL(add(x1, x2))=  1 + x1 + x2  

resulting in one new DP problem.
Used Argument Filtering System:
IFRM(x1, x2, x3) -> IFRM(x1, x2, x3)
RM(x1, x2) -> RM(x1, x2)
add(x1, x2) -> add(x1, x2)
eq(x1, x2) -> eq


   R
DPs
       →DP Problem 1
AFS
       →DP Problem 2
AFS
       →DP Problem 3
AFS
       →DP Problem 4
AFS
           →DP Problem 10
Dependency Graph
       →DP Problem 5
AFS
       →DP Problem 6
AFS


Dependency Pair:

RM(n, add(m, x)) -> IFRM(eq(n, m), n, add(m, x))


Rules:


eq(0, 0) -> true
eq(0, s(x)) -> false
eq(s(x), 0) -> false
eq(s(x), s(y)) -> eq(x, y)
le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
min(add(n, nil)) -> n
min(add(n, add(m, x))) -> ifmin(le(n, m), add(n, add(m, x)))
ifmin(true, add(n, add(m, x))) -> min(add(n, x))
ifmin(false, add(n, add(m, x))) -> min(add(m, x))
rm(n, nil) -> nil
rm(n, add(m, x)) -> ifrm(eq(n, m), n, add(m, x))
ifrm(true, n, add(m, x)) -> rm(n, x)
ifrm(false, n, add(m, x)) -> add(m, rm(n, x))
minsort(nil, nil) -> nil
minsort(add(n, x), y) -> ifminsort(eq(n, min(add(n, x))), add(n, x), y)
ifminsort(true, add(n, x), y) -> add(n, minsort(app(rm(n, x), y), nil))
ifminsort(false, add(n, x), y) -> minsort(x, add(n, y))





Using the Dependency Graph resulted in no new DP problems.


   R
DPs
       →DP Problem 1
AFS
       →DP Problem 2
AFS
       →DP Problem 3
AFS
       →DP Problem 4
AFS
       →DP Problem 5
Argument Filtering and Ordering
       →DP Problem 6
AFS


Dependency Pairs:

IFMIN(false, add(n, add(m, x))) -> MIN(add(m, x))
IFMIN(true, add(n, add(m, x))) -> MIN(add(n, x))
MIN(add(n, add(m, x))) -> IFMIN(le(n, m), add(n, add(m, x)))


Rules:


eq(0, 0) -> true
eq(0, s(x)) -> false
eq(s(x), 0) -> false
eq(s(x), s(y)) -> eq(x, y)
le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
min(add(n, nil)) -> n
min(add(n, add(m, x))) -> ifmin(le(n, m), add(n, add(m, x)))
ifmin(true, add(n, add(m, x))) -> min(add(n, x))
ifmin(false, add(n, add(m, x))) -> min(add(m, x))
rm(n, nil) -> nil
rm(n, add(m, x)) -> ifrm(eq(n, m), n, add(m, x))
ifrm(true, n, add(m, x)) -> rm(n, x)
ifrm(false, n, add(m, x)) -> add(m, rm(n, x))
minsort(nil, nil) -> nil
minsort(add(n, x), y) -> ifminsort(eq(n, min(add(n, x))), add(n, x), y)
ifminsort(true, add(n, x), y) -> add(n, minsort(app(rm(n, x), y), nil))
ifminsort(false, add(n, x), y) -> minsort(x, add(n, y))





The following dependency pair can be strictly oriented:

MIN(add(n, add(m, x))) -> IFMIN(le(n, m), add(n, add(m, x)))


The following usable rules using the Ce-refinement can be oriented:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)


Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(false)=  0  
  POL(MIN(x1))=  1 + x1  
  POL(true)=  0  
  POL(IF_MIN(x1, x2))=  x1 + x2  
  POL(le)=  0  
  POL(add(x1, x2))=  1 + x1 + x2  

resulting in one new DP problem.
Used Argument Filtering System:
MIN(x1) -> MIN(x1)
IFMIN(x1, x2) -> IFMIN(x1, x2)
add(x1, x2) -> add(x1, x2)
le(x1, x2) -> le


   R
DPs
       →DP Problem 1
AFS
       →DP Problem 2
AFS
       →DP Problem 3
AFS
       →DP Problem 4
AFS
       →DP Problem 5
AFS
           →DP Problem 11
Dependency Graph
       →DP Problem 6
AFS


Dependency Pairs:

IFMIN(false, add(n, add(m, x))) -> MIN(add(m, x))
IFMIN(true, add(n, add(m, x))) -> MIN(add(n, x))


Rules:


eq(0, 0) -> true
eq(0, s(x)) -> false
eq(s(x), 0) -> false
eq(s(x), s(y)) -> eq(x, y)
le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
min(add(n, nil)) -> n
min(add(n, add(m, x))) -> ifmin(le(n, m), add(n, add(m, x)))
ifmin(true, add(n, add(m, x))) -> min(add(n, x))
ifmin(false, add(n, add(m, x))) -> min(add(m, x))
rm(n, nil) -> nil
rm(n, add(m, x)) -> ifrm(eq(n, m), n, add(m, x))
ifrm(true, n, add(m, x)) -> rm(n, x)
ifrm(false, n, add(m, x)) -> add(m, rm(n, x))
minsort(nil, nil) -> nil
minsort(add(n, x), y) -> ifminsort(eq(n, min(add(n, x))), add(n, x), y)
ifminsort(true, add(n, x), y) -> add(n, minsort(app(rm(n, x), y), nil))
ifminsort(false, add(n, x), y) -> minsort(x, add(n, y))





Using the Dependency Graph resulted in no new DP problems.


   R
DPs
       →DP Problem 1
AFS
       →DP Problem 2
AFS
       →DP Problem 3
AFS
       →DP Problem 4
AFS
       →DP Problem 5
AFS
       →DP Problem 6
Argument Filtering and Ordering


Dependency Pairs:

IFMINSORT(false, add(n, x), y) -> MINSORT(x, add(n, y))
IFMINSORT(true, add(n, x), y) -> MINSORT(app(rm(n, x), y), nil)
MINSORT(add(n, x), y) -> IFMINSORT(eq(n, min(add(n, x))), add(n, x), y)


Rules:


eq(0, 0) -> true
eq(0, s(x)) -> false
eq(s(x), 0) -> false
eq(s(x), s(y)) -> eq(x, y)
le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
min(add(n, nil)) -> n
min(add(n, add(m, x))) -> ifmin(le(n, m), add(n, add(m, x)))
ifmin(true, add(n, add(m, x))) -> min(add(n, x))
ifmin(false, add(n, add(m, x))) -> min(add(m, x))
rm(n, nil) -> nil
rm(n, add(m, x)) -> ifrm(eq(n, m), n, add(m, x))
ifrm(true, n, add(m, x)) -> rm(n, x)
ifrm(false, n, add(m, x)) -> add(m, rm(n, x))
minsort(nil, nil) -> nil
minsort(add(n, x), y) -> ifminsort(eq(n, min(add(n, x))), add(n, x), y)
ifminsort(true, add(n, x), y) -> add(n, minsort(app(rm(n, x), y), nil))
ifminsort(false, add(n, x), y) -> minsort(x, add(n, y))





The following dependency pair can be strictly oriented:

IFMINSORT(true, add(n, x), y) -> MINSORT(app(rm(n, x), y), nil)


The following usable rules using the Ce-refinement can be oriented:

eq(0, 0) -> true
eq(0, s(x)) -> false
eq(s(x), 0) -> false
eq(s(x), s(y)) -> eq(x, y)
min(add(n, nil)) -> n
min(add(n, add(m, x))) -> ifmin(le(n, m), add(n, add(m, x)))
ifmin(true, add(n, add(m, x))) -> min(add(n, x))
ifmin(false, add(n, add(m, x))) -> min(add(m, x))
app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
rm(n, nil) -> nil
rm(n, add(m, x)) -> ifrm(eq(n, m), n, add(m, x))
ifrm(true, n, add(m, x)) -> rm(n, x)
ifrm(false, n, add(m, x)) -> add(m, rm(n, x))
le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)


Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(false)=  0  
  POL(if_rm(x1, x2, x3))=  x1 + x2 + x3  
  POL(true)=  0  
  POL(rm(x1, x2))=  x1 + x2  
  POL(MINSORT(x1, x2))=  x1 + x2  
  POL(if_min(x1, x2))=  x1 + x2  
  POL(add(x1, x2))=  1 + x1 + x2  
  POL(IF_MINSORT(x1, x2, x3))=  x1 + x2 + x3  
  POL(eq)=  0  
  POL(nil)=  0  
  POL(min(x1))=  x1  
  POL(le)=  0  
  POL(app(x1, x2))=  x1 + x2  

resulting in one new DP problem.
Used Argument Filtering System:
MINSORT(x1, x2) -> MINSORT(x1, x2)
IFMINSORT(x1, x2, x3) -> IFMINSORT(x1, x2, x3)
add(x1, x2) -> add(x1, x2)
eq(x1, x2) -> eq
app(x1, x2) -> app(x1, x2)
rm(x1, x2) -> rm(x1, x2)
min(x1) -> min(x1)
ifmin(x1, x2) -> ifmin(x1, x2)
le(x1, x2) -> le
ifrm(x1, x2, x3) -> ifrm(x1, x2, x3)


   R
DPs
       →DP Problem 1
AFS
       →DP Problem 2
AFS
       →DP Problem 3
AFS
       →DP Problem 4
AFS
       →DP Problem 5
AFS
       →DP Problem 6
AFS
           →DP Problem 12
Argument Filtering and Ordering


Dependency Pairs:

IFMINSORT(false, add(n, x), y) -> MINSORT(x, add(n, y))
MINSORT(add(n, x), y) -> IFMINSORT(eq(n, min(add(n, x))), add(n, x), y)


Rules:


eq(0, 0) -> true
eq(0, s(x)) -> false
eq(s(x), 0) -> false
eq(s(x), s(y)) -> eq(x, y)
le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
min(add(n, nil)) -> n
min(add(n, add(m, x))) -> ifmin(le(n, m), add(n, add(m, x)))
ifmin(true, add(n, add(m, x))) -> min(add(n, x))
ifmin(false, add(n, add(m, x))) -> min(add(m, x))
rm(n, nil) -> nil
rm(n, add(m, x)) -> ifrm(eq(n, m), n, add(m, x))
ifrm(true, n, add(m, x)) -> rm(n, x)
ifrm(false, n, add(m, x)) -> add(m, rm(n, x))
minsort(nil, nil) -> nil
minsort(add(n, x), y) -> ifminsort(eq(n, min(add(n, x))), add(n, x), y)
ifminsort(true, add(n, x), y) -> add(n, minsort(app(rm(n, x), y), nil))
ifminsort(false, add(n, x), y) -> minsort(x, add(n, y))





The following dependency pair can be strictly oriented:

IFMINSORT(false, add(n, x), y) -> MINSORT(x, add(n, y))


The following usable rules using the Ce-refinement can be oriented:

eq(0, 0) -> true
eq(0, s(x)) -> false
eq(s(x), 0) -> false
eq(s(x), s(y)) -> eq(x, y)
min(add(n, nil)) -> n
min(add(n, add(m, x))) -> ifmin(le(n, m), add(n, add(m, x)))
ifmin(true, add(n, add(m, x))) -> min(add(n, x))
ifmin(false, add(n, add(m, x))) -> min(add(m, x))
le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)


Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(eq(x1, x2))=  x1 + x2  
  POL(0)=  0  
  POL(false)=  0  
  POL(true)=  0  
  POL(min(x1))=  x1  
  POL(nil)=  1  
  POL(s(x1))=  x1  
  POL(le)=  0  
  POL(if_min(x1, x2))=  x1 + x2  
  POL(add(x1, x2))=  1 + x1 + x2  

resulting in one new DP problem.
Used Argument Filtering System:
MINSORT(x1, x2) -> x1
add(x1, x2) -> add(x1, x2)
IFMINSORT(x1, x2, x3) -> x2
eq(x1, x2) -> eq(x1, x2)
s(x1) -> s(x1)
min(x1) -> min(x1)
ifmin(x1, x2) -> ifmin(x1, x2)
le(x1, x2) -> le


   R
DPs
       →DP Problem 1
AFS
       →DP Problem 2
AFS
       →DP Problem 3
AFS
       →DP Problem 4
AFS
       →DP Problem 5
AFS
       →DP Problem 6
AFS
           →DP Problem 12
AFS
             ...
               →DP Problem 13
Dependency Graph


Dependency Pair:

MINSORT(add(n, x), y) -> IFMINSORT(eq(n, min(add(n, x))), add(n, x), y)


Rules:


eq(0, 0) -> true
eq(0, s(x)) -> false
eq(s(x), 0) -> false
eq(s(x), s(y)) -> eq(x, y)
le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
min(add(n, nil)) -> n
min(add(n, add(m, x))) -> ifmin(le(n, m), add(n, add(m, x)))
ifmin(true, add(n, add(m, x))) -> min(add(n, x))
ifmin(false, add(n, add(m, x))) -> min(add(m, x))
rm(n, nil) -> nil
rm(n, add(m, x)) -> ifrm(eq(n, m), n, add(m, x))
ifrm(true, n, add(m, x)) -> rm(n, x)
ifrm(false, n, add(m, x)) -> add(m, rm(n, x))
minsort(nil, nil) -> nil
minsort(add(n, x), y) -> ifminsort(eq(n, min(add(n, x))), add(n, x), y)
ifminsort(true, add(n, x), y) -> add(n, minsort(app(rm(n, x), y), nil))
ifminsort(false, add(n, x), y) -> minsort(x, add(n, y))





Using the Dependency Graph resulted in no new DP problems.

Termination of R successfully shown.
Duration:
0:27 minutes