Average Error: 0.1 → 0.1
Time: 6.8s
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 r102659 = x;
        double r102660 = y;
        double r102661 = log(r102660);
        double r102662 = r102659 * r102661;
        double r102663 = r102662 - r102660;
        double r102664 = z;
        double r102665 = r102663 - r102664;
        double r102666 = t;
        double r102667 = log(r102666);
        double r102668 = r102665 + r102667;
        return r102668;
}

double f(double x, double y, double z, double t) {
        double r102669 = x;
        double r102670 = y;
        double r102671 = log(r102670);
        double r102672 = r102669 * r102671;
        double r102673 = r102672 - r102670;
        double r102674 = z;
        double r102675 = r102673 - r102674;
        double r102676 = t;
        double r102677 = log(r102676);
        double r102678 = r102675 + r102677;
        return r102678;
}

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