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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.22166705132 seconds
cpu usage	9.813394925
max memory	6.26225152E8

stage attributes

key	value
output-size	7564
starexec-result	YES

output

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

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

job log

popout

actions

all output return to Haskell