Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487598226
details
property
value
status
complete
benchmark
lookup_6.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n139.star.cs.uiowa.edu
space
basic_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.254789114 seconds
cpu usage
10.443516943
max memory
5.86489856E8
stage attributes
key
value
output-size
19422
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, 0 ms] (4) HASKELL (5) Narrow [SOUND, 0 ms] (6) QDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) AND (9) QDP (10) QDPSizeChangeProof [EQUIVALENT, 0 ms] (11) YES (12) QDP (13) QDPSizeChangeProof [EQUIVALENT, 0 ms] (14) YES (15) QDP (16) QDPSizeChangeProof [EQUIVALENT, 0 ms] (17) YES ---------------------------------------- (0) Obligation: mainModule Main module Main where { import qualified Prelude; data List a = Cons a (List a) | Nil ; data Main.Maybe a = Nothing | Just a ; data MyBool = MyTrue | MyFalse ; data Ordering = LT | EQ | GT ; data Tup2 b a = Tup2 b a ; esEsOrdering :: Ordering -> Ordering -> MyBool; esEsOrdering LT LT = MyTrue; esEsOrdering LT EQ = MyFalse; esEsOrdering LT GT = MyFalse; esEsOrdering EQ LT = MyFalse; esEsOrdering EQ EQ = MyTrue; esEsOrdering EQ GT = MyFalse; esEsOrdering GT LT = MyFalse; esEsOrdering GT EQ = MyFalse; esEsOrdering GT GT = MyTrue; lookup k Nil = lookup3 k Nil; lookup k (Cons (Tup2 x y) xys) = lookup2 k (Cons (Tup2 x y) xys); lookup0 k x y xys MyTrue = lookup k xys; lookup1 k x y xys MyTrue = Main.Just y; lookup1 k x y xys MyFalse = lookup0 k x y xys otherwise; lookup2 k (Cons (Tup2 x y) xys) = lookup1 k x y xys (esEsOrdering k x); lookup3 k Nil = Main.Nothing; lookup3 vy vz = lookup2 vy vz; otherwise :: MyBool; otherwise = MyTrue; } ---------------------------------------- (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 Main.Maybe a = Nothing | Just a ; data MyBool = MyTrue | MyFalse ; data Ordering = LT | EQ | GT ; data Tup2 b a = Tup2 b a ;
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell