Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell 2019-04-01 06.52 pair #433317068
details
property
value
status
complete
benchmark
Prelude_minimum_6.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n050.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
16.2825 seconds
cpu usage
33.6261
user time
32.3701
system time
1.25595
max virtual memory
1.8288272E7
max residence set size
3946148.0
stage attributes
key
value
starexec-result
YES
output
31.50/15.64 YES 33.33/16.15 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 33.33/16.15 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 33.33/16.15 33.33/16.15 33.33/16.15 H-Termination with start terms of the given HASKELL could be proven: 33.33/16.15 33.33/16.15 (0) HASKELL 33.33/16.15 (1) BR [EQUIVALENT, 0 ms] 33.33/16.15 (2) HASKELL 33.33/16.15 (3) COR [EQUIVALENT, 0 ms] 33.33/16.15 (4) HASKELL 33.33/16.15 (5) Narrow [SOUND, 0 ms] 33.33/16.15 (6) AND 33.33/16.15 (7) QDP 33.33/16.15 (8) QDPSizeChangeProof [EQUIVALENT, 0 ms] 33.33/16.15 (9) YES 33.33/16.15 (10) QDP 33.33/16.15 (11) QDPSizeChangeProof [EQUIVALENT, 0 ms] 33.33/16.15 (12) YES 33.33/16.15 (13) QDP 33.33/16.15 (14) QDPSizeChangeProof [EQUIVALENT, 0 ms] 33.33/16.15 (15) YES 33.33/16.15 (16) QDP 33.33/16.15 (17) QDPSizeChangeProof [EQUIVALENT, 0 ms] 33.33/16.15 (18) YES 33.33/16.15 (19) QDP 33.33/16.15 (20) QDPSizeChangeProof [EQUIVALENT, 0 ms] 33.33/16.15 (21) YES 33.33/16.15 33.33/16.15 33.33/16.15 ---------------------------------------- 33.33/16.15 33.33/16.15 (0) 33.33/16.15 Obligation: 33.33/16.15 mainModule Main 33.33/16.15 module Main where { 33.33/16.15 import qualified Prelude; 33.33/16.15 } 33.33/16.15 33.33/16.15 ---------------------------------------- 33.33/16.15 33.33/16.15 (1) BR (EQUIVALENT) 33.33/16.15 Replaced joker patterns by fresh variables and removed binding patterns. 33.33/16.15 ---------------------------------------- 33.33/16.16 33.33/16.16 (2) 33.33/16.16 Obligation: 33.33/16.16 mainModule Main 33.33/16.16 module Main where { 33.33/16.16 import qualified Prelude; 33.33/16.16 } 33.33/16.16 33.33/16.16 ---------------------------------------- 33.33/16.16 33.33/16.16 (3) COR (EQUIVALENT) 33.33/16.16 Cond Reductions: 33.33/16.16 The following Function with conditions 33.33/16.16 "min x y|x <= yx|otherwisey; 33.33/16.16 " 33.33/16.16 is transformed to 33.33/16.16 "min x y = min2 x y; 33.33/16.16 " 33.33/16.16 "min1 x y True = x; 33.33/16.16 min1 x y False = min0 x y otherwise; 33.33/16.16 " 33.33/16.16 "min0 x y True = y; 33.33/16.16 " 33.33/16.16 "min2 x y = min1 x y (x <= y); 33.33/16.16 " 33.33/16.16 The following Function with conditions 33.33/16.16 "undefined |Falseundefined; 33.33/16.16 " 33.33/16.16 is transformed to 33.33/16.16 "undefined = undefined1; 33.33/16.16 " 33.33/16.16 "undefined0 True = undefined; 33.33/16.16 " 33.33/16.16 "undefined1 = undefined0 False; 33.33/16.16 " 33.33/16.16 33.33/16.16 ---------------------------------------- 33.33/16.16 33.33/16.16 (4) 33.33/16.16 Obligation: 33.33/16.16 mainModule Main 33.33/16.16 module Main where { 33.33/16.16 import qualified Prelude; 33.33/16.16 } 33.33/16.16 33.33/16.16 ---------------------------------------- 33.33/16.16 33.33/16.16 (5) Narrow (SOUND) 33.33/16.16 Haskell To QDPs 33.33/16.16 33.33/16.16 digraph dp_graph { 33.33/16.16 node [outthreshold=100, inthreshold=100];1[label="minimum",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3]; 33.33/16.16 3[label="minimum vx3",fontsize=16,color="black",shape="triangle"];3 -> 4[label="",style="solid", color="black", weight=3]; 33.33/16.16 4[label="foldl1 min vx3",fontsize=16,color="burlywood",shape="box"];7342[label="vx3/vx30 : vx31",fontsize=10,color="white",style="solid",shape="box"];4 -> 7342[label="",style="solid", color="burlywood", weight=9]; 33.33/16.16 7342 -> 5[label="",style="solid", color="burlywood", 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