Average Error: 0.3 → 0.3
Time: 22.2s
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 r290303 = x;
        double r290304 = 27.0;
        double r290305 = r290303 * r290304;
        double r290306 = y;
        double r290307 = r290305 * r290306;
        return r290307;
}
↓
double f(double x, double y) {
        double r290308 = x;
        double r290309 = 27.0;
        double r290310 = r290308 * r290309;
        double r290311 = y;
        double r290312 = r290310 * r290311;
        return r290312;
}

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