Metrics for Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, C

start0.0ms (0%)

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

analyze36.0ms (3.8%)

Memory

-18.7MiB live, 32.1MiB allocated; 42ms collecting garbage

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	99.9%	0.1%	0%	0%	0%	0
0%	0%	99.9%	0.1%	0%	0%	0%	1
0%	0%	99.9%	0.1%	0%	0%	0%	2
50%	50%	50%	0.1%	0%	0%	0%	3
50%	50%	50%	0.1%	0%	0%	0%	4
75%	74.9%	25%	0.1%	0%	0%	0%	5
75%	74.9%	25%	0.1%	0%	0%	0%	6
87.5%	87.4%	12.5%	0.1%	0%	0%	0%	7
87.5%	87.4%	12.5%	0.1%	0%	0%	0%	8
93.8%	93.7%	6.2%	0.1%	0%	0%	0%	9
93.8%	93.7%	6.2%	0.1%	0%	0%	0%	10
96.9%	96.8%	3.1%	0.1%	0%	0%	0%	11
96.9%	96.8%	3.1%	0.1%	0%	0%	0%	12

Compiler

Compiled 7 to 7 computations (0% saved)

sample546.0ms (57.9%)

Memory

51.2MiB live, 986.5MiB allocated; 106ms collecting garbage

Samples

328.0ms

8 256×

valid

Precisions

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

ival-mult: 79.0ms (48.8% of total)

ival-div: 65.0ms (40.1% of total)

ival-true: 6.0ms (3.7% of total)

exact: 6.0ms (3.7% of total)

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

adjust: 2.0ms (1.2% of total)

Bogosity

explain48.0ms (5.1%)

Memory

