details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	9.10919 seconds
cpu usage	15.5378
user time	15.062
system time	0.475799
max virtual memory	1.8285568E7
max residence set size	1130288.0

stage attributes

key	value
starexec-result	YES

output

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

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52