Average Error: 0.0 → 0.0
Time: 12.4s
Precision: 64
\[\frac{\left(x + y\right) - z}{t \cdot 2}\]
↓
\[\frac{x + y}{t \cdot 2} - \frac{z}{t \cdot 2}\]
\frac{\left(x + y\right) - z}{t \cdot 2}
↓
\frac{x + y}{t \cdot 2} - \frac{z}{t \cdot 2}
double f(double x, double y, double z, double t) {
        double r39484 = x;
        double r39485 = y;
        double r39486 = r39484 + r39485;
        double r39487 = z;
        double r39488 = r39486 - r39487;
        double r39489 = t;
        double r39490 = 2.0;
        double r39491 = r39489 * r39490;
        double r39492 = r39488 / r39491;
        return r39492;
}
↓
double f(double x, double y, double z, double t) {
        double r39493 = x;
        double r39494 = y;
        double r39495 = r39493 + r39494;
        double r39496 = t;
        double r39497 = 2.0;
        double r39498 = r39496 * r39497;
        double r39499 = r39495 / r39498;
        double r39500 = z;
        double r39501 = r39500 / r39498;
        double r39502 = r39499 - r39501;
        return r39502;
}

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.0

    \[\frac{\left(x + y\right) - z}{t \cdot 2}\]
  2. Using strategy rm

  3. Applied div-sub0.0

    \[\leadsto \color{blue}{\frac{x + y}{t \cdot 2} - \frac{z}{t \cdot 2}}\]

  4. Final simplification0.0

    \[\leadsto \frac{x + y}{t \cdot 2} - \frac{z}{t \cdot 2}\]

Reproduce

herbie shell --seed 2019325 
(FPCore (x y z t)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, B"
  :precision binary64
  (/ (- (+ x y) z) (* t 2)))