knuth_bendix_egraph/log9.txt at v4 · NeuralCoder3/knuth_bendix_egraph · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
  0: Zero (Zero())
  1: A (A())
  2: Div(Zero, A) (Div(0, 1))
Symbol counts:
  A: 0 (0)
  MinusOne: 1 (0)
  Zero: 2 (0)
  Pow: 1 (2)
  Div: 1 (2)
  Mul: 4 (2)
Final precedence:
  A: 0
  MinusOne: 1
  Zero: 2
  Pow: 3
  Div: 4
  Mul: 5
Rules:
{ Mul(a, Pow(b, MinusOne)) -> Div(a, b)
  Mul(a, Zero) -> Zero }
Equations:
{ Mul(a, b) = Mul(b, a) }
Original:
Div(Zero, A)
Result:
Div(Zero, A)


Iteration 0
DAG:
  0: Zero (Zero())
  1: A (A())
  2: Div(Zero, A) (Div(0, 1))
Simplify DAG.
Apply R-rules
DBG2: Apply rules "Mul(a, Pow(b, MinusOne))" -> "Div(a, b)"
DBG2: Check Id 2
DBG2: Check Id 1
DBG2: Check Id 0
DBG2: Apply rules "Mul(a, Zero)" -> "Zero"
DBG2: Check Id 2
DBG2: Check Id 1
DBG2: Check Id 0
Apply E-rules
DBG2: Apply rules "Mul(a, b)" -> "Mul(b, a)"
DBG2: Check Id 2
DBG2: Check Id 1
DBG2: Check Id 0
DBG2: Apply rules "Mul(b, a)" -> "Mul(a, b)"
DBG2: Check Id 2
DBG2: Check Id 1
DBG2: Check Id 0
New rules:
{ }
DBG: Critical pair: Mul(a, Pow(b, MinusOne)) -> Div(a, b) with Mul(a, Pow(b, MinusOne)) -> Div(a, b)
DBG:   OrgCritical pair: Div(a_1, b_1) = Div(a_1, b_1)
DBG:   OrgCritical pair: Div(a, b) = Div(a, b)
DBG: Critical pair: Mul(a, Pow(b, MinusOne)) -> Div(a, b) with Mul(a, Zero) -> Zero
DBG: Critical pair: Mul(a, Zero) -> Zero with Mul(a, Zero) -> Zero
DBG:   OrgCritical pair: Zero = Zero
Computed 0 critical pairs
Top 5 critical pairs:
Rules before KBC:
{ Mul(a, Pow(b, MinusOne)) -> Div(a, b)
  Mul(a, Zero) -> Zero }
Intermediate State:
Rules:
{ Mul(a, Pow(b, MinusOne)) -> Div(a, b)
  Mul(a, Zero) -> Zero }
Equations:
{ Mul(a, b) = Mul(b, a) }
Original:
Div(Zero, A)
Result:
Div(Zero, A)
Extracted term:
Div(Zero, A)


Iteration 1
DAG:
  0: Zero (Zero())
  1: A (A())
  2: Div(Zero, A) (Div(0, 1))
Simplify DAG.
Apply R-rules
DBG2: Apply rules "Mul(a, Pow(b, MinusOne))" -> "Div(a, b)"
DBG2: Check Id 2
DBG2: Check Id 1
DBG2: Check Id 0
DBG2: Apply rules "Mul(a, Zero)" -> "Zero"
DBG2: Check Id 2
DBG2: Check Id 1
DBG2: Check Id 0
Apply E-rules
DBG2: Apply rules "Mul(a, b)" -> "Mul(b, a)"
DBG2: Check Id 2
DBG2: Check Id 1
DBG2: Check Id 0
DBG2: Apply rules "Mul(b, a)" -> "Mul(a, b)"
DBG2: Check Id 2
DBG2: Check Id 1
DBG2: Check Id 0
New rules:
{ }
DBG: Critical pair: Mul(a, Pow(b, MinusOne)) -> Div(a, b) with Mul(a, Pow(b, MinusOne)) -> Div(a, b)
DBG:   OrgCritical pair: Div(a_1, b_1) = Div(a_1, b_1)
DBG:   OrgCritical pair: Div(a, b) = Div(a, b)
DBG: Critical pair: Mul(a, Pow(b, MinusOne)) -> Div(a, b) with Mul(a, Zero) -> Zero
DBG: Critical pair: Mul(a, Zero) -> Zero with Mul(a, Zero) -> Zero
DBG:   OrgCritical pair: Zero = Zero
Computed 0 critical pairs
Top 5 critical pairs:
Rules before KBC:
{ Mul(a, Pow(b, MinusOne)) -> Div(a, b)
  Mul(a, Zero) -> Zero }
Intermediate State:
Rules:
{ Mul(a, Pow(b, MinusOne)) -> Div(a, b)
  Mul(a, Zero) -> Zero }
Equations:
{ Mul(a, b) = Mul(b, a) }
Original:
Div(Zero, A)
Result:
Div(Zero, A)
Extracted term:
Div(Zero, A)