Average Error: 0 → 0
Time: 364.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 r926302 = 1.0;
        double r926303 = 2.0;
        double r926304 = r926302 / r926303;
        double r926305 = x;
        double r926306 = y;
        double r926307 = r926305 + r926306;
        double r926308 = r926304 * r926307;
        return r926308;
}
↓
double f(double x, double y) {
        double r926309 = 1.0;
        double r926310 = 2.0;
        double r926311 = r926309 / r926310;
        double r926312 = x;
        double r926313 = y;
        double r926314 = r926312 + r926313;
        double r926315 = r926311 * r926314;
        return r926315;
}

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