details

property	value
status	complete
benchmark	Prelude_lookup_2.hs
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n109.star.cs.uiowa.edu
space	full_haskell

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.18384790421 seconds
cpu usage	9.697945569
max memory	5.9531264E8

stage attributes

key	value
output-size	4542
starexec-result	YES

output

/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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 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 "lookup k [] = Nothing; lookup k ((x,y) : xys)|k == xJust y|otherwiselookup k xys; " is transformed to "lookup k [] = lookup3 k []; lookup k ((x,y) : xys) = lookup2 k ((x,y) : xys); " "lookup1 k x y xys True = Just y; lookup1 k x y xys False = lookup0 k x y xys otherwise; " "lookup0 k x y xys True = lookup k xys; " "lookup2 k ((x,y) : xys) = lookup1 k x y xys (k == x); " "lookup3 k [] = Nothing; lookup3 wu wv = lookup2 wu wv; " 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="lookup",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3]; 3[label="lookup ww3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3]; 4[label="lookup ww3 ww4",fontsize=16,color="burlywood",shape="triangle"];16[label="ww4/ww40 : ww41",fontsize=10,color="white",style="solid",shape="box"];4 -> 16[label="",style="solid", color="burlywood", weight=9]; 16 -> 5[label="",style="solid", color="burlywood", weight=3]; 17[label="ww4/[]",fontsize=10,color="white",style="solid",shape="box"];4 -> 17[label="",style="solid", color="burlywood", weight=9]; 17 -> 6[label="",style="solid", color="burlywood", weight=3]; 5[label="lookup ww3 (ww40 : ww41)",fontsize=16,color="burlywood",shape="box"];18[label="ww40/(ww400,ww401)",fontsize=10,color="white",style="solid",shape="box"];5 -> 18[label="",style="solid", color="burlywood", weight=9]; 18 -> 7[label="",style="solid", color="burlywood", weight=3]; popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Haskell