/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.hs /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


YES
proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


H-Termination with start terms of the given HASKELL could be proven:

(0) HASKELL
(1) BR [EQUIVALENT, 0 ms]
(2) HASKELL
(3) COR [EQUIVALENT, 0 ms]
(4) HASKELL
(5) Narrow [SOUND, 0 ms]
(6) QDP
(7) DependencyGraphProof [EQUIVALENT, 0 ms]
(8) AND
    (9) QDP
        (10) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (11) YES
    (12) QDP
        (13) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (14) YES
    (15) QDP
        (16) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (17) YES
    (18) QDP
        (19) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (20) YES


----------------------------------------

(0)
Obligation:
mainModule Main 
module Main where {
import qualified Prelude;
data Main.Char = Char MyInt ;

data List a = Cons a (List a)  | Nil ;

data Main.Maybe a = Nothing  | Just a ;

data MyBool = MyTrue  | MyFalse ;

data MyInt = Pos Main.Nat  | Neg Main.Nat ;

data Main.Nat = Succ Main.Nat  | Zero ;

data Tup2 b a = Tup2 b a ;

esEsChar :: Main.Char  ->  Main.Char  ->  MyBool;
esEsChar = primEqChar;

lookup k Nil = lookup3 k Nil;
lookup k (Cons (Tup2 x y) xys) = lookup2 k (Cons (Tup2 x y) xys);

lookup0 k x y xys MyTrue = lookup k xys;

lookup1 k x y xys MyTrue = Main.Just y;
lookup1 k x y xys MyFalse = lookup0 k x y xys otherwise;

lookup2 k (Cons (Tup2 x y) xys) = lookup1 k x y xys (esEsChar k x);

lookup3 k Nil = Main.Nothing;
lookup3 wu wv = lookup2 wu wv;

otherwise :: MyBool;
otherwise = MyTrue;

primEqChar :: Main.Char  ->  Main.Char  ->  MyBool;
primEqChar (Main.Char x) (Main.Char y) = primEqInt x y;

primEqInt :: MyInt  ->  MyInt  ->  MyBool;
primEqInt (Main.Pos (Main.Succ x)) (Main.Pos (Main.Succ y)) = primEqNat x y;
primEqInt (Main.Neg (Main.Succ x)) (Main.Neg (Main.Succ y)) = primEqNat x y;
primEqInt (Main.Pos Main.Zero) (Main.Neg Main.Zero) = MyTrue;
primEqInt (Main.Neg Main.Zero) (Main.Pos Main.Zero) = MyTrue;
primEqInt (Main.Neg Main.Zero) (Main.Neg Main.Zero) = MyTrue;
primEqInt (Main.Pos Main.Zero) (Main.Pos Main.Zero) = MyTrue;
primEqInt vv vw = MyFalse;

primEqNat :: Main.Nat  ->  Main.Nat  ->  MyBool;
primEqNat Main.Zero Main.Zero = MyTrue;
primEqNat Main.Zero (Main.Succ y) = MyFalse;
primEqNat (Main.Succ x) Main.Zero = MyFalse;
primEqNat (Main.Succ x) (Main.Succ y) = primEqNat x y;

}

----------------------------------------

(1) BR (EQUIVALENT)
Replaced joker patterns by fresh variables and removed binding patterns.
----------------------------------------

(2)
Obligation:
mainModule Main 
module Main where {
import qualified Prelude;
data Main.Char = Char MyInt ;

data List a = Cons a (List a)  | Nil ;

data Main.Maybe a = Nothing  | Just a ;

data MyBool = MyTrue  | MyFalse ;

data MyInt = Pos Main.Nat  | Neg Main.Nat ;

data Main.Nat = Succ Main.Nat  | Zero ;

data Tup2 b a = Tup2 b a ;

esEsChar :: Main.Char  ->  Main.Char  ->  MyBool;
esEsChar = primEqChar;

lookup k Nil = lookup3 k Nil;
lookup k (Cons (Tup2 x y) xys) = lookup2 k (Cons (Tup2 x y) xys);

lookup0 k x y xys MyTrue = lookup k xys;

lookup1 k x y xys MyTrue = Main.Just y;
lookup1 k x y xys MyFalse = lookup0 k x y xys otherwise;

lookup2 k (Cons (Tup2 x y) xys) = lookup1 k x y xys (esEsChar k x);

lookup3 k Nil = Main.Nothing;
lookup3 wu wv = lookup2 wu wv;

otherwise :: MyBool;
otherwise = MyTrue;

primEqChar :: Main.Char  ->  Main.Char  ->  MyBool;
primEqChar (Main.Char x) (Main.Char y) = primEqInt x y;

primEqInt :: MyInt  ->  MyInt  ->  MyBool;
primEqInt (Main.Pos (Main.Succ x)) (Main.Pos (Main.Succ y)) = primEqNat x y;
primEqInt (Main.Neg (Main.Succ x)) (Main.Neg (Main.Succ y)) = primEqNat x y;
primEqInt (Main.Pos Main.Zero) (Main.Neg Main.Zero) = MyTrue;
primEqInt (Main.Neg Main.Zero) (Main.Pos Main.Zero) = MyTrue;
primEqInt (Main.Neg Main.Zero) (Main.Neg Main.Zero) = MyTrue;
primEqInt (Main.Pos Main.Zero) (Main.Pos Main.Zero) = MyTrue;
primEqInt vv vw = MyFalse;

primEqNat :: Main.Nat  ->  Main.Nat  ->  MyBool;
primEqNat Main.Zero Main.Zero = MyTrue;
primEqNat Main.Zero (Main.Succ y) = MyFalse;
primEqNat (Main.Succ x) Main.Zero = MyFalse;
primEqNat (Main.Succ x) (Main.Succ y) = primEqNat x y;

}

----------------------------------------

(3) COR (EQUIVALENT)
Cond Reductions:
The following Function with conditions
"undefined |Falseundefined;
"
is transformed to
"undefined  = undefined1;
"
"undefined0 True = undefined;
"
"undefined1  = undefined0 False;
"

----------------------------------------

(4)
Obligation:
mainModule Main 
module Main where {
import qualified Prelude;
data Main.Char = Char MyInt ;

data List a = Cons a (List a)  | Nil ;

data Main.Maybe a = Nothing  | Just a ;

data MyBool = MyTrue  | MyFalse ;

data MyInt = Pos Main.Nat  | Neg Main.Nat ;

data Main.Nat = Succ Main.Nat  | Zero ;

data Tup2 b a = Tup2 b a ;

esEsChar :: Main.Char  ->  Main.Char  ->  MyBool;
esEsChar = primEqChar;

lookup k Nil = lookup3 k Nil;
lookup k (Cons (Tup2 x y) xys) = lookup2 k (Cons (Tup2 x y) xys);

lookup0 k x y xys MyTrue = lookup k xys;

lookup1 k x y xys MyTrue = Main.Just y;
lookup1 k x y xys MyFalse = lookup0 k x y xys otherwise;

lookup2 k (Cons (Tup2 x y) xys) = lookup1 k x y xys (esEsChar k x);

lookup3 k Nil = Main.Nothing;
lookup3 wu wv = lookup2 wu wv;

otherwise :: MyBool;
otherwise = MyTrue;

primEqChar :: Main.Char  ->  Main.Char  ->  MyBool;
primEqChar (Main.Char x) (Main.Char y) = primEqInt x y;

primEqInt :: MyInt  ->  MyInt  ->  MyBool;
primEqInt (Main.Pos (Main.Succ x)) (Main.Pos (Main.Succ y)) = primEqNat x y;
primEqInt (Main.Neg (Main.Succ x)) (Main.Neg (Main.Succ y)) = primEqNat x y;
primEqInt (Main.Pos Main.Zero) (Main.Neg Main.Zero) = MyTrue;
primEqInt (Main.Neg Main.Zero) (Main.Pos Main.Zero) = MyTrue;
primEqInt (Main.Neg Main.Zero) (Main.Neg Main.Zero) = MyTrue;
primEqInt (Main.Pos Main.Zero) (Main.Pos Main.Zero) = MyTrue;
primEqInt vv vw = MyFalse;

primEqNat :: Main.Nat  ->  Main.Nat  ->  MyBool;
primEqNat Main.Zero Main.Zero = MyTrue;
primEqNat Main.Zero (Main.Succ y) = MyFalse;
primEqNat (Main.Succ x) Main.Zero = MyFalse;
primEqNat (Main.Succ x) (Main.Succ y) = primEqNat x y;

}

----------------------------------------

(5) Narrow (SOUND)
Haskell To QDPs

digraph dp_graph {
node [outthreshold=100, inthreshold=100];1[label="lookup",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
3[label="lookup vz3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3];
4[label="lookup vz3 vz4",fontsize=16,color="burlywood",shape="triangle"];781[label="vz4/Cons vz40 vz41",fontsize=10,color="white",style="solid",shape="box"];4 -> 781[label="",style="solid", color="burlywood", weight=9];
781 -> 5[label="",style="solid", color="burlywood", weight=3];
782[label="vz4/Nil",fontsize=10,color="white",style="solid",shape="box"];4 -> 782[label="",style="solid", color="burlywood", weight=9];
782 -> 6[label="",style="solid", color="burlywood", weight=3];
5[label="lookup vz3 (Cons vz40 vz41)",fontsize=16,color="burlywood",shape="box"];783[label="vz40/Tup2 vz400 vz401",fontsize=10,color="white",style="solid",shape="box"];5 -> 783[label="",style="solid", color="burlywood", weight=9];
783 -> 7[label="",style="solid", color="burlywood", weight=3];
6[label="lookup vz3 Nil",fontsize=16,color="black",shape="box"];6 -> 8[label="",style="solid", color="black", weight=3];
7[label="lookup vz3 (Cons (Tup2 vz400 vz401) vz41)",fontsize=16,color="black",shape="box"];7 -> 9[label="",style="solid", color="black", weight=3];
8[label="lookup3 vz3 Nil",fontsize=16,color="black",shape="box"];8 -> 10[label="",style="solid", color="black", weight=3];
9[label="lookup2 vz3 (Cons (Tup2 vz400 vz401) vz41)",fontsize=16,color="black",shape="box"];9 -> 11[label="",style="solid", color="black", weight=3];
10[label="Nothing",fontsize=16,color="green",shape="box"];11[label="lookup1 vz3 vz400 vz401 vz41 (esEsChar vz3 vz400)",fontsize=16,color="black",shape="box"];11 -> 12[label="",style="solid", color="black", weight=3];
12[label="lookup1 vz3 vz400 vz401 vz41 (primEqChar vz3 vz400)",fontsize=16,color="burlywood",shape="box"];784[label="vz3/Char vz30",fontsize=10,color="white",style="solid",shape="box"];12 -> 784[label="",style="solid", color="burlywood", weight=9];
784 -> 13[label="",style="solid", color="burlywood", weight=3];
13[label="lookup1 (Char vz30) vz400 vz401 vz41 (primEqChar (Char vz30) vz400)",fontsize=16,color="burlywood",shape="box"];785[label="vz400/Char vz4000",fontsize=10,color="white",style="solid",shape="box"];13 -> 785[label="",style="solid", color="burlywood", weight=9];
785 -> 14[label="",style="solid", color="burlywood", weight=3];
14[label="lookup1 (Char vz30) (Char vz4000) vz401 vz41 (primEqChar (Char vz30) (Char vz4000))",fontsize=16,color="black",shape="box"];14 -> 15[label="",style="solid", color="black", weight=3];
15[label="lookup1 (Char vz30) (Char vz4000) vz401 vz41 (primEqInt vz30 vz4000)",fontsize=16,color="burlywood",shape="box"];786[label="vz30/Pos vz300",fontsize=10,color="white",style="solid",shape="box"];15 -> 786[label="",style="solid", color="burlywood", weight=9];
786 -> 16[label="",style="solid", color="burlywood", weight=3];
787[label="vz30/Neg vz300",fontsize=10,color="white",style="solid",shape="box"];15 -> 787[label="",style="solid", color="burlywood", weight=9];
787 -> 17[label="",style="solid", color="burlywood", weight=3];
16[label="lookup1 (Char (Pos vz300)) (Char vz4000) vz401 vz41 (primEqInt (Pos vz300) vz4000)",fontsize=16,color="burlywood",shape="box"];788[label="vz300/Succ vz3000",fontsize=10,color="white",style="solid",shape="box"];16 -> 788[label="",style="solid", color="burlywood", weight=9];
788 -> 18[label="",style="solid", color="burlywood", weight=3];
789[label="vz300/Zero",fontsize=10,color="white",style="solid",shape="box"];16 -> 789[label="",style="solid", color="burlywood", weight=9];
789 -> 19[label="",style="solid", color="burlywood", weight=3];
17[label="lookup1 (Char (Neg vz300)) (Char vz4000) vz401 vz41 (primEqInt (Neg vz300) vz4000)",fontsize=16,color="burlywood",shape="box"];790[label="vz300/Succ vz3000",fontsize=10,color="white",style="solid",shape="box"];17 -> 790[label="",style="solid", color="burlywood", weight=9];
790 -> 20[label="",style="solid", color="burlywood", weight=3];
791[label="vz300/Zero",fontsize=10,color="white",style="solid",shape="box"];17 -> 791[label="",style="solid", color="burlywood", weight=9];
791 -> 21[label="",style="solid", color="burlywood", weight=3];
18[label="lookup1 (Char (Pos (Succ vz3000))) (Char vz4000) vz401 vz41 (primEqInt (Pos (Succ vz3000)) vz4000)",fontsize=16,color="burlywood",shape="box"];792[label="vz4000/Pos vz40000",fontsize=10,color="white",style="solid",shape="box"];18 -> 792[label="",style="solid", color="burlywood", weight=9];
792 -> 22[label="",style="solid", color="burlywood", weight=3];
793[label="vz4000/Neg vz40000",fontsize=10,color="white",style="solid",shape="box"];18 -> 793[label="",style="solid", color="burlywood", weight=9];
793 -> 23[label="",style="solid", color="burlywood", weight=3];
19[label="lookup1 (Char (Pos Zero)) (Char vz4000) vz401 vz41 (primEqInt (Pos Zero) vz4000)",fontsize=16,color="burlywood",shape="box"];794[label="vz4000/Pos vz40000",fontsize=10,color="white",style="solid",shape="box"];19 -> 794[label="",style="solid", color="burlywood", weight=9];
794 -> 24[label="",style="solid", color="burlywood", weight=3];
795[label="vz4000/Neg vz40000",fontsize=10,color="white",style="solid",shape="box"];19 -> 795[label="",style="solid", color="burlywood", weight=9];
795 -> 25[label="",style="solid", color="burlywood", weight=3];
20[label="lookup1 (Char (Neg (Succ vz3000))) (Char vz4000) vz401 vz41 (primEqInt (Neg (Succ vz3000)) vz4000)",fontsize=16,color="burlywood",shape="box"];796[label="vz4000/Pos vz40000",fontsize=10,color="white",style="solid",shape="box"];20 -> 796[label="",style="solid", color="burlywood", weight=9];
796 -> 26[label="",style="solid", color="burlywood", weight=3];
797[label="vz4000/Neg vz40000",fontsize=10,color="white",style="solid",shape="box"];20 -> 797[label="",style="solid", color="burlywood", weight=9];
797 -> 27[label="",style="solid", color="burlywood", weight=3];
21[label="lookup1 (Char (Neg Zero)) (Char vz4000) vz401 vz41 (primEqInt (Neg Zero) vz4000)",fontsize=16,color="burlywood",shape="box"];798[label="vz4000/Pos vz40000",fontsize=10,color="white",style="solid",shape="box"];21 -> 798[label="",style="solid", color="burlywood", weight=9];
798 -> 28[label="",style="solid", color="burlywood", weight=3];
799[label="vz4000/Neg vz40000",fontsize=10,color="white",style="solid",shape="box"];21 -> 799[label="",style="solid", color="burlywood", weight=9];
799 -> 29[label="",style="solid", color="burlywood", weight=3];
22[label="lookup1 (Char (Pos (Succ vz3000))) (Char (Pos vz40000)) vz401 vz41 (primEqInt (Pos (Succ vz3000)) (Pos vz40000))",fontsize=16,color="burlywood",shape="box"];800[label="vz40000/Succ vz400000",fontsize=10,color="white",style="solid",shape="box"];22 -> 800[label="",style="solid", color="burlywood", weight=9];
800 -> 30[label="",style="solid", color="burlywood", weight=3];
801[label="vz40000/Zero",fontsize=10,color="white",style="solid",shape="box"];22 -> 801[label="",style="solid", color="burlywood", weight=9];
801 -> 31[label="",style="solid", color="burlywood", weight=3];
23[label="lookup1 (Char (Pos (Succ vz3000))) (Char (Neg vz40000)) vz401 vz41 (primEqInt (Pos (Succ vz3000)) (Neg vz40000))",fontsize=16,color="black",shape="box"];23 -> 32[label="",style="solid", color="black", weight=3];
24[label="lookup1 (Char (Pos Zero)) (Char (Pos vz40000)) vz401 vz41 (primEqInt (Pos Zero) (Pos vz40000))",fontsize=16,color="burlywood",shape="box"];802[label="vz40000/Succ vz400000",fontsize=10,color="white",style="solid",shape="box"];24 -> 802[label="",style="solid", color="burlywood", weight=9];
802 -> 33[label="",style="solid", color="burlywood", weight=3];
803[label="vz40000/Zero",fontsize=10,color="white",style="solid",shape="box"];24 -> 803[label="",style="solid", color="burlywood", weight=9];
803 -> 34[label="",style="solid", color="burlywood", weight=3];
25[label="lookup1 (Char (Pos Zero)) (Char (Neg vz40000)) vz401 vz41 (primEqInt (Pos Zero) (Neg vz40000))",fontsize=16,color="burlywood",shape="box"];804[label="vz40000/Succ vz400000",fontsize=10,color="white",style="solid",shape="box"];25 -> 804[label="",style="solid", color="burlywood", weight=9];
804 -> 35[label="",style="solid", color="burlywood", weight=3];
805[label="vz40000/Zero",fontsize=10,color="white",style="solid",shape="box"];25 -> 805[label="",style="solid", color="burlywood", weight=9];
805 -> 36[label="",style="solid", color="burlywood", weight=3];
26[label="lookup1 (Char (Neg (Succ vz3000))) (Char (Pos vz40000)) vz401 vz41 (primEqInt (Neg (Succ vz3000)) (Pos vz40000))",fontsize=16,color="black",shape="box"];26 -> 37[label="",style="solid", color="black", weight=3];
27[label="lookup1 (Char (Neg (Succ vz3000))) (Char (Neg vz40000)) vz401 vz41 (primEqInt (Neg (Succ vz3000)) (Neg vz40000))",fontsize=16,color="burlywood",shape="box"];806[label="vz40000/Succ vz400000",fontsize=10,color="white",style="solid",shape="box"];27 -> 806[label="",style="solid", color="burlywood", weight=9];
806 -> 38[label="",style="solid", color="burlywood", weight=3];
807[label="vz40000/Zero",fontsize=10,color="white",style="solid",shape="box"];27 -> 807[label="",style="solid", color="burlywood", weight=9];
807 -> 39[label="",style="solid", color="burlywood", weight=3];
28[label="lookup1 (Char (Neg Zero)) (Char (Pos vz40000)) vz401 vz41 (primEqInt (Neg Zero) (Pos vz40000))",fontsize=16,color="burlywood",shape="box"];808[label="vz40000/Succ vz400000",fontsize=10,color="white",style="solid",shape="box"];28 -> 808[label="",style="solid", color="burlywood", weight=9];
808 -> 40[label="",style="solid", color="burlywood", weight=3];
809[label="vz40000/Zero",fontsize=10,color="white",style="solid",shape="box"];28 -> 809[label="",style="solid", color="burlywood", weight=9];
809 -> 41[label="",style="solid", color="burlywood", weight=3];
29[label="lookup1 (Char (Neg Zero)) (Char (Neg vz40000)) vz401 vz41 (primEqInt (Neg Zero) (Neg vz40000))",fontsize=16,color="burlywood",shape="box"];810[label="vz40000/Succ vz400000",fontsize=10,color="white",style="solid",shape="box"];29 -> 810[label="",style="solid", color="burlywood", weight=9];
810 -> 42[label="",style="solid", color="burlywood", weight=3];
811[label="vz40000/Zero",fontsize=10,color="white",style="solid",shape="box"];29 -> 811[label="",style="solid", color="burlywood", weight=9];
811 -> 43[label="",style="solid", color="burlywood", weight=3];
30[label="lookup1 (Char (Pos (Succ vz3000))) (Char (Pos (Succ vz400000))) vz401 vz41 (primEqInt (Pos (Succ vz3000)) (Pos (Succ vz400000)))",fontsize=16,color="black",shape="box"];30 -> 44[label="",style="solid", color="black", weight=3];
31[label="lookup1 (Char (Pos (Succ vz3000))) (Char (Pos Zero)) vz401 vz41 (primEqInt (Pos (Succ vz3000)) (Pos Zero))",fontsize=16,color="black",shape="box"];31 -> 45[label="",style="solid", color="black", weight=3];
32[label="lookup1 (Char (Pos (Succ vz3000))) (Char (Neg vz40000)) vz401 vz41 MyFalse",fontsize=16,color="black",shape="box"];32 -> 46[label="",style="solid", color="black", weight=3];
33[label="lookup1 (Char (Pos Zero)) (Char (Pos (Succ vz400000))) vz401 vz41 (primEqInt (Pos Zero) (Pos (Succ vz400000)))",fontsize=16,color="black",shape="box"];33 -> 47[label="",style="solid", color="black", weight=3];
34[label="lookup1 (Char (Pos Zero)) (Char (Pos Zero)) vz401 vz41 (primEqInt (Pos Zero) (Pos Zero))",fontsize=16,color="black",shape="box"];34 -> 48[label="",style="solid", color="black", weight=3];
35[label="lookup1 (Char (Pos Zero)) (Char (Neg (Succ vz400000))) vz401 vz41 (primEqInt (Pos Zero) (Neg (Succ vz400000)))",fontsize=16,color="black",shape="box"];35 -> 49[label="",style="solid", color="black", weight=3];
36[label="lookup1 (Char (Pos Zero)) (Char (Neg Zero)) vz401 vz41 (primEqInt (Pos Zero) (Neg Zero))",fontsize=16,color="black",shape="box"];36 -> 50[label="",style="solid", color="black", weight=3];
37[label="lookup1 (Char (Neg (Succ vz3000))) (Char (Pos vz40000)) vz401 vz41 MyFalse",fontsize=16,color="black",shape="box"];37 -> 51[label="",style="solid", color="black", weight=3];
38[label="lookup1 (Char (Neg (Succ vz3000))) (Char (Neg (Succ vz400000))) vz401 vz41 (primEqInt (Neg (Succ vz3000)) (Neg (Succ vz400000)))",fontsize=16,color="black",shape="box"];38 -> 52[label="",style="solid", color="black", weight=3];
39[label="lookup1 (Char (Neg (Succ vz3000))) (Char (Neg Zero)) vz401 vz41 (primEqInt (Neg (Succ vz3000)) (Neg Zero))",fontsize=16,color="black",shape="box"];39 -> 53[label="",style="solid", color="black", weight=3];
40[label="lookup1 (Char (Neg Zero)) (Char (Pos (Succ vz400000))) vz401 vz41 (primEqInt (Neg Zero) (Pos (Succ vz400000)))",fontsize=16,color="black",shape="box"];40 -> 54[label="",style="solid", color="black", weight=3];
41[label="lookup1 (Char (Neg Zero)) (Char (Pos Zero)) vz401 vz41 (primEqInt (Neg Zero) (Pos Zero))",fontsize=16,color="black",shape="box"];41 -> 55[label="",style="solid", color="black", weight=3];
42[label="lookup1 (Char (Neg Zero)) (Char (Neg (Succ vz400000))) vz401 vz41 (primEqInt (Neg Zero) (Neg (Succ vz400000)))",fontsize=16,color="black",shape="box"];42 -> 56[label="",style="solid", color="black", weight=3];
43[label="lookup1 (Char (Neg Zero)) (Char (Neg Zero)) vz401 vz41 (primEqInt (Neg Zero) (Neg Zero))",fontsize=16,color="black",shape="box"];43 -> 57[label="",style="solid", color="black", weight=3];
44 -> 623[label="",style="dashed", color="red", weight=0];
44[label="lookup1 (Char (Pos (Succ vz3000))) (Char (Pos (Succ vz400000))) vz401 vz41 (primEqNat vz3000 vz400000)",fontsize=16,color="magenta"];44 -> 624[label="",style="dashed", color="magenta", weight=3];
44 -> 625[label="",style="dashed", color="magenta", weight=3];
44 -> 626[label="",style="dashed", color="magenta", weight=3];
44 -> 627[label="",style="dashed", color="magenta", weight=3];
44 -> 628[label="",style="dashed", color="magenta", weight=3];
44 -> 629[label="",style="dashed", color="magenta", weight=3];
45[label="lookup1 (Char (Pos (Succ vz3000))) (Char (Pos Zero)) vz401 vz41 MyFalse",fontsize=16,color="black",shape="box"];45 -> 60[label="",style="solid", color="black", weight=3];
46[label="lookup0 (Char (Pos (Succ vz3000))) (Char (Neg vz40000)) vz401 vz41 otherwise",fontsize=16,color="black",shape="box"];46 -> 61[label="",style="solid", color="black", weight=3];
47[label="lookup1 (Char (Pos Zero)) (Char (Pos (Succ vz400000))) vz401 vz41 MyFalse",fontsize=16,color="black",shape="box"];47 -> 62[label="",style="solid", color="black", weight=3];
48[label="lookup1 (Char (Pos Zero)) (Char (Pos Zero)) vz401 vz41 MyTrue",fontsize=16,color="black",shape="box"];48 -> 63[label="",style="solid", color="black", weight=3];
49[label="lookup1 (Char (Pos Zero)) (Char (Neg (Succ vz400000))) vz401 vz41 MyFalse",fontsize=16,color="black",shape="box"];49 -> 64[label="",style="solid", color="black", weight=3];
50[label="lookup1 (Char (Pos Zero)) (Char (Neg Zero)) vz401 vz41 MyTrue",fontsize=16,color="black",shape="box"];50 -> 65[label="",style="solid", color="black", weight=3];
51[label="lookup0 (Char (Neg (Succ vz3000))) (Char (Pos vz40000)) vz401 vz41 otherwise",fontsize=16,color="black",shape="box"];51 -> 66[label="",style="solid", color="black", weight=3];
52 -> 686[label="",style="dashed", color="red", weight=0];
52[label="lookup1 (Char (Neg (Succ vz3000))) (Char (Neg (Succ vz400000))) vz401 vz41 (primEqNat vz3000 vz400000)",fontsize=16,color="magenta"];52 -> 687[label="",style="dashed", color="magenta", weight=3];
52 -> 688[label="",style="dashed", color="magenta", weight=3];
52 -> 689[label="",style="dashed", color="magenta", weight=3];
52 -> 690[label="",style="dashed", color="magenta", weight=3];
52 -> 691[label="",style="dashed", color="magenta", weight=3];
52 -> 692[label="",style="dashed", color="magenta", weight=3];
53[label="lookup1 (Char (Neg (Succ vz3000))) (Char (Neg Zero)) vz401 vz41 MyFalse",fontsize=16,color="black",shape="box"];53 -> 69[label="",style="solid", color="black", weight=3];
54[label="lookup1 (Char (Neg Zero)) (Char (Pos (Succ vz400000))) vz401 vz41 MyFalse",fontsize=16,color="black",shape="box"];54 -> 70[label="",style="solid", color="black", weight=3];
55[label="lookup1 (Char (Neg Zero)) (Char (Pos Zero)) vz401 vz41 MyTrue",fontsize=16,color="black",shape="box"];55 -> 71[label="",style="solid", color="black", weight=3];
56[label="lookup1 (Char (Neg Zero)) (Char (Neg (Succ vz400000))) vz401 vz41 MyFalse",fontsize=16,color="black",shape="box"];56 -> 72[label="",style="solid", color="black", weight=3];
57[label="lookup1 (Char (Neg Zero)) (Char (Neg Zero)) vz401 vz41 MyTrue",fontsize=16,color="black",shape="box"];57 -> 73[label="",style="solid", color="black", weight=3];
624[label="vz400000",fontsize=16,color="green",shape="box"];625[label="vz401",fontsize=16,color="green",shape="box"];626[label="vz3000",fontsize=16,color="green",shape="box"];627[label="vz3000",fontsize=16,color="green",shape="box"];628[label="vz41",fontsize=16,color="green",shape="box"];629[label="vz400000",fontsize=16,color="green",shape="box"];623[label="lookup1 (Char (Pos (Succ vz74))) (Char (Pos (Succ vz75))) vz76 vz77 (primEqNat vz78 vz79)",fontsize=16,color="burlywood",shape="triangle"];812[label="vz78/Succ vz780",fontsize=10,color="white",style="solid",shape="box"];623 -> 812[label="",style="solid", color="burlywood", weight=9];
812 -> 684[label="",style="solid", color="burlywood", weight=3];
813[label="vz78/Zero",fontsize=10,color="white",style="solid",shape="box"];623 -> 813[label="",style="solid", color="burlywood", weight=9];
813 -> 685[label="",style="solid", color="burlywood", weight=3];
60[label="lookup0 (Char (Pos (Succ vz3000))) (Char (Pos Zero)) vz401 vz41 otherwise",fontsize=16,color="black",shape="box"];60 -> 78[label="",style="solid", color="black", weight=3];
61[label="lookup0 (Char (Pos (Succ vz3000))) (Char (Neg vz40000)) vz401 vz41 MyTrue",fontsize=16,color="black",shape="box"];61 -> 79[label="",style="solid", color="black", weight=3];
62[label="lookup0 (Char (Pos Zero)) (Char (Pos (Succ vz400000))) vz401 vz41 otherwise",fontsize=16,color="black",shape="box"];62 -> 80[label="",style="solid", color="black", weight=3];
63[label="Just vz401",fontsize=16,color="green",shape="box"];64[label="lookup0 (Char (Pos Zero)) (Char (Neg (Succ vz400000))) vz401 vz41 otherwise",fontsize=16,color="black",shape="box"];64 -> 81[label="",style="solid", color="black", weight=3];
65[label="Just vz401",fontsize=16,color="green",shape="box"];66[label="lookup0 (Char (Neg (Succ vz3000))) (Char (Pos vz40000)) vz401 vz41 MyTrue",fontsize=16,color="black",shape="box"];66 -> 82[label="",style="solid", color="black", weight=3];
687[label="vz400000",fontsize=16,color="green",shape="box"];688[label="vz401",fontsize=16,color="green",shape="box"];689[label="vz41",fontsize=16,color="green",shape="box"];690[label="vz3000",fontsize=16,color="green",shape="box"];691[label="vz400000",fontsize=16,color="green",shape="box"];692[label="vz3000",fontsize=16,color="green",shape="box"];686[label="lookup1 (Char (Neg (Succ vz81))) (Char (Neg (Succ vz82))) vz83 vz84 (primEqNat vz85 vz86)",fontsize=16,color="burlywood",shape="triangle"];814[label="vz85/Succ vz850",fontsize=10,color="white",style="solid",shape="box"];686 -> 814[label="",style="solid", color="burlywood", weight=9];
814 -> 747[label="",style="solid", color="burlywood", weight=3];
815[label="vz85/Zero",fontsize=10,color="white",style="solid",shape="box"];686 -> 815[label="",style="solid", color="burlywood", weight=9];
815 -> 748[label="",style="solid", color="burlywood", weight=3];
69[label="lookup0 (Char (Neg (Succ vz3000))) (Char (Neg Zero)) vz401 vz41 otherwise",fontsize=16,color="black",shape="box"];69 -> 87[label="",style="solid", color="black", weight=3];
70[label="lookup0 (Char (Neg Zero)) (Char (Pos (Succ vz400000))) vz401 vz41 otherwise",fontsize=16,color="black",shape="box"];70 -> 88[label="",style="solid", color="black", weight=3];
71[label="Just vz401",fontsize=16,color="green",shape="box"];72[label="lookup0 (Char (Neg Zero)) (Char (Neg (Succ vz400000))) vz401 vz41 otherwise",fontsize=16,color="black",shape="box"];72 -> 89[label="",style="solid", color="black", weight=3];
73[label="Just vz401",fontsize=16,color="green",shape="box"];684[label="lookup1 (Char (Pos (Succ vz74))) (Char (Pos (Succ vz75))) vz76 vz77 (primEqNat (Succ vz780) vz79)",fontsize=16,color="burlywood",shape="box"];816[label="vz79/Succ vz790",fontsize=10,color="white",style="solid",shape="box"];684 -> 816[label="",style="solid", color="burlywood", weight=9];
816 -> 749[label="",style="solid", color="burlywood", weight=3];
817[label="vz79/Zero",fontsize=10,color="white",style="solid",shape="box"];684 -> 817[label="",style="solid", color="burlywood", weight=9];
817 -> 750[label="",style="solid", color="burlywood", weight=3];
685[label="lookup1 (Char (Pos (Succ vz74))) (Char (Pos (Succ vz75))) vz76 vz77 (primEqNat Zero vz79)",fontsize=16,color="burlywood",shape="box"];818[label="vz79/Succ vz790",fontsize=10,color="white",style="solid",shape="box"];685 -> 818[label="",style="solid", color="burlywood", weight=9];
818 -> 751[label="",style="solid", color="burlywood", weight=3];
819[label="vz79/Zero",fontsize=10,color="white",style="solid",shape="box"];685 -> 819[label="",style="solid", color="burlywood", weight=9];
819 -> 752[label="",style="solid", color="burlywood", weight=3];
78[label="lookup0 (Char (Pos (Succ vz3000))) (Char (Pos Zero)) vz401 vz41 MyTrue",fontsize=16,color="black",shape="box"];78 -> 94[label="",style="solid", color="black", weight=3];
79 -> 4[label="",style="dashed", color="red", weight=0];
79[label="lookup (Char (Pos (Succ vz3000))) vz41",fontsize=16,color="magenta"];79 -> 95[label="",style="dashed", color="magenta", weight=3];
79 -> 96[label="",style="dashed", color="magenta", weight=3];
80[label="lookup0 (Char (Pos Zero)) (Char (Pos (Succ vz400000))) vz401 vz41 MyTrue",fontsize=16,color="black",shape="box"];80 -> 97[label="",style="solid", color="black", weight=3];
81[label="lookup0 (Char (Pos Zero)) (Char (Neg (Succ vz400000))) vz401 vz41 MyTrue",fontsize=16,color="black",shape="box"];81 -> 98[label="",style="solid", color="black", weight=3];
82 -> 4[label="",style="dashed", color="red", weight=0];
82[label="lookup (Char (Neg (Succ vz3000))) vz41",fontsize=16,color="magenta"];82 -> 99[label="",style="dashed", color="magenta", weight=3];
82 -> 100[label="",style="dashed", color="magenta", weight=3];
747[label="lookup1 (Char (Neg (Succ vz81))) (Char (Neg (Succ vz82))) vz83 vz84 (primEqNat (Succ vz850) vz86)",fontsize=16,color="burlywood",shape="box"];820[label="vz86/Succ vz860",fontsize=10,color="white",style="solid",shape="box"];747 -> 820[label="",style="solid", color="burlywood", weight=9];
820 -> 753[label="",style="solid", color="burlywood", weight=3];
821[label="vz86/Zero",fontsize=10,color="white",style="solid",shape="box"];747 -> 821[label="",style="solid", color="burlywood", weight=9];
821 -> 754[label="",style="solid", color="burlywood", weight=3];
748[label="lookup1 (Char (Neg (Succ vz81))) (Char (Neg (Succ vz82))) vz83 vz84 (primEqNat Zero vz86)",fontsize=16,color="burlywood",shape="box"];822[label="vz86/Succ vz860",fontsize=10,color="white",style="solid",shape="box"];748 -> 822[label="",style="solid", color="burlywood", weight=9];
822 -> 755[label="",style="solid", color="burlywood", weight=3];
823[label="vz86/Zero",fontsize=10,color="white",style="solid",shape="box"];748 -> 823[label="",style="solid", color="burlywood", weight=9];
823 -> 756[label="",style="solid", color="burlywood", weight=3];
87[label="lookup0 (Char (Neg (Succ vz3000))) (Char (Neg Zero)) vz401 vz41 MyTrue",fontsize=16,color="black",shape="box"];87 -> 105[label="",style="solid", color="black", weight=3];
88[label="lookup0 (Char (Neg Zero)) (Char (Pos (Succ vz400000))) vz401 vz41 MyTrue",fontsize=16,color="black",shape="box"];88 -> 106[label="",style="solid", color="black", weight=3];
89[label="lookup0 (Char (Neg Zero)) (Char (Neg (Succ vz400000))) vz401 vz41 MyTrue",fontsize=16,color="black",shape="box"];89 -> 107[label="",style="solid", color="black", weight=3];
749[label="lookup1 (Char (Pos (Succ vz74))) (Char (Pos (Succ vz75))) vz76 vz77 (primEqNat (Succ vz780) (Succ vz790))",fontsize=16,color="black",shape="box"];749 -> 757[label="",style="solid", color="black", weight=3];
750[label="lookup1 (Char (Pos (Succ vz74))) (Char (Pos (Succ vz75))) vz76 vz77 (primEqNat (Succ vz780) Zero)",fontsize=16,color="black",shape="box"];750 -> 758[label="",style="solid", color="black", weight=3];
751[label="lookup1 (Char (Pos (Succ vz74))) (Char (Pos (Succ vz75))) vz76 vz77 (primEqNat Zero (Succ vz790))",fontsize=16,color="black",shape="box"];751 -> 759[label="",style="solid", color="black", weight=3];
752[label="lookup1 (Char (Pos (Succ vz74))) (Char (Pos (Succ vz75))) vz76 vz77 (primEqNat Zero Zero)",fontsize=16,color="black",shape="box"];752 -> 760[label="",style="solid", color="black", weight=3];
94 -> 4[label="",style="dashed", color="red", weight=0];
94[label="lookup (Char (Pos (Succ vz3000))) vz41",fontsize=16,color="magenta"];94 -> 113[label="",style="dashed", color="magenta", weight=3];
94 -> 114[label="",style="dashed", color="magenta", weight=3];
95[label="vz41",fontsize=16,color="green",shape="box"];96[label="Char (Pos (Succ vz3000))",fontsize=16,color="green",shape="box"];97 -> 4[label="",style="dashed", color="red", weight=0];
97[label="lookup (Char (Pos Zero)) vz41",fontsize=16,color="magenta"];97 -> 115[label="",style="dashed", color="magenta", weight=3];
97 -> 116[label="",style="dashed", color="magenta", weight=3];
98 -> 4[label="",style="dashed", color="red", weight=0];
98[label="lookup (Char (Pos Zero)) vz41",fontsize=16,color="magenta"];98 -> 117[label="",style="dashed", color="magenta", weight=3];
98 -> 118[label="",style="dashed", color="magenta", weight=3];
99[label="vz41",fontsize=16,color="green",shape="box"];100[label="Char (Neg (Succ vz3000))",fontsize=16,color="green",shape="box"];753[label="lookup1 (Char (Neg (Succ vz81))) (Char (Neg (Succ vz82))) vz83 vz84 (primEqNat (Succ vz850) (Succ vz860))",fontsize=16,color="black",shape="box"];753 -> 761[label="",style="solid", color="black", weight=3];
754[label="lookup1 (Char (Neg (Succ vz81))) (Char (Neg (Succ vz82))) vz83 vz84 (primEqNat (Succ vz850) Zero)",fontsize=16,color="black",shape="box"];754 -> 762[label="",style="solid", color="black", weight=3];
755[label="lookup1 (Char (Neg (Succ vz81))) (Char (Neg (Succ vz82))) vz83 vz84 (primEqNat Zero (Succ vz860))",fontsize=16,color="black",shape="box"];755 -> 763[label="",style="solid", color="black", weight=3];
756[label="lookup1 (Char (Neg (Succ vz81))) (Char (Neg (Succ vz82))) vz83 vz84 (primEqNat Zero Zero)",fontsize=16,color="black",shape="box"];756 -> 764[label="",style="solid", color="black", weight=3];
105 -> 4[label="",style="dashed", color="red", weight=0];
105[label="lookup (Char (Neg (Succ vz3000))) vz41",fontsize=16,color="magenta"];105 -> 124[label="",style="dashed", color="magenta", weight=3];
105 -> 125[label="",style="dashed", color="magenta", weight=3];
106 -> 4[label="",style="dashed", color="red", weight=0];
106[label="lookup (Char (Neg Zero)) vz41",fontsize=16,color="magenta"];106 -> 126[label="",style="dashed", color="magenta", weight=3];
106 -> 127[label="",style="dashed", color="magenta", weight=3];
107 -> 4[label="",style="dashed", color="red", weight=0];
107[label="lookup (Char (Neg Zero)) vz41",fontsize=16,color="magenta"];107 -> 128[label="",style="dashed", color="magenta", weight=3];
107 -> 129[label="",style="dashed", color="magenta", weight=3];
757 -> 623[label="",style="dashed", color="red", weight=0];
757[label="lookup1 (Char (Pos (Succ vz74))) (Char (Pos (Succ vz75))) vz76 vz77 (primEqNat vz780 vz790)",fontsize=16,color="magenta"];757 -> 765[label="",style="dashed", color="magenta", weight=3];
757 -> 766[label="",style="dashed", color="magenta", weight=3];
758[label="lookup1 (Char (Pos (Succ vz74))) (Char (Pos (Succ vz75))) vz76 vz77 MyFalse",fontsize=16,color="black",shape="triangle"];758 -> 767[label="",style="solid", color="black", weight=3];
759 -> 758[label="",style="dashed", color="red", weight=0];
759[label="lookup1 (Char (Pos (Succ vz74))) (Char (Pos (Succ vz75))) vz76 vz77 MyFalse",fontsize=16,color="magenta"];760[label="lookup1 (Char (Pos (Succ vz74))) (Char (Pos (Succ vz75))) vz76 vz77 MyTrue",fontsize=16,color="black",shape="box"];760 -> 768[label="",style="solid", color="black", weight=3];
113[label="vz41",fontsize=16,color="green",shape="box"];114[label="Char (Pos (Succ vz3000))",fontsize=16,color="green",shape="box"];115[label="vz41",fontsize=16,color="green",shape="box"];116[label="Char (Pos Zero)",fontsize=16,color="green",shape="box"];117[label="vz41",fontsize=16,color="green",shape="box"];118[label="Char (Pos Zero)",fontsize=16,color="green",shape="box"];761 -> 686[label="",style="dashed", color="red", weight=0];
761[label="lookup1 (Char (Neg (Succ vz81))) (Char (Neg (Succ vz82))) vz83 vz84 (primEqNat vz850 vz860)",fontsize=16,color="magenta"];761 -> 769[label="",style="dashed", color="magenta", weight=3];
761 -> 770[label="",style="dashed", color="magenta", weight=3];
762[label="lookup1 (Char (Neg (Succ vz81))) (Char (Neg (Succ vz82))) vz83 vz84 MyFalse",fontsize=16,color="black",shape="triangle"];762 -> 771[label="",style="solid", color="black", weight=3];
763 -> 762[label="",style="dashed", color="red", weight=0];
763[label="lookup1 (Char (Neg (Succ vz81))) (Char (Neg (Succ vz82))) vz83 vz84 MyFalse",fontsize=16,color="magenta"];764[label="lookup1 (Char (Neg (Succ vz81))) (Char (Neg (Succ vz82))) vz83 vz84 MyTrue",fontsize=16,color="black",shape="box"];764 -> 772[label="",style="solid", color="black", weight=3];
124[label="vz41",fontsize=16,color="green",shape="box"];125[label="Char (Neg (Succ vz3000))",fontsize=16,color="green",shape="box"];126[label="vz41",fontsize=16,color="green",shape="box"];127[label="Char (Neg Zero)",fontsize=16,color="green",shape="box"];128[label="vz41",fontsize=16,color="green",shape="box"];129[label="Char (Neg Zero)",fontsize=16,color="green",shape="box"];765[label="vz780",fontsize=16,color="green",shape="box"];766[label="vz790",fontsize=16,color="green",shape="box"];767[label="lookup0 (Char (Pos (Succ vz74))) (Char (Pos (Succ vz75))) vz76 vz77 otherwise",fontsize=16,color="black",shape="box"];767 -> 773[label="",style="solid", color="black", weight=3];
768[label="Just vz76",fontsize=16,color="green",shape="box"];769[label="vz860",fontsize=16,color="green",shape="box"];770[label="vz850",fontsize=16,color="green",shape="box"];771[label="lookup0 (Char (Neg (Succ vz81))) (Char (Neg (Succ vz82))) vz83 vz84 otherwise",fontsize=16,color="black",shape="box"];771 -> 774[label="",style="solid", color="black", weight=3];
772[label="Just vz83",fontsize=16,color="green",shape="box"];773[label="lookup0 (Char (Pos (Succ vz74))) (Char (Pos (Succ vz75))) vz76 vz77 MyTrue",fontsize=16,color="black",shape="box"];773 -> 775[label="",style="solid", color="black", weight=3];
774[label="lookup0 (Char (Neg (Succ vz81))) (Char (Neg (Succ vz82))) vz83 vz84 MyTrue",fontsize=16,color="black",shape="box"];774 -> 776[label="",style="solid", color="black", weight=3];
775 -> 4[label="",style="dashed", color="red", weight=0];
775[label="lookup (Char (Pos (Succ vz74))) vz77",fontsize=16,color="magenta"];775 -> 777[label="",style="dashed", color="magenta", weight=3];
775 -> 778[label="",style="dashed", color="magenta", weight=3];
776 -> 4[label="",style="dashed", color="red", weight=0];
776[label="lookup (Char (Neg (Succ vz81))) vz84",fontsize=16,color="magenta"];776 -> 779[label="",style="dashed", color="magenta", weight=3];
776 -> 780[label="",style="dashed", color="magenta", weight=3];
777[label="vz77",fontsize=16,color="green",shape="box"];778[label="Char (Pos (Succ vz74))",fontsize=16,color="green",shape="box"];779[label="vz84",fontsize=16,color="green",shape="box"];780[label="Char (Neg (Succ vz81))",fontsize=16,color="green",shape="box"];}

----------------------------------------

(6)
Obligation:
Q DP problem:
The TRS P consists of the following rules:

   new_lookup(Main.Char(Main.Neg(Main.Succ(vz3000))), Cons(Tup2(Main.Char(Main.Pos(vz40000)), vz401), vz41), ba) -> new_lookup(Main.Char(Main.Neg(Main.Succ(vz3000))), vz41, ba)
   new_lookup1(vz74, vz75, vz76, vz77, Main.Succ(vz780), Main.Succ(vz790), h) -> new_lookup1(vz74, vz75, vz76, vz77, vz780, vz790, h)
   new_lookup(Main.Char(Main.Neg(Main.Succ(vz3000))), Cons(Tup2(Main.Char(Main.Neg(Main.Succ(vz400000))), vz401), vz41), ba) -> new_lookup11(vz3000, vz400000, vz401, vz41, vz3000, vz400000, ba)
   new_lookup(Main.Char(Main.Neg(Main.Zero)), Cons(Tup2(Main.Char(Main.Neg(Main.Succ(vz400000))), vz401), vz41), ba) -> new_lookup(Main.Char(Main.Neg(Main.Zero)), vz41, ba)
   new_lookup11(vz81, vz82, vz83, vz84, Main.Succ(vz850), Main.Zero, bb) -> new_lookup(Main.Char(Main.Neg(Main.Succ(vz81))), vz84, bb)
   new_lookup1(vz74, vz75, vz76, vz77, Main.Succ(vz780), Main.Zero, h) -> new_lookup(Main.Char(Main.Pos(Main.Succ(vz74))), vz77, h)
   new_lookup1(vz74, vz75, vz76, vz77, Main.Zero, Main.Succ(vz790), h) -> new_lookup10(vz74, vz75, vz76, vz77, h)
   new_lookup(Main.Char(Main.Pos(Main.Succ(vz3000))), Cons(Tup2(Main.Char(Main.Pos(Main.Succ(vz400000))), vz401), vz41), ba) -> new_lookup1(vz3000, vz400000, vz401, vz41, vz3000, vz400000, ba)
   new_lookup(Main.Char(Main.Pos(Main.Succ(vz3000))), Cons(Tup2(Main.Char(Main.Pos(Main.Zero)), vz401), vz41), ba) -> new_lookup(Main.Char(Main.Pos(Main.Succ(vz3000))), vz41, ba)
   new_lookup(Main.Char(Main.Neg(Main.Zero)), Cons(Tup2(Main.Char(Main.Pos(Main.Succ(vz400000))), vz401), vz41), ba) -> new_lookup(Main.Char(Main.Neg(Main.Zero)), vz41, ba)
   new_lookup(Main.Char(Main.Neg(Main.Succ(vz3000))), Cons(Tup2(Main.Char(Main.Neg(Main.Zero)), vz401), vz41), ba) -> new_lookup(Main.Char(Main.Neg(Main.Succ(vz3000))), vz41, ba)
   new_lookup10(vz74, vz75, vz76, vz77, h) -> new_lookup(Main.Char(Main.Pos(Main.Succ(vz74))), vz77, h)
   new_lookup12(vz81, vz82, vz83, vz84, bb) -> new_lookup(Main.Char(Main.Neg(Main.Succ(vz81))), vz84, bb)
   new_lookup11(vz81, vz82, vz83, vz84, Main.Succ(vz850), Main.Succ(vz860), bb) -> new_lookup11(vz81, vz82, vz83, vz84, vz850, vz860, bb)
   new_lookup11(vz81, vz82, vz83, vz84, Main.Zero, Main.Succ(vz860), bb) -> new_lookup12(vz81, vz82, vz83, vz84, bb)
   new_lookup(Main.Char(Main.Pos(Main.Succ(vz3000))), Cons(Tup2(Main.Char(Main.Neg(vz40000)), vz401), vz41), ba) -> new_lookup(Main.Char(Main.Pos(Main.Succ(vz3000))), vz41, ba)
   new_lookup(Main.Char(Main.Pos(Main.Zero)), Cons(Tup2(Main.Char(Main.Pos(Main.Succ(vz400000))), vz401), vz41), ba) -> new_lookup(Main.Char(Main.Pos(Main.Zero)), vz41, ba)
   new_lookup(Main.Char(Main.Pos(Main.Zero)), Cons(Tup2(Main.Char(Main.Neg(Main.Succ(vz400000))), vz401), vz41), ba) -> new_lookup(Main.Char(Main.Pos(Main.Zero)), vz41, ba)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
----------------------------------------

(7) DependencyGraphProof (EQUIVALENT)
The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 4 SCCs.
----------------------------------------

(8)
Complex Obligation (AND)

----------------------------------------

(9)
Obligation:
Q DP problem:
The TRS P consists of the following rules:

   new_lookup(Main.Char(Main.Pos(Main.Zero)), Cons(Tup2(Main.Char(Main.Neg(Main.Succ(vz400000))), vz401), vz41), ba) -> new_lookup(Main.Char(Main.Pos(Main.Zero)), vz41, ba)
   new_lookup(Main.Char(Main.Pos(Main.Zero)), Cons(Tup2(Main.Char(Main.Pos(Main.Succ(vz400000))), vz401), vz41), ba) -> new_lookup(Main.Char(Main.Pos(Main.Zero)), vz41, ba)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
----------------------------------------

(10) QDPSizeChangeProof (EQUIVALENT)
By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem. 

From the DPs we obtained the following set of size-change graphs:
*new_lookup(Main.Char(Main.Pos(Main.Zero)), Cons(Tup2(Main.Char(Main.Neg(Main.Succ(vz400000))), vz401), vz41), ba) -> new_lookup(Main.Char(Main.Pos(Main.Zero)), vz41, ba)
The graph contains the following edges 1 >= 1, 2 > 2, 3 >= 3


*new_lookup(Main.Char(Main.Pos(Main.Zero)), Cons(Tup2(Main.Char(Main.Pos(Main.Succ(vz400000))), vz401), vz41), ba) -> new_lookup(Main.Char(Main.Pos(Main.Zero)), vz41, ba)
The graph contains the following edges 1 >= 1, 2 > 2, 3 >= 3


----------------------------------------

(11)
YES

----------------------------------------

(12)
Obligation:
Q DP problem:
The TRS P consists of the following rules:

   new_lookup(Main.Char(Main.Neg(Main.Zero)), Cons(Tup2(Main.Char(Main.Pos(Main.Succ(vz400000))), vz401), vz41), ba) -> new_lookup(Main.Char(Main.Neg(Main.Zero)), vz41, ba)
   new_lookup(Main.Char(Main.Neg(Main.Zero)), Cons(Tup2(Main.Char(Main.Neg(Main.Succ(vz400000))), vz401), vz41), ba) -> new_lookup(Main.Char(Main.Neg(Main.Zero)), vz41, ba)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
----------------------------------------

(13) QDPSizeChangeProof (EQUIVALENT)
By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem. 

From the DPs we obtained the following set of size-change graphs:
*new_lookup(Main.Char(Main.Neg(Main.Zero)), Cons(Tup2(Main.Char(Main.Pos(Main.Succ(vz400000))), vz401), vz41), ba) -> new_lookup(Main.Char(Main.Neg(Main.Zero)), vz41, ba)
The graph contains the following edges 1 >= 1, 2 > 2, 3 >= 3


*new_lookup(Main.Char(Main.Neg(Main.Zero)), Cons(Tup2(Main.Char(Main.Neg(Main.Succ(vz400000))), vz401), vz41), ba) -> new_lookup(Main.Char(Main.Neg(Main.Zero)), vz41, ba)
The graph contains the following edges 1 >= 1, 2 > 2, 3 >= 3


----------------------------------------

(14)
YES

----------------------------------------

(15)
Obligation:
Q DP problem:
The TRS P consists of the following rules:

   new_lookup1(vz74, vz75, vz76, vz77, Main.Succ(vz780), Main.Zero, h) -> new_lookup(Main.Char(Main.Pos(Main.Succ(vz74))), vz77, h)
   new_lookup(Main.Char(Main.Pos(Main.Succ(vz3000))), Cons(Tup2(Main.Char(Main.Pos(Main.Succ(vz400000))), vz401), vz41), ba) -> new_lookup1(vz3000, vz400000, vz401, vz41, vz3000, vz400000, ba)
   new_lookup1(vz74, vz75, vz76, vz77, Main.Succ(vz780), Main.Succ(vz790), h) -> new_lookup1(vz74, vz75, vz76, vz77, vz780, vz790, h)
   new_lookup1(vz74, vz75, vz76, vz77, Main.Zero, Main.Succ(vz790), h) -> new_lookup10(vz74, vz75, vz76, vz77, h)
   new_lookup10(vz74, vz75, vz76, vz77, h) -> new_lookup(Main.Char(Main.Pos(Main.Succ(vz74))), vz77, h)
   new_lookup(Main.Char(Main.Pos(Main.Succ(vz3000))), Cons(Tup2(Main.Char(Main.Pos(Main.Zero)), vz401), vz41), ba) -> new_lookup(Main.Char(Main.Pos(Main.Succ(vz3000))), vz41, ba)
   new_lookup(Main.Char(Main.Pos(Main.Succ(vz3000))), Cons(Tup2(Main.Char(Main.Neg(vz40000)), vz401), vz41), ba) -> new_lookup(Main.Char(Main.Pos(Main.Succ(vz3000))), vz41, ba)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
----------------------------------------

(16) QDPSizeChangeProof (EQUIVALENT)
By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem. 

From the DPs we obtained the following set of size-change graphs:
*new_lookup(Main.Char(Main.Pos(Main.Succ(vz3000))), Cons(Tup2(Main.Char(Main.Pos(Main.Succ(vz400000))), vz401), vz41), ba) -> new_lookup1(vz3000, vz400000, vz401, vz41, vz3000, vz400000, ba)
The graph contains the following edges 1 > 1, 2 > 2, 2 > 3, 2 > 4, 1 > 5, 2 > 6, 3 >= 7


*new_lookup1(vz74, vz75, vz76, vz77, Main.Succ(vz780), Main.Succ(vz790), h) -> new_lookup1(vz74, vz75, vz76, vz77, vz780, vz790, h)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 > 5, 6 > 6, 7 >= 7


*new_lookup1(vz74, vz75, vz76, vz77, Main.Succ(vz780), Main.Zero, h) -> new_lookup(Main.Char(Main.Pos(Main.Succ(vz74))), vz77, h)
The graph contains the following edges 4 >= 2, 7 >= 3


*new_lookup1(vz74, vz75, vz76, vz77, Main.Zero, Main.Succ(vz790), h) -> new_lookup10(vz74, vz75, vz76, vz77, h)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 7 >= 5


*new_lookup10(vz74, vz75, vz76, vz77, h) -> new_lookup(Main.Char(Main.Pos(Main.Succ(vz74))), vz77, h)
The graph contains the following edges 4 >= 2, 5 >= 3


*new_lookup(Main.Char(Main.Pos(Main.Succ(vz3000))), Cons(Tup2(Main.Char(Main.Pos(Main.Zero)), vz401), vz41), ba) -> new_lookup(Main.Char(Main.Pos(Main.Succ(vz3000))), vz41, ba)
The graph contains the following edges 1 >= 1, 2 > 2, 3 >= 3


*new_lookup(Main.Char(Main.Pos(Main.Succ(vz3000))), Cons(Tup2(Main.Char(Main.Neg(vz40000)), vz401), vz41), ba) -> new_lookup(Main.Char(Main.Pos(Main.Succ(vz3000))), vz41, ba)
The graph contains the following edges 1 >= 1, 2 > 2, 3 >= 3


----------------------------------------

(17)
YES

----------------------------------------

(18)
Obligation:
Q DP problem:
The TRS P consists of the following rules:

   new_lookup(Main.Char(Main.Neg(Main.Succ(vz3000))), Cons(Tup2(Main.Char(Main.Neg(Main.Succ(vz400000))), vz401), vz41), ba) -> new_lookup11(vz3000, vz400000, vz401, vz41, vz3000, vz400000, ba)
   new_lookup11(vz81, vz82, vz83, vz84, Main.Succ(vz850), Main.Zero, bb) -> new_lookup(Main.Char(Main.Neg(Main.Succ(vz81))), vz84, bb)
   new_lookup(Main.Char(Main.Neg(Main.Succ(vz3000))), Cons(Tup2(Main.Char(Main.Pos(vz40000)), vz401), vz41), ba) -> new_lookup(Main.Char(Main.Neg(Main.Succ(vz3000))), vz41, ba)
   new_lookup(Main.Char(Main.Neg(Main.Succ(vz3000))), Cons(Tup2(Main.Char(Main.Neg(Main.Zero)), vz401), vz41), ba) -> new_lookup(Main.Char(Main.Neg(Main.Succ(vz3000))), vz41, ba)
   new_lookup11(vz81, vz82, vz83, vz84, Main.Succ(vz850), Main.Succ(vz860), bb) -> new_lookup11(vz81, vz82, vz83, vz84, vz850, vz860, bb)
   new_lookup11(vz81, vz82, vz83, vz84, Main.Zero, Main.Succ(vz860), bb) -> new_lookup12(vz81, vz82, vz83, vz84, bb)
   new_lookup12(vz81, vz82, vz83, vz84, bb) -> new_lookup(Main.Char(Main.Neg(Main.Succ(vz81))), vz84, bb)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
----------------------------------------

(19) QDPSizeChangeProof (EQUIVALENT)
By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem. 

From the DPs we obtained the following set of size-change graphs:
*new_lookup11(vz81, vz82, vz83, vz84, Main.Succ(vz850), Main.Zero, bb) -> new_lookup(Main.Char(Main.Neg(Main.Succ(vz81))), vz84, bb)
The graph contains the following edges 4 >= 2, 7 >= 3


*new_lookup(Main.Char(Main.Neg(Main.Succ(vz3000))), Cons(Tup2(Main.Char(Main.Neg(Main.Succ(vz400000))), vz401), vz41), ba) -> new_lookup11(vz3000, vz400000, vz401, vz41, vz3000, vz400000, ba)
The graph contains the following edges 1 > 1, 2 > 2, 2 > 3, 2 > 4, 1 > 5, 2 > 6, 3 >= 7


*new_lookup11(vz81, vz82, vz83, vz84, Main.Succ(vz850), Main.Succ(vz860), bb) -> new_lookup11(vz81, vz82, vz83, vz84, vz850, vz860, bb)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 > 5, 6 > 6, 7 >= 7


*new_lookup11(vz81, vz82, vz83, vz84, Main.Zero, Main.Succ(vz860), bb) -> new_lookup12(vz81, vz82, vz83, vz84, bb)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 7 >= 5


*new_lookup12(vz81, vz82, vz83, vz84, bb) -> new_lookup(Main.Char(Main.Neg(Main.Succ(vz81))), vz84, bb)
The graph contains the following edges 4 >= 2, 5 >= 3


*new_lookup(Main.Char(Main.Neg(Main.Succ(vz3000))), Cons(Tup2(Main.Char(Main.Pos(vz40000)), vz401), vz41), ba) -> new_lookup(Main.Char(Main.Neg(Main.Succ(vz3000))), vz41, ba)
The graph contains the following edges 1 >= 1, 2 > 2, 3 >= 3


*new_lookup(Main.Char(Main.Neg(Main.Succ(vz3000))), Cons(Tup2(Main.Char(Main.Neg(Main.Zero)), vz401), vz41), ba) -> new_lookup(Main.Char(Main.Neg(Main.Succ(vz3000))), vz41, ba)
The graph contains the following edges 1 >= 1, 2 > 2, 3 >= 3


----------------------------------------

(20)
YES