Average Error: 0.1 → 0.1
Time: 54.7s
Precision: 64
\[\left(\left(x \cdot \log y - y\right) - z\right) + \log t\]
↓
\[\log t + \left(\left(x \cdot \log y - y\right) - z\right)\]
\left(\left(x \cdot \log y - y\right) - z\right) + \log t
↓
\log t + \left(\left(x \cdot \log y - y\right) - z\right)
double f(double x, double y, double z, double t) {
        double r4828913 = x;
        double r4828914 = y;
        double r4828915 = log(r4828914);
        double r4828916 = r4828913 * r4828915;
        double r4828917 = r4828916 - r4828914;
        double r4828918 = z;
        double r4828919 = r4828917 - r4828918;
        double r4828920 = t;
        double r4828921 = log(r4828920);
        double r4828922 = r4828919 + r4828921;
        return r4828922;
}
↓
double f(double x, double y, double z, double t) {
        double r4828923 = t;
        double r4828924 = log(r4828923);
        double r4828925 = x;
        double r4828926 = y;
        double r4828927 = log(r4828926);
        double r4828928 = r4828925 * r4828927;
        double r4828929 = r4828928 - r4828926;
        double r4828930 = z;
        double r4828931 = r4828929 - r4828930;
        double r4828932 = r4828924 + r4828931;
        return r4828932;
}

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 \log t + \left(\left(x \cdot \log y - y\right) - z\right)\]

Reproduce

herbie shell --seed 2019168 
(FPCore (x y z t)
  :name "Numeric.SpecFunctions:incompleteGamma from math-functions-0.1.5.2, A"
  (+ (- (- (* x (log y)) y) z) (log t)))