Average Error: 0.0 → 0.0
Time: 2.7s
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 r887380 = x;
        double r887381 = y;
        double r887382 = z;
        double r887383 = r887381 - r887382;
        double r887384 = t;
        double r887385 = r887384 - r887380;
        double r887386 = r887383 * r887385;
        double r887387 = r887380 + r887386;
        return r887387;
}
↓
double f(double x, double y, double z, double t) {
        double r887388 = x;
        double r887389 = y;
        double r887390 = z;
        double r887391 = r887389 - r887390;
        double r887392 = t;
        double r887393 = r887392 - r887388;
        double r887394 = r887391 * r887393;
        double r887395 = r887388 + r887394;
        return r887395;
}

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