Average Error: 0.3 → 0.3
Time: 10.0s
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 r207200 = x;
        double r207201 = 27.0;
        double r207202 = r207200 * r207201;
        double r207203 = y;
        double r207204 = r207202 * r207203;
        return r207204;
}
↓
double f(double x, double y) {
        double r207205 = x;
        double r207206 = 27.0;
        double r207207 = r207205 * r207206;
        double r207208 = y;
        double r207209 = r207207 * r207208;
        return r207209;
}

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 2020046 +o rules:numerics
(FPCore (x y)
  :name "Diagrams.Solve.Polynomial:cubForm  from diagrams-solve-0.1, F"
  :precision binary64
  (* (* x 27) y))