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	n095.star.cs.uiowa.edu
space	basic_haskell

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.13273 seconds
cpu usage	9.69381
user time	9.38861
system time	0.305198
max virtual memory	1.828352E7
max residence set size	575020.0

stage attributes

key	value
starexec-result	YES

output

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

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52