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

start0.0ms (0%)

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

analyze9.0ms (1.3%)

Memory

20.3MiB live, 20.3MiB 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
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)

sample494.0ms (67.5%)

Memory

10.2MiB live, 671.2MiB allocated; 152ms collecting garbage

Samples

304.0ms

8 256×

valid

Precisions

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

ival-div!: 50.0ms (54% of total)

ival-mult!: 42.0ms (45.3% of total)

adjust: 1.0ms (1.1% of total)

Bogosity

preprocess28.0ms (3.9%)

Memory

-38.3MiB live, 8.4MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	14	32
1	32	30
2	56	30
3	82	30
4	111	30
5	127	30

Stop Event

1×

saturated

Alt Table

Click to see full alt table

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

Symmetry

(negabs x)

(negabs y)

Compiler

Compiled 10 to 10 computations (0% saved)

series6.0ms (0.9%)

Memory

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

Counts

5 → 4

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
#s(approx (/ x (* y 3)) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx x #s(hole binary64 x))
#s(approx (* y 3) #s(hole binary64 (* 3 y)))
#s(approx y #s(hole binary64 y))

Calls

6 calls:

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

rewrite20.0ms (2.8%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	15	35
0	16	35
1	26	35
2	57	35
3	127	35
4	153	35
5	156	35
0	156	35

Stop Event

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

Counts

9 → 19

Calls

Call 1

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

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 (neg.f64 x) (*.f64 #s(literal -3 binary64) y))
(/.f64 (/.f64 x y) #s(literal 3 binary64))
(/.f64 x (*.f64 #s(literal 3 binary64) y))
(neg.f64 (/.f64 x (*.f64 #s(literal -3 binary64) y)))
x
(*.f64 #s(literal -3 binary64) (neg.f64 y))
(*.f64 (neg.f64 y) #s(literal -3 binary64))
(*.f64 #s(literal 3 binary64) y)
(*.f64 y #s(literal 3 binary64))
(neg.f64 (*.f64 #s(literal -3 binary64) y))
y
#s(literal 3 binary64)
#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
#s(approx x x)
#s(approx (* y 3) (*.f64 #s(literal 3 binary64) y))
#s(approx y y)

eval1.0ms (0.2%)

Memory: 1.6MiB live, 1.6MiB allocated; 0ms collecting garbage
Compiler: Compiled 50 to 40 computations (20% saved)

prune1.0ms (0.2%)

Memory

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

Pruning

4 alts after pruning (3 fresh and 1 done)

	Pruned	Kept	Total
New	12	3	15
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	12	4	16

Accuracy

100.0%

Counts

16 → 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.7%	(/.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 24 to 24 computations (0% saved)

series5.0ms (0.7%)

Memory

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

Counts

10 → 8

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))
#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 #s(hole binary64 x))
#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))))
#s(approx y #s(hole binary64 y))

Calls

6 calls:

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

rewrite11.0ms (1.5%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	27	100
0	34	100
1	52	100
2	99	100
3	151	100
4	172	100
5	174	100
0	174	100

Stop Event

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

Counts

18 → 44

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))
#s(literal 3 binary64)
(/.f64 (/.f64 x y) #s(literal 3 binary64))
#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 #s(hole binary64 x))
#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))))
#s(approx y #s(hole binary64 y))

Outputs
#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
(*.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 (neg.f64 x) (/.f64 #s(literal -1/3 binary64) y))
(*.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 x y))
(*.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))
x
y
#s(literal 1/3 binary64)
(/.f64 (neg.f64 x) (*.f64 #s(literal -3 binary64) y))
(/.f64 (/.f64 x #s(literal -3 binary64)) (neg.f64 y))
(/.f64 (/.f64 (neg.f64 x) y) #s(literal -3 binary64))
(/.f64 (/.f64 x y) #s(literal 3 binary64))
(/.f64 (/.f64 x #s(literal 3 binary64)) y)
(/.f64 x (*.f64 #s(literal 3 binary64) y))
(neg.f64 (/.f64 x (*.f64 #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)))
#s(literal 3 binary64)
(/.f64 (neg.f64 x) (*.f64 #s(literal -3 binary64) y))
(/.f64 (/.f64 x #s(literal -3 binary64)) (neg.f64 y))
(/.f64 (/.f64 (neg.f64 x) y) #s(literal -3 binary64))
(/.f64 (/.f64 x y) #s(literal 3 binary64))
(/.f64 (/.f64 x #s(literal 3 binary64)) y)
(/.f64 x (*.f64 #s(literal 3 binary64) y))
(neg.f64 (/.f64 x (*.f64 #s(literal -3 binary64) y)))
#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
#s(approx (* (/ x y) 1/3) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
#s(approx (/ x y) (/.f64 x y))
#s(approx x x)
#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
#s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x))
#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
#s(approx y y)

eval19.0ms (2.5%)

Memory: -40.7MiB live, 4.9MiB allocated; 7ms collecting garbage
Compiler: Compiled 123 to 86 computations (30.1% saved)

prune2.0ms (0.3%)

Memory

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

Pruning

4 alts after pruning (1 fresh and 3 done)

	Pruned	Kept	Total
New	30	1	31
Fresh	0	0	0
Picked	1	2	3
Done	0	1	1
Total	31	4	35

Accuracy

100.0%

Counts

35 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	99.7%	(/.f64 (/.f64 x y) #s(literal 3 binary64))
▶	99.6%	(/.f64 #s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x)) y)
✓	99.7%	(/.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 27 to 27 computations (0% saved)

series3.0ms (0.5%)

Memory

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

Counts

6 → 5

Calls

Call 1

Inputs
(/.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 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 x #s(hole binary64 x))
#s(approx y #s(hole binary64 y))

Calls

6 calls:

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

rewrite11.0ms (1.5%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	17	53
0	18	53
1	33	53
2	73	53
3	139	53
4	168	53
5	170	53
0	170	53

Stop Event

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

Counts

11 → 19

Calls

Call 1

Inputs
(/.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
#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 x #s(hole binary64 x))
#s(approx y #s(hole binary64 y))

Outputs
(/.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))
#s(literal 1/3 binary64)
x
y
#s(approx (/ (/ x 3) y) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
#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))))
#s(approx (* 1/3 x) (*.f64 #s(literal 1/3 binary64) x))
#s(approx x x)
#s(approx y y)

eval1.0ms (0.1%)

Memory: 1.2MiB live, 1.2MiB allocated; 0ms collecting garbage
Compiler: Compiled 58 to 44 computations (24.1% saved)

prune2.0ms (0.3%)

Memory

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

Pruning

4 alts after pruning (0 fresh and 4 done)

	Pruned	Kept	Total
New	11	0	11
Fresh	0	0	0
Picked	0	1	1
Done	0	3	3
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.6%	(/.f64 #s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x)) y)
✓	99.7%	(/.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 47 to 46 computations (2.1% saved)

regimes8.0ms (1.1%)

Memory

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

Counts

5 → 1

Calls

Call 1

Inputs
#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 y) #s(literal 3 binary64))

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)

regimes7.0ms (1%)

Memory

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

Counts

4 → 1

Calls

Call 1

Inputs
#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)

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

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)

regimes4.0ms (0.6%)

Memory

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

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)

derivations2.0ms (0.3%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 14 to 13 computations (7.1% saved)

preprocess95.0ms (13%)

Memory

-38.1MiB live, 60.4MiB allocated; 65ms collecting garbage

Remove

(negabs y)

(negabs x)

Compiler

Compiled 95 to 94 computations (1.1% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze9.0ms (1.3%)

sample494.0ms (67.5%)

preprocess28.0ms (3.9%)

series6.0ms (0.9%)

rewrite20.0ms (2.8%)

eval1.0ms (0.2%)

prune1.0ms (0.2%)

series5.0ms (0.7%)

rewrite11.0ms (1.5%)

eval19.0ms (2.5%)

prune2.0ms (0.3%)

series3.0ms (0.5%)

rewrite11.0ms (1.5%)

eval1.0ms (0.1%)

prune2.0ms (0.3%)

regimes8.0ms (1.1%)

regimes7.0ms (1%)

regimes4.0ms (0.6%)

derivations2.0ms (0.3%)

preprocess95.0ms (13%)

end0.0ms (0%)

Profiling