Average Error: 0.1 → 0.1
Time: 7.2s
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 r105412 = x;
        double r105413 = y;
        double r105414 = log(r105413);
        double r105415 = r105412 * r105414;
        double r105416 = r105415 - r105413;
        double r105417 = z;
        double r105418 = r105416 - r105417;
        double r105419 = t;
        double r105420 = log(r105419);
        double r105421 = r105418 + r105420;
        return r105421;
}
↓
double f(double x, double y, double z, double t) {
        double r105422 = x;
        double r105423 = y;
        double r105424 = log(r105423);
        double r105425 = r105422 * r105424;
        double r105426 = r105425 - r105423;
        double r105427 = z;
        double r105428 = r105426 - r105427;
        double r105429 = t;
        double r105430 = log(r105429);
        double r105431 = r105428 + r105430;
        return r105431;
}

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 2020083 
(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)))