Average Error: 0.3 → 0.3
Time: 10.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 r275680 = x;
        double r275681 = 27.0;
        double r275682 = r275680 * r275681;
        double r275683 = y;
        double r275684 = r275682 * r275683;
        return r275684;
}
↓
double f(double x, double y) {
        double r275685 = x;
        double r275686 = 27.0;
        double r275687 = r275685 * r275686;
        double r275688 = y;
        double r275689 = r275687 * r275688;
        return r275689;
}

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