Average Error: 0 → 0
Time: 819.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 r2393044 = x;
        double r2393045 = y;
        double r2393046 = r2393045 + r2393045;
        double r2393047 = r2393044 * r2393046;
        return r2393047;
}
↓
double f(double x, double y) {
        double r2393048 = x;
        double r2393049 = y;
        double r2393050 = r2393049 + r2393049;
        double r2393051 = r2393048 * r2393050;
        return r2393051;
}

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

    \[x \cdot \left(y + y\right)\]

  2. Final simplification0

    \[\leadsto x \cdot \left(y + y\right)\]

Reproduce

herbie shell --seed 2019156 +o rules:numerics
(FPCore (x y)
  :name "Numeric.Integration.TanhSinh:simpson  from integration-0.2.1"
  (* x (+ y y)))