Average Error: 0.3 → 0.3
Time: 16.9s
Precision: 64
\[\frac{x}{y \cdot 3}\]
↓
\[\frac{x}{y \cdot 3}\]
\frac{x}{y \cdot 3}
↓
\frac{x}{y \cdot 3}
double f(double x, double y) {
        double r447900 = x;
        double r447901 = y;
        double r447902 = 3.0;
        double r447903 = r447901 * r447902;
        double r447904 = r447900 / r447903;
        return r447904;
}
↓
double f(double x, double y) {
        double r447905 = x;
        double r447906 = y;
        double r447907 = 3.0;
        double r447908 = r447906 * r447907;
        double r447909 = r447905 / r447908;
        return r447909;
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original0.3
Target0.3
Herbie0.3
\[\frac{\frac{x}{y}}{3}\]

Derivation

  1. Initial program 0.3

    \[\frac{x}{y \cdot 3}\]

  2. Final simplification0.3

    \[\leadsto \frac{x}{y \cdot 3}\]

Reproduce

herbie shell --seed 2019322 
(FPCore (x y)
  :name "Diagrams.Solve.Polynomial:cubForm  from diagrams-solve-0.1, C"
  :precision binary64

  :herbie-target
  (/ (/ x y) 3)

  (/ x (* y 3)))