Average Error: 0 → 0
Time: 425.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 r960346 = 1.0;
        double r960347 = 2.0;
        double r960348 = r960346 / r960347;
        double r960349 = x;
        double r960350 = y;
        double r960351 = r960349 + r960350;
        double r960352 = r960348 * r960351;
        return r960352;
}
↓
double f(double x, double y) {
        double r960353 = 1.0;
        double r960354 = 2.0;
        double r960355 = r960353 / r960354;
        double r960356 = x;
        double r960357 = y;
        double r960358 = r960356 + r960357;
        double r960359 = r960355 * r960358;
        return r960359;
}

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