Average Error: 0.0 → 0.0
Time: 1.2s
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 r89886 = x;
        double r89887 = y;
        double r89888 = r89887 + r89887;
        double r89889 = r89886 * r89888;
        return r89889;
}
↓
double f(double x, double y) {
        double r89890 = x;
        double r89891 = y;
        double r89892 = r89891 + r89891;
        double r89893 = r89890 * r89892;
        return r89893;
}

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 2019323 +o rules:numerics
(FPCore (x y)
  :name "Numeric.Integration.TanhSinh:simpson  from integration-0.2.1"
  :precision binary64
  (* x (+ y y)))