Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487599403
details
property
value
status
complete
benchmark
List_nub_8.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n140.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
131.406704903 seconds
cpu usage
160.004106117
max memory
5.639892992E9
stage attributes
key
value
output-size
4788
starexec-result
MAYBE
output
/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.hs /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE proof of /export/starexec/sandbox2/benchmark/theBenchmark.hs # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty H-Termination with start terms of the given HASKELL could not be shown: (0) HASKELL (1) BR [EQUIVALENT, 0 ms] (2) HASKELL (3) COR [EQUIVALENT, 16 ms] (4) HASKELL (5) LetRed [EQUIVALENT, 0 ms] (6) HASKELL ---------------------------------------- (0) Obligation: mainModule Main module Maybe where { import qualified List; import qualified Main; import qualified Prelude; } module List where { import qualified Main; import qualified Maybe; import qualified Prelude; nub :: Eq a => [a] -> [a]; nub l = nub' l [] where { nub' [] _ = []; nub' (x : xs) ls | x `elem` ls = nub' xs ls | otherwise = x : nub' xs (x : ls); }; } module Main where { import qualified List; import qualified Maybe; import qualified Prelude; } ---------------------------------------- (1) BR (EQUIVALENT) Replaced joker patterns by fresh variables and removed binding patterns. ---------------------------------------- (2) Obligation: mainModule Main module Maybe where { import qualified List; import qualified Main; import qualified Prelude; } module List where { import qualified Main; import qualified Maybe; import qualified Prelude; nub :: Eq a => [a] -> [a]; nub l = nub' l [] where { nub' [] wu = []; nub' (x : xs) ls | x `elem` ls = nub' xs ls | otherwise = x : nub' xs (x : ls); }; } module Main where { import qualified List; import qualified Maybe; import qualified Prelude; } ---------------------------------------- (3) COR (EQUIVALENT) Cond Reductions: The following Function with conditions "undefined |Falseundefined; " is transformed to "undefined = undefined1; " "undefined0 True = undefined; " "undefined1 = undefined0 False; " The following Function with conditions "nub' [] wu = []; nub' (x : xs) ls|x `elem` lsnub' xs ls|otherwisex : nub' xs (x : ls); "
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell