/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) AND
    (7) QDP
        (8) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (9) YES
    (10) QDP
        (11) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (12) YES


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

(0)
Obligation:
mainModule Main 
module Main where {
import qualified Prelude;
data MyBool = MyTrue  | MyFalse ;

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

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

data Ordering = LT  | EQ  | GT ;

compareMyInt :: MyInt  ->  MyInt  ->  Ordering;
compareMyInt = primCmpInt;

esEsMyInt :: MyInt  ->  MyInt  ->  MyBool;
esEsMyInt = primEqInt;

esEsOrdering :: Ordering  ->  Ordering  ->  MyBool;
esEsOrdering LT LT = MyTrue;
esEsOrdering LT EQ = MyFalse;
esEsOrdering LT GT = MyFalse;
esEsOrdering EQ LT = MyFalse;
esEsOrdering EQ EQ = MyTrue;
esEsOrdering EQ GT = MyFalse;
esEsOrdering GT LT = MyFalse;
esEsOrdering GT EQ = MyFalse;
esEsOrdering GT GT = MyTrue;

fromIntMyInt :: MyInt  ->  MyInt;
fromIntMyInt x = x;

gtMyInt :: MyInt  ->  MyInt  ->  MyBool;
gtMyInt x y = esEsOrdering (compareMyInt x y) GT;

otherwise :: MyBool;
otherwise = MyTrue;

primCmpInt :: MyInt  ->  MyInt  ->  Ordering;
primCmpInt (Main.Pos Main.Zero) (Main.Pos Main.Zero) = EQ;
primCmpInt (Main.Pos Main.Zero) (Main.Neg Main.Zero) = EQ;
primCmpInt (Main.Neg Main.Zero) (Main.Pos Main.Zero) = EQ;
primCmpInt (Main.Neg Main.Zero) (Main.Neg Main.Zero) = EQ;
primCmpInt (Main.Pos x) (Main.Pos y) = primCmpNat x y;
primCmpInt (Main.Pos x) (Main.Neg y) = GT;
primCmpInt (Main.Neg x) (Main.Pos y) = LT;
primCmpInt (Main.Neg x) (Main.Neg y) = primCmpNat y x;

primCmpNat :: Main.Nat  ->  Main.Nat  ->  Ordering;
primCmpNat Main.Zero Main.Zero = EQ;
primCmpNat Main.Zero (Main.Succ y) = LT;
primCmpNat (Main.Succ x) Main.Zero = GT;
primCmpNat (Main.Succ x) (Main.Succ y) = primCmpNat 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;

signumMyInt :: MyInt  ->  MyInt;
signumMyInt = signumReal;

signumReal x = signumReal3 x;

signumReal0 x MyTrue = fromIntMyInt (Main.Neg (Main.Succ Main.Zero));

signumReal1 x MyTrue = fromIntMyInt (Main.Pos (Main.Succ Main.Zero));
signumReal1 x MyFalse = signumReal0 x otherwise;

signumReal2 x MyTrue = fromIntMyInt (Main.Pos Main.Zero);
signumReal2 x MyFalse = signumReal1 x (gtMyInt x (fromIntMyInt (Main.Pos Main.Zero)));

signumReal3 x = signumReal2 x (esEsMyInt x (fromIntMyInt (Main.Pos Main.Zero)));

}

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

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

(2)
Obligation:
mainModule Main 
module Main where {
import qualified Prelude;
data MyBool = MyTrue  | MyFalse ;

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

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

data Ordering = LT  | EQ  | GT ;

compareMyInt :: MyInt  ->  MyInt  ->  Ordering;
compareMyInt = primCmpInt;

esEsMyInt :: MyInt  ->  MyInt  ->  MyBool;
esEsMyInt = primEqInt;

esEsOrdering :: Ordering  ->  Ordering  ->  MyBool;
esEsOrdering LT LT = MyTrue;
esEsOrdering LT EQ = MyFalse;
esEsOrdering LT GT = MyFalse;
esEsOrdering EQ LT = MyFalse;
esEsOrdering EQ EQ = MyTrue;
esEsOrdering EQ GT = MyFalse;
esEsOrdering GT LT = MyFalse;
esEsOrdering GT EQ = MyFalse;
esEsOrdering GT GT = MyTrue;

fromIntMyInt :: MyInt  ->  MyInt;
fromIntMyInt x = x;

gtMyInt :: MyInt  ->  MyInt  ->  MyBool;
gtMyInt x y = esEsOrdering (compareMyInt x y) GT;

otherwise :: MyBool;
otherwise = MyTrue;

primCmpInt :: MyInt  ->  MyInt  ->  Ordering;
primCmpInt (Main.Pos Main.Zero) (Main.Pos Main.Zero) = EQ;
primCmpInt (Main.Pos Main.Zero) (Main.Neg Main.Zero) = EQ;
primCmpInt (Main.Neg Main.Zero) (Main.Pos Main.Zero) = EQ;
primCmpInt (Main.Neg Main.Zero) (Main.Neg Main.Zero) = EQ;
primCmpInt (Main.Pos x) (Main.Pos y) = primCmpNat x y;
primCmpInt (Main.Pos x) (Main.Neg y) = GT;
primCmpInt (Main.Neg x) (Main.Pos y) = LT;
primCmpInt (Main.Neg x) (Main.Neg y) = primCmpNat y x;

primCmpNat :: Main.Nat  ->  Main.Nat  ->  Ordering;
primCmpNat Main.Zero Main.Zero = EQ;
primCmpNat Main.Zero (Main.Succ y) = LT;
primCmpNat (Main.Succ x) Main.Zero = GT;
primCmpNat (Main.Succ x) (Main.Succ y) = primCmpNat 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;

signumMyInt :: MyInt  ->  MyInt;
signumMyInt = signumReal;

signumReal x = signumReal3 x;

signumReal0 x MyTrue = fromIntMyInt (Main.Neg (Main.Succ Main.Zero));

signumReal1 x MyTrue = fromIntMyInt (Main.Pos (Main.Succ Main.Zero));
signumReal1 x MyFalse = signumReal0 x otherwise;

signumReal2 x MyTrue = fromIntMyInt (Main.Pos Main.Zero);
signumReal2 x MyFalse = signumReal1 x (gtMyInt x (fromIntMyInt (Main.Pos Main.Zero)));

signumReal3 x = signumReal2 x (esEsMyInt x (fromIntMyInt (Main.Pos Main.Zero)));

}

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

(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 MyBool = MyTrue  | MyFalse ;

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

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

data Ordering = LT  | EQ  | GT ;

compareMyInt :: MyInt  ->  MyInt  ->  Ordering;
compareMyInt = primCmpInt;

esEsMyInt :: MyInt  ->  MyInt  ->  MyBool;
esEsMyInt = primEqInt;

esEsOrdering :: Ordering  ->  Ordering  ->  MyBool;
esEsOrdering LT LT = MyTrue;
esEsOrdering LT EQ = MyFalse;
esEsOrdering LT GT = MyFalse;
esEsOrdering EQ LT = MyFalse;
esEsOrdering EQ EQ = MyTrue;
esEsOrdering EQ GT = MyFalse;
esEsOrdering GT LT = MyFalse;
esEsOrdering GT EQ = MyFalse;
esEsOrdering GT GT = MyTrue;

fromIntMyInt :: MyInt  ->  MyInt;
fromIntMyInt x = x;

gtMyInt :: MyInt  ->  MyInt  ->  MyBool;
gtMyInt x y = esEsOrdering (compareMyInt x y) GT;

otherwise :: MyBool;
otherwise = MyTrue;

primCmpInt :: MyInt  ->  MyInt  ->  Ordering;
primCmpInt (Main.Pos Main.Zero) (Main.Pos Main.Zero) = EQ;
primCmpInt (Main.Pos Main.Zero) (Main.Neg Main.Zero) = EQ;
primCmpInt (Main.Neg Main.Zero) (Main.Pos Main.Zero) = EQ;
primCmpInt (Main.Neg Main.Zero) (Main.Neg Main.Zero) = EQ;
primCmpInt (Main.Pos x) (Main.Pos y) = primCmpNat x y;
primCmpInt (Main.Pos x) (Main.Neg y) = GT;
primCmpInt (Main.Neg x) (Main.Pos y) = LT;
primCmpInt (Main.Neg x) (Main.Neg y) = primCmpNat y x;

primCmpNat :: Main.Nat  ->  Main.Nat  ->  Ordering;
primCmpNat Main.Zero Main.Zero = EQ;
primCmpNat Main.Zero (Main.Succ y) = LT;
primCmpNat (Main.Succ x) Main.Zero = GT;
primCmpNat (Main.Succ x) (Main.Succ y) = primCmpNat 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;

signumMyInt :: MyInt  ->  MyInt;
signumMyInt = signumReal;

signumReal x = signumReal3 x;

signumReal0 x MyTrue = fromIntMyInt (Main.Neg (Main.Succ Main.Zero));

signumReal1 x MyTrue = fromIntMyInt (Main.Pos (Main.Succ Main.Zero));
signumReal1 x MyFalse = signumReal0 x otherwise;

signumReal2 x MyTrue = fromIntMyInt (Main.Pos Main.Zero);
signumReal2 x MyFalse = signumReal1 x (gtMyInt x (fromIntMyInt (Main.Pos Main.Zero)));

signumReal3 x = signumReal2 x (esEsMyInt x (fromIntMyInt (Main.Pos Main.Zero)));

}

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

