details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.25322 seconds
cpu usage	9.8935
user time	9.61206
system time	0.28144
max virtual memory	1.8288444E7
max residence set size	571380.0

stage attributes

key	value
starexec-result	MAYBE

output

8.02/3.73 MAYBE 9.75/4.21 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 9.75/4.21 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 9.75/4.21 9.75/4.21 9.75/4.21 H-Termination with start terms of the given HASKELL could not be shown: 9.75/4.21 9.75/4.21 (0) HASKELL 9.75/4.21 (1) BR [EQUIVALENT, 0 ms] 9.75/4.21 (2) HASKELL 9.75/4.21 (3) COR [EQUIVALENT, 0 ms] 9.75/4.21 (4) HASKELL 9.75/4.21 (5) Narrow [SOUND, 0 ms] 9.75/4.21 (6) QDP 9.75/4.21 (7) NonTerminationLoopProof [COMPLETE, 0 ms] 9.75/4.21 (8) NO 9.75/4.21 (9) Narrow [COMPLETE, 0 ms] 9.75/4.21 (10) QDP 9.75/4.21 (11) PisEmptyProof [EQUIVALENT, 0 ms] 9.75/4.21 (12) YES 9.75/4.21 9.75/4.21 9.75/4.21 ---------------------------------------- 9.75/4.21 9.75/4.21 (0) 9.75/4.21 Obligation: 9.75/4.21 mainModule Main 9.75/4.21 module Main where { 9.75/4.21 import qualified Prelude; 9.75/4.21 data List a = Cons a (List a) | Nil ; 9.75/4.21 9.75/4.21 iterate :: (a -> a) -> a -> List a; 9.75/4.21 iterate f x = Cons x (iterate f (f x)); 9.75/4.21 9.75/4.21 } 9.75/4.21 9.75/4.21 ---------------------------------------- 9.75/4.21 9.75/4.21 (1) BR (EQUIVALENT) 9.75/4.21 Replaced joker patterns by fresh variables and removed binding patterns. 9.75/4.21 ---------------------------------------- 9.75/4.21 9.75/4.21 (2) 9.75/4.21 Obligation: 9.75/4.21 mainModule Main 9.75/4.21 module Main where { 9.75/4.21 import qualified Prelude; 9.75/4.21 data List a = Cons a (List a) | Nil ; 9.75/4.21 9.75/4.21 iterate :: (a -> a) -> a -> List a; 9.75/4.21 iterate f x = Cons x (iterate f (f x)); 9.75/4.21 9.75/4.21 } 9.75/4.21 9.75/4.21 ---------------------------------------- 9.75/4.21 9.75/4.21 (3) COR (EQUIVALENT) 9.75/4.21 Cond Reductions: 9.75/4.21 The following Function with conditions 9.75/4.21 "undefined |Falseundefined; 9.75/4.21 " 9.75/4.21 is transformed to 9.75/4.21 "undefined = undefined1; 9.75/4.21 " 9.75/4.21 "undefined0 True = undefined; 9.75/4.21 " 9.75/4.21 "undefined1 = undefined0 False; 9.75/4.21 " 9.75/4.21 9.75/4.21 ---------------------------------------- 9.75/4.21 9.75/4.21 (4) 9.75/4.21 Obligation: 9.75/4.21 mainModule Main 9.75/4.21 module Main where { 9.75/4.21 import qualified Prelude; 9.75/4.21 data List a = Cons a (List a) | Nil ; 9.75/4.21 9.75/4.21 iterate :: (a -> a) -> a -> List a; 9.75/4.21 iterate f x = Cons x (iterate f (f x)); 9.75/4.21 9.75/4.21 } 9.75/4.21 9.75/4.21 ---------------------------------------- 9.75/4.21 9.75/4.21 (5) Narrow (SOUND) 9.75/4.21 Haskell To QDPs 9.75/4.21 9.75/4.21 digraph dp_graph { 9.75/4.21 node [outthreshold=100, inthreshold=100];1[label="iterate",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3]; 9.75/4.21 3[label="iterate vx3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3]; 9.75/4.21 4[label="iterate vx3 vx4",fontsize=16,color="black",shape="triangle"];4 -> 5[label="",style="solid", color="black", weight=3]; 9.75/4.21 5[label="Cons vx4 (iterate vx3 (vx3 vx4))",fontsize=16,color="green",shape="box"];5 -> 6[label="",style="dashed", color="green", weight=3]; 9.75/4.21 6 -> 4[label="",style="dashed", color="red", weight=0]; 9.75/4.21 6[label="iterate vx3 (vx3 vx4)",fontsize=16,color="magenta"];6 -> 7[label="",style="dashed", color="magenta", weight=3]; 9.75/4.21 7[label="vx3 vx4",fontsize=16,color="green",shape="box"];7 -> 8[label="",style="dashed", color="green", weight=3]; 9.75/4.21 8[label="vx4",fontsize=16,color="green",shape="box"];} 9.75/4.21 9.75/4.21 ---------------------------------------- 9.75/4.21 popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52