Average Error: 0.1 → 0.1
Time: 20.3s
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 r4788458 = x;
        double r4788459 = y;
        double r4788460 = log(r4788459);
        double r4788461 = r4788458 * r4788460;
        double r4788462 = r4788461 - r4788459;
        double r4788463 = z;
        double r4788464 = r4788462 - r4788463;
        double r4788465 = t;
        double r4788466 = log(r4788465);
        double r4788467 = r4788464 + r4788466;
        return r4788467;
}
↓
double f(double x, double y, double z, double t) {
        double r4788468 = t;
        double r4788469 = log(r4788468);
        double r4788470 = x;
        double r4788471 = y;
        double r4788472 = log(r4788471);
        double r4788473 = r4788470 * r4788472;
        double r4788474 = r4788473 - r4788471;
        double r4788475 = z;
        double r4788476 = r4788474 - r4788475;
        double r4788477 = r4788469 + r4788476;
        return r4788477;
}

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 2019192 
(FPCore (x y z t)
  :name "Numeric.SpecFunctions:incompleteGamma from math-functions-0.1.5.2, A"
  (+ (- (- (* x (log y)) y) z) (log t)))