Average Error: 0 → 0
Time: 523.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 r710185 = 1.0;
        double r710186 = 2.0;
        double r710187 = r710185 / r710186;
        double r710188 = x;
        double r710189 = y;
        double r710190 = r710188 + r710189;
        double r710191 = r710187 * r710190;
        return r710191;
}
↓
double f(double x, double y) {
        double r710192 = 1.0;
        double r710193 = 2.0;
        double r710194 = r710192 / r710193;
        double r710195 = x;
        double r710196 = y;
        double r710197 = r710195 + r710196;
        double r710198 = r710194 * r710197;
        return r710198;
}

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