Average Error: 0.0 → 0.0
Time: 37.4s
Precision: 64
\[x + \left(y - z\right) \cdot \left(t - x\right)\]
↓
\[x + \left(y - z\right) \cdot \left(t - x\right)\]
x + \left(y - z\right) \cdot \left(t - x\right)
↓
x + \left(y - z\right) \cdot \left(t - x\right)
double f(double x, double y, double z, double t) {
        double r486306 = x;
        double r486307 = y;
        double r486308 = z;
        double r486309 = r486307 - r486308;
        double r486310 = t;
        double r486311 = r486310 - r486306;
        double r486312 = r486309 * r486311;
        double r486313 = r486306 + r486312;
        return r486313;
}
↓
double f(double x, double y, double z, double t) {
        double r486314 = x;
        double r486315 = y;
        double r486316 = z;
        double r486317 = r486315 - r486316;
        double r486318 = t;
        double r486319 = r486318 - r486314;
        double r486320 = r486317 * r486319;
        double r486321 = r486314 + r486320;
        return r486321;
}

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

Target

Original0.0
Target0.0
Herbie0.0
\[x + \left(t \cdot \left(y - z\right) + \left(-x\right) \cdot \left(y - z\right)\right)\]

Derivation

  1. Initial program 0.0

    \[x + \left(y - z\right) \cdot \left(t - x\right)\]

  2. Final simplification0.0

    \[\leadsto x + \left(y - z\right) \cdot \left(t - x\right)\]

Reproduce

herbie shell --seed 2019322 
(FPCore (x y z t)
  :name "Data.Metrics.Snapshot:quantile from metrics-0.3.0.2"
  :precision binary64

  :herbie-target
  (+ x (+ (* t (- y z)) (* (- x) (- y z))))

  (+ x (* (- y z) (- t x))))