Average Error: 0.0 → 0.0
Time: 3.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 r743555 = x;
        double r743556 = y;
        double r743557 = z;
        double r743558 = r743556 - r743557;
        double r743559 = t;
        double r743560 = r743559 - r743555;
        double r743561 = r743558 * r743560;
        double r743562 = r743555 + r743561;
        return r743562;
}

double f(double x, double y, double z, double t) {
        double r743563 = x;
        double r743564 = y;
        double r743565 = z;
        double r743566 = r743564 - r743565;
        double r743567 = t;
        double r743568 = r743567 - r743563;
        double r743569 = r743566 * r743568;
        double r743570 = r743563 + r743569;
        return r743570;
}

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