HISTORY Happens(AttCreateTP(Done(Seller,Deliver(Seller,Buyer,CD)),2,3,Exist),0). Happens(Deliver(Seller,Buyer,CD),2). >>> decreasoner.run('sviluppo/TPExist.e') Discrete Event Calculus Reasoner 1.0 loading sviluppo/TPExist.e loading foundations/Root.e loading foundations/EC.e 384 variables and 1889 clauses relsat solver 1 model --- model 1: 0 Happens(AttCreateTP(Done(Seller, Deliver(Seller, Buyer, CD)), 2, 3, Exist), 0). Happens(Elapse(0), 0). 1 +ETP(TP(Done(Seller, Deliver(Seller, Buyer, CD)), 2, 3, Exist), Undef). +TP(Done(Seller, Deliver(Seller, Buyer, CD)), 2, 3, Exist). Happens(Elapse(1), 1). 2 Happens(Deliver(Seller, Buyer, CD), 2). Happens(Elapse(2), 2). 3 -ETP(TP(Done(Seller, Deliver(Seller, Buyer, CD)), 2, 3, Exist), Undef). +Done(Seller, Deliver(Seller, Buyer, CD)). +ETP(TP(Done(Seller, Deliver(Seller, Buyer, CD)), 2, 3, Exist), True). EC: 7 predicates, 0 functions, 0 fluents, 0 events, 0 axioms Root: 0 predicates, 0 functions, 0 fluents, 0 events, 0 axioms TPExist: 0 predicates, 0 functions, 3 fluents, 3 events, 15 axioms encoding 467.3s/7.8m solution 0.3s total 468.6s/7.8m ----------------------------------------------------------------------------- ;HISTORY OF THE SYSTEM Happens(AttCreateTP(Done(Seller,Deliver(Seller,Buyer,CD)),2,3,Exist),1). Happens(Deliver(Seller,Buyer,CD),2). >>> decreasoner.run('sviluppo/TPExist.e') Discrete Event Calculus Reasoner 1.0 loading sviluppo/TPExist.e loading foundations/Root.e loading foundations/EC.e 384 variables and 1889 clauses relsat solver 1 model --- model 1: 0 Happens(Elapse(0), 0). 1 Happens(AttCreateTP(Done(Seller, Deliver(Seller, Buyer, CD)), 2, 3, Exist), 1). Happens(Elapse(1), 1). 2 +ETP(TP(Done(Seller, Deliver(Seller, Buyer, CD)), 2, 3, Exist), Undef). +TP(Done(Seller, Deliver(Seller, Buyer, CD)), 2, 3, Exist). Happens(Deliver(Seller, Buyer, CD), 2). Happens(Elapse(2), 2). 3 -ETP(TP(Done(Seller, Deliver(Seller, Buyer, CD)), 2, 3, Exist), Undef). +Done(Seller, Deliver(Seller, Buyer, CD)). +ETP(TP(Done(Seller, Deliver(Seller, Buyer, CD)), 2, 3, Exist), True). EC: 7 predicates, 0 functions, 0 fluents, 0 events, 0 axioms Root: 0 predicates, 0 functions, 0 fluents, 0 events, 0 axioms TPExist: 0 predicates, 0 functions, 3 fluents, 3 events, 15 axioms encoding 467.4s/7.8m solution 0.3s total 468.8s/7.8m --------------------------------------------------------------------------------- Happens(AttCreateTP(Done(Seller,Deliver(Seller,Buyer,CD)),2,3,Exist),2). Happens(Deliver(Seller,Buyer,CD),2). >>> decreasoner.run('sviluppo/TPExist.e') Discrete Event Calculus Reasoner 1.0 loading sviluppo/TPExist.e loading foundations/Root.e loading foundations/EC.e 384 variables and 1767 clauses relsat solver 1 model --- model 1: 0 Happens(Elapse(0), 0). 1 Happens(Elapse(1), 1). 2 Happens(AttCreateTP(Done(Seller, Deliver(Seller, Buyer, CD)), 2, 3, Exist), 2). Happens(Deliver(Seller, Buyer, CD), 2). Happens(Elapse(2), 2). 3 +Done(Seller, Deliver(Seller, Buyer, CD)). +ETP(TP(Done(Seller, Deliver(Seller, Buyer, CD)), 2, 3, Exist), True). +TP(Done(Seller, Deliver(Seller, Buyer, CD)), 2, 3, Exist). EC: 7 predicates, 0 functions, 0 fluents, 0 events, 0 axioms Root: 0 predicates, 0 functions, 0 fluents, 0 events, 0 axioms TPExist: 0 predicates, 0 functions, 3 fluents, 3 events, 15 axioms encoding 133.4s/2.2m solution 0.3s total 134.7s/2.2m ---------------------------------------------------------------------------------- ;HISTORY OF THE SYSTEM Happens(AttCreateTP(Done(Seller,Deliver(Seller,Buyer,CD)),2,3,Exist),3). Happens(Deliver(Seller,Buyer,CD),2). >>> decreasoner.run('sviluppo/TPExist.e') Discrete Event Calculus Reasoner 1.0 loading sviluppo/TPExist.e loading foundations/Root.e loading foundations/EC.e 485 variables and 2074 clauses relsat solver 1 model --- model 1: 0 Happens(Elapse(0), 0). 1 Happens(Elapse(1), 1). 2 Happens(Deliver(Seller, Buyer, CD), 2). Happens(Elapse(2), 2). 3 +Done(Seller, Deliver(Seller, Buyer, CD)). Happens(AttCreateTP(Done(Seller, Deliver(Seller, Buyer, CD)), 2, 3, Exist), 3). Happens(Elapse(3), 3). 4 +ETP(TP(Done(Seller, Deliver(Seller, Buyer, CD)), 2, 3, Exist), True). +TP(Done(Seller, Deliver(Seller, Buyer, CD)), 2, 3, Exist). EC: 7 predicates, 0 functions, 0 fluents, 0 events, 0 axioms Root: 0 predicates, 0 functions, 0 fluents, 0 events, 0 axioms TPExist: 0 predicates, 0 functions, 3 fluents, 3 events, 15 axioms encoding 178.1s/3.0m solution 0.4s total 179.6s/3.0m