Metrics for Numeric.Interval.Internal:scale from intervals-0.7.1, B

start0.0ms (0%)

Memory: 0.1MiB live, 0.1MiB allocated; 0ms collecting garbage

analyze0.0ms (0%)

Memory

0.5MiB live, 0.5MiB allocated; 0ms collecting garbage

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	99.9%	0.1%	0%	0%	0%	0
100%	99.9%	0%	0.1%	0%	0%	0%	1

Compiler

Compiled 7 to 7 computations (0% saved)

sample792.0ms (26.8%)

Memory

9.2MiB live, 1 200.9MiB allocated; 273ms collecting garbage

Samples

588.0ms

8 256×

valid

Precisions

Click to see histograms. Total time spent on operations: 227.0ms

ival-div: 108.0ms (47.6% of total)

ival-mult: 108.0ms (47.6% of total)

exact: 6.0ms (2.6% of total)

ival-assert: 3.0ms (1.3% of total)

adjust: 2.0ms (0.9% of total)

Bogosity

explain49.0ms (1.7%)

Memory

33.2MiB live, 125.6MiB allocated; 7ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`y`
-	-	`#s(literal 2 binary64)`
-	-	`(/.f64 (*.f64 x y) #s(literal 2 binary64))`
-	-	`(*.f64 x y)`
-	-	`x`

Confusion

	Predicted +	Predicted -
+	0	0
-	0	256

Precision

0/0

Recall

0/0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	256

Precision?

0/0

Recall?

0/0

Freqs

test

number	freq
0	256

Total Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	1

Precision?

0/0

Recall?

0/0

Samples

23.0ms

512×

valid

Compiler

Compiled 31 to 19 computations (38.7% saved)

Precisions

Click to see histograms. Total time spent on operations: 9.0ms

ival-div: 4.0ms (44.7% of total)

ival-mult: 4.0ms (44.7% of total)

ival-true: 0.0ms (0% of total)

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

preprocess274.0ms (9.3%)

Memory

-2.0MiB live, 184.3MiB allocated; 23ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	15	32
1	32	32
2	70	30
3	150	30
4	245	30
5	418	30
6	1518	30
7	4830	30
0	5	5
0	7	5
1	12	5
2	18	5
3	31	5
4	59	5
5	163	5
6	1040	5
7	5503	5
0	8410	5

Stop Event

1×	iter limit
1×	node limit
1×	iter limit
1×	node limit

Calls

Call 1

