details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.36873197556 seconds
cpu usage	10.226238971
max memory	5.66992896E8

stage attributes

key	value
output-size	5969
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 ; scanl :: (b -> a -> b) -> b -> List a -> List b; scanl f q xs = Cons q (scanl0 f q xs); scanl0 f q Nil = Nil; scanl0 f q (Cons x xs) = scanl f (f q x) xs; scanl1 :: (a -> a -> a) -> List a -> List a; scanl1 vv Nil = Nil; scanl1 f (Cons x xs) = scanl f x xs; } ---------------------------------------- (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 ; scanl :: (b -> a -> b) -> b -> List a -> List b; scanl f q xs = Cons q (scanl0 f q xs); scanl0 f q Nil = Nil; scanl0 f q (Cons x xs) = scanl f (f q x) xs; scanl1 :: (a -> a -> a) -> List a -> List a; scanl1 vv Nil = Nil; scanl1 f (Cons x xs) = scanl f x xs; } ---------------------------------------- (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 ; scanl :: (a -> b -> a) -> a -> List b -> List a; scanl f q xs = Cons q (scanl0 f q xs); scanl0 f q Nil = Nil; scanl0 f q (Cons x xs) = scanl f (f q x) xs; popout

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

job log

popout

actions

all output return to Funct Progr 77531