ABCDEFGHIJKLMNOPQRSTUVWXYZAAABACADAEAFAGAH
1
Totals ==>13526912000784030500001180
2
Ok?BPBSIBSQCyGEUTSUBUIFIGIPfxOI
LenX
SeqX
LastWUWFSGRV
Scope
AnswerExplanationIDFormulaExpected
3
1G(Red =>!X(Green))
R_3zr1TPsbL8Fh01g
whenever r, cannot be next with g
G(r => !X(g))
4
1G(Red => !X(Green))
R_7t8OynItMvsY3qS
whenever r, cannot be next with g
G(r => !X(g))
5
1G(Red => !X(Green))
R_5pl5ovreUYilD5z
whenever r, cannot be next with g
G(r => !X(g))
6
1G (Red => !X Green)
R_6ffI4bTyX5zoEHh
whenever r, cannot be next with g
G(r => !X(g))
7
1G(Red => !X(Green))
R_4mVF8KOBt6MErhn
whenever r, cannot be next with g
G(r => !X(g))
8
1G(Red => !X(Green))
R_2pKyoW6gWKFoQnZ
whenever r, cannot be next with g
G(r => !X(g))
9
1G(Red => !X(Green))
R_1kn76aEhDPLve1a
whenever r, cannot be next with g
G(r => !X(g))
10
1G (Red => !X (Green))
R_5PdIR5FnMDzrVUu
whenever r, cannot be next with g
G(r => !X(g))
11
1G (Red => !X(Green))
R_3p46SBAhKNhlNvS
whenever r, cannot be next with g
G(r => !X(g))
12
1G(Red => G(X(!Green)))
R_47BVZHw0XbaticF
whenever r, cannot be next with g
G(r => !X(g))
13
1G(Red => !X(Green))
R_51nrC3cVmGQGCbZ
whenever r, cannot be next with g
G(r => !X(g))
14
1G ( Red => ! ( X ( Green ) ) )
R_2rjQI459Ka4U504
whenever r, cannot be next with g
G(r => !X(g))
15
1G(Red => !X(Green))
R_10WMbhmzVMMfCQ9
whenever r, cannot be next with g
G(r => !X(g))
16
1G(Red => X(!Green))
R_3p2LrOwAHaKfYYG
whenever r, cannot be next with g
G(r => !X(g))
17
1G(Red => !X(Green))
R_2EPSIkVcvTwusZ1
whenever r, cannot be next with g
G(r => !X(g))
18
1G(Red => !X(Green))
R_6ZBMLj5oxGtGYyV
whenever r, cannot be next with g
G(r => !X(g))
19
1G(Red => !X(Green))
R_7gRsvfLpsHGFun8
whenever r, cannot be next with g
G(r => !X(g))
20
1G(Red => X!green)
R_2wQrFCdtVBTz165
whenever r, cannot be next with g
G(r => !X(g))
21
1F(Blue & X(F(Blue)))
R_3zr1TPsbL8Fh01g
There are at least two states in which the Blue light is on
F(b & X(F(b)))
22
1F (Blue & X (F(Blue))
R_7t8OynItMvsY3qS
There are at least two states in which the Blue light is on
F(b & X(F(b)))
23
1F(Blue && X(F(Blue)))
R_5pl5ovreUYilD5z
There are at least two states in which the Blue light is on
F(b & X(F(b)))
24
1F (blue & X (F blue))
R_6ffI4bTyX5zoEHh
There are at least two states in which the Blue light is on
F(b & X(F(b)))
25
extra =>, ok1!Blue U (Blue && (Blue => X F Blue))
R_4mVF8KOBt6MErhn
There are at least two states in which the Blue light is on
F(b & X(F(b)))
26
1F(Blue && XF(Blue))
R_2pKyoW6gWKFoQnZ
There are at least two states in which the Blue light is on
F(b & X(F(b)))
27
1F(Blue && X(F(Blue)))
R_1kn76aEhDPLve1a
There are at least two states in which the Blue light is on
F(b & X(F(b)))
28
1F (Blue & X (F Blue))
R_5PdIR5FnMDzrVUu
There are at least two states in which the Blue light is on
F(b & X(F(b)))
29
1F (Blue & X(F Blue))
R_3p46SBAhKNhlNvS
There are at least two states in which the Blue light is on
F(b & X(F(b)))
30
1F(Blue & F(Blue))
R_47BVZHw0XbaticF
There are at least two states in which the Blue light is on
F(b & X(F(b)))
31
1F(Blue & X(F(Blue)))
R_51nrC3cVmGQGCbZ
There are at least two states in which the Blue light is on
F(b & X(F(b)))
32
1F ( Blue & F ( Blue ) )
R_2rjQI459Ka4U504
There are at least two states in which the Blue light is on
F(b & X(F(b)))
33
1F(Blue && F(Blue))
R_10WMbhmzVMMfCQ9
There are at least two states in which the Blue light is on
F(b & X(F(b)))
34
1F(Blue && F(Blue))
R_3p2LrOwAHaKfYYG
There are at least two states in which the Blue light is on
F(b & X(F(b)))
35
1F(Blue & X(F(Blue))
R_2EPSIkVcvTwusZ1
There are at least two states in which the Blue light is on
F(b & X(F(b)))
36
1Blue && F(Blue)
R_6ZBMLj5oxGtGYyV
There are at least two states in which the Blue light is on
F(b & X(F(b)))
37
1F(Blue & X(F(Blue))
R_7gRsvfLpsHGFun8
There are at least two states in which the Blue light is on
F(b & X(F(b)))
38
1F(Blue && (X Blue))
R_2wQrFCdtVBTz165
There are at least two states in which the Blue light is on
F(b & X(F(b)))
39
1not expressible
R_3zr1TPsbL8Fh01g
Green is on in the final state.
inexpressible
40
1inexpressible
R_7t8OynItMvsY3qS
Green is on in the final state.
inexpressible
41
1inexpressible
R_5pl5ovreUYilD5z
Green is on in the final state.
inexpressible
42
1Green
R_6ffI4bTyX5zoEHh
Green is on in the final state.
inexpressible
43
1
cannot be satisfied as it requires a finite trace, so 'false'.
R_4mVF8KOBt6MErhn
Green is on in the final state.
inexpressible
44
1inexpressible
R_2pKyoW6gWKFoQnZ
Green is on in the final state.
inexpressible
45
1Inexpressible
R_1kn76aEhDPLve1a
Green is on in the final state.
inexpressible
46
1inexpressible
R_5PdIR5FnMDzrVUu
Green is on in the final state.
inexpressible
47
1F (Green & Xw(False))
R_3p46SBAhKNhlNvS
Green is on in the final state.
inexpressible
48
1Inexpressible (infinite traces so no final state)
R_47BVZHw0XbaticF
Green is on in the final state.
inexpressible
49
1This does not make sense for infinite traces.
R_51nrC3cVmGQGCbZ
Green is on in the final state.
inexpressible
50
1
inexpressible - LTL works with infinite traces only, so no final state exists.
R_2rjQI459Ka4U504
Green is on in the final state.
inexpressible
51
1inexpressible
R_10WMbhmzVMMfCQ9
Green is on in the final state.
inexpressible
52
1inexpressible
R_3p2LrOwAHaKfYYG
Green is on in the final state.
inexpressible
53
1F(G(Green))
R_2EPSIkVcvTwusZ1
Green is on in the final state.
inexpressible
54
1F(G(Green))
R_6ZBMLj5oxGtGYyV
Green is on in the final state.
inexpressible
55
1F(G(Green))
R_7gRsvfLpsHGFun8
Green is on in the final state.
inexpressible
56
1Inexpressible
R_2wQrFCdtVBTz165
Green is on in the final state.
inexpressible
57
1
Blue & X(!Blue) & G(Blue => X(!Blue)) & G(!Blue => X(Blue))
R_3zr1TPsbL8Fh01g
Blue on in 1, off in 2, alts evermore
b & G(b => X(!b & X(b)))
58
1Blue & G(Blue => X (!Blue) & X(X(Blue)))
R_7t8OynItMvsY3qS
Blue on in 1, off in 2, alts evermore
b & G(b => X(!b & X(b)))
59
1Blue && G(Blue => (X(!Blue) & XX(Blue)))
R_5pl5ovreUYilD5z
Blue on in 1, off in 2, alts evermore
b & G(b => X(!b & X(b)))
60
1Blue && G (Blue => X !Blue && XX Blue)
R_6ffI4bTyX5zoEHh
Blue on in 1, off in 2, alts evermore
b & G(b => X(!b & X(b)))
61
1Blue && G(Blue => (X(!Blue) && XX(Blue)))
R_4mVF8KOBt6MErhn
Blue on in 1, off in 2, alts evermore
b & G(b => X(!b & X(b)))
62
1
Blue && X(!Blue) && G(Blue => X(!Blue)) && G(!Blue => X(Blue))
R_2pKyoW6gWKFoQnZ
Blue on in 1, off in 2, alts evermore
b & G(b => X(!b & X(b)))
63
1Blue && G(Blue => X(!Blue) && X(X(Blue)))
R_1kn76aEhDPLve1a
Blue on in 1, off in 2, alts evermore
b & G(b => X(!b & X(b)))
64
1
Blue & X (!Blue) & X (X G (Blue => X (!Blue) || !Blue => X Blue))
R_5PdIR5FnMDzrVUu
Blue on in 1, off in 2, alts evermore
b & G(b => X(!b & X(b)))
65
1G ((Blue => X (!Blue)) & ((!Blue) => X Blue)) & Blue
R_3p46SBAhKNhlNvS
Blue on in 1, off in 2, alts evermore
b & G(b => X(!b & X(b)))
66
1G(Blue => X(!Blue) & X(X(Blue))) & Blue
R_47BVZHw0XbaticF
Blue on in 1, off in 2, alts evermore
b & G(b => X(!b & X(b)))
67
1Blue & G(Blue => X(!Blue & X(blue)))
R_51nrC3cVmGQGCbZ
Blue on in 1, off in 2, alts evermore
b & G(b => X(!b & X(b)))
68
11
Blue & ( X (!Blue) ) & ( X ( G ( Blue & ( X (!Blue) ) ) ) )
R_2rjQI459Ka4U504
Blue on in 1, off in 2, alts evermore
b & G(b => X(!b & X(b)))
69
1Blue && G(Blue => X(!Blue) && X(X(Blue)))
R_10WMbhmzVMMfCQ9
Blue on in 1, off in 2, alts evermore
b & G(b => X(!b & X(b)))
70
1Blue && G(Blue =>X(!Blue) && XX(Blue))
R_3p2LrOwAHaKfYYG
Blue on in 1, off in 2, alts evermore
b & G(b => X(!b & X(b)))
71
1G(Blue => X(!Blue & X(Blue)) & Blue
R_2EPSIkVcvTwusZ1
Blue on in 1, off in 2, alts evermore
b & G(b => X(!b & X(b)))
72
1Blue && G(Blue => X(!Blue)) && G(!Blue => X(Blue))
R_6ZBMLj5oxGtGYyV
Blue on in 1, off in 2, alts evermore
b & G(b => X(!b & X(b)))
73
1Blue & G(Blue => X(!Blue) & !Blue => X(Blue))
R_7gRsvfLpsHGFun8
Blue on in 1, off in 2, alts evermore
b & G(b => X(!b & X(b)))
74
1
Blue && X!Blue && XX(G(Blue =>X !Blue && XX Blue))
R_2wQrFCdtVBTz165
Blue on in 1, off in 2, alts evermore
b & G(b => X(!b & X(b)))
75
1!Red U (Red & X(G(!Red)))
R_3zr1TPsbL8Fh01g
Red is on exactly once.
!r U (r & G(!X(r)))
76
1!Red U (Red & X(G(!Red)))
R_7t8OynItMvsY3qS
Red is on exactly once.
!r U (r & G(!X(r)))
77
1F(Red) & G(Red => X(G(!Red)))
R_5pl5ovreUYilD5z
Red is on exactly once.
!r U (r & G(!X(r)))
78
1!Red U (Red && X G !Red)
R_6ffI4bTyX5zoEHh
Red is on exactly once.
!r U (r & G(!X(r)))
79
1(F Red) && G(Red => X(G(!Red)))
R_4mVF8KOBt6MErhn
Red is on exactly once.
!r U (r & G(!X(r)))
80
1F(Red) && G(Red => XG(!Red))
R_2pKyoW6gWKFoQnZ
Red is on exactly once.
!r U (r & G(!X(r)))
81
1F(Red) && G(Red => X(G(!Red)))
R_1kn76aEhDPLve1a
Red is on exactly once.
!r U (r & G(!X(r)))
82
1!Red U (Red & X (G (!Red)))
R_5PdIR5FnMDzrVUu
Red is on exactly once.
!r U (r & G(!X(r)))
83
1(F Red) & (G (!Red))
R_3p46SBAhKNhlNvS
Red is on exactly once.
!r U (r & G(!X(r)))
84
1!Red U (Red & X(G(!Red)))
R_47BVZHw0XbaticF
Red is on exactly once.
!r U (r & G(!X(r)))
85
1F(Red) & G(Red => X(G(!Red)))
R_51nrC3cVmGQGCbZ
Red is on exactly once.
!r U (r & G(!X(r)))
86
1!Red U ( Red & ( X (G ( !Red ) ) ) )
R_2rjQI459Ka4U504
Red is on exactly once.
!r U (r & G(!X(r)))
87
TODO what code? standardize al 3 sheets
1F(Red && X(G(!Red)))
R_10WMbhmzVMMfCQ9
Red is on exactly once.
!r U (r & G(!X(r)))
88
1Red && X(G(!Red))
R_3p2LrOwAHaKfYYG
Red is on exactly once.
!r U (r & G(!X(r)))
89
TODO1F(Red => G(X(!Red)))
R_2EPSIkVcvTwusZ1
Red is on exactly once.
!r U (r & G(!X(r)))
90
11(!Red U Red) && (Red => G(X(!Red)))
R_6ZBMLj5oxGtGYyV
Red is on exactly once.
!r U (r & G(!X(r)))
91
1F(Red) & G(Red => X(G(!Red))
R_7gRsvfLpsHGFun8
Red is on exactly once.
!r U (r & G(!X(r)))
92
1!Red U (Red && X(!Red)))
R_2wQrFCdtVBTz165
Red is on exactly once.
!r U (r & G(!X(r)))
93
1same
R_3zr1TPsbL8Fh01g
whenever r, cannot be next with g
same
94
1same
R_7t8OynItMvsY3qS
whenever r, cannot be next with g
same
95
1same
R_5pl5ovreUYilD5z
whenever r, cannot be next with g
same
96
1Same
R_6ffI4bTyX5zoEHh
whenever r, cannot be next with g
same
97
1same
R_4mVF8KOBt6MErhn
whenever r, cannot be next with g
same
98
1same
R_2pKyoW6gWKFoQnZ
whenever r, cannot be next with g
same
99
1Same
R_1kn76aEhDPLve1a
whenever r, cannot be next with g
same
100
1same
R_5PdIR5FnMDzrVUu
whenever r, cannot be next with g
same
101
1Same
R_3p46SBAhKNhlNvS
whenever r, cannot be next with g
same
102
1Same
R_47BVZHw0XbaticF
whenever r, cannot be next with g
same
103
1same
R_51nrC3cVmGQGCbZ
whenever r, cannot be next with g
same
104
1same
R_2rjQI459Ka4U504
whenever r, cannot be next with g
same
105
1same
For the last state of LTLf, the negation of the "next" will be true as wanted.
R_10WMbhmzVMMfCQ9
whenever r, cannot be next with g
same
106
1G(Red => Xw(!Green))
R_3p2LrOwAHaKfYYG
whenever r, cannot be next with g
same
107
1Same
R_2EPSIkVcvTwusZ1
whenever r, cannot be next with g
same
108
1same
R_6ZBMLj5oxGtGYyV
whenever r, cannot be next with g
same
109
1same
R_7gRsvfLpsHGFun8
whenever r, cannot be next with g
same
110
1Same
R_2wQrFCdtVBTz165
whenever r, cannot be next with g
same
111
1same
R_3zr1TPsbL8Fh01g
There are at least two states in which the Blue light is on
same
112
1same
R_7t8OynItMvsY3qS
There are at least two states in which the Blue light is on
same
113
1same
R_5pl5ovreUYilD5z
There are at least two states in which the Blue light is on
same
114
1Same
R_6ffI4bTyX5zoEHh
There are at least two states in which the Blue light is on
same
115
1same
R_4mVF8KOBt6MErhn
There are at least two states in which the Blue light is on
same
116
1same
R_2pKyoW6gWKFoQnZ
There are at least two states in which the Blue light is on
same
117
1Same
R_1kn76aEhDPLve1a
There are at least two states in which the Blue light is on
same
118
1same
R_5PdIR5FnMDzrVUu
There are at least two states in which the Blue light is on
same
119
1Same
R_3p46SBAhKNhlNvS
There are at least two states in which the Blue light is on
same
120
count as correct?
1Same
R_47BVZHw0XbaticF
There are at least two states in which the Blue light is on
same
121
1same
R_51nrC3cVmGQGCbZ
There are at least two states in which the Blue light is on
same
122
count as correct?
1same
R_2rjQI459Ka4U504
There are at least two states in which the Blue light is on
same
123
count as correct?
1same
R_10WMbhmzVMMfCQ9
There are at least two states in which the Blue light is on
same
124
count as correct?
1same
R_3p2LrOwAHaKfYYG
There are at least two states in which the Blue light is on
same
125
1Same
R_2EPSIkVcvTwusZ1
There are at least two states in which the Blue light is on
same
126
count as correct?
1same
R_6ZBMLj5oxGtGYyV
There are at least two states in which the Blue light is on
same
127
1same
R_7gRsvfLpsHGFun8
There are at least two states in which the Blue light is on
same
128
count as correct?
1Same
R_2wQrFCdtVBTz165
There are at least two states in which the Blue light is on
same
129
1
G(F(green)), or F(G(green)), or F(green & Xw false))
R_3zr1TPsbL8Fh01g
Green is on in the final state.
F(g & Xw(false))
130
1F(G(Green))
R_7t8OynItMvsY3qS
Green is on in the final state.
F(g & Xw(false))
131
1F(!X(true) && Green)
R_5pl5ovreUYilD5z
Green is on in the final state.
F(g & Xw(false))
132
1Green
R_6ffI4bTyX5zoEHh
Green is on in the final state.
F(g & Xw(false))
133
11!(Xw False) => (Green)
R_4mVF8KOBt6MErhn
Green is on in the final state.
F(g & Xw(false))
134
1F(!X(true) && Green)
LTL has no 'final state'.
R_2pKyoW6gWKFoQnZ
Green is on in the final state.
F(g & Xw(false))
135
1F(Green && !X(True))
R_1kn76aEhDPLve1a
Green is on in the final state.
F(g & Xw(false))
136
1F (!X (true) & Green)
For LTL and infinite traces, there is no such thing as "final state". For finite traces in LTLf, !X (true) uniquely encodes the final state, as it is the only state where X (true) is actually false since no next state exists.
R_5PdIR5FnMDzrVUu
Green is on in the final state.
F(g & Xw(false))
137
1G (F Green)
R_3p46SBAhKNhlNvS
Green is on in the final state.
F(g & Xw(false))
138
1G(F(Green))
R_47BVZHw0XbaticF
Green is on in the final state.
F(g & Xw(false))
139
1G(F(Green))
R_51nrC3cVmGQGCbZ
Green is on in the final state.
F(g & Xw(false))
140
1G ( F ( Green ) )
R_2rjQI459Ka4U504
Green is on in the final state.
F(g & Xw(false))
141
1F(Green && Xw(false))
In LTL there is no final state.
R_10WMbhmzVMMfCQ9
Green is on in the final state.
F(g & Xw(false))
142
1F(Green && Xw(False))
R_3p2LrOwAHaKfYYG
Green is on in the final state.
F(g & Xw(false))
143
1F(Xw(False) & Green)
R_2EPSIkVcvTwusZ1
Green is on in the final state.
F(g & Xw(false))
144
ok, said FG(green) above
1same
R_6ZBMLj5oxGtGYyV
Green is on in the final state.
F(g & Xw(false))
145
1F(Green & Xw(false))
R_7gRsvfLpsHGFun8
Green is on in the final state.
F(g & Xw(false))
146
1F(WX false && Green)
R_2wQrFCdtVBTz165
Green is on in the final state.
F(g & Xw(false))
147
1
Blue & X(!Blue) & G(Blue => Xw(!Blue)) & G(!Blue => Xw(Blue))
R_3zr1TPsbL8Fh01g
Blue on in 1, off in 2, alts evermore
b & G(b => Xw(!b & Xw(b)))
148
1Blue & G(Blue => Xw (!Blue) & Xw(Xw(Blue)))
R_7t8OynItMvsY3qS
Blue on in 1, off in 2, alts evermore
b & G(b => Xw(!b & Xw(b)))
149
1Blue && G(Blue => (Xw(!Blue) & XwXw(Blue)))
R_5pl5ovreUYilD5z
Blue on in 1, off in 2, alts evermore
b & G(b => Xw(!b & Xw(b)))
150
1Blue && G (Blue => Xw !Blue && Xw Xw Blue)
R_6ffI4bTyX5zoEHh
Blue on in 1, off in 2, alts evermore
b & G(b => Xw(!b & Xw(b)))
151
1Blue && G(Blue => (Xw(!Blue) && XwXw(Blue)))
R_4mVF8KOBt6MErhn
Blue on in 1, off in 2, alts evermore
b & G(b => Xw(!b & Xw(b)))
152
1
Blue && X(!Blue) && G(Blue => Xw(!Blue)) && G(!Blue => Xw(Blue))
R_2pKyoW6gWKFoQnZ
Blue on in 1, off in 2, alts evermore
b & G(b => Xw(!b & Xw(b)))
153
1Blue && G(Blue => Xw(!Blue) && Xw(Xw(!Blue)))
R_1kn76aEhDPLve1a
Blue on in 1, off in 2, alts evermore
b & G(b => Xw(!b & Xw(b)))
154
1
Blue & X (!Blue) & Xw (Xw G (Blue => Xw (!Blue) || !Blue => Xw Blue))
In LTLf have to cover for the possibility there may not be states after the first 2, which MUST exist.
R_5PdIR5FnMDzrVUu
Blue on in 1, off in 2, alts evermore
b & G(b => Xw(!b & Xw(b)))
155
1
G ( (Blue => Xw (!Blue)) & ((!Blue) => Xw Blue)) & Blue
R_3p46SBAhKNhlNvS
Blue on in 1, off in 2, alts evermore
b & G(b => Xw(!b & Xw(b)))
156
1G(Blue => Xw(!Blue) & Xw(Xw(Blue))) & Blue
R_47BVZHw0XbaticF
Blue on in 1, off in 2, alts evermore
b & G(b => Xw(!b & Xw(b)))
157
1Blue & G(Blue => Xw(!Blue & Xw(blue)))
R_51nrC3cVmGQGCbZ
Blue on in 1, off in 2, alts evermore
b & G(b => Xw(!b & Xw(b)))
158
X > Xw at first1
Blue & ( Xw (!Blue) ) & ( Xw ( G ( Blue & ( Xw (!Blue) ) ) ) )
R_2rjQI459Ka4U504
Blue on in 1, off in 2, alts evermore
b & G(b => Xw(!b & Xw(b)))
159
1
Blue && X(!Blue) && G(Blue => Xw(!Blue) && Xw(Xw(Blue)))
For the LTLf formula we want the first two states to exist. Thus, we use the strong next. The rest states may not exist, so we use the weak next.
R_10WMbhmzVMMfCQ9
Blue on in 1, off in 2, alts evermore
b & G(b => Xw(!b & Xw(b)))
160
need Xw1same
R_3p2LrOwAHaKfYYG
Blue on in 1, off in 2, alts evermore
b & G(b => Xw(!b & Xw(b)))
161
1G(Blue => Xw(!Blue & Xw(Blue)) & Blue & X(!Blue)
R_2EPSIkVcvTwusZ1
Blue on in 1, off in 2, alts evermore
b & G(b => Xw(!b & Xw(b)))
162
1
Blue && G(Blue => Xw(!Blue)) && G(!Blue => Xw(Blue))
R_6ZBMLj5oxGtGYyV
Blue on in 1, off in 2, alts evermore
b & G(b => Xw(!b & Xw(b)))
163
1Blue & G(Blue => Xw(!Blue) & !Blue => Xw(Blue))
R_7gRsvfLpsHGFun8
Blue on in 1, off in 2, alts evermore
b & G(b => Xw(!b & Xw(b)))
164
rv?1In LTLf, we cannot have alternation.
R_2wQrFCdtVBTz165
Blue on in 1, off in 2, alts evermore
b & G(b => Xw(!b & Xw(b)))
165
1!Red U (Red & Xw(G(!Red)))
R_3zr1TPsbL8Fh01g
Red is on exactly once.
same
166
1!Red U (Red & Xw(G(!Red)))
R_7t8OynItMvsY3qS
Red is on exactly once.
same
167
1F(Red) & G(Red => Xw(G(!Red)))
R_5pl5ovreUYilD5z
Red is on exactly once.
same
168
1!Red U (Red && Xw G !Red)
R_6ffI4bTyX5zoEHh
Red is on exactly once.
same
169
1(F Red) && G(Red => Xw(G(!Red)))
R_4mVF8KOBt6MErhn
Red is on exactly once.
same
170
1F(Red) && G(Red => Xw(G(!Red)))
R_2pKyoW6gWKFoQnZ
Red is on exactly once.
same
171
1F(Red) && G(Red => Xw(G(!Red)))
R_1kn76aEhDPLve1a
Red is on exactly once.
same
172
1!Red U (Red & Xw (G (!Red)))
Have to cover the case where Red is on at the last state in LTLf.
R_5PdIR5FnMDzrVUu
Red is on exactly once.
same
173
"same" is very subtle
1Same
R_3p46SBAhKNhlNvS
Red is on exactly once.
same
174
1!Red U (Red & Xw(G(!Red)))
R_47BVZHw0XbaticF
Red is on exactly once.
same
175
1F(Red) & G(Red => Xw(G(!Red)))
R_51nrC3cVmGQGCbZ
Red is on exactly once.
same
176
1!Red U ( Red & ( Xw (G ( !Red ) ) ) )
R_2rjQI459Ka4U504
Red is on exactly once.
same
177
1F(Red && Xw(G(!Red)))
R_10WMbhmzVMMfCQ9
Red is on exactly once.
same
178
ditto "same"1same
R_3p2LrOwAHaKfYYG
Red is on exactly once.
same
179
1F(Red => G(Xw(!Red)))
R_2EPSIkVcvTwusZ1
Red is on exactly once.
same
180
1(!Red U Red) && (Red => G(Xw(!Red)))
R_6ZBMLj5oxGtGYyV
Red is on exactly once.
same
181
1F(Red) & G(Red => Xw(G(!Red))
R_7gRsvfLpsHGFun8
Red is on exactly once.
same
182
ditto "same"1Same
R_2wQrFCdtVBTz165
Red is on exactly once.
same