details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.12291 seconds
cpu usage	9.96415
user time	9.70821
system time	0.255941
max virtual memory	1.8285144E7
max residence set size	580300.0

stage attributes

key	value
starexec-result	YES

output

8.06/3.58 YES 9.67/4.08 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 9.67/4.08 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 9.67/4.08 9.67/4.08 9.67/4.08 H-Termination with start terms of the given HASKELL could be proven: 9.67/4.08 9.67/4.08 (0) HASKELL 9.67/4.08 (1) BR [EQUIVALENT, 0 ms] 9.67/4.08 (2) HASKELL 9.67/4.08 (3) COR [EQUIVALENT, 0 ms] 9.67/4.08 (4) HASKELL 9.67/4.08 (5) Narrow [SOUND, 0 ms] 9.67/4.08 (6) QDP 9.67/4.08 (7) QDPSizeChangeProof [EQUIVALENT, 0 ms] 9.67/4.08 (8) YES 9.67/4.08 9.67/4.08 9.67/4.08 ---------------------------------------- 9.67/4.08 9.67/4.08 (0) 9.67/4.08 Obligation: 9.67/4.08 mainModule Main 9.67/4.08 module Main where { 9.67/4.08 import qualified Prelude; 9.67/4.08 data List a = Cons a (List a) | Nil ; 9.67/4.08 9.67/4.08 data MyBool = MyTrue | MyFalse ; 9.67/4.08 9.67/4.08 data Tup2 a b = Tup2 a b ; 9.67/4.08 9.67/4.08 break :: (a -> MyBool) -> List a -> Tup2 (List a) (List a); 9.67/4.08 break p = span (pt not p); 9.67/4.08 9.67/4.08 not :: MyBool -> MyBool; 9.67/4.08 not MyTrue = MyFalse; 9.67/4.08 not MyFalse = MyTrue; 9.67/4.08 9.67/4.08 otherwise :: MyBool; 9.67/4.08 otherwise = MyTrue; 9.67/4.08 9.67/4.08 pt :: (b -> a) -> (c -> b) -> c -> a; 9.67/4.08 pt f g x = f (g x); 9.67/4.08 9.67/4.08 span :: (a -> MyBool) -> List a -> Tup2 (List a) (List a); 9.67/4.08 span p Nil = span3 p Nil; 9.67/4.08 span p (Cons vv vw) = span2 p (Cons vv vw); 9.67/4.08 9.67/4.08 span2 p (Cons vv vw) = span2Span1 p vw p vv vw (p vv); 9.67/4.08 9.67/4.08 span2Span0 wx wy p vv vw MyTrue = Tup2 Nil (Cons vv vw); 9.67/4.08 9.67/4.08 span2Span1 wx wy p vv vw MyTrue = Tup2 (Cons vv (span2Ys wx wy)) (span2Zs wx wy); 9.67/4.08 span2Span1 wx wy p vv vw MyFalse = span2Span0 wx wy p vv vw otherwise; 9.67/4.08 9.67/4.08 span2Vu43 wx wy = span wx wy; 9.67/4.08 9.67/4.08 span2Ys wx wy = span2Ys0 wx wy (span2Vu43 wx wy); 9.67/4.08 9.67/4.08 span2Ys0 wx wy (Tup2 ys vx) = ys; 9.67/4.08 9.67/4.08 span2Zs wx wy = span2Zs0 wx wy (span2Vu43 wx wy); 9.67/4.08 9.67/4.08 span2Zs0 wx wy (Tup2 vy zs) = zs; 9.67/4.08 9.67/4.08 span3 p Nil = Tup2 Nil Nil; 9.67/4.08 span3 wv ww = span2 wv ww; 9.67/4.08 9.67/4.08 } 9.67/4.08 9.67/4.08 ---------------------------------------- 9.67/4.08 9.67/4.08 (1) BR (EQUIVALENT) 9.67/4.08 Replaced joker patterns by fresh variables and removed binding patterns. 9.67/4.08 ---------------------------------------- 9.67/4.08 9.67/4.08 (2) 9.67/4.08 Obligation: 9.67/4.08 mainModule Main 9.67/4.08 module Main where { 9.67/4.08 import qualified Prelude; 9.67/4.08 data List a = Cons a (List a) | Nil ; 9.67/4.08 9.67/4.08 data MyBool = MyTrue | MyFalse ; 9.67/4.08 9.67/4.08 data Tup2 b a = Tup2 b a ; 9.67/4.08 9.67/4.08 break :: (a -> MyBool) -> List a -> Tup2 (List a) (List a); 9.67/4.08 break p = span (pt not p); 9.67/4.08 9.67/4.08 not :: MyBool -> MyBool; 9.67/4.08 not MyTrue = MyFalse; 9.67/4.08 not MyFalse = MyTrue; 9.67/4.08 9.67/4.08 otherwise :: MyBool; 9.67/4.08 otherwise = MyTrue; 9.67/4.08 9.67/4.08 pt :: (c -> a) -> (b -> c) -> b -> a; 9.67/4.08 pt f g x = f (g x); 9.67/4.08 popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52