Average Error: 0 → 0
Time: 1.1s
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 r69882 = x;
        double r69883 = y;
        double r69884 = r69883 + r69883;
        double r69885 = r69882 * r69884;
        return r69885;
}
↓
double f(double x, double y) {
        double r69886 = x;
        double r69887 = y;
        double r69888 = r69887 + r69887;
        double r69889 = r69886 * r69888;
        return r69889;
}

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