Average Error: 0.3 → 0.3
Time: 9.1s
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 r149831 = x;
        double r149832 = 27.0;
        double r149833 = r149831 * r149832;
        double r149834 = y;
        double r149835 = r149833 * r149834;
        return r149835;
}
↓
double f(double x, double y) {
        double r149836 = x;
        double r149837 = 27.0;
        double r149838 = r149836 * r149837;
        double r149839 = y;
        double r149840 = r149838 * r149839;
        return r149840;
}

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