/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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 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;
}

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

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

(2)
Obligation:
mainModule Main 
module Main where {
import qualified Prelude;
}

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

(3) COR (EQUIVALENT)
Cond Reductions:
The following Function with conditions
"undefined |Falseundefined;
"
is transformed to
"undefined  = undefined1;
"
"undefined0 True = undefined;
"
"undefined1  = undefined0 False;
"
The following Function with conditions
"max x y|x <= yy|otherwisex;
"
is transformed to
"max x y = max2 x y;
"
"max0 x y True = x;
"
"max1 x y True = y;
max1 x y False = max0 x y otherwise;
"
"max2 x y = max1 x y (x <= y);
"

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

(4)
Obligation:
mainModule Main 
module Main where {
import qualified Prelude;
}

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

(5) Narrow (SOUND)
Haskell To QDPs

digraph dp_graph {
node [outthreshold=100, inthreshold=100];1[label="max",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
3[label="max vx3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3];
4[label="max vx3 vx4",fontsize=16,color="black",shape="triangle"];4 -> 5[label="",style="solid", color="black", weight=3];
5[label="max2 vx3 vx4",fontsize=16,color="black",shape="box"];5 -> 6[label="",style="solid", color="black", weight=3];
6[label="max1 vx3 vx4 (vx3 <= vx4)",fontsize=16,color="black",shape="box"];6 -> 7[label="",style="solid", color="black", weight=3];
7[label="max1 vx3 vx4 (compare vx3 vx4 /= GT)",fontsize=16,color="black",shape="box"];7 -> 8[label="",style="solid", color="black", weight=3];
8[label="max1 vx3 vx4 (not (compare vx3 vx4 == GT))",fontsize=16,color="black",shape="box"];8 -> 9[label="",style="solid", color="black", weight=3];
9[label="max1 vx3 vx4 (not (primCmpChar vx3 vx4 == GT))",fontsize=16,color="burlywood",shape="box"];302[label="vx3/Char vx30",fontsize=10,color="white",style="solid",shape="box"];9 -> 302[label="",style="solid", color="burlywood", weight=9];
302 -> 10[label="",style="solid", color="burlywood", weight=3];
10[label="max1 (Char vx30) vx4 (not (primCmpChar (Char vx30) vx4 == GT))",fontsize=16,color="burlywood",shape="box"];303[label="vx4/Char vx40",fontsize=10,color="white",style="solid",shape="box"];10 -> 303[label="",style="solid", color="burlywood", weight=9];
303 -> 11[label="",style="solid", color="burlywood", weight=3];
11[label="max1 (Char vx30) (Char vx40) (not (primCmpChar (Char vx30) (Char vx40) == GT))",fontsize=16,color="black",shape="box"];11 -> 12[label="",style="solid", color="black", weight=3];
12[label="max1 (Char vx30) (Char vx40) (not (primCmpNat vx30 vx40 == GT))",fontsize=16,color="burlywood",shape="box"];304[label="vx30/Succ vx300",fontsize=10,color="white",style="solid",shape="box"];12 -> 304[label="",style="solid", color="burlywood", weight=9];
304 -> 13[label="",style="solid", color="burlywood", weight=3];
305[label="vx30/Zero",fontsize=10,color="white",style="solid",shape="box"];12 -> 305[label="",style="solid", color="burlywood", weight=9];
305 -> 14[label="",style="solid", color="burlywood", weight=3];
13[label="max1 (Char (Succ vx300)) (Char vx40) (not (primCmpNat (Succ vx300) vx40 == GT))",fontsize=16,color="burlywood",shape="box"];306[label="vx40/Succ vx400",fontsize=10,color="white",style="solid",shape="box"];13 -> 306[label="",style="solid", color="burlywood", weight=9];
306 -> 15[label="",style="solid", color="burlywood", weight=3];
307[label="vx40/Zero",fontsize=10,color="white",style="solid",shape="box"];13 -> 307[label="",style="solid", color="burlywood", weight=9];
307 -> 16[label="",style="solid", color="burlywood", weight=3];
14[label="max1 (Char Zero) (Char vx40) (not (primCmpNat Zero vx40 == GT))",fontsize=16,color="burlywood",shape="box"];308[label="vx40/Succ vx400",fontsize=10,color="white",style="solid",shape="box"];14 -> 308[label="",style="solid", color="burlywood", weight=9];
308 -> 17[label="",style="solid", color="burlywood", weight=3];
309[label="vx40/Zero",fontsize=10,color="white",style="solid",shape="box"];14 -> 309[label="",style="solid", color="burlywood", weight=9];
309 -> 18[label="",style="solid", color="burlywood", weight=3];
15[label="max1 (Char (Succ vx300)) (Char (Succ vx400)) (not (primCmpNat (Succ vx300) (Succ vx400) == GT))",fontsize=16,color="black",shape="box"];15 -> 19[label="",style="solid", color="black", weight=3];
16[label="max1 (Char (Succ vx300)) (Char Zero) (not (primCmpNat (Succ vx300) Zero == GT))",fontsize=16,color="black",shape="box"];16 -> 20[label="",style="solid", color="black", weight=3];
17[label="max1 (Char Zero) (Char (Succ vx400)) (not (primCmpNat Zero (Succ vx400) == GT))",fontsize=16,color="black",shape="box"];17 -> 21[label="",style="solid", color="black", weight=3];
18[label="max1 (Char Zero) (Char Zero) (not (primCmpNat Zero Zero == GT))",fontsize=16,color="black",shape="box"];18 -> 22[label="",style="solid", color="black", weight=3];
19 -> 240[label="",style="dashed", color="red", weight=0];
19[label="max1 (Char (Succ vx300)) (Char (Succ vx400)) (not (primCmpNat vx300 vx400 == GT))",fontsize=16,color="magenta"];19 -> 241[label="",style="dashed", color="magenta", weight=3];
19 -> 242[label="",style="dashed", color="magenta", weight=3];
19 -> 243[label="",style="dashed", color="magenta", weight=3];
19 -> 244[label="",style="dashed", color="magenta", weight=3];
20[label="max1 (Char (Succ vx300)) (Char Zero) (not (GT == GT))",fontsize=16,color="black",shape="box"];20 -> 25[label="",style="solid", color="black", weight=3];
21[label="max1 (Char Zero) (Char (Succ vx400)) (not (LT == GT))",fontsize=16,color="black",shape="box"];21 -> 26[label="",style="solid", color="black", weight=3];
22[label="max1 (Char Zero) (Char Zero) (not (EQ == GT))",fontsize=16,color="black",shape="box"];22 -> 27[label="",style="solid", color="black", weight=3];
241[label="vx300",fontsize=16,color="green",shape="box"];242[label="vx400",fontsize=16,color="green",shape="box"];243[label="vx300",fontsize=16,color="green",shape="box"];244[label="vx400",fontsize=16,color="green",shape="box"];240[label="max1 (Char (Succ vx27)) (Char (Succ vx28)) (not (primCmpNat vx29 vx30 == GT))",fontsize=16,color="burlywood",shape="triangle"];310[label="vx29/Succ vx290",fontsize=10,color="white",style="solid",shape="box"];240 -> 310[label="",style="solid", color="burlywood", weight=9];
310 -> 281[label="",style="solid", color="burlywood", weight=3];
311[label="vx29/Zero",fontsize=10,color="white",style="solid",shape="box"];240 -> 311[label="",style="solid", color="burlywood", weight=9];
311 -> 282[label="",style="solid", color="burlywood", weight=3];
25[label="max1 (Char (Succ vx300)) (Char Zero) (not True)",fontsize=16,color="black",shape="box"];25 -> 32[label="",style="solid", color="black", weight=3];
26[label="max1 (Char Zero) (Char (Succ vx400)) (not False)",fontsize=16,color="black",shape="box"];26 -> 33[label="",style="solid", color="black", weight=3];
27[label="max1 (Char Zero) (Char Zero) (not False)",fontsize=16,color="black",shape="box"];27 -> 34[label="",style="solid", color="black", weight=3];
281[label="max1 (Char (Succ vx27)) (Char (Succ vx28)) (not (primCmpNat (Succ vx290) vx30 == GT))",fontsize=16,color="burlywood",shape="box"];312[label="vx30/Succ vx300",fontsize=10,color="white",style="solid",shape="box"];281 -> 312[label="",style="solid", color="burlywood", weight=9];
312 -> 283[label="",style="solid", color="burlywood", weight=3];
313[label="vx30/Zero",fontsize=10,color="white",style="solid",shape="box"];281 -> 313[label="",style="solid", color="burlywood", weight=9];
313 -> 284[label="",style="solid", color="burlywood", weight=3];
282[label="max1 (Char (Succ vx27)) (Char (Succ vx28)) (not (primCmpNat Zero vx30 == GT))",fontsize=16,color="burlywood",shape="box"];314[label="vx30/Succ vx300",fontsize=10,color="white",style="solid",shape="box"];282 -> 314[label="",style="solid", color="burlywood", weight=9];
314 -> 285[label="",style="solid", color="burlywood", weight=3];
315[label="vx30/Zero",fontsize=10,color="white",style="solid",shape="box"];282 -> 315[label="",style="solid", color="burlywood", weight=9];
315 -> 286[label="",style="solid", color="burlywood", weight=3];
32[label="max1 (Char (Succ vx300)) (Char Zero) False",fontsize=16,color="black",shape="box"];32 -> 39[label="",style="solid", color="black", weight=3];
33[label="max1 (Char Zero) (Char (Succ vx400)) True",fontsize=16,color="black",shape="box"];33 -> 40[label="",style="solid", color="black", weight=3];
34[label="max1 (Char Zero) (Char Zero) True",fontsize=16,color="black",shape="box"];34 -> 41[label="",style="solid", color="black", weight=3];
283[label="max1 (Char (Succ vx27)) (Char (Succ vx28)) (not (primCmpNat (Succ vx290) (Succ vx300) == GT))",fontsize=16,color="black",shape="box"];283 -> 287[label="",style="solid", color="black", weight=3];
284[label="max1 (Char (Succ vx27)) (Char (Succ vx28)) (not (primCmpNat (Succ vx290) Zero == GT))",fontsize=16,color="black",shape="box"];284 -> 288[label="",style="solid", color="black", weight=3];
285[label="max1 (Char (Succ vx27)) (Char (Succ vx28)) (not (primCmpNat Zero (Succ vx300) == GT))",fontsize=16,color="black",shape="box"];285 -> 289[label="",style="solid", color="black", weight=3];
286[label="max1 (Char (Succ vx27)) (Char (Succ vx28)) (not (primCmpNat Zero Zero == GT))",fontsize=16,color="black",shape="box"];286 -> 290[label="",style="solid", color="black", weight=3];
39[label="max0 (Char (Succ vx300)) (Char Zero) otherwise",fontsize=16,color="black",shape="box"];39 -> 47[label="",style="solid", color="black", weight=3];
40[label="Char (Succ vx400)",fontsize=16,color="green",shape="box"];41[label="Char Zero",fontsize=16,color="green",shape="box"];287 -> 240[label="",style="dashed", color="red", weight=0];
287[label="max1 (Char (Succ vx27)) (Char (Succ vx28)) (not (primCmpNat vx290 vx300 == GT))",fontsize=16,color="magenta"];287 -> 291[label="",style="dashed", color="magenta", weight=3];
287 -> 292[label="",style="dashed", color="magenta", weight=3];
288[label="max1 (Char (Succ vx27)) (Char (Succ vx28)) (not (GT == GT))",fontsize=16,color="black",shape="box"];288 -> 293[label="",style="solid", color="black", weight=3];
289[label="max1 (Char (Succ vx27)) (Char (Succ vx28)) (not (LT == GT))",fontsize=16,color="black",shape="box"];289 -> 294[label="",style="solid", color="black", weight=3];
290[label="max1 (Char (Succ vx27)) (Char (Succ vx28)) (not (EQ == GT))",fontsize=16,color="black",shape="box"];290 -> 295[label="",style="solid", color="black", weight=3];
47[label="max0 (Char (Succ vx300)) (Char Zero) True",fontsize=16,color="black",shape="box"];47 -> 55[label="",style="solid", color="black", weight=3];
291[label="vx290",fontsize=16,color="green",shape="box"];292[label="vx300",fontsize=16,color="green",shape="box"];293[label="max1 (Char (Succ vx27)) (Char (Succ vx28)) (not True)",fontsize=16,color="black",shape="box"];293 -> 296[label="",style="solid", color="black", weight=3];
294[label="max1 (Char (Succ vx27)) (Char (Succ vx28)) (not False)",fontsize=16,color="black",shape="triangle"];294 -> 297[label="",style="solid", color="black", weight=3];
295 -> 294[label="",style="dashed", color="red", weight=0];
295[label="max1 (Char (Succ vx27)) (Char (Succ vx28)) (not False)",fontsize=16,color="magenta"];55[label="Char (Succ vx300)",fontsize=16,color="green",shape="box"];296[label="max1 (Char (Succ vx27)) (Char (Succ vx28)) False",fontsize=16,color="black",shape="box"];296 -> 298[label="",style="solid", color="black", weight=3];
297[label="max1 (Char (Succ vx27)) (Char (Succ vx28)) True",fontsize=16,color="black",shape="box"];297 -> 299[label="",style="solid", color="black", weight=3];
298[label="max0 (Char (Succ vx27)) (Char (Succ vx28)) otherwise",fontsize=16,color="black",shape="box"];298 -> 300[label="",style="solid", color="black", weight=3];
299[label="Char (Succ vx28)",fontsize=16,color="green",shape="box"];300[label="max0 (Char (Succ vx27)) (Char (Succ vx28)) True",fontsize=16,color="black",shape="box"];300 -> 301[label="",style="solid", color="black", weight=3];
301[label="Char (Succ vx27)",fontsize=16,color="green",shape="box"];}

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

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

   new_max1(vx27, vx28, Succ(vx290), Succ(vx300)) -> new_max1(vx27, vx28, vx290, vx300)

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_max1(vx27, vx28, Succ(vx290), Succ(vx300)) -> new_max1(vx27, vx28, vx290, vx300)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3, 4 > 4


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

(8)
YES