Average Error: 0.0 → 0.0
Time: 10.6s
Precision: 64
\[\frac{\left(x + y\right) - z}{t \cdot 2}\]
↓
\[\frac{\left(x + y\right) - z}{t \cdot 2}\]
\frac{\left(x + y\right) - z}{t \cdot 2}
↓
\frac{\left(x + y\right) - z}{t \cdot 2}
double f(double x, double y, double z, double t) {
        double r33770 = x;
        double r33771 = y;
        double r33772 = r33770 + r33771;
        double r33773 = z;
        double r33774 = r33772 - r33773;
        double r33775 = t;
        double r33776 = 2.0;
        double r33777 = r33775 * r33776;
        double r33778 = r33774 / r33777;
        return r33778;
}
↓
double f(double x, double y, double z, double t) {
        double r33779 = x;
        double r33780 = y;
        double r33781 = r33779 + r33780;
        double r33782 = z;
        double r33783 = r33781 - r33782;
        double r33784 = t;
        double r33785 = 2.0;
        double r33786 = r33784 * r33785;
        double r33787 = r33783 / r33786;
        return r33787;
}

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

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

Reproduce

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