Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487598382
details
property
value
status
complete
benchmark
rangeSize_1.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n095.star.cs.uiowa.edu
space
basic_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.33409190178 seconds
cpu usage
10.077111695
max memory
5.72338176E8
stage attributes
key
value
output-size
9931
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 [EQUIVALENT, 17 ms] (6) YES ---------------------------------------- (0) Obligation: mainModule Main module Main where { import qualified Prelude; data List a = Cons a (List a) | Nil ; data MyBool = MyTrue | MyFalse ; data MyInt = Pos Main.Nat | Neg Main.Nat ; data Main.Nat = Succ Main.Nat | Zero ; data Tup0 = Tup0 ; data Tup2 a b = Tup2 a b ; indexTup0 :: Tup2 Tup0 Tup0 -> Tup0 -> MyInt; indexTup0 (Tup2 Tup0 Tup0) Tup0 = Main.Pos Main.Zero; null :: List a -> MyBool; null Nil = MyTrue; null (Cons vx vy) = MyFalse; otherwise :: MyBool; otherwise = MyTrue; primMinusNat :: Main.Nat -> Main.Nat -> MyInt; primMinusNat Main.Zero Main.Zero = Main.Pos Main.Zero; primMinusNat Main.Zero (Main.Succ y) = Main.Neg (Main.Succ y); primMinusNat (Main.Succ x) Main.Zero = Main.Pos (Main.Succ x); primMinusNat (Main.Succ x) (Main.Succ y) = primMinusNat x y; primPlusInt :: MyInt -> MyInt -> MyInt; primPlusInt (Main.Pos x) (Main.Neg y) = primMinusNat x y; primPlusInt (Main.Neg x) (Main.Pos y) = primMinusNat y x; primPlusInt (Main.Neg x) (Main.Neg y) = Main.Neg (primPlusNat x y); primPlusInt (Main.Pos x) (Main.Pos y) = Main.Pos (primPlusNat x y); primPlusNat :: Main.Nat -> Main.Nat -> Main.Nat; primPlusNat Main.Zero Main.Zero = Main.Zero; primPlusNat Main.Zero (Main.Succ y) = Main.Succ y; primPlusNat (Main.Succ x) Main.Zero = Main.Succ x; primPlusNat (Main.Succ x) (Main.Succ y) = Main.Succ (Main.Succ (primPlusNat x y)); psMyInt :: MyInt -> MyInt -> MyInt; psMyInt = primPlusInt; rangeSize0 vv vw MyTrue = psMyInt (indexTup0 (Tup2 vv vw) vw) (Main.Pos (Main.Succ Main.Zero)); rangeSize1 vv vw MyTrue = Main.Pos Main.Zero; rangeSize1 vv vw MyFalse = rangeSize0 vv vw otherwise; rangeSize2 (Tup2 vv vw) = rangeSize1 vv vw (null (rangeTup0 (Tup2 vv vw))); rangeSizeTup0 :: Tup2 Tup0 Tup0 -> MyInt; rangeSizeTup0 (Tup2 vv vw) = rangeSize2 (Tup2 vv vw); rangeTup0 :: Tup2 Tup0 Tup0 -> List Tup0; rangeTup0 (Tup2 Tup0 Tup0) = Cons Tup0 Nil; } ---------------------------------------- (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 ;
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell