R
↳Dependency Pair Analysis
APP(app(filter, f), app(app(cons, x), xs)) -> APP(app(app(if, app(f, x)), app(app(cons, x), app(app(filter, f), xs))), app(app(filter, f), xs))
APP(app(filter, f), app(app(cons, x), xs)) -> APP(app(if, app(f, x)), app(app(cons, x), app(app(filter, f), xs)))
APP(app(filter, f), app(app(cons, x), xs)) -> APP(if, app(f, x))
APP(app(filter, f), app(app(cons, x), xs)) -> APP(f, x)
APP(app(filter, f), app(app(cons, x), xs)) -> APP(app(cons, x), app(app(filter, f), xs))
APP(app(filter, f), app(app(cons, x), xs)) -> APP(app(filter, f), xs)
R
↳DPs
→DP Problem 1
↳Narrowing Transformation
APP(app(filter, f), app(app(cons, x), xs)) -> APP(app(filter, f), xs)
APP(app(filter, f), app(app(cons, x), xs)) -> APP(f, x)
APP(app(filter, f), app(app(cons, x), xs)) -> APP(app(if, app(f, x)), app(app(cons, x), app(app(filter, f), xs)))
APP(app(filter, f), app(app(cons, x), xs)) -> APP(app(app(if, app(f, x)), app(app(cons, x), app(app(filter, f), xs))), app(app(filter, f), xs))
app(app(app(if, true), x), y) -> x
app(app(app(if, false), x), y) -> y
app(app(filter, f), nil) -> nil
app(app(filter, f), app(app(cons, x), xs)) -> app(app(app(if, app(f, x)), app(app(cons, x), app(app(filter, f), xs))), app(app(filter, f), xs))
innermost
eight new Dependency Pairs are created:
APP(app(filter, f), app(app(cons, x), xs)) -> APP(app(app(if, app(f, x)), app(app(cons, x), app(app(filter, f), xs))), app(app(filter, f), xs))
APP(app(filter, app(app(if, true), x'')), app(app(cons, x0), xs)) -> APP(app(app(if, x''), app(app(cons, x0), app(app(filter, app(app(if, true), x'')), xs))), app(app(filter, app(app(if, true), x'')), xs))
APP(app(filter, app(app(if, false), x'')), app(app(cons, x0), xs)) -> APP(app(app(if, x0), app(app(cons, x0), app(app(filter, app(app(if, false), x'')), xs))), app(app(filter, app(app(if, false), x'')), xs))
APP(app(filter, app(filter, f'')), app(app(cons, nil), xs)) -> APP(app(app(if, nil), app(app(cons, nil), app(app(filter, app(filter, f'')), xs))), app(app(filter, app(filter, f'')), xs))
APP(app(filter, app(filter, f'')), app(app(cons, app(app(cons, x''), xs'')), xs)) -> APP(app(app(if, app(app(app(if, app(f'', x'')), app(app(cons, x''), app(app(filter, f''), xs''))), app(app(filter, f''), xs''))), app(app(cons, app(app(cons, x''), xs'')), app(app(filter, app(filter, f'')), xs))), app(app(filter, app(filter, f'')), xs))
APP(app(filter, f''), app(app(cons, x), nil)) -> APP(app(app(if, app(f'', x)), app(app(cons, x), nil)), app(app(filter, f''), nil))
APP(app(filter, f''), app(app(cons, x), app(app(cons, x''), xs''))) -> APP(app(app(if, app(f'', x)), app(app(cons, x), app(app(app(if, app(f'', x'')), app(app(cons, x''), app(app(filter, f''), xs''))), app(app(filter, f''), xs'')))), app(app(filter, f''), app(app(cons, x''), xs'')))
APP(app(filter, f''), app(app(cons, x), nil)) -> APP(app(app(if, app(f'', x)), app(app(cons, x), app(app(filter, f''), nil))), nil)
APP(app(filter, f''), app(app(cons, x), app(app(cons, x''), xs''))) -> APP(app(app(if, app(f'', x)), app(app(cons, x), app(app(filter, f''), app(app(cons, x''), xs'')))), app(app(app(if, app(f'', x'')), app(app(cons, x''), app(app(filter, f''), xs''))), app(app(filter, f''), xs'')))
R
↳DPs
→DP Problem 1
↳Nar
→DP Problem 2
↳Rewriting Transformation
APP(app(filter, f''), app(app(cons, x), app(app(cons, x''), xs''))) -> APP(app(app(if, app(f'', x)), app(app(cons, x), app(app(filter, f''), app(app(cons, x''), xs'')))), app(app(app(if, app(f'', x'')), app(app(cons, x''), app(app(filter, f''), xs''))), app(app(filter, f''), xs'')))
APP(app(filter, f''), app(app(cons, x), app(app(cons, x''), xs''))) -> APP(app(app(if, app(f'', x)), app(app(cons, x), app(app(app(if, app(f'', x'')), app(app(cons, x''), app(app(filter, f''), xs''))), app(app(filter, f''), xs'')))), app(app(filter, f''), app(app(cons, x''), xs'')))
APP(app(filter, f''), app(app(cons, x), nil)) -> APP(app(app(if, app(f'', x)), app(app(cons, x), nil)), app(app(filter, f''), nil))
APP(app(filter, app(filter, f'')), app(app(cons, app(app(cons, x''), xs'')), xs)) -> APP(app(app(if, app(app(app(if, app(f'', x'')), app(app(cons, x''), app(app(filter, f''), xs''))), app(app(filter, f''), xs''))), app(app(cons, app(app(cons, x''), xs'')), app(app(filter, app(filter, f'')), xs))), app(app(filter, app(filter, f'')), xs))
APP(app(filter, app(filter, f'')), app(app(cons, nil), xs)) -> APP(app(app(if, nil), app(app(cons, nil), app(app(filter, app(filter, f'')), xs))), app(app(filter, app(filter, f'')), xs))
APP(app(filter, app(app(if, false), x'')), app(app(cons, x0), xs)) -> APP(app(app(if, x0), app(app(cons, x0), app(app(filter, app(app(if, false), x'')), xs))), app(app(filter, app(app(if, false), x'')), xs))
APP(app(filter, app(app(if, true), x'')), app(app(cons, x0), xs)) -> APP(app(app(if, x''), app(app(cons, x0), app(app(filter, app(app(if, true), x'')), xs))), app(app(filter, app(app(if, true), x'')), xs))
APP(app(filter, f), app(app(cons, x), xs)) -> APP(f, x)
APP(app(filter, f), app(app(cons, x), xs)) -> APP(app(if, app(f, x)), app(app(cons, x), app(app(filter, f), xs)))
APP(app(filter, f), app(app(cons, x), xs)) -> APP(app(filter, f), xs)
app(app(app(if, true), x), y) -> x
app(app(app(if, false), x), y) -> y
app(app(filter, f), nil) -> nil
app(app(filter, f), app(app(cons, x), xs)) -> app(app(app(if, app(f, x)), app(app(cons, x), app(app(filter, f), xs))), app(app(filter, f), xs))
innermost
one new Dependency Pair is created:
APP(app(filter, f''), app(app(cons, x), nil)) -> APP(app(app(if, app(f'', x)), app(app(cons, x), nil)), app(app(filter, f''), nil))
APP(app(filter, f''), app(app(cons, x), nil)) -> APP(app(app(if, app(f'', x)), app(app(cons, x), nil)), nil)
R
↳DPs
→DP Problem 1
↳Nar
→DP Problem 2
↳Rw
...
→DP Problem 3
↳Rewriting Transformation
APP(app(filter, f''), app(app(cons, x), app(app(cons, x''), xs''))) -> APP(app(app(if, app(f'', x)), app(app(cons, x), app(app(app(if, app(f'', x'')), app(app(cons, x''), app(app(filter, f''), xs''))), app(app(filter, f''), xs'')))), app(app(filter, f''), app(app(cons, x''), xs'')))
APP(app(filter, app(filter, f'')), app(app(cons, app(app(cons, x''), xs'')), xs)) -> APP(app(app(if, app(app(app(if, app(f'', x'')), app(app(cons, x''), app(app(filter, f''), xs''))), app(app(filter, f''), xs''))), app(app(cons, app(app(cons, x''), xs'')), app(app(filter, app(filter, f'')), xs))), app(app(filter, app(filter, f'')), xs))
APP(app(filter, app(filter, f'')), app(app(cons, nil), xs)) -> APP(app(app(if, nil), app(app(cons, nil), app(app(filter, app(filter, f'')), xs))), app(app(filter, app(filter, f'')), xs))
APP(app(filter, app(app(if, false), x'')), app(app(cons, x0), xs)) -> APP(app(app(if, x0), app(app(cons, x0), app(app(filter, app(app(if, false), x'')), xs))), app(app(filter, app(app(if, false), x'')), xs))
APP(app(filter, app(app(if, true), x'')), app(app(cons, x0), xs)) -> APP(app(app(if, x''), app(app(cons, x0), app(app(filter, app(app(if, true), x'')), xs))), app(app(filter, app(app(if, true), x'')), xs))
APP(app(filter, f), app(app(cons, x), xs)) -> APP(app(filter, f), xs)
APP(app(filter, f), app(app(cons, x), xs)) -> APP(f, x)
APP(app(filter, f), app(app(cons, x), xs)) -> APP(app(if, app(f, x)), app(app(cons, x), app(app(filter, f), xs)))
APP(app(filter, f''), app(app(cons, x), app(app(cons, x''), xs''))) -> APP(app(app(if, app(f'', x)), app(app(cons, x), app(app(filter, f''), app(app(cons, x''), xs'')))), app(app(app(if, app(f'', x'')), app(app(cons, x''), app(app(filter, f''), xs''))), app(app(filter, f''), xs'')))
app(app(app(if, true), x), y) -> x
app(app(app(if, false), x), y) -> y
app(app(filter, f), nil) -> nil
app(app(filter, f), app(app(cons, x), xs)) -> app(app(app(if, app(f, x)), app(app(cons, x), app(app(filter, f), xs))), app(app(filter, f), xs))
innermost
one new Dependency Pair is created:
APP(app(filter, f''), app(app(cons, x), app(app(cons, x''), xs''))) -> APP(app(app(if, app(f'', x)), app(app(cons, x), app(app(app(if, app(f'', x'')), app(app(cons, x''), app(app(filter, f''), xs''))), app(app(filter, f''), xs'')))), app(app(filter, f''), app(app(cons, x''), xs'')))
APP(app(filter, f''), app(app(cons, x), app(app(cons, x''), xs''))) -> APP(app(app(if, app(f'', x)), app(app(cons, x), app(app(app(if, app(f'', x'')), app(app(cons, x''), app(app(filter, f''), xs''))), app(app(filter, f''), xs'')))), app(app(app(if, app(f'', x'')), app(app(cons, x''), app(app(filter, f''), xs''))), app(app(filter, f''), xs'')))
R
↳DPs
→DP Problem 1
↳Nar
→DP Problem 2
↳Rw
...
→DP Problem 4
↳Rewriting Transformation
APP(app(filter, f''), app(app(cons, x), app(app(cons, x''), xs''))) -> APP(app(app(if, app(f'', x)), app(app(cons, x), app(app(app(if, app(f'', x'')), app(app(cons, x''), app(app(filter, f''), xs''))), app(app(filter, f''), xs'')))), app(app(app(if, app(f'', x'')), app(app(cons, x''), app(app(filter, f''), xs''))), app(app(filter, f''), xs'')))
APP(app(filter, f''), app(app(cons, x), app(app(cons, x''), xs''))) -> APP(app(app(if, app(f'', x)), app(app(cons, x), app(app(filter, f''), app(app(cons, x''), xs'')))), app(app(app(if, app(f'', x'')), app(app(cons, x''), app(app(filter, f''), xs''))), app(app(filter, f''), xs'')))
APP(app(filter, app(filter, f'')), app(app(cons, nil), xs)) -> APP(app(app(if, nil), app(app(cons, nil), app(app(filter, app(filter, f'')), xs))), app(app(filter, app(filter, f'')), xs))
APP(app(filter, app(app(if, false), x'')), app(app(cons, x0), xs)) -> APP(app(app(if, x0), app(app(cons, x0), app(app(filter, app(app(if, false), x'')), xs))), app(app(filter, app(app(if, false), x'')), xs))
APP(app(filter, app(app(if, true), x'')), app(app(cons, x0), xs)) -> APP(app(app(if, x''), app(app(cons, x0), app(app(filter, app(app(if, true), x'')), xs))), app(app(filter, app(app(if, true), x'')), xs))
APP(app(filter, f), app(app(cons, x), xs)) -> APP(app(filter, f), xs)
APP(app(filter, f), app(app(cons, x), xs)) -> APP(f, x)
APP(app(filter, f), app(app(cons, x), xs)) -> APP(app(if, app(f, x)), app(app(cons, x), app(app(filter, f), xs)))
APP(app(filter, app(filter, f'')), app(app(cons, app(app(cons, x''), xs'')), xs)) -> APP(app(app(if, app(app(app(if, app(f'', x'')), app(app(cons, x''), app(app(filter, f''), xs''))), app(app(filter, f''), xs''))), app(app(cons, app(app(cons, x''), xs'')), app(app(filter, app(filter, f'')), xs))), app(app(filter, app(filter, f'')), xs))
app(app(app(if, true), x), y) -> x
app(app(app(if, false), x), y) -> y
app(app(filter, f), nil) -> nil
app(app(filter, f), app(app(cons, x), xs)) -> app(app(app(if, app(f, x)), app(app(cons, x), app(app(filter, f), xs))), app(app(filter, f), xs))
innermost
one new Dependency Pair is created:
APP(app(filter, f''), app(app(cons, x), app(app(cons, x''), xs''))) -> APP(app(app(if, app(f'', x)), app(app(cons, x), app(app(filter, f''), app(app(cons, x''), xs'')))), app(app(app(if, app(f'', x'')), app(app(cons, x''), app(app(filter, f''), xs''))), app(app(filter, f''), xs'')))
APP(app(filter, f''), app(app(cons, x), app(app(cons, x''), xs''))) -> APP(app(app(if, app(f'', x)), app(app(cons, x), app(app(app(if, app(f'', x'')), app(app(cons, x''), app(app(filter, f''), xs''))), app(app(filter, f''), xs'')))), app(app(app(if, app(f'', x'')), app(app(cons, x''), app(app(filter, f''), xs''))), app(app(filter, f''), xs'')))
R
↳DPs
→DP Problem 1
↳Nar
→DP Problem 2
↳Rw
...
→DP Problem 5
↳Narrowing Transformation
APP(app(filter, f''), app(app(cons, x), app(app(cons, x''), xs''))) -> APP(app(app(if, app(f'', x)), app(app(cons, x), app(app(app(if, app(f'', x'')), app(app(cons, x''), app(app(filter, f''), xs''))), app(app(filter, f''), xs'')))), app(app(app(if, app(f'', x'')), app(app(cons, x''), app(app(filter, f''), xs''))), app(app(filter, f''), xs'')))
APP(app(filter, app(filter, f'')), app(app(cons, app(app(cons, x''), xs'')), xs)) -> APP(app(app(if, app(app(app(if, app(f'', x'')), app(app(cons, x''), app(app(filter, f''), xs''))), app(app(filter, f''), xs''))), app(app(cons, app(app(cons, x''), xs'')), app(app(filter, app(filter, f'')), xs))), app(app(filter, app(filter, f'')), xs))
APP(app(filter, app(filter, f'')), app(app(cons, nil), xs)) -> APP(app(app(if, nil), app(app(cons, nil), app(app(filter, app(filter, f'')), xs))), app(app(filter, app(filter, f'')), xs))
APP(app(filter, app(app(if, false), x'')), app(app(cons, x0), xs)) -> APP(app(app(if, x0), app(app(cons, x0), app(app(filter, app(app(if, false), x'')), xs))), app(app(filter, app(app(if, false), x'')), xs))
APP(app(filter, app(app(if, true), x'')), app(app(cons, x0), xs)) -> APP(app(app(if, x''), app(app(cons, x0), app(app(filter, app(app(if, true), x'')), xs))), app(app(filter, app(app(if, true), x'')), xs))
APP(app(filter, f), app(app(cons, x), xs)) -> APP(app(filter, f), xs)
APP(app(filter, f), app(app(cons, x), xs)) -> APP(f, x)
APP(app(filter, f), app(app(cons, x), xs)) -> APP(app(if, app(f, x)), app(app(cons, x), app(app(filter, f), xs)))
APP(app(filter, f''), app(app(cons, x), app(app(cons, x''), xs''))) -> APP(app(app(if, app(f'', x)), app(app(cons, x), app(app(app(if, app(f'', x'')), app(app(cons, x''), app(app(filter, f''), xs''))), app(app(filter, f''), xs'')))), app(app(app(if, app(f'', x'')), app(app(cons, x''), app(app(filter, f''), xs''))), app(app(filter, f''), xs'')))
app(app(app(if, true), x), y) -> x
app(app(app(if, false), x), y) -> y
app(app(filter, f), nil) -> nil
app(app(filter, f), app(app(cons, x), xs)) -> app(app(app(if, app(f, x)), app(app(cons, x), app(app(filter, f), xs))), app(app(filter, f), xs))
innermost
six new Dependency Pairs are created:
APP(app(filter, f), app(app(cons, x), xs)) -> APP(app(if, app(f, x)), app(app(cons, x), app(app(filter, f), xs)))
APP(app(filter, app(app(if, true), x'')), app(app(cons, x0), xs)) -> APP(app(if, x''), app(app(cons, x0), app(app(filter, app(app(if, true), x'')), xs)))
APP(app(filter, app(app(if, false), x'')), app(app(cons, x0), xs)) -> APP(app(if, x0), app(app(cons, x0), app(app(filter, app(app(if, false), x'')), xs)))
APP(app(filter, app(filter, f'')), app(app(cons, nil), xs)) -> APP(app(if, nil), app(app(cons, nil), app(app(filter, app(filter, f'')), xs)))
APP(app(filter, app(filter, f'')), app(app(cons, app(app(cons, x''), xs'')), xs)) -> APP(app(if, app(app(app(if, app(f'', x'')), app(app(cons, x''), app(app(filter, f''), xs''))), app(app(filter, f''), xs''))), app(app(cons, app(app(cons, x''), xs'')), app(app(filter, app(filter, f'')), xs)))
APP(app(filter, f''), app(app(cons, x), nil)) -> APP(app(if, app(f'', x)), app(app(cons, x), nil))
APP(app(filter, f''), app(app(cons, x), app(app(cons, x''), xs''))) -> APP(app(if, app(f'', x)), app(app(cons, x), app(app(app(if, app(f'', x'')), app(app(cons, x''), app(app(filter, f''), xs''))), app(app(filter, f''), xs''))))
R
↳DPs
→DP Problem 1
↳Nar
→DP Problem 2
↳Rw
...
→DP Problem 6
↳Forward Instantiation Transformation
APP(app(filter, f''), app(app(cons, x), app(app(cons, x''), xs''))) -> APP(app(if, app(f'', x)), app(app(cons, x), app(app(app(if, app(f'', x'')), app(app(cons, x''), app(app(filter, f''), xs''))), app(app(filter, f''), xs''))))
APP(app(filter, f''), app(app(cons, x), nil)) -> APP(app(if, app(f'', x)), app(app(cons, x), nil))
APP(app(filter, app(filter, f'')), app(app(cons, app(app(cons, x''), xs'')), xs)) -> APP(app(if, app(app(app(if, app(f'', x'')), app(app(cons, x''), app(app(filter, f''), xs''))), app(app(filter, f''), xs''))), app(app(cons, app(app(cons, x''), xs'')), app(app(filter, app(filter, f'')), xs)))
APP(app(filter, app(filter, f'')), app(app(cons, nil), xs)) -> APP(app(if, nil), app(app(cons, nil), app(app(filter, app(filter, f'')), xs)))
APP(app(filter, app(app(if, false), x'')), app(app(cons, x0), xs)) -> APP(app(if, x0), app(app(cons, x0), app(app(filter, app(app(if, false), x'')), xs)))
APP(app(filter, app(app(if, true), x'')), app(app(cons, x0), xs)) -> APP(app(if, x''), app(app(cons, x0), app(app(filter, app(app(if, true), x'')), xs)))
APP(app(filter, f''), app(app(cons, x), app(app(cons, x''), xs''))) -> APP(app(app(if, app(f'', x)), app(app(cons, x), app(app(app(if, app(f'', x'')), app(app(cons, x''), app(app(filter, f''), xs''))), app(app(filter, f''), xs'')))), app(app(app(if, app(f'', x'')), app(app(cons, x''), app(app(filter, f''), xs''))), app(app(filter, f''), xs'')))
APP(app(filter, app(filter, f'')), app(app(cons, app(app(cons, x''), xs'')), xs)) -> APP(app(app(if, app(app(app(if, app(f'', x'')), app(app(cons, x''), app(app(filter, f''), xs''))), app(app(filter, f''), xs''))), app(app(cons, app(app(cons, x''), xs'')), app(app(filter, app(filter, f'')), xs))), app(app(filter, app(filter, f'')), xs))
APP(app(filter, app(filter, f'')), app(app(cons, nil), xs)) -> APP(app(app(if, nil), app(app(cons, nil), app(app(filter, app(filter, f'')), xs))), app(app(filter, app(filter, f'')), xs))
APP(app(filter, app(app(if, false), x'')), app(app(cons, x0), xs)) -> APP(app(app(if, x0), app(app(cons, x0), app(app(filter, app(app(if, false), x'')), xs))), app(app(filter, app(app(if, false), x'')), xs))
APP(app(filter, app(app(if, true), x'')), app(app(cons, x0), xs)) -> APP(app(app(if, x''), app(app(cons, x0), app(app(filter, app(app(if, true), x'')), xs))), app(app(filter, app(app(if, true), x'')), xs))
APP(app(filter, f), app(app(cons, x), xs)) -> APP(app(filter, f), xs)
APP(app(filter, f), app(app(cons, x), xs)) -> APP(f, x)
APP(app(filter, f''), app(app(cons, x), app(app(cons, x''), xs''))) -> APP(app(app(if, app(f'', x)), app(app(cons, x), app(app(app(if, app(f'', x'')), app(app(cons, x''), app(app(filter, f''), xs''))), app(app(filter, f''), xs'')))), app(app(app(if, app(f'', x'')), app(app(cons, x''), app(app(filter, f''), xs''))), app(app(filter, f''), xs'')))
app(app(app(if, true), x), y) -> x
app(app(app(if, false), x), y) -> y
app(app(filter, f), nil) -> nil
app(app(filter, f), app(app(cons, x), xs)) -> app(app(app(if, app(f, x)), app(app(cons, x), app(app(filter, f), xs))), app(app(filter, f), xs))
innermost
seven new Dependency Pairs are created:
APP(app(filter, f), app(app(cons, x), xs)) -> APP(f, x)
APP(app(filter, app(filter, f'')), app(app(cons, app(app(cons, x''), xs'')), xs)) -> APP(app(filter, f''), app(app(cons, x''), xs''))
APP(app(filter, app(filter, app(app(if, true), x''''))), app(app(cons, app(app(cons, x0''), xs'')), xs)) -> APP(app(filter, app(app(if, true), x'''')), app(app(cons, x0''), xs''))
APP(app(filter, app(filter, app(app(if, false), x''''))), app(app(cons, app(app(cons, x0''), xs'')), xs)) -> APP(app(filter, app(app(if, false), x'''')), app(app(cons, x0''), xs''))
APP(app(filter, app(filter, app(filter, f''''))), app(app(cons, app(app(cons, nil), xs'')), xs)) -> APP(app(filter, app(filter, f'''')), app(app(cons, nil), xs''))
APP(app(filter, app(filter, app(filter, f''''))), app(app(cons, app(app(cons, app(app(cons, x''''), xs'''')), xs'')), xs)) -> APP(app(filter, app(filter, f'''')), app(app(cons, app(app(cons, x''''), xs'''')), xs''))
APP(app(filter, app(filter, f'''')), app(app(cons, app(app(cons, x''), app(app(cons, x''''), xs''''))), xs)) -> APP(app(filter, f''''), app(app(cons, x''), app(app(cons, x''''), xs'''')))
APP(app(filter, app(filter, f'''')), app(app(cons, app(app(cons, x''), nil)), xs)) -> APP(app(filter, f''''), app(app(cons, x''), nil))
R
↳DPs
→DP Problem 1
↳Nar
→DP Problem 2
↳Rw
...
→DP Problem 7
↳Remaining Obligation(s)
APP(app(filter, app(filter, f'''')), app(app(cons, app(app(cons, x''), nil)), xs)) -> APP(app(filter, f''''), app(app(cons, x''), nil))
APP(app(filter, app(filter, f'''')), app(app(cons, app(app(cons, x''), app(app(cons, x''''), xs''''))), xs)) -> APP(app(filter, f''''), app(app(cons, x''), app(app(cons, x''''), xs'''')))
APP(app(filter, app(filter, app(filter, f''''))), app(app(cons, app(app(cons, app(app(cons, x''''), xs'''')), xs'')), xs)) -> APP(app(filter, app(filter, f'''')), app(app(cons, app(app(cons, x''''), xs'''')), xs''))
APP(app(filter, app(filter, app(filter, f''''))), app(app(cons, app(app(cons, nil), xs'')), xs)) -> APP(app(filter, app(filter, f'''')), app(app(cons, nil), xs''))
APP(app(filter, app(filter, app(app(if, false), x''''))), app(app(cons, app(app(cons, x0''), xs'')), xs)) -> APP(app(filter, app(app(if, false), x'''')), app(app(cons, x0''), xs''))
APP(app(filter, app(filter, app(app(if, true), x''''))), app(app(cons, app(app(cons, x0''), xs'')), xs)) -> APP(app(filter, app(app(if, true), x'''')), app(app(cons, x0''), xs''))
APP(app(filter, app(filter, f'')), app(app(cons, app(app(cons, x''), xs'')), xs)) -> APP(app(filter, f''), app(app(cons, x''), xs''))
APP(app(filter, f''), app(app(cons, x), nil)) -> APP(app(if, app(f'', x)), app(app(cons, x), nil))
APP(app(filter, app(filter, f'')), app(app(cons, app(app(cons, x''), xs'')), xs)) -> APP(app(if, app(app(app(if, app(f'', x'')), app(app(cons, x''), app(app(filter, f''), xs''))), app(app(filter, f''), xs''))), app(app(cons, app(app(cons, x''), xs'')), app(app(filter, app(filter, f'')), xs)))
APP(app(filter, app(filter, f'')), app(app(cons, nil), xs)) -> APP(app(if, nil), app(app(cons, nil), app(app(filter, app(filter, f'')), xs)))
APP(app(filter, app(app(if, false), x'')), app(app(cons, x0), xs)) -> APP(app(if, x0), app(app(cons, x0), app(app(filter, app(app(if, false), x'')), xs)))
APP(app(filter, app(app(if, true), x'')), app(app(cons, x0), xs)) -> APP(app(if, x''), app(app(cons, x0), app(app(filter, app(app(if, true), x'')), xs)))
APP(app(filter, f''), app(app(cons, x), app(app(cons, x''), xs''))) -> APP(app(app(if, app(f'', x)), app(app(cons, x), app(app(app(if, app(f'', x'')), app(app(cons, x''), app(app(filter, f''), xs''))), app(app(filter, f''), xs'')))), app(app(app(if, app(f'', x'')), app(app(cons, x''), app(app(filter, f''), xs''))), app(app(filter, f''), xs'')))
APP(app(filter, f''), app(app(cons, x), app(app(cons, x''), xs''))) -> APP(app(app(if, app(f'', x)), app(app(cons, x), app(app(app(if, app(f'', x'')), app(app(cons, x''), app(app(filter, f''), xs''))), app(app(filter, f''), xs'')))), app(app(app(if, app(f'', x'')), app(app(cons, x''), app(app(filter, f''), xs''))), app(app(filter, f''), xs'')))
APP(app(filter, app(filter, f'')), app(app(cons, app(app(cons, x''), xs'')), xs)) -> APP(app(app(if, app(app(app(if, app(f'', x'')), app(app(cons, x''), app(app(filter, f''), xs''))), app(app(filter, f''), xs''))), app(app(cons, app(app(cons, x''), xs'')), app(app(filter, app(filter, f'')), xs))), app(app(filter, app(filter, f'')), xs))
APP(app(filter, app(filter, f'')), app(app(cons, nil), xs)) -> APP(app(app(if, nil), app(app(cons, nil), app(app(filter, app(filter, f'')), xs))), app(app(filter, app(filter, f'')), xs))
APP(app(filter, app(app(if, false), x'')), app(app(cons, x0), xs)) -> APP(app(app(if, x0), app(app(cons, x0), app(app(filter, app(app(if, false), x'')), xs))), app(app(filter, app(app(if, false), x'')), xs))
APP(app(filter, app(app(if, true), x'')), app(app(cons, x0), xs)) -> APP(app(app(if, x''), app(app(cons, x0), app(app(filter, app(app(if, true), x'')), xs))), app(app(filter, app(app(if, true), x'')), xs))
APP(app(filter, f), app(app(cons, x), xs)) -> APP(app(filter, f), xs)
APP(app(filter, f''), app(app(cons, x), app(app(cons, x''), xs''))) -> APP(app(if, app(f'', x)), app(app(cons, x), app(app(app(if, app(f'', x'')), app(app(cons, x''), app(app(filter, f''), xs''))), app(app(filter, f''), xs''))))
app(app(app(if, true), x), y) -> x
app(app(app(if, false), x), y) -> y
app(app(filter, f), nil) -> nil
app(app(filter, f), app(app(cons, x), xs)) -> app(app(app(if, app(f, x)), app(app(cons, x), app(app(filter, f), xs))), app(app(filter, f), xs))
innermost