-5.1MiB live, 87.7MiB allocated; 8ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(*.f64 y #s(literal 3 binary64))`
-	-	`y`
-	-	`#s(literal 3 binary64)`
-	-	`(/.f64 x (*.f64 y #s(literal 3 binary64)))`
-	-	`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

25.0ms

512×

valid

Compiler

Compiled 31 to 19 computations (38.7% saved)

Precisions

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

ival-mult: 8.0ms (61.4% of total)

ival-div: 4.0ms (30.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)

preprocess21.0ms (2.2%)

Memory

-11.2MiB live, 35.1MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	31
1	30	25
2	55	25
3	82	25
4	111	25
5	129	25
0	5	5
0	7	5
1	10	5
2	12	5
0	12	5

Stop Event

1×	iter limit
1×	saturated
1×	iter limit
1×	saturated

Calls

Call 1

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

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

Symmetry

(negabs y)

(negabs x)

Compiler

Compiled 5 to 5 computations (0% saved)

eval0.0ms (0%)

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

prune0.0ms (0%)

Memory

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

Alt Table

Click to see full alt table

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

Compiler

Compiled 5 to 5 computations (0% saved)

simplify3.0ms (0.4%)

Memory

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

Localize:

Found 2 expressions of interest:

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	11
0	7	11
1	10	11
2	12	11
0	12	11

Stop Event

1×	iter limit
1×	saturated
1×	iter limit

Calls

Call 1

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

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

localize20.0ms (2.1%)

Memory

-11.3MiB live, 36.2MiB allocated; 10ms collecting garbage

Localize:

Found 2 expressions of interest:

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

Samples

16.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 (51.4% of total)

ival-mult: 2.0ms (51.4% 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)

series5.0ms (0.5%)

Memory

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

Counts

2 → 2

Calls

Call 1

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

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

Calls

6 calls:

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

simplify4.0ms (0.4%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	11	18
1	16	18
2	20	18
3	22	18
4	23	18
0	23	18

Stop Event

1×	iter limit
1×	saturated

Counts

2 → 2

Calls

Call 1

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

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

rewrite19.0ms (2.1%)

Memory

-23.7MiB live, 21.5MiB allocated; 7ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	8
0	7	8
1	13	8
2	32	8
3	69	8
4	85	8
0	85	8

Stop Event

1×	iter limit
1×	saturated
1×	iter limit

Counts

2 → 12

Calls

Call 1

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

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

eval2.0ms (0.2%)

Memory: 3.7MiB live, 3.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 87 to 36 computations (58.6% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

4 alts after pruning (3 fresh and 1 done)

	Pruned	Kept	Total
New	11	3	14
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	11	4	15

Accuracy

100.0%

Counts

15 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	99.7%	(/.f64 (/.f64 x y) #s(literal 3 binary64))
▶	99.7%	(/.f64 (/.f64 x #s(literal 3 binary64)) y)
✓	99.6%	(/.f64 x (*.f64 y #s(literal 3 binary64)))
▶	99.6%	#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))

Compiler

Compiled 26 to 24 computations (7.7% saved)

simplify4.0ms (0.4%)

Memory

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

Localize:

Found 7 expressions of interest:

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	12	44
0	17	44
1	22	44
2	26	44
3	27	44
0	27	44

Stop Event

1×	iter limit
1×	saturated
1×	iter limit

Calls

Call 1

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

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

localize36.0ms (3.8%)

Memory

17.1MiB live, 62.9MiB allocated; 6ms collecting garbage

Localize:

Found 7 expressions of interest:

New	Metric	Score
accuracy	0.0	(/.f64 x y)
accuracy	0.22265625	(/.f64 (/.f64 x y) #s(literal 3 binary64))
accuracy	0.0	(/.f64 x #s(literal 3 binary64))
accuracy	0.203125	(/.f64 (/.f64 x #s(literal 3 binary64)) y)
accuracy	0.0	(/.f64 x y)
accuracy	0.0	#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
accuracy	0.28515625	(*.f64 (/.f64 x y) #s(literal 1/3 binary64))

Samples

29.0ms

256×

valid

Compiler

Compiled 40 to 13 computations (67.5% saved)

Precisions

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

ival-mult: 8.0ms (41.3% of total)

ival-div: 7.0ms (36.1% of total)

const: 3.0ms (15.5% of total)

ival-true: 1.0ms (5.2% of total)

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

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

series4.0ms (0.5%)

Memory

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

Counts

6 → 6

Calls

Call 1

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

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

Calls

6 calls:

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

simplify9.0ms (0.9%)

Memory

-38.4MiB live, 7.2MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	19	58
1	25	58
2	27	58
3	28	58
0	28	58

Stop Event

1×	iter limit
1×	saturated

Counts

6 → 6

Calls

Call 1

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

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

rewrite10.0ms (1.1%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	12	32
0	17	32
1	34	32
2	83	32
3	135	32
4	155	32
5	157	32
0	157	32

Stop Event

1×	iter limit
1×	saturated
1×	iter limit

Counts

6 → 32

Calls

Call 1

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

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

eval3.0ms (0.3%)

Memory: 6.7MiB live, 6.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 311 to 78 computations (74.9% saved)

prune3.0ms (0.4%)

Memory

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

Pruning

6 alts after pruning (2 fresh and 4 done)

	Pruned	Kept	Total
New	31	2	33
Fresh	0	0	0
Picked	0	3	3
Done	0	1	1
Total	31	6	37

Accuracy

100.0%

Counts

37 → 6

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	99.7%	(/.f64 (/.f64 x y) #s(literal 3 binary64))
✓	99.7%	(/.f64 (/.f64 x #s(literal 3 binary64)) y)
▶	99.5%	(/.f64 #s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x)) y)
✓	99.6%	(/.f64 x (*.f64 y #s(literal 3 binary64)))
✓	99.6%	#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
▶	99.1%	#s(approx (/ x (* y 3)) (*.f64 (/.f64 #s(literal 1/3 binary64) y) x))

Compiler

Compiled 46 to 41 computations (10.9% saved)

simplify4.0ms (0.4%)

Memory

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

Localize:

Found 6 expressions of interest:

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	44
0	17	44
1	23	44
2	25	44
3	26	44
0	26	44

Stop Event

1×	iter limit
1×	saturated
1×	iter limit

Calls

Call 1

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

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

localize42.0ms (4.5%)

Memory

-33.4MiB live, 65.4MiB allocated; 15ms collecting garbage

Localize:

Found 6 expressions of interest:

New	Metric	Score
accuracy	0.0	#s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x))
accuracy	0.203125	(/.f64 #s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x)) y)
accuracy	0.32421875	(*.f64 #s(literal 1/3 binary64) x)
accuracy	0.0	#s(approx (/ x (* y 3)) (*.f64 (/.f64 #s(literal 1/3 binary64) y) x))
accuracy	0.3984375	(/.f64 #s(literal 1/3 binary64) y)
accuracy	0.402575053982714	(*.f64 (/.f64 #s(literal 1/3 binary64) y) x)

Samples

33.0ms

256×

valid

Compiler

Compiled 32 to 13 computations (59.4% saved)

Precisions

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

ival-div: 10.0ms (52.7% of total)

ival-mult: 5.0ms (26.3% of total)

const: 4.0ms (21.1% 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)

series3.0ms (0.4%)

Memory

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

Counts

6 → 6

Calls

Call 1

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

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

Calls

6 calls:

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

simplify4.0ms (0.4%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	19	54
1	27	54
0	27	54

Stop Event

1×	iter limit
1×	saturated

Counts

6 → 6

Calls

Call 1

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

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

rewrite16.0ms (1.7%)

Memory

-26.0MiB live, 20.0MiB allocated; 9ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	38
0	17	38
1	35	38
2	76	38
3	142	38
4	158	38
5	158	38
0	158	38

Stop Event

1×	iter limit
1×	saturated
1×	iter limit

Counts

6 → 25

Calls

Call 1

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

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

eval4.0ms (0.4%)

Memory: 8.1MiB live, 8.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 328 to 79 computations (75.9% saved)

prune4.0ms (0.5%)

Memory

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

Pruning

6 alts after pruning (0 fresh and 6 done)

	Pruned	Kept	Total
New	29	0	29
Fresh	0	0	0
Picked	0	2	2
Done	0	4	4
Total	29	6	35

Accuracy

100.0%

Counts

35 → 6

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	99.7%	(/.f64 (/.f64 x y) #s(literal 3 binary64))
✓	99.7%	(/.f64 (/.f64 x #s(literal 3 binary64)) y)
✓	99.5%	(/.f64 #s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x)) y)
✓	99.6%	(/.f64 x (*.f64 y #s(literal 3 binary64)))
✓	99.6%	#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
✓	99.1%	#s(approx (/ x (* y 3)) (*.f64 (/.f64 #s(literal 1/3 binary64) y) x))

Compiler

Compiled 92 to 63 computations (31.5% saved)

regimes9.0ms (1%)

Memory

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

Counts

6 → 1

Calls

Call 1

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

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

Calls

4 calls:

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

Results

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

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes11.0ms (1.2%)

Memory

-26.1MiB live, 20.1MiB allocated; 3ms collecting garbage

Counts

4 → 1

Calls

Call 1

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

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

Calls

4 calls:

5.0ms	x
2.0ms	(*.f64 y #s(literal 3 binary64))
2.0ms	y
2.0ms	(/.f64 x (*.f64 y #s(literal 3 binary64)))

Results

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

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes5.0ms (0.5%)

Memory

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

Counts

2 → 1

Calls

Call 1

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

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

Calls

4 calls:

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

Results

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

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes4.0ms (0.4%)

Memory

13.3MiB live, 13.3MiB 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 3)) (*.f64 (/.f64 #s(literal 1/3 binary64) y) x))

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

Calls

4 calls:

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

Results

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

Compiler

Compiled 10 to 13 computations (-30% saved)

simplify17.0ms (1.8%)

Memory

-41.8MiB live, 22.0MiB allocated; 14ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	16	32
1	19	32
2	21	32

Stop Event

1×

saturated

Calls

Call 1

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

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

derivations3.0ms (0.3%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 32 to 17 computations (46.9% saved)

preprocess40.0ms (4.3%)

Memory

-9.9MiB live, 83.6MiB allocated; 7ms collecting garbage

Remove

(negabs x)

(negabs y)

Compiler

Compiled 124 to 94 computations (24.2% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze36.0ms (3.8%)

sample546.0ms (57.9%)

explain48.0ms (5.1%)

preprocess21.0ms (2.2%)

eval0.0ms (0%)

prune0.0ms (0%)

simplify3.0ms (0.4%)

localize20.0ms (2.1%)

series5.0ms (0.5%)

simplify4.0ms (0.4%)

rewrite19.0ms (2.1%)

eval2.0ms (0.2%)

prune1.0ms (0.1%)

simplify4.0ms (0.4%)

localize36.0ms (3.8%)

series4.0ms (0.5%)

simplify9.0ms (0.9%)

rewrite10.0ms (1.1%)

eval3.0ms (0.3%)

prune3.0ms (0.4%)

simplify4.0ms (0.4%)

localize42.0ms (4.5%)

series3.0ms (0.4%)

simplify4.0ms (0.4%)

rewrite16.0ms (1.7%)

eval4.0ms (0.4%)

prune4.0ms (0.5%)

regimes9.0ms (1%)

regimes11.0ms (1.2%)

regimes5.0ms (0.5%)

regimes4.0ms (0.4%)

simplify17.0ms (1.8%)

derivations3.0ms (0.3%)

preprocess40.0ms (4.3%)

end0.0ms (0%)

Profiling