Average Error: 0.1 → 0.1
Time: 14.0s
Precision: binary64
\[\left(x \cdot \log y - z\right) - y\]
↓
\[x \cdot \log y - \left(z + y\right)\]
\left(x \cdot \log y - z\right) - y
↓
x \cdot \log y - \left(z + y\right)
double code(double x, double y, double z) {
	return ((double) (((double) (((double) (x * ((double) log(y)))) - z)) - y));
}
↓
double code(double x, double y, double z) {
	return ((double) (((double) (x * ((double) log(y)))) - ((double) (z + y))));
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.1

    \[\left(x \cdot \log y - z\right) - y\]
  2. Using strategy rm

  3. Applied associate--l-0.1

    \[\leadsto \color{blue}{x \cdot \log y - \left(z + y\right)}\]

  4. Final simplification0.1

    \[\leadsto x \cdot \log y - \left(z + y\right)\]

Reproduce

herbie shell --seed 2020182 
(FPCore (x y z)
  :name "Statistics.Distribution.Poisson:$clogProbability from math-functions-0.1.5.2"
  :precision binary64
  (- (- (* x (log y)) z) y))