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

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

0.7MiB live, 0.7MiB 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 9 to 9 computations (0% saved)

sample826.0ms (35.6%)

Memory

34.3MiB live, 896.6MiB allocated; 157ms collecting garbage

Samples

396.0ms

8 256×

valid

Precisions

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

ival-div: 57.0ms (33.8% of total)

ival-mult: 52.0ms (30.8% of total)

ival-add: 44.0ms (26.1% of total)

exact: 10.0ms (5.9% of total)

adjust: 2.0ms (1.2% of total)

ival-assert: 2.0ms (1.2% of total)

Bogosity

explain89.0ms (3.8%)

Memory

2.3MiB live, 97.9MiB allocated; 8ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (+.f64 x y))`
-	-	`(/.f64 #s(literal 1 binary64) #s(literal 2 binary64))`
-	-	`#s(literal 2 binary64)`
-	-	`y`
-	-	`#s(literal 1 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 45 to 25 computations (44.4% saved)

Precisions

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

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

ival-add: 3.0ms (29.8% of total)

ival-mult: 3.0ms (29.8% 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)

preprocess280.0ms (12%)

Memory

3.4MiB live, 191.2MiB allocated; 18ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	18	34
1	58	34
2	179	30
3	724	30
4	1690	30
5	5931	30
0	7	5
0	11	5
1	22	5
2	36	5
3	61	5
4	142	5
5	454	5
6	4055	5
0	8118	5

Stop Event

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

Calls

Call 1

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

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

Symmetry

(sort x y)

Compiler

Compiled 7 to 7 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 #s(literal 1 binary64) #s(literal 2 binary64)) (+.f64 x y))

Compiler

Compiled 7 to 7 computations (0% saved)

simplify181.0ms (7.8%)

Memory

-23.3MiB live, 118.3MiB allocated; 21ms collecting garbage

Localize:

Found 3 expressions of interest:

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	13
0	11	13
1	22	13
2	36	13
3	61	13
4	142	13
5	454	13
6	4055	13
0	8118	13

Stop Event

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

Calls

Call 1

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

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

localize16.0ms (0.7%)

Memory

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

Localize:

Found 3 expressions of interest:

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

Samples

11.0ms

256×

valid

Compiler

Compiled 19 to 9 computations (52.6% saved)

Precisions

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

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

ival-add: 1.0ms (20.3% of total)

ival-mult: 1.0ms (20.3% 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)

series35.0ms (1.5%)

Memory

-40.6MiB live, 5.3MiB allocated; 3ms collecting garbage

Counts

3 → 14

Calls

Call 1

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

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

Calls

6 calls:

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

simplify147.0ms (6.3%)

Memory

26.7MiB live, 171.4MiB allocated; 16ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	55	118
1	141	118
2	336	118
3	899	118
4	4318	118
0	8094	118

Stop Event

1×	iter limit
1×	node limit

Counts

14 → 14

Calls

Call 1

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

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

rewrite40.0ms (1.7%)

Memory

-5.6MiB live, 41.5MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	9
0	11	9
1	36	9
0	200	9

Stop Event

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

Counts

3 → 27

Calls

Call 1

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

Outputs
#s(literal 1/2 binary64)
(*.f64 (+.f64 y x) #s(literal 1/2 binary64))
(*.f64 #s(literal 1/2 binary64) (+.f64 y x))
(/.f64 (.f64 (.f64 (+.f64 y x) (-.f64 x y)) #s(literal 1/2 binary64)) (-.f64 x y))
(/.f64 (.f64 (+.f64 (pow.f64 y #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) #s(literal 1/2 binary64)) (fma.f64 y (-.f64 y x) (.f64 x x)))
(/.f64 (.f64 #s(literal 1/2 binary64) (.f64 (+.f64 y x) (-.f64 x y))) (-.f64 x y))
(/.f64 (.f64 #s(literal 1/2 binary64) (+.f64 (pow.f64 y #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64)))) (fma.f64 y (-.f64 y x) (.f64 x x)))
(/.f64 (-.f64 (.f64 (.f64 x #s(literal 1/2 binary64)) (.f64 x #s(literal 1/2 binary64))) (.f64 (.f64 y #s(literal 1/2 binary64)) (.f64 y #s(literal 1/2 binary64)))) (-.f64 (.f64 x #s(literal 1/2 binary64)) (.f64 y #s(literal 1/2 binary64))))
(/.f64 (+.f64 (pow.f64 (.f64 x #s(literal 1/2 binary64)) #s(literal 3 binary64)) (pow.f64 (.f64 y #s(literal 1/2 binary64)) #s(literal 3 binary64))) (fma.f64 (.f64 x #s(literal 1/2 binary64)) (.f64 x #s(literal 1/2 binary64)) (-.f64 (.f64 (.f64 y #s(literal 1/2 binary64)) (.f64 y #s(literal 1/2 binary64))) (.f64 (.f64 x #s(literal 1/2 binary64)) (.f64 y #s(literal 1/2 binary64))))))
(fma.f64 y #s(literal 1/2 binary64) (*.f64 x #s(literal 1/2 binary64)))
(fma.f64 x #s(literal 1/2 binary64) (*.f64 y #s(literal 1/2 binary64)))
(fma.f64 #s(literal 1/2 binary64) y (*.f64 x #s(literal 1/2 binary64)))
(fma.f64 #s(literal 1/2 binary64) x (*.f64 y #s(literal 1/2 binary64)))
(-.f64 (.f64 x #s(literal 1/2 binary64)) (.f64 (neg.f64 y) #s(literal 1/2 binary64)))
(-.f64 (.f64 x #s(literal 1/2 binary64)) (.f64 #s(literal -1/2 binary64) y))
(+.f64 (.f64 y #s(literal 1/2 binary64)) (.f64 x #s(literal 1/2 binary64)))
(+.f64 (.f64 x #s(literal 1/2 binary64)) (.f64 y #s(literal 1/2 binary64)))
(/.f64 (-.f64 (.f64 y y) (.f64 x x)) (-.f64 y x))
(/.f64 (neg.f64 (*.f64 (+.f64 y x) (-.f64 x y))) (neg.f64 (-.f64 x y)))
(/.f64 (neg.f64 (+.f64 (pow.f64 y #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64)))) (neg.f64 (fma.f64 y (-.f64 y x) (*.f64 x x))))
(/.f64 (*.f64 (+.f64 y x) (-.f64 x y)) (-.f64 x y))
(/.f64 (+.f64 (pow.f64 y #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) (fma.f64 y y (-.f64 (.f64 x x) (.f64 y x))))
(/.f64 (+.f64 (pow.f64 y #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) (fma.f64 y (-.f64 y x) (*.f64 x x)))
(-.f64 (/.f64 (.f64 x x) (-.f64 x y)) (/.f64 (.f64 y y) (-.f64 x y)))
(+.f64 (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 y (-.f64 y x) (.f64 x x))) (/.f64 (pow.f64 y #s(literal 3 binary64)) (fma.f64 y (-.f64 y x) (.f64 x x))))
(+.f64 y x)
(+.f64 x y)

eval3.0ms (0.1%)

Memory: 7.5MiB live, 7.5MiB allocated; 0ms collecting garbage
Compiler: Compiled 424 to 101 computations (76.2% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (3 fresh and 0 done)

	Pruned	Kept	Total
New	30	3	33
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	31	3	34

Accuracy

100.0%

Counts

34 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 27 to 25 computations (7.4% saved)

simplify206.0ms (8.9%)

Memory

-44.0MiB live, 110.0MiB allocated; 86ms collecting garbage

Localize:

Found 6 expressions of interest:

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	14	39
0	18	39
1	26	39
2	38	39
3	63	39
4	144	39
5	456	39
6	4057	39
0	8131	39

Stop Event

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

Calls

Call 1

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

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

localize25.0ms (1.1%)

Memory

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

Localize:

Found 6 expressions of interest:

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

Samples

18.0ms

256×

valid

Compiler

Compiled 37 to 14 computations (62.2% saved)

Precisions

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

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

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

ival-add: 2.0ms (20.2% 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)

series10.0ms (0.4%)

Memory

-42.5MiB live, 4.2MiB allocated; 2ms collecting garbage

Counts

6 → 23

Calls

Call 1

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

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

Calls

6 calls:

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

simplify184.0ms (7.9%)

Memory

-2.2MiB live, 143.9MiB allocated; 7ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	66	205
1	155	205
2	348	205
3	911	205
4	4342	205
0	8096	205

Stop Event

1×	iter limit
1×	node limit

Counts

23 → 23

Calls

Call 1

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

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

rewrite48.0ms (2.1%)

Memory

7.0MiB live, 54.0MiB allocated; 1ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	14	32
0	18	32
1	48	32
0	261	32

Stop Event

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

Counts

6 → 40

Calls

Call 1

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

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

eval4.0ms (0.2%)

Memory: 7.4MiB live, 7.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 606 to 125 computations (79.4% saved)

prune3.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	46	0	46
Fresh	0	0	0
Picked	0	3	3
Done	0	0	0
Total	46	3	49

Accuracy

100.0%

Counts

49 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 61 to 44 computations (27.9% saved)

regimes7.0ms (0.3%)

Memory

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

Counts

4 → 1

Calls

Call 1

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

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

Calls

4 calls:

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

Results

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

Compiler

Compiled 12 to 14 computations (-16.7% saved)

regimes11.0ms (0.5%)

Memory

-36.4MiB live, 10.6MiB allocated; 2ms collecting garbage

Counts

2 → 2

Calls

Call 1

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

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

Calls

4 calls:

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

Results

Accuracy	Segments	Branch
98.6%	2	`(+.f64 x y)`
98.6%	2	`(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (+.f64 x y))`
84.6%	2	`x`
84.3%	2	`y`

Compiler

Compiled 12 to 14 computations (-16.7% saved)

regimes4.0ms (0.2%)

Memory

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

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

1 → 1

Calls

Call 1

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

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

Calls

4 calls:

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

Results

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

Compiler

Compiled 12 to 14 computations (-16.7% saved)

bsearch0.0ms (0%)

Memory

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

Algorithm

1×	left-value

Steps

Time	Left	Right
0.0ms	-1.2648342303630795e-251	3.912752994983455e-268

Compiler

Compiled 10 to 12 computations (-20% saved)

simplify66.0ms (2.8%)

Memory

0.7MiB live, 52.8MiB allocated; 2ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	20	42
1	33	42
2	62	42
3	237	42
4	1199	42
5	4907	42

Stop Event

1×	node limit

Calls

Call 1

Inputs

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

(if (<=.f64 (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (+.f64 x y)) #s(literal -5159126280621731/515912628062173092140956821207535748553561841832149923953086629908861232965551620580485601452790222553392963860602664725471042538576841344971229471155214430574596371092778402508526872730885196340843977449424988675925808879640197010584371971452184059071815020407947264 binary64)) #s(approx (* (/ 1 2) (+ x y)) (*.f64 #s(literal 1/2 binary64) x)) #s(approx (* (/ 1 2) (+ x y)) (*.f64 #s(literal 1/2 binary64) y)))

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

Outputs

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

(if (<=.f64 (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (+.f64 x y)) #s(literal -5159126280621731/515912628062173092140956821207535748553561841832149923953086629908861232965551620580485601452790222553392963860602664725471042538576841344971229471155214430574596371092778402508526872730885196340843977449424988675925808879640197010584371971452184059071815020407947264 binary64)) #s(approx (* (/ 1 2) (+ x y)) (*.f64 #s(literal 1/2 binary64) x)) #s(approx (* (/ 1 2) (+ x y)) (*.f64 #s(literal 1/2 binary64) y)))

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

derivations110.0ms (4.7%)

Memory

-4.3MiB live, 81.7MiB allocated; 8ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 48 to 22 computations (54.2% saved)

preprocess21.0ms (0.9%)

Memory: 45.2MiB live, 45.2MiB allocated; 0ms collecting garbage
Remove: (sort x y)
Compiler: Compiled 130 to 78 computations (40% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample826.0ms (35.6%)

explain89.0ms (3.8%)

preprocess280.0ms (12%)

eval0.0ms (0%)

prune0.0ms (0%)

simplify181.0ms (7.8%)

localize16.0ms (0.7%)

series35.0ms (1.5%)

simplify147.0ms (6.3%)

rewrite40.0ms (1.7%)

eval3.0ms (0.1%)

prune2.0ms (0.1%)

simplify206.0ms (8.9%)

localize25.0ms (1.1%)

series10.0ms (0.4%)

simplify184.0ms (7.9%)

rewrite48.0ms (2.1%)

eval4.0ms (0.2%)

prune3.0ms (0.1%)

regimes7.0ms (0.3%)

regimes11.0ms (0.5%)

regimes4.0ms (0.2%)

bsearch0.0ms (0%)

simplify66.0ms (2.8%)

derivations110.0ms (4.7%)

preprocess21.0ms (0.9%)

end0.0ms (0%)

Profiling