details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	6.7695 seconds
cpu usage	13.4552
user time	13.1076
system time	0.347621
max virtual memory	1.828352E7
max residence set size	690784.0

stage attributes

key	value
starexec-result	YES

output

11.35/4.68 YES 13.25/5.17 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 13.25/5.17 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 13.25/5.17 13.25/5.17 13.25/5.17 H-Termination with start terms of the given HASKELL could be proven: 13.25/5.17 13.25/5.17 (0) HASKELL 13.25/5.17 (1) BR [EQUIVALENT, 0 ms] 13.25/5.17 (2) HASKELL 13.25/5.17 (3) COR [EQUIVALENT, 21 ms] 13.25/5.17 (4) HASKELL 13.25/5.17 (5) Narrow [SOUND, 0 ms] 13.25/5.17 (6) AND 13.25/5.17 (7) QDP 13.25/5.17 (8) QDPSizeChangeProof [EQUIVALENT, 0 ms] 13.25/5.17 (9) YES 13.25/5.17 (10) QDP 13.25/5.17 (11) TransformationProof [EQUIVALENT, 0 ms] 13.25/5.17 (12) QDP 13.25/5.17 (13) UsableRulesProof [EQUIVALENT, 0 ms] 13.25/5.17 (14) QDP 13.25/5.17 (15) QReductionProof [EQUIVALENT, 0 ms] 13.25/5.17 (16) QDP 13.25/5.17 (17) QDPSizeChangeProof [EQUIVALENT, 0 ms] 13.25/5.17 (18) YES 13.25/5.17 (19) QDP 13.25/5.17 (20) QDPSizeChangeProof [EQUIVALENT, 0 ms] 13.25/5.17 (21) YES 13.25/5.17 (22) QDP 13.25/5.17 (23) TransformationProof [EQUIVALENT, 0 ms] 13.25/5.17 (24) QDP 13.25/5.17 (25) UsableRulesProof [EQUIVALENT, 0 ms] 13.25/5.17 (26) QDP 13.25/5.17 (27) QReductionProof [EQUIVALENT, 0 ms] 13.25/5.17 (28) QDP 13.25/5.17 (29) QDPSizeChangeProof [EQUIVALENT, 0 ms] 13.25/5.17 (30) YES 13.25/5.17 13.25/5.17 13.25/5.17 ---------------------------------------- 13.25/5.17 13.25/5.17 (0) 13.25/5.17 Obligation: 13.25/5.17 mainModule Main 13.25/5.17 module Maybe where { 13.25/5.17 import qualified List; 13.25/5.17 import qualified Main; 13.25/5.17 import qualified Prelude; 13.25/5.17 } 13.25/5.17 module List where { 13.25/5.17 import qualified Main; 13.25/5.17 import qualified Maybe; 13.25/5.17 import qualified Prelude; 13.25/5.17 isPrefixOf :: Eq a => [a] -> [a] -> Bool; 13.25/5.17 isPrefixOf [] _ = True; 13.25/5.17 isPrefixOf _ [] = False; 13.25/5.17 isPrefixOf (x : xs) (y : ys) = x == y && isPrefixOf xs ys; 13.25/5.17 13.25/5.17 isSuffixOf :: Eq a => [a] -> [a] -> Bool; 13.25/5.17 isSuffixOf x y = reverse x `isPrefixOf` reverse y; 13.25/5.17 13.25/5.17 } 13.25/5.17 module Main where { 13.25/5.17 import qualified List; 13.25/5.17 import qualified Maybe; 13.25/5.17 import qualified Prelude; 13.25/5.17 } 13.25/5.17 13.25/5.17 ---------------------------------------- 13.25/5.17 13.25/5.17 (1) BR (EQUIVALENT) 13.25/5.17 Replaced joker patterns by fresh variables and removed binding patterns. 13.25/5.17 ---------------------------------------- 13.25/5.17 13.25/5.17 (2) 13.25/5.17 Obligation: 13.25/5.17 mainModule Main 13.25/5.17 module Maybe where { 13.25/5.17 import qualified List; 13.25/5.17 import qualified Main; 13.25/5.17 import qualified Prelude; 13.25/5.17 } 13.25/5.17 module List where { 13.25/5.17 import qualified Main; 13.25/5.17 import qualified Maybe; 13.25/5.17 import qualified Prelude; 13.25/5.17 isPrefixOf :: Eq a => [a] -> [a] -> Bool; 13.25/5.17 isPrefixOf [] wu = True; 13.25/5.17 isPrefixOf wv [] = False; 13.25/5.17 isPrefixOf (x : xs) (y : ys) = x == y && isPrefixOf xs ys; 13.25/5.17 13.25/5.17 isSuffixOf :: Eq a => [a] -> [a] -> Bool; 13.25/5.17 isSuffixOf x y = reverse x `isPrefixOf` reverse y; 13.25/5.17 13.25/5.17 } 13.25/5.17 module Main where { 13.25/5.17 import qualified List; 13.25/5.17 import qualified Maybe; 13.25/5.17 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