Average Error: 0.0 → 0.0
Time: 1.8s
Precision: binary64
\[x - y \cdot z \]
↓
\[x - y \cdot z \]
(FPCore (x y z) :precision binary64 (- x (* y z)))
↓
(FPCore (x y z) :precision binary64 (- x (* y z)))
double code(double x, double y, double z) {
	return x - (y * z);
}
↓
double code(double x, double y, double z) {
	return x - (y * z);
}

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = x - (y * z)
end function
↓
real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = x - (y * z)
end function

public static double code(double x, double y, double z) {
	return x - (y * z);
}
↓
public static double code(double x, double y, double z) {
	return x - (y * z);
}

def code(x, y, z):
	return x - (y * z)
↓
def code(x, y, z):
	return x - (y * z)

function code(x, y, z)
	return Float64(x - Float64(y * z))
end
↓
function code(x, y, z)
	return Float64(x - Float64(y * z))
end

function tmp = code(x, y, z)
	tmp = x - (y * z);
end
↓
function tmp = code(x, y, z)
	tmp = x - (y * z);
end

code[x_, y_, z_] := N[(x - N[(y * z), $MachinePrecision]), $MachinePrecision]
↓
code[x_, y_, z_] := N[(x - N[(y * z), $MachinePrecision]), $MachinePrecision]

x - y \cdot z
↓
x - y \cdot 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

Target

Original0.0
Target0.0
Herbie0.0
\[\frac{x + y \cdot z}{\frac{x + y \cdot z}{x - y \cdot z}} \]

Derivation

  1. Initial program 0.0

    \[x - y \cdot z \]

  2. Final simplification0.0

    \[\leadsto x - y \cdot z \]

Reproduce

herbie shell --seed 2022151 
(FPCore (x y z)
  :name "Diagrams.Solve.Tridiagonal:solveTriDiagonal from diagrams-solve-0.1, C"
  :precision binary64

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

  (- x (* y z)))