Diagrams.Solve.Polynomial:quadForm from diagrams-solve-0.1, C

Time bar (total: 670.0ms)

start0.0ms (0%)

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

analyze10.0ms (1.5%)

Memory
20.9MiB live, 20.9MiB allocated; 0ms collecting garbage
Algorithm
1×search
Search
ProbabilityValidUnknownPreconditionInfiniteDomainCan'tIter
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)

sample446.0ms (66.6%)

Memory
27.9MiB live, 790.4MiB allocated; 74ms collecting garbage
Samples
262.0ms8 256×0valid
Precisions
Click to see histograms. Total time spent on operations: 108.0ms
ival-div!: 63.0ms (58.2% of total)
ival-mult!: 44.0ms (40.7% of total)
adjust: 1.0ms (0.9% of total)
Bogosity

explain43.0ms (6.4%)

Memory
-13.2MiB live, 80.5MiB allocated; 6ms collecting garbage
FPErrors
Click to see full error table
Ground TruthOverpredictionsExampleUnderpredictionsExampleSubexpression
00-0-y
00-0-#s(literal 2 binary64)
00-0-(/.f64 x (*.f64 y #s(literal 2 binary64)))
00-0-x
00-0-(*.f64 y #s(literal 2 binary64))
Confusion
Predicted +Predicted -
+00
-0256
Precision
0/0
Recall
0/0
Confusion?
Predicted +Predicted MaybePredicted -
+000
-00256
Precision?
0/0
Recall?
0/0
Freqs
test
numberfreq
0256
Total Confusion?
Predicted +Predicted MaybePredicted -
+000
-001
Precision?
0/0
Recall?
0/0
Samples
17.0ms512×0valid
Compiler

Compiled 31 to 19 computations (38.7% saved)

Precisions
Click to see histograms. Total time spent on operations: 6.0ms
ival-mult!: 3.0ms (53.8% of total)
ival-div!: 3.0ms (53.8% of total)
adjust: 0.0ms (0% of total)

preprocess85.0ms (12.7%)

Memory
-25.0MiB live, 25.6MiB allocated; 4ms collecting garbage
Iterations

Useful iterations: 1 (0.0ms)

IterNodesCost
01432
13430
27630
316430
438530
5157830
6640630
Stop Event
1×node-limit
Alt Table
Click to see full alt table
StatusAccuracyProgram
▶100.0%
(/.f64 x (*.f64 y #s(literal 2 binary64)))
Symmetry

(negabs x)

(negabs y)

Compiler

Compiled 10 to 10 computations (0% saved)

rewrite31.0ms (4.7%)

Memory
8.8MiB live, 55.8MiB allocated; 3ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0511
0711
11511
05011
Stop Event
1×iter-limit
1×iter-limit
1×iter-limit
1×unsound
1×iter-limit
Counts
5 → 18
Calls
Call 1
Inputs
(/.f64 x (*.f64 y #s(literal 2 binary64)))
x
(*.f64 y #s(literal 2 binary64))
y
#s(literal 2 binary64)
Outputs
(/.f64 (/.f64 x #s(literal 2 binary64)) y)
(/.f64 (neg.f64 (/.f64 x y)) #s(literal -2 binary64))
(/.f64 (neg.f64 (neg.f64 x)) (neg.f64 (*.f64 #s(literal -2 binary64) y)))
(/.f64 (/.f64 x y) #s(literal 2 binary64))
(/.f64 (neg.f64 x) (*.f64 #s(literal -2 binary64) y))
(/.f64 x (*.f64 #s(literal 2 binary64) y))
(neg.f64 (/.f64 (neg.f64 x) (*.f64 #s(literal 2 binary64) y)))
(neg.f64 (/.f64 x (*.f64 #s(literal -2 binary64) y)))
x
(*.f64 #s(literal 2 binary64) y)
(*.f64 y #s(literal 2 binary64))
(fma.f64 #s(literal 1 binary64) y (*.f64 #s(literal 1 binary64) y))
(fma.f64 y #s(literal 1 binary64) (*.f64 y #s(literal 1 binary64)))
(+.f64 (*.f64 #s(literal 1 binary64) y) (*.f64 #s(literal 1 binary64) y))
(+.f64 (*.f64 y #s(literal 1 binary64)) (*.f64 y #s(literal 1 binary64)))
(+.f64 y y)
y
#s(literal 2 binary64)

eval1.0ms (0.2%)

Memory
3.1MiB live, 3.1MiB allocated; 0ms collecting garbage
Compiler

Compiled 92 to 35 computations (62% saved)

prune1.0ms (0.1%)

Memory
1.8MiB live, 1.8MiB allocated; 0ms collecting garbage
Pruning

1 alts after pruning (1 fresh and 0 done)

PrunedKeptTotal
New13114
Fresh000
Picked101
Done000
Total14115
Accuracy
100.0%
Counts
15 → 1
Alt Table
Click to see full alt table
StatusAccuracyProgram
▶100.0%
(/.f64 x (+.f64 y y))
Compiler

Compiled 5 to 4 computations (20% saved)

rewrite25.0ms (3.7%)

Memory
-11.2MiB live, 36.2MiB allocated; 1ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0410
0610
12010
012010
Stop Event
1×iter-limit
1×iter-limit
1×iter-limit
1×unsound
1×iter-limit
Counts
4 → 23
Calls
Call 1
Inputs
(/.f64 x (+.f64 y y))
x
(+.f64 y y)
y
Outputs
(*.f64 (/.f64 x #s(literal 0 binary64)) #s(literal 0 binary64))
(*.f64 (/.f64 x (*.f64 #s(literal 2 binary64) (pow.f64 y #s(literal 3 binary64)))) (fma.f64 y y #s(literal 0 binary64)))
(/.f64 (/.f64 x #s(literal 2 binary64)) y)
(/.f64 (neg.f64 (neg.f64 x)) (*.f64 #s(literal -2 binary64) y))
(/.f64 (neg.f64 x) (*.f64 #s(literal -2 binary64) y))
(/.f64 x (*.f64 #s(literal -2 binary64) y))
(neg.f64 (/.f64 x (*.f64 #s(literal -2 binary64) y)))
x
(*.f64 #s(literal -2 binary64) y)
(*.f64 #s(literal 2 binary64) (neg.f64 y))
(*.f64 #s(literal 2 binary64) y)
(*.f64 y #s(literal 2 binary64))
(/.f64 (neg.f64 (*.f64 #s(literal 2 binary64) (pow.f64 y #s(literal 3 binary64)))) (neg.f64 (fma.f64 y y #s(literal 0 binary64))))
(/.f64 (neg.f64 (*.f64 #s(literal 2 binary64) (pow.f64 y #s(literal 3 binary64)))) (fma.f64 y y #s(literal 0 binary64)))
(/.f64 #s(literal 0 binary64) #s(literal 0 binary64))
(/.f64 (*.f64 #s(literal 2 binary64) (pow.f64 y #s(literal 3 binary64))) (neg.f64 (fma.f64 y y #s(literal 0 binary64))))
(/.f64 (*.f64 #s(literal 2 binary64) (pow.f64 y #s(literal 3 binary64))) (fma.f64 y y #s(literal 0 binary64)))
(neg.f64 (*.f64 #s(literal -2 binary64) y))
(-.f64 (/.f64 (*.f64 y y) #s(literal 0 binary64)) (/.f64 (*.f64 y y) #s(literal 0 binary64)))
(+.f64 (/.f64 (pow.f64 y #s(literal 3 binary64)) (fma.f64 y y #s(literal 0 binary64))) (/.f64 (pow.f64 y #s(literal 3 binary64)) (fma.f64 y y #s(literal 0 binary64))))
(+.f64 (neg.f64 y) (neg.f64 y))
(+.f64 y y)
y

eval2.0ms (0.2%)

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

Compiled 169 to 52 computations (69.2% saved)

prune1.0ms (0.2%)

Memory
3.4MiB live, 3.4MiB allocated; 0ms collecting garbage
Pruning

1 alts after pruning (0 fresh and 1 done)

PrunedKeptTotal
New20020
Fresh000
Picked011
Done000
Total20121
Accuracy
100.0%
Counts
21 → 1
Alt Table
Click to see full alt table
StatusAccuracyProgram
✓100.0%
(/.f64 x (+.f64 y y))
Compiler

Compiled 15 to 11 computations (26.7% saved)

regimes5.0ms (0.7%)

Memory
16.8MiB live, 16.8MiB allocated; 0ms collecting garbage
Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts
2 → 1
Calls
Call 1
Inputs
(/.f64 x (+.f64 y y))
(/.f64 x (*.f64 y #s(literal 2 binary64)))
Outputs
(/.f64 x (+.f64 y y))
Calls

4 calls:

1.0ms
y
1.0ms
(*.f64 y #s(literal 2 binary64))
1.0ms
x
1.0ms
(/.f64 x (*.f64 y #s(literal 2 binary64)))
Results
AccuracySegmentsBranch
100.0%1(*.f64 y #s(literal 2 binary64))
100.0%1(/.f64 x (*.f64 y #s(literal 2 binary64)))
100.0%1x
100.0%1y
Compiler

Compiled 10 to 13 computations (-30% saved)

derivations1.0ms (0.2%)

Memory
2.5MiB live, 2.5MiB allocated; 0ms collecting garbage
Stop Event
1×done
Compiler

Compiled 5 to 4 computations (20% saved)

preprocess20.0ms (2.9%)

Memory
1.7MiB live, 43.9MiB allocated; 7ms collecting garbage
Remove

(negabs y)

(negabs x)

Compiler

Compiled 40 to 34 computations (15% saved)

end0.0ms (0%)

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

Profiling

Loading profile data...