Average Error: 0 → 0
Time: 536.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 r670252 = 1.0;
        double r670253 = 2.0;
        double r670254 = r670252 / r670253;
        double r670255 = x;
        double r670256 = y;
        double r670257 = r670255 + r670256;
        double r670258 = r670254 * r670257;
        return r670258;
}
↓
double f(double x, double y) {
        double r670259 = 1.0;
        double r670260 = 2.0;
        double r670261 = r670259 / r670260;
        double r670262 = x;
        double r670263 = y;
        double r670264 = r670262 + r670263;
        double r670265 = r670261 * r670264;
        return r670265;
}

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