Average Error: 0.3 → 0.3
Time: 1.9s
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 r274001 = x;
        double r274002 = 27.0;
        double r274003 = r274001 * r274002;
        double r274004 = y;
        double r274005 = r274003 * r274004;
        return r274005;
}
↓
double f(double x, double y) {
        double r274006 = x;
        double r274007 = 27.0;
        double r274008 = r274006 * r274007;
        double r274009 = y;
        double r274010 = r274008 * r274009;
        return r274010;
}

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