details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	9.72921 seconds
cpu usage	21.5968
user time	20.9333
system time	0.663438
max virtual memory	1.8285568E7
max residence set size	1686440.0

stage attributes

key	value
starexec-result	YES

output

18.80/8.96 YES 21.45/9.63 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 21.45/9.63 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 21.45/9.63 21.45/9.63 21.45/9.63 H-Termination with start terms of the given HASKELL could be proven: 21.45/9.63 21.45/9.63 (0) HASKELL 21.45/9.63 (1) IFR [EQUIVALENT, 0 ms] 21.45/9.63 (2) HASKELL 21.45/9.63 (3) BR [EQUIVALENT, 0 ms] 21.45/9.63 (4) HASKELL 21.45/9.63 (5) COR [EQUIVALENT, 23 ms] 21.45/9.63 (6) HASKELL 21.45/9.63 (7) LetRed [EQUIVALENT, 0 ms] 21.45/9.63 (8) HASKELL 21.45/9.63 (9) Narrow [SOUND, 0 ms] 21.45/9.63 (10) AND 21.45/9.63 (11) QDP 21.45/9.63 (12) QDPSizeChangeProof [EQUIVALENT, 0 ms] 21.45/9.63 (13) YES 21.45/9.63 (14) QDP 21.45/9.63 (15) QDPSizeChangeProof [EQUIVALENT, 0 ms] 21.45/9.63 (16) YES 21.45/9.63 (17) QDP 21.45/9.63 (18) DependencyGraphProof [EQUIVALENT, 0 ms] 21.45/9.63 (19) QDP 21.45/9.63 (20) TransformationProof [EQUIVALENT, 0 ms] 21.45/9.63 (21) QDP 21.45/9.63 (22) QDPSizeChangeProof [EQUIVALENT, 0 ms] 21.45/9.63 (23) YES 21.45/9.63 (24) QDP 21.45/9.63 (25) TransformationProof [EQUIVALENT, 0 ms] 21.45/9.63 (26) QDP 21.45/9.63 (27) UsableRulesProof [EQUIVALENT, 0 ms] 21.45/9.63 (28) QDP 21.45/9.63 (29) QReductionProof [EQUIVALENT, 0 ms] 21.45/9.63 (30) QDP 21.45/9.63 (31) QDPSizeChangeProof [EQUIVALENT, 0 ms] 21.45/9.63 (32) YES 21.45/9.63 (33) QDP 21.45/9.63 (34) QDPSizeChangeProof [EQUIVALENT, 0 ms] 21.45/9.63 (35) YES 21.45/9.63 21.45/9.63 21.45/9.63 ---------------------------------------- 21.45/9.63 21.45/9.63 (0) 21.45/9.63 Obligation: 21.45/9.63 mainModule Main 21.45/9.63 module Maybe where { 21.45/9.63 import qualified List; 21.45/9.63 import qualified Main; 21.45/9.63 import qualified Prelude; 21.45/9.63 } 21.45/9.63 module List where { 21.45/9.63 import qualified Main; 21.45/9.63 import qualified Maybe; 21.45/9.63 import qualified Prelude; 21.45/9.63 deleteBy :: (a -> a -> Bool) -> a -> [a] -> [a]; 21.45/9.63 deleteBy _ _ [] = []; 21.45/9.63 deleteBy eq x (y : ys) = if x `eq` y then ys else y : deleteBy eq x ys; 21.45/9.63 21.45/9.63 elem_by :: (a -> a -> Bool) -> a -> [a] -> Bool; 21.45/9.63 elem_by _ _ [] = False; 21.45/9.63 elem_by eq y (x : xs) = x `eq` y || elem_by eq y xs; 21.45/9.63 21.45/9.63 nubBy :: (a -> a -> Bool) -> [a] -> [a]; 21.45/9.63 nubBy eq l = nubBy' l [] where { 21.45/9.63 nubBy' [] _ = []; 21.45/9.63 nubBy' (y : ys) xs | elem_by eq y xs = nubBy' ys xs 21.45/9.63 | otherwise = y : nubBy' ys (y : xs); 21.45/9.63 }; 21.45/9.63 21.45/9.63 union :: Eq a => [a] -> [a] -> [a]; 21.45/9.63 union = unionBy (==); 21.45/9.63 21.45/9.63 unionBy :: (a -> a -> Bool) -> [a] -> [a] -> [a]; 21.45/9.63 unionBy eq xs ys = xs ++ foldl (flip (deleteBy eq)) (nubBy eq ys) xs; 21.45/9.63 21.45/9.63 } 21.45/9.63 module Main where { 21.45/9.63 import qualified List; 21.45/9.63 import qualified Maybe; 21.45/9.63 import qualified Prelude; 21.45/9.63 } 21.45/9.63 21.45/9.63 ---------------------------------------- 21.45/9.63 21.45/9.63 (1) IFR (EQUIVALENT) 21.45/9.63 If Reductions: 21.45/9.63 The following If expression 21.45/9.63 "if eq x y then ys else y : deleteBy eq x ys" 21.45/9.63 is transformed to 21.45/9.63 "deleteBy0 ys y eq x True = ys; 21.45/9.63 deleteBy0 ys y eq x False = y : deleteBy eq x ys; 21.45/9.63 " 21.45/9.63 21.45/9.63 ---------------------------------------- 21.45/9.63 popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52