Average Error: 0.3 → 0.3
Time: 1.5s
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 r277029 = x;
        double r277030 = 27.0;
        double r277031 = r277029 * r277030;
        double r277032 = y;
        double r277033 = r277031 * r277032;
        return r277033;
}
↓
double f(double x, double y) {
        double r277034 = x;
        double r277035 = 27.0;
        double r277036 = r277034 * r277035;
        double r277037 = y;
        double r277038 = r277036 * r277037;
        return r277038;
}

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