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

Average Error: 6.5 → 0.4

Time: 11.6s

Precision: binary64

Cost: 1352

Math

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

↓

\[\begin{array}{l} t_1 := y \cdot \left(z - t\right)\\ \mathbf{if}\;t_1 \leq -\infty:\\ \;\;\;\;x - \frac{y}{\frac{a}{z - t}}\\ \mathbf{elif}\;t_1 \leq 10^{+223}:\\ \;\;\;\;x + \frac{y \cdot \left(t - z\right)}{a}\\ \mathbf{else}:\\ \;\;\;\;x - \left(z - t\right) \cdot \frac{y}{a}\\ \end{array} \]

FPCore

(FPCore (x y z t a) :precision binary64 (- x (/ (* y (- z t)) a)))

↓

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (* y (- z t))))
   (if (<= t_1 (- INFINITY))
     (- x (/ y (/ a (- z t))))
     (if (<= t_1 1e+223)
       (+ x (/ (* y (- t z)) a))
       (- x (* (- z t) (/ y a)))))))

C

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

↓

double code(double x, double y, double z, double t, double a) {
	double t_1 = y * (z - t);
	double tmp;
	if (t_1 <= -((double) INFINITY)) {
		tmp = x - (y / (a / (z - t)));
	} else if (t_1 <= 1e+223) {
		tmp = x + ((y * (t - z)) / a);
	} else {
		tmp = x - ((z - t) * (y / a));
	}
	return tmp;
}

Java

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

