Average Error: 0 → 0
Time: 709.0ms
Precision: 64
\[\frac{1}{2} \cdot \left(x + y\right)\]
↓
\[\frac{1}{2} \cdot \left(x + y\right)\]
\frac{1}{2} \cdot \left(x + y\right)
↓
\frac{1}{2} \cdot \left(x + y\right)
double f(double x, double y) {
        double r462369 = 1.0;
        double r462370 = 2.0;
        double r462371 = r462369 / r462370;
        double r462372 = x;
        double r462373 = y;
        double r462374 = r462372 + r462373;
        double r462375 = r462371 * r462374;
        return r462375;
}
↓
double f(double x, double y) {
        double r462376 = 1.0;
        double r462377 = 2.0;
        double r462378 = r462376 / r462377;
        double r462379 = x;
        double r462380 = y;
        double r462381 = r462379 + r462380;
        double r462382 = r462378 * r462381;
        return r462382;
}

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. Final simplification0

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

Reproduce

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

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

  (* (/ 1 2) (+ x y)))