Average Error: 0.1 → 0.1
Time: 7.4s
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 r92071 = x;
        double r92072 = y;
        double r92073 = log(r92072);
        double r92074 = r92071 * r92073;
        double r92075 = r92074 - r92072;
        double r92076 = z;
        double r92077 = r92075 - r92076;
        double r92078 = t;
        double r92079 = log(r92078);
        double r92080 = r92077 + r92079;
        return r92080;
}
↓
double f(double x, double y, double z, double t) {
        double r92081 = x;
        double r92082 = y;
        double r92083 = log(r92082);
        double r92084 = r92081 * r92083;
        double r92085 = r92084 - r92082;
        double r92086 = z;
        double r92087 = r92085 - r92086;
        double r92088 = t;
        double r92089 = log(r92088);
        double r92090 = r92087 + r92089;
        return r92090;
}

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