Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell 2019-04-01 06.52 pair #433316280
details
property
value
status
complete
benchmark
List_BACKSLBACKSL_6.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n039.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.99716 seconds
cpu usage
12.6331
user time
12.2858
system time
0.347269
max virtual memory
1.8285568E7
max residence set size
686828.0
stage attributes
key
value
starexec-result
YES
output
10.34/4.37 YES 12.28/4.96 proof of /export/starexec/sandbox2/benchmark/theBenchmark.hs 12.28/4.96 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 12.28/4.96 12.28/4.96 12.28/4.96 H-Termination with start terms of the given HASKELL could be proven: 12.28/4.96 12.28/4.96 (0) HASKELL 12.28/4.96 (1) IFR [EQUIVALENT, 0 ms] 12.28/4.96 (2) HASKELL 12.28/4.96 (3) BR [EQUIVALENT, 0 ms] 12.28/4.96 (4) HASKELL 12.28/4.96 (5) COR [EQUIVALENT, 31 ms] 12.28/4.96 (6) HASKELL 12.28/4.96 (7) Narrow [SOUND, 0 ms] 12.28/4.96 (8) AND 12.28/4.96 (9) QDP 12.28/4.96 (10) DependencyGraphProof [EQUIVALENT, 0 ms] 12.28/4.96 (11) AND 12.28/4.96 (12) QDP 12.28/4.96 (13) QDPSizeChangeProof [EQUIVALENT, 0 ms] 12.28/4.96 (14) YES 12.28/4.96 (15) QDP 12.28/4.96 (16) QDPSizeChangeProof [EQUIVALENT, 0 ms] 12.28/4.96 (17) YES 12.28/4.96 (18) QDP 12.28/4.96 (19) QDPSizeChangeProof [EQUIVALENT, 0 ms] 12.28/4.96 (20) YES 12.28/4.96 12.28/4.96 12.28/4.96 ---------------------------------------- 12.28/4.96 12.28/4.96 (0) 12.28/4.96 Obligation: 12.28/4.96 mainModule Main 12.28/4.96 module Maybe where { 12.28/4.96 import qualified List; 12.28/4.96 import qualified Main; 12.28/4.96 import qualified Prelude; 12.28/4.96 } 12.28/4.96 module List where { 12.28/4.96 import qualified Main; 12.28/4.96 import qualified Maybe; 12.28/4.96 import qualified Prelude; 12.28/4.96 infix 5 \\; 12.28/4.96 (\\) :: Eq a => [a] -> [a] -> [a]; 12.28/4.96 (\\) = foldl (flip delete); 12.28/4.96 12.28/4.96 delete :: Eq a => a -> [a] -> [a]; 12.28/4.96 delete = deleteBy (==); 12.28/4.96 12.28/4.96 deleteBy :: (a -> a -> Bool) -> a -> [a] -> [a]; 12.28/4.96 deleteBy _ _ [] = []; 12.28/4.96 deleteBy eq x (y : ys) = if x `eq` y then ys else y : deleteBy eq x ys; 12.28/4.96 12.28/4.96 } 12.28/4.96 module Main where { 12.28/4.96 import qualified List; 12.28/4.96 import qualified Maybe; 12.28/4.96 import qualified Prelude; 12.28/4.96 } 12.28/4.96 12.28/4.96 ---------------------------------------- 12.28/4.96 12.28/4.96 (1) IFR (EQUIVALENT) 12.28/4.96 If Reductions: 12.28/4.96 The following If expression 12.28/4.96 "if eq x y then ys else y : deleteBy eq x ys" 12.28/4.96 is transformed to 12.28/4.96 "deleteBy0 ys y eq x True = ys; 12.28/4.96 deleteBy0 ys y eq x False = y : deleteBy eq x ys; 12.28/4.96 " 12.28/4.96 12.28/4.96 ---------------------------------------- 12.28/4.96 12.28/4.96 (2) 12.28/4.96 Obligation: 12.28/4.96 mainModule Main 12.28/4.96 module Maybe where { 12.28/4.96 import qualified List; 12.28/4.96 import qualified Main; 12.28/4.96 import qualified Prelude; 12.28/4.96 } 12.28/4.96 module List where { 12.28/4.96 import qualified Main; 12.28/4.96 import qualified Maybe; 12.28/4.96 import qualified Prelude; 12.28/4.96 infix 5 \\; 12.28/4.96 (\\) :: Eq a => [a] -> [a] -> [a]; 12.28/4.96 (\\) = foldl (flip delete); 12.28/4.96 12.28/4.96 delete :: Eq a => a -> [a] -> [a]; 12.28/4.96 delete = deleteBy (==); 12.28/4.96 12.28/4.96 deleteBy :: (a -> a -> Bool) -> a -> [a] -> [a]; 12.28/4.96 deleteBy _ _ [] = []; 12.28/4.96 deleteBy eq x (y : ys) = deleteBy0 ys y eq x (x `eq` y); 12.28/4.96 12.28/4.96 deleteBy0 ys y eq x True = ys; 12.28/4.96 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