Average Error: 0.1 → 0.1
Time: 8.1s
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 r97177 = x;
        double r97178 = y;
        double r97179 = log(r97178);
        double r97180 = r97177 * r97179;
        double r97181 = r97180 - r97178;
        double r97182 = z;
        double r97183 = r97181 - r97182;
        double r97184 = t;
        double r97185 = log(r97184);
        double r97186 = r97183 + r97185;
        return r97186;
}

double f(double x, double y, double z, double t) {
        double r97187 = x;
        double r97188 = y;
        double r97189 = log(r97188);
        double r97190 = r97187 * r97189;
        double r97191 = r97190 - r97188;
        double r97192 = z;
        double r97193 = r97191 - r97192;
        double r97194 = t;
        double r97195 = log(r97194);
        double r97196 = r97193 + r97195;
        return r97196;
}

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