Average Error: 0.4 → 0.4
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 r278584 = x;
        double r278585 = 27.0;
        double r278586 = r278584 * r278585;
        double r278587 = y;
        double r278588 = r278586 * r278587;
        return r278588;
}
↓
double f(double x, double y) {
        double r278589 = x;
        double r278590 = 27.0;
        double r278591 = r278589 * r278590;
        double r278592 = y;
        double r278593 = r278591 * r278592;
        return r278593;
}

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.4

    \[\left(x \cdot 27\right) \cdot y\]

  2. Final simplification0.4

    \[\leadsto \left(x \cdot 27\right) \cdot y\]

Reproduce

herbie shell --seed 2020083 
(FPCore (x y)
  :name "Diagrams.Solve.Polynomial:cubForm  from diagrams-solve-0.1, F"
  :precision binary64
  (* (* x 27) y))