details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.10585 seconds
cpu usage	9.37082
user time	9.04653
system time	0.324291
max virtual memory	1.828352E7
max residence set size	575656.0

stage attributes

key	value
starexec-result	YES

output

7.56/3.58 YES 9.31/4.06 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 9.31/4.06 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 9.31/4.06 9.31/4.06 9.31/4.06 H-Termination with start terms of the given HASKELL could be proven: 9.31/4.06 9.31/4.06 (0) HASKELL 9.31/4.06 (1) BR [EQUIVALENT, 0 ms] 9.31/4.06 (2) HASKELL 9.31/4.06 (3) COR [EQUIVALENT, 0 ms] 9.31/4.06 (4) HASKELL 9.31/4.06 (5) Narrow [SOUND, 0 ms] 9.31/4.06 (6) AND 9.31/4.06 (7) QDP 9.31/4.06 (8) QDPSizeChangeProof [EQUIVALENT, 0 ms] 9.31/4.06 (9) YES 9.31/4.06 (10) QDP 9.31/4.06 (11) QDPSizeChangeProof [EQUIVALENT, 0 ms] 9.31/4.06 (12) YES 9.31/4.06 9.31/4.06 9.31/4.06 ---------------------------------------- 9.31/4.06 9.31/4.06 (0) 9.31/4.06 Obligation: 9.31/4.06 mainModule Main 9.31/4.06 module Main where { 9.31/4.06 import qualified Prelude; 9.31/4.06 data List a = Cons a (List a) | Nil ; 9.31/4.06 9.31/4.06 concat :: List (List a) -> List a; 9.31/4.06 concat = foldr psPs Nil; 9.31/4.06 9.31/4.06 foldr :: (a -> b -> b) -> b -> List a -> b; 9.31/4.06 foldr f z Nil = z; 9.31/4.06 foldr f z (Cons x xs) = f x (foldr f z xs); 9.31/4.06 9.31/4.06 psPs :: List a -> List a -> List a; 9.31/4.06 psPs Nil ys = ys; 9.31/4.06 psPs (Cons x xs) ys = Cons x (psPs xs ys); 9.31/4.06 9.31/4.06 } 9.31/4.06 9.31/4.06 ---------------------------------------- 9.31/4.06 9.31/4.06 (1) BR (EQUIVALENT) 9.31/4.06 Replaced joker patterns by fresh variables and removed binding patterns. 9.31/4.06 ---------------------------------------- 9.31/4.06 9.31/4.06 (2) 9.31/4.06 Obligation: 9.31/4.06 mainModule Main 9.31/4.06 module Main where { 9.31/4.06 import qualified Prelude; 9.31/4.06 data List a = Cons a (List a) | Nil ; 9.31/4.06 9.31/4.06 concat :: List (List a) -> List a; 9.31/4.06 concat = foldr psPs Nil; 9.31/4.06 9.31/4.06 foldr :: (a -> b -> b) -> b -> List a -> b; 9.31/4.06 foldr f z Nil = z; 9.31/4.06 foldr f z (Cons x xs) = f x (foldr f z xs); 9.31/4.06 9.31/4.06 psPs :: List a -> List a -> List a; 9.31/4.06 psPs Nil ys = ys; 9.31/4.06 psPs (Cons x xs) ys = Cons x (psPs xs ys); 9.31/4.06 9.31/4.06 } 9.31/4.06 9.31/4.06 ---------------------------------------- 9.31/4.06 9.31/4.06 (3) COR (EQUIVALENT) 9.31/4.06 Cond Reductions: 9.31/4.06 The following Function with conditions 9.31/4.06 "undefined |Falseundefined; 9.31/4.06 " 9.31/4.06 is transformed to 9.31/4.06 "undefined = undefined1; 9.31/4.06 " 9.31/4.06 "undefined0 True = undefined; 9.31/4.06 " 9.31/4.06 "undefined1 = undefined0 False; 9.31/4.06 " 9.31/4.06 9.31/4.06 ---------------------------------------- 9.31/4.06 9.31/4.06 (4) 9.31/4.06 Obligation: 9.31/4.06 mainModule Main 9.31/4.06 module Main where { 9.31/4.06 import qualified Prelude; 9.31/4.06 data List a = Cons a (List a) | Nil ; 9.31/4.06 9.31/4.06 concat :: List (List a) -> List a; 9.31/4.06 concat = foldr psPs Nil; 9.31/4.06 9.31/4.06 foldr :: (a -> b -> b) -> b -> List a -> b; 9.31/4.06 foldr f z Nil = z; 9.31/4.06 foldr f z (Cons x xs) = f x (foldr f z xs); popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52