Average Error: 0.1 → 0.1
Time: 3.3s
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 r36083 = x;
        double r36084 = y;
        double r36085 = r36083 + r36084;
        double r36086 = z;
        double r36087 = r36085 - r36086;
        double r36088 = t;
        double r36089 = 2.0;
        double r36090 = r36088 * r36089;
        double r36091 = r36087 / r36090;
        return r36091;
}
↓
double f(double x, double y, double z, double t) {
        double r36092 = x;
        double r36093 = y;
        double r36094 = r36092 + r36093;
        double r36095 = z;
        double r36096 = r36094 - r36095;
        double r36097 = t;
        double r36098 = 2.0;
        double r36099 = r36097 * r36098;
        double r36100 = r36096 / r36099;
        return r36100;
}

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 2020081 +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)))