/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) CR [EQUIVALENT, 0 ms]
(2) HASKELL
(3) BR [EQUIVALENT, 0 ms]
(4) HASKELL
(5) COR [EQUIVALENT, 24 ms]
(6) HASKELL
(7) Narrow [SOUND, 0 ms]
(8) QDP
(9) QDPSizeChangeProof [EQUIVALENT, 0 ms]
(10) YES


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

(0)
Obligation:
mainModule Main 
module Maybe where {
import qualified List;
import qualified Main;
import qualified Prelude;
}
module List where {
import qualified Main;
import qualified Maybe;
import qualified Prelude;
insert :: Ord a => a  ->  [a]  ->  [a];
insert e ls = insertBy compare e ls;

insertBy :: (a  ->  a  ->  Ordering)  ->  a  ->  [a]  ->  [a];
insertBy _ x [] = x : [];
insertBy cmp x ys@(y : ys') = case cmp x y of { 
GT-> y : insertBy cmp x ys'; 
_-> x : ys; 
 } ;

}
module Main where {
import qualified List;
import qualified Maybe;
import qualified Prelude;
}

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

(1) CR (EQUIVALENT)
Case Reductions:
The following Case expression
"case cmp x y of {
GT  -> y : insertBy cmp x ys';
_  -> x : ys}
"
is transformed to
"insertBy0 y cmp x ys' ys GT = y : insertBy cmp x ys';
insertBy0 y cmp x ys' ys _ = x : ys;
"

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