↓

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = y * (z - t);
	double tmp;
	if (t_1 <= -Double.POSITIVE_INFINITY) {
		tmp = x - (y / (a / (z - t)));
	} else if (t_1 <= 1e+223) {
		tmp = x + ((y * (t - z)) / a);
	} else {
		tmp = x - ((z - t) * (y / a));
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	return x - ((y * (z - t)) / a)

↓

def code(x, y, z, t, a):
	t_1 = y * (z - t)
	tmp = 0
	if t_1 <= -math.inf:
		tmp = x - (y / (a / (z - t)))
	elif t_1 <= 1e+223:
		tmp = x + ((y * (t - z)) / a)
	else:
		tmp = x - ((z - t) * (y / a))
	return tmp

Julia

function code(x, y, z, t, a)
	return Float64(x - Float64(Float64(y * Float64(z - t)) / a))
end

↓

function code(x, y, z, t, a)
	t_1 = Float64(y * Float64(z - t))
	tmp = 0.0
	if (t_1 <= Float64(-Inf))
		tmp = Float64(x - Float64(y / Float64(a / Float64(z - t))));
	elseif (t_1 <= 1e+223)
		tmp = Float64(x + Float64(Float64(y * Float64(t - z)) / a));
	else
		tmp = Float64(x - Float64(Float64(z - t) * Float64(y / a)));
	end
	return tmp
end

MATLAB

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

↓

function tmp_2 = code(x, y, z, t, a)
	t_1 = y * (z - t);
	tmp = 0.0;
	if (t_1 <= -Inf)
		tmp = x - (y / (a / (z - t)));
	elseif (t_1 <= 1e+223)
		tmp = x + ((y * (t - z)) / a);
	else
		tmp = x - ((z - t) * (y / a));
	end
	tmp_2 = tmp;
end

Wolfram

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

↓

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(y * N[(z - t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], N[(x - N[(y / N[(a / N[(z - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 1e+223], N[(x + N[(N[(y * N[(t - z), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], N[(x - N[(N[(z - t), $MachinePrecision] * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Target

Original	6.5
Target	0.6
Herbie	0.4

\[\begin{array}{l} \mathbf{if}\;y < -1.0761266216389975 \cdot 10^{-10}:\\ \;\;\;\;x - \frac{1}{\frac{\frac{a}{z - t}}{y}}\\ \mathbf{elif}\;y < 2.894426862792089 \cdot 10^{-49}:\\ \;\;\;\;x - \frac{y \cdot \left(z - t\right)}{a}\\ \mathbf{else}:\\ \;\;\;\;x - \frac{y}{\frac{a}{z - t}}\\ \end{array} \]

Derivation

1. Split input into 3 regimes

2. if (*.f64 y (-.f64 z t)) < -inf.0

   1. Initial program 64.0

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

   2. Simplified 0.2

      \[\leadsto \color{blue}{x - \frac{y}{\frac{a}{z - t}}} \]
      Proof
      (-.f64 x (/.f64 y (/.f64 a (-.f64 z t)))): 0 points increase in error, 0 points decrease in error
      (-.f64 x (Rewrite<= associate-/l*_binary64 (/.f64 (*.f64 y (-.f64 z t)) a))): 0 points increase in error, 0 points decrease in error

   if -inf.0 < (*.f64 y (-.f64 z t)) < 1.00000000000000005e223

   1. Initial program 0.3

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

   if 1.00000000000000005e223 < (*.f64 y (-.f64 z t))

   1. Initial program 34.5

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

   2. Simplified 0.7

      \[\leadsto \color{blue}{x - \frac{y}{a} \cdot \left(z - t\right)} \]
      Proof
      (-.f64 x (/.f64 y (/.f64 a (-.f64 z t)))): 0 points increase in error, 0 points decrease in error
      (-.f64 x (Rewrite<= associate-/l*_binary64 (/.f64 (*.f64 y (-.f64 z t)) a))): 0 points increase in error, 0 points decrease in error
3. Recombined 3 regimes into one program.

4. Final simplification 0.4

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \cdot \left(z - t\right) \leq -\infty:\\ \;\;\;\;x - \frac{y}{\frac{a}{z - t}}\\ \mathbf{elif}\;y \cdot \left(z - t\right) \leq 10^{+223}:\\ \;\;\;\;x + \frac{y \cdot \left(t - z\right)}{a}\\ \mathbf{else}:\\ \;\;\;\;x - \left(z - t\right) \cdot \frac{y}{a}\\ \end{array} \]

Alternatives

Alternative 1
Error	32.7
Cost	1772

\[\begin{array}{l} t_1 := \frac{y \cdot t}{a}\\ t_2 := z \cdot \frac{-y}{a}\\ \mathbf{if}\;a \leq -2.55 \cdot 10^{-17}:\\ \;\;\;\;x\\ \mathbf{elif}\;a \leq -3.4 \cdot 10^{-57}:\\ \;\;\;\;t \cdot \frac{y}{a}\\ \mathbf{elif}\;a \leq -9.2 \cdot 10^{-233}:\\ \;\;\;\;x\\ \mathbf{elif}\;a \leq 2.9 \cdot 10^{-288}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;a \leq 3.3 \cdot 10^{-208}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;a \leq 2.45 \cdot 10^{-170}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;a \leq 8.2 \cdot 10^{-97}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;a \leq 1.5 \cdot 10^{-25}:\\ \;\;\;\;x\\ \mathbf{elif}\;a \leq 2.2 \cdot 10^{-12}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;a \leq 1.8 \cdot 10^{+114}:\\ \;\;\;\;x\\ \mathbf{elif}\;a \leq 3.2 \cdot 10^{+162}:\\ \;\;\;\;y \cdot \frac{t}{a}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]

Alternative 2
Error	33.0
Cost	1772

\[\begin{array}{l} t_1 := \frac{y \cdot t}{a}\\ t_2 := z \cdot \frac{-y}{a}\\ \mathbf{if}\;a \leq -2.9 \cdot 10^{-16}:\\ \;\;\;\;x\\ \mathbf{elif}\;a \leq -1.35 \cdot 10^{-52}:\\ \;\;\;\;t \cdot \frac{y}{a}\\ \mathbf{elif}\;a \leq -8.8 \cdot 10^{-231}:\\ \;\;\;\;x\\ \mathbf{elif}\;a \leq 8 \cdot 10^{-288}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;a \leq 3.45 \cdot 10^{-208}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;a \leq 7.5 \cdot 10^{-170}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;a \leq 1.4 \cdot 10^{-88}:\\ \;\;\;\;\frac{-y}{\frac{a}{z}}\\ \mathbf{elif}\;a \leq 1.5 \cdot 10^{-25}:\\ \;\;\;\;x\\ \mathbf{elif}\;a \leq 2.2 \cdot 10^{-12}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;a \leq 1.8 \cdot 10^{+114}:\\ \;\;\;\;x\\ \mathbf{elif}\;a \leq 3.2 \cdot 10^{+162}:\\ \;\;\;\;y \cdot \frac{t}{a}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]

Alternative 3
Error	32.8
Cost	1640

\[\begin{array}{l} t_1 := \frac{y \cdot \left(-z\right)}{a}\\ \mathbf{if}\;a \leq -3.9 \cdot 10^{-17}:\\ \;\;\;\;x\\ \mathbf{elif}\;a \leq -2.8 \cdot 10^{-59}:\\ \;\;\;\;t \cdot \frac{y}{a}\\ \mathbf{elif}\;a \leq -3 \cdot 10^{-258}:\\ \;\;\;\;x\\ \mathbf{elif}\;a \leq 3.9 \cdot 10^{-208}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;a \leq 6.2 \cdot 10^{-172}:\\ \;\;\;\;\frac{y \cdot t}{a}\\ \mathbf{elif}\;a \leq 3.1 \cdot 10^{-97}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;a \leq 1.5 \cdot 10^{-25}:\\ \;\;\;\;x\\ \mathbf{elif}\;a \leq 2.2 \cdot 10^{-12}:\\ \;\;\;\;z \cdot \frac{-y}{a}\\ \mathbf{elif}\;a \leq 1.8 \cdot 10^{+114}:\\ \;\;\;\;x\\ \mathbf{elif}\;a \leq 1.7 \cdot 10^{+163}:\\ \;\;\;\;y \cdot \frac{t}{a}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]

Alternative 4
Error	19.6
Cost	1241

\[\begin{array}{l} t_1 := -\frac{y \cdot z}{a}\\ t_2 := x + \frac{y}{\frac{a}{t}}\\ \mathbf{if}\;a \leq -2.2 \cdot 10^{-262}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;a \leq 6.1 \cdot 10^{-235}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;a \leq 2.75 \cdot 10^{-168}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;a \leq 1.05 \cdot 10^{-81}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;a \leq 1.5 \cdot 10^{-25} \lor \neg \left(a \leq 2.2 \cdot 10^{-12}\right):\\ \;\;\;\;t_2\\ \mathbf{else}:\\ \;\;\;\;y \cdot \frac{t - z}{a}\\ \end{array} \]

Alternative 5
Error	11.5
Cost	713

\[\begin{array}{l} \mathbf{if}\;t \leq -9.5 \cdot 10^{-40} \lor \neg \left(t \leq 1.46 \cdot 10^{-62}\right):\\ \;\;\;\;x + \frac{y}{\frac{a}{t}}\\ \mathbf{else}:\\ \;\;\;\;x - z \cdot \frac{y}{a}\\ \end{array} \]

Alternative 6
Error	20.6
Cost	712

\[\begin{array}{l} \mathbf{if}\;x \leq -3.1 \cdot 10^{-86}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 9 \cdot 10^{+66}:\\ \;\;\;\;y \cdot \frac{t - z}{a}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]

Alternative 7
Error	28.3
Cost	584

\[\begin{array}{l} \mathbf{if}\;x \leq -2.05 \cdot 10^{-91}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 2.15 \cdot 10^{-125}:\\ \;\;\;\;y \cdot \frac{t}{a}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]

Alternative 8
Error	28.1
Cost	584

\[\begin{array}{l} \mathbf{if}\;x \leq -1.8 \cdot 10^{-89}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 2.2 \cdot 10^{-126}:\\ \;\;\;\;t \cdot \frac{y}{a}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]

Alternative 9
Error	28.2
Cost	584

\[\begin{array}{l} \mathbf{if}\;x \leq -3.5 \cdot 10^{-89}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 1.12 \cdot 10^{-122}:\\ \;\;\;\;\frac{t}{\frac{a}{y}}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]

Alternative 10
Error	2.7
Cost	576

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

Alternative 11
Error	31.4
Cost	64

\[x \]

Reproduce

herbie shell --seed 2022343 
(FPCore (x y z t a)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, F"
  :precision binary64

  :herbie-target
  (if (< y -1.0761266216389975e-10) (- x (/ 1.0 (/ (/ a (- z t)) y))) (if (< y 2.894426862792089e-49) (- x (/ (* y (- z t)) a)) (- x (/ y (/ a (- z t))))))

  (- x (/ (* y (- z t)) a)))