Average Error: 0.1 → 0.1
Time: 20.6s
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 r847069 = x;
        double r847070 = 3.0;
        double r847071 = r847069 * r847070;
        double r847072 = y;
        double r847073 = r847071 * r847072;
        double r847074 = z;
        double r847075 = r847073 - r847074;
        return r847075;
}
↓
double f(double x, double y, double z) {
        double r847076 = x;
        double r847077 = 3.0;
        double r847078 = r847076 * r847077;
        double r847079 = y;
        double r847080 = r847078 * r847079;
        double r847081 = z;
        double r847082 = r847080 - r847081;
        return r847082;
}

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 2020047 +o rules:numerics
(FPCore (x y z)
  :name "Diagrams.Solve.Polynomial:cubForm  from diagrams-solve-0.1, B"
  :precision binary64

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

  (- (* (* x 3) y) z))