0.00/0.03	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.04	% Command    : vampire --mode casc -t %d %s
0.03/0.24	% Computer   : n182.star.cs.uiowa.edu
0.03/0.24	% Model      : x86_64 x86_64
0.03/0.24	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.03/0.24	% Memory     : 32218.625MB
0.03/0.24	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.03/0.24	% CPULimit   : 300
0.03/0.24	% DateTime   : Fri Jul 13 14:54:26 CDT 2018
0.03/0.24	% CPUTime    : 
0.07/0.28	% dis+10_128_acc=on:add=off:afp=4000:afq=1.4:amm=off:bd=preordered:bce=on:cond=on:fsr=off:fde=unused:gs=on:gsem=on:irw=on:lma=on:nm=64:nwc=1.2:nicw=on:sos=on:sp=occurrence:updr=off:uhcvi=on_2 on theBenchmark
0.07/0.28	% Refutation not found, incomplete strategy
0.07/0.28	% ------------------------------
0.07/0.28	% Version: Vampire 4.2.2 (commit 552c234 on 2018-07-02 14:53:33 +0100)
0.07/0.28	% Termination reason: Refutation not found, incomplete strategy
0.07/0.28	
0.07/0.28	% Memory used [KB]: 9850
0.07/0.28	% Time elapsed: 0.005 s
0.07/0.28	% ------------------------------
0.07/0.28	% ------------------------------
0.07/0.31	% lrs+4_3_av=off:br=off:nm=0:newcnf=on:nwc=1:stl=30:sp=occurrence:urr=on_32 on theBenchmark
0.07/0.33	% Refutation found. Thanks to Tanya!
0.07/0.33	% SZS status Theorem for theBenchmark
0.07/0.33	% SZS output start Proof for theBenchmark
0.07/0.33	fof(f5,axiom,(
0.07/0.33	  ! [X0,X1] : ((~? [X2] : (happens(X2,X1) & initiates(X2,X0,X1)) & ~releasedAt(X0,plus(X1,n1)) & ~holdsAt(X0,X1)) => ~holdsAt(X0,plus(X1,n1)))),
0.07/0.33	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',keep_not_holding)).
0.07/0.33	fof(f13,axiom,(
0.07/0.33	  backwards != spinning),
0.07/0.33	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',spinning_not_backwards)).
0.07/0.33	fof(f15,axiom,(
0.07/0.33	  ! [X2,X1] : (happens(X2,X1) <=> ((n0 = X1 & push = X2) | (pull = X2 & n1 = X1) | (push = X2 & n2 = X1) | (n2 = X1 & pull = X2)))),
0.07/0.33	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',happens_all_defn)).
0.07/0.33	fof(f17,axiom,(
0.07/0.33	  ! [X2,X0,X1] : (((forwards = X0 & ~happens(pull,X1) & push = X2) | (happens(push,X1) & spinning = X0 & pull = X2) | (pull = X2 & backwards = X0 & ~happens(push,X1))) <=> initiates(X2,X0,X1))),
0.07/0.33	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',initiates_all_defn)).
0.07/0.33	fof(f19,axiom,(
0.07/0.33	  backwards != forwards),
0.07/0.33	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',forwards_not_backwards)).
0.07/0.33	fof(f21,axiom,(
0.07/0.33	  ~holdsAt(backwards,n0)),
0.07/0.33	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_backwards_0)).
0.07/0.33	fof(f25,axiom,(
0.07/0.33	  ! [X0,X1] : ~releasedAt(X0,X1)),
0.07/0.33	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_releasedAt)).
0.07/0.33	fof(f27,conjecture,(
0.07/0.33	  ~holdsAt(backwards,n1)),
0.07/0.33	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_backwards_1)).
0.07/0.33	fof(f28,negated_conjecture,(
0.07/0.33	  ~~holdsAt(backwards,n1)),
0.07/0.33	  inference(negated_conjecture,[],[f27])).
0.07/0.33	fof(f37,axiom,(
0.07/0.33	  n1 = plus(n0,n1)),
0.07/0.33	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus0_1)).
0.07/0.33	fof(f50,plain,(
0.07/0.33	  holdsAt(backwards,n1)),
0.07/0.33	  inference(flattening,[],[f28])).
0.07/0.33	fof(f63,plain,(
0.07/0.33	  ! [X0,X1] : (happens(X0,X1) <=> ((n0 = X1 & push = X0) | (pull = X0 & n1 = X1) | (push = X0 & n2 = X1) | (n2 = X1 & pull = X0)))),
0.07/0.33	  inference(rectify,[],[f15])).
0.07/0.33	fof(f70,plain,(
0.07/0.33	  ! [X0,X1,X2] : (((forwards = X1 & ~happens(pull,X2) & push = X0) | (happens(push,X2) & spinning = X1 & pull = X0) | (pull = X0 & backwards = X1 & ~happens(push,X2))) <=> initiates(X0,X1,X2))),
0.07/0.33	  inference(rectify,[],[f17])).
0.07/0.33	fof(f83,plain,(
0.07/0.33	  ! [X0,X1] : (~holdsAt(X0,plus(X1,n1)) | (? [X2] : (happens(X2,X1) & initiates(X2,X0,X1)) | releasedAt(X0,plus(X1,n1)) | holdsAt(X0,X1)))),
0.07/0.33	  inference(ennf_transformation,[],[f5])).
0.07/0.33	fof(f84,plain,(
0.07/0.33	  ! [X0,X1] : (~holdsAt(X0,plus(X1,n1)) | ? [X2] : (happens(X2,X1) & initiates(X2,X0,X1)) | releasedAt(X0,plus(X1,n1)) | holdsAt(X0,X1))),
0.07/0.33	  inference(flattening,[],[f83])).
0.07/0.33	fof(f99,plain,(
0.07/0.33	  holdsAt(backwards,n1)),
0.07/0.33	  inference(cnf_transformation,[],[f50])).
0.07/0.33	fof(f101,plain,(
0.07/0.33	  ~holdsAt(backwards,n0)),
0.07/0.33	  inference(cnf_transformation,[],[f21])).
0.07/0.33	fof(f103,plain,(
0.07/0.33	  ( ! [X0,X1] : (~releasedAt(X0,X1)) )),
0.07/0.33	  inference(cnf_transformation,[],[f25])).
0.07/0.33	fof(f105,plain,(
0.07/0.33	  backwards != forwards),
0.07/0.33	  inference(cnf_transformation,[],[f19])).
0.07/0.33	fof(f106,plain,(
0.07/0.33	  backwards != spinning),
0.07/0.33	  inference(cnf_transformation,[],[f13])).
0.07/0.33	fof(f112,plain,(
0.07/0.33	  n1 = plus(n0,n1)),
0.07/0.33	  inference(cnf_transformation,[],[f37])).
0.07/0.33	fof(f138,plain,(
0.07/0.33	  ( ! [X0,X1] : (holdsAt(X0,X1) | releasedAt(X0,plus(X1,n1)) | initiates(sK0(X0,X1),X0,X1) | ~holdsAt(X0,plus(X1,n1))) )),
0.07/0.33	  inference(cnf_transformation,[],[f84])).
0.07/0.33	fof(f149,plain,(
0.07/0.33	  ( ! [X0,X1] : (push != X0 | n0 != X1 | happens(X0,X1)) )),
0.07/0.33	  inference(cnf_transformation,[],[f63])).
0.07/0.33	fof(f181,plain,(
0.07/0.33	  ( ! [X2,X0,X1] : (~happens(push,X2) | ~initiates(X0,X1,X2) | spinning = X1 | forwards = X1) )),
0.07/0.33	  inference(cnf_transformation,[],[f70])).
0.07/0.33	fof(f722,plain,(
0.07/0.33	  ( ! [X1] : (n0 != X1 | happens(push,X1)) )),
0.07/0.33	  inference(equality_resolution,[],[f149])).
0.07/0.33	fof(f723,plain,(
0.07/0.33	  happens(push,n0)),
0.07/0.33	  inference(equality_resolution,[],[f722])).
0.07/0.33	fof(f744,plain,(
0.07/0.33	  ( ! [X0,X1] : (~holdsAt(X0,plus(X1,n1)) | initiates(sK0(X0,X1),X0,X1) | holdsAt(X0,X1)) )),
0.07/0.33	  inference(subsumption_resolution,[],[f138,f103])).
0.07/0.33	fof(f1032,plain,(
0.07/0.33	  ( ! [X0] : (~initiates(X0,backwards,n0)) )),
0.07/0.33	  inference(unit_resulting_resolution,[],[f105,f106,f723,f181])).
0.07/0.33	fof(f1257,plain,(
0.07/0.33	  ~holdsAt(backwards,plus(n0,n1))),
0.07/0.33	  inference(unit_resulting_resolution,[],[f101,f1032,f744])).
0.07/0.33	fof(f1258,plain,(
0.07/0.33	  ~holdsAt(backwards,n1)),
0.07/0.33	  inference(forward_demodulation,[],[f1257,f112])).
0.07/0.33	fof(f1259,plain,(
0.07/0.33	  $false),
0.07/0.33	  inference(subsumption_resolution,[],[f1258,f99])).
0.07/0.33	% SZS output end Proof for theBenchmark
0.07/0.33	% ------------------------------
0.07/0.33	% Version: Vampire 4.2.2 (commit 552c234 on 2018-07-02 14:53:33 +0100)
0.07/0.33	% Termination reason: Refutation
0.07/0.33	
0.07/0.33	% Memory used [KB]: 1407
0.07/0.33	% Time elapsed: 0.021 s
0.07/0.33	% ------------------------------
0.07/0.33	% ------------------------------
0.07/0.33	% Success in time 0.093 s
0.07/0.34	EOF
