details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.07467 seconds
cpu usage	9.79235
user time	9.48197
system time	0.310379
max virtual memory	1.8288216E7
max residence set size	601388.0

stage attributes

key	value
starexec-result	MAYBE

output

7.89/3.53 MAYBE 9.63/4.02 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 9.63/4.02 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 9.63/4.02 9.63/4.02 9.63/4.02 H-Termination with start terms of the given HASKELL could not be shown: 9.63/4.02 9.63/4.02 (0) HASKELL 9.63/4.02 (1) BR [EQUIVALENT, 0 ms] 9.63/4.02 (2) HASKELL 9.63/4.02 (3) COR [EQUIVALENT, 0 ms] 9.63/4.02 (4) HASKELL 9.63/4.02 (5) Narrow [SOUND, 0 ms] 9.63/4.02 (6) QDP 9.63/4.02 (7) NonTerminationLoopProof [COMPLETE, 0 ms] 9.63/4.02 (8) NO 9.63/4.02 (9) Narrow [COMPLETE, 0 ms] 9.63/4.02 (10) QDP 9.63/4.02 (11) PisEmptyProof [EQUIVALENT, 0 ms] 9.63/4.02 (12) YES 9.63/4.02 9.63/4.02 9.63/4.02 ---------------------------------------- 9.63/4.02 9.63/4.02 (0) 9.63/4.02 Obligation: 9.63/4.02 mainModule Main 9.63/4.02 module Main where { 9.63/4.02 import qualified Prelude; 9.63/4.02 data MyBool = MyTrue | MyFalse ; 9.63/4.02 9.63/4.02 until :: (a -> MyBool) -> (a -> a) -> a -> a; 9.63/4.02 until p f x = until0 x p f (p x); 9.63/4.02 9.63/4.02 until0 x p f MyTrue = x; 9.63/4.02 until0 x p f MyFalse = until p f (f x); 9.63/4.02 9.63/4.02 } 9.63/4.02 9.63/4.02 ---------------------------------------- 9.63/4.02 9.63/4.02 (1) BR (EQUIVALENT) 9.63/4.02 Replaced joker patterns by fresh variables and removed binding patterns. 9.63/4.02 ---------------------------------------- 9.63/4.02 9.63/4.02 (2) 9.63/4.02 Obligation: 9.63/4.02 mainModule Main 9.63/4.02 module Main where { 9.63/4.02 import qualified Prelude; 9.63/4.02 data MyBool = MyTrue | MyFalse ; 9.63/4.02 9.63/4.02 until :: (a -> MyBool) -> (a -> a) -> a -> a; 9.63/4.02 until p f x = until0 x p f (p x); 9.63/4.02 9.63/4.02 until0 x p f MyTrue = x; 9.63/4.02 until0 x p f MyFalse = until p f (f x); 9.63/4.02 9.63/4.02 } 9.63/4.02 9.63/4.02 ---------------------------------------- 9.63/4.02 9.63/4.02 (3) COR (EQUIVALENT) 9.63/4.02 Cond Reductions: 9.63/4.02 The following Function with conditions 9.63/4.02 "undefined |Falseundefined; 9.63/4.02 " 9.63/4.02 is transformed to 9.63/4.02 "undefined = undefined1; 9.63/4.02 " 9.63/4.02 "undefined0 True = undefined; 9.63/4.02 " 9.63/4.02 "undefined1 = undefined0 False; 9.63/4.02 " 9.63/4.02 9.63/4.02 ---------------------------------------- 9.63/4.02 9.63/4.02 (4) 9.63/4.02 Obligation: 9.63/4.02 mainModule Main 9.63/4.02 module Main where { 9.63/4.02 import qualified Prelude; 9.63/4.02 data MyBool = MyTrue | MyFalse ; 9.63/4.02 9.63/4.02 until :: (a -> MyBool) -> (a -> a) -> a -> a; 9.63/4.02 until p f x = until0 x p f (p x); 9.63/4.02 9.63/4.02 until0 x p f MyTrue = x; 9.63/4.02 until0 x p f MyFalse = until p f (f x); 9.63/4.02 9.63/4.02 } 9.63/4.02 9.63/4.02 ---------------------------------------- 9.63/4.02 9.63/4.02 (5) Narrow (SOUND) 9.63/4.02 Haskell To QDPs 9.63/4.02 9.63/4.02 digraph dp_graph { 9.63/4.02 node [outthreshold=100, inthreshold=100];1[label="until",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3]; 9.63/4.02 3[label="until vx3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", 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