Average Error: 0 → 0
Time: 418.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 r747870 = 1.0;
        double r747871 = 2.0;
        double r747872 = r747870 / r747871;
        double r747873 = x;
        double r747874 = y;
        double r747875 = r747873 + r747874;
        double r747876 = r747872 * r747875;
        return r747876;
}
↓
double f(double x, double y) {
        double r747877 = 1.0;
        double r747878 = 2.0;
        double r747879 = r747877 / r747878;
        double r747880 = x;
        double r747881 = y;
        double r747882 = r747880 + r747881;
        double r747883 = r747879 * r747882;
        return r747883;
}

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