details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.53389 seconds
cpu usage	14.633
user time	14.2558
system time	0.377184
max virtual memory	1.8288476E7
max residence set size	793084.0

stage attributes

key	value
starexec-result	YES

output

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

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52