/export/starexec/sandbox/solver/bin/starexec_run_ttt2 /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem: a__nats() -> cons(0(),incr(nats())) a__pairs() -> cons(0(),incr(odds())) a__odds() -> a__incr(a__pairs()) a__incr(cons(X,XS)) -> cons(s(mark(X)),incr(XS)) a__head(cons(X,XS)) -> mark(X) a__tail(cons(X,XS)) -> mark(XS) mark(nats()) -> a__nats() mark(pairs()) -> a__pairs() mark(odds()) -> a__odds() mark(incr(X)) -> a__incr(mark(X)) mark(head(X)) -> a__head(mark(X)) mark(tail(X)) -> a__tail(mark(X)) mark(0()) -> 0() mark(s(X)) -> s(mark(X)) mark(nil()) -> nil() mark(cons(X1,X2)) -> cons(mark(X1),X2) a__nats() -> nats() a__pairs() -> pairs() a__odds() -> odds() a__incr(X) -> incr(X) a__head(X) -> head(X) a__tail(X) -> tail(X) Proof: Matrix Interpretation Processor: dim=3 interpretation: [1 0 1] [cons](x0, x1) = x0 + [0 1 0]x1 [0 0 1] , [1 1 0] [1] [tail](x0) = [0 1 0]x0 + [1] [1 0 0] [1], [1 1 0] [a__incr](x0) = [0 0 1]x0 [0 0 1] , [0] [0] = [0] [0], [1 1 0] [incr](x0) = [0 0 1]x0 [0 0 1] , [0] [nil] = [1] [0], [1] [a__pairs] = [0] [0], [1 1 0] [s](x0) = [0 0 1]x0 [0 0 1] , [0] [a__nats] = [0] [0], [1] [a__odds] = [0] [0], [head](x0) = x0 , [1 1 0] [1] [a__tail](x0) = [0 1 0]x0 + [1] [1 0 0] [1], [a__head](x0) = x0 , [mark](x0) = x0 , [1] [pairs] = [0] [0], [1] [odds] = [0] [0], [0] [nats] = [0] [0] orientation: [0] [0] a__nats() = [0] >= [0] = cons(0(),incr(nats())) [0] [0] [1] [1] a__pairs() = [0] >= [0] = cons(0(),incr(odds())) [0] [0] [1] [1] a__odds() = [0] >= [0] = a__incr(a__pairs()) [0] [0] [1 1 0] [1 1 1] [1 1 0] [1 1 1] a__incr(cons(X,XS)) = [0 0 1]X + [0 0 1]XS >= [0 0 1]X + [0 0 1]XS = cons(s(mark(X)),incr(XS)) [0 0 1] [0 0 1] [0 0 1] [0 0 1] [1 0 1] a__head(cons(X,XS)) = X + [0 1 0]XS >= X = mark(X) [0 0 1] [1 1 0] [1 1 1] [1] a__tail(cons(X,XS)) = [0 1 0]X + [0 1 0]XS + [1] >= XS = mark(XS) [1 0 0] [1 0 1] [1] [0] [0] mark(nats()) = [0] >= [0] = a__nats() [0] [0] [1] [1] mark(pairs()) = [0] >= [0] = a__pairs() [0] [0] [1] [1] mark(odds()) = [0] >= [0] = a__odds() [0] [0] [1 1 0] [1 1 0] mark(incr(X)) = [0 0 1]X >= [0 0 1]X = a__incr(mark(X)) [0 0 1] [0 0 1] mark(head(X)) = X >= X = a__head(mark(X)) [1 1 0] [1] [1 1 0] [1] mark(tail(X)) = [0 1 0]X + [1] >= [0 1 0]X + [1] = a__tail(mark(X)) [1 0 0] [1] [1 0 0] [1] [0] [0] mark(0()) = [0] >= [0] = 0() [0] [0] [1 1 0] [1 1 0] mark(s(X)) = [0 0 1]X >= [0 0 1]X = s(mark(X)) [0 0 1] [0 0 1] [0] [0] mark(nil()) = [1] >= [1] = nil() [0] [0] [1 0 1] [1 0 1] mark(cons(X1,X2)) = X1 + [0 1 0]X2 >= X1 + [0 1 0]X2 = cons(mark(X1),X2) [0 0 1] [0 0 1] [0] [0] a__nats() = [0] >= [0] = nats() [0] [0] [1] [1] a__pairs() = [0] >= [0] = pairs() [0] [0] [1] [1] a__odds() = [0] >= [0] = odds() [0] [0] [1 1 0] [1 1 0] a__incr(X) = [0 0 1]X >= [0 0 1]X = incr(X) [0 0 1] [0 0 1] a__head(X) = X >= X = head(X) [1 1 0] [1] [1 1 0] [1] a__tail(X) = [0 1 0]X + [1] >= [0 1 0]X + [1] = tail(X) [1 0 0] [1] [1 0 0] [1] problem: a__nats() -> cons(0(),incr(nats())) a__pairs() -> cons(0(),incr(odds())) a__odds() -> a__incr(a__pairs()) a__incr(cons(X,XS)) -> cons(s(mark(X)),incr(XS)) a__head(cons(X,XS)) -> mark(X) mark(nats()) -> a__nats() mark(pairs()) -> a__pairs() mark(odds()) -> a__odds() mark(incr(X)) -> a__incr(mark(X)) mark(head(X)) -> a__head(mark(X)) mark(tail(X)) -> a__tail(mark(X)) mark(0()) -> 0() mark(s(X)) -> s(mark(X)) mark(nil()) -> nil() mark(cons(X1,X2)) -> cons(mark(X1),X2) a__nats() -> nats() a__pairs() -> pairs() a__odds() -> odds() a__incr(X) -> incr(X) a__head(X) -> head(X) a__tail(X) -> tail(X) Matrix Interpretation Processor: dim=1 interpretation: [cons](x0, x1) = x0 + 4x1, [tail](x0) = x0 + 2, [a__incr](x0) = 2x0, [0] = 0, [incr](x0) = 2x0, [nil] = 0, [a__pairs] = 0, [s](x0) = x0, [a__nats] = 0, [a__odds] = 0, [head](x0) = 3x0 + 1, [a__tail](x0) = x0 + 2, [a__head](x0) = 3x0 + 2, [mark](x0) = 2x0, [pairs] = 0, [odds] = 0, [nats] = 0 orientation: a__nats() = 0 >= 0 = cons(0(),incr(nats())) a__pairs() = 0 >= 0 = cons(0(),incr(odds())) a__odds() = 0 >= 0 = a__incr(a__pairs()) a__incr(cons(X,XS)) = 2X + 8XS >= 2X + 8XS = cons(s(mark(X)),incr(XS)) a__head(cons(X,XS)) = 3X + 12XS + 2 >= 2X = mark(X) mark(nats()) = 0 >= 0 = a__nats() mark(pairs()) = 0 >= 0 = a__pairs() mark(odds()) = 0 >= 0 = a__odds() mark(incr(X)) = 4X >= 4X = a__incr(mark(X)) mark(head(X)) = 6X + 2 >= 6X + 2 = a__head(mark(X)) mark(tail(X)) = 2X + 4 >= 2X + 2 = a__tail(mark(X)) mark(0()) = 0 >= 0 = 0() mark(s(X)) = 2X >= 2X = s(mark(X)) mark(nil()) = 0 >= 0 = nil() mark(cons(X1,X2)) = 2X1 + 8X2 >= 2X1 + 4X2 = cons(mark(X1),X2) a__nats() = 0 >= 0 = nats() a__pairs() = 0 >= 0 = pairs() a__odds() = 0 >= 0 = odds() a__incr(X) = 2X >= 2X = incr(X) a__head(X) = 3X + 2 >= 3X + 1 = head(X) a__tail(X) = X + 2 >= X + 2 = tail(X) problem: a__nats() -> cons(0(),incr(nats())) a__pairs() -> cons(0(),incr(odds())) a__odds() -> a__incr(a__pairs()) a__incr(cons(X,XS)) -> cons(s(mark(X)),incr(XS)) mark(nats()) -> a__nats() mark(pairs()) -> a__pairs() mark(odds()) -> a__odds() mark(incr(X)) -> a__incr(mark(X)) mark(head(X)) -> a__head(mark(X)) mark(0()) -> 0() mark(s(X)) -> s(mark(X)) mark(nil()) -> nil() mark(cons(X1,X2)) -> cons(mark(X1),X2) a__nats() -> nats() a__pairs() -> pairs() a__odds() -> odds() a__incr(X) -> incr(X) a__tail(X) -> tail(X) Matrix Interpretation Processor: dim=1 interpretation: [cons](x0, x1) = x0 + x1, [tail](x0) = 4x0, [a__incr](x0) = 4x0, [0] = 0, [incr](x0) = 4x0, [nil] = 0, [a__pairs] = 0, [s](x0) = 4x0, [a__nats] = 0, [a__odds] = 0, [head](x0) = 3x0 + 4, [a__tail](x0) = 5x0, [a__head](x0) = 2x0 + 2, [mark](x0) = x0, [pairs] = 0, [odds] = 0, [nats] = 0 orientation: a__nats() = 0 >= 0 = cons(0(),incr(nats())) a__pairs() = 0 >= 0 = cons(0(),incr(odds())) a__odds() = 0 >= 0 = a__incr(a__pairs()) a__incr(cons(X,XS)) = 4X + 4XS >= 4X + 4XS = cons(s(mark(X)),incr(XS)) mark(nats()) = 0 >= 0 = a__nats() mark(pairs()) = 0 >= 0 = a__pairs() mark(odds()) = 0 >= 0 = a__odds() mark(incr(X)) = 4X >= 4X = a__incr(mark(X)) mark(head(X)) = 3X + 4 >= 2X + 2 = a__head(mark(X)) mark(0()) = 0 >= 0 = 0() mark(s(X)) = 4X >= 4X = s(mark(X)) mark(nil()) = 0 >= 0 = nil() mark(cons(X1,X2)) = X1 + X2 >= X1 + X2 = cons(mark(X1),X2) a__nats() = 0 >= 0 = nats() a__pairs() = 0 >= 0 = pairs() a__odds() = 0 >= 0 = odds() a__incr(X) = 4X >= 4X = incr(X) a__tail(X) = 5X >= 4X = tail(X) problem: a__nats() -> cons(0(),incr(nats())) a__pairs() -> cons(0(),incr(odds())) a__odds() -> a__incr(a__pairs()) a__incr(cons(X,XS)) -> cons(s(mark(X)),incr(XS)) mark(nats()) -> a__nats() mark(pairs()) -> a__pairs() mark(odds()) -> a__odds() mark(incr(X)) -> a__incr(mark(X)) mark(0()) -> 0() mark(s(X)) -> s(mark(X)) mark(nil()) -> nil() mark(cons(X1,X2)) -> cons(mark(X1),X2) a__nats() -> nats() a__pairs() -> pairs() a__odds() -> odds() a__incr(X) -> incr(X) a__tail(X) -> tail(X) Matrix Interpretation Processor: dim=3 interpretation: [1 0 0] [1 0 0] [cons](x0, x1) = [0 1 1]x0 + [0 1 1]x1 [0 1 1] [0 0 1] , [1 0 0] [tail](x0) = [0 0 0]x0 [0 0 0] , [1 0 1] [a__incr](x0) = [0 1 0]x0 [0 0 1] , [0] [0] = [0] [0], [1 0 1] [incr](x0) = [0 1 0]x0 [0 0 1] , [0] [nil] = [1] [0], [1] [a__pairs] = [0] [0], [1 0 0] [s](x0) = [0 1 1]x0 [0 0 0] , [1] [a__nats] = [1] [0], [1] [a__odds] = [0] [0], [1 0 0] [a__tail](x0) = [0 0 0]x0 [0 0 0] , [1 1 0] [mark](x0) = [0 1 0]x0 [0 0 1] , [1] [pairs] = [0] [0], [1] [odds] = [0] [0], [0] [nats] = [1] [0] orientation: [1] [0] a__nats() = [1] >= [1] = cons(0(),incr(nats())) [0] [0] [1] [1] a__pairs() = [0] >= [0] = cons(0(),incr(odds())) [0] [0] [1] [1] a__odds() = [0] >= [0] = a__incr(a__pairs()) [0] [0] [1 1 1] [1 0 1] [1 1 0] [1 0 1] a__incr(cons(X,XS)) = [0 1 1]X + [0 1 1]XS >= [0 1 1]X + [0 1 1]XS = cons(s(mark(X)),incr(XS)) [0 1 1] [0 0 1] [0 1 1] [0 0 1] [1] [1] mark(nats()) = [1] >= [1] = a__nats() [0] [0] [1] [1] mark(pairs()) = [0] >= [0] = a__pairs() [0] [0] [1] [1] mark(odds()) = [0] >= [0] = a__odds() [0] [0] [1 1 1] [1 1 1] mark(incr(X)) = [0 1 0]X >= [0 1 0]X = a__incr(mark(X)) [0 0 1] [0 0 1] [0] [0] mark(0()) = [0] >= [0] = 0() [0] [0] [1 1 1] [1 1 0] mark(s(X)) = [0 1 1]X >= [0 1 1]X = s(mark(X)) [0 0 0] [0 0 0] [1] [0] mark(nil()) = [1] >= [1] = nil() [0] [0] [1 1 1] [1 1 1] [1 1 0] [1 0 0] mark(cons(X1,X2)) = [0 1 1]X1 + [0 1 1]X2 >= [0 1 1]X1 + [0 1 1]X2 = cons(mark(X1),X2) [0 1 1] [0 0 1] [0 1 1] [0 0 1] [1] [0] a__nats() = [1] >= [1] = nats() [0] [0] [1] [1] a__pairs() = [0] >= [0] = pairs() [0] [0] [1] [1] a__odds() = [0] >= [0] = odds() [0] [0] [1 0 1] [1 0 1] a__incr(X) = [0 1 0]X >= [0 1 0]X = incr(X) [0 0 1] [0 0 1] [1 0 0] [1 0 0] a__tail(X) = [0 0 0]X >= [0 0 0]X = tail(X) [0 0 0] [0 0 0] problem: a__pairs() -> cons(0(),incr(odds())) a__odds() -> a__incr(a__pairs()) a__incr(cons(X,XS)) -> cons(s(mark(X)),incr(XS)) mark(nats()) -> a__nats() mark(pairs()) -> a__pairs() mark(odds()) -> a__odds() mark(incr(X)) -> a__incr(mark(X)) mark(0()) -> 0() mark(s(X)) -> s(mark(X)) mark(cons(X1,X2)) -> cons(mark(X1),X2) a__pairs() -> pairs() a__odds() -> odds() a__incr(X) -> incr(X) a__tail(X) -> tail(X) Matrix Interpretation Processor: dim=1 interpretation: [cons](x0, x1) = 2x0 + 4x1, [tail](x0) = 2x0, [a__incr](x0) = 4x0, [0] = 0, [incr](x0) = 4x0, [a__pairs] = 0, [s](x0) = 2x0, [a__nats] = 0, [a__odds] = 0, [a__tail](x0) = 3x0 + 1, [mark](x0) = 2x0, [pairs] = 0, [odds] = 0, [nats] = 0 orientation: a__pairs() = 0 >= 0 = cons(0(),incr(odds())) a__odds() = 0 >= 0 = a__incr(a__pairs()) a__incr(cons(X,XS)) = 8X + 16XS >= 8X + 16XS = cons(s(mark(X)),incr(XS)) mark(nats()) = 0 >= 0 = a__nats() mark(pairs()) = 0 >= 0 = a__pairs() mark(odds()) = 0 >= 0 = a__odds() mark(incr(X)) = 8X >= 8X = a__incr(mark(X)) mark(0()) = 0 >= 0 = 0() mark(s(X)) = 4X >= 4X = s(mark(X)) mark(cons(X1,X2)) = 4X1 + 8X2 >= 4X1 + 4X2 = cons(mark(X1),X2) a__pairs() = 0 >= 0 = pairs() a__odds() = 0 >= 0 = odds() a__incr(X) = 4X >= 4X = incr(X) a__tail(X) = 3X + 1 >= 2X = tail(X) problem: a__pairs() -> cons(0(),incr(odds())) a__odds() -> a__incr(a__pairs()) a__incr(cons(X,XS)) -> cons(s(mark(X)),incr(XS)) mark(nats()) -> a__nats() mark(pairs()) -> a__pairs() mark(odds()) -> a__odds() mark(incr(X)) -> a__incr(mark(X)) mark(0()) -> 0() mark(s(X)) -> s(mark(X)) mark(cons(X1,X2)) -> cons(mark(X1),X2) a__pairs() -> pairs() a__odds() -> odds() a__incr(X) -> incr(X) Matrix Interpretation Processor: dim=1 interpretation: [cons](x0, x1) = 4x0 + 2x1, [a__incr](x0) = x0, [0] = 0, [incr](x0) = x0, [a__pairs] = 0, [s](x0) = x0, [a__nats] = 0, [a__odds] = 0, [mark](x0) = x0, [pairs] = 0, [odds] = 0, [nats] = 6 orientation: a__pairs() = 0 >= 0 = cons(0(),incr(odds())) a__odds() = 0 >= 0 = a__incr(a__pairs()) a__incr(cons(X,XS)) = 4X + 2XS >= 4X + 2XS = cons(s(mark(X)),incr(XS)) mark(nats()) = 6 >= 0 = a__nats() mark(pairs()) = 0 >= 0 = a__pairs() mark(odds()) = 0 >= 0 = a__odds() mark(incr(X)) = X >= X = a__incr(mark(X)) mark(0()) = 0 >= 0 = 0() mark(s(X)) = X >= X = s(mark(X)) mark(cons(X1,X2)) = 4X1 + 2X2 >= 4X1 + 2X2 = cons(mark(X1),X2) a__pairs() = 0 >= 0 = pairs() a__odds() = 0 >= 0 = odds() a__incr(X) = X >= X = incr(X) problem: a__pairs() -> cons(0(),incr(odds())) a__odds() -> a__incr(a__pairs()) a__incr(cons(X,XS)) -> cons(s(mark(X)),incr(XS)) mark(pairs()) -> a__pairs() mark(odds()) -> a__odds() mark(incr(X)) -> a__incr(mark(X)) mark(0()) -> 0() mark(s(X)) -> s(mark(X)) mark(cons(X1,X2)) -> cons(mark(X1),X2) a__pairs() -> pairs() a__odds() -> odds() a__incr(X) -> incr(X) Matrix Interpretation Processor: dim=3 interpretation: [1 0 0] [1 0 0] [cons](x0, x1) = [0 1 0]x0 + [0 0 0]x1 [0 1 1] [0 0 1] , [1 0 1] [a__incr](x0) = [0 1 0]x0 [0 0 1] , [1] [0] = [0] [0], [1 0 1] [incr](x0) = [0 1 0]x0 [0 0 1] , [1] [a__pairs] = [0] [0], [1 0 1] [s](x0) = [0 1 0]x0 [0 0 0] , [1] [a__odds] = [1] [0], [1 1 0] [mark](x0) = [0 1 0]x0 [0 0 1] , [1] [pairs] = [0] [0], [0] [odds] = [1] [0] orientation: [1] [1] a__pairs() = [0] >= [0] = cons(0(),incr(odds())) [0] [0] [1] [1] a__odds() = [1] >= [0] = a__incr(a__pairs()) [0] [0] [1 1 1] [1 0 1] [1 1 1] [1 0 1] a__incr(cons(X,XS)) = [0 1 0]X + [0 0 0]XS >= [0 1 0]X + [0 0 0]XS = cons(s(mark(X)),incr(XS)) [0 1 1] [0 0 1] [0 1 0] [0 0 1] [1] [1] mark(pairs()) = [0] >= [0] = a__pairs() [0] [0] [1] [1] mark(odds()) = [1] >= [1] = a__odds() [0] [0] [1 1 1] [1 1 1] mark(incr(X)) = [0 1 0]X >= [0 1 0]X = a__incr(mark(X)) [0 0 1] [0 0 1] [1] [1] mark(0()) = [0] >= [0] = 0() [0] [0] [1 1 1] [1 1 1] mark(s(X)) = [0 1 0]X >= [0 1 0]X = s(mark(X)) [0 0 0] [0 0 0] [1 1 0] [1 0 0] [1 1 0] [1 0 0] mark(cons(X1,X2)) = [0 1 0]X1 + [0 0 0]X2 >= [0 1 0]X1 + [0 0 0]X2 = cons(mark(X1),X2) [0 1 1] [0 0 1] [0 1 1] [0 0 1] [1] [1] a__pairs() = [0] >= [0] = pairs() [0] [0] [1] [0] a__odds() = [1] >= [1] = odds() [0] [0] [1 0 1] [1 0 1] a__incr(X) = [0 1 0]X >= [0 1 0]X = incr(X) [0 0 1] [0 0 1] problem: a__pairs() -> cons(0(),incr(odds())) a__odds() -> a__incr(a__pairs()) a__incr(cons(X,XS)) -> cons(s(mark(X)),incr(XS)) mark(pairs()) -> a__pairs() mark(odds()) -> a__odds() mark(incr(X)) -> a__incr(mark(X)) mark(0()) -> 0() mark(s(X)) -> s(mark(X)) mark(cons(X1,X2)) -> cons(mark(X1),X2) a__pairs() -> pairs() a__incr(X) -> incr(X) Matrix Interpretation Processor: dim=3 interpretation: [1 0 0] [1 0 0] [cons](x0, x1) = [0 1 0]x0 + [0 0 0]x1 [0 1 1] [0 0 1] , [1 0 1] [a__incr](x0) = [0 1 0]x0 [0 0 0] , [0] [0] = [0] [0], [1 0 1] [incr](x0) = [0 1 0]x0 [0 0 0] , [0] [a__pairs] = [0] [0], [1 0 0] [s](x0) = [0 1 0]x0 [0 0 0] , [0] [a__odds] = [0] [0], [1 1 0] [mark](x0) = [0 0 0]x0 [0 0 1] , [0] [pairs] = [0] [0], [0] [odds] = [1] [0] orientation: [0] [0] a__pairs() = [0] >= [0] = cons(0(),incr(odds())) [0] [0] [0] [0] a__odds() = [0] >= [0] = a__incr(a__pairs()) [0] [0] [1 1 1] [1 0 1] [1 1 0] [1 0 1] a__incr(cons(X,XS)) = [0 1 0]X + [0 0 0]XS >= [0 0 0]X + [0 0 0]XS = cons(s(mark(X)),incr(XS)) [0 0 0] [0 0 0] [0 0 0] [0 0 0] [0] [0] mark(pairs()) = [0] >= [0] = a__pairs() [0] [0] [1] [0] mark(odds()) = [0] >= [0] = a__odds() [0] [0] [1 1 1] [1 1 1] mark(incr(X)) = [0 0 0]X >= [0 0 0]X = a__incr(mark(X)) [0 0 0] [0 0 0] [0] [0] mark(0()) = [0] >= [0] = 0() [0] [0] [1 1 0] [1 1 0] mark(s(X)) = [0 0 0]X >= [0 0 0]X = s(mark(X)) [0 0 0] [0 0 0] [1 1 0] [1 0 0] [1 1 0] [1 0 0] mark(cons(X1,X2)) = [0 0 0]X1 + [0 0 0]X2 >= [0 0 0]X1 + [0 0 0]X2 = cons(mark(X1),X2) [0 1 1] [0 0 1] [0 0 1] [0 0 1] [0] [0] a__pairs() = [0] >= [0] = pairs() [0] [0] [1 0 1] [1 0 1] a__incr(X) = [0 1 0]X >= [0 1 0]X = incr(X) [0 0 0] [0 0 0] problem: a__pairs() -> cons(0(),incr(odds())) a__odds() -> a__incr(a__pairs()) a__incr(cons(X,XS)) -> cons(s(mark(X)),incr(XS)) mark(pairs()) -> a__pairs() mark(incr(X)) -> a__incr(mark(X)) mark(0()) -> 0() mark(s(X)) -> s(mark(X)) mark(cons(X1,X2)) -> cons(mark(X1),X2) a__pairs() -> pairs() a__incr(X) -> incr(X) Matrix Interpretation Processor: dim=1 interpretation: [cons](x0, x1) = 2x0 + 4x1, [a__incr](x0) = 2x0, [0] = 1, [incr](x0) = 2x0, [a__pairs] = 2, [s](x0) = 2x0, [a__odds] = 5, [mark](x0) = x0, [pairs] = 2, [odds] = 0 orientation: a__pairs() = 2 >= 2 = cons(0(),incr(odds())) a__odds() = 5 >= 4 = a__incr(a__pairs()) a__incr(cons(X,XS)) = 4X + 8XS >= 4X + 8XS = cons(s(mark(X)),incr(XS)) mark(pairs()) = 2 >= 2 = a__pairs() mark(incr(X)) = 2X >= 2X = a__incr(mark(X)) mark(0()) = 1 >= 1 = 0() mark(s(X)) = 2X >= 2X = s(mark(X)) mark(cons(X1,X2)) = 2X1 + 4X2 >= 2X1 + 4X2 = cons(mark(X1),X2) a__pairs() = 2 >= 2 = pairs() a__incr(X) = 2X >= 2X = incr(X) problem: a__pairs() -> cons(0(),incr(odds())) a__incr(cons(X,XS)) -> cons(s(mark(X)),incr(XS)) mark(pairs()) -> a__pairs() mark(incr(X)) -> a__incr(mark(X)) mark(0()) -> 0() mark(s(X)) -> s(mark(X)) mark(cons(X1,X2)) -> cons(mark(X1),X2) a__pairs() -> pairs() a__incr(X) -> incr(X) Matrix Interpretation Processor: dim=1 interpretation: [cons](x0, x1) = x0 + 4x1 + 4, [a__incr](x0) = 4x0, [0] = 0, [incr](x0) = 4x0, [a__pairs] = 4, [s](x0) = 4x0 + 1, [mark](x0) = x0, [pairs] = 4, [odds] = 0 orientation: a__pairs() = 4 >= 4 = cons(0(),incr(odds())) a__incr(cons(X,XS)) = 4X + 16XS + 16 >= 4X + 16XS + 5 = cons(s(mark(X)),incr(XS)) mark(pairs()) = 4 >= 4 = a__pairs() mark(incr(X)) = 4X >= 4X = a__incr(mark(X)) mark(0()) = 0 >= 0 = 0() mark(s(X)) = 4X + 1 >= 4X + 1 = s(mark(X)) mark(cons(X1,X2)) = X1 + 4X2 + 4 >= X1 + 4X2 + 4 = cons(mark(X1),X2) a__pairs() = 4 >= 4 = pairs() a__incr(X) = 4X >= 4X = incr(X) problem: a__pairs() -> cons(0(),incr(odds())) mark(pairs()) -> a__pairs() mark(incr(X)) -> a__incr(mark(X)) mark(0()) -> 0() mark(s(X)) -> s(mark(X)) mark(cons(X1,X2)) -> cons(mark(X1),X2) a__pairs() -> pairs() a__incr(X) -> incr(X) Matrix Interpretation Processor: dim=3 interpretation: [1 0 0] [0] [cons](x0, x1) = x0 + [0 0 0]x1 + [1] [0 0 0] [0], [0] [a__incr](x0) = x0 + [1] [0], [0] [0] = [0] [1], [0] [incr](x0) = x0 + [1] [0], [1] [a__pairs] = [1] [1], [0] [s](x0) = x0 + [1] [0], [1 1 1] [0] [mark](x0) = [0 1 0]x0 + [0] [0 0 0] [1], [0] [pairs] = [1] [0], [0] [odds] = [0] [0] orientation: [1] [0] a__pairs() = [1] >= [1] = cons(0(),incr(odds())) [1] [1] [1] [1] mark(pairs()) = [1] >= [1] = a__pairs() [1] [1] [1 1 1] [1] [1 1 1] [0] mark(incr(X)) = [0 1 0]X + [1] >= [0 1 0]X + [1] = a__incr(mark(X)) [0 0 0] [1] [0 0 0] [1] [1] [0] mark(0()) = [0] >= [0] = 0() [1] [1] [1 1 1] [1] [1 1 1] [0] mark(s(X)) = [0 1 0]X + [1] >= [0 1 0]X + [1] = s(mark(X)) [0 0 0] [1] [0 0 0] [1] [1 1 1] [1 0 0] [1] [1 1 1] [1 0 0] [0] mark(cons(X1,X2)) = [0 1 0]X1 + [0 0 0]X2 + [1] >= [0 1 0]X1 + [0 0 0]X2 + [1] = cons(mark(X1),X2) [0 0 0] [0 0 0] [1] [0 0 0] [0 0 0] [1] [1] [0] a__pairs() = [1] >= [1] = pairs() [1] [0] [0] [0] a__incr(X) = X + [1] >= X + [1] = incr(X) [0] [0] problem: mark(pairs()) -> a__pairs() a__incr(X) -> incr(X) Matrix Interpretation Processor: dim=3 interpretation: [1 0 0] [a__incr](x0) = [0 0 0]x0 [0 0 0] , [1 0 0] [incr](x0) = [0 0 0]x0 [0 0 0] , [0] [a__pairs] = [0] [0], [1 0 0] [mark](x0) = [0 0 0]x0 [0 0 0] , [1] [pairs] = [0] [0] orientation: [1] [0] mark(pairs()) = [0] >= [0] = a__pairs() [0] [0] [1 0 0] [1 0 0] a__incr(X) = [0 0 0]X >= [0 0 0]X = incr(X) [0 0 0] [0 0 0] problem: a__incr(X) -> incr(X) Matrix Interpretation Processor: dim=3 interpretation: [1 0 0] [1] [a__incr](x0) = [0 0 0]x0 + [0] [0 0 1] [0], [1 0 0] [incr](x0) = [0 0 0]x0 [0 0 0] orientation: [1 0 0] [1] [1 0 0] a__incr(X) = [0 0 0]X + [0] >= [0 0 0]X = incr(X) [0 0 1] [0] [0 0 0] problem: Qed