Average Error: 0.3 → 0.3
Time: 1.5s
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 r274919 = x;
        double r274920 = 27.0;
        double r274921 = r274919 * r274920;
        double r274922 = y;
        double r274923 = r274921 * r274922;
        return r274923;
}
↓
double f(double x, double y) {
        double r274924 = x;
        double r274925 = 27.0;
        double r274926 = r274924 * r274925;
        double r274927 = y;
        double r274928 = r274926 * r274927;
        return r274928;
}

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