Inputs
(/.f64 (*.f64 x y) #s(literal 2 binary64))

Outputs
(/.f64 (*.f64 x y) #s(literal 2 binary64))
(/.f64 (*.f64 y x) #s(literal 2 binary64))

Symmetry

(negabs x)

(negabs y)

(sort x y)

Compiler

Compiled 5 to 5 computations (0% saved)

eval0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 2 computations (-∞% saved)

prune0.0ms (0%)

Memory

0.6MiB live, 0.6MiB allocated; 0ms collecting garbage

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(/.f64 (*.f64 x y) #s(literal 2 binary64))

Compiler

Compiled 5 to 5 computations (0% saved)

simplify181.0ms (6.1%)

Memory

-9.4MiB live, 92.1MiB allocated; 56ms collecting garbage

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(*.f64 x y)
cost-diff	0	(/.f64 (*.f64 x y) #s(literal 2 binary64))

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	11
0	7	11
1	12	11
2	18	11
3	31	11
4	59	11
5	163	11
6	1040	11
7	5503	11
0	8410	11

Stop Event

1×	iter limit
1×	node limit
1×	iter limit

Calls

Call 1

Inputs
(/.f64 (*.f64 x y) #s(literal 2 binary64))
(*.f64 x y)
x
y
#s(literal 2 binary64)

Outputs
(/.f64 (*.f64 x y) #s(literal 2 binary64))
(/.f64 (*.f64 y x) #s(literal 2 binary64))
(*.f64 x y)
(*.f64 y x)
x
y
#s(literal 2 binary64)

localize19.0ms (0.6%)

Memory

-15.2MiB live, 28.3MiB allocated; 8ms collecting garbage

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
accuracy	0.0	(*.f64 x y)
accuracy	0.00390625	(/.f64 (*.f64 x y) #s(literal 2 binary64))

Samples

14.0ms

256×

valid

Compiler

Compiled 13 to 7 computations (46.2% saved)

Precisions

Click to see histograms. Total time spent on operations: 4.0ms

ival-div: 2.0ms (47.9% of total)

ival-mult: 2.0ms (47.9% of total)

ival-true: 0.0ms (0% of total)

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

series4.0ms (0.1%)

Memory

7.6MiB live, 7.6MiB allocated; 0ms collecting garbage

Counts

2 → 2

Calls

Call 1

Inputs
(/.f64 (*.f64 x y) #s(literal 2 binary64))
(*.f64 x y)

Outputs
#s(approx (/ (* x y) 2) #s(hole binary64 (* 1/2 (* x y))))
#s(approx (* x y) #s(hole binary64 (* x y)))

Calls

6 calls:

Time	Variable		Point	Expression
1.0ms	y	@	0	((/ (* x y) 2) (* x y))
1.0ms	x	@	0	((/ (* x y) 2) (* x y))
1.0ms	x	@	inf	((/ (* x y) 2) (* x y))
1.0ms	y	@	-inf	((/ (* x y) 2) (* x y))
1.0ms	x	@	-inf	((/ (* x y) 2) (* x y))

simplify161.0ms (5.4%)

Memory

-14.2MiB live, 126.8MiB allocated; 32ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	9	18
1	17	18
2	30	18
3	45	18
4	73	18
5	179	18
6	1094	18
7	5305	18
0	8025	18

Stop Event

1×	iter limit
1×	node limit

Counts

2 → 2

Calls

Call 1

Inputs
#s(approx (/ (* x y) 2) #s(hole binary64 (* 1/2 (* x y))))
#s(approx (* x y) #s(hole binary64 (* x y)))

Outputs
#s(approx (/ (* x y) 2) #s(hole binary64 (* 1/2 (* x y))))
#s(approx (/ (* x y) 2) (.f64 #s(literal 1/2 binary64) (.f64 y x)))
#s(approx (* x y) #s(hole binary64 (* x y)))
#s(approx (* x y) (*.f64 y x))

rewrite70.0ms (2.4%)

Memory

8.0MiB live, 52.1MiB allocated; 22ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	8
0	7	8
1	16	8
0	47	8

Stop Event

1×	iter limit
1×	iter limit
1×	iter limit
1×	unsound
1×	iter limit

Counts

2 → 10

Calls

Call 1

Inputs
(/.f64 (*.f64 x y) #s(literal 2 binary64))
(*.f64 x y)

Outputs
(*.f64 (/.f64 y #s(literal 2 binary64)) x)
(*.f64 y (/.f64 x #s(literal 2 binary64)))
(*.f64 x (/.f64 y #s(literal 2 binary64)))
(/.f64 (neg.f64 (*.f64 (neg.f64 x) y)) #s(literal 2 binary64))
(/.f64 (*.f64 (neg.f64 x) y) #s(literal -2 binary64))
(/.f64 (*.f64 y x) #s(literal 2 binary64))
(neg.f64 (/.f64 (*.f64 (neg.f64 x) y) #s(literal 2 binary64)))
(neg.f64 (/.f64 (*.f64 y x) #s(literal -2 binary64)))
(*.f64 y x)
(*.f64 x y)

eval1.0ms (0%)

Memory: 2.4MiB live, 2.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 76 to 30 computations (60.5% saved)

prune1.0ms (0%)

Memory

2.0MiB live, 2.0MiB allocated; 0ms collecting garbage

Pruning

2 alts after pruning (2 fresh and 0 done)

	Pruned	Kept	Total
New	10	2	12
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	11	2	13

Accuracy

100.0%

Counts

13 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(*.f64 (/.f64 y #s(literal 2 binary64)) x)
▶	100.0%	#s(approx (/ (* x y) 2) (.f64 #s(literal 1/2 binary64) (.f64 y x)))

Compiler

Compiled 16 to 14 computations (12.5% saved)

simplify257.0ms (8.7%)

Memory

-15.8MiB live, 131.7MiB allocated; 37ms collecting garbage

Localize:

Found 5 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(/.f64 y #s(literal 2 binary64))
cost-diff	0	(*.f64 (/.f64 y #s(literal 2 binary64)) x)
cost-diff	0	(*.f64 y x)
cost-diff	0	(.f64 #s(literal 1/2 binary64) (.f64 y x))
cost-diff	0	#s(approx (/ (* x y) 2) (.f64 #s(literal 1/2 binary64) (.f64 y x)))

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	11	33
0	15	33
1	22	33
2	34	33
3	49	33
4	77	33
5	183	33
6	1107	33
7	5315	33
0	8032	33

Stop Event

1×	iter limit
1×	node limit
1×	iter limit

Calls

Call 1

Inputs
#s(approx (/ (* x y) 2) (.f64 #s(literal 1/2 binary64) (.f64 y x)))
(.f64 #s(literal 1/2 binary64) (.f64 y x))
#s(literal 1/2 binary64)
(*.f64 y x)
y
x
(*.f64 (/.f64 y #s(literal 2 binary64)) x)
(/.f64 y #s(literal 2 binary64))
y
#s(literal 2 binary64)
x

Outputs
#s(approx (/ (* x y) 2) (.f64 #s(literal 1/2 binary64) (.f64 y x)))
#s(approx (/ (* x y) 2) (.f64 (.f64 #s(literal 1/2 binary64) x) y))
(.f64 #s(literal 1/2 binary64) (.f64 y x))
(.f64 (.f64 #s(literal 1/2 binary64) x) y)
#s(literal 1/2 binary64)
(*.f64 y x)
y
x
(*.f64 (/.f64 y #s(literal 2 binary64)) x)
(.f64 (.f64 #s(literal 1/2 binary64) x) y)
(/.f64 y #s(literal 2 binary64))
(*.f64 #s(literal 1/2 binary64) y)
y
#s(literal 2 binary64)
x

localize101.0ms (3.4%)

Memory

3.8MiB live, 49.8MiB allocated; 9ms collecting garbage

Localize:

Found 5 expressions of interest:

New	Metric	Score
accuracy	0.0	(/.f64 y #s(literal 2 binary64))
accuracy	0.0	(*.f64 (/.f64 y #s(literal 2 binary64)) x)
accuracy	0.0	(*.f64 y x)
accuracy	0.0	#s(approx (/ (* x y) 2) (.f64 #s(literal 1/2 binary64) (.f64 y x)))
accuracy	0.00390625	(.f64 #s(literal 1/2 binary64) (.f64 y x))

Samples

18.0ms

256×

valid

Compiler

Compiled 29 to 12 computations (58.6% saved)

Precisions

Click to see histograms. Total time spent on operations: 10.0ms

ival-mult: 6.0ms (59.3% of total)

ival-div: 3.0ms (29.6% of total)

ival-true: 0.0ms (0% of total)

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

series4.0ms (0.1%)

Memory

11.8MiB live, 11.8MiB allocated; 0ms collecting garbage

Counts

5 → 5

Calls

Call 1

Inputs
#s(approx (/ (* x y) 2) (.f64 #s(literal 1/2 binary64) (.f64 y x)))
(.f64 #s(literal 1/2 binary64) (.f64 y x))
(*.f64 y x)
(*.f64 (/.f64 y #s(literal 2 binary64)) x)
(/.f64 y #s(literal 2 binary64))

Outputs
#s(approx (/ (* x y) 2) #s(hole binary64 (* 1/2 (* x y))))
#s(approx (* 1/2 (* y x)) #s(hole binary64 (* 1/2 (* x y))))
#s(approx (* y x) #s(hole binary64 (* x y)))
#s(approx (* (/ y 2) x) #s(hole binary64 (* 1/2 (* x y))))
#s(approx (/ y 2) #s(hole binary64 (* 1/2 y)))

Calls

6 calls:

Time	Variable		Point	Expression
1.0ms	y	@	-inf	((/ (* x y) 2) (* 1/2 (* y x)) (* y x) (* (/ y 2) x) (/ y 2))
1.0ms	y	@	inf	((/ (* x y) 2) (* 1/2 (* y x)) (* y x) (* (/ y 2) x) (/ y 2))
1.0ms	y	@	0	((/ (* x y) 2) (* 1/2 (* y x)) (* y x) (* (/ y 2) x) (/ y 2))
1.0ms	x	@	-inf	((/ (* x y) 2) (* 1/2 (* y x)) (* y x) (* (/ y 2) x) (/ y 2))
0.0ms	x	@	inf	((/ (* x y) 2) (* 1/2 (* y x)) (* y x) (* (/ y 2) x) (/ y 2))

simplify227.0ms (7.7%)

Memory

27.2MiB live, 174.1MiB allocated; 15ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	17	47
1	28	47
2	37	47
3	50	47
4	78	47
5	184	47
6	1117	47
7	5324	47
0	8039	47

Stop Event

1×	iter limit
1×	node limit

Counts

5 → 5

Calls

Call 1

Inputs
#s(approx (/ (* x y) 2) #s(hole binary64 (* 1/2 (* x y))))
#s(approx (* 1/2 (* y x)) #s(hole binary64 (* 1/2 (* x y))))
#s(approx (* y x) #s(hole binary64 (* x y)))
#s(approx (* (/ y 2) x) #s(hole binary64 (* 1/2 (* x y))))
#s(approx (/ y 2) #s(hole binary64 (* 1/2 y)))

Outputs
#s(approx (/ (* x y) 2) #s(hole binary64 (* 1/2 (* x y))))
#s(approx (* (/ y 2) x) (.f64 (.f64 #s(literal 1/2 binary64) y) x))
#s(approx (* 1/2 (* y x)) #s(hole binary64 (* 1/2 (* x y))))
#s(approx (* (/ y 2) x) (.f64 (.f64 #s(literal 1/2 binary64) y) x))
#s(approx (* y x) #s(hole binary64 (* x y)))
#s(approx (* y x) (*.f64 y x))
#s(approx (* (/ y 2) x) #s(hole binary64 (* 1/2 (* x y))))
#s(approx (* (/ y 2) x) (.f64 (.f64 #s(literal 1/2 binary64) y) x))
#s(approx (/ y 2) #s(hole binary64 (* 1/2 y)))
#s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y))

rewrite104.0ms (3.5%)

Memory

-13.6MiB live, 76.8MiB allocated; 7ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	11	27
0	15	27
1	29	27
0	70	27

Stop Event

1×	iter limit
1×	iter limit
1×	iter limit
1×	unsound
1×	iter limit

Counts

5 → 22

Calls

Call 1

Inputs
#s(approx (/ (* x y) 2) (.f64 #s(literal 1/2 binary64) (.f64 y x)))
(.f64 #s(literal 1/2 binary64) (.f64 y x))
(*.f64 y x)
(*.f64 (/.f64 y #s(literal 2 binary64)) x)
(/.f64 y #s(literal 2 binary64))

Outputs
#s(approx (/ (* x y) 2) (.f64 (.f64 y x) #s(literal 1/2 binary64)))
(.f64 (.f64 #s(literal 1/2 binary64) x) y)
(.f64 (.f64 #s(literal 1/2 binary64) y) x)
(.f64 (.f64 y x) #s(literal 1/2 binary64))
(.f64 #s(literal 1/2 binary64) (.f64 y x))
(.f64 y (.f64 x #s(literal 1/2 binary64)))
(.f64 x (.f64 #s(literal 1/2 binary64) y))
(*.f64 y x)
(*.f64 x y)
(*.f64 (/.f64 y #s(literal 2 binary64)) x)
(*.f64 y (/.f64 x #s(literal 2 binary64)))
(*.f64 x (/.f64 y #s(literal 2 binary64)))
(/.f64 (neg.f64 (*.f64 (neg.f64 x) y)) #s(literal 2 binary64))
(/.f64 (*.f64 (neg.f64 x) y) #s(literal -2 binary64))
(/.f64 (*.f64 y x) #s(literal 2 binary64))
(neg.f64 (/.f64 (*.f64 (neg.f64 x) y) #s(literal 2 binary64)))
(neg.f64 (/.f64 (*.f64 y x) #s(literal -2 binary64)))
(/.f64 (neg.f64 (neg.f64 y)) #s(literal 2 binary64))
(/.f64 (neg.f64 y) #s(literal -2 binary64))
(/.f64 y #s(literal 2 binary64))
(neg.f64 (/.f64 (neg.f64 y) #s(literal 2 binary64)))
(neg.f64 (/.f64 y #s(literal -2 binary64)))

eval2.0ms (0.1%)

Memory: 8.0MiB live, 8.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 211 to 63 computations (70.1% saved)

prune3.0ms (0.1%)

Memory

12.5MiB live, 12.4MiB allocated; 0ms collecting garbage

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	24	1	25
Fresh	0	0	0
Picked	2	0	2
Done	0	0	0
Total	26	1	27

Accuracy

100.0%

Counts

27 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(.f64 #s(approx (/ y 2) (.f64 #s(literal 1/2 binary64) y)) x)

Compiler

Compiled 9 to 8 computations (11.1% saved)

simplify216.0ms (7.3%)

Memory

-37.3MiB live, 167.2MiB allocated; 22ms collecting garbage

Localize:

Found 3 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(*.f64 #s(literal 1/2 binary64) y)
cost-diff	0	#s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y))
cost-diff	0	(.f64 #s(approx (/ y 2) (.f64 #s(literal 1/2 binary64) y)) x)

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	8	22
0	10	22
1	14	22
2	17	22
3	23	22
4	45	22
5	128	22
6	689	22
7	4950	22
0	8359	22

Stop Event

1×	iter limit
1×	node limit
1×	iter limit

Calls

Call 1

Inputs
(.f64 #s(approx (/ y 2) (.f64 #s(literal 1/2 binary64) y)) x)
#s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y))
(*.f64 #s(literal 1/2 binary64) y)
#s(literal 1/2 binary64)
y
x

Outputs
(.f64 #s(approx (/ y 2) (.f64 #s(literal 1/2 binary64) y)) x)
(.f64 x #s(approx (/ y 2) (.f64 #s(literal 1/2 binary64) y)))
#s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y))
(*.f64 #s(literal 1/2 binary64) y)
#s(literal 1/2 binary64)
y
x

localize17.0ms (0.6%)

Memory

22.9MiB live, 22.9MiB allocated; 0ms collecting garbage

Localize:

Found 3 expressions of interest:

New	Metric	Score	Program
accuracy	0.0	(.f64 #s(approx (/ y 2) (.f64 #s(literal 1/2 binary64) y)) x)
accuracy	0.0	(*.f64 #s(literal 1/2 binary64) y)
accuracy	0.0	#s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y))

Samples

12.0ms

256×

valid

Compiler

Compiled 16 to 9 computations (43.8% saved)

Precisions

Click to see histograms. Total time spent on operations: 5.0ms

ival-mult: 3.0ms (55.4% of total)

ival-div: 2.0ms (36.9% of total)

ival-true: 0.0ms (0% of total)

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

series34.0ms (1.1%)

Memory

-33.2MiB live, 22.4MiB allocated; 7ms collecting garbage

Counts

3 → 3

Calls

Call 1

Inputs
(.f64 #s(approx (/ y 2) (.f64 #s(literal 1/2 binary64) y)) x)
#s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y))
(*.f64 #s(literal 1/2 binary64) y)

Outputs
#s(approx (* (/ y 2) x) #s(hole binary64 (* 1/2 (* x y))))
#s(approx (/ y 2) #s(hole binary64 (* 1/2 y)))
#s(approx (* 1/2 y) #s(hole binary64 (* 1/2 y)))

Calls

6 calls:

Time	Variable		Point	Expression
31.0ms	y	@	-inf	((* (/ y 2) x) (/ y 2) (* 1/2 y))
1.0ms	y	@	inf	((* (/ y 2) x) (/ y 2) (* 1/2 y))
0.0ms	y	@	0	((* (/ y 2) x) (/ y 2) (* 1/2 y))
0.0ms	x	@	0	((* (/ y 2) x) (/ y 2) (* 1/2 y))
0.0ms	x	@	-inf	((* (/ y 2) x) (/ y 2) (* 1/2 y))

simplify141.0ms (4.8%)

Memory

37.3MiB live, 124.8MiB allocated; 13ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	12	25
1	22	25
2	32	25
3	45	25
4	73	25
5	179	25
6	1093	25
7	5294	25
0	8014	25

Stop Event

1×	iter limit
1×	node limit

Counts

3 → 3

Calls

Call 1

Inputs
#s(approx (* (/ y 2) x) #s(hole binary64 (* 1/2 (* x y))))
#s(approx (/ y 2) #s(hole binary64 (* 1/2 y)))
#s(approx (* 1/2 y) #s(hole binary64 (* 1/2 y)))

Outputs
#s(approx (* (/ y 2) x) #s(hole binary64 (* 1/2 (* x y))))
#s(approx (* (/ y 2) x) (.f64 x (.f64 #s(literal 1/2 binary64) y)))
#s(approx (/ y 2) #s(hole binary64 (* 1/2 y)))
#s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y))
#s(approx (* 1/2 y) #s(hole binary64 (* 1/2 y)))
#s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y))

rewrite21.0ms (0.7%)

Memory

-13.8MiB live, 31.2MiB allocated; 7ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	8	19
0	10	19
1	18	19
0	39	19

Stop Event

1×	iter limit
1×	iter limit
1×	iter limit
1×	unsound
1×	iter limit

Counts

3 → 5

Calls

Call 1

Inputs
(.f64 #s(approx (/ y 2) (.f64 #s(literal 1/2 binary64) y)) x)
#s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y))
(*.f64 #s(literal 1/2 binary64) y)

Outputs
(.f64 x #s(approx (/ y 2) (.f64 #s(literal 1/2 binary64) y)))
(.f64 #s(approx (/ y 2) (.f64 #s(literal 1/2 binary64) y)) x)
#s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y))
(*.f64 #s(literal 1/2 binary64) y)
(*.f64 y #s(literal 1/2 binary64))

eval1.0ms (0%)

Memory: 1.3MiB live, 1.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 56 to 15 computations (73.2% saved)

prune2.0ms (0.1%)

Memory

3.5MiB live, 3.5MiB allocated; 0ms collecting garbage

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	6	0	6
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	6	1	7

Accuracy

100.0%

Counts

7 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(.f64 #s(approx (/ y 2) (.f64 #s(literal 1/2 binary64) y)) x)

Compiler

Compiled 39 to 26 computations (33.3% saved)

regimes27.0ms (0.9%)

Memory

-29.5MiB live, 26.9MiB allocated; 11ms collecting garbage

Counts

4 → 1

Calls

Call 1

Inputs
#s(approx (/ (* x y) 2) (.f64 #s(literal 1/2 binary64) (.f64 y x)))
(.f64 #s(approx (/ y 2) (.f64 #s(literal 1/2 binary64) y)) x)
(*.f64 (/.f64 y #s(literal 2 binary64)) x)
(/.f64 (*.f64 x y) #s(literal 2 binary64))

Outputs
(.f64 #s(approx (/ y 2) (.f64 #s(literal 1/2 binary64) y)) x)

Calls

4 calls:

21.0ms	(*.f64 x y)
2.0ms	y
2.0ms	x
2.0ms	(/.f64 (*.f64 x y) #s(literal 2 binary64))

Results

Accuracy	Segments	Branch
100.0%	1	`(*.f64 x y)`
100.0%	1	`(/.f64 (*.f64 x y) #s(literal 2 binary64))`
100.0%	1	`x`
100.0%	1	`y`

Compiler

Compiled 10 to 12 computations (-20% saved)

regimes5.0ms (0.2%)

Memory

14.9MiB live, 14.9MiB allocated; 0ms collecting garbage

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

1 → 1

Calls

Call 1

Inputs
#s(approx (/ (* x y) 2) (.f64 #s(literal 1/2 binary64) (.f64 y x)))

Outputs
#s(approx (/ (* x y) 2) (.f64 #s(literal 1/2 binary64) (.f64 y x)))

Calls

4 calls:

1.0ms	y
1.0ms	x
1.0ms	(/.f64 (*.f64 x y) #s(literal 2 binary64))
1.0ms	(*.f64 x y)

Results

Accuracy	Segments	Branch
100.0%	1	`(*.f64 x y)`
100.0%	1	`(/.f64 (*.f64 x y) #s(literal 2 binary64))`
100.0%	1	`x`
100.0%	1	`y`

Compiler

Compiled 10 to 12 computations (-20% saved)

simplify97.0ms (3.3%)

Memory

-16.6MiB live, 72.2MiB allocated; 17ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	20
1	17	20
2	23	20
3	37	20
4	77	20
5	415	20
6	3627	20

Stop Event

1×	node limit

Calls

Call 1

Inputs
(.f64 #s(approx (/ y 2) (.f64 #s(literal 1/2 binary64) y)) x)
#s(approx (/ (* x y) 2) (.f64 #s(literal 1/2 binary64) (.f64 y x)))

Outputs
(.f64 #s(approx (/ y 2) (.f64 #s(literal 1/2 binary64) y)) x)
#s(approx (/ (* x y) 2) (.f64 #s(literal 1/2 binary64) (.f64 y x)))

derivations120.0ms (4.1%)

Memory

-1.2MiB live, 93.8MiB allocated; 25ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 20 to 13 computations (35% saved)

preprocess23.0ms (0.8%)

Memory

33.4MiB live, 33.4MiB allocated; 0ms collecting garbage

Remove

(sort x y)

(negabs y)

(negabs x)

Compiler

Compiled 104 to 84 computations (19.2% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated; 0ms collecting garbage

start0.0ms (0%)

analyze0.0ms (0%)

sample792.0ms (26.8%)

explain49.0ms (1.7%)

preprocess274.0ms (9.3%)

eval0.0ms (0%)

prune0.0ms (0%)

simplify181.0ms (6.1%)

localize19.0ms (0.6%)

series4.0ms (0.1%)

simplify161.0ms (5.4%)

rewrite70.0ms (2.4%)

eval1.0ms (0%)

prune1.0ms (0%)

simplify257.0ms (8.7%)

localize101.0ms (3.4%)

series4.0ms (0.1%)

simplify227.0ms (7.7%)

rewrite104.0ms (3.5%)

eval2.0ms (0.1%)

prune3.0ms (0.1%)

simplify216.0ms (7.3%)

localize17.0ms (0.6%)

series34.0ms (1.1%)

simplify141.0ms (4.8%)

rewrite21.0ms (0.7%)

eval1.0ms (0%)

prune2.0ms (0.1%)

regimes27.0ms (0.9%)

regimes5.0ms (0.2%)

simplify97.0ms (3.3%)

derivations120.0ms (4.1%)

preprocess23.0ms (0.8%)

end0.0ms (0%)

Profiling