Average Error: 0.0 → 0.0
Time: 9.3s
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 r42061443 = x;
        double r42061444 = y;
        double r42061445 = z;
        double r42061446 = r42061444 - r42061445;
        double r42061447 = t;
        double r42061448 = r42061447 - r42061443;
        double r42061449 = r42061446 * r42061448;
        double r42061450 = r42061443 + r42061449;
        return r42061450;
}

double f(double x, double y, double z, double t) {
        double r42061451 = x;
        double r42061452 = y;
        double r42061453 = z;
        double r42061454 = r42061452 - r42061453;
        double r42061455 = t;
        double r42061456 = r42061455 - r42061451;
        double r42061457 = r42061454 * r42061456;
        double r42061458 = r42061451 + r42061457;
        return r42061458;
}

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 2019171 
(FPCore (x y z t)
  :name "Data.Metrics.Snapshot:quantile from metrics-0.3.0.2"

  :herbie-target
  (+ x (+ (* t (- y z)) (* (- x) (- y z))))

  (+ x (* (- y z) (- t x))))