Funct Progr 77531 pair #381920348

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.01488208771 seconds
cpu usage	9.80179296
max memory	5.661696E8

stage attributes

key	value
output-size	4049
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 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 [EQUIVALENT, 31 ms]
(8) YES


----------------------------------------

(0)
Obligation:
mainModule Main 
module Maybe where {
import qualified Main;
import qualified Prelude;
fromMaybe :: a  ->  Maybe a  ->  a;
fromMaybe d x = case x of { 
Nothing-> d; 
Just v-> v; 
 } ;

}
module Main where {
import qualified Maybe;
import qualified Prelude;
}

----------------------------------------

(1) CR (EQUIVALENT)
Case Reductions:
The following Case expression
"case x of {
Nothing  -> d;
Just v  -> v}
"
is transformed to
"fromMaybe0 d Nothing = d;
fromMaybe0 d (Just v) = v;
"

----------------------------------------

(2)
Obligation:
mainModule Main 
module Maybe where {
import qualified Main;
import qualified Prelude;
fromMaybe :: a  ->  Maybe a  ->  a;
fromMaybe d x = fromMaybe0 d x;

fromMaybe0 d Nothing = d;
fromMaybe0 d (Just v) = v;

}
module Main where {
import qualified Maybe;
import qualified Prelude;
}

----------------------------------------

(3) BR (EQUIVALENT)
Replaced joker patterns by fresh variables and removed binding patterns.
----------------------------------------

(4)
Obligation:
mainModule Main 
module Maybe where {
import qualified Main;
import qualified Prelude;
fromMaybe :: a  ->  Maybe a  ->  a;
fromMaybe d x = fromMaybe0 d x;

fromMaybe0 d Nothing = d;
fromMaybe0 d (Just v) = v;

}
module Main where {
import qualified Maybe;
import qualified Prelude;

popout

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

job log

popout

actions all output return to Funct Progr 77531