Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487598147
details
property
value
status
complete
benchmark
scanr1_1.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n138.star.cs.uiowa.edu
space
basic_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.20286202431 seconds
cpu usage
10.1185122
max memory
5.66976512E8
stage attributes
key
value
output-size
8885
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) MRRProof [EQUIVALENT, 28 ms] (8) QDP (9) DependencyGraphProof [EQUIVALENT, 0 ms] (10) TRUE ---------------------------------------- (0) Obligation: mainModule Main module Main where { import qualified Prelude; data List a = Cons a (List a) | Nil ; scanr1 :: (a -> a -> a) -> List a -> List a; scanr1 f Nil = Nil; scanr1 f (Cons x Nil) = Cons x Nil; scanr1 f (Cons x xs) = Cons (f x (scanr1Q f xs)) (scanr1Qs f xs); scanr1Q vw vx = scanr1Q1 vw vx (scanr1Vu41 vw vx); scanr1Q1 vw vx (Cons q vv) = q; scanr1Qs vw vx = scanr1Qs0 vw vx (scanr1Vu41 vw vx); scanr1Qs0 vw vx qs = qs; scanr1Vu41 vw vx = scanr1 vw vx; } ---------------------------------------- (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 ; scanr1 :: (a -> a -> a) -> List a -> List a; scanr1 f Nil = Nil; scanr1 f (Cons x Nil) = Cons x Nil; scanr1 f (Cons x xs) = Cons (f x (scanr1Q f xs)) (scanr1Qs f xs); scanr1Q vw vx = scanr1Q1 vw vx (scanr1Vu41 vw vx); scanr1Q1 vw vx (Cons q vv) = q; scanr1Qs vw vx = scanr1Qs0 vw vx (scanr1Vu41 vw vx); scanr1Qs0 vw vx qs = qs; scanr1Vu41 vw vx = scanr1 vw vx; } ---------------------------------------- (3) COR (EQUIVALENT) Cond Reductions: The following Function with conditions "undefined |Falseundefined; " is transformed to "undefined = undefined1; " "undefined0 True = undefined; " "undefined1 = undefined0 False; " ---------------------------------------- (4)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell