7.91/3.58	YES
9.69/4.14	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
9.69/4.14	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
9.69/4.14	
9.69/4.14	
9.69/4.14	H-Termination with start terms of the given HASKELL could be proven:
9.69/4.14	
9.69/4.14	(0) HASKELL
9.69/4.14	(1) BR [EQUIVALENT, 0 ms]
9.69/4.14	(2) HASKELL
9.69/4.14	(3) COR [EQUIVALENT, 0 ms]
9.69/4.14	(4) HASKELL
9.69/4.14	(5) Narrow [EQUIVALENT, 30 ms]
9.69/4.14	(6) YES
9.69/4.14	
9.69/4.14	
9.69/4.14	----------------------------------------
9.69/4.14	
9.69/4.14	(0)
9.69/4.14	Obligation:
9.69/4.14	mainModule Main 
9.69/4.14	module Main where {
9.69/4.14	import qualified Prelude;
9.69/4.14	data MyBool = MyTrue  | MyFalse ;
9.69/4.14	
9.69/4.14	data MyInt = Pos Main.Nat  | Neg Main.Nat ;
9.69/4.14	
9.69/4.14	data Main.Nat = Succ Main.Nat  | Zero ;
9.69/4.14	
9.69/4.14	data Ordering = LT  | EQ  | GT ;
9.69/4.14	
9.69/4.14	absMyInt :: MyInt  ->  MyInt;
9.69/4.14	absMyInt = absReal;
9.69/4.14	
9.69/4.14	absReal x = absReal2 x;
9.69/4.14	
9.69/4.14	absReal0 x MyTrue = negateMyInt x;
9.69/4.14	
9.69/4.14	absReal1 x MyTrue = x;
9.69/4.14	absReal1 x MyFalse = absReal0 x otherwise;
9.69/4.14	
9.69/4.14	absReal2 x = absReal1 x (gtEsMyInt x (fromIntMyInt (Main.Pos Main.Zero)));
9.69/4.14	
9.69/4.14	compareMyInt :: MyInt  ->  MyInt  ->  Ordering;
9.69/4.14	compareMyInt = primCmpInt;
9.69/4.14	
9.69/4.14	esEsOrdering :: Ordering  ->  Ordering  ->  MyBool;
9.69/4.14	esEsOrdering LT LT = MyTrue;
9.69/4.14	esEsOrdering LT EQ = MyFalse;
9.69/4.14	esEsOrdering LT GT = MyFalse;
9.69/4.14	esEsOrdering EQ LT = MyFalse;
9.69/4.14	esEsOrdering EQ EQ = MyTrue;
9.69/4.14	esEsOrdering EQ GT = MyFalse;
9.69/4.14	esEsOrdering GT LT = MyFalse;
9.69/4.14	esEsOrdering GT EQ = MyFalse;
9.69/4.14	esEsOrdering GT GT = MyTrue;
9.69/4.14	
9.69/4.14	fromIntMyInt :: MyInt  ->  MyInt;
9.69/4.14	fromIntMyInt x = x;
9.69/4.14	
9.69/4.14	fsEsOrdering :: Ordering  ->  Ordering  ->  MyBool;
9.69/4.14	fsEsOrdering x y = not (esEsOrdering x y);
9.69/4.14	
9.69/4.14	gtEsMyInt :: MyInt  ->  MyInt  ->  MyBool;
9.69/4.14	gtEsMyInt x y = fsEsOrdering (compareMyInt x y) LT;
9.69/4.14	
9.69/4.14	negateMyInt :: MyInt  ->  MyInt;
9.69/4.14	negateMyInt = primNegInt;
9.69/4.14	
9.69/4.14	not :: MyBool  ->  MyBool;
9.69/4.14	not MyTrue = MyFalse;
9.69/4.14	not MyFalse = MyTrue;
9.69/4.14	
9.69/4.14	otherwise :: MyBool;
9.69/4.14	otherwise = MyTrue;
9.69/4.14	
9.69/4.14	primCmpInt :: MyInt  ->  MyInt  ->  Ordering;
9.69/4.14	primCmpInt (Main.Pos Main.Zero) (Main.Pos Main.Zero) = EQ;
9.69/4.14	primCmpInt (Main.Pos Main.Zero) (Main.Neg Main.Zero) = EQ;
9.69/4.14	primCmpInt (Main.Neg Main.Zero) (Main.Pos Main.Zero) = EQ;
9.69/4.14	primCmpInt (Main.Neg Main.Zero) (Main.Neg Main.Zero) = EQ;
9.69/4.14	primCmpInt (Main.Pos x) (Main.Pos y) = primCmpNat x y;
9.69/4.14	primCmpInt (Main.Pos x) (Main.Neg y) = GT;
9.69/4.14	primCmpInt (Main.Neg x) (Main.Pos y) = LT;
9.69/4.14	primCmpInt (Main.Neg x) (Main.Neg y) = primCmpNat y x;
9.69/4.14	
9.69/4.14	primCmpNat :: Main.Nat  ->  Main.Nat  ->  Ordering;
9.69/4.14	primCmpNat Main.Zero Main.Zero = EQ;
9.69/4.14	primCmpNat Main.Zero (Main.Succ y) = LT;
9.69/4.14	primCmpNat (Main.Succ x) Main.Zero = GT;
9.69/4.14	primCmpNat (Main.Succ x) (Main.Succ y) = primCmpNat x y;
9.69/4.14	
9.69/4.14	primNegInt :: MyInt  ->  MyInt;
9.69/4.14	primNegInt (Main.Pos x) = Main.Neg x;
9.69/4.14	primNegInt (Main.Neg x) = Main.Pos x;
9.69/4.14	
9.69/4.14	}
9.69/4.14	
9.69/4.14	----------------------------------------
9.69/4.14	
9.69/4.14	(1) BR (EQUIVALENT)
9.69/4.14	Replaced joker patterns by fresh variables and removed binding patterns.
9.69/4.14	----------------------------------------
9.69/4.14	
9.69/4.14	(2)
9.69/4.14	Obligation:
9.69/4.14	mainModule Main 
9.69/4.14	module Main where {
9.69/4.14	import qualified Prelude;
9.69/4.14	data MyBool = MyTrue  | MyFalse ;
9.69/4.14	
9.69/4.14	data MyInt = Pos Main.Nat  | Neg Main.Nat ;
9.69/4.14	
9.69/4.14	data Main.Nat = Succ Main.Nat  | Zero ;
9.69/4.14	
9.69/4.14	data Ordering = LT  | EQ  | GT ;
9.69/4.14	
9.69/4.14	absMyInt :: MyInt  ->  MyInt;
9.69/4.14	absMyInt = absReal;
9.69/4.14	
9.69/4.14	absReal x = absReal2 x;
9.69/4.14	
9.69/4.14	absReal0 x MyTrue = negateMyInt x;
9.69/4.14	
9.69/4.14	absReal1 x MyTrue = x;
9.69/4.14	absReal1 x MyFalse = absReal0 x otherwise;
9.69/4.14	
9.69/4.14	absReal2 x = absReal1 x (gtEsMyInt x (fromIntMyInt (Main.Pos Main.Zero)));
9.69/4.14	
9.69/4.14	compareMyInt :: MyInt  ->  MyInt  ->  Ordering;
9.69/4.14	compareMyInt = primCmpInt;
9.69/4.14	
9.69/4.14	esEsOrdering :: Ordering  ->  Ordering  ->  MyBool;
9.69/4.14	esEsOrdering LT LT = MyTrue;
9.69/4.14	esEsOrdering LT EQ = MyFalse;
9.69/4.14	esEsOrdering LT GT = MyFalse;
9.69/4.14	esEsOrdering EQ LT = MyFalse;
9.69/4.14	esEsOrdering EQ EQ = MyTrue;
9.69/4.14	esEsOrdering EQ GT = MyFalse;
9.69/4.14	esEsOrdering GT LT = MyFalse;
9.69/4.14	esEsOrdering GT EQ = MyFalse;
9.69/4.14	esEsOrdering GT GT = MyTrue;
9.69/4.14	
9.69/4.14	fromIntMyInt :: MyInt  ->  MyInt;
9.69/4.14	fromIntMyInt x = x;
9.69/4.14	
9.69/4.14	fsEsOrdering :: Ordering  ->  Ordering  ->  MyBool;
9.69/4.14	fsEsOrdering x y = not (esEsOrdering x y);
9.69/4.14	
9.69/4.14	gtEsMyInt :: MyInt  ->  MyInt  ->  MyBool;
9.69/4.14	gtEsMyInt x y = fsEsOrdering (compareMyInt x y) LT;
9.69/4.14	
9.69/4.14	negateMyInt :: MyInt  ->  MyInt;
9.69/4.14	negateMyInt = primNegInt;
9.69/4.14	
9.69/4.14	not :: MyBool  ->  MyBool;
9.69/4.14	not MyTrue = MyFalse;
9.69/4.14	not MyFalse = MyTrue;
9.69/4.14	
9.69/4.14	otherwise :: MyBool;
9.69/4.14	otherwise = MyTrue;
9.69/4.14	
9.69/4.14	primCmpInt :: MyInt  ->  MyInt  ->  Ordering;
9.69/4.14	primCmpInt (Main.Pos Main.Zero) (Main.Pos Main.Zero) = EQ;
9.69/4.14	primCmpInt (Main.Pos Main.Zero) (Main.Neg Main.Zero) = EQ;
9.69/4.14	primCmpInt (Main.Neg Main.Zero) (Main.Pos Main.Zero) = EQ;
9.69/4.14	primCmpInt (Main.Neg Main.Zero) (Main.Neg Main.Zero) = EQ;
9.69/4.14	primCmpInt (Main.Pos x) (Main.Pos y) = primCmpNat x y;
9.69/4.14	primCmpInt (Main.Pos x) (Main.Neg y) = GT;
9.69/4.14	primCmpInt (Main.Neg x) (Main.Pos y) = LT;
9.69/4.14	primCmpInt (Main.Neg x) (Main.Neg y) = primCmpNat y x;
9.69/4.14	
9.69/4.14	primCmpNat :: Main.Nat  ->  Main.Nat  ->  Ordering;
9.69/4.14	primCmpNat Main.Zero Main.Zero = EQ;
9.69/4.14	primCmpNat Main.Zero (Main.Succ y) = LT;
9.69/4.14	primCmpNat (Main.Succ x) Main.Zero = GT;
9.69/4.14	primCmpNat (Main.Succ x) (Main.Succ y) = primCmpNat x y;
9.69/4.14	
9.69/4.14	primNegInt :: MyInt  ->  MyInt;
9.69/4.14	primNegInt (Main.Pos x) = Main.Neg x;
9.69/4.14	primNegInt (Main.Neg x) = Main.Pos x;
9.69/4.14	
9.69/4.14	}
9.69/4.14	
9.69/4.14	----------------------------------------
9.69/4.14	
9.69/4.14	(3) COR (EQUIVALENT)
9.69/4.14	Cond Reductions:
9.69/4.14	The following Function with conditions
9.69/4.14	"undefined |Falseundefined;
9.69/4.14	"
9.69/4.14	is transformed to
9.69/4.14	"undefined  = undefined1;
9.69/4.14	"
9.69/4.14	"undefined0 True = undefined;
9.69/4.14	"
9.69/4.14	"undefined1  = undefined0 False;
9.69/4.14	"
9.69/4.14	
9.69/4.14	----------------------------------------
9.69/4.14	
9.69/4.14	(4)
9.69/4.14	Obligation:
9.69/4.14	mainModule Main 
9.69/4.14	module Main where {
9.69/4.14	import qualified Prelude;
9.69/4.14	data MyBool = MyTrue  | MyFalse ;
9.69/4.14	
9.69/4.14	data MyInt = Pos Main.Nat  | Neg Main.Nat ;
9.69/4.14	
9.69/4.14	data Main.Nat = Succ Main.Nat  | Zero ;
9.69/4.14	
9.69/4.14	data Ordering = LT  | EQ  | GT ;
9.69/4.14	
9.69/4.14	absMyInt :: MyInt  ->  MyInt;
9.69/4.14	absMyInt = absReal;
9.69/4.14	
9.69/4.14	absReal x = absReal2 x;
9.69/4.14	
9.69/4.14	absReal0 x MyTrue = negateMyInt x;
9.69/4.14	
9.69/4.14	absReal1 x MyTrue = x;
9.69/4.14	absReal1 x MyFalse = absReal0 x otherwise;
9.69/4.14	
9.69/4.14	absReal2 x = absReal1 x (gtEsMyInt x (fromIntMyInt (Main.Pos Main.Zero)));
9.69/4.14	
9.69/4.14	compareMyInt :: MyInt  ->  MyInt  ->  Ordering;
9.69/4.14	compareMyInt = primCmpInt;
9.69/4.14	
9.69/4.14	esEsOrdering :: Ordering  ->  Ordering  ->  MyBool;
9.69/4.14	esEsOrdering LT LT = MyTrue;
9.69/4.14	esEsOrdering LT EQ = MyFalse;
9.69/4.14	esEsOrdering LT GT = MyFalse;
9.69/4.14	esEsOrdering EQ LT = MyFalse;
9.69/4.14	esEsOrdering EQ EQ = MyTrue;
9.69/4.14	esEsOrdering EQ GT = MyFalse;
9.69/4.14	esEsOrdering GT LT = MyFalse;
9.69/4.14	esEsOrdering GT EQ = MyFalse;
9.69/4.14	esEsOrdering GT GT = MyTrue;
9.69/4.14	
9.69/4.14	fromIntMyInt :: MyInt  ->  MyInt;
9.69/4.14	fromIntMyInt x = x;
9.69/4.14	
9.69/4.14	fsEsOrdering :: Ordering  ->  Ordering  ->  MyBool;
9.69/4.14	fsEsOrdering x y = not (esEsOrdering x y);
9.69/4.14	
9.69/4.14	gtEsMyInt :: MyInt  ->  MyInt  ->  MyBool;
9.69/4.14	gtEsMyInt x y = fsEsOrdering (compareMyInt x y) LT;
9.69/4.14	
9.69/4.14	negateMyInt :: MyInt  ->  MyInt;
9.69/4.14	negateMyInt = primNegInt;
9.69/4.14	
9.69/4.14	not :: MyBool  ->  MyBool;
9.69/4.14	not MyTrue = MyFalse;
9.69/4.14	not MyFalse = MyTrue;
9.69/4.14	
9.69/4.14	otherwise :: MyBool;
9.69/4.14	otherwise = MyTrue;
9.69/4.14	
9.69/4.14	primCmpInt :: MyInt  ->  MyInt  ->  Ordering;
9.69/4.14	primCmpInt (Main.Pos Main.Zero) (Main.Pos Main.Zero) = EQ;
9.69/4.14	primCmpInt (Main.Pos Main.Zero) (Main.Neg Main.Zero) = EQ;
9.69/4.14	primCmpInt (Main.Neg Main.Zero) (Main.Pos Main.Zero) = EQ;
9.69/4.14	primCmpInt (Main.Neg Main.Zero) (Main.Neg Main.Zero) = EQ;
9.69/4.14	primCmpInt (Main.Pos x) (Main.Pos y) = primCmpNat x y;
9.69/4.14	primCmpInt (Main.Pos x) (Main.Neg y) = GT;
9.69/4.14	primCmpInt (Main.Neg x) (Main.Pos y) = LT;
9.69/4.14	primCmpInt (Main.Neg x) (Main.Neg y) = primCmpNat y x;
9.69/4.14	
9.69/4.14	primCmpNat :: Main.Nat  ->  Main.Nat  ->  Ordering;
9.69/4.14	primCmpNat Main.Zero Main.Zero = EQ;
9.69/4.14	primCmpNat Main.Zero (Main.Succ y) = LT;
9.69/4.14	primCmpNat (Main.Succ x) Main.Zero = GT;
9.69/4.14	primCmpNat (Main.Succ x) (Main.Succ y) = primCmpNat x y;
9.69/4.14	
9.69/4.14	primNegInt :: MyInt  ->  MyInt;
9.69/4.14	primNegInt (Main.Pos x) = Main.Neg x;
9.69/4.14	primNegInt (Main.Neg x) = Main.Pos x;
9.69/4.14	
9.69/4.14	}
9.69/4.14	
9.69/4.14	----------------------------------------
9.69/4.14	
9.69/4.14	(5) Narrow (EQUIVALENT)
9.69/4.14	Haskell To QDPs
9.69/4.14	
9.69/4.14	digraph dp_graph {
9.69/4.14	node [outthreshold=100, inthreshold=100];1[label="absMyInt",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
9.69/4.14	3[label="absMyInt vx3",fontsize=16,color="black",shape="triangle"];3 -> 4[label="",style="solid", color="black", weight=3];
9.69/4.14	4[label="absReal vx3",fontsize=16,color="black",shape="box"];4 -> 5[label="",style="solid", color="black", weight=3];
9.69/4.14	5[label="absReal2 vx3",fontsize=16,color="black",shape="box"];5 -> 6[label="",style="solid", color="black", weight=3];
9.69/4.14	6[label="absReal1 vx3 (gtEsMyInt vx3 (fromIntMyInt (Pos Zero)))",fontsize=16,color="black",shape="box"];6 -> 7[label="",style="solid", color="black", weight=3];
9.69/4.14	7[label="absReal1 vx3 (fsEsOrdering (compareMyInt vx3 (fromIntMyInt (Pos Zero))) LT)",fontsize=16,color="black",shape="box"];7 -> 8[label="",style="solid", color="black", weight=3];
9.69/4.14	8[label="absReal1 vx3 (not (esEsOrdering (compareMyInt vx3 (fromIntMyInt (Pos Zero))) LT))",fontsize=16,color="black",shape="box"];8 -> 9[label="",style="solid", color="black", weight=3];
9.69/4.14	9[label="absReal1 vx3 (not (esEsOrdering (primCmpInt vx3 (fromIntMyInt (Pos Zero))) LT))",fontsize=16,color="burlywood",shape="box"];41[label="vx3/Pos vx30",fontsize=10,color="white",style="solid",shape="box"];9 -> 41[label="",style="solid", color="burlywood", weight=9];
9.69/4.14	41 -> 10[label="",style="solid", color="burlywood", weight=3];
9.69/4.14	42[label="vx3/Neg vx30",fontsize=10,color="white",style="solid",shape="box"];9 -> 42[label="",style="solid", color="burlywood", weight=9];
9.69/4.14	42 -> 11[label="",style="solid", color="burlywood", weight=3];
9.69/4.14	10[label="absReal1 (Pos vx30) (not (esEsOrdering (primCmpInt (Pos vx30) (fromIntMyInt (Pos Zero))) LT))",fontsize=16,color="burlywood",shape="box"];43[label="vx30/Succ vx300",fontsize=10,color="white",style="solid",shape="box"];10 -> 43[label="",style="solid", color="burlywood", weight=9];
9.69/4.14	43 -> 12[label="",style="solid", color="burlywood", weight=3];
9.69/4.14	44[label="vx30/Zero",fontsize=10,color="white",style="solid",shape="box"];10 -> 44[label="",style="solid", color="burlywood", weight=9];
9.69/4.14	44 -> 13[label="",style="solid", color="burlywood", weight=3];
9.69/4.14	11[label="absReal1 (Neg vx30) (not (esEsOrdering (primCmpInt (Neg vx30) (fromIntMyInt (Pos Zero))) LT))",fontsize=16,color="burlywood",shape="box"];45[label="vx30/Succ vx300",fontsize=10,color="white",style="solid",shape="box"];11 -> 45[label="",style="solid", color="burlywood", weight=9];
9.69/4.14	45 -> 14[label="",style="solid", color="burlywood", weight=3];
9.69/4.14	46[label="vx30/Zero",fontsize=10,color="white",style="solid",shape="box"];11 -> 46[label="",style="solid", color="burlywood", weight=9];
9.69/4.14	46 -> 15[label="",style="solid", color="burlywood", weight=3];
9.69/4.14	12[label="absReal1 (Pos (Succ vx300)) (not (esEsOrdering (primCmpInt (Pos (Succ vx300)) (fromIntMyInt (Pos Zero))) LT))",fontsize=16,color="black",shape="box"];12 -> 16[label="",style="solid", color="black", weight=3];
9.69/4.14	13[label="absReal1 (Pos Zero) (not (esEsOrdering (primCmpInt (Pos Zero) (fromIntMyInt (Pos Zero))) LT))",fontsize=16,color="black",shape="box"];13 -> 17[label="",style="solid", color="black", weight=3];
9.69/4.14	14[label="absReal1 (Neg (Succ vx300)) (not (esEsOrdering (primCmpInt (Neg (Succ vx300)) (fromIntMyInt (Pos Zero))) LT))",fontsize=16,color="black",shape="box"];14 -> 18[label="",style="solid", color="black", weight=3];
9.69/4.14	15[label="absReal1 (Neg Zero) (not (esEsOrdering (primCmpInt (Neg Zero) (fromIntMyInt (Pos Zero))) LT))",fontsize=16,color="black",shape="box"];15 -> 19[label="",style="solid", color="black", weight=3];
9.69/4.14	16[label="absReal1 (Pos (Succ vx300)) (not (esEsOrdering (primCmpInt (Pos (Succ vx300)) (Pos Zero)) LT))",fontsize=16,color="black",shape="box"];16 -> 20[label="",style="solid", color="black", weight=3];
9.69/4.14	17[label="absReal1 (Pos Zero) (not (esEsOrdering (primCmpInt (Pos Zero) (Pos Zero)) LT))",fontsize=16,color="black",shape="box"];17 -> 21[label="",style="solid", color="black", weight=3];
9.69/4.14	18[label="absReal1 (Neg (Succ vx300)) (not (esEsOrdering (primCmpInt (Neg (Succ vx300)) (Pos Zero)) LT))",fontsize=16,color="black",shape="box"];18 -> 22[label="",style="solid", color="black", weight=3];
9.69/4.14	19[label="absReal1 (Neg Zero) (not (esEsOrdering (primCmpInt (Neg Zero) (Pos Zero)) LT))",fontsize=16,color="black",shape="box"];19 -> 23[label="",style="solid", color="black", weight=3];
9.69/4.14	20[label="absReal1 (Pos (Succ vx300)) (not (esEsOrdering (primCmpNat (Succ vx300) Zero) LT))",fontsize=16,color="black",shape="box"];20 -> 24[label="",style="solid", color="black", weight=3];
9.69/4.14	21[label="absReal1 (Pos Zero) (not (esEsOrdering EQ LT))",fontsize=16,color="black",shape="box"];21 -> 25[label="",style="solid", color="black", weight=3];
9.69/4.14	22[label="absReal1 (Neg (Succ vx300)) (not (esEsOrdering LT LT))",fontsize=16,color="black",shape="box"];22 -> 26[label="",style="solid", color="black", weight=3];
9.69/4.14	23[label="absReal1 (Neg Zero) (not (esEsOrdering EQ LT))",fontsize=16,color="black",shape="box"];23 -> 27[label="",style="solid", color="black", weight=3];
9.69/4.14	24[label="absReal1 (Pos (Succ vx300)) (not (esEsOrdering GT LT))",fontsize=16,color="black",shape="box"];24 -> 28[label="",style="solid", color="black", weight=3];
9.69/4.14	25[label="absReal1 (Pos Zero) (not MyFalse)",fontsize=16,color="black",shape="box"];25 -> 29[label="",style="solid", color="black", weight=3];
9.69/4.14	26[label="absReal1 (Neg (Succ vx300)) (not MyTrue)",fontsize=16,color="black",shape="box"];26 -> 30[label="",style="solid", color="black", weight=3];
9.69/4.14	27[label="absReal1 (Neg Zero) (not MyFalse)",fontsize=16,color="black",shape="box"];27 -> 31[label="",style="solid", color="black", weight=3];
9.69/4.14	28[label="absReal1 (Pos (Succ vx300)) (not MyFalse)",fontsize=16,color="black",shape="box"];28 -> 32[label="",style="solid", color="black", weight=3];
9.69/4.14	29[label="absReal1 (Pos Zero) MyTrue",fontsize=16,color="black",shape="box"];29 -> 33[label="",style="solid", color="black", weight=3];
9.69/4.14	30[label="absReal1 (Neg (Succ vx300)) MyFalse",fontsize=16,color="black",shape="box"];30 -> 34[label="",style="solid", color="black", weight=3];
9.69/4.14	31[label="absReal1 (Neg Zero) MyTrue",fontsize=16,color="black",shape="box"];31 -> 35[label="",style="solid", color="black", weight=3];
9.69/4.14	32[label="absReal1 (Pos (Succ vx300)) MyTrue",fontsize=16,color="black",shape="box"];32 -> 36[label="",style="solid", color="black", weight=3];
9.69/4.14	33[label="Pos Zero",fontsize=16,color="green",shape="box"];34[label="absReal0 (Neg (Succ vx300)) otherwise",fontsize=16,color="black",shape="box"];34 -> 37[label="",style="solid", color="black", weight=3];
9.69/4.14	35[label="Neg Zero",fontsize=16,color="green",shape="box"];36[label="Pos (Succ vx300)",fontsize=16,color="green",shape="box"];37[label="absReal0 (Neg (Succ vx300)) MyTrue",fontsize=16,color="black",shape="box"];37 -> 38[label="",style="solid", color="black", weight=3];
9.69/4.14	38[label="negateMyInt (Neg (Succ vx300))",fontsize=16,color="black",shape="box"];38 -> 39[label="",style="solid", color="black", weight=3];
9.69/4.14	39[label="primNegInt (Neg (Succ vx300))",fontsize=16,color="black",shape="box"];39 -> 40[label="",style="solid", color="black", weight=3];
9.69/4.14	40[label="Pos (Succ vx300)",fontsize=16,color="green",shape="box"];}
9.69/4.14	
9.69/4.14	----------------------------------------
9.69/4.14	
9.69/4.14	(6)
9.69/4.14	YES
10.03/4.17	EOF