Average Error: 0.1 → 0.1
Time: 7.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 r111717 = x;
        double r111718 = y;
        double r111719 = log(r111718);
        double r111720 = r111717 * r111719;
        double r111721 = r111720 - r111718;
        double r111722 = z;
        double r111723 = r111721 - r111722;
        double r111724 = t;
        double r111725 = log(r111724);
        double r111726 = r111723 + r111725;
        return r111726;
}
↓
double f(double x, double y, double z, double t) {
        double r111727 = x;
        double r111728 = y;
        double r111729 = log(r111728);
        double r111730 = r111727 * r111729;
        double r111731 = r111730 - r111728;
        double r111732 = z;
        double r111733 = r111731 - r111732;
        double r111734 = t;
        double r111735 = log(r111734);
        double r111736 = r111733 + r111735;
        return r111736;
}

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