7.50/3.45 YES 9.49/3.93 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 9.49/3.93 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 9.49/3.93 9.49/3.93 9.49/3.93 H-Termination with start terms of the given HASKELL could be proven: 9.49/3.93 9.49/3.93 (0) HASKELL 9.49/3.93 (1) BR [EQUIVALENT, 0 ms] 9.49/3.93 (2) HASKELL 9.49/3.93 (3) COR [EQUIVALENT, 0 ms] 9.49/3.93 (4) HASKELL 9.49/3.93 (5) Narrow [EQUIVALENT, 0 ms] 9.49/3.93 (6) YES 9.49/3.93 9.49/3.93 9.49/3.93 ---------------------------------------- 9.49/3.93 9.49/3.93 (0) 9.49/3.93 Obligation: 9.49/3.93 mainModule Main 9.49/3.93 module Main where { 9.49/3.93 import qualified Prelude; 9.49/3.93 } 9.49/3.93 9.49/3.93 ---------------------------------------- 9.49/3.93 9.49/3.93 (1) BR (EQUIVALENT) 9.49/3.93 Replaced joker patterns by fresh variables and removed binding patterns. 9.49/3.93 ---------------------------------------- 9.49/3.93 9.49/3.93 (2) 9.49/3.93 Obligation: 9.49/3.93 mainModule Main 9.49/3.93 module Main where { 9.49/3.93 import qualified Prelude; 9.49/3.93 } 9.49/3.93 9.49/3.93 ---------------------------------------- 9.49/3.93 9.49/3.93 (3) COR (EQUIVALENT) 9.49/3.93 Cond Reductions: 9.49/3.93 The following Function with conditions 9.49/3.93 "undefined |Falseundefined; 9.49/3.93 " 9.49/3.93 is transformed to 9.49/3.93 "undefined = undefined1; 9.49/3.93 " 9.49/3.93 "undefined0 True = undefined; 9.49/3.93 " 9.49/3.93 "undefined1 = undefined0 False; 9.49/3.93 " 9.49/3.93 9.49/3.93 ---------------------------------------- 9.49/3.93 9.49/3.93 (4) 9.49/3.93 Obligation: 9.49/3.93 mainModule Main 9.49/3.93 module Main where { 9.49/3.93 import qualified Prelude; 9.49/3.93 } 9.49/3.93 9.49/3.93 ---------------------------------------- 9.49/3.93 9.49/3.93 (5) Narrow (EQUIVALENT) 9.49/3.93 Haskell To QDPs 9.49/3.93 9.49/3.93 digraph dp_graph { 9.49/3.93 node [outthreshold=100, inthreshold=100];1[label="return",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3]; 9.49/3.93 3[label="return vx3",fontsize=16,color="blue",shape="box"];11[label="return :: a -> [] a",fontsize=10,color="white",style="solid",shape="box"];3 -> 11[label="",style="solid", color="blue", weight=9]; 9.49/3.93 11 -> 4[label="",style="solid", color="blue", weight=3]; 9.49/3.93 12[label="return :: a -> IO a",fontsize=10,color="white",style="solid",shape="box"];3 -> 12[label="",style="solid", color="blue", weight=9]; 9.49/3.93 12 -> 5[label="",style="solid", color="blue", weight=3]; 9.49/3.93 13[label="return :: a -> Maybe a",fontsize=10,color="white",style="solid",shape="box"];3 -> 13[label="",style="solid", color="blue", weight=9]; 9.49/3.93 13 -> 6[label="",style="solid", color="blue", weight=3]; 9.49/3.93 4[label="return vx3",fontsize=16,color="black",shape="box"];4 -> 7[label="",style="solid", color="black", weight=3]; 9.49/3.93 5[label="return vx3",fontsize=16,color="black",shape="box"];5 -> 8[label="",style="solid", color="black", weight=3]; 9.49/3.93 6[label="return vx3",fontsize=16,color="black",shape="box"];6 -> 9[label="",style="solid", color="black", weight=3]; 9.49/3.93 7[label="vx3 : []",fontsize=16,color="green",shape="box"];8[label="primretIO vx3",fontsize=16,color="black",shape="box"];8 -> 10[label="",style="solid", color="black", weight=3]; 9.49/3.93 9[label="Just vx3",fontsize=16,color="green",shape="box"];10[label="AProVE_IO vx3",fontsize=16,color="green",shape="box"];} 9.49/3.93 9.49/3.93 ---------------------------------------- 9.49/3.93 9.49/3.93 (6) 9.49/3.93 YES 9.49/3.97 EOF