Average Error: 29.5 → 0.5
Time: 4.0s
Precision: binary64
\[\]
↓
\[\]
↓
double code(double x) {
	return ((double) (((double) cbrt(((double) (x + 1.0)))) - ((double) cbrt(x))));
}

↓
double code(double x) {
	return ((double) (1.0 / ((double) (((double) (((double) cbrt(x)) * ((double) cbrt(x)))) + ((double) (((double) cbrt(((double) (1.0 + x)))) * ((double) (((double) cbrt(x)) + ((double) cbrt(((double) (1.0 + x))))))))))));
}

Error
Bits error versus x
Try it out
Your Program's Arguments
Results
Enter valid numbers for all inputs
Derivation
  1. Initial program 29.5
    \[\]
  2. Using strategy rm
  3. Applied flip3--29.4
    \[\leadsto \]
  4. Simplified0.5
    \[\leadsto \]
  5. Simplified0.5
    \[\leadsto \]
  6. Final simplification0.5
    \[\leadsto \]
Reproduce
herbie shell --seed 2020191 
(FPCore (x)
  :name "2cbrt (problem 3.3.4)"
  :precision binary64
  (- (cbrt (+ x 1.0)) (cbrt x)))