%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : DAT016_1 : TPTP v9.3.1. Bugfixed v5.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n010.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.19s 0.30s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : DAT016_1 : TPTP v9.3.1. Bugfixed v5.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19 % Computer : n010.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 00:05:48 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22 Running first-order model finding
% 0.08/0.22 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.19/0.30 % (2477858)Will run a generic schedule for satisfiability detection.
% 0.19/0.30 % (2477867)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4257516714:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.30 % (2477864)% WARNING: option uhcvi not known.
% 0.19/0.30 % (2477863)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2433914194_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.30 % (2477864)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1993315920:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.30 % (2477866)dis+10_1_sil=32000:sp=arity:random_seed=139847379:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.30 % (2477865)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3760934573:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.30 % (2477868)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3352995873:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.30 % (2477863)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.19/0.30 % (2477863)Terminated due to inappropriate strategy.
% 0.19/0.30 % (2477863)------------------------------
% 0.19/0.30 % (2477863)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.30 % (2477869)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3766812458:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.30 % (2477863)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.30 % (2477863)CaDiCaL version: 2.1.3
% 0.19/0.30 % (2477863)Termination reason: Inappropriate
% 0.19/0.30 % (2477863)Time elapsed: 0.0000 s
% 0.19/0.30 % (2477863)Peak memory usage: 10 MB
% 0.19/0.30 % (2477863)------------------------------
% 0.19/0.30 % (2477863)------------------------------
% 0.19/0.30 % (2477865) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2477858-2477865"...
% 0.19/0.30 % (2477865)...printing done.
% 0.19/0.30 % (2477877)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=136859359:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.19/0.30 % (2477865)Refutation found. Thanks to Tanya!
% 0.19/0.30 % SZS status Theorem for theBenchmark
% 0.19/0.30 % SZS output start Proof for theBenchmark
% 0.19/0.30 tff(type_def_5, type, array: $tType).
% 0.19/0.30 tff(func_def_0, type, read: (array * $int) > $int).
% 0.19/0.30 tff(func_def_1, type, write: (array * $int * $int) > array).
% 0.19/0.30 tff(func_def_12, type, sK0: array).
% 0.19/0.30 tff(f3,conjecture,(
% 0.19/0.30 ! [X0 : array] : (! [X1 : $int] : (($lesseq(20,X1) & $lesseq(X1,30)) => read(X0,X1) = $sum($product(2,X1),3)) => ? [X2 : $int] : read(X0,X2) = 53)),
% 0.19/0.30 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)).
% 0.19/0.30 tff(f4,negated_conjecture,(
% 0.19/0.30 ~ ! [X0 : array] : (! [X1 : $int] : (($lesseq(20,X1) & $lesseq(X1,30)) => read(X0,X1) = $sum($product(2,X1),3)) => ? [X2 : $int] : read(X0,X2) = 53)),
% 0.19/0.30 inference(negated_conjecture,[status(cth)],[f3])).
% 0.19/0.30 tff(f5,plain,(
% 0.19/0.30 ~ ! [X0 : array] : (! [X1 : $int] : ((~$less(X1,20) & ~$less(30,X1)) => read(X0,X1) = $sum($product(2,X1),3)) => ? [X2 : $int] : read(X0,X2) = 53)),
% 0.19/0.30 inference(theory_normalization,[],[f4])).
% 0.19/0.30 tff(f6,definition,(
% 0.19/0.30 ( ! [X0 : $int,X1 : $int] : ($sum(X0,X1) = $sum(X1,X0)) )),
% 0.19/0.30 introduced(theory,[tha_commutativity])).
% 0.19/0.30 tff(f11,definition,(
% 0.19/0.30 ( ! [X0 : $int] : (~$less(X0,X0)) )),
% 0.19/0.30 introduced(theory,[tha_non-reflexivity])).
% 0.19/0.30 tff(f12,definition,(
% 0.19/0.30 ( ! [X2 : $int,X0 : $int,X1 : $int] : (~$less(X1,X2) | ~$less(X0,X1) | $less(X0,X2)) )),
% 0.19/0.30 introduced(theory,[tha_transitivity])).
% 0.19/0.30 tff(f15,definition,(
% 0.19/0.30 ( ! [X0 : $int,X1 : $int] : ($less(X1,$sum(X0,1)) | $less(X0,X1)) )),
% 0.19/0.30 introduced(theory,[tha_order_plus_one_dichotomy])).
% 0.19/0.30 tff(f24,plain,(
% 0.19/0.30 ? [X0 : array] : (! [X2 : $int] : read(X0,X2) != 53 & ! [X1 : $int] : (read(X0,X1) = $sum($product(2,X1),3) | ($less(X1,20) | $less(30,X1))))),
% 0.19/0.30 inference(ennf_transformation,[],[f5])).
% 0.19/0.30 tff(f25,plain,(
% 0.19/0.30 ? [X0 : array] : (! [X2 : $int] : read(X0,X2) != 53 & ! [X1 : $int] : (read(X0,X1) = $sum($product(2,X1),3) | $less(X1,20) | $less(30,X1)))),
% 0.19/0.30 inference(flattening,[],[f24])).
% 0.19/0.30 tff(f26,plain,(
% 0.19/0.30 ? [X0 : array] : (! [X1 : $int] : read(X0,X1) != 53 & ! [X2 : $int] : (read(X0,X2) = $sum($product(2,X2),3) | $less(X2,20) | $less(30,X2)))),
% 0.19/0.30 inference(rectify,[],[f25])).
% 0.19/0.30 tff(f27,plain,(
% 0.19/0.30 ! [X1 : $int] : 53 != read(sK0,X1) & ! [X2 : $int] : ($sum($product(2,X2),3) = read(sK0,X2) | $less(X2,20) | $less(30,X2))),
% 0.19/0.30 inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f26])).
% 0.19/0.30 tff(f30,plain,(
% 0.19/0.30 ( ! [X2 : $int] : ($sum($product(2,X2),3) = read(sK0,X2) | $less(X2,20) | $less(30,X2)) )),
% 0.19/0.30 inference(cnf_transformation,[],[f27])).
% 0.19/0.30 tff(f31,plain,(
% 0.19/0.30 ( ! [X1 : $int] : (53 != read(sK0,X1)) )),
% 0.19/0.30 inference(cnf_transformation,[],[f27])).
% 0.19/0.30 tff(f90,plain,(
% 0.19/0.30 ( ! [X2 : $int] : ($less(30,X2) | $less(X2,20) | read(sK0,X2) = $sum(3,$product(2,X2))) )),
% 0.19/0.30 inference(forward_demodulation,[],[f30,f6])).
% 0.19/0.30 tff(f185,plain,(
% 0.19/0.30 ( ! [X0 : $int] : ($less(X0,$sum(X0,1))) )),
% 0.19/0.30 inference(resolution,[],[f15,f11])).
% 0.19/0.30 tff(f381,plain,(
% 0.19/0.30 ( ! [X0 : $int,X1 : $int] : ($less(X0,$sum(X1,1)) | ~$less(X0,X1)) )),
% 0.19/0.30 inference(resolution,[],[f12,f185])).
% 0.19/0.30 tff(f393,plain,(
% 0.19/0.30 ( ! [X0 : $int] : (~$less($sum(X0,1),X0)) )),
% 0.19/0.30 inference(resolution,[],[f381,f11])).
% 0.19/0.30 tff(f402,plain,(
% 0.19/0.30 ( ! [X0 : $int] : (~$less($sum($sum(X0,1),1),X0)) )),
% 0.19/0.30 inference(resolution,[],[f393,f381])).
% 0.19/0.30 tff(f413,plain,(
% 0.19/0.30 ( ! [X0 : $int] : (~$less($sum(1,$sum(X0,1)),X0)) )),
% 0.19/0.30 inference(forward_demodulation,[],[f402,f6])).
% 0.19/0.30 tff(f439,plain,(
% 0.19/0.30 ( ! [X0 : $int] : (~$less($sum(1,$sum($sum(X0,1),1)),X0)) )),
% 0.19/0.30 inference(resolution,[],[f413,f381])).
% 0.19/0.30 tff(f450,plain,(
% 0.19/0.30 ( ! [X0 : $int] : (~$less($sum(1,$sum(1,$sum(X0,1))),X0)) )),
% 0.19/0.30 inference(forward_demodulation,[],[f439,f6])).
% 0.19/0.30 tff(f564,plain,(
% 0.19/0.30 ( ! [X0 : $int] : (~$less($sum(1,$sum(1,$sum($sum(X0,1),1))),X0)) )),
% 0.19/0.30 inference(resolution,[],[f450,f381])).
% 0.19/0.30 tff(f575,plain,(
% 0.19/0.30 ( ! [X0 : $int] : (~$less($sum(1,$sum(1,$sum(1,$sum(X0,1)))),X0)) )),
% 0.19/0.30 inference(forward_demodulation,[],[f564,f6])).
% 0.19/0.30 tff(f631,plain,(
% 0.19/0.30 ( ! [X0 : $int] : (~$less($sum(1,$sum(1,$sum(1,$sum($sum(X0,1),1)))),X0)) )),
% 0.19/0.30 inference(resolution,[],[f575,f381])).
% 0.19/0.30 tff(f642,plain,(
% 0.19/0.30 ( ! [X0 : $int] : (~$less($sum(1,$sum(1,$sum(1,$sum(1,$sum(X0,1))))),X0)) )),
% 0.19/0.30 inference(forward_demodulation,[],[f631,f6])).
% 0.19/0.30 tff(f769,plain,(
% 0.19/0.30 $less(30,$sum(1,$sum(1,$sum(1,$sum(1,$sum(20,1)))))) | read(sK0,$sum(1,$sum(1,$sum(1,$sum(1,$sum(20,1)))))) = $sum(3,$product(2,$sum(1,$sum(1,$sum(1,$sum(1,$sum(20,1)))))))),
% 0.19/0.30 inference(resolution,[],[f642,f90])).
% 0.19/0.30 tff(f778,plain,(
% 0.19/0.30 53 = read(sK0,25)),
% 0.19/0.30 inference(evaluation,[],[f769])).
% 0.19/0.30 tff(f782,plain,(
% 0.19/0.30 $false),
% 0.19/0.30 inference(forward_subsumption_resolution,[],[f778,f31])).
% 0.19/0.30 % SZS output end Proof for theBenchmark
% 0.19/0.30 % (2477865)------------------------------
% 0.19/0.30 % (2477865)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.30 % (2477865)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.30 % (2477865)CaDiCaL version: 2.1.3
% 0.19/0.30 % (2477865)Termination reason: Refutation
% 0.19/0.30 % (2477865)Time elapsed: 0.019 s
% 0.19/0.30 % (2477865)Peak memory usage: 12 MB
% 0.19/0.30 % (2477865)Instructions burned: 26 (million)
% 0.19/0.30 % (2477858)Success in time 0.064 s
% 0.19/0.30 % Vampire exiting
%------------------------------------------------------------------------------