Average Error: 0.3 → 0.3
Time: 1.3s
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 r246692 = x;
        double r246693 = 27.0;
        double r246694 = r246692 * r246693;
        double r246695 = y;
        double r246696 = r246694 * r246695;
        return r246696;
}
↓
double f(double x, double y) {
        double r246697 = x;
        double r246698 = 27.0;
        double r246699 = r246697 * r246698;
        double r246700 = y;
        double r246701 = r246699 * r246700;
        return r246701;
}

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