Average Error: 0 → 0
Time: 448.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 r859704 = 1.0;
        double r859705 = 2.0;
        double r859706 = r859704 / r859705;
        double r859707 = x;
        double r859708 = y;
        double r859709 = r859707 + r859708;
        double r859710 = r859706 * r859709;
        return r859710;
}
↓
double f(double x, double y) {
        double r859711 = 1.0;
        double r859712 = 2.0;
        double r859713 = r859711 / r859712;
        double r859714 = x;
        double r859715 = y;
        double r859716 = r859714 + r859715;
        double r859717 = r859713 * r859716;
        return r859717;
}

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 2020046 
(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)))