Average Error: 0 → 0
Time: 412.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 r740373 = 1.0;
        double r740374 = 2.0;
        double r740375 = r740373 / r740374;
        double r740376 = x;
        double r740377 = y;
        double r740378 = r740376 + r740377;
        double r740379 = r740375 * r740378;
        return r740379;
}
↓
double f(double x, double y) {
        double r740380 = 1.0;
        double r740381 = 2.0;
        double r740382 = r740380 / r740381;
        double r740383 = x;
        double r740384 = y;
        double r740385 = r740383 + r740384;
        double r740386 = r740382 * r740385;
        return r740386;
}

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