7.51/3.47 YES 9.10/3.91 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 9.10/3.91 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 9.10/3.91 9.10/3.91 9.10/3.91 H-Termination with start terms of the given HASKELL could be proven: 9.10/3.91 9.10/3.91 (0) HASKELL 9.10/3.91 (1) BR [EQUIVALENT, 0 ms] 9.10/3.91 (2) HASKELL 9.10/3.91 (3) COR [EQUIVALENT, 0 ms] 9.10/3.91 (4) HASKELL 9.10/3.91 (5) Narrow [EQUIVALENT, 0 ms] 9.10/3.91 (6) YES 9.10/3.91 9.10/3.91 9.10/3.91 ---------------------------------------- 9.10/3.91 9.10/3.91 (0) 9.10/3.91 Obligation: 9.10/3.91 mainModule Main 9.10/3.91 module Main where { 9.10/3.91 import qualified Prelude; 9.10/3.91 data Ordering = LT | EQ | GT ; 9.10/3.91 9.10/3.91 minBoundOrdering :: Ordering; 9.10/3.91 minBoundOrdering = LT; 9.10/3.91 9.10/3.91 } 9.10/3.91 9.10/3.91 ---------------------------------------- 9.10/3.91 9.10/3.91 (1) BR (EQUIVALENT) 9.10/3.91 Replaced joker patterns by fresh variables and removed binding patterns. 9.10/3.91 ---------------------------------------- 9.10/3.91 9.10/3.91 (2) 9.10/3.91 Obligation: 9.10/3.91 mainModule Main 9.10/3.91 module Main where { 9.10/3.91 import qualified Prelude; 9.10/3.91 data Ordering = LT | EQ | GT ; 9.10/3.91 9.10/3.91 minBoundOrdering :: Ordering; 9.10/3.91 minBoundOrdering = LT; 9.10/3.91 9.10/3.91 } 9.10/3.91 9.10/3.91 ---------------------------------------- 9.10/3.91 9.10/3.91 (3) COR (EQUIVALENT) 9.10/3.91 Cond Reductions: 9.10/3.91 The following Function with conditions 9.10/3.92 "undefined |Falseundefined; 9.10/3.92 " 9.10/3.92 is transformed to 9.10/3.92 "undefined = undefined1; 9.10/3.92 " 9.10/3.92 "undefined0 True = undefined; 9.10/3.92 " 9.10/3.92 "undefined1 = undefined0 False; 9.10/3.92 " 9.10/3.92 9.10/3.92 ---------------------------------------- 9.10/3.92 9.10/3.92 (4) 9.10/3.92 Obligation: 9.10/3.92 mainModule Main 9.10/3.92 module Main where { 9.10/3.92 import qualified Prelude; 9.10/3.92 data Ordering = LT | EQ | GT ; 9.10/3.92 9.10/3.92 minBoundOrdering :: Ordering; 9.10/3.92 minBoundOrdering = LT; 9.10/3.92 9.10/3.92 } 9.10/3.92 9.10/3.92 ---------------------------------------- 9.10/3.92 9.10/3.92 (5) Narrow (EQUIVALENT) 9.10/3.92 Haskell To QDPs 9.10/3.92 9.10/3.92 digraph dp_graph { 9.10/3.92 node [outthreshold=100, inthreshold=100];1[label="minBoundOrdering",fontsize=16,color="black",shape="box"];1 -> 3[label="",style="solid", color="black", weight=3]; 9.10/3.92 3[label="LT",fontsize=16,color="green",shape="box"];} 9.10/3.92 9.10/3.92 ---------------------------------------- 9.10/3.92 9.10/3.92 (6) 9.10/3.92 YES 9.10/3.95 EOF