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

Time bar (total: 888.0ms)

start0.0ms (0%)

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

analyze10.0ms (1.2%)

Memory
16.4MiB live, 16.4MiB allocated; 0ms collecting garbage
Algorithm
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)

sample638.0ms (71.8%)

Memory
-13.4MiB live, 619.8MiB allocated; 126ms collecting garbage
Samples
450.0ms8 256×0valid
Precisions
Click to see histograms. Total time spent on operations: 220.0ms
ival-mult!: 170.0ms (77.3% of total)
ival-div!: 48.0ms (21.8% of total)
adjust: 1.0ms (0.5% of total)
Bogosity

explain49.0ms (5.6%)

Memory
17.0MiB live, 60.4MiB allocated; 8ms 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.5% of total)
ival-div!: 3.0ms (53.5% of total)
adjust: 0.0ms (0% of total)

preprocess120.0ms (13.5%)

Memory
-27.5MiB live, 64.9MiB allocated; 22ms collecting garbage
Iterations

Useful iterations: 1 (0.0ms)

IterNodesCost
01432
13430
27630
316330
438330
5157730
6639930
Stop Event
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)

series6.0ms (0.7%)

Memory
19.5MiB live, 19.5MiB allocated; 0ms collecting garbage
Counts
5 → 4
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
#s(approx (/ x (* y 2)) #s(hole binary64 (* 1/2 (/ x y))))
#s(approx x #s(hole binary64 x))
#s(approx (* y 2) #s(hole binary64 (* 2 y)))
#s(approx y #s(hole binary64 y))
Calls

6 calls:

TimeVariablePointExpression
2.0ms
y
@inf
((/ x (* y 2)) x (* y 2) y 2)
1.0ms
x
@-inf
((/ x (* y 2)) x (* y 2) y 2)
1.0ms
x
@inf
((/ x (* y 2)) x (* y 2) y 2)
1.0ms
y
@-inf
((/ x (* y 2)) x (* y 2) y 2)
1.0ms
y
@0
((/ x (* y 2)) x (* y 2) y 2)

rewrite37.0ms (4.1%)

Memory
-1.8MiB live, 86.6MiB allocated; 11ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01535
01635
12935
08435
Stop Event
iter-limit
iter-limit
iter-limit
unsound
iter-limit
Counts
9 → 24
Calls
Call 1
Inputs
(/.f64 x (*.f64 y #s(literal 2 binary64)))
x
(*.f64 y #s(literal 2 binary64))
y
#s(literal 2 binary64)
#s(approx (/ x (* y 2)) #s(hole binary64 (* 1/2 (/ x y))))
#s(approx x #s(hole binary64 x))
#s(approx (* y 2) #s(hole binary64 (* 2 y)))
#s(approx y #s(hole binary64 y))
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 (neg.f64 x) (*.f64 #s(literal -2 binary64) y))
(/.f64 (/.f64 x y) #s(literal 2 binary64))
(/.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))
(/.f64 (-.f64 (*.f64 y y) (*.f64 y y)) (-.f64 y y))
(/.f64 (+.f64 (pow.f64 y #s(literal 3 binary64)) (pow.f64 y #s(literal 3 binary64))) (fma.f64 y y (-.f64 (*.f64 y y) (*.f64 y y))))
(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)
#s(approx (/ x (* y 2)) (*.f64 (/.f64 x y) #s(literal 1/2 binary64)))
#s(approx x x)
#s(approx (* y 2) (*.f64 #s(literal 2 binary64) y))
#s(approx y y)

eval2.0ms (0.2%)

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

Compiled 154 to 60 computations (61% saved)

prune1.0ms (0.1%)

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

1 alts after pruning (0 fresh and 1 done)

PrunedKeptTotal
New19019
Fresh000
Picked011
Done000
Total19120
Accuracy
100.0%
Counts
20 → 1
Alt Table
Click to see full alt table
StatusAccuracyProgram
100.0%
(/.f64 x (*.f64 y #s(literal 2 binary64)))
Compiler

Compiled 10 to 10 computations (0% saved)

derivations0.0ms (0%)

Memory
0.5MiB live, 0.5MiB allocated; 0ms collecting garbage
Stop Event
done
Compiler

Compiled 5 to 5 computations (0% saved)

preprocess25.0ms (2.9%)

Memory
-5.4MiB live, 53.5MiB allocated; 7ms collecting garbage
Remove

(negabs y)

(negabs x)

Compiler

Compiled 40 to 40 computations (0% saved)

end0.0ms (0%)

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

Profiling

Loading profile data...