details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	3.98077702522 seconds
cpu usage	9.596047782
max memory	5.46582528E8

stage attributes

key	value
output-size	8250
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: 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 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 "max x y|x <= yy|otherwisex; " is transformed to "max x y = max2 x y; " "max1 x y True = y; max1 x y False = max0 x y otherwise; " "max0 x y True = x; " "max2 x y = max1 x y (x <= y); " 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 (SOUND) Haskell To QDPs digraph dp_graph { node [outthreshold=100, inthreshold=100];1[label="maximum",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3]; 3[label="maximum vx3",fontsize=16,color="black",shape="triangle"];3 -> 4[label="",style="solid", color="black", weight=3]; 4[label="foldl1 max vx3",fontsize=16,color="burlywood",shape="box"];33[label="vx3/vx30 : vx31",fontsize=10,color="white",style="solid",shape="box"];4 -> 33[label="",style="solid", color="burlywood", weight=9]; 33 -> 5[label="",style="solid", color="burlywood", weight=3]; 34[label="vx3/[]",fontsize=10,color="white",style="solid",shape="box"];4 -> 34[label="",style="solid", color="burlywood", weight=9]; 34 -> 6[label="",style="solid", color="burlywood", weight=3]; 5[label="foldl1 max (vx30 : vx31)",fontsize=16,color="black",shape="box"];5 -> 7[label="",style="solid", color="black", weight=3]; 6[label="foldl1 max []",fontsize=16,color="black",shape="box"];6 -> 8[label="",style="solid", color="black", weight=3]; 7[label="foldl max vx30 vx31",fontsize=16,color="burlywood",shape="triangle"];35[label="vx31/vx310 : vx311",fontsize=10,color="white",style="solid",shape="box"];7 -> 35[label="",style="solid", color="burlywood", weight=9]; 35 -> 9[label="",style="solid", color="burlywood", weight=3]; 36[label="vx31/[]",fontsize=10,color="white",style="solid",shape="box"];7 -> 36[label="",style="solid", color="burlywood", weight=9]; popout

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

job log

popout

actions

all output return to Funct Progr 77531