Average Error: 0 → 0
Time: 914.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 r484124 = 1.0;
        double r484125 = 2.0;
        double r484126 = r484124 / r484125;
        double r484127 = x;
        double r484128 = y;
        double r484129 = r484127 + r484128;
        double r484130 = r484126 * r484129;
        return r484130;
}
↓
double f(double x, double y) {
        double r484131 = 1.0;
        double r484132 = 2.0;
        double r484133 = r484131 / r484132;
        double r484134 = x;
        double r484135 = y;
        double r484136 = r484134 + r484135;
        double r484137 = r484133 * r484136;
        return r484137;
}

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