Average Error: 0.0 → 0.0
Time: 881.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 r85502 = x;
        double r85503 = y;
        double r85504 = r85503 + r85503;
        double r85505 = r85502 * r85504;
        return r85505;
}
↓
double f(double x, double y) {
        double r85506 = x;
        double r85507 = y;
        double r85508 = r85507 + r85507;
        double r85509 = r85506 * r85508;
        return r85509;
}

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