Average Error: 0 → 0
Time: 438.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 r760107 = 1.0;
        double r760108 = 2.0;
        double r760109 = r760107 / r760108;
        double r760110 = x;
        double r760111 = y;
        double r760112 = r760110 + r760111;
        double r760113 = r760109 * r760112;
        return r760113;
}
↓
double f(double x, double y) {
        double r760114 = 1.0;
        double r760115 = 2.0;
        double r760116 = r760114 / r760115;
        double r760117 = x;
        double r760118 = y;
        double r760119 = r760117 + r760118;
        double r760120 = r760116 * r760119;
        return r760120;
}

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