Average Error: 0.3 → 0.3
Time: 1.7s
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 r227187 = x;
        double r227188 = 27.0;
        double r227189 = r227187 * r227188;
        double r227190 = y;
        double r227191 = r227189 * r227190;
        return r227191;
}
↓
double f(double x, double y) {
        double r227192 = x;
        double r227193 = 27.0;
        double r227194 = r227192 * r227193;
        double r227195 = y;
        double r227196 = r227194 * r227195;
        return r227196;
}

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