Average Error: 30.0 → 0.0
Time: 3.1s
Precision: binary64
\[\]
↓
\[\]
↓
double code(double x, double y) {
	return ((double) (((double) (2.0 / ((double) (1.0 + ((double) exp(((double) (-2.0 * x)))))))) - 1.0));
}

↓
double code(double x, double y) {
	double VAR;
	if (((x <= -0.0008164672020903739) || !(x <= 0.0010214095924717022))) {
		VAR = ((double) log(((double) exp(((double) (((double) cbrt(((double) pow(((double) (2.0 / ((double) (1.0 + ((double) pow(((double) exp(-2.0)), x)))))), 3.0)))) - 1.0))))));
	} else {
		VAR = ((double) (((double) (x * 1.0)) - ((double) (((double) pow(x, 3.0)) * ((double) (((double) (x * 5.551115123125783e-17)) + 0.33333333333333337))))));
	}
	return VAR;
}

Error
Bits error versus x
Bits error versus y
Try it out
Your Program's Arguments
Results
Enter valid numbers for all inputs
Derivation
  1. Split input into 2 regimes
  2. if  x  < -8.1646720209037392e-4 or 0.00102140959247170216 <  x 
    1. Initial program 0.0
      \[\]
    2. Using strategy rm
    3. Applied add-log-exp0.0
      \[\leadsto \]
    4. Applied add-log-exp0.0
      \[\leadsto \]
    5. Applied diff-log0.1
      \[\leadsto \]
    6. Simplified0.0
      \[\leadsto \]
    7. Using strategy rm
    8. Applied add-cbrt-cube0.1
      \[\leadsto \]
    9. Applied add-cbrt-cube0.1
      \[\leadsto \]
    10. Applied cbrt-undiv0.0
      \[\leadsto \]
    11. Simplified0.0
      \[\leadsto \]
    if -8.1646720209037392e-4 <  x  < 0.00102140959247170216
    1. Initial program 59.3
      \[\]
    2. Taylor expanded around 0 0.0
      \[\leadsto \]
    3. Simplified0.0
      \[\leadsto \]
  3. Recombined 2 regimes into one program.
  4. Final simplification0.0
    \[\leadsto \]
Reproduce
herbie shell --seed 2020180 
(FPCore (x y)
  :name "Logistic function from Lakshay Garg"
  :precision binary64
  (- (/ 2.0 (+ 1.0 (exp (* -2.0 x)))) 1.0))