Average Error: 0.1 → 0.1
Time: 4.5s
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 r39110 = x;
        double r39111 = y;
        double r39112 = r39110 + r39111;
        double r39113 = z;
        double r39114 = r39112 - r39113;
        double r39115 = t;
        double r39116 = 2.0;
        double r39117 = r39115 * r39116;
        double r39118 = r39114 / r39117;
        return r39118;
}
↓
double f(double x, double y, double z, double t) {
        double r39119 = x;
        double r39120 = y;
        double r39121 = r39119 + r39120;
        double r39122 = z;
        double r39123 = r39121 - r39122;
        double r39124 = t;
        double r39125 = 2.0;
        double r39126 = r39124 * r39125;
        double r39127 = r39123 / r39126;
        return r39127;
}

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

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

Reproduce

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