Average Error: 0.0 → 0.0
Time: 6.1s
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 r17002 = x;
        double r17003 = y;
        double r17004 = r17002 + r17003;
        double r17005 = z;
        double r17006 = r17004 - r17005;
        double r17007 = t;
        double r17008 = 2.0;
        double r17009 = r17007 * r17008;
        double r17010 = r17006 / r17009;
        return r17010;
}
↓
double f(double x, double y, double z, double t) {
        double r17011 = x;
        double r17012 = y;
        double r17013 = r17011 + r17012;
        double r17014 = z;
        double r17015 = r17013 - r17014;
        double r17016 = t;
        double r17017 = 2.0;
        double r17018 = r17016 * r17017;
        double r17019 = r17015 / r17018;
        return r17019;
}

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