Average Error: 0.1 → 0.1
Time: 7.0s
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 r116059 = x;
        double r116060 = y;
        double r116061 = log(r116060);
        double r116062 = r116059 * r116061;
        double r116063 = r116062 - r116060;
        double r116064 = z;
        double r116065 = r116063 - r116064;
        double r116066 = t;
        double r116067 = log(r116066);
        double r116068 = r116065 + r116067;
        return r116068;
}
↓
double f(double x, double y, double z, double t) {
        double r116069 = x;
        double r116070 = y;
        double r116071 = log(r116070);
        double r116072 = r116069 * r116071;
        double r116073 = r116072 - r116070;
        double r116074 = z;
        double r116075 = r116073 - r116074;
        double r116076 = t;
        double r116077 = log(r116076);
        double r116078 = r116075 + r116077;
        return r116078;
}

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