Average Error: 0.3 → 0.3
Time: 31.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 r163358 = x;
        double r163359 = 27.0;
        double r163360 = r163358 * r163359;
        double r163361 = y;
        double r163362 = r163360 * r163361;
        return r163362;
}
↓
double f(double x, double y) {
        double r163363 = x;
        double r163364 = 27.0;
        double r163365 = r163363 * r163364;
        double r163366 = y;
        double r163367 = r163365 * r163366;
        return r163367;
}

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