%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : DAT013_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 : n013.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.29s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : DAT013_1 : TPTP v9.3.1. Released v5.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19 % Computer : n013.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:04:52 UTC 2026
% 0.08/0.20 % CPUTime :
% 0.08/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.23 Running first-order model finding
% 0.08/0.23 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.29 % (1708749)Will run a generic schedule for satisfiability detection.
% 0.19/0.29 % (1708757)dis+10_1_sil=32000:sp=arity:random_seed=2317104008:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.29 % (1708755)% WARNING: option uhcvi not known.
% 0.19/0.29 % (1708754)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2913615245_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.29 % (1708754)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.19/0.29 % (1708754)Terminated due to inappropriate strategy.
% 0.19/0.29 % (1708754)------------------------------
% 0.19/0.29 % (1708754)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.29 % (1708754)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.29 % (1708754)CaDiCaL version: 2.1.3
% 0.19/0.29 % (1708754)Termination reason: Inappropriate
% 0.19/0.29 % (1708754)Time elapsed: 0.0000 s
% 0.19/0.29 % (1708754)Peak memory usage: 10 MB
% 0.19/0.29 % (1708755)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3995519140:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.29 % (1708756)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2916481988:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.29 % (1708758)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=509377915:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.29 % (1708759)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=978616806:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.29 % (1708760)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3841214078:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.29 % (1708754)------------------------------
% 0.19/0.29 % (1708754)------------------------------
% 0.19/0.29 % (1708758) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1708749-1708758"...
% 0.19/0.29 % (1708758)...printing done.
% 0.19/0.29 % (1708758)Refutation found. Thanks to Tanya!
% 0.19/0.29 % SZS status Theorem for theBenchmark
% 0.19/0.29 % SZS output start Proof for theBenchmark
% 0.19/0.29 tff(type_def_5, type, array: $tType).
% 0.19/0.29 tff(func_def_0, type, read: (array * $int) > $int).
% 0.19/0.29 tff(func_def_1, type, write: (array * $int * $int) > array).
% 0.19/0.29 tff(func_def_7, type, sK0: array).
% 0.19/0.29 tff(func_def_8, type, sK1: $int).
% 0.19/0.29 tff(func_def_9, type, sK2: $int).
% 0.19/0.29 tff(func_def_10, type, sK3: $int).
% 0.19/0.29 tff(f3,conjecture,(
% 0.19/0.29 ! [X0 : array,X1 : $int,X2 : $int] : (! [X3 : $int] : (($lesseq(X1,X3) & $lesseq(X3,X2)) => $greater(read(X0,X3),0)) => ! [X4 : $int] : (($lesseq($sum(X1,3),X4) & $lesseq(X4,X2)) => $greater(read(X0,X4),0)))),
% 0.19/0.29 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)).
% 0.19/0.29 tff(f4,negated_conjecture,(
% 0.19/0.29 ~ ! [X0 : array,X1 : $int,X2 : $int] : (! [X3 : $int] : (($lesseq(X1,X3) & $lesseq(X3,X2)) => $greater(read(X0,X3),0)) => ! [X4 : $int] : (($lesseq($sum(X1,3),X4) & $lesseq(X4,X2)) => $greater(read(X0,X4),0)))),
% 0.19/0.29 inference(negated_conjecture,[status(cth)],[f3])).
% 0.19/0.29 tff(f5,plain,(
% 0.19/0.29 ~ ! [X0 : array,X1 : $int,X2 : $int] : (! [X3 : $int] : ((~$less(X3,X1) & ~$less(X2,X3)) => $less(0,read(X0,X3))) => ! [X4 : $int] : ((~$less(X4,$sum(X1,3)) & ~$less(X2,X4)) => $less(0,read(X0,X4))))),
% 0.19/0.29 inference(theory_normalization,[],[f4])).
% 0.19/0.29 tff(f6,definition,(
% 0.19/0.29 ( ! [X0 : $int,X1 : $int] : ($sum(X0,X1) = $sum(X1,X0)) )),
% 0.19/0.29 introduced(theory,[tha_commutativity])).
% 0.19/0.29 tff(f11,definition,(
% 0.19/0.29 ( ! [X0 : $int] : (~$less(X0,X0)) )),
% 0.19/0.29 introduced(theory,[tha_non-reflexivity])).
% 0.19/0.29 tff(f12,definition,(
% 0.19/0.29 ( ! [X2 : $int,X0 : $int,X1 : $int] : (~$less(X0,X1) | ~$less(X1,X2) | $less(X0,X2)) )),
% 0.19/0.29 introduced(theory,[tha_transitivity])).
% 0.19/0.29 tff(f14,definition,(
% 0.19/0.29 ( ! [X2 : $int,X0 : $int,X1 : $int] : ($less($sum(X0,X2),$sum(X1,X2)) | ~$less(X0,X1)) )),
% 0.19/0.29 introduced(theory,[tha_order_monotonicity])).
% 0.19/0.29 tff(f15,definition,(
% 0.19/0.29 ( ! [X0 : $int,X1 : $int] : ($less(X1,$sum(X0,1)) | $less(X0,X1)) )),
% 0.19/0.29 introduced(theory,[tha_order_plus_one_dichotomy])).
% 0.19/0.29 tff(f18,plain,(
% 0.19/0.29 ? [X0 : array,X1 : $int,X2 : $int] : (? [X4 : $int] : (~$less(0,read(X0,X4)) & (~$less(X4,$sum(X1,3)) & ~$less(X2,X4))) & ! [X3 : $int] : ($less(0,read(X0,X3)) | ($less(X3,X1) | $less(X2,X3))))),
% 0.19/0.29 inference(ennf_transformation,[],[f5])).
% 0.19/0.29 tff(f19,plain,(
% 0.19/0.29 ? [X0 : array,X1 : $int,X2 : $int] : (? [X4 : $int] : (~$less(0,read(X0,X4)) & ~$less(X4,$sum(X1,3)) & ~$less(X2,X4)) & ! [X3 : $int] : ($less(0,read(X0,X3)) | $less(X3,X1) | $less(X2,X3)))),
% 0.19/0.29 inference(flattening,[],[f18])).
% 0.19/0.29 tff(f22,plain,(
% 0.19/0.29 ~$less(sK2,sK3)),
% 0.19/0.29 inference(cnf_transformation,[],[f19])).
% 0.19/0.29 tff(f23,plain,(
% 0.19/0.29 ~$less(sK3,$sum(sK1,3))),
% 0.19/0.29 inference(cnf_transformation,[],[f19])).
% 0.19/0.29 tff(f24,plain,(
% 0.19/0.29 ~$less(0,read(sK0,sK3))),
% 0.19/0.29 inference(cnf_transformation,[],[f19])).
% 0.19/0.29 tff(f25,plain,(
% 0.19/0.29 ( ! [X3 : $int] : ($less(0,read(sK0,X3)) | $less(X3,sK1) | $less(sK2,X3)) )),
% 0.19/0.29 inference(cnf_transformation,[],[f19])).
% 0.19/0.29 tff(f26,plain,(
% 0.19/0.29 $less(sK3,sK1) | $less(sK2,sK3)),
% 0.19/0.29 inference(resolution,[],[f25,f24])).
% 0.19/0.29 tff(f27,plain,(
% 0.19/0.29 $less(sK3,sK1)),
% 0.19/0.29 inference(forward_subsumption_resolution,[],[f26,f22])).
% 0.19/0.29 tff(f34,plain,(
% 0.19/0.29 ~$less(sK3,$sum(3,sK1))),
% 0.19/0.29 inference(superposition,[],[f23,f6])).
% 0.19/0.29 tff(f38,plain,(
% 0.19/0.29 ( ! [X0 : $int,X1 : $int] : ($less(X1,$sum(1,X0)) | $less(X0,X1)) )),
% 0.19/0.29 inference(superposition,[],[f15,f6])).
% 0.19/0.29 tff(f63,plain,(
% 0.19/0.29 ( ! [X0 : $int] : ($less(X0,sK1) | ~$less(X0,sK3)) )),
% 0.19/0.29 inference(resolution,[],[f12,f27])).
% 0.19/0.29 tff(f76,plain,(
% 0.19/0.29 ( ! [X0 : $int] : (~$less(X0,$sum(3,sK1)) | ~$less(sK3,X0)) )),
% 0.19/0.29 inference(resolution,[],[f12,f34])).
% 0.19/0.29 tff(f116,plain,(
% 0.19/0.29 ~$less(sK1,sK3)),
% 0.19/0.29 inference(resolution,[],[f63,f11])).
% 0.19/0.29 tff(f181,plain,(
% 0.19/0.29 ( ! [X0 : $int] : (~$less(sK3,$sum(X0,sK1)) | ~$less(X0,3)) )),
% 0.19/0.29 inference(resolution,[],[f76,f14])).
% 0.19/0.29 tff(f187,plain,(
% 0.19/0.29 ~$less(1,3) | $less(sK1,sK3)),
% 0.19/0.29 inference(resolution,[],[f181,f38])).
% 0.19/0.29 tff(f192,plain,(
% 0.19/0.29 $less(sK1,sK3)),
% 0.19/0.29 inference(evaluation,[],[f187])).
% 0.19/0.29 tff(f193,plain,(
% 0.19/0.29 $false),
% 0.19/0.29 inference(forward_subsumption_resolution,[],[f192,f116])).
% 0.19/0.29 % SZS output end Proof for theBenchmark
% 0.19/0.29 % (1708758)------------------------------
% 0.19/0.29 % (1708758)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.29 % (1708758)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.29 % (1708758)CaDiCaL version: 2.1.3
% 0.19/0.29 % (1708758)Termination reason: Refutation
% 0.19/0.29 % (1708758)Time elapsed: 0.007 s
% 0.19/0.29 % (1708758)Peak memory usage: 12 MB
% 0.19/0.29 % (1708758)Instructions burned: 8 (million)
% 0.19/0.29 % (1708749)Success in time 0.051 s
% 0.19/0.29 % Vampire exiting
%------------------------------------------------------------------------------