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

Average Error: 0.0 → 0.0

Time: 5.3s

Precision: binary64

Cost: 576

Math

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

↓

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

FPCore

(FPCore (x y z) :precision binary64 (* (+ x y) (+ z 1.0)))

↓

(FPCore (x y z) :precision binary64 (+ x (+ y (* z (+ y x)))))

C

double code(double x, double y, double z) {
	return (x + y) * (z + 1.0);
}

↓

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

Fortran

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

↓

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

Java

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

↓

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

Python

def code(x, y, z):
	return (x + y) * (z + 1.0)

↓

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

Julia

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

↓

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

MATLAB

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

↓

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

Wolfram

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

↓

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

Derivation

1. Initial program 0.0

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

2. Applied egg-rr 0.0

   \[\leadsto \color{blue}{\left(y + \left(x + y\right) \cdot z\right) + x} \]

3. Final simplification 0.0

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

Alternatives

Alternative 1
Error	32.0
Cost	1909

\[\begin{array}{l} \mathbf{if}\;z \leq -1:\\ \;\;\;\;x \cdot z\\ \mathbf{elif}\;z \leq -8.4 \cdot 10^{-116}:\\ \;\;\;\;y\\ \mathbf{elif}\;z \leq -7.5 \cdot 10^{-148}:\\ \;\;\;\;x\\ \mathbf{elif}\;z \leq -4.2 \cdot 10^{-179}:\\ \;\;\;\;y\\ \mathbf{elif}\;z \leq -1.3 \cdot 10^{-297}:\\ \;\;\;\;x\\ \mathbf{elif}\;z \leq 7.5 \cdot 10^{-218}:\\ \;\;\;\;y\\ \mathbf{elif}\;z \leq 1.5 \cdot 10^{-162}:\\ \;\;\;\;x\\ \mathbf{elif}\;z \leq 4.9 \cdot 10^{-73}:\\ \;\;\;\;y\\ \mathbf{elif}\;z \leq 3 \cdot 10^{-40}:\\ \;\;\;\;x\\ \mathbf{elif}\;z \leq 700:\\ \;\;\;\;y\\ \mathbf{elif}\;z \leq 2 \cdot 10^{+142} \lor \neg \left(z \leq 5.1 \cdot 10^{+203}\right) \land z \leq 3.2 \cdot 10^{+229}:\\ \;\;\;\;y \cdot z\\ \mathbf{else}:\\ \;\;\;\;x \cdot z\\ \end{array} \]

Alternative 2
Error	32.2
Cost	1512

\[\begin{array}{l} \mathbf{if}\;z \leq -1:\\ \;\;\;\;x \cdot z\\ \mathbf{elif}\;z \leq -2.05 \cdot 10^{-115}:\\ \;\;\;\;y\\ \mathbf{elif}\;z \leq -1.35 \cdot 10^{-147}:\\ \;\;\;\;x\\ \mathbf{elif}\;z \leq -1.5 \cdot 10^{-180}:\\ \;\;\;\;y\\ \mathbf{elif}\;z \leq -2.8 \cdot 10^{-298}:\\ \;\;\;\;x\\ \mathbf{elif}\;z \leq 1.2 \cdot 10^{-218}:\\ \;\;\;\;y\\ \mathbf{elif}\;z \leq 8 \cdot 10^{-167}:\\ \;\;\;\;x\\ \mathbf{elif}\;z \leq 1.05 \cdot 10^{-69}:\\ \;\;\;\;y\\ \mathbf{elif}\;z \leq 9 \cdot 10^{-40}:\\ \;\;\;\;x\\ \mathbf{elif}\;z \leq 5.1 \cdot 10^{-9}:\\ \;\;\;\;y\\ \mathbf{else}:\\ \;\;\;\;x \cdot z\\ \end{array} \]

Alternative 3
Error	13.0
Cost	853

\[\begin{array}{l} \mathbf{if}\;z \leq -1:\\ \;\;\;\;x \cdot z\\ \mathbf{elif}\;z \leq 720:\\ \;\;\;\;y + x\\ \mathbf{elif}\;z \leq 2 \cdot 10^{+148} \lor \neg \left(z \leq 4.4 \cdot 10^{+210}\right) \land z \leq 6.5 \cdot 10^{+232}:\\ \;\;\;\;y \cdot z\\ \mathbf{else}:\\ \;\;\;\;x \cdot z\\ \end{array} \]

Alternative 4
Error	12.6
Cost	852

\[\begin{array}{l} t_0 := y \cdot \left(z + 1\right)\\ \mathbf{if}\;z \leq -1.2 \cdot 10^{-10}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;z \leq 700:\\ \;\;\;\;y + x\\ \mathbf{elif}\;z \leq 3.3 \cdot 10^{+142}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;z \leq 1.7 \cdot 10^{+210}:\\ \;\;\;\;x \cdot z\\ \mathbf{elif}\;z \leq 8.6 \cdot 10^{+230}:\\ \;\;\;\;y \cdot z\\ \mathbf{else}:\\ \;\;\;\;x \cdot z\\ \end{array} \]

Alternative 5
Error	12.5
Cost	852

\[\begin{array}{l} t_0 := x \cdot \left(z + 1\right)\\ \mathbf{if}\;z \leq -0.00085:\\ \;\;\;\;t_0\\ \mathbf{elif}\;z \leq 700:\\ \;\;\;\;y + x\\ \mathbf{elif}\;z \leq 4.2 \cdot 10^{+141}:\\ \;\;\;\;y \cdot \left(z + 1\right)\\ \mathbf{elif}\;z \leq 3 \cdot 10^{+207}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;z \leq 9 \cdot 10^{+230}:\\ \;\;\;\;y \cdot z\\ \mathbf{else}:\\ \;\;\;\;x \cdot z\\ \end{array} \]

Alternative 6
Error	1.7
Cost	585

\[\begin{array}{l} \mathbf{if}\;z \leq -1 \lor \neg \left(z \leq 1\right):\\ \;\;\;\;z \cdot \left(y + x\right)\\ \mathbf{else}:\\ \;\;\;\;y + x\\ \end{array} \]

Alternative 7
Error	0.0
Cost	448

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

Alternative 8
Error	39.0
Cost	196

\[\begin{array}{l} \mathbf{if}\;y \leq 5.6 \cdot 10^{-117}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \]

Alternative 9
Error	43.7
Cost	64

\[x \]

Reproduce

herbie shell --seed 2022356 
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, G"
  :precision binary64
  (* (+ x y) (+ z 1.0)))