Average Error: 0.3 → 0.3
Time: 32.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 r141721 = x;
        double r141722 = 27.0;
        double r141723 = r141721 * r141722;
        double r141724 = y;
        double r141725 = r141723 * r141724;
        return r141725;
}
↓
double f(double x, double y) {
        double r141726 = x;
        double r141727 = 27.0;
        double r141728 = r141726 * r141727;
        double r141729 = y;
        double r141730 = r141728 * r141729;
        return r141730;
}

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