0.00/0.03	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.05	% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 180 THM
0.11/0.39	% Computer : n023.cluster.edu
0.11/0.39	% Model    : x86_64 x86_64
0.11/0.39	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.39	% Memory   : 8046.5625MB
0.11/0.39	% OS       : Linux 6.8.0-71-generic
0.11/0.39	% CPULimit : 1440
0.11/0.39	% WCLimit  : 180
0.11/0.39	% DateTime : Mon Jul 27 09:23:07 UTC 2026
0.11/0.39	% CPUTime  : 
0.11/0.39	Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 180 THM
0.11/0.43	Running first-order theorem proving
0.11/0.43	Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 180 /export/starexec/sandbox2/benchmark/theBenchmark.p
0.19/1.50	% (698714)Detected formulas, will run a generic FOF schedule.
0.19/1.50	% (698721)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=4054274205:i=141695:sd=1:nm=32:gsp=on:ss=included_1799 on theBenchmark for (1799ds/141695Mi)
0.19/1.50	% (698722)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1897197308:i=109:sd=1:ins=1:gsp=on:ss=axioms_1799 on theBenchmark for (1799ds/109Mi)
0.19/1.50	% (698720)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=3340859464:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_1799 on theBenchmark for (1799ds/134677Mi)
0.19/1.50	% (698719)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=889356608:i=141193_1799 on theBenchmark for (1799ds/141193Mi)
0.19/1.50	% (698725)dis-21_1_sil=8000:lcm=predicate:random_seed=1053745987:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_1799 on theBenchmark for (1799ds/129Mi)
0.19/1.50	% (698724)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=755494995:s2a=on:i=139:gtg=position_1799 on theBenchmark for (1799ds/139Mi)
0.19/1.50	% (698724)First to succeed.
0.19/1.50	% (698724)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-698714"
0.19/1.50	% (698722)Also succeeded, but the first one will report.
0.19/1.50	% (698723)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1377846401:i=119:av=off:ss=axioms_1799 on theBenchmark for (1799ds/119Mi)
0.19/1.50	% (698723)Also succeeded, but the first one will report.
0.19/1.50	% (698725)Instruction limit reached! 
0.19/1.50	% (698725)------------------------------
0.19/1.50	% (698725)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
0.19/1.50	% (698725)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
0.19/1.50	% (698725)CaDiCaL version: 2.1.3
0.19/1.50	% (698725)Termination reason: Instruction limit
0.19/1.50	% (698725)Termination phase: Saturation
0.19/1.50	% (698725)Time elapsed: 0.080 s
0.19/1.50	% (698725)Peak memory usage: 89 MB
0.19/1.50	% (698725)Instructions burned: 130 (million)
0.19/1.50	% (698733)lrs+10_1_sil=8000:sp=occurrence:random_seed=115246155:i=285:sd=3:ss=axioms:sgt=8_1797 on theBenchmark for (1797ds/285Mi)
0.19/1.50	% (698733)Also succeeded, but the first one will report.
0.19/1.50	% (698724)Refutation found. Thanks to Tanya!
0.19/1.50	% SZS status Theorem for theBenchmark
0.19/1.50	% SZS output start Proof for theBenchmark
0.19/1.50	fof(f1,conjecture,(
0.19/1.50	  ! [X0,X1] : ((int_leq(X0,n) & int_leq(X1,X0) & int_leq(int_one,X1)) => (X1 = X0 => a(X0,X1) != real_zero))),
0.19/1.50	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',uti)).
0.19/1.50	fof(f2,negated_conjecture,(
0.19/1.50	  ~! [X0,X1] : ((int_leq(X0,n) & int_leq(X1,X0) & int_leq(int_one,X1)) => (X1 = X0 => a(X0,X1) != real_zero))),
0.19/1.50	  inference(negated_conjecture,[status(cth)],[f1])).
0.19/1.50	fof(f6,axiom,(
0.19/1.50	  ! [X0,X1] : ((int_leq(X0,n) & int_leq(int_one,X1) & int_leq(X1,n) & int_leq(int_one,X0)) => (! [X2] : ((int_leq(int_one,X2) & int_leq(X2,X1)) => a(X2,X2) = real_one) & ! [X3] : ((int_less(int_zero,X3) & X1 = plus(X0,X3)) => ! [X2] : ((int_leq(int_one,X2) & int_leq(X2,X0)) => a(X2,plus(X2,X3)) = real_zero)) & ! [X3] : ((plus(X1,X3) = X0 & int_less(int_zero,X3)) => ! [X2] : ((int_leq(int_one,X2) & int_leq(X2,X1)) => real_zero = a(plus(X2,X3),X2)))))),
0.19/1.50	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',qii)).
0.19/1.50	fof(f11,axiom,(
0.19/1.50	  real_one != real_zero),
0.19/1.50	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',real_constants)).
0.19/1.50	fof(f15,plain,(
0.19/1.50	  ! [X0,X1] : ((int_leq(X0,n) & int_leq(int_one,X1) & int_leq(X1,n) & int_leq(int_one,X0)) => (! [X2] : ((int_leq(int_one,X2) & int_leq(X2,X1)) => a(X2,X2) = real_one) & ! [X3] : ((int_less(int_zero,X3) & X1 = plus(X0,X3)) => ! [X4] : ((int_leq(int_one,X4) & int_leq(X4,X0)) => real_zero = a(X4,plus(X4,X3)))) & ! [X5] : ((plus(X1,X5) = X0 & int_less(int_zero,X5)) => ! [X6] : ((int_leq(int_one,X6) & int_leq(X6,X1)) => real_zero = a(plus(X6,X5),X6)))))),
0.19/1.50	  inference(rectify,[],[f6])).
0.19/1.50	fof(f16,plain,(
0.19/1.50	  ? [X0,X1] : ((a(X0,X1) = real_zero & X1 = X0) & (int_leq(X0,n) & int_leq(X1,X0) & int_leq(int_one,X1)))),
0.19/1.50	  inference(ennf_transformation,[],[f2])).
0.19/1.50	fof(f17,plain,(
0.19/1.50	  ? [X0,X1] : (a(X0,X1) = real_zero & X1 = X0 & int_leq(X0,n) & int_leq(X1,X0) & int_leq(int_one,X1))),
0.19/1.50	  inference(flattening,[],[f16])).
0.19/1.50	fof(f20,plain,(
0.19/1.50	  ! [X0,X1] : ((! [X2] : (a(X2,X2) = real_one | (~int_leq(int_one,X2) | ~int_leq(X2,X1))) & ! [X3] : (! [X4] : (real_zero = a(X4,plus(X4,X3)) | (~int_leq(int_one,X4) | ~int_leq(X4,X0))) | (~int_less(int_zero,X3) | plus(X0,X3) != X1)) & ! [X5] : (! [X6] : (real_zero = a(plus(X6,X5),X6) | (~int_leq(int_one,X6) | ~int_leq(X6,X1))) | (plus(X1,X5) != X0 | ~int_less(int_zero,X5)))) | (~int_leq(X0,n) | ~int_leq(int_one,X1) | ~int_leq(X1,n) | ~int_leq(int_one,X0)))),
0.19/1.50	  inference(ennf_transformation,[],[f15])).
0.19/1.50	fof(f21,plain,(
0.19/1.50	  ! [X0,X1] : ((! [X2] : (a(X2,X2) = real_one | ~int_leq(int_one,X2) | ~int_leq(X2,X1)) & ! [X3] : (! [X4] : (real_zero = a(X4,plus(X4,X3)) | ~int_leq(int_one,X4) | ~int_leq(X4,X0)) | ~int_less(int_zero,X3) | plus(X0,X3) != X1) & ! [X5] : (! [X6] : (real_zero = a(plus(X6,X5),X6) | ~int_leq(int_one,X6) | ~int_leq(X6,X1)) | plus(X1,X5) != X0 | ~int_less(int_zero,X5))) | ~int_leq(X0,n) | ~int_leq(int_one,X1) | ~int_leq(X1,n) | ~int_leq(int_one,X0))),
0.19/1.50	  inference(flattening,[],[f20])).
0.19/1.50	fof(f25,plain,(
0.19/1.50	  real_zero = a(sK0,sK1) & sK0 = sK1 & int_leq(sK0,n) & int_leq(sK1,sK0) & int_leq(int_one,sK1)),
0.19/1.50	  inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f17])).
0.19/1.50	fof(f32,plain,(
0.19/1.50	  int_leq(int_one,sK1)),
0.19/1.50	  inference(cnf_transformation,[],[f25])).
0.19/1.50	fof(f33,plain,(
0.19/1.50	  int_leq(sK1,sK0)),
0.19/1.50	  inference(cnf_transformation,[],[f25])).
0.19/1.50	fof(f34,plain,(
0.19/1.50	  int_leq(sK0,n)),
0.19/1.50	  inference(cnf_transformation,[],[f25])).
0.19/1.50	fof(f35,plain,(
0.19/1.50	  sK0 = sK1),
0.19/1.50	  inference(cnf_transformation,[],[f25])).
0.19/1.50	fof(f36,plain,(
0.19/1.50	  real_zero = a(sK0,sK1)),
0.19/1.50	  inference(cnf_transformation,[],[f25])).
0.19/1.50	fof(f42,plain,(
0.19/1.50	  ( ! [X2,X0,X1] : (a(X2,X2) = real_one | ~int_leq(int_one,X2) | ~int_leq(X2,X1) | ~int_leq(X0,n) | ~int_leq(int_one,X1) | ~int_leq(X1,n) | ~int_leq(int_one,X0)) )),
0.19/1.50	  inference(cnf_transformation,[],[f21])).
0.19/1.50	fof(f50,plain,(
0.19/1.50	  real_zero != real_one),
0.19/1.50	  inference(cnf_transformation,[],[f11])).
0.19/1.50	fof(f62,definition,(
0.19/1.50	  spl3_1 <=> ! [X0] : (~int_leq(X0,n) | ~int_leq(int_one,X0))),
0.19/1.50	  introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition])).
0.19/1.50	fof(f63,plain,(
0.19/1.50	  ( ! [X0] : (~int_leq(X0,n) | ~int_leq(int_one,X0)) ) | ~spl3_1),
0.19/1.50	  inference(avatar_component_clause,[],[f62])).
0.19/1.50	fof(f65,definition,(
0.19/1.50	  spl3_2 <=> ! [X2,X1] : (a(X2,X2) = real_one | ~int_leq(X1,n) | ~int_leq(int_one,X1) | ~int_leq(X2,X1) | ~int_leq(int_one,X2))),
0.19/1.50	  introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition])).
0.19/1.50	fof(f66,plain,(
0.19/1.50	  ( ! [X2,X1] : (a(X2,X2) = real_one | ~int_leq(X1,n) | ~int_leq(int_one,X1) | ~int_leq(X2,X1) | ~int_leq(int_one,X2)) ) | ~spl3_2),
0.19/1.50	  inference(avatar_component_clause,[],[f65])).
0.19/1.50	fof(f67,plain,(
0.19/1.50	  spl3_1 | spl3_2),
0.19/1.50	  inference(avatar_split_clause,[],[f42,f65,f62])).
0.19/1.50	fof(f68,plain,(
0.19/1.50	  int_leq(sK0,sK0)),
0.19/1.50	  inference(superposition,[],[f33,f35])).
0.19/1.50	fof(f69,plain,(
0.19/1.50	  int_leq(int_one,sK0)),
0.19/1.50	  inference(superposition,[],[f32,f35])).
0.19/1.50	fof(f70,plain,(
0.19/1.50	  real_zero = a(sK0,sK0)),
0.19/1.50	  inference(forward_demodulation,[],[f36,f35])).
0.19/1.50	fof(f113,plain,(
0.19/1.50	  ( ! [X0] : (real_zero = real_one | ~int_leq(X0,n) | ~int_leq(int_one,X0) | ~int_leq(sK0,X0) | ~int_leq(int_one,sK0)) ) | ~spl3_2),
0.19/1.50	  inference(superposition,[],[f70,f66])).
0.19/1.50	fof(f114,plain,(
0.19/1.50	  ( ! [X0] : (~int_leq(X0,n) | ~int_leq(int_one,X0) | ~int_leq(sK0,X0) | ~int_leq(int_one,sK0)) ) | ~spl3_2),
0.19/1.50	  inference(forward_subsumption_resolution,[],[f113,f50])).
0.19/1.50	fof(f116,plain,(
0.19/1.50	  ( ! [X0] : (~int_leq(sK0,X0) | ~int_leq(int_one,X0) | ~int_leq(X0,n)) ) | ~spl3_2),
0.19/1.50	  inference(forward_subsumption_resolution,[],[f114,f69])).
0.19/1.50	fof(f119,plain,(
0.19/1.50	  ~int_leq(int_one,sK0) | ~int_leq(sK0,n) | ~spl3_2),
0.19/1.50	  inference(resolution,[],[f116,f68])).
0.19/1.50	fof(f124,plain,(
0.19/1.50	  ~int_leq(sK0,n) | ~spl3_2),
0.19/1.50	  inference(forward_subsumption_resolution,[],[f119,f69])).
0.19/1.50	fof(f128,plain,(
0.19/1.50	  $false | ~spl3_2),
0.19/1.50	  inference(forward_subsumption_resolution,[],[f124,f34])).
0.19/1.50	fof(f129,plain,(
0.19/1.50	  ~spl3_2),
0.19/1.50	  inference(avatar_contradiction_clause,[],[f128])).
0.19/1.50	fof(f134,plain,(
0.19/1.50	  ~int_leq(int_one,sK0) | ~spl3_1),
0.19/1.50	  inference(resolution,[],[f63,f34])).
0.19/1.50	fof(f135,plain,(
0.19/1.50	  $false | ~spl3_1),
0.19/1.50	  inference(forward_subsumption_resolution,[],[f134,f69])).
0.19/1.50	fof(f136,plain,(
0.19/1.50	  ~spl3_1),
0.19/1.50	  inference(avatar_contradiction_clause,[],[f135])).
0.19/1.50	cnf(s1, plain, spl3_1 | spl3_2, inference(sat_conversion,[],[f67])).
0.19/1.50	cnf(s3, plain, ~spl3_2, inference(sat_conversion,[],[f129])).
0.19/1.50	cnf(s4, plain, ~spl3_1, inference(sat_conversion,[],[f136])).
0.19/1.50	cnf(s5, plain, $false, inference(rat,[],[s1,s3,s4])).
0.19/1.50	fof(f138,plain,(
0.19/1.50	  $false),
0.19/1.50	  inference(avatar_sat_refutation,[],[s5])).
0.19/1.50	% SZS output end Proof for theBenchmark
0.19/1.50	% (698724)------------------------------
0.19/1.50	% (698724)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
0.19/1.50	% (698724)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
0.19/1.50	% (698724)CaDiCaL version: 2.1.3
0.19/1.50	% (698724)Termination reason: Refutation
0.19/1.50	% (698724)Time elapsed: 0.005 s
0.19/1.50	% (698724)Peak memory usage: 89 MB
0.19/1.50	% (698724)Instructions burned: 5 (million)
0.19/1.50	% (698724)------------------------------
0.19/1.50	% (698724)------------------------------
0.19/1.50	% (698714)Success in time 0.442 s
0.19/1.50	% Vampire exiting
0.19/1.50	EOF