details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	6.77324 seconds
cpu usage	13.0544
user time	12.7088
system time	0.345613
max virtual memory	1.8285568E7
max residence set size	696872.0

stage attributes

key	value
starexec-result	YES

output

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