Funct Progr 77531 pair #381920622

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.2052090168 seconds
cpu usage	13.46753861
max memory	7.30906624E8

stage attributes

key	value
output-size	30871
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.hs /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


YES
proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


H-Termination with start terms of the given HASKELL could be proven:

(0) HASKELL
(1) LR [EQUIVALENT, 0 ms]
(2) HASKELL
(3) CR [EQUIVALENT, 0 ms]
(4) HASKELL
(5) IFR [EQUIVALENT, 0 ms]
(6) HASKELL
(7) BR [EQUIVALENT, 0 ms]
(8) HASKELL
(9) COR [EQUIVALENT, 14 ms]
(10) HASKELL
(11) NumRed [SOUND, 0 ms]
(12) HASKELL
(13) Narrow [SOUND, 0 ms]
(14) QDP
(15) QDPSizeChangeProof [EQUIVALENT, 0 ms]
(16) YES


----------------------------------------

(0)
Obligation:
mainModule Main 
module Maybe where {
import qualified List;
import qualified Main;
import qualified Prelude;
listToMaybe :: [a]  ->  Maybe a;
listToMaybe [] = Nothing;
listToMaybe (a : _) = Just a;

}
module List where {
import qualified Main;
import qualified Maybe;
import qualified Prelude;
findIndex :: (a  ->  Bool)  ->  [a]  ->  Maybe Int;
findIndex p = Maybe.listToMaybe . findIndices p;

findIndices :: (a  ->  Bool)  ->  [a]  ->  [Int];
findIndices p xs = concatMap (\vv1 ->case vv1 of { 
(x,i)->  if p x then i : [] else []; 
_-> []; 
 } ) (zip xs (enumFrom 0));

}
module Main where {
import qualified List;
import qualified Maybe;
import qualified Prelude;
}

----------------------------------------

(1) LR (EQUIVALENT)
Lambda Reductions:
The following Lambda expression
"\ab->(a,b)"
is transformed to
"zip0 a b = (a,b);
"
The following Lambda expression
"\vv1->case vv1 of {
(x,i)  -> if p x then i : [] else [];
_  -> []}
"
is transformed to
"findIndices0 p vv1 = case vv1 of {
(x,i)  -> if p x then i : [] else [];
_  -> []}
;
"

----------------------------------------

(2)
Obligation:
mainModule Main 
module Maybe where {
import qualified List;
import qualified Main;
import qualified Prelude;
listToMaybe :: [a]  ->  Maybe a;
listToMaybe [] = Nothing;
listToMaybe (a : _) = Just a;

popout

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

job log

popout

actions all output return to Funct Progr 77531