(2)
Obligation:
mainModule Main 
module Maybe where {
import qualified List;
import qualified Main;
import qualified Prelude;
}
module List where {
import qualified Main;
import qualified Maybe;
import qualified Prelude;
insert :: Ord a => a  ->  [a]  ->  [a];
insert e ls = insertBy compare e ls;

insertBy :: (a  ->  a  ->  Ordering)  ->  a  ->  [a]  ->  [a];
insertBy _ x [] = x : [];
insertBy cmp x ys@(y : ys') = insertBy0 y cmp x ys' ys (cmp x y);

insertBy0 y cmp x ys' ys GT = y : insertBy cmp x ys';
insertBy0 y cmp x ys' ys _ = x : ys;

}
module Main where {
import qualified List;
import qualified Maybe;
import qualified Prelude;
}

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

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

Binding Reductions:
The bind variable of the following binding Pattern
"ys@(wu : wv)"
is replaced by the following term
"wu : wv"

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

(4)
Obligation:
mainModule Main 
module Maybe where {
import qualified List;
import qualified Main;
import qualified Prelude;
}
module List where {
import qualified Main;
import qualified Maybe;
import qualified Prelude;
insert :: Ord a => a  ->  [a]  ->  [a];
insert e ls = insertBy compare e ls;

insertBy :: (a  ->  a  ->  Ordering)  ->  a  ->  [a]  ->  [a];
insertBy vz x [] = x : [];
insertBy cmp x (wu : wv) = insertBy0 wu cmp x wv (wu : wv) (cmp x wu);

insertBy0 y cmp x ys' ys GT = y : insertBy cmp x ys';
insertBy0 y cmp x ys' ys vy = x : ys;

}
module Main where {
import qualified List;
import qualified Maybe;
import qualified Prelude;
}

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

(5) 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;
"
"compare2 x y True = EQ;
compare2 x y False = compare1 x y (x <= y);
"
"compare0 x y True = GT;
"
"compare1 x y True = LT;
compare1 x y False = compare0 x y otherwise;
"
"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;
"

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

(6)
Obligation:
mainModule Main 
module Maybe where {
import qualified List;
import qualified Main;
import qualified Prelude;
}
module List where {
import qualified Main;
import qualified Maybe;
import qualified Prelude;
insert :: Ord a => a  ->  [a]  ->  [a];
insert e ls = insertBy compare e ls;

insertBy :: (a  ->  a  ->  Ordering)  ->  a  ->  [a]  ->  [a];
insertBy vz x [] = x : [];
insertBy cmp x (wu : wv) = insertBy0 wu cmp x wv (wu : wv) (cmp x wu);

insertBy0 y cmp x ys' ys GT = y : insertBy cmp x ys';
insertBy0 y cmp x ys' ys vy = x : ys;

}
module Main where {
import qualified List;
import qualified Maybe;
import qualified Prelude;
}

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

(7) Narrow (SOUND)
Haskell To QDPs

digraph dp_graph {
node [outthreshold=100, inthreshold=100];1[label="List.insert",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
3[label="List.insert ww3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3];
4[label="List.insert ww3 ww4",fontsize=16,color="black",shape="triangle"];4 -> 5[label="",style="solid", color="black", weight=3];
5[label="List.insertBy compare ww3 ww4",fontsize=16,color="burlywood",shape="triangle"];39[label="ww4/ww40 : ww41",fontsize=10,color="white",style="solid",shape="box"];5 -> 39[label="",style="solid", color="burlywood", weight=9];
39 -> 6[label="",style="solid", color="burlywood", weight=3];
40[label="ww4/[]",fontsize=10,color="white",style="solid",shape="box"];5 -> 40[label="",style="solid", color="burlywood", weight=9];
40 -> 7[label="",style="solid", color="burlywood", weight=3];
6[label="List.insertBy compare ww3 (ww40 : ww41)",fontsize=16,color="black",shape="box"];6 -> 8[label="",style="solid", color="black", weight=3];
7[label="List.insertBy compare ww3 []",fontsize=16,color="black",shape="box"];7 -> 9[label="",style="solid", color="black", weight=3];
8[label="List.insertBy0 ww40 compare ww3 ww41 (ww40 : ww41) (compare ww3 ww40)",fontsize=16,color="black",shape="box"];8 -> 10[label="",style="solid", color="black", weight=3];
9[label="ww3 : []",fontsize=16,color="green",shape="box"];10[label="List.insertBy0 ww40 compare ww3 ww41 (ww40 : ww41) (compare3 ww3 ww40)",fontsize=16,color="black",shape="box"];10 -> 11[label="",style="solid", color="black", weight=3];
11[label="List.insertBy0 ww40 compare ww3 ww41 (ww40 : ww41) (compare2 ww3 ww40 (ww3 == ww40))",fontsize=16,color="burlywood",shape="box"];41[label="ww3/False",fontsize=10,color="white",style="solid",shape="box"];11 -> 41[label="",style="solid", color="burlywood", weight=9];
41 -> 12[label="",style="solid", color="burlywood", weight=3];
42[label="ww3/True",fontsize=10,color="white",style="solid",shape="box"];11 -> 42[label="",style="solid", color="burlywood", weight=9];
42 -> 13[label="",style="solid", color="burlywood", weight=3];
12[label="List.insertBy0 ww40 compare False ww41 (ww40 : ww41) (compare2 False ww40 (False == ww40))",fontsize=16,color="burlywood",shape="box"];43[label="ww40/False",fontsize=10,color="white",style="solid",shape="box"];12 -> 43[label="",style="solid", color="burlywood", weight=9];
43 -> 14[label="",style="solid", color="burlywood", weight=3];
44[label="ww40/True",fontsize=10,color="white",style="solid",shape="box"];12 -> 44[label="",style="solid", color="burlywood", weight=9];
44 -> 15[label="",style="solid", color="burlywood", weight=3];
13[label="List.insertBy0 ww40 compare True ww41 (ww40 : ww41) (compare2 True ww40 (True == ww40))",fontsize=16,color="burlywood",shape="box"];45[label="ww40/False",fontsize=10,color="white",style="solid",shape="box"];13 -> 45[label="",style="solid", color="burlywood", weight=9];
45 -> 16[label="",style="solid", color="burlywood", weight=3];
46[label="ww40/True",fontsize=10,color="white",style="solid",shape="box"];13 -> 46[label="",style="solid", color="burlywood", weight=9];
46 -> 17[label="",style="solid", color="burlywood", weight=3];
14[label="List.insertBy0 False compare False ww41 (False : ww41) (compare2 False False (False == False))",fontsize=16,color="black",shape="box"];14 -> 18[label="",style="solid", color="black", weight=3];
15[label="List.insertBy0 True compare False ww41 (True : ww41) (compare2 False True (False == True))",fontsize=16,color="black",shape="box"];15 -> 19[label="",style="solid", color="black", weight=3];
16[label="List.insertBy0 False compare True ww41 (False : ww41) (compare2 True False (True == False))",fontsize=16,color="black",shape="box"];16 -> 20[label="",style="solid", color="black", weight=3];
17[label="List.insertBy0 True compare True ww41 (True : ww41) (compare2 True True (True == True))",fontsize=16,color="black",shape="box"];17 -> 21[label="",style="solid", color="black", weight=3];
18[label="List.insertBy0 False compare False ww41 (False : ww41) (compare2 False False True)",fontsize=16,color="black",shape="box"];18 -> 22[label="",style="solid", color="black", weight=3];
19[label="List.insertBy0 True compare False ww41 (True : ww41) (compare2 False True False)",fontsize=16,color="black",shape="box"];19 -> 23[label="",style="solid", color="black", weight=3];
20[label="List.insertBy0 False compare True ww41 (False : ww41) (compare2 True False False)",fontsize=16,color="black",shape="box"];20 -> 24[label="",style="solid", color="black", weight=3];
21[label="List.insertBy0 True compare True ww41 (True : ww41) (compare2 True True True)",fontsize=16,color="black",shape="box"];21 -> 25[label="",style="solid", color="black", weight=3];
22[label="List.insertBy0 False compare False ww41 (False : ww41) EQ",fontsize=16,color="black",shape="box"];22 -> 26[label="",style="solid", color="black", weight=3];
23[label="List.insertBy0 True compare False ww41 (True : ww41) (compare1 False True (False <= True))",fontsize=16,color="black",shape="box"];23 -> 27[label="",style="solid", color="black", weight=3];
24[label="List.insertBy0 False compare True ww41 (False : ww41) (compare1 True False (True <= False))",fontsize=16,color="black",shape="box"];24 -> 28[label="",style="solid", color="black", weight=3];
25[label="List.insertBy0 True compare True ww41 (True : ww41) EQ",fontsize=16,color="black",shape="box"];25 -> 29[label="",style="solid", color="black", weight=3];
26[label="False : False : ww41",fontsize=16,color="green",shape="box"];27[label="List.insertBy0 True compare False ww41 (True : ww41) (compare1 False True True)",fontsize=16,color="black",shape="box"];27 -> 30[label="",style="solid", color="black", weight=3];
28[label="List.insertBy0 False compare True ww41 (False : ww41) (compare1 True False False)",fontsize=16,color="black",shape="box"];28 -> 31[label="",style="solid", color="black", weight=3];
29[label="True : True : ww41",fontsize=16,color="green",shape="box"];30[label="List.insertBy0 True compare False ww41 (True : ww41) LT",fontsize=16,color="black",shape="box"];30 -> 32[label="",style="solid", color="black", weight=3];
31[label="List.insertBy0 False compare True ww41 (False : ww41) (compare0 True False otherwise)",fontsize=16,color="black",shape="box"];31 -> 33[label="",style="solid", color="black", weight=3];
32[label="False : True : ww41",fontsize=16,color="green",shape="box"];33[label="List.insertBy0 False compare True ww41 (False : ww41) (compare0 True False True)",fontsize=16,color="black",shape="box"];33 -> 34[label="",style="solid", color="black", weight=3];
34[label="List.insertBy0 False compare True ww41 (False : ww41) GT",fontsize=16,color="black",shape="box"];34 -> 35[label="",style="solid", color="black", weight=3];
35[label="False : List.insertBy compare True ww41",fontsize=16,color="green",shape="box"];35 -> 36[label="",style="dashed", color="green", weight=3];
36 -> 5[label="",style="dashed", color="red", weight=0];
36[label="List.insertBy compare True ww41",fontsize=16,color="magenta"];36 -> 37[label="",style="dashed", color="magenta", weight=3];
36 -> 38[label="",style="dashed", color="magenta", weight=3];
37[label="ww41",fontsize=16,color="green",shape="box"];38[label="True",fontsize=16,color="green",shape="box"];}

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

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

   new_insertBy(True, :(False, ww41)) -> new_insertBy(True, ww41)

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

(9) 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_insertBy(True, :(False, ww41)) -> new_insertBy(True, ww41)
The graph contains the following edges 1 >= 1, 2 > 2


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

(10)
YES