Average Error: 0 → 0
Time: 397.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 r824534 = 1.0;
        double r824535 = 2.0;
        double r824536 = r824534 / r824535;
        double r824537 = x;
        double r824538 = y;
        double r824539 = r824537 + r824538;
        double r824540 = r824536 * r824539;
        return r824540;
}
↓
double f(double x, double y) {
        double r824541 = 1.0;
        double r824542 = 2.0;
        double r824543 = r824541 / r824542;
        double r824544 = x;
        double r824545 = y;
        double r824546 = r824544 + r824545;
        double r824547 = r824543 * r824546;
        return r824547;
}

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 2020027 +o rules:numerics
(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)))