details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	6.12514 seconds
cpu usage	15.9041
user time	15.4525
system time	0.451604
max virtual memory	1.8285568E7
max residence set size	1139020.0

stage attributes

key	value
starexec-result	YES

output

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

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52