Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell 2019-04-01 06.52 pair #433316444
details
property
value
status
complete
benchmark
Prelude_enumFromThen_5.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n014.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
6.9998 seconds
cpu usage
17.5137
user time
16.7705
system time
0.743148
max virtual memory
1.8287392E7
max residence set size
2215796.0
stage attributes
key
value
starexec-result
MAYBE
output
15.53/6.39 MAYBE 17.21/6.86 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 17.21/6.86 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 17.21/6.86 17.21/6.86 17.21/6.86 H-Termination with start terms of the given HASKELL could not be shown: 17.21/6.86 17.21/6.86 (0) HASKELL 17.21/6.86 (1) BR [EQUIVALENT, 0 ms] 17.21/6.86 (2) HASKELL 17.21/6.86 (3) COR [EQUIVALENT, 0 ms] 17.21/6.86 (4) HASKELL 17.21/6.86 (5) Narrow [SOUND, 0 ms] 17.21/6.86 (6) AND 17.21/6.86 (7) QDP 17.21/6.86 (8) QDPSizeChangeProof [EQUIVALENT, 0 ms] 17.21/6.86 (9) YES 17.21/6.86 (10) QDP 17.21/6.86 (11) MNOCProof [EQUIVALENT, 31 ms] 17.21/6.86 (12) QDP 17.21/6.86 (13) NonTerminationLoopProof [COMPLETE, 0 ms] 17.21/6.86 (14) NO 17.21/6.86 (15) QDP 17.21/6.86 (16) QDPSizeChangeProof [EQUIVALENT, 0 ms] 17.21/6.86 (17) YES 17.21/6.86 (18) QDP 17.21/6.86 (19) QDPSizeChangeProof [EQUIVALENT, 0 ms] 17.21/6.86 (20) YES 17.21/6.86 (21) Narrow [COMPLETE, 0 ms] 17.21/6.86 (22) TRUE 17.21/6.86 17.21/6.86 17.21/6.86 ---------------------------------------- 17.21/6.86 17.21/6.86 (0) 17.21/6.86 Obligation: 17.21/6.86 mainModule Main 17.21/6.86 module Main where { 17.21/6.86 import qualified Prelude; 17.21/6.86 } 17.21/6.86 17.21/6.86 ---------------------------------------- 17.21/6.86 17.21/6.86 (1) BR (EQUIVALENT) 17.21/6.86 Replaced joker patterns by fresh variables and removed binding patterns. 17.21/6.86 ---------------------------------------- 17.21/6.86 17.21/6.86 (2) 17.21/6.86 Obligation: 17.21/6.86 mainModule Main 17.21/6.86 module Main where { 17.21/6.86 import qualified Prelude; 17.21/6.86 } 17.21/6.86 17.21/6.86 ---------------------------------------- 17.21/6.86 17.21/6.86 (3) COR (EQUIVALENT) 17.21/6.86 Cond Reductions: 17.21/6.86 The following Function with conditions 17.21/6.86 "undefined |Falseundefined; 17.21/6.86 " 17.21/6.86 is transformed to 17.21/6.86 "undefined = undefined1; 17.21/6.86 " 17.21/6.86 "undefined0 True = undefined; 17.21/6.86 " 17.21/6.86 "undefined1 = undefined0 False; 17.21/6.86 " 17.21/6.86 17.21/6.86 ---------------------------------------- 17.21/6.86 17.21/6.86 (4) 17.21/6.86 Obligation: 17.21/6.86 mainModule Main 17.21/6.86 module Main where { 17.21/6.86 import qualified Prelude; 17.21/6.86 } 17.21/6.86 17.21/6.86 ---------------------------------------- 17.21/6.86 17.21/6.86 (5) Narrow (SOUND) 17.21/6.86 Haskell To QDPs 17.21/6.86 17.21/6.86 digraph dp_graph { 17.21/6.86 node [outthreshold=100, inthreshold=100];1[label="enumFromThen",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3]; 17.21/6.86 3[label="enumFromThen vx3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3]; 17.21/6.86 4[label="enumFromThen vx3 vx4",fontsize=16,color="black",shape="triangle"];4 -> 5[label="",style="solid", color="black", weight=3]; 17.21/6.86 5[label="numericEnumFromThen vx3 vx4",fontsize=16,color="black",shape="box"];5 -> 6[label="",style="solid", color="black", weight=3]; 17.21/6.86 6[label="iterate (vx4 - vx3 +) vx3",fontsize=16,color="black",shape="box"];6 -> 7[label="",style="solid", color="black", weight=3]; 17.21/6.86 7[label="vx3 : iterate (vx4 - vx3 +) (vx4 - vx3 + vx3)",fontsize=16,color="green",shape="box"];7 -> 8[label="",style="dashed", color="green", weight=3]; 17.21/6.86 8 -> 13[label="",style="dashed", color="red", weight=0]; 17.21/6.86 8[label="iterate (vx4 - vx3 +) (vx4 - vx3 + vx3)",fontsize=16,color="magenta"];8 -> 14[label="",style="dashed", color="magenta", weight=3]; 17.21/6.86 14[label="vx3",fontsize=16,color="green",shape="box"];13[label="iterate (vx4 - vx3 +) (vx4 - vx3 + vx5)",fontsize=16,color="black",shape="triangle"];13 -> 16[label="",style="solid", color="black", weight=3]; 17.21/6.86 16[label="vx4 - vx3 + vx5 : iterate (vx4 - vx3 +) (vx4 - vx3 + (vx4 - vx3 + vx5))",fontsize=16,color="green",shape="box"];16 -> 17[label="",style="dashed", color="green", weight=3]; 17.21/6.86 16 -> 18[label="",style="dashed", color="green", weight=3]; 17.21/6.86 17[label="vx4 - vx3 + vx5",fontsize=16,color="black",shape="triangle"];17 -> 19[label="",style="solid", color="black", weight=3]; 17.21/6.86 18 -> 13[label="",style="dashed", color="red", weight=0]; 17.21/6.86 18[label="iterate (vx4 - vx3 +) (vx4 - vx3 + (vx4 - vx3 + vx5))",fontsize=16,color="magenta"];18 -> 20[label="",style="dashed", color="magenta", weight=3]; 17.21/6.86 19[label="primPlusFloat (vx4 - vx3) vx5",fontsize=16,color="black",shape="box"];19 -> 21[label="",style="solid", color="black", weight=3]; 17.21/6.86 20 -> 17[label="",style="dashed", color="red", weight=0];
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell 2019-04-01 06.52