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


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

(0)
Obligation:
mainModule Main 
module FiniteMap where {
import qualified Main;
import qualified Maybe;
import qualified Prelude;
data FiniteMap a b = EmptyFM  | Branch a b Int (FiniteMap a b) (FiniteMap a b) ;

emptyFM :: FiniteMap b a;
emptyFM = EmptyFM;

mapFM :: (a  ->  c  ->  b)  ->  FiniteMap a c  ->  FiniteMap a b;
mapFM f EmptyFM = emptyFM;
mapFM f (Branch key elt size fm_l fm_r) = Branch key (f key elt) size (mapFM f fm_l) (mapFM f fm_r);

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

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

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

(2)
Obligation:
mainModule Main 
module FiniteMap where {
import qualified Main;
import qualified Maybe;
import qualified Prelude;
data FiniteMap b a = EmptyFM  | Branch b a Int (FiniteMap b a) (FiniteMap b a) ;

emptyFM :: FiniteMap a b;
emptyFM = EmptyFM;

mapFM :: (b  ->  a  ->  c)  ->  FiniteMap b a  ->  FiniteMap b c;
mapFM f EmptyFM = emptyFM;
mapFM f (Branch key elt size fm_l fm_r) = Branch key (f key elt) size (mapFM f fm_l) (mapFM f fm_r);

}
module Maybe where {
import qualified FiniteMap;
import qualified Main;
import qualified Prelude;
}
module Main where {
import qualified FiniteMap;
import qualified Maybe;
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;
"

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

(4)
Obligation:
mainModule Main 
module FiniteMap where {
import qualified Main;
import qualified Maybe;
import qualified Prelude;
data FiniteMap b a = EmptyFM  | Branch b a Int (FiniteMap b a) (FiniteMap b a) ;

emptyFM :: FiniteMap b a;
emptyFM = EmptyFM;

mapFM :: (c  ->  a  ->  b)  ->  FiniteMap c a  ->  FiniteMap c b;
mapFM f EmptyFM = emptyFM;
mapFM f (Branch key elt size fm_l fm_r) = Branch key (f key elt) size (mapFM f fm_l) (mapFM f fm_r);

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

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

(5) Narrow (SOUND)
Haskell To QDPs

digraph dp_graph {
node [outthreshold=100, inthreshold=100];1[label="FiniteMap.mapFM",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
3[label="FiniteMap.mapFM vy3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3];
4[label="FiniteMap.mapFM vy3 vy4",fontsize=16,color="burlywood",shape="triangle"];17[label="vy4/FiniteMap.EmptyFM",fontsize=10,color="white",style="solid",shape="box"];4 -> 17[label="",style="solid", color="burlywood", weight=9];
17 -> 5[label="",style="solid", color="burlywood", weight=3];
18[label="vy4/FiniteMap.Branch vy40 vy41 vy42 vy43 vy44",fontsize=10,color="white",style="solid",shape="box"];4 -> 18[label="",style="solid", color="burlywood", weight=9];
18 -> 6[label="",style="solid", color="burlywood", weight=3];
5[label="FiniteMap.mapFM vy3 FiniteMap.EmptyFM",fontsize=16,color="black",shape="box"];5 -> 7[label="",style="solid", color="black", weight=3];
6[label="FiniteMap.mapFM vy3 (FiniteMap.Branch vy40 vy41 vy42 vy43 vy44)",fontsize=16,color="black",shape="box"];6 -> 8[label="",style="solid", color="black", weight=3];
7[label="FiniteMap.emptyFM",fontsize=16,color="black",shape="box"];7 -> 9[label="",style="solid", color="black", weight=3];
8[label="FiniteMap.Branch vy40 (vy3 vy40 vy41) vy42 (FiniteMap.mapFM vy3 vy43) (FiniteMap.mapFM vy3 vy44)",fontsize=16,color="green",shape="box"];8 -> 10[label="",style="dashed", color="green", weight=3];
8 -> 11[label="",style="dashed", color="green", weight=3];
8 -> 12[label="",style="dashed", color="green", weight=3];
9[label="FiniteMap.EmptyFM",fontsize=16,color="green",shape="box"];10[label="vy3 vy40 vy41",fontsize=16,color="green",shape="box"];10 -> 13[label="",style="dashed", color="green", weight=3];
10 -> 14[label="",style="dashed", color="green", weight=3];
11 -> 4[label="",style="dashed", color="red", weight=0];
11[label="FiniteMap.mapFM vy3 vy43",fontsize=16,color="magenta"];11 -> 15[label="",style="dashed", color="magenta", weight=3];
12 -> 4[label="",style="dashed", color="red", weight=0];
12[label="FiniteMap.mapFM vy3 vy44",fontsize=16,color="magenta"];12 -> 16[label="",style="dashed", color="magenta", weight=3];
13[label="vy40",fontsize=16,color="green",shape="box"];14[label="vy41",fontsize=16,color="green",shape="box"];15[label="vy43",fontsize=16,color="green",shape="box"];16[label="vy44",fontsize=16,color="green",shape="box"];}

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

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

   new_mapFM(vy3, Branch(vy40, vy41, vy42, vy43, vy44), h, ba, bb) -> new_mapFM(vy3, vy44, h, ba, bb)
   new_mapFM(vy3, Branch(vy40, vy41, vy42, vy43, vy44), h, ba, bb) -> new_mapFM(vy3, vy43, h, ba, bb)

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_mapFM(vy3, Branch(vy40, vy41, vy42, vy43, vy44), h, ba, bb) -> new_mapFM(vy3, vy44, h, ba, bb)
The graph contains the following edges 1 >= 1, 2 > 2, 3 >= 3, 4 >= 4, 5 >= 5


*new_mapFM(vy3, Branch(vy40, vy41, vy42, vy43, vy44), h, ba, bb) -> new_mapFM(vy3, vy43, h, ba, bb)
The graph contains the following edges 1 >= 1, 2 > 2, 3 >= 3, 4 >= 4, 5 >= 5


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

(8)
YES