details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	7.74704 seconds
cpu usage	20.3413
user time	19.691
system time	0.650334
max virtual memory	1.8285568E7
max residence set size	1988456.0

stage attributes

key	value
starexec-result	YES

output

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

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52