Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Funct Progr 77531 pair #381920718
details
property
value
status
complete
benchmark
Maybe_catMaybes_1.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n041.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.28237891197 seconds
cpu usage
10.76743059
max memory
6.47671808E8
stage attributes
key
value
output-size
8089
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) CR [EQUIVALENT, 0 ms] (4) HASKELL (5) BR [EQUIVALENT, 0 ms] (6) HASKELL (7) COR [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 Main; import qualified Prelude; catMaybes :: [Maybe a] -> [a]; catMaybes ls = concatMap (\vv1 ->case vv1 of { Just x-> x : []; _-> []; } ) ls; } module Main where { import qualified Maybe; import qualified Prelude; } ---------------------------------------- (1) LR (EQUIVALENT) Lambda Reductions: The following Lambda expression "\vv1->case vv1 of { Just x -> x : []; _ -> []} " is transformed to "catMaybes0 vv1 = case vv1 of { Just x -> x : []; _ -> []} ; " ---------------------------------------- (2) Obligation: mainModule Main module Maybe where { import qualified Main; import qualified Prelude; catMaybes :: [Maybe a] -> [a]; catMaybes ls = concatMap catMaybes0 ls; catMaybes0 vv1 = case vv1 of { Just x-> x : []; _-> []; } ; } module Main where { import qualified Maybe; import qualified Prelude; } ---------------------------------------- (3) CR (EQUIVALENT) Case Reductions: The following Case expression "case vv1 of { Just x -> x : []; _ -> []} " is transformed to "catMaybes00 (Just x) = x : []; catMaybes00 _ = []; "
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Funct Progr 77531