/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) QDPSizeChangeProof [EQUIVALENT, 0 ms]
(8) YES


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

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

data MyBool = MyTrue  | MyFalse ;

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

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

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

fsEsChar :: Main.Char  ->  Main.Char  ->  MyBool;
fsEsChar x y = not (esEsChar x y);

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

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

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

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

fsEsChar :: Main.Char  ->  Main.Char  ->  MyBool;
fsEsChar x y = not (esEsChar x y);

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

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

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

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

fsEsChar :: Main.Char  ->  Main.Char  ->  MyBool;
fsEsChar x y = not (esEsChar x y);

not :: MyBool  ->  MyBool;
not MyTrue = MyFalse;
not MyFalse = 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="fsEsChar",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
3[label="fsEsChar vz3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3];
4[label="fsEsChar vz3 vz4",fontsize=16,color="black",shape="triangle"];4 -> 5[label="",style="solid", color="black", weight=3];
5[label="not (esEsChar vz3 vz4)",fontsize=16,color="black",shape="box"];5 -> 6[label="",style="solid", color="black", weight=3];
6[label="not (primEqChar vz3 vz4)",fontsize=16,color="burlywood",shape="box"];66[label="vz3/Char vz30",fontsize=10,color="white",style="solid",shape="box"];6 -> 66[label="",style="solid", color="burlywood", weight=9];
66 -> 7[label="",style="solid", color="burlywood", weight=3];
7[label="not (primEqChar (Char vz30) vz4)",fontsize=16,color="burlywood",shape="box"];67[label="vz4/Char vz40",fontsize=10,color="white",style="solid",shape="box"];7 -> 67[label="",style="solid", color="burlywood", weight=9];
67 -> 8[label="",style="solid", color="burlywood", weight=3];
8[label="not (primEqChar (Char vz30) (Char vz40))",fontsize=16,color="black",shape="box"];8 -> 9[label="",style="solid", color="black", weight=3];
9[label="not (primEqInt vz30 vz40)",fontsize=16,color="burlywood",shape="box"];68[label="vz30/Pos vz300",fontsize=10,color="white",style="solid",shape="box"];9 -> 68[label="",style="solid", color="burlywood", weight=9];
68 -> 10[label="",style="solid", color="burlywood", weight=3];
69[label="vz30/Neg vz300",fontsize=10,color="white",style="solid",shape="box"];9 -> 69[label="",style="solid", color="burlywood", weight=9];
69 -> 11[label="",style="solid", color="burlywood", weight=3];
10[label="not (primEqInt (Pos vz300) vz40)",fontsize=16,color="burlywood",shape="box"];70[label="vz300/Succ vz3000",fontsize=10,color="white",style="solid",shape="box"];10 -> 70[label="",style="solid", color="burlywood", weight=9];
70 -> 12[label="",style="solid", color="burlywood", weight=3];
71[label="vz300/Zero",fontsize=10,color="white",style="solid",shape="box"];10 -> 71[label="",style="solid", color="burlywood", weight=9];
71 -> 13[label="",style="solid", color="burlywood", weight=3];
11[label="not (primEqInt (Neg vz300) vz40)",fontsize=16,color="burlywood",shape="box"];72[label="vz300/Succ vz3000",fontsize=10,color="white",style="solid",shape="box"];11 -> 72[label="",style="solid", color="burlywood", weight=9];
72 -> 14[label="",style="solid", color="burlywood", weight=3];
73[label="vz300/Zero",fontsize=10,color="white",style="solid",shape="box"];11 -> 73[label="",style="solid", color="burlywood", weight=9];
73 -> 15[label="",style="solid", color="burlywood", weight=3];
12[label="not (primEqInt (Pos (Succ vz3000)) vz40)",fontsize=16,color="burlywood",shape="box"];74[label="vz40/Pos vz400",fontsize=10,color="white",style="solid",shape="box"];12 -> 74[label="",style="solid", color="burlywood", weight=9];
74 -> 16[label="",style="solid", color="burlywood", weight=3];
75[label="vz40/Neg vz400",fontsize=10,color="white",style="solid",shape="box"];12 -> 75[label="",style="solid", color="burlywood", weight=9];
75 -> 17[label="",style="solid", color="burlywood", weight=3];
13[label="not (primEqInt (Pos Zero) vz40)",fontsize=16,color="burlywood",shape="box"];76[label="vz40/Pos vz400",fontsize=10,color="white",style="solid",shape="box"];13 -> 76[label="",style="solid", color="burlywood", weight=9];
76 -> 18[label="",style="solid", color="burlywood", weight=3];
77[label="vz40/Neg vz400",fontsize=10,color="white",style="solid",shape="box"];13 -> 77[label="",style="solid", color="burlywood", weight=9];
77 -> 19[label="",style="solid", color="burlywood", weight=3];
14[label="not (primEqInt (Neg (Succ vz3000)) vz40)",fontsize=16,color="burlywood",shape="box"];78[label="vz40/Pos vz400",fontsize=10,color="white",style="solid",shape="box"];14 -> 78[label="",style="solid", color="burlywood", weight=9];
78 -> 20[label="",style="solid", color="burlywood", weight=3];
79[label="vz40/Neg vz400",fontsize=10,color="white",style="solid",shape="box"];14 -> 79[label="",style="solid", color="burlywood", weight=9];
79 -> 21[label="",style="solid", color="burlywood", weight=3];
15[label="not (primEqInt (Neg Zero) vz40)",fontsize=16,color="burlywood",shape="box"];80[label="vz40/Pos vz400",fontsize=10,color="white",style="solid",shape="box"];15 -> 80[label="",style="solid", color="burlywood", weight=9];
80 -> 22[label="",style="solid", color="burlywood", weight=3];
81[label="vz40/Neg vz400",fontsize=10,color="white",style="solid",shape="box"];15 -> 81[label="",style="solid", color="burlywood", weight=9];
81 -> 23[label="",style="solid", color="burlywood", weight=3];
16[label="not (primEqInt (Pos (Succ vz3000)) (Pos vz400))",fontsize=16,color="burlywood",shape="box"];82[label="vz400/Succ vz4000",fontsize=10,color="white",style="solid",shape="box"];16 -> 82[label="",style="solid", color="burlywood", weight=9];
82 -> 24[label="",style="solid", color="burlywood", weight=3];
83[label="vz400/Zero",fontsize=10,color="white",style="solid",shape="box"];16 -> 83[label="",style="solid", color="burlywood", weight=9];
83 -> 25[label="",style="solid", color="burlywood", weight=3];
17[label="not (primEqInt (Pos (Succ vz3000)) (Neg vz400))",fontsize=16,color="black",shape="box"];17 -> 26[label="",style="solid", color="black", weight=3];
18[label="not (primEqInt (Pos Zero) (Pos vz400))",fontsize=16,color="burlywood",shape="box"];84[label="vz400/Succ vz4000",fontsize=10,color="white",style="solid",shape="box"];18 -> 84[label="",style="solid", color="burlywood", weight=9];
84 -> 27[label="",style="solid", color="burlywood", weight=3];
85[label="vz400/Zero",fontsize=10,color="white",style="solid",shape="box"];18 -> 85[label="",style="solid", color="burlywood", weight=9];
85 -> 28[label="",style="solid", color="burlywood", weight=3];
19[label="not (primEqInt (Pos Zero) (Neg vz400))",fontsize=16,color="burlywood",shape="box"];86[label="vz400/Succ vz4000",fontsize=10,color="white",style="solid",shape="box"];19 -> 86[label="",style="solid", color="burlywood", weight=9];
86 -> 29[label="",style="solid", color="burlywood", weight=3];
87[label="vz400/Zero",fontsize=10,color="white",style="solid",shape="box"];19 -> 87[label="",style="solid", color="burlywood", weight=9];
87 -> 30[label="",style="solid", color="burlywood", weight=3];
20[label="not (primEqInt (Neg (Succ vz3000)) (Pos vz400))",fontsize=16,color="black",shape="box"];20 -> 31[label="",style="solid", color="black", weight=3];
21[label="not (primEqInt (Neg (Succ vz3000)) (Neg vz400))",fontsize=16,color="burlywood",shape="box"];88[label="vz400/Succ vz4000",fontsize=10,color="white",style="solid",shape="box"];21 -> 88[label="",style="solid", color="burlywood", weight=9];
88 -> 32[label="",style="solid", color="burlywood", weight=3];
89[label="vz400/Zero",fontsize=10,color="white",style="solid",shape="box"];21 -> 89[label="",style="solid", color="burlywood", weight=9];
89 -> 33[label="",style="solid", color="burlywood", weight=3];
22[label="not (primEqInt (Neg Zero) (Pos vz400))",fontsize=16,color="burlywood",shape="box"];90[label="vz400/Succ vz4000",fontsize=10,color="white",style="solid",shape="box"];22 -> 90[label="",style="solid", color="burlywood", weight=9];
90 -> 34[label="",style="solid", color="burlywood", weight=3];
91[label="vz400/Zero",fontsize=10,color="white",style="solid",shape="box"];22 -> 91[label="",style="solid", color="burlywood", weight=9];
91 -> 35[label="",style="solid", color="burlywood", weight=3];
23[label="not (primEqInt (Neg Zero) (Neg vz400))",fontsize=16,color="burlywood",shape="box"];92[label="vz400/Succ vz4000",fontsize=10,color="white",style="solid",shape="box"];23 -> 92[label="",style="solid", color="burlywood", weight=9];
92 -> 36[label="",style="solid", color="burlywood", weight=3];
93[label="vz400/Zero",fontsize=10,color="white",style="solid",shape="box"];23 -> 93[label="",style="solid", color="burlywood", weight=9];
93 -> 37[label="",style="solid", color="burlywood", weight=3];
24[label="not (primEqInt (Pos (Succ vz3000)) (Pos (Succ vz4000)))",fontsize=16,color="black",shape="box"];24 -> 38[label="",style="solid", color="black", weight=3];
25[label="not (primEqInt (Pos (Succ vz3000)) (Pos Zero))",fontsize=16,color="black",shape="box"];25 -> 39[label="",style="solid", color="black", weight=3];
26[label="not MyFalse",fontsize=16,color="black",shape="triangle"];26 -> 40[label="",style="solid", color="black", weight=3];
27[label="not (primEqInt (Pos Zero) (Pos (Succ vz4000)))",fontsize=16,color="black",shape="box"];27 -> 41[label="",style="solid", color="black", weight=3];
28[label="not (primEqInt (Pos Zero) (Pos Zero))",fontsize=16,color="black",shape="box"];28 -> 42[label="",style="solid", color="black", weight=3];
29[label="not (primEqInt (Pos Zero) (Neg (Succ vz4000)))",fontsize=16,color="black",shape="box"];29 -> 43[label="",style="solid", color="black", weight=3];
30[label="not (primEqInt (Pos Zero) (Neg Zero))",fontsize=16,color="black",shape="box"];30 -> 44[label="",style="solid", color="black", weight=3];
31 -> 26[label="",style="dashed", color="red", weight=0];
31[label="not MyFalse",fontsize=16,color="magenta"];32[label="not (primEqInt (Neg (Succ vz3000)) (Neg (Succ vz4000)))",fontsize=16,color="black",shape="box"];32 -> 45[label="",style="solid", color="black", weight=3];
33[label="not (primEqInt (Neg (Succ vz3000)) (Neg Zero))",fontsize=16,color="black",shape="box"];33 -> 46[label="",style="solid", color="black", weight=3];
34[label="not (primEqInt (Neg Zero) (Pos (Succ vz4000)))",fontsize=16,color="black",shape="box"];34 -> 47[label="",style="solid", color="black", weight=3];
35[label="not (primEqInt (Neg Zero) (Pos Zero))",fontsize=16,color="black",shape="box"];35 -> 48[label="",style="solid", color="black", weight=3];
36[label="not (primEqInt (Neg Zero) (Neg (Succ vz4000)))",fontsize=16,color="black",shape="box"];36 -> 49[label="",style="solid", color="black", weight=3];
37[label="not (primEqInt (Neg Zero) (Neg Zero))",fontsize=16,color="black",shape="box"];37 -> 50[label="",style="solid", color="black", weight=3];
38[label="not (primEqNat vz3000 vz4000)",fontsize=16,color="burlywood",shape="triangle"];94[label="vz3000/Succ vz30000",fontsize=10,color="white",style="solid",shape="box"];38 -> 94[label="",style="solid", color="burlywood", weight=9];
94 -> 51[label="",style="solid", color="burlywood", weight=3];
95[label="vz3000/Zero",fontsize=10,color="white",style="solid",shape="box"];38 -> 95[label="",style="solid", color="burlywood", weight=9];
95 -> 52[label="",style="solid", color="burlywood", weight=3];
39 -> 26[label="",style="dashed", color="red", weight=0];
39[label="not MyFalse",fontsize=16,color="magenta"];40[label="MyTrue",fontsize=16,color="green",shape="box"];41 -> 26[label="",style="dashed", color="red", weight=0];
41[label="not MyFalse",fontsize=16,color="magenta"];42[label="not MyTrue",fontsize=16,color="black",shape="triangle"];42 -> 53[label="",style="solid", color="black", weight=3];
43 -> 26[label="",style="dashed", color="red", weight=0];
43[label="not MyFalse",fontsize=16,color="magenta"];44 -> 42[label="",style="dashed", color="red", weight=0];
44[label="not MyTrue",fontsize=16,color="magenta"];45 -> 38[label="",style="dashed", color="red", weight=0];
45[label="not (primEqNat vz3000 vz4000)",fontsize=16,color="magenta"];45 -> 54[label="",style="dashed", color="magenta", weight=3];
45 -> 55[label="",style="dashed", color="magenta", weight=3];
46 -> 26[label="",style="dashed", color="red", weight=0];
46[label="not MyFalse",fontsize=16,color="magenta"];47 -> 26[label="",style="dashed", color="red", weight=0];
47[label="not MyFalse",fontsize=16,color="magenta"];48 -> 42[label="",style="dashed", color="red", weight=0];
48[label="not MyTrue",fontsize=16,color="magenta"];49 -> 26[label="",style="dashed", color="red", weight=0];
49[label="not MyFalse",fontsize=16,color="magenta"];50 -> 42[label="",style="dashed", color="red", weight=0];
50[label="not MyTrue",fontsize=16,color="magenta"];51[label="not (primEqNat (Succ vz30000) vz4000)",fontsize=16,color="burlywood",shape="box"];96[label="vz4000/Succ vz40000",fontsize=10,color="white",style="solid",shape="box"];51 -> 96[label="",style="solid", color="burlywood", weight=9];
96 -> 56[label="",style="solid", color="burlywood", weight=3];
97[label="vz4000/Zero",fontsize=10,color="white",style="solid",shape="box"];51 -> 97[label="",style="solid", color="burlywood", weight=9];
97 -> 57[label="",style="solid", color="burlywood", weight=3];
52[label="not (primEqNat Zero vz4000)",fontsize=16,color="burlywood",shape="box"];98[label="vz4000/Succ vz40000",fontsize=10,color="white",style="solid",shape="box"];52 -> 98[label="",style="solid", color="burlywood", weight=9];
98 -> 58[label="",style="solid", color="burlywood", weight=3];
99[label="vz4000/Zero",fontsize=10,color="white",style="solid",shape="box"];52 -> 99[label="",style="solid", color="burlywood", weight=9];
99 -> 59[label="",style="solid", color="burlywood", weight=3];
53[label="MyFalse",fontsize=16,color="green",shape="box"];54[label="vz3000",fontsize=16,color="green",shape="box"];55[label="vz4000",fontsize=16,color="green",shape="box"];56[label="not (primEqNat (Succ vz30000) (Succ vz40000))",fontsize=16,color="black",shape="box"];56 -> 60[label="",style="solid", color="black", weight=3];
57[label="not (primEqNat (Succ vz30000) Zero)",fontsize=16,color="black",shape="box"];57 -> 61[label="",style="solid", color="black", weight=3];
58[label="not (primEqNat Zero (Succ vz40000))",fontsize=16,color="black",shape="box"];58 -> 62[label="",style="solid", color="black", weight=3];
59[label="not (primEqNat Zero Zero)",fontsize=16,color="black",shape="box"];59 -> 63[label="",style="solid", color="black", weight=3];
60 -> 38[label="",style="dashed", color="red", weight=0];
60[label="not (primEqNat vz30000 vz40000)",fontsize=16,color="magenta"];60 -> 64[label="",style="dashed", color="magenta", weight=3];
60 -> 65[label="",style="dashed", color="magenta", weight=3];
61 -> 26[label="",style="dashed", color="red", weight=0];
61[label="not MyFalse",fontsize=16,color="magenta"];62 -> 26[label="",style="dashed", color="red", weight=0];
62[label="not MyFalse",fontsize=16,color="magenta"];63 -> 42[label="",style="dashed", color="red", weight=0];
63[label="not MyTrue",fontsize=16,color="magenta"];64[label="vz30000",fontsize=16,color="green",shape="box"];65[label="vz40000",fontsize=16,color="green",shape="box"];}

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

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

   new_not(Main.Succ(vz30000), Main.Succ(vz40000)) -> new_not(vz30000, vz40000)

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

(7) 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_not(Main.Succ(vz30000), Main.Succ(vz40000)) -> new_not(vz30000, vz40000)
The graph contains the following edges 1 > 1, 2 > 2


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

(8)
YES