Average Error: 0.0 → 0.0
Time: 37.8s
Precision: 64
\[\frac{\left(x + y\right) - z}{t \cdot 2}\]
↓
\[\frac{\left(y + x\right) + \left(-z\right)}{2 \cdot t}\]
\frac{\left(x + y\right) - z}{t \cdot 2}
↓
\frac{\left(y + x\right) + \left(-z\right)}{2 \cdot t}
double f(double x, double y, double z, double t) {
        double r3071238 = x;
        double r3071239 = y;
        double r3071240 = r3071238 + r3071239;
        double r3071241 = z;
        double r3071242 = r3071240 - r3071241;
        double r3071243 = t;
        double r3071244 = 2.0;
        double r3071245 = r3071243 * r3071244;
        double r3071246 = r3071242 / r3071245;
        return r3071246;
}
↓
double f(double x, double y, double z, double t) {
        double r3071247 = y;
        double r3071248 = x;
        double r3071249 = r3071247 + r3071248;
        double r3071250 = z;
        double r3071251 = -r3071250;
        double r3071252 = r3071249 + r3071251;
        double r3071253 = 2.0;
        double r3071254 = t;
        double r3071255 = r3071253 * r3071254;
        double r3071256 = r3071252 / r3071255;
        return r3071256;
}

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. Using strategy rm

  3. Applied sub-neg0.0

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

  4. Final simplification0.0

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

Reproduce

herbie shell --seed 2019168 +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)))