Average Error: 17.1 → 0.0
Time: 18.2s
Precision: 64
\[\left(\left(x \cdot y - y \cdot z\right) - y \cdot y\right) + y \cdot y\]
↓
\[y \cdot \left(-z\right) + x \cdot y\]
\left(\left(x \cdot y - y \cdot z\right) - y \cdot y\right) + y \cdot y
↓
y \cdot \left(-z\right) + x \cdot y
double f(double x, double y, double z) {
        double r29513150 = x;
        double r29513151 = y;
        double r29513152 = r29513150 * r29513151;
        double r29513153 = z;
        double r29513154 = r29513151 * r29513153;
        double r29513155 = r29513152 - r29513154;
        double r29513156 = r29513151 * r29513151;
        double r29513157 = r29513155 - r29513156;
        double r29513158 = r29513157 + r29513156;
        return r29513158;
}
↓
double f(double x, double y, double z) {
        double r29513159 = y;
        double r29513160 = z;
        double r29513161 = -r29513160;
        double r29513162 = r29513159 * r29513161;
        double r29513163 = x;
        double r29513164 = r29513163 * r29513159;
        double r29513165 = r29513162 + r29513164;
        return r29513165;
}

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.1
Target0.0
Herbie0.0
\[\left(x - z\right) \cdot y\]

Derivation

  1. Initial program 17.1

    \[\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-rgt-in0.0

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

  6. Final simplification0.0

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

Reproduce

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

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

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