Funct Progr 77531 pair #381921102

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	6.65846300125 seconds
cpu usage	17.81893078
max memory	1.053659136E9

stage attributes

key	value
output-size	225505
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, 23 ms]
(10) HASKELL
(11) Narrow [SOUND, 0 ms]
(12) AND
    (13) QDP
        (14) DependencyGraphProof [EQUIVALENT, 0 ms]
        (15) AND
            (16) QDP
                (17) QDPSizeChangeProof [EQUIVALENT, 0 ms]
                (18) YES
            (19) QDP
                (20) QDPSizeChangeProof [EQUIVALENT, 0 ms]
                (21) YES
            (22) QDP
                (23) QDPSizeChangeProof [EQUIVALENT, 0 ms]
                (24) YES
            (25) QDP
                (26) QDPSizeChangeProof [EQUIVALENT, 0 ms]
                (27) YES
    (28) QDP
        (29) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (30) YES


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

(0)
Obligation:
mainModule Main 
module Maybe where {
import qualified List;
import qualified Main;
import qualified Prelude;
}
module List where {
import qualified Main;
import qualified Maybe;
import qualified Prelude;
intersect :: Eq a => [a]  ->  [a]  ->  [a];
intersect = intersectBy (==);

intersectBy :: (a  ->  a  ->  Bool)  ->  [a]  ->  [a]  ->  [a];
intersectBy eq xs ys = concatMap (\vv2 ->case vv2 of { 
x->  if any (eq x) ys then x : [] else []; 
_-> []; 
 } ) xs;

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

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

(1) LR (EQUIVALENT)
Lambda Reductions:
The following Lambda expression
"\vv2->case vv2 of {
x  -> if any (eq x) ys then x : [] else [];
_  -> []}
"
is transformed to
"intersectBy0 eq ys vv2 = case vv2 of {
x  -> if any (eq x) ys then x : [] else [];
_  -> []}
;
"

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

(2)
Obligation:
mainModule Main 
module Maybe where {
import qualified List;
import qualified Main;

popout

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

job log

popout

actions all output return to Funct Progr 77531