Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487599338
details
property
value
status
complete
benchmark
FiniteMap_maxFM_11.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n156.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
5.11159992218 seconds
cpu usage
12.053170348
max memory
7.1964672E8
stage attributes
key
value
output-size
7185
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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty H-Termination with start terms of the given HASKELL could be proven: (0) HASKELL (1) CR [EQUIVALENT, 0 ms] (2) HASKELL (3) BR [EQUIVALENT, 0 ms] (4) HASKELL (5) COR [EQUIVALENT, 0 ms] (6) HASKELL (7) Narrow [SOUND, 0 ms] (8) QDP (9) QDPSizeChangeProof [EQUIVALENT, 0 ms] (10) YES ---------------------------------------- (0) Obligation: mainModule Main module FiniteMap where { import qualified Main; import qualified Maybe; import qualified Prelude; data FiniteMap b a = EmptyFM | Branch b a Int (FiniteMap b a) (FiniteMap b a) ; maxFM :: Ord a => FiniteMap a b -> Maybe a; maxFM EmptyFM = Nothing; maxFM (Branch key _ _ _ fm_r) = case maxFM fm_r of { Nothing-> Just key; Just key1-> Just key1; } ; } module Maybe where { import qualified FiniteMap; import qualified Main; import qualified Prelude; } module Main where { import qualified FiniteMap; import qualified Maybe; import qualified Prelude; } ---------------------------------------- (1) CR (EQUIVALENT) Case Reductions: The following Case expression "case maxFM fm_r of { Nothing -> Just key; Just key1 -> Just key1} " is transformed to "maxFM0 key Nothing = Just key; maxFM0 key (Just key1) = Just key1; " ---------------------------------------- (2) Obligation: mainModule Main module FiniteMap where { import qualified Main; import qualified Maybe; import qualified Prelude; data FiniteMap a b = EmptyFM | Branch a b Int (FiniteMap a b) (FiniteMap a b) ; maxFM :: Ord a => FiniteMap a b -> Maybe a; maxFM EmptyFM = Nothing; maxFM (Branch key _ _ _ fm_r) = maxFM0 key (maxFM fm_r); maxFM0 key Nothing = Just key; maxFM0 key (Just key1) = Just key1; } module Maybe where { import qualified FiniteMap; import qualified Main; import qualified Prelude; } module Main where { import qualified FiniteMap; import qualified Maybe; import qualified Prelude; }
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell