Average Error: 9.4 → 0.3
Time: 8.4s
Precision: binary64
\[\]
↓
\[\]
↓
double code(double x, double y, double z, double t) {
	return ((double) (((double) (((double) (x * ((double) log(y)))) + ((double) (z * ((double) log(((double) (1.0 - y)))))))) - t));
}

↓
double code(double x, double y, double z, double t) {
	return ((double) (((double) (x * ((double) log(y)))) + ((double) (((double) (z * ((double) (((double) log(1.0)) + ((double) (y * ((double) (((double) (((double) (y / ((double) (1.0 * 1.0)))) * -0.5)) - 1.0)))))))) - t))));
}

Error
Bits error versus x
Bits error versus y
Bits error versus z
Bits error versus t
Try it out
Your Program's Arguments
Results
Enter valid numbers for all inputs
Target
Original9.4
Target0.2
Herbie0.3
\[\]
Derivation
  1. Initial program 9.4
    \[\]
  2. Taylor expanded around 0 0.3
    \[\leadsto \]
  3. Simplified0.3
    \[\leadsto \]
  4. Using strategy rm
  5. Applied associate--l+0.3
    \[\leadsto \]
  6. Simplified0.3
    \[\leadsto \]
  7. Final simplification0.3
    \[\leadsto \]
Reproduce
herbie shell --seed 2020191 
(FPCore (x y z t)
  :name "Numeric.SpecFunctions:invIncompleteBetaWorker from math-functions-0.1.5.2, B"
  :precision binary64

  :herbie-target
  (- (* (neg z) (+ (+ (* 0.5 (* y y)) y) (* (/ 0.3333333333333333 (* 1.0 (* 1.0 1.0))) (* y (* y y))))) (- t (* x (log y))))

  (- (+ (* x (log y)) (* z (log (- 1.0 y)))) t))