Average Error: 0.1 → 0.1
Time: 1.8s
Precision: binary64
\[\]
↓
\[\]
↓
double code(double x) {
	return ((double) (((double) (((double) (x * x)) - 3.0)) / 6.0));
}

↓
double code(double x) {
	return ((double) (((double) (x * ((double) (x / 6.0)))) - ((double) (3.0 / 6.0))));
}

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
    \[\]
  2. Using strategy rm
  3. Applied div-sub0.1
    \[\leadsto \]
  4. Simplified0.1
    \[\leadsto \]
  5. Final simplification0.1
    \[\leadsto \]
Reproduce
herbie shell --seed 2020191 
(FPCore (x)
  :name "Numeric.SpecFunctions:invIncompleteBetaWorker from math-functions-0.1.5.2, H"
  :precision binary64
  (/ (- (* x x) 3.0) 6.0))