Average Error: 0 → 0
Time: 512.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 r645559 = 1.0;
        double r645560 = 2.0;
        double r645561 = r645559 / r645560;
        double r645562 = x;
        double r645563 = y;
        double r645564 = r645562 + r645563;
        double r645565 = r645561 * r645564;
        return r645565;
}
↓
double f(double x, double y) {
        double r645566 = 1.0;
        double r645567 = 2.0;
        double r645568 = r645566 / r645567;
        double r645569 = x;
        double r645570 = y;
        double r645571 = r645569 + r645570;
        double r645572 = r645568 * r645571;
        return r645572;
}

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