Average Error: 0.0 → 0.0
Time: 23.9s
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 r556600 = x;
        double r556601 = y;
        double r556602 = z;
        double r556603 = r556601 - r556602;
        double r556604 = t;
        double r556605 = r556604 - r556600;
        double r556606 = r556603 * r556605;
        double r556607 = r556600 + r556606;
        return r556607;
}
↓
double f(double x, double y, double z, double t) {
        double r556608 = x;
        double r556609 = y;
        double r556610 = z;
        double r556611 = r556609 - r556610;
        double r556612 = t;
        double r556613 = r556612 - r556608;
        double r556614 = r556611 * r556613;
        double r556615 = r556608 + r556614;
        return r556615;
}

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