Average Error: 0.0 → 0.0
Time: 5.6s
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 r457394 = x;
        double r457395 = y;
        double r457396 = z;
        double r457397 = r457395 - r457396;
        double r457398 = t;
        double r457399 = r457398 - r457394;
        double r457400 = r457397 * r457399;
        double r457401 = r457394 + r457400;
        return r457401;
}
↓
double f(double x, double y, double z, double t) {
        double r457402 = x;
        double r457403 = y;
        double r457404 = z;
        double r457405 = r457403 - r457404;
        double r457406 = t;
        double r457407 = r457406 - r457402;
        double r457408 = r457405 * r457407;
        double r457409 = r457402 + r457408;
        return r457409;
}

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 2019304 
(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))))