Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487598579
details
property
value
status
complete
benchmark
Queue_deQueue_1.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n101.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.17231893539 seconds
cpu usage
10.296369606
max memory
5.6768512E8
stage attributes
key
value
output-size
13068
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) BR [EQUIVALENT, 0 ms] (2) HASKELL (3) COR [EQUIVALENT, 0 ms] (4) HASKELL (5) Narrow [SOUND, 0 ms] (6) QDP (7) QDPSizeChangeProof [EQUIVALENT, 0 ms] (8) YES ---------------------------------------- (0) Obligation: mainModule Main module Main where { import qualified Prelude; import qualified Queue; } module Queue where { import qualified Main; import qualified Prelude; data Queue a = Q [a] [a] [a] ; deQueue :: Queue a -> Maybe (a,Queue a); deQueue (Q [] _ _) = Nothing; deQueue (Q (x : xs) ys xs') = Just (x,makeQ xs ys xs'); listToQueue :: [a] -> Queue a; listToQueue xs = Q xs [] xs; makeQ :: [a] -> [a] -> [a] -> Queue a; makeQ xs ys [] = listToQueue (rotate xs ys []); makeQ xs ys (_ : xs') = Q xs ys xs'; rotate :: [a] -> [a] -> [a] -> [a]; rotate [] (y : _) zs = y : zs; rotate (x : xs) (y : ys) zs = x : rotate xs ys (y : zs); } ---------------------------------------- (1) BR (EQUIVALENT) Replaced joker patterns by fresh variables and removed binding patterns. ---------------------------------------- (2) Obligation: mainModule Main module Main where { import qualified Prelude; import qualified Queue; } module Queue where { import qualified Main; import qualified Prelude; data Queue a = Q [a] [a] [a] ; deQueue :: Queue a -> Maybe (a,Queue a); deQueue (Q [] vy vz) = Nothing; deQueue (Q (x : xs) ys xs') = Just (x,makeQ xs ys xs'); listToQueue :: [a] -> Queue a; listToQueue xs = Q xs [] xs; makeQ :: [a] -> [a] -> [a] -> Queue a; makeQ xs ys [] = listToQueue (rotate xs ys []); makeQ xs ys (wu : xs') = Q xs ys xs'; rotate :: [a] -> [a] -> [a] -> [a]; rotate [] (y : vx) zs = y : zs; rotate (x : xs) (y : ys) zs = x : rotate xs ys (y : zs); } ---------------------------------------- (3) COR (EQUIVALENT) Cond Reductions: The following Function with conditions "undefined |Falseundefined; " is transformed to "undefined = undefined1; "
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell