Average Error: 0.0 → 0.0
Time: 2.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 r772659 = x;
        double r772660 = y;
        double r772661 = z;
        double r772662 = r772660 - r772661;
        double r772663 = t;
        double r772664 = r772663 - r772659;
        double r772665 = r772662 * r772664;
        double r772666 = r772659 + r772665;
        return r772666;
}
↓
double f(double x, double y, double z, double t) {
        double r772667 = x;
        double r772668 = y;
        double r772669 = z;
        double r772670 = r772668 - r772669;
        double r772671 = t;
        double r772672 = r772671 - r772667;
        double r772673 = r772670 * r772672;
        double r772674 = r772667 + r772673;
        return r772674;
}

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