Average Error: 0.1 → 0.1
Time: 12.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 r33805 = x;
        double r33806 = y;
        double r33807 = r33805 + r33806;
        double r33808 = z;
        double r33809 = r33807 - r33808;
        double r33810 = t;
        double r33811 = 2.0;
        double r33812 = r33810 * r33811;
        double r33813 = r33809 / r33812;
        return r33813;
}
↓
double f(double x, double y, double z, double t) {
        double r33814 = x;
        double r33815 = y;
        double r33816 = r33814 + r33815;
        double r33817 = t;
        double r33818 = 2.0;
        double r33819 = r33817 * r33818;
        double r33820 = r33816 / r33819;
        double r33821 = z;
        double r33822 = r33821 / r33819;
        double r33823 = r33820 - r33822;
        return r33823;
}

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

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

  3. Applied div-sub0.1

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

  4. Final simplification0.1

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

Reproduce

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