Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487598150
details
property
value
status
complete
benchmark
odd_1.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n146.star.cs.uiowa.edu
space
basic_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.17975401878 seconds
cpu usage
10.020993277
max memory
5.75373312E8
stage attributes
key
value
output-size
7760
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) QDPSizeChangeProof [EQUIVALENT, 0 ms] (8) 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 ; evenMyInt :: MyInt -> MyBool; evenMyInt = primEvenInt; not :: MyBool -> MyBool; not MyTrue = MyFalse; not MyFalse = MyTrue; oddMyInt :: MyInt -> MyBool; oddMyInt = pt not evenMyInt; primEvenInt :: MyInt -> MyBool; primEvenInt (Main.Pos x) = primEvenNat x; primEvenInt (Main.Neg x) = primEvenNat x; primEvenNat :: Main.Nat -> MyBool; primEvenNat Main.Zero = MyTrue; primEvenNat (Main.Succ Main.Zero) = MyFalse; primEvenNat (Main.Succ (Main.Succ x)) = primEvenNat x; pt :: (b -> a) -> (c -> b) -> c -> a; pt f g x = f (g x); } ---------------------------------------- (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 ; evenMyInt :: MyInt -> MyBool; evenMyInt = primEvenInt; not :: MyBool -> MyBool; not MyTrue = MyFalse; not MyFalse = MyTrue; oddMyInt :: MyInt -> MyBool; oddMyInt = pt not evenMyInt; primEvenInt :: MyInt -> MyBool; primEvenInt (Main.Pos x) = primEvenNat x; primEvenInt (Main.Neg x) = primEvenNat x; primEvenNat :: Main.Nat -> MyBool; primEvenNat Main.Zero = MyTrue; primEvenNat (Main.Succ Main.Zero) = MyFalse; primEvenNat (Main.Succ (Main.Succ x)) = primEvenNat x; pt :: (a -> b) -> (c -> a) -> c -> b; pt f g x = f (g x);
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell