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

Average Error: 0.0 → 0.0

Time: 4.8s

Precision: binary64

Cost: 448

Math

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

↓

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

FPCore

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

↓

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

C

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

↓

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

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 = (z + 1.0d0) * (x + y)
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 (z + 1.0) * (x + y);
}

Python

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

↓

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

Julia

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

↓

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

MATLAB

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

↓

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

Wolfram

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

↓

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

Derivation

1. Initial program 0.0

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

2. Final simplification 0.0

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

Alternatives

Alternative 1
Error	33.3
Cost	1116

\[\begin{array}{l} \mathbf{if}\;z \leq -7.6 \cdot 10^{+116}:\\ \;\;\;\;y \cdot z\\ \mathbf{elif}\;z \leq -5 \cdot 10^{+62}:\\ \;\;\;\;x \cdot z\\ \mathbf{elif}\;z \leq -8.2 \cdot 10^{+42}:\\ \;\;\;\;y \cdot z\\ \mathbf{elif}\;z \leq -74.02233883969043:\\ \;\;\;\;x \cdot z\\ \mathbf{elif}\;z \leq 3.03601651907226 \cdot 10^{-5}:\\ \;\;\;\;y\\ \mathbf{elif}\;z \leq 6.5 \cdot 10^{+110}:\\ \;\;\;\;y \cdot z\\ \mathbf{elif}\;z \leq 1.15 \cdot 10^{+169}:\\ \;\;\;\;x \cdot z\\ \mathbf{else}:\\ \;\;\;\;y \cdot z\\ \end{array} \]

Alternative 2
Error	13.7
Cost	1116

\[\begin{array}{l} \mathbf{if}\;z \leq -7.6 \cdot 10^{+116}:\\ \;\;\;\;y \cdot z\\ \mathbf{elif}\;z \leq -5 \cdot 10^{+62}:\\ \;\;\;\;x \cdot z\\ \mathbf{elif}\;z \leq -8.2 \cdot 10^{+42}:\\ \;\;\;\;y \cdot z\\ \mathbf{elif}\;z \leq -74.02233883969043:\\ \;\;\;\;x \cdot z\\ \mathbf{elif}\;z \leq 3.03601651907226 \cdot 10^{-5}:\\ \;\;\;\;x + y\\ \mathbf{elif}\;z \leq 6.5 \cdot 10^{+110}:\\ \;\;\;\;y \cdot z\\ \mathbf{elif}\;z \leq 1.15 \cdot 10^{+169}:\\ \;\;\;\;x \cdot z\\ \mathbf{else}:\\ \;\;\;\;y \cdot z\\ \end{array} \]

Alternative 3
Error	1.9
Cost	584

\[\begin{array}{l} t_0 := z \cdot \left(x + y\right)\\ \mathbf{if}\;z \leq -74.02233883969043:\\ \;\;\;\;t_0\\ \mathbf{elif}\;z \leq 3.03601651907226 \cdot 10^{-5}:\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \]

Alternative 4
Error	32.8
Cost	456

\[\begin{array}{l} \mathbf{if}\;z \leq -74.02233883969043:\\ \;\;\;\;y \cdot z\\ \mathbf{elif}\;z \leq 3.03601651907226 \cdot 10^{-5}:\\ \;\;\;\;y\\ \mathbf{else}:\\ \;\;\;\;y \cdot z\\ \end{array} \]

Alternative 5
Error	43.5
Cost	64

\[y \]

Reproduce

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