(5) Narrow (SOUND)
Haskell To QDPs

digraph dp_graph {
node [outthreshold=100, inthreshold=100];1[label="signumMyInt",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
3[label="signumMyInt vz3",fontsize=16,color="black",shape="triangle"];3 -> 4[label="",style="solid", color="black", weight=3];
4[label="signumReal vz3",fontsize=16,color="black",shape="box"];4 -> 5[label="",style="solid", color="black", weight=3];
5[label="signumReal3 vz3",fontsize=16,color="black",shape="box"];5 -> 6[label="",style="solid", color="black", weight=3];
6[label="signumReal2 vz3 (esEsMyInt vz3 (fromIntMyInt (Pos Zero)))",fontsize=16,color="black",shape="box"];6 -> 7[label="",style="solid", color="black", weight=3];
7[label="signumReal2 vz3 (primEqInt vz3 (fromIntMyInt (Pos Zero)))",fontsize=16,color="burlywood",shape="box"];305[label="vz3/Pos vz30",fontsize=10,color="white",style="solid",shape="box"];7 -> 305[label="",style="solid", color="burlywood", weight=9];
305 -> 8[label="",style="solid", color="burlywood", weight=3];
306[label="vz3/Neg vz30",fontsize=10,color="white",style="solid",shape="box"];7 -> 306[label="",style="solid", color="burlywood", weight=9];
306 -> 9[label="",style="solid", color="burlywood", weight=3];
8[label="signumReal2 (Pos vz30) (primEqInt (Pos vz30) (fromIntMyInt (Pos Zero)))",fontsize=16,color="burlywood",shape="box"];307[label="vz30/Succ vz300",fontsize=10,color="white",style="solid",shape="box"];8 -> 307[label="",style="solid", color="burlywood", weight=9];
307 -> 10[label="",style="solid", color="burlywood", weight=3];
308[label="vz30/Zero",fontsize=10,color="white",style="solid",shape="box"];8 -> 308[label="",style="solid", color="burlywood", weight=9];
308 -> 11[label="",style="solid", color="burlywood", weight=3];
9[label="signumReal2 (Neg vz30) (primEqInt (Neg vz30) (fromIntMyInt (Pos Zero)))",fontsize=16,color="burlywood",shape="box"];309[label="vz30/Succ vz300",fontsize=10,color="white",style="solid",shape="box"];9 -> 309[label="",style="solid", color="burlywood", weight=9];
309 -> 12[label="",style="solid", color="burlywood", weight=3];
310[label="vz30/Zero",fontsize=10,color="white",style="solid",shape="box"];9 -> 310[label="",style="solid", color="burlywood", weight=9];
310 -> 13[label="",style="solid", color="burlywood", weight=3];
10[label="signumReal2 (Pos (Succ vz300)) (primEqInt (Pos (Succ vz300)) (fromIntMyInt (Pos Zero)))",fontsize=16,color="black",shape="box"];10 -> 14[label="",style="solid", color="black", weight=3];
11[label="signumReal2 (Pos Zero) (primEqInt (Pos Zero) (fromIntMyInt (Pos Zero)))",fontsize=16,color="black",shape="box"];11 -> 15[label="",style="solid", color="black", weight=3];
12[label="signumReal2 (Neg (Succ vz300)) (primEqInt (Neg (Succ vz300)) (fromIntMyInt (Pos Zero)))",fontsize=16,color="black",shape="box"];12 -> 16[label="",style="solid", color="black", weight=3];
13[label="signumReal2 (Neg Zero) (primEqInt (Neg Zero) (fromIntMyInt (Pos Zero)))",fontsize=16,color="black",shape="box"];13 -> 17[label="",style="solid", color="black", weight=3];
14[label="signumReal2 (Pos (Succ vz300)) (primEqInt (Pos (Succ vz300)) (Pos Zero))",fontsize=16,color="black",shape="box"];14 -> 18[label="",style="solid", color="black", weight=3];
15[label="signumReal2 (Pos Zero) (primEqInt (Pos Zero) (Pos Zero))",fontsize=16,color="black",shape="box"];15 -> 19[label="",style="solid", color="black", weight=3];
16[label="signumReal2 (Neg (Succ vz300)) (primEqInt (Neg (Succ vz300)) (Pos Zero))",fontsize=16,color="black",shape="box"];16 -> 20[label="",style="solid", color="black", weight=3];
17[label="signumReal2 (Neg Zero) (primEqInt (Neg Zero) (Pos Zero))",fontsize=16,color="black",shape="box"];17 -> 21[label="",style="solid", color="black", weight=3];
18[label="signumReal2 (Pos (Succ vz300)) MyFalse",fontsize=16,color="black",shape="box"];18 -> 22[label="",style="solid", color="black", weight=3];
19[label="signumReal2 (Pos Zero) MyTrue",fontsize=16,color="black",shape="box"];19 -> 23[label="",style="solid", color="black", weight=3];
20[label="signumReal2 (Neg (Succ vz300)) MyFalse",fontsize=16,color="black",shape="box"];20 -> 24[label="",style="solid", color="black", weight=3];
21[label="signumReal2 (Neg Zero) MyTrue",fontsize=16,color="black",shape="box"];21 -> 25[label="",style="solid", color="black", weight=3];
22[label="signumReal1 (Pos (Succ vz300)) (gtMyInt (Pos (Succ vz300)) (fromIntMyInt (Pos Zero)))",fontsize=16,color="black",shape="box"];22 -> 26[label="",style="solid", color="black", weight=3];
23[label="fromIntMyInt (Pos Zero)",fontsize=16,color="black",shape="triangle"];23 -> 27[label="",style="solid", color="black", weight=3];
24 -> 28[label="",style="dashed", color="red", weight=0];
24[label="signumReal1 (Neg (Succ vz300)) (gtMyInt (Neg (Succ vz300)) (fromIntMyInt (Pos Zero)))",fontsize=16,color="magenta"];24 -> 29[label="",style="dashed", color="magenta", weight=3];
25 -> 23[label="",style="dashed", color="red", weight=0];
25[label="fromIntMyInt (Pos Zero)",fontsize=16,color="magenta"];26 -> 30[label="",style="dashed", color="red", weight=0];
26[label="signumReal1 (Pos (Succ vz300)) (esEsOrdering (compareMyInt (Pos (Succ vz300)) (fromIntMyInt (Pos Zero))) GT)",fontsize=16,color="magenta"];26 -> 31[label="",style="dashed", color="magenta", weight=3];
27[label="Pos Zero",fontsize=16,color="green",shape="box"];29 -> 23[label="",style="dashed", color="red", weight=0];
29[label="fromIntMyInt (Pos Zero)",fontsize=16,color="magenta"];28[label="signumReal1 (Neg (Succ vz300)) (gtMyInt (Neg (Succ vz300)) vz4)",fontsize=16,color="black",shape="triangle"];28 -> 32[label="",style="solid", color="black", weight=3];
31 -> 23[label="",style="dashed", color="red", weight=0];
31[label="fromIntMyInt (Pos Zero)",fontsize=16,color="magenta"];30[label="signumReal1 (Pos (Succ vz300)) (esEsOrdering (compareMyInt (Pos (Succ vz300)) vz5) GT)",fontsize=16,color="black",shape="triangle"];30 -> 33[label="",style="solid", color="black", weight=3];
32[label="signumReal1 (Neg (Succ vz300)) (esEsOrdering (compareMyInt (Neg (Succ vz300)) vz4) GT)",fontsize=16,color="black",shape="box"];32 -> 34[label="",style="solid", color="black", weight=3];
33[label="signumReal1 (Pos (Succ vz300)) (esEsOrdering (primCmpInt (Pos (Succ vz300)) vz5) GT)",fontsize=16,color="burlywood",shape="box"];311[label="vz5/Pos vz50",fontsize=10,color="white",style="solid",shape="box"];33 -> 311[label="",style="solid", color="burlywood", weight=9];
311 -> 35[label="",style="solid", color="burlywood", weight=3];
312[label="vz5/Neg vz50",fontsize=10,color="white",style="solid",shape="box"];33 -> 312[label="",style="solid", color="burlywood", weight=9];
312 -> 36[label="",style="solid", color="burlywood", weight=3];
34[label="signumReal1 (Neg (Succ vz300)) (esEsOrdering (primCmpInt (Neg (Succ vz300)) vz4) GT)",fontsize=16,color="burlywood",shape="box"];313[label="vz4/Pos vz40",fontsize=10,color="white",style="solid",shape="box"];34 -> 313[label="",style="solid", color="burlywood", weight=9];
313 -> 37[label="",style="solid", color="burlywood", weight=3];
314[label="vz4/Neg vz40",fontsize=10,color="white",style="solid",shape="box"];34 -> 314[label="",style="solid", color="burlywood", weight=9];
314 -> 38[label="",style="solid", color="burlywood", weight=3];
35[label="signumReal1 (Pos (Succ vz300)) (esEsOrdering (primCmpInt (Pos (Succ vz300)) (Pos vz50)) GT)",fontsize=16,color="black",shape="box"];35 -> 39[label="",style="solid", color="black", weight=3];
36[label="signumReal1 (Pos (Succ vz300)) (esEsOrdering (primCmpInt (Pos (Succ vz300)) (Neg vz50)) GT)",fontsize=16,color="black",shape="box"];36 -> 40[label="",style="solid", color="black", weight=3];
37[label="signumReal1 (Neg (Succ vz300)) (esEsOrdering (primCmpInt (Neg (Succ vz300)) (Pos vz40)) GT)",fontsize=16,color="black",shape="box"];37 -> 41[label="",style="solid", color="black", weight=3];
38[label="signumReal1 (Neg (Succ vz300)) (esEsOrdering (primCmpInt (Neg (Succ vz300)) (Neg vz40)) GT)",fontsize=16,color="black",shape="box"];38 -> 42[label="",style="solid", color="black", weight=3];
39 -> 202[label="",style="dashed", color="red", weight=0];
39[label="signumReal1 (Pos (Succ vz300)) (esEsOrdering (primCmpNat (Succ vz300) vz50) GT)",fontsize=16,color="magenta"];39 -> 203[label="",style="dashed", color="magenta", weight=3];
39 -> 204[label="",style="dashed", color="magenta", weight=3];
39 -> 205[label="",style="dashed", color="magenta", weight=3];
40[label="signumReal1 (Pos (Succ vz300)) (esEsOrdering GT GT)",fontsize=16,color="black",shape="triangle"];40 -> 45[label="",style="solid", color="black", weight=3];
41[label="signumReal1 (Neg (Succ vz300)) (esEsOrdering LT GT)",fontsize=16,color="black",shape="triangle"];41 -> 46[label="",style="solid", color="black", weight=3];
42 -> 260[label="",style="dashed", color="red", weight=0];
42[label="signumReal1 (Neg (Succ vz300)) (esEsOrdering (primCmpNat vz40 (Succ vz300)) GT)",fontsize=16,color="magenta"];42 -> 261[label="",style="dashed", color="magenta", weight=3];
42 -> 262[label="",style="dashed", color="magenta", weight=3];
42 -> 263[label="",style="dashed", color="magenta", weight=3];
203[label="Succ vz300",fontsize=16,color="green",shape="box"];204[label="vz50",fontsize=16,color="green",shape="box"];205[label="vz300",fontsize=16,color="green",shape="box"];202[label="signumReal1 (Pos (Succ vz7)) (esEsOrdering (primCmpNat vz8 vz9) GT)",fontsize=16,color="burlywood",shape="triangle"];315[label="vz8/Succ vz80",fontsize=10,color="white",style="solid",shape="box"];202 -> 315[label="",style="solid", color="burlywood", weight=9];
315 -> 224[label="",style="solid", color="burlywood", weight=3];
316[label="vz8/Zero",fontsize=10,color="white",style="solid",shape="box"];202 -> 316[label="",style="solid", color="burlywood", weight=9];
316 -> 225[label="",style="solid", color="burlywood", weight=3];
45[label="signumReal1 (Pos (Succ vz300)) MyTrue",fontsize=16,color="black",shape="box"];45 -> 51[label="",style="solid", color="black", weight=3];
46[label="signumReal1 (Neg (Succ vz300)) MyFalse",fontsize=16,color="black",shape="triangle"];46 -> 52[label="",style="solid", color="black", weight=3];
261[label="vz300",fontsize=16,color="green",shape="box"];262[label="Succ vz300",fontsize=16,color="green",shape="box"];263[label="vz40",fontsize=16,color="green",shape="box"];260[label="signumReal1 (Neg (Succ vz13)) (esEsOrdering (primCmpNat vz14 vz15) GT)",fontsize=16,color="burlywood",shape="triangle"];317[label="vz14/Succ vz140",fontsize=10,color="white",style="solid",shape="box"];260 -> 317[label="",style="solid", color="burlywood", weight=9];
317 -> 285[label="",style="solid", color="burlywood", weight=3];
318[label="vz14/Zero",fontsize=10,color="white",style="solid",shape="box"];260 -> 318[label="",style="solid", color="burlywood", weight=9];
318 -> 286[label="",style="solid", color="burlywood", weight=3];
224[label="signumReal1 (Pos (Succ vz7)) (esEsOrdering (primCmpNat (Succ vz80) vz9) GT)",fontsize=16,color="burlywood",shape="box"];319[label="vz9/Succ vz90",fontsize=10,color="white",style="solid",shape="box"];224 -> 319[label="",style="solid", color="burlywood", weight=9];
319 -> 234[label="",style="solid", color="burlywood", weight=3];
320[label="vz9/Zero",fontsize=10,color="white",style="solid",shape="box"];224 -> 320[label="",style="solid", color="burlywood", weight=9];
320 -> 235[label="",style="solid", color="burlywood", weight=3];
225[label="signumReal1 (Pos (Succ vz7)) (esEsOrdering (primCmpNat Zero vz9) GT)",fontsize=16,color="burlywood",shape="box"];321[label="vz9/Succ vz90",fontsize=10,color="white",style="solid",shape="box"];225 -> 321[label="",style="solid", color="burlywood", weight=9];
321 -> 236[label="",style="solid", color="burlywood", weight=3];
322[label="vz9/Zero",fontsize=10,color="white",style="solid",shape="box"];225 -> 322[label="",style="solid", color="burlywood", weight=9];
322 -> 237[label="",style="solid", color="burlywood", weight=3];
51[label="fromIntMyInt (Pos (Succ Zero))",fontsize=16,color="black",shape="triangle"];51 -> 57[label="",style="solid", color="black", weight=3];
52[label="signumReal0 (Neg (Succ vz300)) otherwise",fontsize=16,color="black",shape="box"];52 -> 58[label="",style="solid", color="black", weight=3];
285[label="signumReal1 (Neg (Succ vz13)) (esEsOrdering (primCmpNat (Succ vz140) vz15) GT)",fontsize=16,color="burlywood",shape="box"];323[label="vz15/Succ vz150",fontsize=10,color="white",style="solid",shape="box"];285 -> 323[label="",style="solid", color="burlywood", weight=9];
323 -> 288[label="",style="solid", color="burlywood", weight=3];
324[label="vz15/Zero",fontsize=10,color="white",style="solid",shape="box"];285 -> 324[label="",style="solid", color="burlywood", weight=9];
324 -> 289[label="",style="solid", color="burlywood", weight=3];
286[label="signumReal1 (Neg (Succ vz13)) (esEsOrdering (primCmpNat Zero vz15) GT)",fontsize=16,color="burlywood",shape="box"];325[label="vz15/Succ vz150",fontsize=10,color="white",style="solid",shape="box"];286 -> 325[label="",style="solid", color="burlywood", weight=9];
325 -> 290[label="",style="solid", color="burlywood", weight=3];
326[label="vz15/Zero",fontsize=10,color="white",style="solid",shape="box"];286 -> 326[label="",style="solid", color="burlywood", weight=9];
326 -> 291[label="",style="solid", color="burlywood", weight=3];
234[label="signumReal1 (Pos (Succ vz7)) (esEsOrdering (primCmpNat (Succ vz80) (Succ vz90)) GT)",fontsize=16,color="black",shape="box"];234 -> 245[label="",style="solid", color="black", weight=3];
235[label="signumReal1 (Pos (Succ vz7)) (esEsOrdering (primCmpNat (Succ vz80) Zero) GT)",fontsize=16,color="black",shape="box"];235 -> 246[label="",style="solid", color="black", weight=3];
236[label="signumReal1 (Pos (Succ vz7)) (esEsOrdering (primCmpNat Zero (Succ vz90)) GT)",fontsize=16,color="black",shape="box"];236 -> 247[label="",style="solid", color="black", weight=3];
237[label="signumReal1 (Pos (Succ vz7)) (esEsOrdering (primCmpNat Zero Zero) GT)",fontsize=16,color="black",shape="box"];237 -> 248[label="",style="solid", color="black", weight=3];
57[label="Pos (Succ Zero)",fontsize=16,color="green",shape="box"];58[label="signumReal0 (Neg (Succ vz300)) MyTrue",fontsize=16,color="black",shape="box"];58 -> 65[label="",style="solid", color="black", weight=3];
288[label="signumReal1 (Neg (Succ vz13)) (esEsOrdering (primCmpNat (Succ vz140) (Succ vz150)) GT)",fontsize=16,color="black",shape="box"];288 -> 293[label="",style="solid", color="black", weight=3];
289[label="signumReal1 (Neg (Succ vz13)) (esEsOrdering (primCmpNat (Succ vz140) Zero) GT)",fontsize=16,color="black",shape="box"];289 -> 294[label="",style="solid", color="black", weight=3];
290[label="signumReal1 (Neg (Succ vz13)) (esEsOrdering (primCmpNat Zero (Succ vz150)) GT)",fontsize=16,color="black",shape="box"];290 -> 295[label="",style="solid", color="black", weight=3];
291[label="signumReal1 (Neg (Succ vz13)) (esEsOrdering (primCmpNat Zero Zero) GT)",fontsize=16,color="black",shape="box"];291 -> 296[label="",style="solid", color="black", weight=3];
245 -> 202[label="",style="dashed", color="red", weight=0];
245[label="signumReal1 (Pos (Succ vz7)) (esEsOrdering (primCmpNat vz80 vz90) GT)",fontsize=16,color="magenta"];245 -> 255[label="",style="dashed", color="magenta", weight=3];
245 -> 256[label="",style="dashed", color="magenta", weight=3];
246 -> 40[label="",style="dashed", color="red", weight=0];
246[label="signumReal1 (Pos (Succ vz7)) (esEsOrdering GT GT)",fontsize=16,color="magenta"];246 -> 257[label="",style="dashed", color="magenta", weight=3];
247[label="signumReal1 (Pos (Succ vz7)) (esEsOrdering LT GT)",fontsize=16,color="black",shape="box"];247 -> 258[label="",style="solid", color="black", weight=3];
248[label="signumReal1 (Pos (Succ vz7)) (esEsOrdering EQ GT)",fontsize=16,color="black",shape="box"];248 -> 259[label="",style="solid", color="black", weight=3];
65[label="fromIntMyInt (Neg (Succ Zero))",fontsize=16,color="black",shape="triangle"];65 -> 74[label="",style="solid", color="black", weight=3];
293 -> 260[label="",style="dashed", color="red", weight=0];
293[label="signumReal1 (Neg (Succ vz13)) (esEsOrdering (primCmpNat vz140 vz150) GT)",fontsize=16,color="magenta"];293 -> 298[label="",style="dashed", color="magenta", weight=3];
293 -> 299[label="",style="dashed", color="magenta", weight=3];
294[label="signumReal1 (Neg (Succ vz13)) (esEsOrdering GT GT)",fontsize=16,color="black",shape="box"];294 -> 300[label="",style="solid", color="black", weight=3];
295 -> 41[label="",style="dashed", color="red", weight=0];
295[label="signumReal1 (Neg (Succ vz13)) (esEsOrdering LT GT)",fontsize=16,color="magenta"];295 -> 301[label="",style="dashed", color="magenta", weight=3];
296[label="signumReal1 (Neg (Succ vz13)) (esEsOrdering EQ GT)",fontsize=16,color="black",shape="box"];296 -> 302[label="",style="solid", color="black", weight=3];
255[label="vz80",fontsize=16,color="green",shape="box"];256[label="vz90",fontsize=16,color="green",shape="box"];257[label="vz7",fontsize=16,color="green",shape="box"];258[label="signumReal1 (Pos (Succ vz7)) MyFalse",fontsize=16,color="black",shape="triangle"];258 -> 287[label="",style="solid", color="black", weight=3];
259 -> 258[label="",style="dashed", color="red", weight=0];
259[label="signumReal1 (Pos (Succ vz7)) MyFalse",fontsize=16,color="magenta"];74[label="Neg (Succ Zero)",fontsize=16,color="green",shape="box"];298[label="vz150",fontsize=16,color="green",shape="box"];299[label="vz140",fontsize=16,color="green",shape="box"];300[label="signumReal1 (Neg (Succ vz13)) MyTrue",fontsize=16,color="black",shape="box"];300 -> 303[label="",style="solid", color="black", weight=3];
301[label="vz13",fontsize=16,color="green",shape="box"];302 -> 46[label="",style="dashed", color="red", weight=0];
302[label="signumReal1 (Neg (Succ vz13)) MyFalse",fontsize=16,color="magenta"];302 -> 304[label="",style="dashed", color="magenta", weight=3];
287[label="signumReal0 (Pos (Succ vz7)) otherwise",fontsize=16,color="black",shape="box"];287 -> 292[label="",style="solid", color="black", weight=3];
303 -> 51[label="",style="dashed", color="red", weight=0];
303[label="fromIntMyInt (Pos (Succ Zero))",fontsize=16,color="magenta"];304[label="vz13",fontsize=16,color="green",shape="box"];292[label="signumReal0 (Pos (Succ vz7)) MyTrue",fontsize=16,color="black",shape="box"];292 -> 297[label="",style="solid", color="black", weight=3];
297 -> 65[label="",style="dashed", color="red", weight=0];
297[label="fromIntMyInt (Neg (Succ Zero))",fontsize=16,color="magenta"];}

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

(6)
Complex Obligation (AND)

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

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

   new_signumReal1(vz13, Main.Succ(vz140), Main.Succ(vz150)) -> new_signumReal1(vz13, vz140, vz150)

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

(8) 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_signumReal1(vz13, Main.Succ(vz140), Main.Succ(vz150)) -> new_signumReal1(vz13, vz140, vz150)
The graph contains the following edges 1 >= 1, 2 > 2, 3 > 3


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

(9)
YES

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

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

   new_signumReal10(vz7, Main.Succ(vz80), Main.Succ(vz90)) -> new_signumReal10(vz7, vz80, vz90)

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

(11) 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_signumReal10(vz7, Main.Succ(vz80), Main.Succ(vz90)) -> new_signumReal10(vz7, vz80, vz90)
The graph contains the following edges 1 >= 1, 2 > 2, 3 > 3


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

(12)
YES