Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell 2019-04-01 06.52 pair #433315866
details
property
value
status
complete
benchmark
List_elemIndices_6.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n097.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
5.32173 seconds
cpu usage
14.2712
user time
13.9162
system time
0.354993
max virtual memory
1.8285568E7
max residence set size
746940.0
stage attributes
key
value
starexec-result
YES
output
11.47/4.54 YES 13.99/5.27 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 13.99/5.27 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 13.99/5.27 13.99/5.27 13.99/5.27 H-Termination with start terms of the given HASKELL could be proven: 13.99/5.27 13.99/5.27 (0) HASKELL 13.99/5.27 (1) LR [EQUIVALENT, 0 ms] 13.99/5.27 (2) HASKELL 13.99/5.27 (3) CR [EQUIVALENT, 0 ms] 13.99/5.27 (4) HASKELL 13.99/5.27 (5) IFR [EQUIVALENT, 0 ms] 13.99/5.27 (6) HASKELL 13.99/5.27 (7) BR [EQUIVALENT, 0 ms] 13.99/5.27 (8) HASKELL 13.99/5.27 (9) COR [EQUIVALENT, 13 ms] 13.99/5.27 (10) HASKELL 13.99/5.27 (11) NumRed [SOUND, 0 ms] 13.99/5.27 (12) HASKELL 13.99/5.27 (13) Narrow [SOUND, 0 ms] 13.99/5.27 (14) AND 13.99/5.27 (15) QDP 13.99/5.27 (16) QDPSizeChangeProof [EQUIVALENT, 0 ms] 13.99/5.27 (17) YES 13.99/5.27 (18) QDP 13.99/5.27 (19) QDPSizeChangeProof [EQUIVALENT, 0 ms] 13.99/5.27 (20) YES 13.99/5.27 13.99/5.27 13.99/5.27 ---------------------------------------- 13.99/5.27 13.99/5.27 (0) 13.99/5.27 Obligation: 13.99/5.27 mainModule Main 13.99/5.27 module Maybe where { 13.99/5.27 import qualified List; 13.99/5.27 import qualified Main; 13.99/5.27 import qualified Prelude; 13.99/5.27 } 13.99/5.27 module List where { 13.99/5.27 import qualified Main; 13.99/5.27 import qualified Maybe; 13.99/5.27 import qualified Prelude; 13.99/5.27 elemIndices :: Eq a => a -> [a] -> [Int]; 13.99/5.27 elemIndices x = findIndices (== x); 13.99/5.27 13.99/5.27 findIndices :: (a -> Bool) -> [a] -> [Int]; 13.99/5.27 findIndices p xs = concatMap (\vv1 ->case vv1 of { 13.99/5.27 (x,i)-> if p x then i : [] else []; 13.99/5.27 _-> []; 13.99/5.27 } ) (zip xs (enumFrom 0)); 13.99/5.27 13.99/5.27 } 13.99/5.27 module Main where { 13.99/5.27 import qualified List; 13.99/5.27 import qualified Maybe; 13.99/5.27 import qualified Prelude; 13.99/5.27 } 13.99/5.27 13.99/5.27 ---------------------------------------- 13.99/5.27 13.99/5.27 (1) LR (EQUIVALENT) 13.99/5.27 Lambda Reductions: 13.99/5.27 The following Lambda expression 13.99/5.27 "\ab->(a,b)" 13.99/5.27 is transformed to 13.99/5.27 "zip0 a b = (a,b); 13.99/5.27 " 13.99/5.27 The following Lambda expression 13.99/5.27 "\vv1->case vv1 of { 13.99/5.27 (x,i) -> if p x then i : [] else []; 13.99/5.27 _ -> []} 13.99/5.27 " 13.99/5.27 is transformed to 13.99/5.27 "findIndices0 p vv1 = case vv1 of { 13.99/5.27 (x,i) -> if p x then i : [] else []; 13.99/5.27 _ -> []} 13.99/5.27 ; 13.99/5.27 " 13.99/5.27 13.99/5.27 ---------------------------------------- 13.99/5.27 13.99/5.27 (2) 13.99/5.27 Obligation: 13.99/5.27 mainModule Main 13.99/5.27 module Maybe where { 13.99/5.27 import qualified List; 13.99/5.27 import qualified Main; 13.99/5.27 import qualified Prelude; 13.99/5.27 } 13.99/5.27 module List where { 13.99/5.27 import qualified Main; 13.99/5.27 import qualified Maybe; 13.99/5.27 import qualified Prelude; 13.99/5.27 elemIndices :: Eq a => a -> [a] -> [Int]; 13.99/5.27 elemIndices x = findIndices (== x); 13.99/5.27 13.99/5.27 findIndices :: (a -> Bool) -> [a] -> [Int]; 13.99/5.27 findIndices p xs = concatMap (findIndices0 p) (zip xs (enumFrom 0));
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell 2019-04-01 06.52