details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.94967603683 seconds
cpu usage	12.381717867
max memory	6.97946112E8

stage attributes

key	value
output-size	14148
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty H-Termination with start terms of the given HASKELL could be proven: (0) HASKELL (1) LR [EQUIVALENT, 0 ms] (2) HASKELL (3) BR [EQUIVALENT, 0 ms] (4) HASKELL (5) COR [EQUIVALENT, 0 ms] (6) HASKELL (7) LetRed [EQUIVALENT, 0 ms] (8) HASKELL (9) Narrow [SOUND, 0 ms] (10) QDP (11) QDPSizeChangeProof [EQUIVALENT, 0 ms] (12) YES ---------------------------------------- (0) Obligation: mainModule Main module Maybe where { import qualified List; import qualified Main; import qualified Prelude; } module List where { import qualified Main; import qualified Maybe; import qualified Prelude; mapAccumL :: (a -> b -> (a,c)) -> a -> [b] -> (a,[c]); mapAccumL _ s [] = (s,[]); mapAccumL f s (x : xs) = (s'',y : ys) where { s' = (\(s',_) ->s') vv5; s'' = (\(s'',_) ->s'') vv6; vv5 = f s x; vv6 = mapAccumL f s' xs; y = (\(_,y) ->y) vv5; ys = (\(_,ys) ->ys) vv6; }; } module Main where { import qualified List; import qualified Maybe; import qualified Prelude; } ---------------------------------------- (1) LR (EQUIVALENT) Lambda Reductions: The following Lambda expression "\(s'',_)->s''" is transformed to "s''0 (s'',_) = s''; " The following Lambda expression "\(s',_)->s'" is transformed to "s'0 (s',_) = s'; " The following Lambda expression "\(_,y)->y" is transformed to "y0 (_,y) = y; " The following Lambda expression "\(_,ys)->ys" is transformed to "ys0 (_,ys) = ys; " ---------------------------------------- (2) Obligation: mainModule Main module Maybe where { import qualified List; import qualified Main; import qualified Prelude; } module List where { import qualified Main; import qualified Maybe; import qualified Prelude; mapAccumL :: (c -> b -> (c,a)) -> c -> [b] -> (c,[a]); popout

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

job log

popout

actions

all output return to Funct Progr 77531