Average Error: 0.0 → 0.0
Time: 11.1s
Precision: 64
\[x + \frac{y - x}{z}\]
↓
\[x + \left(\frac{y}{z} - \frac{x}{z}\right)\]
x + \frac{y - x}{z}
↓
x + \left(\frac{y}{z} - \frac{x}{z}\right)
double f(double x, double y, double z) {
        double r10530 = x;
        double r10531 = y;
        double r10532 = r10531 - r10530;
        double r10533 = z;
        double r10534 = r10532 / r10533;
        double r10535 = r10530 + r10534;
        return r10535;
}
↓
double f(double x, double y, double z) {
        double r10536 = x;
        double r10537 = y;
        double r10538 = z;
        double r10539 = r10537 / r10538;
        double r10540 = r10536 / r10538;
        double r10541 = r10539 - r10540;
        double r10542 = r10536 + r10541;
        return r10542;
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[x + \frac{y - x}{z}\]
  2. Using strategy rm

  3. Applied div-sub0.0

    \[\leadsto x + \color{blue}{\left(\frac{y}{z} - \frac{x}{z}\right)}\]

  4. Final simplification0.0

    \[\leadsto x + \left(\frac{y}{z} - \frac{x}{z}\right)\]

Reproduce

herbie shell --seed 2019304 
(FPCore (x y z)
  :name "Statistics.Sample:$swelfordMean from math-functions-0.1.5.2"
  :precision binary64
  (+ x (/ (- y x) z)))