Average Error: 0 → 0
Time: 568.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 r731816 = 1.0;
        double r731817 = 2.0;
        double r731818 = r731816 / r731817;
        double r731819 = x;
        double r731820 = y;
        double r731821 = r731819 + r731820;
        double r731822 = r731818 * r731821;
        return r731822;
}
↓
double f(double x, double y) {
        double r731823 = 1.0;
        double r731824 = 2.0;
        double r731825 = r731823 / r731824;
        double r731826 = x;
        double r731827 = y;
        double r731828 = r731826 + r731827;
        double r731829 = r731825 * r731828;
        return r731829;
}

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