Average Error: 0.1 → 0.1
Time: 11.4s
Precision: 64
\[\frac{\left(x + y\right) - z}{t \cdot 2}\]
↓
\[\frac{y + x}{t \cdot 2} - \frac{z}{t \cdot 2}\]
\frac{\left(x + y\right) - z}{t \cdot 2}
↓
\frac{y + x}{t \cdot 2} - \frac{z}{t \cdot 2}
double f(double x, double y, double z, double t) {
        double r2838143 = x;
        double r2838144 = y;
        double r2838145 = r2838143 + r2838144;
        double r2838146 = z;
        double r2838147 = r2838145 - r2838146;
        double r2838148 = t;
        double r2838149 = 2.0;
        double r2838150 = r2838148 * r2838149;
        double r2838151 = r2838147 / r2838150;
        return r2838151;
}
↓
double f(double x, double y, double z, double t) {
        double r2838152 = y;
        double r2838153 = x;
        double r2838154 = r2838152 + r2838153;
        double r2838155 = t;
        double r2838156 = 2.0;
        double r2838157 = r2838155 * r2838156;
        double r2838158 = r2838154 / r2838157;
        double r2838159 = z;
        double r2838160 = r2838159 / r2838157;
        double r2838161 = r2838158 - r2838160;
        return r2838161;
}

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

  3. Applied div-sub0.1

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

  4. Final simplification0.1

    \[\leadsto \frac{y + x}{t \cdot 2} - \frac{z}{t \cdot 2}\]

Reproduce

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