details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	6.59804201126 seconds
cpu usage	12.369816222
max memory	6.37796352E8

stage attributes

key	value
output-size	21220
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) LR [EQUIVALENT, 0 ms] (2) HASKELL (3) BR [EQUIVALENT, 0 ms] (4) HASKELL (5) COR [EQUIVALENT, 0 ms] (6) HASKELL (7) LetRed [EQUIVALENT, 4 ms] (8) HASKELL (9) NumRed [SOUND, 0 ms] (10) HASKELL (11) Narrow [SOUND, 0 ms] (12) QDP (13) QDPSizeChangeProof [EQUIVALENT, 0 ms] (14) 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; replicateM :: Monad b => Int -> b a -> b [a]; replicateM n x = sequence (replicate n x); } ---------------------------------------- (1) LR (EQUIVALENT) Lambda Reductions: The following Lambda expression "\xs->return (x : xs)" is transformed to "sequence0 x xs = return (x : xs); " The following Lambda expression "\x->sequence cs >>= sequence0 x" is transformed to "sequence1 cs x = sequence cs >>= sequence0 x; " ---------------------------------------- (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; replicateM :: Monad b => Int -> b a -> b [a]; replicateM n x = sequence (replicate n x); } ---------------------------------------- (3) BR (EQUIVALENT) Replaced joker patterns by fresh variables and removed binding patterns. ---------------------------------------- (4) popout

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

job log

popout

actions

all output return to Haskell