details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	6.78584 seconds
cpu usage	17.9694
user time	17.4003
system time	0.569106
max virtual memory	1.8285568E7
max residence set size	1453412.0

stage attributes

key	value
starexec-result	YES

output

14.81/5.93 YES 17.72/6.71 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 17.72/6.71 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 17.72/6.71 17.72/6.71 17.72/6.71 H-Termination with start terms of the given HASKELL could be proven: 17.72/6.71 17.72/6.71 (0) HASKELL 17.72/6.71 (1) LR [EQUIVALENT, 0 ms] 17.72/6.71 (2) HASKELL 17.72/6.71 (3) CR [EQUIVALENT, 0 ms] 17.72/6.71 (4) HASKELL 17.72/6.71 (5) IFR [EQUIVALENT, 0 ms] 17.72/6.71 (6) HASKELL 17.72/6.71 (7) BR [EQUIVALENT, 0 ms] 17.72/6.71 (8) HASKELL 17.72/6.71 (9) COR [EQUIVALENT, 12 ms] 17.72/6.71 (10) HASKELL 17.72/6.71 (11) NumRed [SOUND, 0 ms] 17.72/6.71 (12) HASKELL 17.72/6.71 (13) Narrow [SOUND, 0 ms] 17.72/6.71 (14) AND 17.72/6.71 (15) QDP 17.72/6.71 (16) QDPSizeChangeProof [EQUIVALENT, 0 ms] 17.72/6.71 (17) YES 17.72/6.71 (18) QDP 17.72/6.71 (19) QDPSizeChangeProof [EQUIVALENT, 22 ms] 17.72/6.71 (20) YES 17.72/6.71 (21) QDP 17.72/6.71 (22) QDPSizeChangeProof [EQUIVALENT, 0 ms] 17.72/6.71 (23) YES 17.72/6.71 (24) QDP 17.72/6.71 (25) QDPSizeChangeProof [EQUIVALENT, 0 ms] 17.72/6.71 (26) YES 17.72/6.71 (27) QDP 17.72/6.71 (28) QDPSizeChangeProof [EQUIVALENT, 0 ms] 17.72/6.71 (29) YES 17.72/6.71 (30) QDP 17.72/6.71 (31) QDPSizeChangeProof [EQUIVALENT, 0 ms] 17.72/6.71 (32) YES 17.72/6.71 17.72/6.71 17.72/6.71 ---------------------------------------- 17.72/6.71 17.72/6.71 (0) 17.72/6.71 Obligation: 17.72/6.71 mainModule Main 17.72/6.71 module Maybe where { 17.72/6.71 import qualified List; 17.72/6.71 import qualified Main; 17.72/6.71 import qualified Prelude; 17.72/6.71 listToMaybe :: [a] -> Maybe a; 17.72/6.71 listToMaybe [] = Nothing; 17.72/6.71 listToMaybe (a : _) = Just a; 17.72/6.71 17.72/6.71 } 17.72/6.71 module List where { 17.72/6.71 import qualified Main; 17.72/6.71 import qualified Maybe; 17.72/6.71 import qualified Prelude; 17.72/6.71 elemIndex :: Eq a => a -> [a] -> Maybe Int; 17.72/6.71 elemIndex x = findIndex (== x); 17.72/6.71 17.72/6.71 findIndex :: (a -> Bool) -> [a] -> Maybe Int; 17.72/6.71 findIndex p = Maybe.listToMaybe . findIndices p; 17.72/6.71 17.72/6.71 findIndices :: (a -> Bool) -> [a] -> [Int]; 17.72/6.71 findIndices p xs = concatMap (\vv1 ->case vv1 of { 17.72/6.71 (x,i)-> if p x then i : [] else []; 17.72/6.71 _-> []; 17.72/6.71 } ) (zip xs (enumFrom 0)); 17.72/6.71 17.72/6.71 } 17.72/6.71 module Main where { 17.72/6.71 import qualified List; 17.72/6.71 import qualified Maybe; 17.72/6.71 import qualified Prelude; 17.72/6.71 } 17.72/6.71 17.72/6.71 ---------------------------------------- 17.72/6.71 17.72/6.71 (1) LR (EQUIVALENT) 17.72/6.71 Lambda Reductions: 17.72/6.71 The following Lambda expression 17.72/6.71 "\ab->(a,b)" 17.72/6.71 is transformed to 17.72/6.71 "zip0 a b = (a,b); 17.72/6.71 " 17.72/6.71 The following Lambda expression 17.72/6.71 "\vv1->case vv1 of { 17.72/6.71 (x,i) -> if p x then i : [] else []; 17.72/6.71 _ -> []} 17.72/6.71 " 17.72/6.71 is transformed to 17.72/6.71 "findIndices0 p vv1 = case vv1 of { 17.72/6.71 (x,i) -> if p x then i : [] else []; 17.72/6.71 _ -> []} 17.72/6.71 ; 17.72/6.71 " 17.72/6.71 popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52