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

start0.0ms (0.0%)

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

analyze0.0ms (0.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%	0.0%	99.9%	0.1%	0.0%	0.0%	0.0%	0
100.0%	99.9%	0.0%	0.1%	0.0%	0.0%	0.0%	1

Compiler

Compiled 7 to 7 computations (0.0% saved)

sample584.0ms (79.1%)

Memory

34.3MiB live, 796.8MiB allocated; 182ms collecting garbage

Samples

407.0ms

8 256×

valid

Precisions

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

ival-mult!: 177.0ms (98.8% of total)

adjust: 2.0ms (1.1% of total)

Bogosity

preprocess34.0ms (4.7%)

Memory

-29.1MiB live, 22.6MiB allocated; 10ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	14	32
1	34	30
2	72	30
3	104	30

Stop Event

1×

saturated

Alt Table

Click to see full alt table

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

Symmetry

(negabs x)

(negabs y)

(sort x y)

Compiler

Compiled 10 to 10 computations (0.0% saved)

sample0.0ms (0.0%)

Memory

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

Calls

Call 1

Inputs
27

Outputs
#s(literal 27 binary64)

Samples

0.0ms

1×

valid

Compiler

Compiled 3 to 3 computations (0.0% saved)

Precisions

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

adjust: 0.0ms (0.0% of total)

series13.0ms (1.8%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	12	24

Stop Event

1×	iter-limit

Counts

5 → 4

Calls

Call 1

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

Outputs
#s(approx (* (* x 27) y) (.f64 #s(literal 27 binary64) (.f64 x y)))
#s(approx (* x 27) (*.f64 #s(literal 27 binary64) x))
#s(approx x x)
#s(approx y y)

Calls

6 calls:

Time	Variable	Point
1.0ms	y	inf
1.0ms	x	inf
1.0ms	x	0
1.0ms	x	-inf
1.0ms	y	-inf

rewrite24.0ms (3.2%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	11
0	7	11
1	11	11
2	18	11
3	20	11
0	20	11

Stop Event

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

Counts

5 → 11

Calls

Call 1

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

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

eval1.0ms (0.2%)

Memory: 3.7MiB live, 3.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 69 to 26 computations (62.3% saved)

prune1.0ms (0.2%)

Memory

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

Pruning

3 alts after pruning (2 fresh and 1 done)

	Pruned	Kept	Total
New	9	2	11
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	9	3	12

Accuracy

99.9%

Counts

12 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	99.7%	(.f64 (.f64 y x) #s(literal 27 binary64))
▶	99.7%	(.f64 (.f64 y #s(literal 27 binary64)) x)
✓	99.7%	(.f64 (.f64 x #s(literal 27 binary64)) y)

Compiler

Compiled 15 to 15 computations (0.0% saved)

sample0.0ms (0.0%)

Memory

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

Calls

Call 1

Inputs
27

Outputs
#s(literal 27 binary64)

Samples

0.0ms

1×

valid

Compiler

Compiled 3 to 3 computations (0.0% saved)

Precisions

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

adjust: 0.0ms (0.0% of total)

series6.0ms (0.8%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	14	31

Stop Event

1×	iter-limit

Counts

7 → 5

Calls

Call 1

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

Outputs
#s(approx (* (* y 27) x) (.f64 #s(literal 27 binary64) (.f64 x y)))
#s(approx x x)
#s(approx (* y x) (*.f64 x y))
#s(approx (* y 27) (*.f64 #s(literal 27 binary64) y))
#s(approx y y)

Calls

6 calls:

Time	Variable	Point
1.0ms	y	-inf
1.0ms	x	-inf
1.0ms	y	inf
0.0ms	x	inf
0.0ms	y	0

rewrite11.0ms (1.4%)

Memory

-30.1MiB live, 15.5MiB allocated; 5ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	19
0	11	19
1	19	19
2	21	19
0	21	19

Stop Event

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

Counts

7 → 19

Calls

Call 1

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

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

eval1.0ms (0.2%)

Memory: 3.6MiB live, 3.6MiB allocated; 0ms collecting garbage
Compiler: Compiled 92 to 30 computations (67.4% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	14	0	14
Fresh	0	0	0
Picked	0	2	2
Done	0	1	1
Total	14	3	17

Accuracy

99.9%

Counts

17 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	99.7%	(.f64 (.f64 y x) #s(literal 27 binary64))
✓	99.7%	(.f64 (.f64 y #s(literal 27 binary64)) x)
✓	99.7%	(.f64 (.f64 x #s(literal 27 binary64)) y)

Compiler

Compiled 15 to 15 computations (0.0% saved)

regimes18.0ms (2.4%)

Memory

-0.1MiB live, 46.1MiB allocated; 3ms collecting garbage

Counts

2 → 1

3 → 1

Calls

Call 1

Inputs
(.f64 (.f64 x #s(literal 27 binary64)) y)
(.f64 (.f64 y #s(literal 27 binary64)) x)

Outputs
(.f64 (.f64 x #s(literal 27 binary64)) y)

Call 2

Inputs
(.f64 (.f64 x #s(literal 27 binary64)) y)
(.f64 (.f64 y #s(literal 27 binary64)) x)
(.f64 (.f64 y x) #s(literal 27 binary64))

Outputs
(.f64 (.f64 y x) #s(literal 27 binary64))

Calls

8 calls:

4.0ms	x
2.0ms	(*.f64 x #s(literal 27 binary64))
2.0ms	(.f64 (.f64 x #s(literal 27 binary64)) y)
2.0ms	y
2.0ms	x

Results

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

Compiler

Compiled 35 to 35 computations (0.0% saved)

derivations1.0ms (0.1%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 10 to 7 computations (30.0% saved)

preprocess41.0ms (5.6%)

Memory

1.9MiB live, 58.2MiB allocated; 38ms collecting garbage

Symmetry

(negabs x)

(negabs y)

(sort x y)

Compiler

Compiled 91 to 81 computations (11.0% saved)

end0.0ms (0.0%)

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

start0.0ms (0.0%)

analyze0.0ms (0.0%)

sample584.0ms (79.1%)

preprocess34.0ms (4.7%)

sample0.0ms (0.0%)

series13.0ms (1.8%)

rewrite24.0ms (3.2%)

eval1.0ms (0.2%)

prune1.0ms (0.2%)

sample0.0ms (0.0%)

series6.0ms (0.8%)

rewrite11.0ms (1.4%)

eval1.0ms (0.2%)

prune2.0ms (0.2%)

regimes18.0ms (2.4%)

derivations1.0ms (0.1%)

preprocess41.0ms (5.6%)

end0.0ms (0.0%)

Profiling