Average Error: 0.1 → 0.1
Time: 19.7s
Precision: 64
\[\left(\left(x \cdot \log y - y\right) - z\right) + \log t\]
↓
\[\left(\left(x \cdot \log y - y\right) - z\right) + \log t\]
\left(\left(x \cdot \log y - y\right) - z\right) + \log t
↓
\left(\left(x \cdot \log y - y\right) - z\right) + \log t
double f(double x, double y, double z, double t) {
        double r89274 = x;
        double r89275 = y;
        double r89276 = log(r89275);
        double r89277 = r89274 * r89276;
        double r89278 = r89277 - r89275;
        double r89279 = z;
        double r89280 = r89278 - r89279;
        double r89281 = t;
        double r89282 = log(r89281);
        double r89283 = r89280 + r89282;
        return r89283;
}
↓
double f(double x, double y, double z, double t) {
        double r89284 = x;
        double r89285 = y;
        double r89286 = log(r89285);
        double r89287 = r89284 * r89286;
        double r89288 = r89287 - r89285;
        double r89289 = z;
        double r89290 = r89288 - r89289;
        double r89291 = t;
        double r89292 = log(r89291);
        double r89293 = r89290 + r89292;
        return r89293;
}

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

Derivation

  1. Initial program 0.1

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

  2. Final simplification0.1

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

Reproduce

herbie shell --seed 2019208 
(FPCore (x y z t)
  :name "Numeric.SpecFunctions:incompleteGamma from math-functions-0.1.5.2, A"
  :precision binary64
  (+ (- (- (* x (log y)) y) z) (log t)))