Average Error: 0.0 → 0.0
Time: 915.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 r7520671 = x;
        double r7520672 = y;
        double r7520673 = r7520672 + r7520672;
        double r7520674 = r7520671 * r7520673;
        return r7520674;
}
↓
double f(double x, double y) {
        double r7520675 = x;
        double r7520676 = y;
        double r7520677 = r7520676 + r7520676;
        double r7520678 = r7520675 * r7520677;
        return r7520678;
}

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