Average Error: 0.0 → 0.0
Time: 33.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 r533848 = x;
        double r533849 = y;
        double r533850 = z;
        double r533851 = r533849 - r533850;
        double r533852 = t;
        double r533853 = r533852 - r533848;
        double r533854 = r533851 * r533853;
        double r533855 = r533848 + r533854;
        return r533855;
}
↓
double f(double x, double y, double z, double t) {
        double r533856 = x;
        double r533857 = y;
        double r533858 = z;
        double r533859 = r533857 - r533858;
        double r533860 = t;
        double r533861 = r533860 - r533856;
        double r533862 = r533859 * r533861;
        double r533863 = r533856 + r533862;
        return r533863;
}

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