Average Error: 0.1 → 0.1
Time: 7.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 r104363 = x;
        double r104364 = y;
        double r104365 = log(r104364);
        double r104366 = r104363 * r104365;
        double r104367 = r104366 - r104364;
        double r104368 = z;
        double r104369 = r104367 - r104368;
        double r104370 = t;
        double r104371 = log(r104370);
        double r104372 = r104369 + r104371;
        return r104372;
}
↓
double f(double x, double y, double z, double t) {
        double r104373 = x;
        double r104374 = y;
        double r104375 = log(r104374);
        double r104376 = r104373 * r104375;
        double r104377 = r104376 - r104374;
        double r104378 = z;
        double r104379 = r104377 - r104378;
        double r104380 = t;
        double r104381 = log(r104380);
        double r104382 = r104379 + r104381;
        return r104382;
}

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 2020001 +o rules:numerics
(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)))