details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.37394 seconds
cpu usage	13.8334
user time	13.4406
system time	0.39288
max virtual memory	1.8285568E7
max residence set size	756800.0

stage attributes

key	value
starexec-result	YES

output

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

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52