Haskell pair #487599552

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.25323295593 seconds
cpu usage	13.262461921
max memory	7.12187904E8

stage attributes

key	value
output-size	50133
starexec-result	MAYBE

output

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


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


MAYBE
proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


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

(0) HASKELL
(1) LR [EQUIVALENT, 0 ms]
(2) HASKELL
(3) BR [EQUIVALENT, 0 ms]
(4) HASKELL
(5) COR [EQUIVALENT, 27 ms]
(6) HASKELL
(7) LetRed [EQUIVALENT, 0 ms]
(8) HASKELL
(9) Narrow [SOUND, 0 ms]
(10) AND
    (11) QDP
        (12) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (13) YES
    (14) QDP
        (15) NonTerminationLoopProof [COMPLETE, 0 ms]
        (16) NO
(17) Narrow [COMPLETE, 0 ms]
(18) QDP
    (19) PisEmptyProof [EQUIVALENT, 0 ms]
    (20) 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;
groupBy :: (a  ->  a  ->  Bool)  ->  [a]  ->  [[a]];
groupBy _ [] = [];
groupBy eq (x : xs) = (x : ys) : groupBy eq zs where { 
vv10 = span (eq x) xs;
ys = (\(ys,_) ->ys) vv10;
zs = (\(_,zs) ->zs) vv10;
 };

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

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

(1) LR (EQUIVALENT)
Lambda Reductions:
The following Lambda expression
"\(_,zs)->zs"
is transformed to
"zs0 (_,zs) = zs;
"
The following Lambda expression
"\(ys,_)->ys"
is transformed to
"ys0 (ys,_) = ys;
"
The following Lambda expression
"\(_,zs)->zs"
is transformed to
"zs1 (_,zs) = zs;
"
The following Lambda expression
"\(ys,_)->ys"
is transformed to
"ys1 (ys,_) = ys;
"

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

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

popout

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

job log

popout

actions all output return to Haskell