Average Error: 0 → 0
Time: 754.0ms
Precision: binary64
\[x \cdot \left(y + y\right) \]
↓
\[x \cdot \left(y + y\right) \]
(FPCore (x y) :precision binary64 (* x (+ y y)))
↓
(FPCore (x y) :precision binary64 (* x (+ y y)))
double code(double x, double y) {
	return x * (y + y);
}
↓
double code(double x, double y) {
	return x * (y + y);
}

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

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

def code(x, y):
	return x * (y + y)
↓
def code(x, y):
	return x * (y + y)

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

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

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

x \cdot \left(y + y\right)
↓
x \cdot \left(y + y\right)

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0

    \[x \cdot \left(y + y\right) \]

  2. Final simplification0

    \[\leadsto x \cdot \left(y + y\right) \]

Reproduce

herbie shell --seed 2022150 
(FPCore (x y)
  :name "Numeric.Integration.TanhSinh:simpson  from integration-0.2.1"
  :precision binary64
  (* x (+ y y)))