Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell 2019-04-01 06.52 pair #433317437
details
property
value
status
complete
benchmark
any_1.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n045.star.cs.uiowa.edu
space
basic_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.03612 seconds
cpu usage
9.61536
user time
9.31019
system time
0.305177
max virtual memory
1.828352E7
max residence set size
609504.0
stage attributes
key
value
starexec-result
YES
output
7.50/3.48 YES 9.39/3.99 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 9.39/3.99 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 9.39/3.99 9.39/3.99 9.39/3.99 H-Termination with start terms of the given HASKELL could be proven: 9.39/3.99 9.39/3.99 (0) HASKELL 9.39/3.99 (1) BR [EQUIVALENT, 0 ms] 9.39/3.99 (2) HASKELL 9.39/3.99 (3) COR [EQUIVALENT, 0 ms] 9.39/3.99 (4) HASKELL 9.39/3.99 (5) Narrow [SOUND, 0 ms] 9.39/3.99 (6) QDP 9.39/3.99 (7) QDPSizeChangeProof [EQUIVALENT, 0 ms] 9.39/3.99 (8) YES 9.39/3.99 9.39/3.99 9.39/3.99 ---------------------------------------- 9.39/3.99 9.39/3.99 (0) 9.39/3.99 Obligation: 9.39/3.99 mainModule Main 9.39/3.99 module Main where { 9.39/3.99 import qualified Prelude; 9.39/3.99 data List a = Cons a (List a) | Nil ; 9.39/3.99 9.39/3.99 data MyBool = MyTrue | MyFalse ; 9.39/3.99 9.39/3.99 any :: (a -> MyBool) -> List a -> MyBool; 9.39/3.99 any p = pt or (map p); 9.39/3.99 9.39/3.99 foldr :: (a -> b -> b) -> b -> List a -> b; 9.39/3.99 foldr f z Nil = z; 9.39/3.99 foldr f z (Cons x xs) = f x (foldr f z xs); 9.39/3.99 9.39/3.99 map :: (a -> b) -> List a -> List b; 9.39/3.99 map f Nil = Nil; 9.39/3.99 map f (Cons x xs) = Cons (f x) (map f xs); 9.39/3.99 9.39/3.99 or :: List MyBool -> MyBool; 9.39/3.99 or = foldr pePe MyFalse; 9.39/3.99 9.39/3.99 pePe :: MyBool -> MyBool -> MyBool; 9.39/3.99 pePe MyFalse x = x; 9.39/3.99 pePe MyTrue x = MyTrue; 9.39/3.99 9.39/3.99 pt :: (c -> a) -> (b -> c) -> b -> a; 9.39/3.99 pt f g x = f (g x); 9.39/3.99 9.39/3.99 } 9.39/3.99 9.39/3.99 ---------------------------------------- 9.39/3.99 9.39/3.99 (1) BR (EQUIVALENT) 9.39/3.99 Replaced joker patterns by fresh variables and removed binding patterns. 9.39/3.99 ---------------------------------------- 9.39/3.99 9.39/3.99 (2) 9.39/3.99 Obligation: 9.39/3.99 mainModule Main 9.39/3.99 module Main where { 9.39/3.99 import qualified Prelude; 9.39/3.99 data List a = Cons a (List a) | Nil ; 9.39/3.99 9.39/3.99 data MyBool = MyTrue | MyFalse ; 9.39/3.99 9.39/3.99 any :: (a -> MyBool) -> List a -> MyBool; 9.39/3.99 any p = pt or (map p); 9.39/3.99 9.39/3.99 foldr :: (a -> b -> b) -> b -> List a -> b; 9.39/3.99 foldr f z Nil = z; 9.39/3.99 foldr f z (Cons x xs) = f x (foldr f z xs); 9.39/3.99 9.39/3.99 map :: (a -> b) -> List a -> List b; 9.39/3.99 map f Nil = Nil; 9.39/3.99 map f (Cons x xs) = Cons (f x) (map f xs); 9.39/3.99 9.39/3.99 or :: List MyBool -> MyBool; 9.39/3.99 or = foldr pePe MyFalse; 9.39/3.99 9.39/3.99 pePe :: MyBool -> MyBool -> MyBool; 9.39/3.99 pePe MyFalse x = x; 9.39/3.99 pePe MyTrue x = MyTrue; 9.39/3.99 9.39/3.99 pt :: (b -> a) -> (c -> b) -> c -> a; 9.39/3.99 pt f g x = f (g x); 9.39/3.99 9.39/3.99 } 9.39/3.99 9.39/3.99 ---------------------------------------- 9.39/3.99 9.39/3.99 (3) COR (EQUIVALENT) 9.39/3.99 Cond Reductions: 9.39/3.99 The following Function with conditions 9.39/3.99 "undefined |Falseundefined; 9.39/3.99 " 9.39/3.99 is transformed to 9.39/3.99 "undefined = undefined1; 9.39/3.99 "
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell 2019-04-01 06.52