Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell 2019-04-01 06.52 pair #433316428
details
property
value
status
complete
benchmark
Prelude_max_3.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n112.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.19547 seconds
cpu usage
10.3254
user time
9.99855
system time
0.326817
max virtual memory
1.828352E7
max residence set size
617680.0
stage attributes
key
value
starexec-result
YES
output
8.65/3.70 YES 10.03/4.15 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 10.03/4.15 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 10.03/4.15 10.03/4.15 10.03/4.15 H-Termination with start terms of the given HASKELL could be proven: 10.03/4.15 10.03/4.15 (0) HASKELL 10.03/4.15 (1) BR [EQUIVALENT, 0 ms] 10.03/4.15 (2) HASKELL 10.03/4.15 (3) COR [EQUIVALENT, 0 ms] 10.03/4.15 (4) HASKELL 10.03/4.15 (5) Narrow [SOUND, 0 ms] 10.03/4.15 (6) QDP 10.03/4.15 (7) QDPSizeChangeProof [EQUIVALENT, 0 ms] 10.03/4.15 (8) YES 10.03/4.15 10.03/4.15 10.03/4.15 ---------------------------------------- 10.03/4.15 10.03/4.15 (0) 10.03/4.15 Obligation: 10.03/4.15 mainModule Main 10.03/4.15 module Main where { 10.03/4.15 import qualified Prelude; 10.03/4.15 } 10.03/4.15 10.03/4.15 ---------------------------------------- 10.03/4.15 10.03/4.15 (1) BR (EQUIVALENT) 10.03/4.15 Replaced joker patterns by fresh variables and removed binding patterns. 10.03/4.15 ---------------------------------------- 10.03/4.15 10.03/4.15 (2) 10.03/4.15 Obligation: 10.03/4.15 mainModule Main 10.03/4.15 module Main where { 10.03/4.15 import qualified Prelude; 10.03/4.15 } 10.03/4.15 10.03/4.15 ---------------------------------------- 10.03/4.15 10.03/4.15 (3) COR (EQUIVALENT) 10.03/4.15 Cond Reductions: 10.03/4.15 The following Function with conditions 10.03/4.15 "max x y|x <= yy|otherwisex; 10.03/4.15 " 10.03/4.15 is transformed to 10.03/4.15 "max x y = max2 x y; 10.03/4.15 " 10.03/4.15 "max0 x y True = x; 10.03/4.15 " 10.03/4.15 "max1 x y True = y; 10.03/4.15 max1 x y False = max0 x y otherwise; 10.03/4.15 " 10.03/4.15 "max2 x y = max1 x y (x <= y); 10.03/4.15 " 10.03/4.15 The following Function with conditions 10.03/4.15 "undefined |Falseundefined; 10.03/4.15 " 10.03/4.15 is transformed to 10.03/4.15 "undefined = undefined1; 10.03/4.15 " 10.03/4.15 "undefined0 True = undefined; 10.03/4.15 " 10.03/4.15 "undefined1 = undefined0 False; 10.03/4.15 " 10.03/4.15 10.03/4.15 ---------------------------------------- 10.03/4.15 10.03/4.15 (4) 10.03/4.15 Obligation: 10.03/4.15 mainModule Main 10.03/4.15 module Main where { 10.03/4.15 import qualified Prelude; 10.03/4.15 } 10.03/4.15 10.03/4.15 ---------------------------------------- 10.03/4.15 10.03/4.15 (5) Narrow (SOUND) 10.03/4.15 Haskell To QDPs 10.03/4.15 10.03/4.15 digraph dp_graph { 10.03/4.15 node [outthreshold=100, inthreshold=100];1[label="max",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3]; 10.03/4.15 3[label="max vx3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3]; 10.03/4.15 4[label="max vx3 vx4",fontsize=16,color="black",shape="triangle"];4 -> 5[label="",style="solid", color="black", weight=3]; 10.03/4.15 5[label="max2 vx3 vx4",fontsize=16,color="black",shape="box"];5 -> 6[label="",style="solid", color="black", weight=3]; 10.03/4.15 6[label="max1 vx3 vx4 (vx3 <= vx4)",fontsize=16,color="black",shape="box"];6 -> 7[label="",style="solid", color="black", weight=3]; 10.03/4.15 7[label="max1 vx3 vx4 (compare vx3 vx4 /= GT)",fontsize=16,color="black",shape="box"];7 -> 8[label="",style="solid", color="black", weight=3]; 10.03/4.15 8[label="max1 vx3 vx4 (not (compare vx3 vx4 == GT))",fontsize=16,color="black",shape="box"];8 -> 9[label="",style="solid", color="black", weight=3]; 10.03/4.15 9[label="max1 vx3 vx4 (not (primCmpChar vx3 vx4 == GT))",fontsize=16,color="burlywood",shape="box"];302[label="vx3/Char vx30",fontsize=10,color="white",style="solid",shape="box"];9 -> 302[label="",style="solid", color="burlywood", weight=9]; 10.03/4.15 302 -> 10[label="",style="solid", color="burlywood", weight=3]; 10.03/4.15 10[label="max1 (Char vx30) vx4 (not (primCmpChar (Char vx30) vx4 == GT))",fontsize=16,color="burlywood",shape="box"];303[label="vx4/Char vx40",fontsize=10,color="white",style="solid",shape="box"];10 -> 303[label="",style="solid", color="burlywood", weight=9]; 10.03/4.15 303 -> 11[label="",style="solid", color="burlywood", weight=3]; 10.03/4.15 11[label="max1 (Char vx30) (Char vx40) (not (primCmpChar (Char vx30) (Char vx40) == GT))",fontsize=16,color="black",shape="box"];11 -> 12[label="",style="solid", color="black", weight=3]; 10.03/4.15 12[label="max1 (Char vx30) (Char vx40) (not (primCmpNat vx30 vx40 == GT))",fontsize=16,color="burlywood",shape="box"];304[label="vx30/Succ vx300",fontsize=10,color="white",style="solid",shape="box"];12 -> 304[label="",style="solid", color="burlywood", weight=9]; 10.03/4.15 304 -> 13[label="",style="solid", color="burlywood", weight=3]; 10.03/4.15 305[label="vx30/Zero",fontsize=10,color="white",style="solid",shape="box"];12 -> 305[label="",style="solid", color="burlywood", weight=9]; 10.03/4.15 305 -> 14[label="",style="solid", color="burlywood", weight=3]; 10.03/4.15 13[label="max1 (Char (Succ vx300)) (Char vx40) (not (primCmpNat (Succ vx300) vx40 == GT))",fontsize=16,color="burlywood",shape="box"];306[label="vx40/Succ vx400",fontsize=10,color="white",style="solid",shape="box"];13 -> 306[label="",style="solid", color="burlywood", weight=9];
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell 2019-04-01 06.52