details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	7.00982 seconds
cpu usage	13.4715
user time	13.1277
system time	0.343757
max virtual memory	1.8285568E7
max residence set size	681248.0

stage attributes

key	value
starexec-result	YES

output

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