Average Error: 0.1 → 0.1
Time: 6.7s
Precision: 64
\[\left(x \cdot 3\right) \cdot y - z\]
↓
\[\left(x \cdot 3\right) \cdot y - z\]
\left(x \cdot 3\right) \cdot y - z
↓
\left(x \cdot 3\right) \cdot y - z
double f(double x, double y, double z) {
        double r535660 = x;
        double r535661 = 3.0;
        double r535662 = r535660 * r535661;
        double r535663 = y;
        double r535664 = r535662 * r535663;
        double r535665 = z;
        double r535666 = r535664 - r535665;
        return r535666;
}
↓
double f(double x, double y, double z) {
        double r535667 = x;
        double r535668 = 3.0;
        double r535669 = r535667 * r535668;
        double r535670 = y;
        double r535671 = r535669 * r535670;
        double r535672 = z;
        double r535673 = r535671 - r535672;
        return r535673;
}

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
\[x \cdot \left(3 \cdot y\right) - z\]

Derivation

  1. Initial program 0.1

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

  2. Final simplification0.1

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

Reproduce

herbie shell --seed 2019194 
(FPCore (x y z)
  :name "Diagrams.Solve.Polynomial:cubForm  from diagrams-solve-0.1, B"

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

  (- (* (* x 3.0) y) z))