Optimisation.CirclePacking:place from circle-packing-0.1.0.4, A

Average Error: 0.0 → 0.0

Time: 2.9s

Precision: binary64

Cost: 6592

Math

\[\sqrt{x + y} \]

↓

\[\sqrt{x + y} \]

FPCore

(FPCore (x y) :precision binary64 (sqrt (+ x y)))

↓

(FPCore (x y) :precision binary64 (sqrt (+ x y)))

C

double code(double x, double y) {
	return sqrt((x + y));
}

↓

double code(double x, double y) {
	return sqrt((x + y));
}

Fortran

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

Java

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));
}

Python

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

↓

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

Julia

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

↓

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

MATLAB

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

↓

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

Wolfram

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

↓

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

Derivation

1. Initial program 0.0

   \[\sqrt{x + y} \]

2. Final simplification 0.0

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

Alternatives

Alternative 1
Error	31.9
Cost	6464

\[\sqrt{y} \]

Reproduce

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