Average Error: 0.0 → 0.0
Time: 26.6s
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 r542729 = x;
        double r542730 = y;
        double r542731 = z;
        double r542732 = r542730 - r542731;
        double r542733 = t;
        double r542734 = r542733 - r542729;
        double r542735 = r542732 * r542734;
        double r542736 = r542729 + r542735;
        return r542736;
}
↓
double f(double x, double y, double z, double t) {
        double r542737 = x;
        double r542738 = y;
        double r542739 = z;
        double r542740 = r542738 - r542739;
        double r542741 = t;
        double r542742 = r542741 - r542737;
        double r542743 = r542740 * r542742;
        double r542744 = r542737 + r542743;
        return r542744;
}

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