Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487599427
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
n142.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
5.57094407082 seconds
cpu usage
13.987793741
max memory
7.63916288E8
stage attributes
key
value
output-size
52455
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.hs /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.hs # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty H-Termination with start terms of the given HASKELL could be proven: (0) HASKELL (1) BR [EQUIVALENT, 0 ms] (2) HASKELL (3) COR [EQUIVALENT, 21 ms] (4) HASKELL (5) Narrow [SOUND, 0 ms] (6) AND (7) QDP (8) TransformationProof [EQUIVALENT, 0 ms] (9) QDP (10) UsableRulesProof [EQUIVALENT, 0 ms] (11) QDP (12) QReductionProof [EQUIVALENT, 0 ms] (13) QDP (14) QDPSizeChangeProof [EQUIVALENT, 0 ms] (15) YES (16) QDP (17) QDPSizeChangeProof [EQUIVALENT, 0 ms] (18) YES (19) QDP (20) QDPSizeChangeProof [EQUIVALENT, 0 ms] (21) YES (22) QDP (23) TransformationProof [EQUIVALENT, 0 ms] (24) QDP (25) UsableRulesProof [EQUIVALENT, 0 ms] (26) QDP (27) QReductionProof [EQUIVALENT, 0 ms] (28) QDP (29) QDPSizeChangeProof [EQUIVALENT, 0 ms] (30) YES ---------------------------------------- (0) Obligation: mainModule Main module Maybe where { import qualified List; import qualified Main; import qualified Prelude; } module List where { import qualified Main; import qualified Maybe; import qualified Prelude; isPrefixOf :: Eq a => [a] -> [a] -> Bool; isPrefixOf [] _ = True; isPrefixOf _ [] = False; isPrefixOf (x : xs) (y : ys) = x == y && isPrefixOf xs ys; isSuffixOf :: Eq a => [a] -> [a] -> Bool; isSuffixOf x y = reverse x `isPrefixOf` reverse y; } module Main where { import qualified List; import qualified Maybe; import qualified Prelude; } ---------------------------------------- (1) BR (EQUIVALENT) Replaced joker patterns by fresh variables and removed binding patterns. ---------------------------------------- (2) Obligation: mainModule Main module Maybe where { import qualified List; import qualified Main; import qualified Prelude; } module List where { import qualified Main; import qualified Maybe; import qualified Prelude; isPrefixOf :: Eq a => [a] -> [a] -> Bool; isPrefixOf [] wu = True; isPrefixOf wv [] = False; isPrefixOf (x : xs) (y : ys) = x == y && isPrefixOf xs ys; isSuffixOf :: Eq a => [a] -> [a] -> Bool; isSuffixOf x y = reverse x `isPrefixOf` reverse y;
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell