Average Error: 0.1 → 0.1
Time: 1.0s
Precision: binary64
Cost: 448
\[x - \left(y \cdot 4\right) \cdot z\]
\[x - \left(y \cdot 4\right) \cdot z\]
x - \left(y \cdot 4\right) \cdot z
x - \left(y \cdot 4\right) \cdot z
(FPCore (x y z) :precision binary64 (- x (* (* y 4.0) z)))
(FPCore (x y z) :precision binary64 (- x (* (* y 4.0) z)))
double code(double x, double y, double z) {
	return x - ((y * 4.0) * z);
}
double code(double x, double y, double z) {
	return x - ((y * 4.0) * z);
}

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

Alternatives

Alternative 1
Error61.8
Cost64
\[1\]

Error

Time

Derivation

  1. Initial program 0.1

    \[x - \left(y \cdot 4\right) \cdot z\]
  2. Simplified0.1

    \[\leadsto \color{blue}{x - \left(y \cdot 4\right) \cdot z}\]
  3. Final simplification0.1

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

Reproduce

herbie shell --seed 2021040 
(FPCore (x y z)
  :name "Diagrams.Solve.Polynomial:quadForm from diagrams-solve-0.1, A"
  :precision binary64
  (- x (* (* y 4.0) z)))