Average Error: 0.1 → 0.1
Time: 12.4s
Precision: 64
\[\frac{\left(x + y\right) - z}{t \cdot 2}\]
↓
\[\frac{\left(y + x\right) - z}{t \cdot 2}\]
\frac{\left(x + y\right) - z}{t \cdot 2}
↓
\frac{\left(y + x\right) - z}{t \cdot 2}
double f(double x, double y, double z, double t) {
        double r1907201 = x;
        double r1907202 = y;
        double r1907203 = r1907201 + r1907202;
        double r1907204 = z;
        double r1907205 = r1907203 - r1907204;
        double r1907206 = t;
        double r1907207 = 2.0;
        double r1907208 = r1907206 * r1907207;
        double r1907209 = r1907205 / r1907208;
        return r1907209;
}
↓
double f(double x, double y, double z, double t) {
        double r1907210 = y;
        double r1907211 = x;
        double r1907212 = r1907210 + r1907211;
        double r1907213 = z;
        double r1907214 = r1907212 - r1907213;
        double r1907215 = t;
        double r1907216 = 2.0;
        double r1907217 = r1907215 * r1907216;
        double r1907218 = r1907214 / r1907217;
        return r1907218;
}

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(y + x\right) - z}{t \cdot 2}\]

Reproduce

herbie shell --seed 2019170 +o rules:numerics
(FPCore (x y z t)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, B"
  (/ (- (+ x y) z) (* t 2.0)))