Average Error: 0.1 → 0.1
Time: 11.0s
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) (x * ((double) log(((double) sqrt(y)))))) + ((double) (((double) (x * ((double) log(((double) sqrt(y)))))) + ((double) (((double) (((double) (b - 0.5)) * ((double) log(c)))) + ((double) (((double) (((double) (y * i)) + a)) + ((double) (z + t))))))))));
}

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. Simplified0.1

    \[\leadsto \]
  3. Using strategy rm
  4. Applied add-sqr-sqrt0.1

    \[\leadsto \]
  5. Applied log-prod0.1

    \[\leadsto \]
  6. Applied distribute-lft-in0.1

    \[\leadsto \]
  7. Applied associate-+l+0.1

    \[\leadsto \]
  8. Simplified0.1

    \[\leadsto \]
  9. Final simplification0.1

    \[\leadsto \]

Reproduce

herbie shell --seed 2020191 
(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)))