Data.HashTable.ST.Basic:computeOverhead from hashtables-1.2.0.2

Average Error: 9.1 → 0.1

Time: 4.8s

Precision: binary64

Math

\[\frac{x}{y} + \frac{2 + \left(z \cdot 2\right) \cdot \left(1 - t\right)}{t \cdot z} \]

↓

\[\frac{x}{y} + \left(-2 - \frac{-2 + \frac{-2}{z}}{t}\right) \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (+ (/ x y) (/ (+ 2.0 (* (* z 2.0) (- 1.0 t))) (* t z))))

↓

(FPCore (x y z t)
 :precision binary64
 (+ (/ x y) (- -2.0 (/ (+ -2.0 (/ -2.0 z)) t))))

C

double code(double x, double y, double z, double t) {
	return (x / y) + ((2.0 + ((z * 2.0) * (1.0 - t))) / (t * z));
}

↓

double code(double x, double y, double z, double t) {
	return (x / y) + (-2.0 - ((-2.0 + (-2.0 / z)) / t));
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = (x / y) + ((2.0d0 + ((z * 2.0d0) * (1.0d0 - t))) / (t * z))
end function

↓

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = (x / y) + ((-2.0d0) - (((-2.0d0) + ((-2.0d0) / z)) / t))
end function

Java

public static double code(double x, double y, double z, double t) {
	return (x / y) + ((2.0 + ((z * 2.0) * (1.0 - t))) / (t * z));
}

↓

public static double code(double x, double y, double z, double t) {
	return (x / y) + (-2.0 - ((-2.0 + (-2.0 / z)) / t));
}

Python

def code(x, y, z, t):
	return (x / y) + ((2.0 + ((z * 2.0) * (1.0 - t))) / (t * z))

↓

def code(x, y, z, t):
	return (x / y) + (-2.0 - ((-2.0 + (-2.0 / z)) / t))

Julia

function code(x, y, z, t)
	return Float64(Float64(x / y) + Float64(Float64(2.0 + Float64(Float64(z * 2.0) * Float64(1.0 - t))) / Float64(t * z)))
end

↓

function code(x, y, z, t)
	return Float64(Float64(x / y) + Float64(-2.0 - Float64(Float64(-2.0 + Float64(-2.0 / z)) / t)))
end

MATLAB

function tmp = code(x, y, z, t)
	tmp = (x / y) + ((2.0 + ((z * 2.0) * (1.0 - t))) / (t * z));
end

↓

function tmp = code(x, y, z, t)
	tmp = (x / y) + (-2.0 - ((-2.0 + (-2.0 / z)) / t));
end

Wolfram

code[x_, y_, z_, t_] := N[(N[(x / y), $MachinePrecision] + N[(N[(2.0 + N[(N[(z * 2.0), $MachinePrecision] * N[(1.0 - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(t * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

↓

code[x_, y_, z_, t_] := N[(N[(x / y), $MachinePrecision] + N[(-2.0 - N[(N[(-2.0 + N[(-2.0 / z), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Error

Bits error versus x

Bits error versus y

Bits error versus z

Bits error versus t

Target

Original	9.1
Target	0.1
Herbie	0.1

\[\frac{\frac{2}{z} + 2}{t} - \left(2 - \frac{x}{y}\right) \]

Derivation

1. Initial program 9.1

   \[\frac{x}{y} + \frac{2 + \left(z \cdot 2\right) \cdot \left(1 - t\right)}{t \cdot z} \]

2. Simplified 0.1

   \[\leadsto \color{blue}{\frac{x}{y} + \left(-2 - \frac{-2 + \frac{-2}{z}}{t}\right)} \]

3. Final simplification 0.1

   \[\leadsto \frac{x}{y} + \left(-2 - \frac{-2 + \frac{-2}{z}}{t}\right) \]

Reproduce

herbie shell --seed 2022129 
(FPCore (x y z t)
  :name "Data.HashTable.ST.Basic:computeOverhead from hashtables-1.2.0.2"
  :precision binary64

  :herbie-target
  (- (/ (+ (/ 2.0 z) 2.0) t) (- 2.0 (/ x y)))

  (+ (/ x y) (/ (+ 2.0 (* (* z 2.0) (- 1.0 t))) (* t z))))