Average Error: 0.0 → 0.0
Time: 35.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 r517485 = x;
        double r517486 = y;
        double r517487 = z;
        double r517488 = r517486 - r517487;
        double r517489 = t;
        double r517490 = r517489 - r517485;
        double r517491 = r517488 * r517490;
        double r517492 = r517485 + r517491;
        return r517492;
}
↓
double f(double x, double y, double z, double t) {
        double r517493 = x;
        double r517494 = y;
        double r517495 = z;
        double r517496 = r517494 - r517495;
        double r517497 = t;
        double r517498 = r517497 - r517493;
        double r517499 = r517496 * r517498;
        double r517500 = r517493 + r517499;
        return r517500;
}

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