Average Error: 0.0 → 0.0
Time: 2.5s
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 r44742 = x;
        double r44743 = y;
        double r44744 = r44742 + r44743;
        double r44745 = z;
        double r44746 = r44744 - r44745;
        double r44747 = t;
        double r44748 = 2.0;
        double r44749 = r44747 * r44748;
        double r44750 = r44746 / r44749;
        return r44750;
}
↓
double f(double x, double y, double z, double t) {
        double r44751 = x;
        double r44752 = y;
        double r44753 = r44751 + r44752;
        double r44754 = t;
        double r44755 = 2.0;
        double r44756 = r44754 * r44755;
        double r44757 = r44753 / r44756;
        double r44758 = z;
        double r44759 = r44758 / r44756;
        double r44760 = r44757 - r44759;
        return r44760;
}

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 2020060 
(FPCore (x y z t)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, B"
  :precision binary64
  (/ (- (+ x y) z) (* t 2)))