Average Error: 0.3 → 0.3
Time: 1.4s
Precision: 64
\[\left(x \cdot 27\right) \cdot y\]
↓
\[\left(x \cdot 27\right) \cdot y\]
\left(x \cdot 27\right) \cdot y
↓
\left(x \cdot 27\right) \cdot y
double f(double x, double y) {
        double r205600 = x;
        double r205601 = 27.0;
        double r205602 = r205600 * r205601;
        double r205603 = y;
        double r205604 = r205602 * r205603;
        return r205604;
}
↓
double f(double x, double y) {
        double r205605 = x;
        double r205606 = 27.0;
        double r205607 = r205605 * r205606;
        double r205608 = y;
        double r205609 = r205607 * r205608;
        return r205609;
}

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

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

Reproduce

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