def test2Conjectures(self):
from pytptp import conjecture,annot,all,any
s = self.symbols
less,succ,pred,X,Y,T,Z,U,V = s.less,s.succ,s.pred,s.X,s.Y,s.T,s.Z,s.U,s.V
path,edge,input,output,diverge,signal,branch,at,want,crit,block,flop = s.path,s.edge,s.input,s.output,s.diverge,s.signal,s.branch,s.at,s.want,s.crit,s.block,s.flop
T,T1,T2,A,B = s.T,s.T1,s.T2,s.A,s.B
f = annot('')
f += annot('Test 2')
f += annot('Nenastane kriticky stav')
f += conjecture('t2', all(T) * ( all(X,U)*(at(T,X,U) & input(X) & output(U)) >= ~( any(T1)*(less(T,T1) & crit(T1)) ) ) )
return 't2',f
def test1Conjectures(self):
from pytptp import conjecture,annot,all,any
s = self.symbols
less,succ,pred,X,Y,T,Z,U,V = s.less,s.succ,s.pred,s.X,s.Y,s.T,s.Z,s.U,s.V
path,edge,input,output,diverge,signal,branch,at,want,crit,block,flop = s.path,s.edge,s.input,s.output,s.diverge,s.signal,s.branch,s.at,s.want,s.crit,s.block,s.flop
T,T1,T2,A,B = s.T,s.T1,s.T2,s.A,s.B
f = annot('')
f += annot('Test 1')
f += annot('Vlak sa vzdy dostane zo vstupu (X) na definovany vystup (U)')
#f += conjecture('t1', all(T,X,U) * (( input(X) & output(U) & at(T,X,U) & (all(Y) * (input(Y) | ~ (any(V) * ( at(T,Y,V) )))) ) >=
# (any(T1) * ( less(T,T1) & at(T1,U,U) ) ) ))
f += conjecture('t1', all(T,X,U) * (( input(X) & output(U) & path(X,U) & at(T,X,U) ) >= (any(T1) * ( less(T,T1) & at(T1,U,U) ) ) ))
return 't1',f
def test3Conjectures(self):
from pytptp import conjecture,annot,all,any
s = self.symbols
less,succ,pred,X,Y,T,Z,U,V = s.less,s.succ,s.pred,s.X,s.Y,s.T,s.Z,s.U,s.V
path,edge,input,output,diverge,signal,branch,at,want,crit,block,flop = s.path,s.edge,s.input,s.output,s.diverge,s.signal,s.branch,s.at,s.want,s.crit,s.block,s.flop
T,T1,T2,A,B = s.T,s.T1,s.T2,s.A,s.B
f = annot('')
f += annot('Test 3')
f += annot('Tento test funguje len pre nadrazie s 1 vstupom - flop je potom stale v platnosti')
f += conjecture('t3', all(T,X) * ( (input(X) & any(U,V) * (output(U) & output(V) & at(T,X,U) & at(T,V,V) & path(X,V))) >= (signal(succ(T),X)) ))
#f += conjecture('t3', all(T,X) * ( (input(X) & any(U,V) * (output(U) & output(V) & at(T,X,U) & at(T,V,V) & path(X,V))) >= (any(T1) * (less(T,T1) & signal(T1,X))) ))
#f += conjecture('t3', all(T,X) * ( (input(X) & any(U,V) * (output(U) & output(V) & at(T,X,U) & at(T,V,V) & path(X,V) & ~ (any(Y,Z) * (at(T,Y,Z) & (X!=Y)& (V!=Y))))) >=( signal(succ(T),X) ) ))
#f += conjecture('t3', all(T) * ( any(X) * ( (any(U,V)*(at(T,X,U) & input(X) & output(U) & at(T,V,U) & output(V) & block(T,X) & ~ (any(Y,Z) * (~input(Y) & ~output(Y) & at(T,Y,Z) ) ) )) >= ( signal(succ(T),X) ) ) ) )
return 't3',f
