details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.20405387878 seconds
cpu usage	10.093123019
max memory	5.94337792E8

stage attributes

key	value
output-size	16155
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: 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) AND (7) QDP (8) QDPSizeChangeProof [EQUIVALENT, 0 ms] (9) YES (10) QDP (11) QDPSizeChangeProof [EQUIVALENT, 0 ms] (12) YES (13) QDP (14) QDPSizeChangeProof [EQUIVALENT, 0 ms] (15) YES ---------------------------------------- (0) Obligation: mainModule Main module Main where { import qualified Prelude; data List a = Cons a (List a) | Nil ; gtGtEsNil :: List b -> (b -> List a) -> List a; gtGtEsNil (Cons x xs) f = psPs (f x) (gtGtEsNil xs f); gtGtEsNil Nil f = Nil; psPs :: List a -> List a -> List a; psPs Nil ys = ys; psPs (Cons x xs) ys = Cons x (psPs xs ys); returnNil :: a -> List a; returnNil x = Cons x Nil; sequence Nil = returnNil Nil; sequence (Cons c cs) = gtGtEsNil c (sequence1 cs); sequence0 x xs = returnNil (Cons x xs); sequence1 cs x = gtGtEsNil (sequence cs) (sequence0 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 ; gtGtEsNil :: List a -> (a -> List b) -> List b; gtGtEsNil (Cons x xs) f = psPs (f x) (gtGtEsNil xs f); gtGtEsNil Nil f = Nil; psPs :: List a -> List a -> List a; psPs Nil ys = ys; psPs (Cons x xs) ys = Cons x (psPs xs ys); returnNil :: a -> List a; returnNil x = Cons x Nil; sequence Nil = returnNil Nil; sequence (Cons c cs) = gtGtEsNil c (sequence1 cs); sequence0 x xs = returnNil (Cons x xs); sequence1 cs x = gtGtEsNil (sequence cs) (sequence0 x); } ---------------------------------------- (3) COR (EQUIVALENT) Cond Reductions: The following Function with conditions "undefined |Falseundefined; " popout

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

job log

popout

actions

all output return to Haskell