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 r221104 = x;
        double r221105 = 27.0;
        double r221106 = r221104 * r221105;
        double r221107 = y;
        double r221108 = r221106 * r221107;
        return r221108;
}
↓
double f(double x, double y) {
        double r221109 = x;
        double r221110 = 27.0;
        double r221111 = r221109 * r221110;
        double r221112 = y;
        double r221113 = r221111 * r221112;
        return r221113;
}

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