Average Error: 0.4 → 0.4
Time: 20.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 r238353 = x;
        double r238354 = 27.0;
        double r238355 = r238353 * r238354;
        double r238356 = y;
        double r238357 = r238355 * r238356;
        return r238357;
}
↓
double f(double x, double y) {
        double r238358 = x;
        double r238359 = 27.0;
        double r238360 = r238358 * r238359;
        double r238361 = y;
        double r238362 = r238360 * r238361;
        return r238362;
}

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

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

  2. Final simplification0.4

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

Reproduce

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