Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487598952
details
property
value
status
complete
benchmark
List_mapAccumR_1.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n053.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
7.09785413742 seconds
cpu usage
12.690457924
max memory
7.00153856E8
stage attributes
key
value
output-size
14735
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) LR [EQUIVALENT, 0 ms] (2) HASKELL (3) BR [EQUIVALENT, 0 ms] (4) HASKELL (5) COR [EQUIVALENT, 24 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; mapAccumR :: (a -> c -> (a,b)) -> a -> [c] -> (a,[b]); mapAccumR _ s [] = (s,[]); mapAccumR f s (x : xs) = (s'',y : ys) where { s' = (\(s',_) ->s') vv8; s'' = (\(s'',_) ->s'') vv7; vv7 = f s' x; vv8 = mapAccumR f s xs; y = (\(_,y) ->y) vv7; ys = (\(_,ys) ->ys) vv8; }; } 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; mapAccumR :: (c -> a -> (c,b)) -> c -> [a] -> (c,[b]);
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell