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

↓
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	return ((double) (((double) (((double) (((double) (x * ((double) log(y)))) + ((double) (z + ((double) (t + ((double) (((double) (((double) (b - 0.5)) * ((double) (2.0 * ((double) log(((double) cbrt(c)))))))) + a)))))))) + ((double) (((double) (b - 0.5)) * ((double) log(((double) pow(c, 0.3333333333333333)))))))) + ((double) (y * i))));
}

Error
Bits error versus x
Bits error versus y
Bits error versus z
Bits error versus t
Bits error versus a
Bits error versus b
Bits error versus c
Bits error versus i
Try it out
Your Program's Arguments
Results
Enter valid numbers for all inputs
Derivation
  1. Initial program 0.1
    \[\]
  2. Using strategy rm
  3. Applied add-cube-cbrt0.1
    \[\leadsto \]
  4. Applied log-prod0.1
    \[\leadsto \]
  5. Applied distribute-lft-in0.1
    \[\leadsto \]
  6. Applied associate-+r+0.1
    \[\leadsto \]
  7. Simplified0.1
    \[\leadsto \]
  8. Using strategy rm
  9. Applied pow1/30.1
    \[\leadsto \]
  10. Final simplification0.1
    \[\leadsto \]
Reproduce
herbie shell --seed 2020190 
(FPCore (x y z t a b c i)
  :name "Numeric.SpecFunctions:logBeta from math-functions-0.1.5.2, B"
  :precision binary64
  (+ (+ (+ (+ (+ (* x (log y)) z) t) a) (* (- b 0.5) (log c))) (* y i)))