Average Error: 0.0 → 0.0
Time: 846.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 r3929744 = x;
        double r3929745 = y;
        double r3929746 = r3929745 + r3929745;
        double r3929747 = r3929744 * r3929746;
        return r3929747;
}
↓
double f(double x, double y) {
        double r3929748 = x;
        double r3929749 = y;
        double r3929750 = r3929749 + r3929749;
        double r3929751 = r3929748 * r3929750;
        return r3929751;
}

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