Average Error: 38.9 → 0.3
Time: 3.2s
Precision: binary64
\[\]
↓
\[\]
↓
double code(double x) {
	return ((double) log(((double) (1.0 + x))));
}

↓
double code(double x) {
	double VAR;
	if ((((double) (1.0 + x)) <= 1.0000000126753839)) {
		VAR = ((double) (((double) (1.0 * x)) + ((double) (((double) log(1.0)) + ((double) (((double) (x * x)) * ((double) (-0.5 / ((double) (1.0 * 1.0))))))))));
	} else {
		VAR = ((double) log(((double) (1.0 + x))));
	}
	return VAR;
}

Error
Bits error versus x
Try it out
Your Program's Arguments
Results
Enter valid numbers for all inputs
Target
Original38.9
Target0.2
Herbie0.3
\[\]
Derivation
  1. Split input into 2 regimes
  2. if  (+ 1.0 x)  < 1.0000000126753839
    1. Initial program 59.2
      \[\]
    2. Taylor expanded around 0 0.3
      \[\leadsto \]
    3. Simplified0.3
      \[\leadsto \]
    if 1.0000000126753839 <  (+ 1.0 x) 
    1. Initial program 0.3
      \[\]
  3. Recombined 2 regimes into one program.
  4. Final simplification0.3
    \[\leadsto \]
Reproduce
herbie shell --seed 2020192 
(FPCore (x)
  :name "ln(1 + x)"
  :precision binary64

  :herbie-target
  (if (== (+ 1.0 x) 1.0) x (/ (* x (log (+ 1.0 x))) (- (+ 1.0 x) 1.0)))

  (log (+ 1.0 x)))