Average Error: 16.8 → 0.0
Time: 9.9s
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 r24766397 = x;
        double r24766398 = y;
        double r24766399 = r24766397 * r24766398;
        double r24766400 = z;
        double r24766401 = r24766398 * r24766400;
        double r24766402 = r24766399 - r24766401;
        double r24766403 = r24766398 * r24766398;
        double r24766404 = r24766402 - r24766403;
        double r24766405 = r24766404 + r24766403;
        return r24766405;
}

double f(double x, double y, double z) {
        double r24766406 = y;
        double r24766407 = z;
        double r24766408 = -r24766407;
        double r24766409 = r24766406 * r24766408;
        double r24766410 = x;
        double r24766411 = r24766410 * r24766406;
        double r24766412 = r24766409 + r24766411;
        return r24766412;
}

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

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

Derivation

  1. Initial program 16.8

    \[\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 2019169 
(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)))