Funct Progr 77531 pair #381921025

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.01592683792 seconds
cpu usage	12.984684324
max memory	6.87566848E8

stage attributes

key	value
output-size	19244
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) BR [EQUIVALENT, 0 ms]
(6) HASKELL
(7) COR [EQUIVALENT, 0 ms]
(8) HASKELL
(9) Narrow [SOUND, 0 ms]
(10) AND
    (11) QDP
        (12) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (13) YES
    (14) QDP
        (15) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (16) YES
    (17) QDP
        (18) QDPSizeChangeProof [EQUIVALENT, 27 ms]
        (19) 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;
transpose :: [[a]]  ->  [[a]];
transpose [] = [];
transpose ([] : xss) = transpose xss;
transpose ((x : xs) : xss) = (x : concatMap (\vv3 ->case vv3 of { 
h : t-> h : []; 
_-> []; 
 } ) xss) : transpose (xs : concatMap (\vv4 ->case vv4 of { 
h : t-> t : []; 
_-> []; 
 } ) xss);

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

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

(1) LR (EQUIVALENT)
Lambda Reductions:
The following Lambda expression
"\vv3->case vv3 of {
h : t  -> h : [];
_  -> []}
"
is transformed to
"transpose0 vv3 = case vv3 of {
h : t  -> h : [];
_  -> []}
;
"
The following Lambda expression
"\vv4->case vv4 of {
h : t  -> t : [];
_  -> []}
"
is transformed to
"transpose1 vv4 = case vv4 of {
h : t  -> t : [];
_  -> []}
;
"

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

(2)
Obligation:
mainModule Main 
module Maybe where {

popout

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

job log

popout

actions all output return to Funct Progr 77531