Average Error: 0.1 → 0.1
Time: 2.5s
Precision: 64
\[\left(\left(x \cdot y + z \cdot z\right) + z \cdot z\right) + z \cdot z\]
↓
\[\left(3 \cdot z\right) \cdot z + x \cdot y\]
\left(\left(x \cdot y + z \cdot z\right) + z \cdot z\right) + z \cdot z
↓
\left(3 \cdot z\right) \cdot z + x \cdot y
double f(double x, double y, double z) {
        double r740396 = x;
        double r740397 = y;
        double r740398 = r740396 * r740397;
        double r740399 = z;
        double r740400 = r740399 * r740399;
        double r740401 = r740398 + r740400;
        double r740402 = r740401 + r740400;
        double r740403 = r740402 + r740400;
        return r740403;
}
↓
double f(double x, double y, double z) {
        double r740404 = 3.0;
        double r740405 = z;
        double r740406 = r740404 * r740405;
        double r740407 = r740406 * r740405;
        double r740408 = x;
        double r740409 = y;
        double r740410 = r740408 * r740409;
        double r740411 = r740407 + r740410;
        return r740411;
}

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

Original0.1
Target0.1
Herbie0.1
\[\left(3 \cdot z\right) \cdot z + y \cdot x\]

Derivation

  1. Initial program 0.1

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

  2. Simplified0.1

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

  4. Applied associate-*r*0.1

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

  5. Final simplification0.1

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

Reproduce

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

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

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