Average Error: 0.3 → 0.3
Time: 1.6s
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 r274703 = x;
        double r274704 = 27.0;
        double r274705 = r274703 * r274704;
        double r274706 = y;
        double r274707 = r274705 * r274706;
        return r274707;
}
↓
double f(double x, double y) {
        double r274708 = x;
        double r274709 = 27.0;
        double r274710 = r274708 * r274709;
        double r274711 = y;
        double r274712 = r274710 * r274711;
        return r274712;
}

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