Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487598127
details
property
value
status
complete
benchmark
negate_1.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n090.star.cs.uiowa.edu
space
basic_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.25425696373 seconds
cpu usage
10.02684679
max memory
5.79268608E8
stage attributes
key
value
output-size
4673
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, 33 ms] (6) YES ---------------------------------------- (0) Obligation: mainModule Main module Main where { import qualified Prelude; data Float = Float MyInt MyInt ; data MyInt = Pos Main.Nat | Neg Main.Nat ; data Main.Nat = Succ Main.Nat | Zero ; negateFloat :: Float -> Float; negateFloat = primNegFloat; negateMyInt :: MyInt -> MyInt; negateMyInt = primNegInt; primNegFloat :: Float -> Float; primNegFloat (Float x1 x2) = Float (negateMyInt x1) x2; primNegInt :: MyInt -> MyInt; primNegInt (Main.Pos x) = Main.Neg x; primNegInt (Main.Neg x) = Main.Pos 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 Float = Float MyInt MyInt ; data MyInt = Pos Main.Nat | Neg Main.Nat ; data Main.Nat = Succ Main.Nat | Zero ; negateFloat :: Float -> Float; negateFloat = primNegFloat; negateMyInt :: MyInt -> MyInt; negateMyInt = primNegInt; primNegFloat :: Float -> Float; primNegFloat (Float x1 x2) = Float (negateMyInt x1) x2; primNegInt :: MyInt -> MyInt; primNegInt (Main.Pos x) = Main.Neg x; primNegInt (Main.Neg x) = Main.Pos x; } ---------------------------------------- (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