Average Error: 17.0 → 0.0
Time: 12.8s
Precision: 64
\[\left(\left(x \cdot y - y \cdot z\right) - y \cdot y\right) + y \cdot y\]
↓
\[y \cdot x + y \cdot \left(-z\right)\]
\left(\left(x \cdot y - y \cdot z\right) - y \cdot y\right) + y \cdot y
↓
y \cdot x + y \cdot \left(-z\right)
double f(double x, double y, double z) {
        double r294033 = x;
        double r294034 = y;
        double r294035 = r294033 * r294034;
        double r294036 = z;
        double r294037 = r294034 * r294036;
        double r294038 = r294035 - r294037;
        double r294039 = r294034 * r294034;
        double r294040 = r294038 - r294039;
        double r294041 = r294040 + r294039;
        return r294041;
}
↓
double f(double x, double y, double z) {
        double r294042 = y;
        double r294043 = x;
        double r294044 = r294042 * r294043;
        double r294045 = z;
        double r294046 = -r294045;
        double r294047 = r294042 * r294046;
        double r294048 = r294044 + r294047;
        return r294048;
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original17.0
Target0.0
Herbie0.0
\[\left(x - z\right) \cdot y\]

Derivation

  1. Initial program 17.0

    \[\left(\left(x \cdot y - y \cdot z\right) - y \cdot y\right) + y \cdot y\]

  2. Simplified0.0

    \[\leadsto \color{blue}{y \cdot \left(x - z\right)}\]
  3. Using strategy rm

  4. Applied sub-neg0.0

    \[\leadsto y \cdot \color{blue}{\left(x + \left(-z\right)\right)}\]

  5. Applied distribute-lft-in0.0

    \[\leadsto \color{blue}{y \cdot x + y \cdot \left(-z\right)}\]

  6. Final simplification0.0

    \[\leadsto y \cdot x + y \cdot \left(-z\right)\]

Reproduce

herbie shell --seed 2019323 
(FPCore (x y z)
  :name "Linear.Quaternion:$c/ from linear-1.19.1.3, B"
  :precision binary64

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

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