Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487598444
details
property
value
status
complete
benchmark
toEnum_7.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n092.star.cs.uiowa.edu
space
basic_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.2415189743 seconds
cpu usage
9.98228079
max memory
5.8597376E8
stage attributes
key
value
output-size
14444
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 [EQUIVALENT, 31 ms] (6) YES ---------------------------------------- (0) Obligation: mainModule Main module Main where { import qualified Prelude; data MyBool = MyTrue | MyFalse ; data MyInt = Pos Main.Nat | Neg Main.Nat ; data Main.Nat = Succ Main.Nat | Zero ; data Ordering = LT | EQ | GT ; esEsMyInt :: MyInt -> MyInt -> MyBool; esEsMyInt = primEqInt; primEqInt :: MyInt -> MyInt -> MyBool; primEqInt (Main.Pos (Main.Succ x)) (Main.Pos (Main.Succ y)) = primEqNat x y; primEqInt (Main.Neg (Main.Succ x)) (Main.Neg (Main.Succ y)) = primEqNat x y; primEqInt (Main.Pos Main.Zero) (Main.Neg Main.Zero) = MyTrue; primEqInt (Main.Neg Main.Zero) (Main.Pos Main.Zero) = MyTrue; primEqInt (Main.Neg Main.Zero) (Main.Neg Main.Zero) = MyTrue; primEqInt (Main.Pos Main.Zero) (Main.Pos Main.Zero) = MyTrue; primEqInt vv vw = MyFalse; primEqNat :: Main.Nat -> Main.Nat -> MyBool; primEqNat Main.Zero Main.Zero = MyTrue; primEqNat Main.Zero (Main.Succ y) = MyFalse; primEqNat (Main.Succ x) Main.Zero = MyFalse; primEqNat (Main.Succ x) (Main.Succ y) = primEqNat x y; toEnum0 MyTrue vx = GT; toEnum1 vx = toEnum0 (esEsMyInt vx (Main.Pos (Main.Succ (Main.Succ Main.Zero)))) vx; toEnum2 MyTrue vy = EQ; toEnum2 vz wu = toEnum1 wu; toEnum3 vy = toEnum2 (esEsMyInt vy (Main.Pos (Main.Succ Main.Zero))) vy; toEnum3 wv = toEnum1 wv; toEnum4 MyTrue ww = LT; toEnum4 wx wy = toEnum3 wy; toEnum5 ww = toEnum4 (esEsMyInt ww (Main.Pos Main.Zero)) ww; toEnum5 wz = toEnum3 wz; toEnumOrdering :: MyInt -> Ordering; toEnumOrdering ww = toEnum5 ww; toEnumOrdering vy = toEnum3 vy; toEnumOrdering vx = toEnum1 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 MyBool = MyTrue | MyFalse ; data MyInt = Pos Main.Nat | Neg Main.Nat ; data Main.Nat = Succ Main.Nat | Zero ; data Ordering = LT | EQ | GT ; esEsMyInt :: MyInt -> MyInt -> MyBool; esEsMyInt = primEqInt;
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell