Average Error: 0.1 → 0.1
Time: 6.2s
Precision: 64
\[\left(x \cdot 3.0\right) \cdot y - z\]
↓
\[\left(x \cdot 3.0\right) \cdot y - z\]
\left(x \cdot 3.0\right) \cdot y - z
↓
\left(x \cdot 3.0\right) \cdot y - z
double f(double x, double y, double z) {
        double r13336148 = x;
        double r13336149 = 3.0;
        double r13336150 = r13336148 * r13336149;
        double r13336151 = y;
        double r13336152 = r13336150 * r13336151;
        double r13336153 = z;
        double r13336154 = r13336152 - r13336153;
        return r13336154;
}
↓
double f(double x, double y, double z) {
        double r13336155 = x;
        double r13336156 = 3.0;
        double r13336157 = r13336155 * r13336156;
        double r13336158 = y;
        double r13336159 = r13336157 * r13336158;
        double r13336160 = z;
        double r13336161 = r13336159 - r13336160;
        return r13336161;
}

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

Derivation

  1. Initial program 0.1

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

  2. Final simplification0.1

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

Reproduce

herbie shell --seed 2019156 
(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))