details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	8.45725 seconds
cpu usage	19.8961
user time	19.3099
system time	0.586148
max virtual memory	1.8285568E7
max residence set size	1562792.0

stage attributes

key	value
starexec-result	YES

output

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

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52