Average Error: 0.0 → 0.0
Time: 388.0ms
Precision: 64
\[x \cdot \left(y + y\right)\]
↓
\[x \cdot \left(y + y\right)\]
x \cdot \left(y + y\right)
↓
x \cdot \left(y + y\right)
double f(double x, double y) {
        double r141912 = x;
        double r141913 = y;
        double r141914 = r141913 + r141913;
        double r141915 = r141912 * r141914;
        return r141915;
}
↓
double f(double x, double y) {
        double r141916 = x;
        double r141917 = y;
        double r141918 = r141917 + r141917;
        double r141919 = r141916 * r141918;
        return r141919;
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[x \cdot \left(y + y\right)\]

  2. Final simplification0.0

    \[\leadsto x \cdot \left(y + y\right)\]

Reproduce

herbie shell --seed 2020042 
(FPCore (x y)
  :name "Numeric.Integration.TanhSinh:simpson  from integration-0.2.1"
  :precision binary64
  (* x (+ y y)))