Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell 2019-04-01 06.52 pair #433316069
details
property
value
status
complete
benchmark
List_union_4.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n041.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
7.35794 seconds
cpu usage
19.388
user time
18.7218
system time
0.666225
max virtual memory
1.8285568E7
max residence set size
2034092.0
stage attributes
key
value
starexec-result
YES
output
16.33/6.49 YES 19.06/7.20 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 19.06/7.20 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 19.06/7.20 19.06/7.20 19.06/7.20 H-Termination with start terms of the given HASKELL could be proven: 19.06/7.20 19.06/7.20 (0) HASKELL 19.06/7.20 (1) IFR [EQUIVALENT, 0 ms] 19.06/7.20 (2) HASKELL 19.06/7.20 (3) BR [EQUIVALENT, 0 ms] 19.06/7.20 (4) HASKELL 19.06/7.20 (5) COR [EQUIVALENT, 8 ms] 19.06/7.20 (6) HASKELL 19.06/7.20 (7) LetRed [EQUIVALENT, 0 ms] 19.06/7.20 (8) HASKELL 19.06/7.20 (9) Narrow [SOUND, 0 ms] 19.06/7.20 (10) AND 19.06/7.20 (11) QDP 19.06/7.20 (12) DependencyGraphProof [EQUIVALENT, 0 ms] 19.06/7.20 (13) AND 19.06/7.20 (14) QDP 19.06/7.20 (15) QDPSizeChangeProof [EQUIVALENT, 0 ms] 19.06/7.20 (16) YES 19.06/7.20 (17) QDP 19.06/7.20 (18) QDPSizeChangeProof [EQUIVALENT, 0 ms] 19.06/7.20 (19) YES 19.06/7.20 (20) QDP 19.06/7.20 (21) QDPSizeChangeProof [EQUIVALENT, 0 ms] 19.06/7.20 (22) YES 19.06/7.20 (23) QDP 19.06/7.20 (24) QDPSizeChangeProof [EQUIVALENT, 0 ms] 19.06/7.20 (25) YES 19.06/7.20 (26) QDP 19.06/7.20 (27) QDPSizeChangeProof [EQUIVALENT, 0 ms] 19.06/7.20 (28) YES 19.06/7.20 (29) QDP 19.06/7.20 (30) QDPSizeChangeProof [EQUIVALENT, 0 ms] 19.06/7.20 (31) YES 19.06/7.20 (32) QDP 19.06/7.20 (33) QDPSizeChangeProof [EQUIVALENT, 0 ms] 19.06/7.20 (34) YES 19.06/7.20 (35) QDP 19.06/7.20 (36) QDPSizeChangeProof [EQUIVALENT, 0 ms] 19.06/7.20 (37) YES 19.06/7.20 (38) QDP 19.06/7.20 (39) QDPSizeChangeProof [EQUIVALENT, 0 ms] 19.06/7.20 (40) YES 19.06/7.20 19.06/7.20 19.06/7.20 ---------------------------------------- 19.06/7.20 19.06/7.20 (0) 19.06/7.20 Obligation: 19.06/7.20 mainModule Main 19.06/7.20 module Maybe where { 19.06/7.20 import qualified List; 19.06/7.20 import qualified Main; 19.06/7.20 import qualified Prelude; 19.06/7.20 } 19.06/7.20 module List where { 19.06/7.20 import qualified Main; 19.06/7.20 import qualified Maybe; 19.06/7.20 import qualified Prelude; 19.06/7.20 deleteBy :: (a -> a -> Bool) -> a -> [a] -> [a]; 19.06/7.20 deleteBy _ _ [] = []; 19.06/7.20 deleteBy eq x (y : ys) = if x `eq` y then ys else y : deleteBy eq x ys; 19.06/7.20 19.06/7.20 elem_by :: (a -> a -> Bool) -> a -> [a] -> Bool; 19.06/7.20 elem_by _ _ [] = False; 19.06/7.20 elem_by eq y (x : xs) = x `eq` y || elem_by eq y xs; 19.06/7.20 19.06/7.20 nubBy :: (a -> a -> Bool) -> [a] -> [a]; 19.06/7.20 nubBy eq l = nubBy' l [] where { 19.06/7.20 nubBy' [] _ = []; 19.06/7.20 nubBy' (y : ys) xs | elem_by eq y xs = nubBy' ys xs 19.06/7.20 | otherwise = y : nubBy' ys (y : xs); 19.06/7.20 }; 19.06/7.20 19.06/7.20 union :: Eq a => [a] -> [a] -> [a]; 19.06/7.20 union = unionBy (==); 19.06/7.20 19.06/7.20 unionBy :: (a -> a -> Bool) -> [a] -> [a] -> [a]; 19.06/7.20 unionBy eq xs ys = xs ++ foldl (flip (deleteBy eq)) (nubBy eq ys) xs; 19.06/7.20 19.06/7.20 } 19.06/7.20 module Main where { 19.06/7.20 import qualified List; 19.06/7.20 import qualified Maybe; 19.06/7.20 import qualified Prelude; 19.06/7.20 } 19.06/7.20 19.06/7.20 ---------------------------------------- 19.06/7.20 19.06/7.20 (1) IFR (EQUIVALENT) 19.06/7.20 If Reductions: 19.06/7.20 The following If expression 19.06/7.20 "if eq x y then ys else y : deleteBy eq x ys" 19.06/7.20 is transformed to 19.06/7.20 "deleteBy0 ys y eq x True = ys;
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell 2019-04-01 06.52