Average Error: 0 → 0
Time: 511.0ms
Precision: binary64
\[\frac{1}{2} \cdot \left(x + y\right)\]
↓
\[0.5 \cdot \left(x + y\right)\]
\frac{1}{2} \cdot \left(x + y\right)
↓
0.5 \cdot \left(x + y\right)
(FPCore (x y) :precision binary64 (* (/ 1.0 2.0) (+ x y)))
↓
(FPCore (x y) :precision binary64 (* 0.5 (+ x y)))
double code(double x, double y) {
	return (1.0 / 2.0) * (x + y);
}
↓
double code(double x, double y) {
	return 0.5 * (x + y);
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original0
Target0
Herbie0
\[\frac{x + y}{2}\]

Derivation

  1. Initial program 0

    \[\frac{1}{2} \cdot \left(x + y\right)\]

  2. Simplified0

    \[\leadsto \color{blue}{0.5 \cdot \left(x + y\right)}\]

  3. Final simplification0

    \[\leadsto 0.5 \cdot \left(x + y\right)\]

Reproduce

herbie shell --seed 2020224 
(FPCore (x y)
  :name "Diagrams.Solve.Polynomial:cubForm  from diagrams-solve-0.1, G"
  :precision binary64

  :herbie-target
  (/ (+ x y) 2.0)

  (* (/ 1.0 2.0) (+ x y)))