Average Error: 0 → 0
Time: 441.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 r749064 = 1.0;
        double r749065 = 2.0;
        double r749066 = r749064 / r749065;
        double r749067 = x;
        double r749068 = y;
        double r749069 = r749067 + r749068;
        double r749070 = r749066 * r749069;
        return r749070;
}
↓
double f(double x, double y) {
        double r749071 = 1.0;
        double r749072 = 2.0;
        double r749073 = r749071 / r749072;
        double r749074 = x;
        double r749075 = y;
        double r749076 = r749074 + r749075;
        double r749077 = r749073 * r749076;
        return r749077;
}

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