Average Error: 0.0 → 0.0
Time: 6.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 r862242 = x;
        double r862243 = y;
        double r862244 = z;
        double r862245 = r862243 - r862244;
        double r862246 = t;
        double r862247 = r862246 - r862242;
        double r862248 = r862245 * r862247;
        double r862249 = r862242 + r862248;
        return r862249;
}
↓
double f(double x, double y, double z, double t) {
        double r862250 = x;
        double r862251 = y;
        double r862252 = z;
        double r862253 = r862251 - r862252;
        double r862254 = t;
        double r862255 = r862254 - r862250;
        double r862256 = r862253 * r862255;
        double r862257 = r862250 + r862256;
        return r862257;
}

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 2020036 +o rules:numerics
(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))))