Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Funct Progr 77531 pair #381920802
details
property
value
status
complete
benchmark
Monad_ap_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)
4.44573187828 seconds
cpu usage
11.572359135
max memory
6.46279168E8
stage attributes
key
value
output-size
22787
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) LR [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) AND (9) QDP (10) QDPSizeChangeProof [EQUIVALENT, 0 ms] (11) YES (12) QDP (13) QDPSizeChangeProof [EQUIVALENT, 0 ms] (14) YES (15) QDP (16) QDPSizeChangeProof [EQUIVALENT, 0 ms] (17) YES ---------------------------------------- (0) Obligation: mainModule Main module Maybe where { import qualified Main; import qualified Monad; import qualified Prelude; } module Main where { import qualified Maybe; import qualified Monad; import qualified Prelude; } module Monad where { import qualified Main; import qualified Maybe; import qualified Prelude; ap :: Monad b => b (a -> c) -> b a -> b c; ap = liftM2 id; liftM2 :: Monad d => (c -> b -> a) -> d c -> d b -> d a; liftM2 f m1 m2 = m1 >>= (\x1 ->m2 >>= (\x2 ->return (f x1 x2))); } ---------------------------------------- (1) LR (EQUIVALENT) Lambda Reductions: The following Lambda expression "\x2->return (f x1 x2)" is transformed to "liftM20 f x1 x2 = return (f x1 x2); " The following Lambda expression "\x1->m2 >>= liftM20 f x1" is transformed to "liftM21 m2 f x1 = m2 >>= liftM20 f x1; " ---------------------------------------- (2) Obligation: mainModule Main module Maybe where { import qualified Main; import qualified Monad; import qualified Prelude; } module Main where { import qualified Maybe; import qualified Monad; import qualified Prelude; } module Monad where { import qualified Main; import qualified Maybe; import qualified Prelude; ap :: Monad b => b (c -> a) -> b c -> b a; ap = liftM2 id; liftM2 :: Monad c => (d -> b -> a) -> c d -> c b -> c a; liftM2 f m1 m2 = m1 >>= liftM21 m2 f;
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Funct Progr 77531