details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.20081 seconds
cpu usage	9.91224
user time	9.61344
system time	0.298798
max virtual memory	1.8285568E7
max residence set size	599168.0

stage attributes

key	value
starexec-result	YES

output

8.11/3.65 YES 9.54/4.15 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 9.54/4.15 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 9.54/4.15 9.54/4.15 9.54/4.15 H-Termination with start terms of the given HASKELL could be proven: 9.54/4.15 9.54/4.15 (0) HASKELL 9.54/4.15 (1) BR [EQUIVALENT, 0 ms] 9.54/4.15 (2) HASKELL 9.54/4.15 (3) COR [EQUIVALENT, 0 ms] 9.54/4.15 (4) HASKELL 9.54/4.15 (5) Narrow [SOUND, 0 ms] 9.54/4.15 (6) QDP 9.54/4.15 (7) MRRProof [EQUIVALENT, 36 ms] 9.54/4.15 (8) QDP 9.54/4.15 (9) DependencyGraphProof [EQUIVALENT, 0 ms] 9.54/4.15 (10) TRUE 9.54/4.15 9.54/4.15 9.54/4.15 ---------------------------------------- 9.54/4.15 9.54/4.15 (0) 9.54/4.15 Obligation: 9.54/4.15 mainModule Main 9.54/4.15 module Main where { 9.54/4.15 import qualified Prelude; 9.54/4.15 data List a = Cons a (List a) | Nil ; 9.54/4.15 9.54/4.15 scanr1 :: (a -> a -> a) -> List a -> List a; 9.54/4.15 scanr1 f Nil = Nil; 9.54/4.15 scanr1 f (Cons x Nil) = Cons x Nil; 9.54/4.15 scanr1 f (Cons x xs) = Cons (f x (scanr1Q f xs)) (scanr1Qs f xs); 9.54/4.15 9.54/4.15 scanr1Q vw vx = scanr1Q1 vw vx (scanr1Vu41 vw vx); 9.54/4.15 9.54/4.15 scanr1Q1 vw vx (Cons q vv) = q; 9.54/4.15 9.54/4.15 scanr1Qs vw vx = scanr1Qs0 vw vx (scanr1Vu41 vw vx); 9.54/4.15 9.54/4.15 scanr1Qs0 vw vx qs = qs; 9.54/4.15 9.54/4.15 scanr1Vu41 vw vx = scanr1 vw vx; 9.54/4.15 9.54/4.15 } 9.54/4.15 9.54/4.15 ---------------------------------------- 9.54/4.15 9.54/4.15 (1) BR (EQUIVALENT) 9.54/4.15 Replaced joker patterns by fresh variables and removed binding patterns. 9.54/4.15 ---------------------------------------- 9.54/4.15 9.54/4.15 (2) 9.54/4.15 Obligation: 9.54/4.15 mainModule Main 9.54/4.15 module Main where { 9.54/4.15 import qualified Prelude; 9.54/4.15 data List a = Cons a (List a) | Nil ; 9.54/4.15 9.54/4.15 scanr1 :: (a -> a -> a) -> List a -> List a; 9.54/4.15 scanr1 f Nil = Nil; 9.54/4.15 scanr1 f (Cons x Nil) = Cons x Nil; 9.54/4.15 scanr1 f (Cons x xs) = Cons (f x (scanr1Q f xs)) (scanr1Qs f xs); 9.54/4.15 9.54/4.15 scanr1Q vw vx = scanr1Q1 vw vx (scanr1Vu41 vw vx); 9.54/4.15 9.54/4.15 scanr1Q1 vw vx (Cons q vv) = q; 9.54/4.15 9.54/4.15 scanr1Qs vw vx = scanr1Qs0 vw vx (scanr1Vu41 vw vx); 9.54/4.15 9.54/4.15 scanr1Qs0 vw vx qs = qs; 9.54/4.15 9.54/4.15 scanr1Vu41 vw vx = scanr1 vw vx; 9.54/4.15 9.54/4.15 } 9.54/4.15 9.54/4.15 ---------------------------------------- 9.54/4.15 9.54/4.15 (3) COR (EQUIVALENT) 9.54/4.15 Cond Reductions: 9.54/4.15 The following Function with conditions 9.54/4.15 "undefined |Falseundefined; 9.54/4.15 " 9.54/4.15 is transformed to 9.54/4.15 "undefined = undefined1; 9.54/4.15 " 9.54/4.15 "undefined0 True = undefined; 9.54/4.15 " 9.54/4.15 "undefined1 = undefined0 False; 9.54/4.15 " 9.54/4.15 9.54/4.15 ---------------------------------------- 9.54/4.15 9.54/4.15 (4) 9.54/4.15 Obligation: 9.54/4.15 mainModule Main 9.54/4.15 module Main where { 9.54/4.15 import qualified Prelude; 9.54/4.15 data List a = Cons a (List a) | Nil ; 9.54/4.15 popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52