Average Error: 0.0 → 0.0
Time: 2.0s
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 r51123 = x;
        double r51124 = y;
        double r51125 = r51123 + r51124;
        double r51126 = z;
        double r51127 = r51125 - r51126;
        double r51128 = t;
        double r51129 = 2.0;
        double r51130 = r51128 * r51129;
        double r51131 = r51127 / r51130;
        return r51131;
}
↓
double f(double x, double y, double z, double t) {
        double r51132 = x;
        double r51133 = y;
        double r51134 = r51132 + r51133;
        double r51135 = z;
        double r51136 = r51134 - r51135;
        double r51137 = t;
        double r51138 = 2.0;
        double r51139 = r51137 * r51138;
        double r51140 = r51136 / r51139;
        return r51140;
}

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