Average Error: 0.0 → 0.0
Time: 425.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 r92657 = x;
        double r92658 = y;
        double r92659 = r92658 + r92658;
        double r92660 = r92657 * r92659;
        return r92660;
}
↓
double f(double x, double y) {
        double r92661 = x;
        double r92662 = y;
        double r92663 = r92662 + r92662;
        double r92664 = r92661 * r92663;
        return r92664;
}

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