details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	6.28798 seconds
cpu usage	16.2371
user time	15.7985
system time	0.4386
max virtual memory	1.8286E7
max residence set size	996788.0

stage attributes

key	value
starexec-result	YES

output

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

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52