Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487599084
details
property
value
status
complete
benchmark
List_transpose_1.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n143.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
5.36008620262 seconds
cpu usage
13.351183888
max memory
7.305216E8
stage attributes
key
value
output-size
19248
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) LR [EQUIVALENT, 0 ms] (2) HASKELL (3) CR [EQUIVALENT, 0 ms] (4) HASKELL (5) BR [EQUIVALENT, 0 ms] (6) HASKELL (7) COR [EQUIVALENT, 23 ms] (8) HASKELL (9) Narrow [SOUND, 0 ms] (10) AND (11) QDP (12) QDPSizeChangeProof [EQUIVALENT, 0 ms] (13) YES (14) QDP (15) QDPSizeChangeProof [EQUIVALENT, 0 ms] (16) YES (17) QDP (18) QDPSizeChangeProof [EQUIVALENT, 8 ms] (19) 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; transpose :: [[a]] -> [[a]]; transpose [] = []; transpose ([] : xss) = transpose xss; transpose ((x : xs) : xss) = (x : concatMap (\vv3 ->case vv3 of { h : t-> h : []; _-> []; } ) xss) : transpose (xs : concatMap (\vv4 ->case vv4 of { h : t-> t : []; _-> []; } ) xss); } module Main where { import qualified List; import qualified Maybe; import qualified Prelude; } ---------------------------------------- (1) LR (EQUIVALENT) Lambda Reductions: The following Lambda expression "\vv3->case vv3 of { h : t -> h : []; _ -> []} " is transformed to "transpose0 vv3 = case vv3 of { h : t -> h : []; _ -> []} ; " The following Lambda expression "\vv4->case vv4 of { h : t -> t : []; _ -> []} " is transformed to "transpose1 vv4 = case vv4 of { h : t -> t : []; _ -> []} ; " ---------------------------------------- (2) Obligation: mainModule Main module Maybe where {
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell