Average Error: 0.0 → 0.0
Time: 12.2s
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 r1781708 = x;
        double r1781709 = y;
        double r1781710 = z;
        double r1781711 = r1781709 - r1781710;
        double r1781712 = t;
        double r1781713 = r1781712 - r1781708;
        double r1781714 = r1781711 * r1781713;
        double r1781715 = r1781708 + r1781714;
        return r1781715;
}
↓
double f(double x, double y, double z, double t) {
        double r1781716 = x;
        double r1781717 = y;
        double r1781718 = z;
        double r1781719 = r1781717 - r1781718;
        double r1781720 = t;
        double r1781721 = r1781720 - r1781716;
        double r1781722 = r1781719 * r1781721;
        double r1781723 = r1781716 + r1781722;
        return r1781723;
}

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