details

property	value
status	complete
benchmark	Prelude_min_6.hs
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n052.star.cs.uiowa.edu
space	full_haskell

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	6.95704 seconds
cpu usage	17.2646
user time	16.6994
system time	0.565228
max virtual memory	1.828352E7
max residence set size	1572620.0

stage attributes

key	value
starexec-result	YES

output

15.28/6.32 YES 17.08/6.81 proof of /export/starexec/sandbox2/benchmark/theBenchmark.hs 17.08/6.81 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 17.08/6.81 17.08/6.81 17.08/6.81 H-Termination with start terms of the given HASKELL could be proven: 17.08/6.81 17.08/6.81 (0) HASKELL 17.08/6.81 (1) BR [EQUIVALENT, 0 ms] 17.08/6.81 (2) HASKELL 17.08/6.81 (3) COR [EQUIVALENT, 0 ms] 17.08/6.81 (4) HASKELL 17.08/6.81 (5) Narrow [SOUND, 0 ms] 17.08/6.81 (6) AND 17.08/6.81 (7) QDP 17.08/6.81 (8) QDPSizeChangeProof [EQUIVALENT, 1 ms] 17.08/6.81 (9) YES 17.08/6.81 (10) QDP 17.08/6.81 (11) QDPSizeChangeProof [EQUIVALENT, 0 ms] 17.08/6.81 (12) YES 17.08/6.81 (13) QDP 17.08/6.81 (14) QDPSizeChangeProof [EQUIVALENT, 0 ms] 17.08/6.81 (15) YES 17.08/6.81 (16) QDP 17.08/6.81 (17) QDPSizeChangeProof [EQUIVALENT, 0 ms] 17.08/6.81 (18) YES 17.08/6.81 17.08/6.81 17.08/6.81 ---------------------------------------- 17.08/6.81 17.08/6.81 (0) 17.08/6.81 Obligation: 17.08/6.81 mainModule Main 17.08/6.81 module Main where { 17.08/6.81 import qualified Prelude; 17.08/6.81 } 17.08/6.81 17.08/6.81 ---------------------------------------- 17.08/6.81 17.08/6.81 (1) BR (EQUIVALENT) 17.08/6.81 Replaced joker patterns by fresh variables and removed binding patterns. 17.08/6.81 ---------------------------------------- 17.08/6.81 17.08/6.81 (2) 17.08/6.81 Obligation: 17.08/6.81 mainModule Main 17.08/6.81 module Main where { 17.08/6.81 import qualified Prelude; 17.08/6.81 } 17.08/6.81 17.08/6.81 ---------------------------------------- 17.08/6.81 17.08/6.81 (3) COR (EQUIVALENT) 17.08/6.81 Cond Reductions: 17.08/6.81 The following Function with conditions 17.08/6.81 "min x y|x <= yx|otherwisey; 17.08/6.81 " 17.08/6.81 is transformed to 17.08/6.81 "min x y = min2 x y; 17.08/6.81 " 17.08/6.81 "min1 x y True = x; 17.08/6.81 min1 x y False = min0 x y otherwise; 17.08/6.81 " 17.08/6.81 "min0 x y True = y; 17.08/6.81 " 17.08/6.81 "min2 x y = min1 x y (x <= y); 17.08/6.81 " 17.08/6.81 The following Function with conditions 17.08/6.81 "undefined |Falseundefined; 17.08/6.81 " 17.08/6.81 is transformed to 17.08/6.81 "undefined = undefined1; 17.08/6.81 " 17.08/6.81 "undefined0 True = undefined; 17.08/6.81 " 17.08/6.81 "undefined1 = undefined0 False; 17.08/6.81 " 17.08/6.81 17.08/6.81 ---------------------------------------- 17.08/6.81 17.08/6.81 (4) 17.08/6.81 Obligation: 17.08/6.81 mainModule Main 17.08/6.81 module Main where { 17.08/6.81 import qualified Prelude; 17.08/6.81 } 17.08/6.81 17.08/6.81 ---------------------------------------- 17.08/6.81 17.08/6.81 (5) Narrow (SOUND) 17.08/6.81 Haskell To QDPs 17.08/6.81 17.08/6.81 digraph dp_graph { 17.08/6.81 node [outthreshold=100, inthreshold=100];1[label="min",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3]; 17.08/6.81 3[label="min vx3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3]; 17.08/6.81 4[label="min vx3 vx4",fontsize=16,color="black",shape="triangle"];4 -> 5[label="",style="solid", color="black", weight=3]; 17.08/6.81 5[label="min2 vx3 vx4",fontsize=16,color="black",shape="box"];5 -> 6[label="",style="solid", color="black", weight=3]; 17.08/6.81 6[label="min1 vx3 vx4 (vx3 <= vx4)",fontsize=16,color="black",shape="box"];6 -> 7[label="",style="solid", color="black", weight=3]; 17.08/6.81 7[label="min1 vx3 vx4 (compare vx3 vx4 /= GT)",fontsize=16,color="black",shape="box"];7 -> 8[label="",style="solid", color="black", weight=3]; 17.08/6.81 8[label="min1 vx3 vx4 (not (compare vx3 vx4 == GT))",fontsize=16,color="black",shape="box"];8 -> 9[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