Average Error: 0 → 0
Time: 397.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 r875014 = 1.0;
        double r875015 = 2.0;
        double r875016 = r875014 / r875015;
        double r875017 = x;
        double r875018 = y;
        double r875019 = r875017 + r875018;
        double r875020 = r875016 * r875019;
        return r875020;
}
↓
double f(double x, double y) {
        double r875021 = 1.0;
        double r875022 = 2.0;
        double r875023 = r875021 / r875022;
        double r875024 = x;
        double r875025 = y;
        double r875026 = r875024 + r875025;
        double r875027 = r875023 * r875026;
        return r875027;
}

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 2020047 
(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)))