0.00/0.02 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.02 % Command : run_vampire %s %d THM 0.10/0.39 % Computer : n017.cluster.edu 0.10/0.39 % Model : x86_64 x86_64 0.10/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.10/0.39 % Memory : 8046.5625MB 0.10/0.39 % OS : Linux 6.8.0-71-generic 0.10/0.39 % CPULimit : 1440 0.10/0.39 % WCLimit : 180 0.10/0.39 % DateTime : Mon Jul 27 09:32:22 UTC 2026 0.10/0.39 % CPUTime : 0.10/0.43 This is a FOF_ problem 0.10/0.44 Running first-order theorem proving 0.10/0.44 Running /export/starexec/sandbox/solver/bin/vampire --mode casc -m 16384 --cores 7 -t 180 /export/starexec/sandbox/benchmark/theBenchmark.p 0.19/0.50 % (1195931)Running in auto input_syntax mode. Trying TPTP 0.19/0.50 % (1195945)lrs+10_2:3_to=lpo:sil=16000:sp=arity:random_seed=2003906320:i=114:bd=all:ss=axioms:sgt=4_1799 on theBenchmark for (1799ds/114Mi) 0.19/0.51 % (1195945)Refutation not found, incomplete strategy% (1195945)------------------------------ 0.19/0.51 % (1195945)Version: Vampire 5.0.0 (Release build, commit 3ce9b74f2 on 2025-07-14 12:22:21 +0200) 0.19/0.51 % (1195945)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c 0.19/0.51 % (1195945)Termination reason: Refutation not found, incomplete strategy 0.19/0.51 0.19/0.51 % (1195945)Time elapsed: 0.007 s 0.19/0.51 % (1195945)Peak memory usage: 12 MB 0.19/0.51 % (1195945)Instructions burned: 21 (million) 0.19/0.51 % (1195945)------------------------------ 0.19/0.51 % (1195945)------------------------------ 0.19/0.54 % (1195931)Running in auto input_syntax mode. Trying TPTP 0.19/0.54 % (1195943)lrs+1011_32_sil=2000:tgt=full:alpa=true:random_seed=930486551:st=5:i=107:sd=1:ss=included:er=filter_1799 on theBenchmark for (1799ds/107Mi) 0.19/0.54 % (1195931)Running in auto input_syntax mode. Trying TPTP 0.19/0.54 % (1195940)lrs+1011_1_sp=occurrence:random_seed=935089753:st=6:sd=4:ss=included_1799 on theBenchmark for (1799ds/0Mi) 0.19/0.54 % (1195931)Running in auto input_syntax mode. Trying TPTP 0.19/0.54 % (1195941)dis+1010_16_tgt=full:drc=ordering:sp=reverse_frequency:nwc=1:random_seed=1515540829:i=261632:kws=inv_arity_squared:ins=1:av=off:fsd=on_1799 on theBenchmark for (1799ds/261632Mi) 0.19/0.54 % (1195931)Running in auto input_syntax mode. Trying TPTP 0.19/0.54 % (1195942)lrs+10_1_sp=unary_first:urr=on:s2agt=32:random_seed=3179526372:s2a=on:i=272356:sd=1:bd=all:ss=included_1799 on theBenchmark for (1799ds/272356Mi) 0.19/0.54 % (1195931)Running in auto input_syntax mode. Trying TPTP 0.19/0.54 % (1195946)ott+1011_2_sil=4000:lsd=20:rnwc=on:rp=on:sac=on:newcnf=on:random_seed=613862365:i=132:kws=arity:er=filter_1799 on theBenchmark for (1799ds/132Mi) 0.19/0.55 % (1195931)Running in auto input_syntax mode. Trying TPTP 0.19/0.55 % (1195954)lrs+10_1_sil=2000:sos=on:random_seed=2966993113:i=135:sd=2:gtg=position:ss=axioms_1799 on theBenchmark for (1799ds/135Mi) 0.19/0.55 % (1195954)Refutation not found, incomplete strategy% (1195954)------------------------------ 0.19/0.55 % (1195954)Version: Vampire 5.0.0 (Release build, commit 3ce9b74f2 on 2025-07-14 12:22:21 +0200) 0.19/0.55 % (1195954)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c 0.19/0.55 % (1195954)Termination reason: Refutation not found, incomplete strategy 0.19/0.55 0.19/0.55 % (1195954)Time elapsed: 0.001 s 0.19/0.55 % (1195954)Peak memory usage: 12 MB 0.19/0.55 % (1195954)Instructions burned: 1 (million) 0.19/0.55 % (1195931)Running in auto input_syntax mode. Trying TPTP 0.19/0.55 % (1195948)dis+1011_1_slsqr=8,1:sil=2000:spb=units:fd=off:kmz=on:flr=on:sac=on:slsq=on:random_seed=916957657:st=2:i=121:sd=30:afp=100000:aac=none:ep=RS:ss=axioms:sgt=10_1799 on theBenchmark for (1799ds/121Mi) 0.19/0.55 % (1195954)------------------------------ 0.19/0.55 % (1195954)------------------------------ 0.19/0.57 % (1195948)Refutation not found, incomplete strategy% (1195948)------------------------------ 0.19/0.57 % (1195948)Version: Vampire 5.0.0 (Release build, commit 3ce9b74f2 on 2025-07-14 12:22:21 +0200) 0.19/0.57 % (1195948)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c 0.19/0.57 % (1195948)Termination reason: Refutation not found, incomplete strategy 0.19/0.57 0.19/0.57 % (1195948)Time elapsed: 0.015 s 0.19/0.57 % (1195948)Peak memory usage: 12 MB 0.19/0.57 % (1195948)Instructions burned: 22 (million) 0.19/0.57 % (1195948)------------------------------ 0.19/0.57 % (1195948)------------------------------ 0.90/0.59 % (1195943)First to succeed. 0.90/0.59 % (1195943)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1195931" 0.90/0.59 % (1195931)Running in auto input_syntax mode. Trying TPTP 0.90/0.59 % (1195943)Refutation found. Thanks to Tanya! 0.90/0.59 % SZS status Theorem for theBenchmark 0.90/0.59 % SZS output start Proof for theBenchmark 0.90/0.59 fof(f2929,plain,( 0.90/0.59 $false), 0.90/0.59 inference(avatar_sat_refutation,[],[f2703,f2928])). 0.90/0.59 fof(f2928,plain,( 0.90/0.59 ~spl14_66), 0.90/0.59 inference(avatar_contradiction_clause,[],[f2927])). 0.90/0.59 fof(f2927,plain,( 0.90/0.59 $false | ~spl14_66), 0.90/0.59 inference(subsumption_resolution,[],[f2926,f2688])). 0.90/0.59 fof(f2688,plain,( 0.90/0.59 happens(push,n2) | ~spl14_66), 0.90/0.59 inference(avatar_component_clause,[],[f2687])). 0.90/0.59 fof(f2687,definition,( 0.90/0.59 spl14_66 <=> happens(push,n2)), 0.90/0.59 introduced(definition,[new_symbols(naming,[spl14_66])],[avatar_definition])). 0.90/0.59 fof(f2926,plain,( 0.90/0.59 ~happens(push,n2) | ~spl14_66), 0.90/0.59 inference(subsumption_resolution,[],[f2925,f2913])). 0.90/0.59 fof(f2913,plain,( 0.90/0.59 happens(pull,n2) | ~spl14_66), 0.90/0.59 inference(subsumption_resolution,[],[f2906,f2688])). 0.90/0.59 fof(f2906,plain,( 0.90/0.59 ~happens(push,n2) | happens(pull,n2)), 0.90/0.59 inference(resolution,[],[f2904,f290])). 0.90/0.59 fof(f290,plain,( 0.90/0.59 ( ! [X0] : (sP9(X0,backwards,push) | happens(pull,X0)) )), 0.90/0.59 inference(equality_resolution,[],[f289])). 0.90/0.59 fof(f289,plain,( 0.90/0.59 ( ! [X2,X0] : (sP9(X0,backwards,X2) | happens(pull,X0) | push != X2) )), 0.90/0.59 inference(equality_resolution,[],[f248])). 0.90/0.59 fof(f248,plain,( 0.90/0.59 ( ! [X2,X0,X1] : (sP9(X0,X1,X2) | happens(pull,X0) | backwards != X1 | push != X2) )), 0.90/0.59 inference(cnf_transformation,[],[f138])). 0.90/0.59 fof(f138,plain,( 0.90/0.59 ! [X0,X1,X2] : ((sP9(X0,X1,X2) | ((happens(pull,X0) | backwards != X1 | push != X2) & ~sP8(X2,X1,X0) & ~sP7(X1,X0,X2) & ~sP6(X0,X1,X2) & ~sP5(X2,X1,X0) & ~sP4(X0,X1,X2))) & ((~happens(pull,X0) & backwards = X1 & push = X2) | sP8(X2,X1,X0) | sP7(X1,X0,X2) | sP6(X0,X1,X2) | sP5(X2,X1,X0) | sP4(X0,X1,X2) | ~sP9(X0,X1,X2)))), 0.90/0.59 inference(rectify,[],[f137])). 0.90/0.59 fof(f137,plain,( 0.90/0.59 ! [X2,X1,X0] : ((sP9(X2,X1,X0) | ((happens(pull,X2) | backwards != X1 | push != X0) & ~sP8(X0,X1,X2) & ~sP7(X1,X2,X0) & ~sP6(X2,X1,X0) & ~sP5(X0,X1,X2) & ~sP4(X2,X1,X0))) & ((~happens(pull,X2) & backwards = X1 & push = X0) | sP8(X0,X1,X2) | sP7(X1,X2,X0) | sP6(X2,X1,X0) | sP5(X0,X1,X2) | sP4(X2,X1,X0) | ~sP9(X2,X1,X0)))), 0.90/0.59 inference(flattening,[],[f136])). 0.90/0.59 fof(f136,plain,( 0.90/0.59 ! [X2,X1,X0] : ((sP9(X2,X1,X0) | ((happens(pull,X2) | backwards != X1 | push != X0) & ~sP8(X0,X1,X2) & ~sP7(X1,X2,X0) & ~sP6(X2,X1,X0) & ~sP5(X0,X1,X2) & ~sP4(X2,X1,X0))) & (((~happens(pull,X2) & backwards = X1 & push = X0) | sP8(X0,X1,X2) | sP7(X1,X2,X0) | sP6(X2,X1,X0) | sP5(X0,X1,X2) | sP4(X2,X1,X0)) | ~sP9(X2,X1,X0)))), 0.90/0.59 inference(nnf_transformation,[],[f99])). 0.90/0.59 fof(f99,plain,( 0.90/0.59 ! [X2,X1,X0] : (sP9(X2,X1,X0) <=> ((~happens(pull,X2) & backwards = X1 & push = X0) | sP8(X0,X1,X2) | sP7(X1,X2,X0) | sP6(X2,X1,X0) | sP5(X0,X1,X2) | sP4(X2,X1,X0)))), 0.90/0.59 introduced(definition,[new_symbols(naming,[sP9])],[predicate_definition_introduction])). 0.90/0.59 fof(f2904,plain,( 0.90/0.59 ( ! [X0] : (~sP9(n2,backwards,X0) | ~happens(X0,n2)) )), 0.90/0.59 inference(resolution,[],[f2900,f189])). 0.90/0.59 fof(f189,plain,( 0.90/0.59 holdsAt(backwards,n3)), 0.90/0.59 inference(cnf_transformation,[],[f61])). 0.90/0.59 fof(f61,plain,( 0.90/0.59 holdsAt(backwards,n3)), 0.90/0.59 inference(flattening,[],[f46])). 0.90/0.59 fof(f46,negated_conjecture,( 0.90/0.59 ~~holdsAt(backwards,n3)), 0.90/0.59 inference(negated_conjecture,[status(cth)],[f45])). 0.90/0.59 fof(f45,conjecture,( 0.90/0.59 ~holdsAt(backwards,n3)), 0.90/0.59 file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown)). 0.90/0.59 fof(f2900,plain,( 0.90/0.59 ( ! [X0,X1] : (~holdsAt(X0,n3) | ~happens(X1,n2) | ~sP9(n2,X0,X1)) )), 0.90/0.59 inference(superposition,[],[f2608,f167])). 0.90/0.59 fof(f167,plain,( 0.90/0.59 n3 = plus(n1,n2)), 0.90/0.59 inference(cnf_transformation,[],[f31])). 0.90/0.59 fof(f31,axiom,( 0.90/0.59 n3 = plus(n1,n2)), 0.90/0.59 file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown)). 0.90/0.59 fof(f2608,plain,( 0.90/0.59 ( ! [X2,X0,X1] : (~holdsAt(X1,plus(n1,X0)) | ~happens(X2,X0) | ~sP9(X0,X1,X2)) )), 0.90/0.59 inference(superposition,[],[f1075,f193])). 0.90/0.59 fof(f193,plain,( 0.90/0.59 ( ! [X0,X1] : (plus(X1,X0) = plus(X0,X1)) )), 0.90/0.59 inference(cnf_transformation,[],[f63])). 0.90/0.59 fof(f63,plain,( 0.90/0.59 ! [X0,X1] : plus(X1,X0) = plus(X0,X1)), 0.90/0.59 inference(rectify,[],[f49])). 0.90/0.59 fof(f49,axiom,( 0.90/0.59 ! [X8,X9] : plus(X9,X8) = plus(X8,X9)), 0.90/0.59 file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown)). 0.90/0.59 fof(f1075,plain,( 0.90/0.59 ( ! [X2,X0,X1] : (~holdsAt(X0,plus(X1,n1)) | ~happens(X2,X1) | ~sP9(X1,X0,X2)) )), 0.90/0.59 inference(resolution,[],[f213,f269])). 0.90/0.59 fof(f269,plain,( 0.90/0.59 ( ! [X2,X0,X1] : (terminates(X0,X1,X2) | ~sP9(X2,X1,X0)) )), 0.90/0.59 inference(cnf_transformation,[],[f152])). 0.90/0.59 fof(f152,plain,( 0.90/0.59 ! [X0,X1,X2] : ((sP9(X2,X1,X0) | ~terminates(X0,X1,X2)) & (terminates(X0,X1,X2) | ~sP9(X2,X1,X0)))), 0.90/0.59 inference(nnf_transformation,[],[f100])). 0.90/0.59 fof(f100,plain,( 0.90/0.59 ! [X0,X1,X2] : (sP9(X2,X1,X0) <=> terminates(X0,X1,X2))), 0.90/0.59 inference(definition_folding,[],[f70,f99,f98,f97,f96,f95,f94])). 0.90/0.59 fof(f94,plain,( 0.90/0.59 ! [X2,X1,X0] : (sP4(X2,X1,X0) <=> (~happens(push,X2) & forwards = X1 & pull = X0))), 0.90/0.59 introduced(definition,[new_symbols(naming,[sP4])],[predicate_definition_introduction])). 0.90/0.59 fof(f95,plain,( 0.90/0.59 ! [X0,X1,X2] : (sP5(X0,X1,X2) <=> (pull = X0 & spinning = X1 & ~happens(push,X2)))), 0.90/0.59 introduced(definition,[new_symbols(naming,[sP5])],[predicate_definition_introduction])). 0.90/0.59 fof(f96,plain,( 0.90/0.59 ! [X2,X1,X0] : (sP6(X2,X1,X0) <=> (~happens(pull,X2) & spinning = X1 & push = X0))), 0.90/0.59 introduced(definition,[new_symbols(naming,[sP6])],[predicate_definition_introduction])). 0.90/0.59 fof(f97,plain,( 0.90/0.59 ! [X1,X2,X0] : (sP7(X1,X2,X0) <=> (backwards = X1 & happens(push,X2) & pull = X0))), 0.90/0.59 introduced(definition,[new_symbols(naming,[sP7])],[predicate_definition_introduction])). 0.90/0.59 fof(f98,plain,( 0.90/0.59 ! [X0,X1,X2] : (sP8(X0,X1,X2) <=> (pull = X0 & forwards = X1 & happens(push,X2)))), 0.90/0.59 introduced(definition,[new_symbols(naming,[sP8])],[predicate_definition_introduction])). 0.90/0.59 fof(f70,plain,( 0.90/0.59 ! [X0,X1,X2] : (((~happens(pull,X2) & backwards = X1 & push = X0) | (pull = X0 & forwards = X1 & happens(push,X2)) | (backwards = X1 & happens(push,X2) & pull = X0) | (~happens(pull,X2) & spinning = X1 & push = X0) | (pull = X0 & spinning = X1 & ~happens(push,X2)) | (~happens(push,X2) & forwards = X1 & pull = X0)) <=> terminates(X0,X1,X2))), 0.90/0.59 inference(rectify,[],[f16])). 0.90/0.59 fof(f16,axiom,( 0.90/0.59 ! [X2,X0,X1] : (((~happens(pull,X1) & backwards = X0 & push = X2) | (pull = X2 & forwards = X0 & happens(push,X1)) | (backwards = X0 & happens(push,X1) & pull = X2) | (~happens(pull,X1) & spinning = X0 & push = X2) | (pull = X2 & spinning = X0 & ~happens(push,X1)) | (~happens(push,X1) & forwards = X0 & pull = X2)) <=> terminates(X2,X0,X1))), 0.90/0.59 file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown)). 0.90/0.59 fof(f213,plain,( 0.90/0.59 ( ! [X2,X0,X1] : (~terminates(X0,X2,X1) | ~holdsAt(X2,plus(X1,n1)) | ~happens(X0,X1)) )), 0.90/0.59 inference(cnf_transformation,[],[f75])). 0.90/0.59 fof(f75,plain,( 0.90/0.59 ! [X0,X1,X2] : (~holdsAt(X2,plus(X1,n1)) | ~terminates(X0,X2,X1) | ~happens(X0,X1))), 0.90/0.59 inference(flattening,[],[f74])). 0.90/0.59 fof(f74,plain,( 0.90/0.59 ! [X0,X1,X2] : (~holdsAt(X2,plus(X1,n1)) | (~terminates(X0,X2,X1) | ~happens(X0,X1)))), 0.90/0.59 inference(ennf_transformation,[],[f65])). 0.90/0.59 fof(f65,plain,( 0.90/0.59 ! [X0,X1,X2] : ((terminates(X0,X2,X1) & happens(X0,X1)) => ~holdsAt(X2,plus(X1,n1)))), 0.90/0.59 inference(rectify,[],[f11])). 0.90/0.59 fof(f11,axiom,( 0.90/0.59 ! [X2,X1,X0] : ((terminates(X2,X0,X1) & happens(X2,X1)) => ~holdsAt(X0,plus(X1,n1)))), 0.90/0.59 file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown)). 0.90/0.59 fof(f2925,plain,( 0.90/0.59 ~happens(pull,n2) | ~happens(push,n2)), 0.90/0.59 inference(resolution,[],[f2909,f294])). 0.90/0.59 fof(f294,plain,( 0.90/0.59 ( ! [X1] : (sP7(backwards,X1,pull) | ~happens(push,X1)) )), 0.90/0.59 inference(equality_resolution,[],[f293])). 0.90/0.59 fof(f293,plain,( 0.90/0.59 ( ! [X2,X1] : (sP7(backwards,X1,X2) | ~happens(push,X1) | pull != X2) )), 0.90/0.59 inference(equality_resolution,[],[f256])). 0.90/0.59 fof(f256,plain,( 0.90/0.59 ( ! [X2,X0,X1] : (sP7(X0,X1,X2) | backwards != X0 | ~happens(push,X1) | pull != X2) )), 0.90/0.59 inference(cnf_transformation,[],[f143])). 0.90/0.59 fof(f143,plain,( 0.90/0.59 ! [X0,X1,X2] : ((sP7(X0,X1,X2) | backwards != X0 | ~happens(push,X1) | pull != X2) & ((backwards = X0 & happens(push,X1) & pull = X2) | ~sP7(X0,X1,X2)))), 0.90/0.59 inference(rectify,[],[f142])). 0.90/0.59 fof(f142,plain,( 0.90/0.59 ! [X1,X2,X0] : ((sP7(X1,X2,X0) | backwards != X1 | ~happens(push,X2) | pull != X0) & ((backwards = X1 & happens(push,X2) & pull = X0) | ~sP7(X1,X2,X0)))), 0.90/0.59 inference(flattening,[],[f141])). 0.90/0.59 fof(f141,plain,( 0.90/0.59 ! [X1,X2,X0] : ((sP7(X1,X2,X0) | (backwards != X1 | ~happens(push,X2) | pull != X0)) & ((backwards = X1 & happens(push,X2) & pull = X0) | ~sP7(X1,X2,X0)))), 0.90/0.59 inference(nnf_transformation,[],[f97])). 0.90/0.59 fof(f2909,plain,( 0.90/0.59 ( ! [X0] : (~sP7(backwards,n2,X0) | ~happens(X0,n2)) )), 0.90/0.59 inference(resolution,[],[f2904,f246])). 0.90/0.59 fof(f246,plain,( 0.90/0.59 ( ! [X2,X0,X1] : (sP9(X0,X1,X2) | ~sP7(X1,X0,X2)) )), 0.90/0.59 inference(cnf_transformation,[],[f138])). 0.90/0.59 fof(f2703,plain,( 0.90/0.59 spl14_66), 0.90/0.59 inference(avatar_contradiction_clause,[],[f2702])). 0.90/0.59 fof(f2702,plain,( 0.90/0.59 $false | spl14_66), 0.90/0.59 inference(subsumption_resolution,[],[f2701,f280])). 0.90/0.59 fof(f280,plain,( 0.90/0.59 sP1(push,n2)), 0.90/0.59 inference(equality_resolution,[],[f279])). 0.90/0.59 fof(f279,plain,( 0.90/0.59 ( ! [X0] : (sP1(X0,n2) | push != X0) )), 0.90/0.59 inference(equality_resolution,[],[f203])). 0.90/0.59 fof(f203,plain,( 0.90/0.59 ( ! [X0,X1] : (sP1(X0,X1) | n2 != X1 | push != X0) )), 0.90/0.59 inference(cnf_transformation,[],[f115])). 0.90/0.59 fof(f115,plain,( 0.90/0.59 ! [X0,X1] : ((sP1(X0,X1) | ((pull != X0 | n1 != X1) & (n2 != X1 | pull != X0) & (n2 != X1 | push != X0) & ~sP0(X1,X0))) & ((pull = X0 & n1 = X1) | (n2 = X1 & pull = X0) | (n2 = X1 & push = X0) | sP0(X1,X0) | ~sP1(X0,X1)))), 0.90/0.59 inference(flattening,[],[f114])). 0.90/0.59 fof(f114,plain,( 0.90/0.59 ! [X0,X1] : ((sP1(X0,X1) | ((pull != X0 | n1 != X1) & (n2 != X1 | pull != X0) & (n2 != X1 | push != X0) & ~sP0(X1,X0))) & (((pull = X0 & n1 = X1) | (n2 = X1 & pull = X0) | (n2 = X1 & push = X0) | sP0(X1,X0)) | ~sP1(X0,X1)))), 0.90/0.59 inference(nnf_transformation,[],[f89])). 0.90/0.59 fof(f89,plain,( 0.90/0.59 ! [X0,X1] : (sP1(X0,X1) <=> ((pull = X0 & n1 = X1) | (n2 = X1 & pull = X0) | (n2 = X1 & push = X0) | sP0(X1,X0)))), 0.90/0.59 introduced(definition,[new_symbols(naming,[sP1])],[predicate_definition_introduction])). 0.90/0.59 fof(f2701,plain,( 0.90/0.59 ~sP1(push,n2) | spl14_66), 0.90/0.59 inference(resolution,[],[f2689,f209])). 0.90/0.59 fof(f209,plain,( 0.90/0.59 ( ! [X0,X1] : (happens(X0,X1) | ~sP1(X0,X1)) )), 0.90/0.59 inference(cnf_transformation,[],[f119])). 0.90/0.59 fof(f119,plain,( 0.90/0.59 ! [X0,X1] : ((sP1(X0,X1) | ~happens(X0,X1)) & (happens(X0,X1) | ~sP1(X0,X1)))), 0.90/0.59 inference(nnf_transformation,[],[f90])). 0.90/0.59 fof(f90,plain,( 0.90/0.59 ! [X0,X1] : (sP1(X0,X1) <=> happens(X0,X1))), 0.90/0.59 inference(definition_folding,[],[f64,f89,f88])). 0.90/0.59 fof(f88,plain,( 0.90/0.59 ! [X1,X0] : (sP0(X1,X0) <=> (n0 = X1 & push = X0))), 0.90/0.59 introduced(definition,[new_symbols(naming,[sP0])],[predicate_definition_introduction])). 0.90/0.59 fof(f64,plain,( 0.90/0.59 ! [X0,X1] : (((pull = X0 & n1 = X1) | (n2 = X1 & pull = X0) | (n2 = X1 & push = X0) | (n0 = X1 & push = X0)) <=> happens(X0,X1))), 0.90/0.59 inference(rectify,[],[f19])). 0.90/0.59 fof(f19,axiom,( 0.90/0.59 ! [X2,X1] : (((pull = X2 & n1 = X1) | (n2 = X1 & pull = X2) | (n2 = X1 & push = X2) | (n0 = X1 & push = X2)) <=> happens(X2,X1))), 0.90/0.59 file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown)). 0.90/0.59 fof(f2689,plain,( 0.90/0.59 ~happens(push,n2) | spl14_66), 0.90/0.59 inference(avatar_component_clause,[],[f2687])). 0.90/0.59 % SZS output end Proof for theBenchmark 0.90/0.59 % (1195943)------------------------------ 0.90/0.59 % (1195943)Version: Vampire 5.0.0 (Release build, commit 3ce9b74f2 on 2025-07-14 12:22:21 +0200) 0.90/0.59 % (1195943)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c 0.90/0.59 % (1195943)Termination reason: Refutation 0.90/0.59 0.90/0.59 % (1195943)Time elapsed: 0.053 s 0.90/0.59 % (1195943)Peak memory usage: 13 MB 0.90/0.59 % (1195943)Instructions burned: 86 (million) 0.90/0.59 % (1195943)------------------------------ 0.90/0.59 % (1195943)------------------------------ 0.90/0.59 % (1195931)Success in time 0.149 s 0.90/0.59 EOF