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

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

Error
Bits error versus x
Bits error versus y
Bits error versus z
Bits error versus t
Bits error versus a
Try it out
Your Program's Arguments
Results
Enter valid numbers for all inputs
Target
Original0.3
Target0.3
Herbie0.3
\[\]
Derivation
  1. Initial program 0.3
    \[\]
  2. Using strategy rm
  3. Applied add-cube-cbrt0.3
    \[\leadsto \]
  4. Applied log-prod0.3
    \[\leadsto \]
  5. Applied associate-+l+0.3
    \[\leadsto \]
  6. Simplified0.3
    \[\leadsto \]
  7. Final simplification0.3
    \[\leadsto \]
Reproduce
herbie shell --seed 2020192 
(FPCore (x y z t a)
  :name "Numeric.SpecFunctions:logGammaL from math-functions-0.1.5.2"
  :precision binary64

  :herbie-target
  (+ (log (+ x y)) (+ (- (log z) t) (* (- a 0.5) (log t))))

  (+ (- (+ (log (+ x y)) (log z)) t) (* (- a 0.5) (log t))))