Average Error: 0.1 → 0.1
Time: 12.3s
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 r2617203 = x;
        double r2617204 = y;
        double r2617205 = r2617203 + r2617204;
        double r2617206 = z;
        double r2617207 = r2617205 - r2617206;
        double r2617208 = t;
        double r2617209 = 2.0;
        double r2617210 = r2617208 * r2617209;
        double r2617211 = r2617207 / r2617210;
        return r2617211;
}
↓
double f(double x, double y, double z, double t) {
        double r2617212 = y;
        double r2617213 = x;
        double r2617214 = r2617212 + r2617213;
        double r2617215 = z;
        double r2617216 = r2617214 - r2617215;
        double r2617217 = t;
        double r2617218 = 2.0;
        double r2617219 = r2617217 * r2617218;
        double r2617220 = r2617216 / r2617219;
        return r2617220;
}

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