Average Error: 0.0 → 0.0
Time: 1.2s
Precision: binary64
\[\sqrt{x + y} \]
↓
\[\sqrt{x + y} \]
(FPCore (x y) :precision binary64 (sqrt (+ x y)))
↓
(FPCore (x y) :precision binary64 (sqrt (+ x y)))
double code(double x, double y) {
	return sqrt((x + y));
}
↓
double code(double x, double y) {
	return sqrt((x + y));
}

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

public static double code(double x, double y) {
	return Math.sqrt((x + y));
}
↓
public static double code(double x, double y) {
	return Math.sqrt((x + y));
}

def code(x, y):
	return math.sqrt((x + y))
↓
def code(x, y):
	return math.sqrt((x + y))

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

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

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

\sqrt{x + y}
↓
\sqrt{x + y}

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.0

    \[\sqrt{x + y} \]

  2. Final simplification0.0

    \[\leadsto \sqrt{x + y} \]

Reproduce

herbie shell --seed 2022150 
(FPCore (x y)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, A"
  :precision binary64
  (sqrt (+ x y)))