Average Error: 0.1 → 0.1
Time: 9.7s
Precision: 64
\[\frac{x \cdot x - 3}{6}\]
↓
\[\frac{{\left(x \cdot x - 3\right)}^{1}}{6}\]
\frac{x \cdot x - 3}{6}
↓
\frac{{\left(x \cdot x - 3\right)}^{1}}{6}
double f(double x) {
        double r66308 = x;
        double r66309 = r66308 * r66308;
        double r66310 = 3.0;
        double r66311 = r66309 - r66310;
        double r66312 = 6.0;
        double r66313 = r66311 / r66312;
        return r66313;
}
↓
double f(double x) {
        double r66314 = x;
        double r66315 = r66314 * r66314;
        double r66316 = 3.0;
        double r66317 = r66315 - r66316;
        double r66318 = 1.0;
        double r66319 = pow(r66317, r66318);
        double r66320 = 6.0;
        double r66321 = r66319 / r66320;
        return r66321;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.1

    \[\frac{x \cdot x - 3}{6}\]
  2. Using strategy rm

  3. Applied pow10.1

    \[\leadsto \frac{\color{blue}{{\left(x \cdot x - 3\right)}^{1}}}{6}\]

  4. Final simplification0.1

    \[\leadsto \frac{{\left(x \cdot x - 3\right)}^{1}}{6}\]

Reproduce

herbie shell --seed 2019303 
(FPCore (x)
  :name "Numeric.SpecFunctions:invIncompleteBetaWorker from math-functions-0.1.5.2, H"
  :precision binary64
  (/ (- (* x x) 3) 6))