%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : DAT011_1 : TPTP v9.3.1. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n007.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 09:47:57 AM UTC 2026
% Result : Theorem 0.24s 0.35s
% Output : Refutation 0.24s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : DAT011_1 : TPTP v9.3.1. Released v5.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.23 % Computer : n007.cluster.edu
% 0.09/0.23 % Model : x86_64 x86_64
% 0.09/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.23 % Memory : 8046.5625MB
% 0.09/0.23 % OS : Linux 6.8.0-71-generic
% 0.09/0.23 % CPULimit : 300
% 0.09/0.23 % WCLimit : 300
% 0.09/0.23 % DateTime : Tue Sep 29 00:03:26 UTC 2026
% 0.09/0.23 % CPUTime :
% 0.09/0.23 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.27 Running first-order model finding
% 0.09/0.27 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.24/0.35 % (2984897)Will run a generic schedule for satisfiability detection.
% 0.24/0.35 % (2984905)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1861424664:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.24/0.35 % (2984907)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3912923270:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 0.24/0.35 % (2984904)% WARNING: option uhcvi not known.
% 0.24/0.35 % (2984909)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2075046919:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 0.24/0.35 % (2984904)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1811376050:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 0.24/0.35 % (2984908)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3072373602:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.24/0.35 % (2984903)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1948233736_3000 on theBenchmark for (3000ds/0Mi)
% 0.24/0.35 % (2984903)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.24/0.35 % (2984903)Terminated due to inappropriate strategy.
% 0.24/0.35 % (2984903)------------------------------
% 0.24/0.35 % (2984903)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.24/0.35 % (2984903)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.24/0.35 % (2984903)CaDiCaL version: 2.1.3
% 0.24/0.35 % (2984903)Termination reason: Inappropriate
% 0.24/0.35 % (2984903)Time elapsed: 0.0000 s
% 0.24/0.35 % (2984903)Peak memory usage: 9 MB
% 0.24/0.35 % (2984906)dis+10_1_sil=32000:sp=arity:random_seed=1799712315:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 0.24/0.35 % (2984903)------------------------------
% 0.24/0.35 % (2984903)------------------------------
% 0.24/0.35 % (2984917)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2449846771:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.24/0.35 % (2984917)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.24/0.35 % (2984917)Terminated due to inappropriate strategy.
% 0.24/0.35 % (2984917)------------------------------
% 0.24/0.35 % (2984917)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.24/0.35 % (2984917)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.24/0.35 % (2984917)CaDiCaL version: 2.1.3
% 0.24/0.35 % (2984917)Termination reason: Inappropriate
% 0.24/0.35 % (2984917)Time elapsed: 0.0000 s
% 0.24/0.35 % (2984917)Peak memory usage: 10 MB
% 0.24/0.35 % (2984917)------------------------------
% 0.24/0.35 % (2984917)------------------------------
% 0.24/0.35 % (2984906) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2984897-2984906"...
% 0.24/0.35 % (2984904) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2984897-2984904"...
% 0.24/0.35 % (2984906)...printing done.
% 0.24/0.35 % (2984906)Refutation found. Thanks to Tanya!
% 0.24/0.35 % SZS status Theorem for theBenchmark
% 0.24/0.35 % SZS output start Proof for theBenchmark
% 0.24/0.35 tff(type_def_5, type, array: $tType).
% 0.24/0.35 tff(func_def_0, type, read: (array * $int) > $int).
% 0.24/0.35 tff(func_def_1, type, write: (array * $int * $int) > array).
% 0.24/0.35 tff(func_def_7, type, sK0: array).
% 0.24/0.35 tff(func_def_8, type, sK1: array).
% 0.24/0.35 tff(func_def_9, type, sK2: $int).
% 0.24/0.35 tff(func_def_10, type, sK3: $int).
% 0.24/0.35 tff(func_def_11, type, sK4: $int).
% 0.24/0.35 tff(f1,axiom,(
% 0.24/0.35 ! [X0 : array,X1 : $int,X2 : $int] : read(write(X0,X1,X2),X1) = X2),
% 0.24/0.35 file('/export/starexec/sandbox2/benchmark/Axioms/DAT001_0.ax',ax1)).
% 0.24/0.35 tff(f2,axiom,(
% 0.24/0.35 ! [X0 : array,X1 : $int,X2 : $int,X3 : $int] : (X1 = X2 | read(write(X0,X1,X3),X2) = read(X0,X2))),
% 0.24/0.35 file('/export/starexec/sandbox2/benchmark/Axioms/DAT001_0.ax',ax2)).
% 0.24/0.35 tff(f3,conjecture,(
% 0.24/0.35 ! [X0 : array,X1 : array,X2 : $int,X3 : $int] : ((! [X4 : $int] : (($lesseq(X2,X4) & $lesseq(X4,X3)) => $greater(read(X1,X4),0)) & X0 = write(X1,$sum(X3,1),3)) => ! [X5 : $int] : (($lesseq(X2,X5) & $lesseq(X5,$sum(X3,1))) => $greater(read(X0,X5),0)))),
% 0.24/0.35 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)).
% 0.24/0.35 tff(f4,negated_conjecture,(
% 0.24/0.35 ~ ! [X0 : array,X1 : array,X2 : $int,X3 : $int] : ((! [X4 : $int] : (($lesseq(X2,X4) & $lesseq(X4,X3)) => $greater(read(X1,X4),0)) & X0 = write(X1,$sum(X3,1),3)) => ! [X5 : $int] : (($lesseq(X2,X5) & $lesseq(X5,$sum(X3,1))) => $greater(read(X0,X5),0)))),
% 0.24/0.35 inference(negated_conjecture,[status(cth)],[f3])).
% 0.24/0.35 tff(f5,plain,(
% 0.24/0.35 ~ ! [X0 : array,X1 : array,X2 : $int,X3 : $int] : ((! [X4 : $int] : ((~$less(X4,X2) & ~$less(X3,X4)) => $less(0,read(X1,X4))) & X0 = write(X1,$sum(X3,1),3)) => ! [X5 : $int] : ((~$less(X5,X2) & ~$less($sum(X3,1),X5)) => $less(0,read(X0,X5))))),
% 0.24/0.35 inference(theory_normalization,[],[f4])).
% 0.24/0.35 tff(f6,definition,(
% 0.24/0.35 ( ! [X0 : $int,X1 : $int] : ($sum(X0,X1) = $sum(X1,X0)) )),
% 0.24/0.35 introduced(theory,[tha_commutativity])).
% 0.24/0.35 tff(f13,definition,(
% 0.24/0.35 ( ! [X0 : $int,X1 : $int] : ($less(X1,X0) | $less(X0,X1) | X0 = X1) )),
% 0.24/0.35 introduced(theory,[tha_order_totality])).
% 0.24/0.35 tff(f17,definition,(
% 0.24/0.35 ( ! [X0 : $int,X1 : $int] : (~$less(X1,$sum(X0,1)) | ~$less(X0,X1)) )),
% 0.24/0.35 introduced(theory,[tha_extra_integer_ordering])).
% 0.24/0.35 tff(f18,plain,(
% 0.24/0.35 ? [X0 : array,X1 : array,X2 : $int,X3 : $int] : (? [X5 : $int] : (~$less(0,read(X0,X5)) & (~$less(X5,X2) & ~$less($sum(X3,1),X5))) & (! [X4 : $int] : ($less(0,read(X1,X4)) | ($less(X4,X2) | $less(X3,X4))) & X0 = write(X1,$sum(X3,1),3)))),
% 0.24/0.35 inference(ennf_transformation,[],[f5])).
% 0.24/0.35 tff(f19,plain,(
% 0.24/0.35 ? [X0 : array,X1 : array,X2 : $int,X3 : $int] : (? [X5 : $int] : (~$less(0,read(X0,X5)) & ~$less(X5,X2) & ~$less($sum(X3,1),X5)) & ! [X4 : $int] : ($less(0,read(X1,X4)) | $less(X4,X2) | $less(X3,X4)) & X0 = write(X1,$sum(X3,1),3))),
% 0.24/0.35 inference(flattening,[],[f18])).
% 0.24/0.35 tff(f20,plain,(
% 0.24/0.35 ? [X0 : array,X1 : array,X2 : $int,X3 : $int] : (? [X4 : $int] : (~$less(0,read(X0,X4)) & ~$less(X4,X2) & ~$less($sum(X3,1),X4)) & ! [X5 : $int] : ($less(0,read(X1,X5)) | $less(X5,X2) | $less(X3,X5)) & X0 = write(X1,$sum(X3,1),3))),
% 0.24/0.35 inference(rectify,[],[f19])).
% 0.24/0.35 tff(f21,plain,(
% 0.24/0.35 (~$less(0,read(sK0,sK4)) & ~$less(sK4,sK2) & ~$less($sum(sK3,1),sK4)) & ! [X5 : $int] : ($less(0,read(sK1,X5)) | $less(X5,sK2) | $less(sK3,X5)) & sK0 = write(sK1,$sum(sK3,1),3)),
% 0.24/0.35 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4)],[f20])).
% 0.24/0.35 tff(f22,plain,(
% 0.24/0.35 ( ! [X2 : $int,X0 : array,X1 : $int] : (read(write(X0,X1,X2),X1) = X2) )),
% 0.24/0.35 inference(cnf_transformation,[],[f1])).
% 0.24/0.35 tff(f23,plain,(
% 0.24/0.35 ( ! [X2 : $int,X3 : $int,X0 : array,X1 : $int] : (read(write(X0,X1,X3),X2) = read(X0,X2) | X1 = X2) )),
% 0.24/0.35 inference(cnf_transformation,[],[f2])).
% 0.24/0.35 tff(f24,plain,(
% 0.24/0.35 sK0 = write(sK1,$sum(sK3,1),3)),
% 0.24/0.35 inference(cnf_transformation,[],[f21])).
% 0.24/0.35 tff(f25,plain,(
% 0.24/0.35 ( ! [X5 : $int] : ($less(0,read(sK1,X5)) | $less(X5,sK2) | $less(sK3,X5)) )),
% 0.24/0.35 inference(cnf_transformation,[],[f21])).
% 0.24/0.35 tff(f26,plain,(
% 0.24/0.35 ~$less($sum(sK3,1),sK4)),
% 0.24/0.35 inference(cnf_transformation,[],[f21])).
% 0.24/0.35 tff(f27,plain,(
% 0.24/0.35 ~$less(sK4,sK2)),
% 0.24/0.35 inference(cnf_transformation,[],[f21])).
% 0.24/0.35 tff(f28,plain,(
% 0.24/0.35 ~$less(0,read(sK0,sK4))),
% 0.24/0.35 inference(cnf_transformation,[],[f21])).
% 0.24/0.35 tff(f42,plain,(
% 0.24/0.35 ( ! [X0 : $int,X1 : $int] : (~$less(X1,$sum(1,X0)) | ~$less(X0,X1)) )),
% 0.24/0.35 inference(superposition,[],[f17,f6])).
% 0.24/0.35 tff(f44,plain,(
% 0.24/0.35 3 = read(sK0,$sum(sK3,1))),
% 0.24/0.35 inference(superposition,[],[f22,f24])).
% 0.24/0.35 tff(f46,plain,(
% 0.24/0.35 3 = read(sK0,$sum(1,sK3))),
% 0.24/0.35 inference(forward_demodulation,[],[f44,f6])).
% 0.24/0.35 tff(f51,plain,(
% 0.24/0.35 $less(sK4,$sum(sK3,1)) | sK4 = $sum(sK3,1)),
% 0.24/0.35 inference(resolution,[],[f13,f26])).
% 0.24/0.35 tff(f70,definition,(
% 0.24/0.35 spl5_3 <=> sK4 = $sum(1,sK3)),
% 0.24/0.35 introduced(definition,[new_symbols(definition,[spl5_3])],[avatar_definition])).
% 0.24/0.35 tff(f71,plain,(
% 0.24/0.35 sK4 != $sum(1,sK3) | spl5_3),
% 0.24/0.35 inference(avatar_component_clause,[],[f70])).
% 0.24/0.35 tff(f72,plain,(
% 0.24/0.35 sK4 = $sum(1,sK3) | ~spl5_3),
% 0.24/0.35 inference(avatar_component_clause,[],[f70])).
% 0.24/0.35 tff(f74,definition,(
% 0.24/0.35 spl5_4 <=> $less(sK4,$sum(1,sK3))),
% 0.24/0.35 introduced(definition,[new_symbols(definition,[spl5_4])],[avatar_definition])).
% 0.24/0.35 tff(f76,plain,(
% 0.24/0.35 $less(sK4,$sum(1,sK3)) | ~spl5_4),
% 0.24/0.35 inference(avatar_component_clause,[],[f74])).
% 0.24/0.35 tff(f81,plain,(
% 0.24/0.35 $less(sK4,$sum(1,sK3)) | sK4 = $sum(sK3,1)),
% 0.24/0.35 inference(forward_demodulation,[],[f51,f6])).
% 0.24/0.35 tff(f83,plain,(
% 0.24/0.35 sK4 = $sum(1,sK3) | $less(sK4,$sum(1,sK3))),
% 0.24/0.35 inference(forward_demodulation,[],[f81,f6])).
% 0.24/0.35 tff(f85,plain,(
% 0.24/0.35 spl5_4 | spl5_3),
% 0.24/0.35 inference(avatar_split_clause,[],[f83,f70,f74])).
% 0.24/0.35 tff(f99,plain,(
% 0.24/0.35 3 = read(sK0,sK4) | ~spl5_3),
% 0.24/0.35 inference(superposition,[],[f46,f72])).
% 0.24/0.35 tff(f119,plain,(
% 0.24/0.35 ~$less(0,3) | ~spl5_3),
% 0.24/0.35 inference(superposition,[],[f28,f99])).
% 0.24/0.35 tff(f120,plain,(
% 0.24/0.35 $false | ~spl5_3),
% 0.24/0.35 inference(evaluation,[],[f119])).
% 0.24/0.35 tff(f121,plain,(
% 0.24/0.35 ~spl5_3),
% 0.24/0.35 inference(avatar_contradiction_clause,[],[f120])).
% 0.24/0.35 tff(f143,plain,(
% 0.24/0.35 ( ! [X0 : $int] : (read(sK1,X0) = read(sK0,X0) | $sum(sK3,1) = X0) )),
% 0.24/0.35 inference(superposition,[],[f23,f24])).
% 0.24/0.35 tff(f145,plain,(
% 0.24/0.35 ( ! [X0 : $int] : (read(sK1,X0) = read(sK0,X0) | $sum(1,sK3) = X0) )),
% 0.24/0.35 inference(forward_demodulation,[],[f143,f6])).
% 0.24/0.35 tff(f149,plain,(
% 0.24/0.35 ( ! [X0 : $int] : ($less(0,read(sK0,X0)) | $less(X0,sK2) | $less(sK3,X0) | $sum(1,sK3) = X0) )),
% 0.24/0.35 inference(superposition,[],[f25,f145])).
% 0.24/0.35 tff(f212,plain,(
% 0.24/0.35 ~$less(sK3,sK4) | ~spl5_4),
% 0.24/0.35 inference(resolution,[],[f42,f76])).
% 0.24/0.35 tff(f1238,plain,(
% 0.24/0.35 $less(sK4,sK2) | $less(sK3,sK4) | sK4 = $sum(1,sK3)),
% 0.24/0.35 inference(resolution,[],[f149,f28])).
% 0.24/0.35 tff(f1242,plain,(
% 0.24/0.35 $less(sK3,sK4) | sK4 = $sum(1,sK3)),
% 0.24/0.35 inference(forward_subsumption_resolution,[],[f1238,f27])).
% 0.24/0.35 tff(f1243,plain,(
% 0.24/0.35 sK4 = $sum(1,sK3) | ~spl5_4),
% 0.24/0.35 inference(forward_subsumption_resolution,[],[f1242,f212])).
% 0.24/0.35 tff(f1244,plain,(
% 0.24/0.35 $false | (spl5_3 | ~spl5_4)),
% 0.24/0.35 inference(forward_subsumption_resolution,[],[f1243,f71])).
% 0.24/0.35 tff(f1245,plain,(
% 0.24/0.35 spl5_3 | ~spl5_4),
% 0.24/0.35 inference(avatar_contradiction_clause,[],[f1244])).
% 0.24/0.35 cnf(s6, plain, spl5_3 | spl5_4, inference(sat_conversion,[],[f85])).
% 0.24/0.35 cnf(s7, plain, ~spl5_3, inference(sat_conversion,[],[f121])).
% 0.24/0.35 cnf(s24, plain, spl5_3 | ~spl5_4, inference(sat_conversion,[],[f1245])).
% 0.24/0.35 cnf(s25, plain, ~spl5_4, inference(rat,[],[s24,s7])).
% 0.24/0.35 cnf(s26, plain, $false, inference(rat,[],[s6,s25,s7])).
% 0.24/0.35 tff(f1246,plain,(
% 0.24/0.35 $false),
% 0.24/0.35 inference(avatar_sat_refutation,[],[s26])).
% 0.24/0.35 % SZS output end Proof for theBenchmark
% 0.24/0.35 % (2984906)------------------------------
% 0.24/0.35 % (2984906)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.24/0.35 % (2984906)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.24/0.35 % (2984906)CaDiCaL version: 2.1.3
% 0.24/0.35 % (2984906)Termination reason: Refutation
% 0.24/0.35 % (2984906)Time elapsed: 0.035 s
% 0.24/0.35 % (2984906)Peak memory usage: 13 MB
% 0.24/0.35 % (2984906)Instructions burned: 53 (million)
% 0.24/0.35 % (2984897)Success in time 0.068 s
% 0.24/0.35 % Vampire exiting
%------------------------------------------------------------------------------