details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	7.06316 seconds
cpu usage	19.0189
user time	18.4676
system time	0.551315
max virtual memory	1.8285568E7
max residence set size	1423700.0

stage attributes

key	value
starexec-result	YES

output

16.82/6.43 YES 18.93/7.01 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 18.93/7.01 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 18.93/7.01 18.93/7.01 18.93/7.01 H-Termination with start terms of the given HASKELL could be proven: 18.93/7.01 18.93/7.01 (0) HASKELL 18.93/7.01 (1) IFR [EQUIVALENT, 0 ms] 18.93/7.01 (2) HASKELL 18.93/7.01 (3) BR [EQUIVALENT, 0 ms] 18.93/7.01 (4) HASKELL 18.93/7.01 (5) COR [EQUIVALENT, 27 ms] 18.93/7.01 (6) HASKELL 18.93/7.01 (7) Narrow [SOUND, 0 ms] 18.93/7.01 (8) QDP 18.93/7.01 (9) DependencyGraphProof [EQUIVALENT, 5 ms] 18.93/7.01 (10) AND 18.93/7.01 (11) QDP 18.93/7.01 (12) QDPSizeChangeProof [EQUIVALENT, 0 ms] 18.93/7.01 (13) YES 18.93/7.01 (14) QDP 18.93/7.01 (15) QDPSizeChangeProof [EQUIVALENT, 0 ms] 18.93/7.01 (16) YES 18.93/7.01 (17) QDP 18.93/7.01 (18) QDPSizeChangeProof [EQUIVALENT, 0 ms] 18.93/7.01 (19) YES 18.93/7.01 (20) QDP 18.93/7.01 (21) QDPSizeChangeProof [EQUIVALENT, 0 ms] 18.93/7.01 (22) YES 18.93/7.01 18.93/7.01 18.93/7.01 ---------------------------------------- 18.93/7.01 18.93/7.01 (0) 18.93/7.01 Obligation: 18.93/7.01 mainModule Main 18.93/7.01 module Maybe where { 18.93/7.01 import qualified List; 18.93/7.01 import qualified Main; 18.93/7.01 import qualified Prelude; 18.93/7.01 } 18.93/7.01 module List where { 18.93/7.01 import qualified Main; 18.93/7.01 import qualified Maybe; 18.93/7.01 import qualified Prelude; 18.93/7.01 delete :: Eq a => a -> [a] -> [a]; 18.93/7.01 delete = deleteBy (==); 18.93/7.01 18.93/7.01 deleteBy :: (a -> a -> Bool) -> a -> [a] -> [a]; 18.93/7.01 deleteBy _ _ [] = []; 18.93/7.01 deleteBy eq x (y : ys) = if x `eq` y then ys else y : deleteBy eq x ys; 18.93/7.01 18.93/7.01 } 18.93/7.01 module Main where { 18.93/7.01 import qualified List; 18.93/7.01 import qualified Maybe; 18.93/7.01 import qualified Prelude; 18.93/7.01 } 18.93/7.01 18.93/7.01 ---------------------------------------- 18.93/7.01 18.93/7.01 (1) IFR (EQUIVALENT) 18.93/7.01 If Reductions: 18.93/7.01 The following If expression 18.93/7.01 "if eq x y then ys else y : deleteBy eq x ys" 18.93/7.01 is transformed to 18.93/7.01 "deleteBy0 ys y eq x True = ys; 18.93/7.01 deleteBy0 ys y eq x False = y : deleteBy eq x ys; 18.93/7.01 " 18.93/7.01 18.93/7.01 ---------------------------------------- 18.93/7.01 18.93/7.01 (2) 18.93/7.01 Obligation: 18.93/7.01 mainModule Main 18.93/7.01 module Maybe where { 18.93/7.01 import qualified List; 18.93/7.01 import qualified Main; 18.93/7.01 import qualified Prelude; 18.93/7.01 } 18.93/7.01 module List where { 18.93/7.01 import qualified Main; 18.93/7.01 import qualified Maybe; 18.93/7.01 import qualified Prelude; 18.93/7.01 delete :: Eq a => a -> [a] -> [a]; 18.93/7.01 delete = deleteBy (==); 18.93/7.01 18.93/7.01 deleteBy :: (a -> a -> Bool) -> a -> [a] -> [a]; 18.93/7.01 deleteBy _ _ [] = []; 18.93/7.01 deleteBy eq x (y : ys) = deleteBy0 ys y eq x (x `eq` y); 18.93/7.01 18.93/7.01 deleteBy0 ys y eq x True = ys; 18.93/7.01 deleteBy0 ys y eq x False = y : deleteBy eq x ys; 18.93/7.01 18.93/7.01 } 18.93/7.01 module Main where { 18.93/7.01 import qualified List; 18.93/7.01 import qualified Maybe; 18.93/7.01 import qualified Prelude; popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Haskell 2019-04-01 06.52