Average Error: 0.0 → 0.0
Time: 2.7s
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 r42781 = x;
        double r42782 = y;
        double r42783 = r42781 + r42782;
        double r42784 = z;
        double r42785 = r42783 - r42784;
        double r42786 = t;
        double r42787 = 2.0;
        double r42788 = r42786 * r42787;
        double r42789 = r42785 / r42788;
        return r42789;
}
↓
double f(double x, double y, double z, double t) {
        double r42790 = x;
        double r42791 = y;
        double r42792 = r42790 + r42791;
        double r42793 = z;
        double r42794 = r42792 - r42793;
        double r42795 = t;
        double r42796 = 2.0;
        double r42797 = r42795 * r42796;
        double r42798 = r42794 / r42797;
        return r42798;
}

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