Average Error: 0.0 → 0.0
Time: 11.5s
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 r527758 = x;
        double r527759 = y;
        double r527760 = z;
        double r527761 = r527759 - r527760;
        double r527762 = t;
        double r527763 = r527762 - r527758;
        double r527764 = r527761 * r527763;
        double r527765 = r527758 + r527764;
        return r527765;
}
↓
double f(double x, double y, double z, double t) {
        double r527766 = x;
        double r527767 = y;
        double r527768 = z;
        double r527769 = r527767 - r527768;
        double r527770 = t;
        double r527771 = r527770 - r527766;
        double r527772 = r527769 * r527771;
        double r527773 = r527766 + r527772;
        return r527773;
}

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