Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487598185
details
property
value
status
complete
benchmark
span_1.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n101.star.cs.uiowa.edu
space
basic_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.28585195541 seconds
cpu usage
10.69067507
max memory
6.12237312E8
stage attributes
key
value
output-size
10473
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.hs /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/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, 0 ms] (4) HASKELL (5) Narrow [SOUND, 0 ms] (6) QDP (7) QDPSizeChangeProof [EQUIVALENT, 0 ms] (8) YES ---------------------------------------- (0) Obligation: mainModule Main module Main where { import qualified Prelude; data List a = Cons a (List a) | Nil ; data MyBool = MyTrue | MyFalse ; data Tup2 b a = Tup2 b a ; otherwise :: MyBool; otherwise = MyTrue; span :: (a -> MyBool) -> List a -> Tup2 (List a) (List a); span p Nil = span3 p Nil; span p (Cons vv vw) = span2 p (Cons vv vw); span2 p (Cons vv vw) = span2Span1 p vw p vv vw (p vv); span2Span0 wx wy p vv vw MyTrue = Tup2 Nil (Cons vv vw); span2Span1 wx wy p vv vw MyTrue = Tup2 (Cons vv (span2Ys wx wy)) (span2Zs wx wy); span2Span1 wx wy p vv vw MyFalse = span2Span0 wx wy p vv vw otherwise; span2Vu43 wx wy = span wx wy; span2Ys wx wy = span2Ys0 wx wy (span2Vu43 wx wy); span2Ys0 wx wy (Tup2 ys vx) = ys; span2Zs wx wy = span2Zs0 wx wy (span2Vu43 wx wy); span2Zs0 wx wy (Tup2 vy zs) = zs; span3 p Nil = Tup2 Nil Nil; span3 wv ww = span2 wv ww; } ---------------------------------------- (1) BR (EQUIVALENT) Replaced joker patterns by fresh variables and removed binding patterns. ---------------------------------------- (2) Obligation: mainModule Main module Main where { import qualified Prelude; data List a = Cons a (List a) | Nil ; data MyBool = MyTrue | MyFalse ; data Tup2 b a = Tup2 b a ; otherwise :: MyBool; otherwise = MyTrue; span :: (a -> MyBool) -> List a -> Tup2 (List a) (List a); span p Nil = span3 p Nil; span p (Cons vv vw) = span2 p (Cons vv vw); span2 p (Cons vv vw) = span2Span1 p vw p vv vw (p vv); span2Span0 wx wy p vv vw MyTrue = Tup2 Nil (Cons vv vw); span2Span1 wx wy p vv vw MyTrue = Tup2 (Cons vv (span2Ys wx wy)) (span2Zs wx wy); span2Span1 wx wy p vv vw MyFalse = span2Span0 wx wy p vv vw otherwise; span2Vu43 wx wy = span wx wy; span2Ys wx wy = span2Ys0 wx wy (span2Vu43 wx wy);
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell