Average Error: 0.3 → 0.3
Time: 31.0s
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 r191189 = x;
        double r191190 = 27.0;
        double r191191 = r191189 * r191190;
        double r191192 = y;
        double r191193 = r191191 * r191192;
        return r191193;
}
↓
double f(double x, double y) {
        double r191194 = x;
        double r191195 = 27.0;
        double r191196 = r191194 * r191195;
        double r191197 = y;
        double r191198 = r191196 * r191197;
        return r191198;
}

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