Average Error: 0.3 → 0.3
Time: 7.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 r219933 = x;
        double r219934 = 27.0;
        double r219935 = r219933 * r219934;
        double r219936 = y;
        double r219937 = r219935 * r219936;
        return r219937;
}
↓
double f(double x, double y) {
        double r219938 = x;
        double r219939 = 27.0;
        double r219940 = r219938 * r219939;
        double r219941 = y;
        double r219942 = r219940 * r219941;
        return r219942;
}

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 2019179 +o rules:numerics
(FPCore (x y)
  :name "Diagrams.Solve.Polynomial:cubForm  from diagrams-solve-0.1, F"
  (* (* x 27.0) y))