Commit 405eec83 authored by Christian Müller's avatar Christian Müller
Browse files

fix a few things

parent 9a99c60c
digraph "Invariant Labelling" {
0 [label = "Node 0:
True"]
5 -> 3 [label = "forall x:A,p:P,r:R may (Some(choice2))
Assign(x,p) → Review += (x,p,r);", color = green]
3 -> 5 [label = "forall xa:A,xb:A,p:P,r:R
Assign(xa,p) ∧ Review(xb,p,r) → Read += (xa,xb,p,r);", color = red]
4 [label = "Node 4:
∀ xat:A,xbt:A,pt:P,rt:R. (Read(t1)(xat,xbt,pt,rt) ↔ eq())"]
2 -> 3 [label = "forall x:A,p:P,r:R
Assign(x,p) ∧ Oracle(x,p,r) → Review += (x,p,r);", color = red]
5 [label = "Node 5:
∀ xat:A,xbt:A,pt:P,rt:R. ((Read(t1)(xat,xbt,pt,rt) ↔ eq()) ∧
(¬ Read(t1)(xat,xbt,pt,rt) ∨
Read(t2)(xat,xbt,pt,rt)) ∧
(¬ Read(t2)(xat,xbt,pt,rt) ∨
Read(t1)(xat,xbt,pt,rt)) ∧
((¬ Read(t1)(xat,xbt,pt,rt) ∧
(¬ Assign(t1)(xat,pt) ∨
(¬ Review(t1)(xbt,pt,rt) ∧
(¬ Assign(t1)(xbt,pt) ∨
¬ choice2(t1)(xbt,pt,rt))))) ∨
Read(t2)(xat,xbt,pt,rt) ∨
(Assign(t2)(xat,pt) ∧
(Review(t2)(xbt,pt,rt) ∨
(Assign(t2)(xbt,pt) ∧
((¬ informed(t1)(xbt) ∧
choice2(t1)(xbt,pt,rt)) ∨
(informed(t1)(xbt) ∧
choice2(t2)(xbt,pt,rt))))))) ∧
((¬ Read(t2)(xat,xbt,pt,rt) ∧
(¬ Assign(t2)(xat,pt) ∨
(¬ Review(t2)(xbt,pt,rt) ∧
(¬ Assign(t2)(xbt,pt) ∨
((informed(t1)(xbt) ∨
...(1077 characters)"]
1 -> 2 [label = "forall x:A,p:P may (Some(choice1))
¬ Conf(x,p) → Assign += (x,p);", color = red]
0 -> 1 [label = "forall x:A,p:P may (Some(choice0))
True → Conf += (x,p);", color = red]
1 [label = "Node 1:
True"]
3 -> 4 [label = "forall
", color = green]
4 -> 4 [label = "forall
", color = green]
2 [label = "Node 2:
True"]
3 [label = "Node 3:
∀ xat:A,xbt:A,pt:P,rt:R. ((Read(t1)(xat,xbt,pt,rt) ↔ eq()) ∧
((¬ Read(t1)(xat,xbt,pt,rt) ∧
(¬ Assign(t1)(xat,pt) ∨
¬ Review(t1)(xbt,pt,rt))) ∨
Read(t2)(xat,xbt,pt,rt) ∨
(Assign(t2)(xat,pt) ∧
Review(t2)(xbt,pt,rt))) ∧
((¬ Read(t2)(xat,xbt,pt,rt) ∧
(¬ Assign(t2)(xat,pt) ∨
¬ Review(t2)(xbt,pt,rt))) ∨
Read(t1)(xat,xbt,pt,rt) ∨
(Assign(t1)(xat,pt) ∧
Review(t1)(xbt,pt,rt))))"]
}
\ No newline at end of file
digraph "Invariant Labelling" {
0 [label = "Node 0:
True"]
3 [label = "Node 3:
∀ xat:A,xbt:A,pt:P,rt:R. ((Read(t1)(xat,xbt,pt,rt) ↔ eq()) ∧
((¬ Read(t1)(xat,xbt,pt,rt) ∧
(¬ Assign(t1)(xat,pt) ∨
¬ Review(t1)(xbt,pt,rt))) ∨
Read(t2)(xat,xbt,pt,rt) ∨
(Assign(t2)(xat,pt) ∧
Review(t2)(xbt,pt,rt))) ∧
((¬ Read(t2)(xat,xbt,pt,rt) ∧
(¬ Assign(t2)(xat,pt) ∨
¬ Review(t2)(xbt,pt,rt))) ∨
Read(t1)(xat,xbt,pt,rt) ∨
(Assign(t1)(xat,pt) ∧
Review(t1)(xbt,pt,rt)))) ∧
∀ xat:A,xbt:A,pt:P,rt:R,xb:A,p:P,r:R. (((¬ Read(t1)(xat,xbt,pt,rt) ∧
(¬ Assign(t1)(xat,pt) ∨
¬ Review(t1)(xbt,pt,rt))) ∨
Read(t2)(xat,xbt,pt,rt) ∨
(Assign(t2)(xat,pt) ∧
Review(t2)(xbt,pt,rt))) ∧
((¬ Read(t2)(xat,xbt,pt,rt) ∧
(¬ Assign(t2)(xat,pt) ∨
¬ Review(t2)(xbt,pt,rt))) ∨
Read(t1)(xat,xbt,pt,rt) ∨
(Assign(t1)...(7453 characters)"]
4 [label = "Node 4:
∀ xat:A,xbt:A,pt:P,rt:R. (Read(t1)(xat,xbt,pt,rt) ↔ eq())"]
2 -> 3 [label = "forall x:A,p:P,r:R
Assign(x,p) ∧ Oracle(x,p,r) → Review += (x,p,r);", color = red]
5 -> 3 [label = "forall x:A,p:P,r:R may (Some(choice2))
Assign(x,p) → Review += (x,p,r);", color = red]
5 [label = "Node 5:
∀ xat:A,xbt:A,pt:P,rt:R. ((Read(t1)(xat,xbt,pt,rt) ↔ eq()) ∧
(¬ Read(t1)(xat,xbt,pt,rt) ∨
Read(t2)(xat,xbt,pt,rt)) ∧
(¬ Read(t2)(xat,xbt,pt,rt) ∨
Read(t1)(xat,xbt,pt,rt)) ∧
((¬ Read(t1)(xat,xbt,pt,rt) ∧
(¬ Assign(t1)(xat,pt) ∨
(¬ Review(t1)(xbt,pt,rt) ∧
(¬ Assign(t1)(xbt,pt) ∨
¬ choice2(t1)(xbt,pt,rt))))) ∨
Read(t2)(xat,xbt,pt,rt) ∨
(Assign(t2)(xat,pt) ∧
(Review(t2)(xbt,pt,rt) ∨
(Assign(t2)(xbt,pt) ∧
((¬ informed(t1)(xbt) ∧
choice2(t1)(xbt,pt,rt)) ∨
(informed(t1)(xbt) ∧
choice2(t2)(xbt,pt,rt))))))) ∧
((¬ Read(t2)(xat,xbt,pt,rt) ∧
(¬ Assign(t2)(xat,pt) ∨
(¬ Review(t2)(xbt,pt,rt) ∧
(¬ Assign(t2)(xbt,pt) ∨
((informed(t1)(xbt) ∨
...(1077 characters)"]
1 -> 2 [label = "forall x:A,p:P may (Some(choice1))
¬ Conf(x,p) → Assign += (x,p);", color = red]
0 -> 1 [label = "forall x:A,p:P may (Some(choice0))
True → Conf += (x,p);", color = red]
1 [label = "Node 1:
True"]
3 -> 4 [label = "forall
", color = green]
4 -> 4 [label = "forall
", color = green]
2 [label = "Node 2:
True"]
3 -> 5 [label = "forall xa:A,xb:A,p:P,r:R
Assign(xa,p) ∧ Review(xb,p,r) → Read += (xa,xb,p,r);", color = green]
}
\ No newline at end of file
digraph "Invariant Labelling" {
0 [label = "Node 0:
True"]
5 -> 3 [label = "forall x:A,p:P,r:R may (Some(choice2))
Assign(x,p) → Review += (x,p,r);", color = green]
3 [label = "Node 3:
∀ xat:A,xbt:A,pt:P,rt:R. ((Read(t1)(xat,xbt,pt,rt) ↔ eq()) ∧
((¬ Read(t1)(xat,xbt,pt,rt) ∧
(¬ Assign(t1)(xat,pt) ∨
¬ Review(t1)(xbt,pt,rt))) ∨
Read(t2)(xat,xbt,pt,rt) ∨
(Assign(t2)(xat,pt) ∧
Review(t2)(xbt,pt,rt))) ∧
((¬ Read(t2)(xat,xbt,pt,rt) ∧
(¬ Assign(t2)(xat,pt) ∨
¬ Review(t2)(xbt,pt,rt))) ∨
Read(t1)(xat,xbt,pt,rt) ∨
(Assign(t1)(xat,pt) ∧
Review(t1)(xbt,pt,rt)))) ∧
∀ xat:A,xbt:A,pt:P,rt:R,xb:A,p:P,r:R. (((¬ Read(t1)(xat,xbt,pt,rt) ∧
(¬ Assign(t1)(xat,pt) ∨
¬ Review(t1)(xbt,pt,rt))) ∨
Read(t2)(xat,xbt,pt,rt) ∨
(Assign(t2)(xat,pt) ∧
Review(t2)(xbt,pt,rt))) ∧
((¬ Read(t2)(xat,xbt,pt,rt) ∧
(¬ Assign(t2)(xat,pt) ∨
¬ Review(t2)(xbt,pt,rt))) ∨
Read(t1)(xat,xbt,pt,rt) ∨
(Assign(t1)...(7453 characters)"]
3 -> 5 [label = "forall xa:A,xb:A,p:P,r:R
Assign(xa,p) ∧ Review(xb,p,r) → Read += (xa,xb,p,r);", color = red]
2 -> 3 [label = "forall x:A,p:P,r:R
Assign(x,p) ∧ Oracle(x,p,r) → Review += (x,p,r);", color = red]
4 [label = "Node 4:
∀ xat:A,xbt:A,pt:P,rt:R. (Read(t1)(xat,xbt,pt,rt) ↔ eq())"]
1 -> 2 [label = "forall x:A,p:P may (Some(choice1))
¬ Conf(x,p) → Assign += (x,p);", color = red]
0 -> 1 [label = "forall x:A,p:P may (Some(choice0))
True → Conf += (x,p);", color = red]
1 [label = "Node 1:
True"]
5 [label = "Node 5:
∀ xat:A,xbt:A,pt:P,rt:R. ((Read(t1)(xat,xbt,pt,rt) ↔ eq()) ∧
(¬ Read(t1)(xat,xbt,pt,rt) ∨
Read(t2)(xat,xbt,pt,rt)) ∧
(¬ Read(t2)(xat,xbt,pt,rt) ∨
Read(t1)(xat,xbt,pt,rt)) ∧
((¬ Read(t1)(xat,xbt,pt,rt) ∧
(¬ Assign(t1)(xat,pt) ∨
(¬ Review(t1)(xbt,pt,rt) ∧
(¬ Assign(t1)(xbt,pt) ∨
¬ choice2(t1)(xbt,pt,rt))))) ∨
Read(t2)(xat,xbt,pt,rt) ∨
(Assign(t2)(xat,pt) ∧
(Review(t2)(xbt,pt,rt) ∨
(Assign(t2)(xbt,pt) ∧
((¬ informed(t1)(xbt) ∧
choice2(t1)(xbt,pt,rt)) ∨
(informed(t1)(xbt) ∧
choice2(t2)(xbt,pt,rt))))))) ∧
((¬ Read(t2)(xat,xbt,pt,rt) ∧
(¬ Assign(t2)(xat,pt) ∨
(¬ Review(t2)(xbt,pt,rt) ∧
(¬ Assign(t2)(xbt,pt) ∨
((informed(t1)(xbt) ∨
...(3708 characters)"]
3 -> 4 [label = "forall
", color = green]
4 -> 4 [label = "forall
", color = green]
2 [label = "Node 2:
True"]
}
\ No newline at end of file
digraph "Invariant Labelling" {
0 [label = "Node 0:
True"]
4 [label = "Node 4:
∀ xat:A,xbt:A,pt:P,rt:R. (Read(t1)(xat,xbt,pt,rt) ↔ eq())"]
2 -> 3 [label = "forall x:A,p:P,r:R
Assign(x,p) ∧ Oracle(x,p,r) → Review += (x,p,r);", color = red]
5 -> 3 [label = "forall x:A,p:P,r:R may (Some(choice2))
Assign(x,p) → Review += (x,p,r);", color = red]
1 -> 2 [label = "forall x:A,p:P may (Some(choice1))
¬ Conf(x,p) → Assign += (x,p);", color = red]
0 -> 1 [label = "forall x:A,p:P may (Some(choice0))
True → Conf += (x,p);", color = red]
1 [label = "Node 1:
True"]
5 [label = "Node 5:
∀ xat:A,xbt:A,pt:P,rt:R. ((Read(t1)(xat,xbt,pt,rt) ↔ eq()) ∧
(¬ Read(t1)(xat,xbt,pt,rt) ∨
Read(t2)(xat,xbt,pt,rt)) ∧
(¬ Read(t2)(xat,xbt,pt,rt) ∨
Read(t1)(xat,xbt,pt,rt)) ∧
((¬ Read(t1)(xat,xbt,pt,rt) ∧
(¬ Assign(t1)(xat,pt) ∨
(¬ Review(t1)(xbt,pt,rt) ∧
(¬ Assign(t1)(xbt,pt) ∨
¬ choice2(t1)(xbt,pt,rt))))) ∨
Read(t2)(xat,xbt,pt,rt) ∨
(Assign(t2)(xat,pt) ∧
(Review(t2)(xbt,pt,rt) ∨
(Assign(t2)(xbt,pt) ∧
((¬ informed(t1)(xbt) ∧
choice2(t1)(xbt,pt,rt)) ∨
(informed(t1)(xbt) ∧
choice2(t2)(xbt,pt,rt))))))) ∧
((¬ Read(t2)(xat,xbt,pt,rt) ∧
(¬ Assign(t2)(xat,pt) ∨
(¬ Review(t2)(xbt,pt,rt) ∧
(¬ Assign(t2)(xbt,pt) ∨
((informed(t1)(xbt) ∨
...(3708 characters)"]
3 -> 4 [label = "forall
", color = green]
4 -> 4 [label = "forall
", color = green]
3 [label = "Node 3:
∀ xat:A,xbt:A,pt:P,rt:R. ((Read(t1)(xat,xbt,pt,rt) ↔ eq()) ∧
((¬ Read(t1)(xat,xbt,pt,rt) ∧
(¬ Assign(t1)(xat,pt) ∨
¬ Review(t1)(xbt,pt,rt))) ∨
Read(t2)(xat,xbt,pt,rt) ∨
(Assign(t2)(xat,pt) ∧
Review(t2)(xbt,pt,rt))) ∧
((¬ Read(t2)(xat,xbt,pt,rt) ∧
(¬ Assign(t2)(xat,pt) ∨
¬ Review(t2)(xbt,pt,rt))) ∨
Read(t1)(xat,xbt,pt,rt) ∨
(Assign(t1)(xat,pt) ∧
Review(t1)(xbt,pt,rt)))) ∧
∀ xat:A,xbt:A,pt:P,rt:R,xb:A,p:P,r:R. (((¬ Read(t1)(xat,xbt,pt,rt) ∧
(¬ Assign(t1)(xat,pt) ∨
¬ Review(t1)(xbt,pt,rt))) ∨
Read(t2)(xat,xbt,pt,rt) ∨
(Assign(t2)(xat,pt) ∧
Review(t2)(xbt,pt,rt))) ∧
((¬ Read(t2)(xat,xbt,pt,rt) ∧
(¬ Assign(t2)(xat,pt) ∨
¬ Review(t2)(xbt,pt,rt))) ∨
Read(t1)(xat,xbt,pt,rt) ∨
(Assign(t1)...(13420 characters)"]
2 [label = "Node 2:
True"]
3 -> 5 [label = "forall xa:A,xb:A,p:P,r:R
Assign(xa,p) ∧ Review(xb,p,r) → Read += (xa,xb,p,r);", color = green]
}
\ No newline at end of file
digraph "Invariant Labelling" {
0 [label = "Node 0:
True"]
5 -> 3 [label = "forall x:A,p:P,r:R may (Some(choice2))
Assign(x,p) → Review += (x,p,r);", color = green]
3 -> 5 [label = "forall xa:A,xb:A,p:P,r:R
Assign(xa,p) ∧ Review(xb,p,r) → Read += (xa,xb,p,r);", color = red]
4 [label = "Node 4:
∀ xat:A,xbt:A,pt:P,rt:R. (Read(t1)(xat,xbt,pt,rt) ↔ eq())"]
2 -> 3 [label = "forall x:A,p:P,r:R
Assign(x,p) ∧ Oracle(x,p,r) → Review += (x,p,r);", color = red]
1 -> 2 [label = "forall x:A,p:P may (Some(choice1))
¬ Conf(x,p) → Assign += (x,p);", color = red]
0 -> 1 [label = "forall x:A,p:P may (Some(choice0))
True → Conf += (x,p);", color = red]
1 [label = "Node 1:
True"]
3 -> 4 [label = "forall
", color = green]
4 -> 4 [label = "forall
", color = green]
5 [label = "Node 5:
∀ xat:A,xbt:A,pt:P,rt:R. ((Read(t1)(xat,xbt,pt,rt) ↔ eq()) ∧
(¬ Read(t1)(xat,xbt,pt,rt) ∨
Read(t2)(xat,xbt,pt,rt)) ∧
(¬ Read(t2)(xat,xbt,pt,rt) ∨
Read(t1)(xat,xbt,pt,rt)) ∧
((¬ Read(t1)(xat,xbt,pt,rt) ∧
(¬ Assign(t1)(xat,pt) ∨
(¬ Review(t1)(xbt,pt,rt) ∧
(¬ Assign(t1)(xbt,pt) ∨
¬ choice2(t1)(xbt,pt,rt))))) ∨
Read(t2)(xat,xbt,pt,rt) ∨
(Assign(t2)(xat,pt) ∧
(Review(t2)(xbt,pt,rt) ∨
(Assign(t2)(xbt,pt) ∧
((¬ informed(t1)(xbt) ∧
choice2(t1)(xbt,pt,rt)) ∨
(informed(t1)(xbt) ∧
choice2(t2)(xbt,pt,rt))))))) ∧
((¬ Read(t2)(xat,xbt,pt,rt) ∧
(¬ Assign(t2)(xat,pt) ∨
(¬ Review(t2)(xbt,pt,rt) ∧
(¬ Assign(t2)(xbt,pt) ∨
((informed(t1)(xbt) ∨
...(10063 characters)"]
3 [label = "Node 3:
∀ xat:A,xbt:A,pt:P,rt:R. ((Read(t1)(xat,xbt,pt,rt) ↔ eq()) ∧
((¬ Read(t1)(xat,xbt,pt,rt) ∧
(¬ Assign(t1)(xat,pt) ∨
¬ Review(t1)(xbt,pt,rt))) ∨
Read(t2)(xat,xbt,pt,rt) ∨
(Assign(t2)(xat,pt) ∧
Review(t2)(xbt,pt,rt))) ∧
((¬ Read(t2)(xat,xbt,pt,rt) ∧
(¬ Assign(t2)(xat,pt) ∨
¬ Review(t2)(xbt,pt,rt))) ∨
Read(t1)(xat,xbt,pt,rt) ∨
(Assign(t1)(xat,pt) ∧
Review(t1)(xbt,pt,rt)))) ∧
∀ xat:A,xbt:A,pt:P,rt:R,xb:A,p:P,r:R. (((¬ Read(t1)(xat,xbt,pt,rt) ∧
(¬ Assign(t1)(xat,pt) ∨
¬ Review(t1)(xbt,pt,rt))) ∨
Read(t2)(xat,xbt,pt,rt) ∨
(Assign(t2)(xat,pt) ∧
Review(t2)(xbt,pt,rt))) ∧
((¬ Read(t2)(xat,xbt,pt,rt) ∧
(¬ Assign(t2)(xat,pt) ∨
¬ Review(t2)(xbt,pt,rt))) ∨
Read(t1)(xat,xbt,pt,rt) ∨
(Assign(t1)...(13420 characters)"]
2 [label = "Node 2:
True"]
}
\ No newline at end of file
digraph "Invariant Labelling" {
3 -> 4 [label = "forall
", color = red]
5 [label = "Node 5:
5"]
3 -> 5 [label = "forall xa:A,xb:A,p:P,r:R
Assign(xa,p) ∧ Review(xb,p,r) → Read += (xa,xb,p,r);
forall xa:A,xb:A,p:P,r:R
¬ (Read(t1)(xa,xb,p,r) ↔ Read(t2)(xa,xb,p,r)) → informed += (xa);", color = red]
4 [label = "Node 4:
4"]
2 -> 3 [label = "forall x:A,p:P,r:R may (Some(Oracle))
Assign(x,p) → Review += (x,p,r);
forall x:A,p:P,r:R
¬ (Review(t1)(x,p,r) ↔ Review(t2)(x,p,r)) → informed += (x);", color = red]
5 -> 3 [label = "forall x:A,p:P,r:R may (Some(choice2))
Assign(x,p) → Review += (x,p,r);
forall x:A,p:P,r:R
¬ (Review(t1)(x,p,r) ↔ Review(t2)(x,p,r)) → informed += (x);", color = red]
4 -> 4 [label = "forall
", color = red]
2 [label = "Node 2:
2"]
0 -> 1 [label = "forall x:A,p:P may (Some(choice0))
True → Conf += (x,p);
forall x:A,p:P
¬ (Conf(t1)(x,p) ↔ Conf(t2)(x,p)) → informed += (x);", color = red]
1 [label = "Node 1:
1"]
1 -> 2 [label = "forall x:A,p:P may (Some(choice1))
¬ Conf(x,p) → Assign += (x,p);
forall x:A,p:P
¬ (Assign(t1)(x,p) ↔ Assign(t2)(x,p)) → informed += (x);", color = red]
0 [label = "Node 0:
0"]
3 [label = "Node 3:
3"]
}
\ No newline at end of file
Node 0:
True
Node 1:
∀ xt:X,pt:P. (Conf(t1)(xt,pt) ↔ eq()) ∧
∀ xt:X,pt:P,rt:R,yt:X,p:P,r:R. ((Conf(t1)(xt,pt) ∨
¬ choice1(t1)(xt,pt) ∨
Conf(t1)(yt,pt) ∨
¬ choice1(t1)(yt,pt) ∨
¬ choice2(t1)(yt,xt,pt) ∨
(¬ Conf(t2)(yt,pt) ∧
((¬ informed(t1)(yt) ∧
choice1(t1)(yt,pt)) ∨
(informed(t1)(yt) ∧
choice1(t2)(yt,pt))) ∧
((¬ informed(t1)(yt) ∧
(Conf(t1)(yt,p) ∨
¬ choice1(t1)(yt,p) ∨
¬ Conf(t2)(yt,p)) ∧
(Conf(t2)(yt,p) ∨
informed(t1)(yt) ∨
¬ choice1(t1)(yt,p) ∨
(¬ Conf(t1)(yt,p) ∧
choice1(t1)(yt,p))) ∧
(Conf(t1)(yt,p) ∨
¬ choice1(t1)(yt,p) ∨
¬ O(t1)(yt,p,r) ∨
(¬ Conf(t2)(yt,p) ∧
((¬ informed(t1)(yt) ∧
choice1(t1)(yt,p)) ∨
(informed(t1)(yt) ∧
choice1(t2)(yt,p))) ∧
((¬ Conf(t1)(xt,p) ∧
O(t1)(yt,p,r)) ∨
(Conf(t1)(xt,p) ∧
O(t2)(yt,p,r))))) ∧
(Conf(t2)(yt,p) ∨
((informed(t1)(yt) ∨
¬ choice1(t1)(yt,p)) ∧
(¬ informed(t1)(yt) ∨
¬ choice1(t2)(yt,p))) ∨
¬ Conf(t1)(xt,p) ∨
¬ O(t2)(yt,p,r) ∨
(¬ Conf(t1)(yt,p) ∧
choice1(t1)(yt,p) ∧
O(t1)(yt,p,r))) ∧
choice2(t1)(yt,xt,pt)) ∨
choice2(t2)(yt,xt,pt)))) ∧
(Conf(t2)(xt,pt) ∨
¬ choice1(t1)(xt,pt) ∨
Conf(t2)(yt,pt) ∨
((informed(t1)(yt) ∨
¬ choice1(t1)(yt,pt)) ∧
(¬ informed(t1)(yt) ∨
¬ choice1(t2)(yt,pt))) ∨
((informed(t1)(yt) ∨
(¬ Conf(t1)(yt,p) ∧
choice1(t1)(yt,p) ∧
(Conf(t2)(yt,p) ∨
((informed(t1)(yt) ∨
¬ choice1(t1)(yt,p)) ∧
(¬ informed(t1)(yt) ∨
¬ choice1(t2)(yt,p))))) ∨
(¬ Conf(t2)(yt,p) ∧
((¬ informed(t1)(yt) ∧
choice1(t1)(yt,p)) ∨
(informed(t1)(yt) ∧
choice1(t2)(yt,p))) ∧
(Conf(t1)(yt,p) ∨
¬ choice1(t1)(yt,p))) ∨
(¬ Conf(t2)(yt,pt) ∧
((¬ informed(t1)(yt) ∧
choice1(t1)(yt,pt)) ∨
(informed(t1)(yt) ∧
choice1(t2)(yt,pt))) ∧
O(t1)(yt,pt,rt)) ∨
(¬ Conf(t2)(yt,pt) ∧
((¬ informed(t1)(yt) ∧
choice1(t1)(yt,pt)) ∨
(informed(t1)(yt) ∧
choice1(t2)(yt,pt))) ∧
¬ Conf(t1)(xt,pt) ∧
O(t1)(yt,pt,r)) ∨
(¬ Conf(t1)(yt,p) ∧
choice1(t1)(yt,p) ∧
O(t1)(yt,p,rt) ∧
(Conf(t2)(yt,p) ∨
((informed(t1)(yt) ∨
¬ choice1(t1)(yt,p)) ∧
(¬ informed(t1)(yt) ∨
¬ choice1(t2)(yt,p))) ∨
(Conf(t1)(xt,p) ∧
(¬ Conf(t1)(xt,p) ∨
¬ O(t2)(yt,p,rt))))) ∨
(¬ Conf(t2)(yt,p) ∧
((¬ informed(t1)(yt) ∧
choice1(t1)(yt,p)) ∨
(informed(t1)(yt) ∧
choice1(t2)(yt,p))) ∧
Conf(t1)(xt,p) ∧
O(t2)(yt,p,rt) ∧
(Conf(t1)(yt,p) ∨
¬ choice1(t1)(yt,p) ∨
¬ O(t1)(yt,p,rt))) ∨
(¬ Conf(t1)(yt,p) ∧
choice1(t1)(yt,p) ∧
O(t1)(yt,p,r) ∧
(Conf(t2)(yt,p) ∨
((informed(t1)(yt) ∨
¬ choice1(t1)(yt,p)) ∧
(¬ informed(t1)(yt) ∨
¬ choice1(t2)(yt,p))) ∨
((Conf(t1)(xt,p) ∨
¬ O(t1)(yt,p,r)) ∧
(¬ Conf(t1)(xt,p) ∨
¬ O(t2)(yt,p,r))))) ∨
(¬ Conf(t2)(yt,p) ∧
((¬ informed(t1)(yt) ∧
choice1(t1)(yt,p)) ∨
(informed(t1)(yt) ∧
choice1(t2)(yt,p))) ∧
((¬ Conf(t1)(xt,p) ∧
O(t1)(yt,p,r)) ∨
(Conf(t1)(xt,p) ∧
O(t2)(yt,p,r))) ∧
(Conf(t1)(yt,p) ∨
¬ choice1(t1)(yt,p) ∨
¬ O(t1)(yt,p,r))) ∨
¬ choice2(t1)(yt,xt,pt)) ∧
((¬ informed(t1)(yt) ∧
(Conf(t1)(yt,p) ∨
¬ choice1(t1)(yt,p) ∨
(¬ Conf(t2)(yt,p) ∧
((¬ informed(t1)(yt) ∧
choice1(t1)(yt,p)) ∨
(informed(t1)(yt) ∧
choice1(t2)(yt,p))))) ∧
(Conf(t2)(yt,p) ∨
((informed(t1)(yt) ∨
¬ choice1(t1)(yt,p)) ∧
(¬ informed(t1)(yt) ∨
¬ choice1(t2)(yt,p))) ∨
(¬ Conf(t1)(yt,p) ∧
choice1(t1)(yt,p))) ∧
(Conf(t1)(yt,p) ∨
¬ choice1(t1)(yt,p) ∨
¬ O(t1)(yt,p,r) ∨
(¬ Conf(t2)(yt,p) ∧
((¬ informed(t1)(yt) ∧
choice1(t1)(yt,p)) ∨
(informed(t1)(yt) ∧
choice1(t2)(yt,p))) ∧
((¬ Conf(t1)(xt,p) ∧
O(t1)(yt,p,r)) ∨
(Conf(t1)(xt,p) ∧
O(t2)(yt,p,r))))) ∧
(Conf(t2)(yt,p) ∨
((informed(t1)(yt) ∨
¬ choice1(t1)(yt,p)) ∧
(¬ informed(t1)(yt) ∨
¬ choice1(t2)(yt,p))) ∨
((Conf(t1)(xt,p) ∨
¬ O(t1)(yt,p,r)) ∧
(¬ Conf(t1)(xt,p) ∨
¬ O(t2)(yt,p,r))) ∨
(¬ Conf(t1)(yt,p) ∧
choice1(t1)(yt,p) ∧
O(t1)(yt,p,r)))) ∨
¬ choice2(t2)(yt,xt,pt))) ∨
(¬ Conf(t1)(xt,pt) ∧
choice1(t1)(xt,pt) ∧
¬ Conf(t1)(yt,pt) ∧
choice1(t1)(yt,pt) ∧
choice2(t1)(yt,xt,pt))) ∧
(¬ Conf(t1)(xt,pt) ∨
Conf(t2)(xt,pt)) ∧