Average Error: 0.0 → 0.0
Time: 6.2s
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 r792692 = x;
        double r792693 = y;
        double r792694 = z;
        double r792695 = r792693 - r792694;
        double r792696 = t;
        double r792697 = r792696 - r792692;
        double r792698 = r792695 * r792697;
        double r792699 = r792692 + r792698;
        return r792699;
}

double f(double x, double y, double z, double t) {
        double r792700 = x;
        double r792701 = y;
        double r792702 = z;
        double r792703 = r792701 - r792702;
        double r792704 = t;
        double r792705 = r792704 - r792700;
        double r792706 = r792703 * r792705;
        double r792707 = r792700 + r792706;
        return r792707;
}

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