Average Error: 0.0 → 0.0
Time: 4.3s
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 r885396 = x;
        double r885397 = y;
        double r885398 = z;
        double r885399 = r885397 - r885398;
        double r885400 = t;
        double r885401 = r885400 - r885396;
        double r885402 = r885399 * r885401;
        double r885403 = r885396 + r885402;
        return r885403;
}
↓
double f(double x, double y, double z, double t) {
        double r885404 = x;
        double r885405 = y;
        double r885406 = z;
        double r885407 = r885405 - r885406;
        double r885408 = t;
        double r885409 = r885408 - r885404;
        double r885410 = r885407 * r885409;
        double r885411 = r885404 + r885410;
        return r885411;
}

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