Average Error: 0.0 → 0.0
Time: 3.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 r711535 = x;
        double r711536 = y;
        double r711537 = z;
        double r711538 = r711536 - r711537;
        double r711539 = t;
        double r711540 = r711539 - r711535;
        double r711541 = r711538 * r711540;
        double r711542 = r711535 + r711541;
        return r711542;
}
↓
double f(double x, double y, double z, double t) {
        double r711543 = x;
        double r711544 = y;
        double r711545 = z;
        double r711546 = r711544 - r711545;
        double r711547 = t;
        double r711548 = r711547 - r711543;
        double r711549 = r711546 * r711548;
        double r711550 = r711543 + r711549;
        return r711550;
}

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