details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.21921 seconds
cpu usage	9.91577
user time	9.59575
system time	0.320016
max virtual memory	1.82857E7
max residence set size	582408.0

stage attributes

key	value
starexec-result	YES

output

7.96/3.57 YES 9.63/4.08 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 9.63/4.08 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 9.63/4.08 9.63/4.08 9.63/4.08 H-Termination with start terms of the given HASKELL could be proven: 9.63/4.08 9.63/4.08 (0) HASKELL 9.63/4.08 (1) BR [EQUIVALENT, 0 ms] 9.63/4.08 (2) HASKELL 9.63/4.08 (3) COR [EQUIVALENT, 0 ms] 9.63/4.08 (4) HASKELL 9.63/4.08 (5) Narrow [SOUND, 0 ms] 9.63/4.08 (6) AND 9.63/4.08 (7) QDP 9.63/4.08 (8) QDPSizeChangeProof [EQUIVALENT, 0 ms] 9.63/4.08 (9) YES 9.63/4.08 (10) QDP 9.63/4.08 (11) QDPSizeChangeProof [EQUIVALENT, 0 ms] 9.63/4.08 (12) YES 9.63/4.08 (13) QDP 9.63/4.08 (14) QDPSizeChangeProof [EQUIVALENT, 0 ms] 9.63/4.08 (15) YES 9.63/4.08 9.63/4.08 9.63/4.08 ---------------------------------------- 9.63/4.08 9.63/4.08 (0) 9.63/4.08 Obligation: 9.63/4.08 mainModule Main 9.63/4.08 module Main where { 9.63/4.08 import qualified Prelude; 9.63/4.08 data List a = Cons a (List a) | Nil ; 9.63/4.08 9.63/4.08 data Tup0 = Tup0 ; 9.63/4.08 9.63/4.08 foldr :: (a -> b -> b) -> b -> List a -> b; 9.63/4.08 foldr f z Nil = z; 9.63/4.08 foldr f z (Cons x xs) = f x (foldr f z xs); 9.63/4.08 9.63/4.08 gtGt0 q vv = q; 9.63/4.08 9.63/4.08 gtGtEsNil :: List a -> (a -> List b) -> List b; 9.63/4.08 gtGtEsNil (Cons x xs) f = psPs (f x) (gtGtEsNil xs f); 9.63/4.08 gtGtEsNil Nil f = Nil; 9.63/4.08 9.63/4.08 gtGtNil :: List a -> List b -> List b; 9.63/4.08 gtGtNil p q = gtGtEsNil p (gtGt0 q); 9.63/4.08 9.63/4.08 psPs :: List a -> List a -> List a; 9.63/4.08 psPs Nil ys = ys; 9.63/4.08 psPs (Cons x xs) ys = Cons x (psPs xs ys); 9.63/4.08 9.63/4.08 returnNil :: a -> List a; 9.63/4.08 returnNil x = Cons x Nil; 9.63/4.08 9.63/4.08 sequence_Nil :: List (List a) -> List Tup0; 9.63/4.08 sequence_Nil = foldr gtGtNil (returnNil Tup0); 9.63/4.08 9.63/4.08 } 9.63/4.08 9.63/4.08 ---------------------------------------- 9.63/4.08 9.63/4.08 (1) BR (EQUIVALENT) 9.63/4.08 Replaced joker patterns by fresh variables and removed binding patterns. 9.63/4.08 ---------------------------------------- 9.63/4.08 9.63/4.08 (2) 9.63/4.08 Obligation: 9.63/4.08 mainModule Main 9.63/4.08 module Main where { 9.63/4.08 import qualified Prelude; 9.63/4.08 data List a = Cons a (List a) | Nil ; 9.63/4.08 9.63/4.08 data Tup0 = Tup0 ; 9.63/4.08 9.63/4.08 foldr :: (a -> b -> b) -> b -> List a -> b; 9.63/4.08 foldr f z Nil = z; 9.63/4.08 foldr f z (Cons x xs) = f x (foldr f z xs); 9.63/4.08 9.63/4.08 gtGt0 q vv = q; 9.63/4.08 9.63/4.08 gtGtEsNil :: List a -> (a -> List b) -> List b; 9.63/4.08 gtGtEsNil (Cons x xs) f = psPs (f x) (gtGtEsNil xs f); 9.63/4.08 gtGtEsNil Nil f = Nil; 9.63/4.08 9.63/4.08 gtGtNil :: List b -> List a -> List a; 9.63/4.08 gtGtNil p q = gtGtEsNil p (gtGt0 q); 9.63/4.08 9.63/4.08 psPs :: List a -> List a -> List a; 9.63/4.08 psPs Nil ys = ys; 9.63/4.08 psPs (Cons x xs) ys = Cons x (psPs xs ys); 9.63/4.08 9.63/4.08 returnNil :: a -> List a; 9.63/4.08 returnNil x = Cons x Nil; 9.63/4.08 9.63/4.08 sequence_Nil :: List (List a) -> List Tup0; 9.63/4.08 sequence_Nil = foldr gtGtNil (returnNil Tup0); 9.63/4.08 9.63/4.08 } popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52