Haskell pair #487598647

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	10.4251949787 seconds
cpu usage	12.362948503
max memory	7.61552896E8

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 a b = EmptyFM  | Branch a b Int (FiniteMap a b) (FiniteMap a b) ;

minFM :: Ord b => FiniteMap b a  ->  Maybe b;
minFM EmptyFM = Nothing;
minFM (Branch key _ _ fm_l _) = case minFM fm_l 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 minFM fm_l of {
Nothing  -> Just key;
Just key1  -> Just key1}
"
is transformed to
"minFM0 key Nothing = Just key;
minFM0 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) ;

minFM :: Ord a => FiniteMap a b  ->  Maybe a;
minFM EmptyFM = Nothing;
minFM (Branch key _ _ fm_l _) = minFM0 key (minFM fm_l);

minFM0 key Nothing = Just key;
minFM0 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