Average Error: 0.3 → 0.3
Time: 1.3s
Precision: 64
\[\left(x \cdot 27\right) \cdot y\]
↓
\[x \cdot \left(27 \cdot y\right)\]
\left(x \cdot 27\right) \cdot y
↓
x \cdot \left(27 \cdot y\right)
double f(double x, double y) {
        double r204611 = x;
        double r204612 = 27.0;
        double r204613 = r204611 * r204612;
        double r204614 = y;
        double r204615 = r204613 * r204614;
        return r204615;
}
↓
double f(double x, double y) {
        double r204616 = x;
        double r204617 = 27.0;
        double r204618 = y;
        double r204619 = r204617 * r204618;
        double r204620 = r204616 * r204619;
        return r204620;
}

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.3

    \[\left(x \cdot 27\right) \cdot y\]
  2. Using strategy rm

  3. Applied associate-*l*0.3

    \[\leadsto \color{blue}{x \cdot \left(27 \cdot y\right)}\]

  4. Final simplification0.3

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

Reproduce

herbie shell --seed 2020025 +o rules:numerics
(FPCore (x y)
  :name "Diagrams.Solve.Polynomial:cubForm  from diagrams-solve-0.1, F"
  :precision binary64
  (* (* x 27) y))