details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	9.4265 seconds
cpu usage	12.4029
user time	12.0232
system time	0.379709
max virtual memory	1.8285568E7
max residence set size	714424.0

stage attributes

key	value
starexec-result	YES

output

9.87/4.34 YES 12.27/4.98 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 12.27/4.98 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 12.27/4.98 12.27/4.98 12.27/4.98 H-Termination with start terms of the given HASKELL could be proven: 12.27/4.98 12.27/4.98 (0) HASKELL 12.27/4.98 (1) LR [EQUIVALENT, 0 ms] 12.27/4.98 (2) HASKELL 12.27/4.98 (3) CR [EQUIVALENT, 0 ms] 12.27/4.98 (4) HASKELL 12.27/4.98 (5) IFR [EQUIVALENT, 0 ms] 12.27/4.98 (6) HASKELL 12.27/4.98 (7) BR [EQUIVALENT, 0 ms] 12.27/4.98 (8) HASKELL 12.27/4.98 (9) COR [EQUIVALENT, 28 ms] 12.27/4.98 (10) HASKELL 12.27/4.98 (11) Narrow [SOUND, 0 ms] 12.27/4.98 (12) AND 12.27/4.98 (13) QDP 12.27/4.98 (14) DependencyGraphProof [EQUIVALENT, 0 ms] 12.27/4.98 (15) AND 12.27/4.98 (16) QDP 12.27/4.98 (17) QDPSizeChangeProof [EQUIVALENT, 0 ms] 12.27/4.98 (18) YES 12.27/4.98 (19) QDP 12.27/4.98 (20) QDPSizeChangeProof [EQUIVALENT, 0 ms] 12.27/4.98 (21) YES 12.27/4.98 (22) QDP 12.27/4.98 (23) QDPSizeChangeProof [EQUIVALENT, 0 ms] 12.27/4.98 (24) YES 12.27/4.98 12.27/4.98 12.27/4.98 ---------------------------------------- 12.27/4.98 12.27/4.98 (0) 12.27/4.98 Obligation: 12.27/4.98 mainModule Main 12.27/4.98 module Maybe where { 12.27/4.98 import qualified List; 12.27/4.98 import qualified Main; 12.27/4.98 import qualified Prelude; 12.27/4.98 } 12.27/4.98 module List where { 12.27/4.98 import qualified Main; 12.27/4.98 import qualified Maybe; 12.27/4.98 import qualified Prelude; 12.27/4.98 intersect :: Eq a => [a] -> [a] -> [a]; 12.27/4.98 intersect = intersectBy (==); 12.27/4.98 12.27/4.98 intersectBy :: (a -> a -> Bool) -> [a] -> [a] -> [a]; 12.27/4.98 intersectBy eq xs ys = concatMap (\vv2 ->case vv2 of { 12.27/4.98 x-> if any (eq x) ys then x : [] else []; 12.27/4.98 _-> []; 12.27/4.98 } ) xs; 12.27/4.98 12.27/4.98 } 12.27/4.98 module Main where { 12.27/4.98 import qualified List; 12.27/4.98 import qualified Maybe; 12.27/4.98 import qualified Prelude; 12.27/4.98 } 12.27/4.98 12.27/4.98 ---------------------------------------- 12.27/4.98 12.27/4.98 (1) LR (EQUIVALENT) 12.27/4.98 Lambda Reductions: 12.27/4.98 The following Lambda expression 12.27/4.98 "\vv2->case vv2 of { 12.27/4.98 x -> if any (eq x) ys then x : [] else []; 12.27/4.98 _ -> []} 12.27/4.98 " 12.27/4.98 is transformed to 12.27/4.98 "intersectBy0 eq ys vv2 = case vv2 of { 12.27/4.98 x -> if any (eq x) ys then x : [] else []; 12.27/4.98 _ -> []} 12.27/4.98 ; 12.27/4.98 " 12.27/4.98 12.27/4.98 ---------------------------------------- 12.27/4.98 12.27/4.98 (2) 12.27/4.98 Obligation: 12.27/4.98 mainModule Main 12.27/4.98 module Maybe where { 12.27/4.98 import qualified List; 12.27/4.98 import qualified Main; 12.27/4.98 import qualified Prelude; 12.27/4.98 } 12.27/4.98 module List where { 12.27/4.98 import qualified Main; 12.27/4.98 import qualified Maybe; 12.27/4.98 import qualified Prelude; 12.27/4.98 intersect :: Eq a => [a] -> [a] -> [a]; 12.27/4.98 intersect = intersectBy (==); 12.27/4.98 12.27/4.98 intersectBy :: (a -> a -> Bool) -> [a] -> [a] -> [a]; 12.27/4.98 intersectBy eq xs ys = concatMap (intersectBy0 eq ys) xs; 12.27/4.98 popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52