Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell 2019-04-01 06.52 pair #433317336
details
property
value
status
complete
benchmark
zipWith_1.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n058.star.cs.uiowa.edu
space
basic_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
7.003 seconds
cpu usage
9.41059
user time
9.12219
system time
0.288406
max virtual memory
1.828352E7
max residence set size
553916.0
stage attributes
key
value
starexec-result
YES
output
7.90/3.57 YES 9.35/4.02 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 9.35/4.02 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 9.35/4.02 9.35/4.02 9.35/4.02 H-Termination with start terms of the given HASKELL could be proven: 9.35/4.02 9.35/4.02 (0) HASKELL 9.35/4.02 (1) BR [EQUIVALENT, 0 ms] 9.35/4.02 (2) HASKELL 9.35/4.02 (3) COR [EQUIVALENT, 0 ms] 9.35/4.02 (4) HASKELL 9.35/4.02 (5) Narrow [SOUND, 0 ms] 9.35/4.02 (6) QDP 9.35/4.02 (7) QDPSizeChangeProof [EQUIVALENT, 0 ms] 9.35/4.02 (8) YES 9.35/4.02 9.35/4.02 9.35/4.02 ---------------------------------------- 9.35/4.02 9.35/4.02 (0) 9.35/4.02 Obligation: 9.35/4.02 mainModule Main 9.35/4.02 module Main where { 9.35/4.02 import qualified Prelude; 9.35/4.02 data List a = Cons a (List a) | Nil ; 9.35/4.02 9.35/4.02 zipWith :: (c -> a -> b) -> List c -> List a -> List b; 9.35/4.02 zipWith z (Cons a as) (Cons b bs) = Cons (z a b) (zipWith z as bs); 9.35/4.02 zipWith vv vw vx = Nil; 9.35/4.02 9.35/4.02 } 9.35/4.02 9.35/4.02 ---------------------------------------- 9.35/4.02 9.35/4.02 (1) BR (EQUIVALENT) 9.35/4.02 Replaced joker patterns by fresh variables and removed binding patterns. 9.35/4.02 ---------------------------------------- 9.35/4.02 9.35/4.02 (2) 9.35/4.02 Obligation: 9.35/4.02 mainModule Main 9.35/4.02 module Main where { 9.35/4.02 import qualified Prelude; 9.35/4.02 data List a = Cons a (List a) | Nil ; 9.35/4.02 9.35/4.02 zipWith :: (b -> c -> a) -> List b -> List c -> List a; 9.35/4.02 zipWith z (Cons a as) (Cons b bs) = Cons (z a b) (zipWith z as bs); 9.35/4.02 zipWith vv vw vx = Nil; 9.35/4.02 9.35/4.02 } 9.35/4.02 9.35/4.02 ---------------------------------------- 9.35/4.02 9.35/4.02 (3) COR (EQUIVALENT) 9.35/4.02 Cond Reductions: 9.35/4.02 The following Function with conditions 9.35/4.02 "undefined |Falseundefined; 9.35/4.02 " 9.35/4.02 is transformed to 9.35/4.02 "undefined = undefined1; 9.35/4.02 " 9.35/4.02 "undefined0 True = undefined; 9.35/4.02 " 9.35/4.02 "undefined1 = undefined0 False; 9.35/4.02 " 9.35/4.02 9.35/4.02 ---------------------------------------- 9.35/4.02 9.35/4.02 (4) 9.35/4.02 Obligation: 9.35/4.02 mainModule Main 9.35/4.02 module Main where { 9.35/4.02 import qualified Prelude; 9.35/4.02 data List a = Cons a (List a) | Nil ; 9.35/4.02 9.35/4.02 zipWith :: (c -> b -> a) -> List c -> List b -> List a; 9.35/4.02 zipWith z (Cons a as) (Cons b bs) = Cons (z a b) (zipWith z as bs); 9.35/4.02 zipWith vv vw vx = Nil; 9.35/4.02 9.35/4.02 } 9.35/4.02 9.35/4.02 ---------------------------------------- 9.35/4.02 9.35/4.02 (5) Narrow (SOUND) 9.35/4.02 Haskell To QDPs 9.35/4.02 9.35/4.02 digraph dp_graph { 9.35/4.02 node [outthreshold=100, inthreshold=100];1[label="zipWith",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3]; 9.35/4.02 3[label="zipWith wu3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3]; 9.35/4.02 4[label="zipWith wu3 wu4",fontsize=16,color="grey",shape="box"];4 -> 5[label="",style="dashed", color="grey", weight=3]; 9.35/4.02 5[label="zipWith wu3 wu4 wu5",fontsize=16,color="burlywood",shape="triangle"];19[label="wu4/Cons wu40 wu41",fontsize=10,color="white",style="solid",shape="box"];5 -> 19[label="",style="solid", color="burlywood", weight=9]; 9.35/4.02 19 -> 6[label="",style="solid", color="burlywood", weight=3]; 9.35/4.02 20[label="wu4/Nil",fontsize=10,color="white",style="solid",shape="box"];5 -> 20[label="",style="solid", color="burlywood", weight=9]; 9.35/4.02 20 -> 7[label="",style="solid", color="burlywood", weight=3]; 9.35/4.02 6[label="zipWith wu3 (Cons wu40 wu41) wu5",fontsize=16,color="burlywood",shape="box"];21[label="wu5/Cons wu50 wu51",fontsize=10,color="white",style="solid",shape="box"];6 -> 21[label="",style="solid", color="burlywood", weight=9]; 9.35/4.02 21 -> 8[label="",style="solid", color="burlywood", weight=3]; 9.35/4.02 22[label="wu5/Nil",fontsize=10,color="white",style="solid",shape="box"];6 -> 22[label="",style="solid", color="burlywood", weight=9]; 9.35/4.02 22 -> 9[label="",style="solid", color="burlywood", weight=3]; 9.35/4.02 7[label="zipWith wu3 Nil wu5",fontsize=16,color="black",shape="box"];7 -> 10[label="",style="solid", color="black", weight=3];
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell 2019-04-01 06.52