Average Error: 0.0 → 0.0
Time: 3.0s
Precision: binary64
\[\]
↓
\[\]
↓
double code(double x) {
	return ((double) (0.70711 * ((double) (((double) (((double) (2.30753 + ((double) (x * 0.27061)))) / ((double) (1.0 + ((double) (x * ((double) (0.99229 + ((double) (x * 0.04481)))))))))) - x))));
}

↓
double code(double x) {
	return ((double) (0.70711 * ((double) (((double) (((double) (2.30753 + ((double) (x * 0.27061)))) / ((double) (1.0 + ((double) (((double) (((double) cbrt(x)) * ((double) cbrt(x)))) * ((double) (((double) cbrt(x)) * ((double) (0.99229 + ((double) (x * 0.04481)))))))))))) - x))));
}

Error
Bits error versus x
Try it out
Your Program's Arguments
Results
Enter valid numbers for all inputs
Derivation
  1. Initial program 0.0
    \[\]
  2. Using strategy rm
  3. Applied add-cube-cbrt0.0
    \[\leadsto \]
  4. Applied associate-*l*0.0
    \[\leadsto \]
  5. Simplified0.0
    \[\leadsto \]
  6. Final simplification0.0
    \[\leadsto \]
Reproduce
herbie shell --seed 2020192 
(FPCore (x)
  :name "Numeric.SpecFunctions:invErfc from math-functions-0.1.5.2, B"
  :precision binary64
  (* 0.70711 (- (/ (+ 2.30753 (* x 0.27061)) (+ 1.0 (* x (+ 0.99229 (* x 0.04481))))) x)))