Average Error: 0.1 → 0.1
Time: 11.4s
Precision: 64
\[\frac{\left(x + y\right) - z}{t \cdot 2}\]
↓
\[\frac{x + y}{t \cdot 2} - \frac{z}{t \cdot 2}\]
\frac{\left(x + y\right) - z}{t \cdot 2}
↓
\frac{x + y}{t \cdot 2} - \frac{z}{t \cdot 2}
double f(double x, double y, double z, double t) {
        double r3465143 = x;
        double r3465144 = y;
        double r3465145 = r3465143 + r3465144;
        double r3465146 = z;
        double r3465147 = r3465145 - r3465146;
        double r3465148 = t;
        double r3465149 = 2.0;
        double r3465150 = r3465148 * r3465149;
        double r3465151 = r3465147 / r3465150;
        return r3465151;
}
↓
double f(double x, double y, double z, double t) {
        double r3465152 = x;
        double r3465153 = y;
        double r3465154 = r3465152 + r3465153;
        double r3465155 = t;
        double r3465156 = 2.0;
        double r3465157 = r3465155 * r3465156;
        double r3465158 = r3465154 / r3465157;
        double r3465159 = z;
        double r3465160 = r3465159 / r3465157;
        double r3465161 = r3465158 - r3465160;
        return r3465161;
}

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{x + y}{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)))