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


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


YES
proof of /export/starexec/sandbox2/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 [EQUIVALENT, 9 ms]
(6) 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
"compare x y|x == yEQ|x <= yLT|otherwiseGT;
"
is transformed to
"compare x y = compare3 x y;
"
"compare1 x y True = LT;
compare1 x y False = compare0 x y otherwise;
"
"compare0 x y True = GT;
"
"compare2 x y True = EQ;
compare2 x y False = compare1 x y (x <= y);
"
"compare3 x y = compare2 x y (x == y);
"
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;
}

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

(5) Narrow (EQUIVALENT)
Haskell To QDPs

digraph dp_graph {
node [outthreshold=100, inthreshold=100];1[label="compare",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
3[label="compare vx3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3];
4[label="compare vx3 vx4",fontsize=16,color="black",shape="triangle"];4 -> 5[label="",style="solid", color="black", weight=3];
5[label="compare3 vx3 vx4",fontsize=16,color="black",shape="box"];5 -> 6[label="",style="solid", color="black", weight=3];
6[label="compare2 vx3 vx4 (vx3 == vx4)",fontsize=16,color="burlywood",shape="box"];27[label="vx3/False",fontsize=10,color="white",style="solid",shape="box"];6 -> 27[label="",style="solid", color="burlywood", weight=9];
27 -> 7[label="",style="solid", color="burlywood", weight=3];
28[label="vx3/True",fontsize=10,color="white",style="solid",shape="box"];6 -> 28[label="",style="solid", color="burlywood", weight=9];
28 -> 8[label="",style="solid", color="burlywood", weight=3];
7[label="compare2 False vx4 (False == vx4)",fontsize=16,color="burlywood",shape="box"];29[label="vx4/False",fontsize=10,color="white",style="solid",shape="box"];7 -> 29[label="",style="solid", color="burlywood", weight=9];
29 -> 9[label="",style="solid", color="burlywood", weight=3];
30[label="vx4/True",fontsize=10,color="white",style="solid",shape="box"];7 -> 30[label="",style="solid", color="burlywood", weight=9];
30 -> 10[label="",style="solid", color="burlywood", weight=3];
8[label="compare2 True vx4 (True == vx4)",fontsize=16,color="burlywood",shape="box"];31[label="vx4/False",fontsize=10,color="white",style="solid",shape="box"];8 -> 31[label="",style="solid", color="burlywood", weight=9];
31 -> 11[label="",style="solid", color="burlywood", weight=3];
32[label="vx4/True",fontsize=10,color="white",style="solid",shape="box"];8 -> 32[label="",style="solid", color="burlywood", weight=9];
32 -> 12[label="",style="solid", color="burlywood", weight=3];
9[label="compare2 False False (False == False)",fontsize=16,color="black",shape="box"];9 -> 13[label="",style="solid", color="black", weight=3];
10[label="compare2 False True (False == True)",fontsize=16,color="black",shape="box"];10 -> 14[label="",style="solid", color="black", weight=3];
11[label="compare2 True False (True == False)",fontsize=16,color="black",shape="box"];11 -> 15[label="",style="solid", color="black", weight=3];
12[label="compare2 True True (True == True)",fontsize=16,color="black",shape="box"];12 -> 16[label="",style="solid", color="black", weight=3];
13[label="compare2 False False True",fontsize=16,color="black",shape="box"];13 -> 17[label="",style="solid", color="black", weight=3];
14[label="compare2 False True False",fontsize=16,color="black",shape="box"];14 -> 18[label="",style="solid", color="black", weight=3];
15[label="compare2 True False False",fontsize=16,color="black",shape="box"];15 -> 19[label="",style="solid", color="black", weight=3];
16[label="compare2 True True True",fontsize=16,color="black",shape="box"];16 -> 20[label="",style="solid", color="black", weight=3];
17[label="EQ",fontsize=16,color="green",shape="box"];18[label="compare1 False True (False <= True)",fontsize=16,color="black",shape="box"];18 -> 21[label="",style="solid", color="black", weight=3];
19[label="compare1 True False (True <= False)",fontsize=16,color="black",shape="box"];19 -> 22[label="",style="solid", color="black", weight=3];
20[label="EQ",fontsize=16,color="green",shape="box"];21[label="compare1 False True True",fontsize=16,color="black",shape="box"];21 -> 23[label="",style="solid", color="black", weight=3];
22[label="compare1 True False False",fontsize=16,color="black",shape="box"];22 -> 24[label="",style="solid", color="black", weight=3];
23[label="LT",fontsize=16,color="green",shape="box"];24[label="compare0 True False otherwise",fontsize=16,color="black",shape="box"];24 -> 25[label="",style="solid", color="black", weight=3];
25[label="compare0 True False True",fontsize=16,color="black",shape="box"];25 -> 26[label="",style="solid", color="black", weight=3];
26[label="GT",fontsize=16,color="green",shape="box"];}

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

(6)
YES