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 r769050 = 1.0;
        double r769051 = 2.0;
        double r769052 = r769050 / r769051;
        double r769053 = x;
        double r769054 = y;
        double r769055 = r769053 + r769054;
        double r769056 = r769052 * r769055;
        return r769056;
}
↓
double f(double x, double y) {
        double r769057 = 1.0;
        double r769058 = 2.0;
        double r769059 = r769057 / r769058;
        double r769060 = x;
        double r769061 = y;
        double r769062 = r769060 + r769061;
        double r769063 = r769059 * r769062;
        return r769063;
}

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