details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	3.97794914246 seconds
cpu usage	9.682466572
max memory	5.91282176E8

stage attributes

key	value
output-size	7265
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.hs /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.hs # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 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 b c a = Tup3 b c a ; zip3 :: List a -> List c -> List b -> List (Tup3 a c b); zip3 = zipWith3 zip30; zip30 a b c = Tup3 a b c; zipWith3 :: (d -> a -> c -> b) -> List d -> List a -> List c -> List b; zipWith3 z (Cons a as) (Cons b bs) (Cons c cs) = Cons (z a b c) (zipWith3 z as bs cs); zipWith3 vv vw vx vy = Nil; } ---------------------------------------- (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 c a = Tup3 b c a ; zip3 :: List b -> List a -> List c -> List (Tup3 b a c); zip3 = zipWith3 zip30; zip30 a b c = Tup3 a b c; zipWith3 :: (d -> b -> a -> c) -> List d -> List b -> List a -> List c; zipWith3 z (Cons a as) (Cons b bs) (Cons c cs) = Cons (z a b c) (zipWith3 z as bs cs); zipWith3 vv vw vx vy = Nil; } ---------------------------------------- (3) COR (EQUIVALENT) Cond Reductions: The following Function with conditions "undefined |Falseundefined; " is transformed to "undefined = undefined1; " "undefined0 True = undefined; " "undefined1 = undefined0 False; " ---------------------------------------- (4) Obligation: mainModule Main module Main where { import qualified Prelude; data List a = Cons a (List a) | Nil ; data Tup3 c a b = Tup3 c a b ; zip3 :: List c -> List b -> List a -> List (Tup3 c b a); zip3 = zipWith3 zip30; popout

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

job log

popout

actions

all output return to Funct Progr 77531