Average Error: 0.1 → 0.1
Time: 26.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 r85254 = x;
        double r85255 = y;
        double r85256 = log(r85255);
        double r85257 = r85254 * r85256;
        double r85258 = r85257 - r85255;
        double r85259 = z;
        double r85260 = r85258 - r85259;
        double r85261 = t;
        double r85262 = log(r85261);
        double r85263 = r85260 + r85262;
        return r85263;
}
↓
double f(double x, double y, double z, double t) {
        double r85264 = x;
        double r85265 = y;
        double r85266 = log(r85265);
        double r85267 = r85264 * r85266;
        double r85268 = r85267 - r85265;
        double r85269 = z;
        double r85270 = r85268 - r85269;
        double r85271 = t;
        double r85272 = log(r85271);
        double r85273 = r85270 + r85272;
        return r85273;
}

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