details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	3.883259058 seconds
cpu usage	9.376765446
max memory	5.94468864E8

stage attributes

key	value
output-size	3335
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.hs /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/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 [EQUIVALENT, 0 ms] (6) YES ---------------------------------------- (0) Obligation: mainModule Main module Main where { import qualified Prelude; data Main.Maybe a = Nothing | Just a ; maybe :: a -> (b -> a) -> Main.Maybe b -> a; maybe n f Main.Nothing = n; maybe n f (Main.Just x) = f x; } ---------------------------------------- (1) BR (EQUIVALENT) Replaced joker patterns by fresh variables and removed binding patterns. ---------------------------------------- (2) Obligation: mainModule Main module Main where { import qualified Prelude; data Main.Maybe a = Nothing | Just a ; maybe :: a -> (b -> a) -> Main.Maybe b -> a; maybe n f Main.Nothing = n; maybe n f (Main.Just x) = f x; } ---------------------------------------- (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 Main where { import qualified Prelude; data Main.Maybe a = Nothing | Just a ; maybe :: a -> (b -> a) -> Main.Maybe b -> a; maybe n f Main.Nothing = n; maybe n f (Main.Just x) = f x; } ---------------------------------------- (5) Narrow (EQUIVALENT) Haskell To QDPs digraph dp_graph { node [outthreshold=100, inthreshold=100];1[label="maybe",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3]; 3[label="maybe vx3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3]; 4[label="maybe vx3 vx4",fontsize=16,color="grey",shape="box"];4 -> 5[label="",style="dashed", color="grey", weight=3]; 5[label="maybe vx3 vx4 vx5",fontsize=16,color="burlywood",shape="triangle"];11[label="vx5/Nothing",fontsize=10,color="white",style="solid",shape="box"];5 -> 11[label="",style="solid", color="burlywood", weight=9]; 11 -> 6[label="",style="solid", color="burlywood", weight=3]; 12[label="vx5/Just vx50",fontsize=10,color="white",style="solid",shape="box"];5 -> 12[label="",style="solid", color="burlywood", weight=9]; 12 -> 7[label="",style="solid", color="burlywood", weight=3]; 6[label="maybe vx3 vx4 Nothing",fontsize=16,color="black",shape="box"];6 -> 8[label="",style="solid", color="black", weight=3]; popout

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

job log

popout

actions

all output return to Funct Progr 77531