details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.02096 seconds
cpu usage	9.51836
user time	9.21617
system time	0.302189
max virtual memory	1.828352E7
max residence set size	597008.0

stage attributes

key	value
starexec-result	YES

output

7.60/3.48 YES 9.19/3.98 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 9.19/3.98 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 9.19/3.98 9.19/3.98 9.19/3.98 H-Termination with start terms of the given HASKELL could be proven: 9.19/3.98 9.19/3.98 (0) HASKELL 9.19/3.98 (1) BR [EQUIVALENT, 0 ms] 9.19/3.98 (2) HASKELL 9.19/3.98 (3) COR [EQUIVALENT, 0 ms] 9.19/3.98 (4) HASKELL 9.19/3.98 (5) Narrow [SOUND, 0 ms] 9.19/3.98 (6) QDP 9.19/3.98 (7) QDPSizeChangeProof [EQUIVALENT, 0 ms] 9.19/3.98 (8) YES 9.19/3.98 9.19/3.98 9.19/3.98 ---------------------------------------- 9.19/3.98 9.19/3.98 (0) 9.19/3.98 Obligation: 9.19/3.98 mainModule Main 9.19/3.98 module Main where { 9.19/3.98 import qualified Prelude; 9.19/3.98 data List a = Cons a (List a) | Nil ; 9.19/3.98 9.19/3.98 data Tup3 a c b = Tup3 a c b ; 9.19/3.98 9.19/3.98 foldr :: (a -> b -> b) -> b -> List a -> b; 9.19/3.98 foldr f z Nil = z; 9.19/3.98 foldr f z (Cons x xs) = f x (foldr f z xs); 9.19/3.98 9.19/3.98 unzip3 :: List (Tup3 b a c) -> Tup3 (List b) (List a) (List c); 9.19/3.98 unzip3 = foldr unzip30 (Tup3 Nil Nil Nil); 9.19/3.98 9.19/3.98 unzip30 (Tup3 a b c) vv = Tup3 (Cons a (unzip300 vv)) (Cons b (unzip301 vv)) (Cons c (unzip302 vv)); 9.19/3.98 9.19/3.98 unzip300 (Tup3 as bs cs) = as; 9.19/3.98 9.19/3.98 unzip301 (Tup3 as bs cs) = bs; 9.19/3.98 9.19/3.98 unzip302 (Tup3 as bs cs) = cs; 9.19/3.98 9.19/3.98 } 9.19/3.98 9.19/3.98 ---------------------------------------- 9.19/3.98 9.19/3.98 (1) BR (EQUIVALENT) 9.19/3.98 Replaced joker patterns by fresh variables and removed binding patterns. 9.19/3.98 ---------------------------------------- 9.19/3.98 9.19/3.98 (2) 9.19/3.98 Obligation: 9.19/3.98 mainModule Main 9.19/3.98 module Main where { 9.19/3.98 import qualified Prelude; 9.19/3.98 data List a = Cons a (List a) | Nil ; 9.19/3.98 9.19/3.98 data Tup3 a c b = Tup3 a c b ; 9.19/3.98 9.19/3.98 foldr :: (b -> a -> a) -> a -> List b -> a; 9.19/3.98 foldr f z Nil = z; 9.19/3.98 foldr f z (Cons x xs) = f x (foldr f z xs); 9.19/3.98 9.19/3.98 unzip3 :: List (Tup3 a b c) -> Tup3 (List a) (List b) (List c); 9.19/3.98 unzip3 = foldr unzip30 (Tup3 Nil Nil Nil); 9.19/3.98 9.19/3.98 unzip30 (Tup3 a b c) vv = Tup3 (Cons a (unzip300 vv)) (Cons b (unzip301 vv)) (Cons c (unzip302 vv)); 9.19/3.98 9.19/3.98 unzip300 (Tup3 as bs cs) = as; 9.19/3.98 9.19/3.98 unzip301 (Tup3 as bs cs) = bs; 9.19/3.98 9.19/3.98 unzip302 (Tup3 as bs cs) = cs; 9.19/3.98 9.19/3.98 } 9.19/3.98 9.19/3.98 ---------------------------------------- 9.19/3.98 9.19/3.98 (3) COR (EQUIVALENT) 9.19/3.98 Cond Reductions: 9.19/3.98 The following Function with conditions 9.19/3.98 "undefined |Falseundefined; 9.19/3.98 " 9.19/3.98 is transformed to 9.19/3.98 "undefined = undefined1; 9.19/3.98 " 9.19/3.98 "undefined0 True = undefined; 9.19/3.98 " 9.19/3.98 "undefined1 = undefined0 False; 9.19/3.98 " 9.19/3.98 9.19/3.98 ---------------------------------------- 9.19/3.98 9.19/3.98 (4) 9.19/3.98 Obligation: 9.19/3.98 mainModule Main 9.19/3.98 module Main where { 9.19/3.98 import qualified Prelude; popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52