Average Error: 0 → 0
Time: 445.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 r768532 = 1.0;
        double r768533 = 2.0;
        double r768534 = r768532 / r768533;
        double r768535 = x;
        double r768536 = y;
        double r768537 = r768535 + r768536;
        double r768538 = r768534 * r768537;
        return r768538;
}
↓
double f(double x, double y) {
        double r768539 = 1.0;
        double r768540 = 2.0;
        double r768541 = r768539 / r768540;
        double r768542 = x;
        double r768543 = y;
        double r768544 = r768542 + r768543;
        double r768545 = r768541 * r768544;
        return r768545;
}

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