details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.33251 seconds
cpu usage	10.7764
user time	10.4934
system time	0.283011
max virtual memory	1.828352E7
max residence set size	617288.0

stage attributes

key	value
starexec-result	YES

output

9.09/3.82 YES 10.60/4.28 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 10.60/4.28 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 10.60/4.28 10.60/4.28 10.60/4.28 H-Termination with start terms of the given HASKELL could be proven: 10.60/4.28 10.60/4.28 (0) HASKELL 10.60/4.28 (1) BR [EQUIVALENT, 0 ms] 10.60/4.28 (2) HASKELL 10.60/4.28 (3) COR [EQUIVALENT, 0 ms] 10.60/4.28 (4) HASKELL 10.60/4.28 (5) Narrow [SOUND, 0 ms] 10.60/4.28 (6) AND 10.60/4.28 (7) QDP 10.60/4.28 (8) QDPSizeChangeProof [EQUIVALENT, 17 ms] 10.60/4.28 (9) YES 10.60/4.28 (10) QDP 10.60/4.28 (11) QDPSizeChangeProof [EQUIVALENT, 0 ms] 10.60/4.28 (12) YES 10.60/4.28 (13) QDP 10.60/4.28 (14) QDPSizeChangeProof [EQUIVALENT, 0 ms] 10.60/4.28 (15) YES 10.60/4.28 (16) QDP 10.60/4.28 (17) QDPSizeChangeProof [EQUIVALENT, 0 ms] 10.60/4.28 (18) YES 10.60/4.28 (19) QDP 10.60/4.28 (20) QDPSizeChangeProof [EQUIVALENT, 0 ms] 10.60/4.28 (21) YES 10.60/4.28 10.60/4.28 10.60/4.28 ---------------------------------------- 10.60/4.28 10.60/4.28 (0) 10.60/4.28 Obligation: 10.60/4.28 mainModule Main 10.60/4.28 module Main where { 10.60/4.28 import qualified Prelude; 10.60/4.28 } 10.60/4.28 10.60/4.28 ---------------------------------------- 10.60/4.28 10.60/4.28 (1) BR (EQUIVALENT) 10.60/4.28 Replaced joker patterns by fresh variables and removed binding patterns. 10.60/4.28 ---------------------------------------- 10.60/4.28 10.60/4.28 (2) 10.60/4.28 Obligation: 10.60/4.28 mainModule Main 10.60/4.28 module Main where { 10.60/4.28 import qualified Prelude; 10.60/4.28 } 10.60/4.28 10.60/4.28 ---------------------------------------- 10.60/4.28 10.60/4.28 (3) COR (EQUIVALENT) 10.60/4.28 Cond Reductions: 10.60/4.28 The following Function with conditions 10.60/4.28 "undefined |Falseundefined; 10.60/4.28 " 10.60/4.28 is transformed to 10.60/4.28 "undefined = undefined1; 10.60/4.28 " 10.60/4.28 "undefined0 True = undefined; 10.60/4.28 " 10.60/4.28 "undefined1 = undefined0 False; 10.60/4.28 " 10.60/4.28 10.60/4.28 ---------------------------------------- 10.60/4.28 10.60/4.28 (4) 10.60/4.28 Obligation: 10.60/4.28 mainModule Main 10.60/4.28 module Main where { 10.60/4.28 import qualified Prelude; 10.60/4.28 } 10.60/4.28 10.60/4.28 ---------------------------------------- 10.60/4.28 10.60/4.28 (5) Narrow (SOUND) 10.60/4.28 Haskell To QDPs 10.60/4.28 10.60/4.28 digraph dp_graph { 10.60/4.28 node [outthreshold=100, inthreshold=100];1[label="notElem",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3]; 10.60/4.28 3[label="notElem xv3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3]; 10.60/4.28 4[label="notElem xv3 xv4",fontsize=16,color="black",shape="triangle"];4 -> 5[label="",style="solid", color="black", weight=3]; 10.60/4.28 5[label="all . (/=)",fontsize=16,color="black",shape="box"];5 -> 6[label="",style="solid", color="black", weight=3]; 10.60/4.28 6[label="all ((/=) xv3) xv4",fontsize=16,color="black",shape="box"];6 -> 7[label="",style="solid", color="black", weight=3]; 10.60/4.28 7[label="and . map ((/=) xv3)",fontsize=16,color="black",shape="box"];7 -> 8[label="",style="solid", color="black", weight=3]; 10.60/4.28 8[label="and (map ((/=) xv3) xv4)",fontsize=16,color="black",shape="box"];8 -> 9[label="",style="solid", color="black", weight=3]; 10.60/4.28 9[label="foldr (&&) True (map ((/=) xv3) xv4)",fontsize=16,color="burlywood",shape="triangle"];812[label="xv4/xv40 : xv41",fontsize=10,color="white",style="solid",shape="box"];9 -> 812[label="",style="solid", color="burlywood", weight=9]; 10.60/4.28 812 -> 10[label="",style="solid", color="burlywood", weight=3]; 10.60/4.28 813[label="xv4/[]",fontsize=10,color="white",style="solid",shape="box"];9 -> 813[label="",style="solid", color="burlywood", weight=9]; 10.60/4.28 813 -> 11[label="",style="solid", color="burlywood", weight=3]; 10.60/4.28 10[label="foldr (&&) True (map ((/=) xv3) (xv40 : xv41))",fontsize=16,color="black",shape="box"];10 -> 12[label="",style="solid", color="black", weight=3]; 10.60/4.28 11[label="foldr (&&) True (map ((/=) xv3) [])",fontsize=16,color="black",shape="box"];11 -> 13[label="",style="solid", color="black", weight=3]; 10.60/4.28 12[label="foldr (&&) True (((/=) xv3 xv40) : map ((/=) xv3) xv41)",fontsize=16,color="black",shape="box"];12 -> 14[label="",style="solid", color="black", weight=3]; 10.60/4.28 13[label="foldr (&&) True []",fontsize=16,color="black",shape="box"];13 -> 15[label="",style="solid", color="black", weight=3]; 10.60/4.28 14 -> 19[label="",style="dashed", color="red", weight=0]; 10.60/4.28 14[label="(&&) (/=) xv3 xv40 foldr (&&) True (map ((/=) xv3) xv41)",fontsize=16,color="magenta"];14 -> 20[label="",style="dashed", color="magenta", 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