Average Error: 0.0 → 0.0
Time: 1.4s
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 r4910609 = x;
        double r4910610 = y;
        double r4910611 = r4910610 + r4910610;
        double r4910612 = r4910609 * r4910611;
        return r4910612;
}
↓
double f(double x, double y) {
        double r4910613 = x;
        double r4910614 = y;
        double r4910615 = r4910614 + r4910614;
        double r4910616 = r4910613 * r4910615;
        return r4910616;
}

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