Haskell pair #487598227

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.15891289711 seconds
cpu usage	10.550148455
max memory	5.72731392E8

stage attributes

key	value
output-size	9295
starexec-result	YES

output

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


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


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


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

(0) HASKELL
(1) BR [EQUIVALENT, 0 ms]
(2) HASKELL
(3) COR [EQUIVALENT, 0 ms]
(4) HASKELL
(5) Narrow [SOUND, 0 ms]
(6) QDP
(7) QDPSizeChangeProof [EQUIVALENT, 0 ms]
(8) YES


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

(0)
Obligation:
mainModule Main 
module Main where {
import qualified Prelude;
data List a = Cons a (List a)  | Nil ;

data MyBool = MyTrue  | MyFalse ;

concat :: List (List a)  ->  List a;
concat = foldr psPs Nil;

concatMap :: (a  ->  List b)  ->  List a  ->  List b;
concatMap f = pt concat (map f);

filter :: (a  ->  MyBool)  ->  List a  ->  List a;
filter p xs = concatMap (filter0 p) xs;

filter0 p vu39 = filter00 p vu39;

filter00 p x = filter000 x (p x);
filter00 p vv = Nil;

filter000 x MyTrue = Cons x Nil;
filter000 x MyFalse = Nil;

foldr :: (a  ->  b  ->  b)  ->  b  ->  List a  ->  b;
foldr f z Nil = z;
foldr f z (Cons x xs) = f x (foldr f z xs);

map :: (a  ->  b)  ->  List a  ->  List b;
map f Nil = Nil;
map f (Cons x xs) = Cons (f x) (map f xs);

psPs :: List a  ->  List a  ->  List a;
psPs Nil ys = ys;
psPs (Cons x xs) ys = Cons x (psPs xs ys);

pt :: (b  ->  a)  ->  (c  ->  b)  ->  c  ->  a;
pt f g x = f (g x);

}

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

(1) BR (EQUIVALENT)
Replaced joker patterns by fresh variables and removed binding patterns.
----------------------------------------

(2)
Obligation:
mainModule Main 
module Main where {
import qualified Prelude;
data List a = Cons a (List a)  | Nil ;

data MyBool = MyTrue  | MyFalse ;

concat :: List (List a)  ->  List a;
concat = foldr psPs Nil;

concatMap :: (b  ->  List a)  ->  List b  ->  List a;
concatMap f = pt concat (map f);

filter :: (a  ->  MyBool)  ->  List a  ->  List a;
filter p xs = concatMap (filter0 p) xs;

filter0 p vu39 = filter00 p vu39;

filter00 p x = filter000 x (p x);
filter00 p vv = Nil;

filter000 x MyTrue = Cons x Nil;
filter000 x MyFalse = Nil;

popout

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

job log

popout

actions all output return to Haskell