Average Error: 0.1 → 0.1
Time: 3.4s
Precision: 64
\[\frac{\left(x + y\right) - z}{t \cdot 2}\]
↓
\[\frac{\left(x + y\right) - z}{t \cdot 2}\]
\frac{\left(x + y\right) - z}{t \cdot 2}
↓
\frac{\left(x + y\right) - z}{t \cdot 2}
double f(double x, double y, double z, double t) {
        double r46664 = x;
        double r46665 = y;
        double r46666 = r46664 + r46665;
        double r46667 = z;
        double r46668 = r46666 - r46667;
        double r46669 = t;
        double r46670 = 2.0;
        double r46671 = r46669 * r46670;
        double r46672 = r46668 / r46671;
        return r46672;
}
↓
double f(double x, double y, double z, double t) {
        double r46673 = x;
        double r46674 = y;
        double r46675 = r46673 + r46674;
        double r46676 = z;
        double r46677 = r46675 - r46676;
        double r46678 = t;
        double r46679 = 2.0;
        double r46680 = r46678 * r46679;
        double r46681 = r46677 / r46680;
        return r46681;
}

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

Reproduce

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