Average Error: 0 → 0
Time: 1.5s
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 r34682381 = 1.0;
        double r34682382 = 2.0;
        double r34682383 = r34682381 / r34682382;
        double r34682384 = x;
        double r34682385 = y;
        double r34682386 = r34682384 + r34682385;
        double r34682387 = r34682383 * r34682386;
        return r34682387;
}
↓
double f(double x, double y) {
        double r34682388 = 1.0;
        double r34682389 = 2.0;
        double r34682390 = r34682388 / r34682389;
        double r34682391 = x;
        double r34682392 = y;
        double r34682393 = r34682391 + r34682392;
        double r34682394 = r34682390 * r34682393;
        return r34682394;
}

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 2019171 
(FPCore (x y)
  :name "Diagrams.Solve.Polynomial:cubForm  from diagrams-solve-0.1, G"

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

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