Average Error: 0 → 0
Time: 388.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 r764583 = 1.0;
        double r764584 = 2.0;
        double r764585 = r764583 / r764584;
        double r764586 = x;
        double r764587 = y;
        double r764588 = r764586 + r764587;
        double r764589 = r764585 * r764588;
        return r764589;
}
↓
double f(double x, double y) {
        double r764590 = 1.0;
        double r764591 = 2.0;
        double r764592 = r764590 / r764591;
        double r764593 = x;
        double r764594 = y;
        double r764595 = r764593 + r764594;
        double r764596 = r764592 * r764595;
        return r764596;
}

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