%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : DAT074_1 : TPTP v9.3.1. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n026.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:48:04 AM UTC 2026
% Result : Theorem 0.09s 0.28s
% Output : Refutation 0.09s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : DAT074_1 : TPTP v9.3.1. Released v6.1.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19 % Computer : n026.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 00:10:42 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.23 Running first-order model finding
% 0.09/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.09/0.28 % (217137)Will run a generic schedule for satisfiability detection.
% 0.09/0.28 % (217146)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3560812653:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.09/0.28 % (217143)% WARNING: option uhcvi not known.
% 0.09/0.28 % (217142)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2454487265_2999 on theBenchmark for (2999ds/0Mi)
% 0.09/0.28 % (217143)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4214316773:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.09/0.28 % (217144)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4221346365:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.09/0.28 % (217145)dis+10_1_sil=32000:sp=arity:random_seed=183016321:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.09/0.28 % (217148)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3795328313:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.09/0.28 % (217147)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4179071987:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.09/0.28 % (217142)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.09/0.28 % (217142)Terminated due to inappropriate strategy.
% 0.09/0.28 % (217142)------------------------------
% 0.09/0.28 % (217142)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.28 % (217142)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.28 % (217142)CaDiCaL version: 2.1.3
% 0.09/0.28 % (217142)Termination reason: Inappropriate
% 0.09/0.28 % (217142)Time elapsed: 0.001 s
% 0.09/0.28 % (217142)Peak memory usage: 10 MB
% 0.09/0.28 % (217142)Instructions burned: 1 (million)
% 0.09/0.28 % (217146) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-217137-217146"...
% 0.09/0.28 % (217142)------------------------------
% 0.09/0.28 % (217142)------------------------------
% 0.09/0.28 % (217146)...printing done.
% 0.09/0.28 % (217146)Refutation found. Thanks to Tanya!
% 0.09/0.28 % SZS status Theorem for theBenchmark
% 0.09/0.28 % SZS output start Proof for theBenchmark
% 0.09/0.28 tff(type_def_5, type, array: $tType).
% 0.09/0.28 tff(func_def_0, type, read: (array * $int) > $int).
% 0.09/0.28 tff(func_def_1, type, write: (array * $int * $int) > array).
% 0.09/0.28 tff(func_def_2, type, init: $int > array).
% 0.09/0.28 tff(func_def_3, type, max: (array * $int) > $int).
% 0.09/0.28 tff(func_def_5, type, rev: (array * $int) > array).
% 0.09/0.28 tff(func_def_10, type, sK0: (array * array) > $int).
% 0.09/0.28 tff(func_def_11, type, sK1: (array * $int * $int) > $int).
% 0.09/0.28 tff(func_def_12, type, sK2: (array * array * $int) > $int).
% 0.09/0.28 tff(pred_def_4, type, sorted: (array * $int) > $o).
% 0.09/0.28 tff(pred_def_6, type, inRange: (array * $int * $int) > $o).
% 0.09/0.28 tff(pred_def_7, type, distinct: (array * $int) > $o).
% 0.09/0.28 tff(f4,axiom,(
% 0.09/0.28 ! [X0 : $int,X1 : $int] : read(init(X0),X1) = X0),
% 0.09/0.28 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3)).
% 0.09/0.28 tff(f8,axiom,(
% 0.09/0.28 ! [X0 : array,X1 : $int] : (distinct(X0,X1) <=> ! [X2 : $int,X3 : $int] : (($greater(X1,X2) & $greater(X1,X3) & $greatereq(X3,0) & $greatereq(X2,0)) => (read(X0,X2) = read(X0,X3) => X2 = X3)))),
% 0.09/0.28 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distinct)).
% 0.09/0.28 tff(f10,conjecture,(
% 0.09/0.28 ~ ! [X0 : $int,X1 : $int] : distinct(init(X0),X1)),
% 0.09/0.28 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c2)).
% 0.09/0.28 tff(f11,negated_conjecture,(
% 0.09/0.28 ~ ~ ! [X0 : $int,X1 : $int] : distinct(init(X0),X1)),
% 0.09/0.28 inference(negated_conjecture,[status(cth)],[f10])).
% 0.09/0.28 tff(f15,plain,(
% 0.09/0.28 ! [X0 : array,X1 : $int] : (distinct(X0,X1) <=> ! [X2 : $int,X3 : $int] : (($less(X2,X1) & $less(X3,X1) & ~$less(X3,0) & ~$less(X2,0)) => (read(X0,X2) = read(X0,X3) => X2 = X3)))),
% 0.09/0.28 inference(theory_normalization,[],[f8])).
% 0.09/0.28 tff(f17,definition,(
% 0.09/0.28 ( ! [X0 : $int,X1 : $int] : ($sum(X0,X1) = $sum(X1,X0)) )),
% 0.09/0.28 introduced(theory,[tha_commutativity])).
% 0.09/0.28 tff(f19,definition,(
% 0.09/0.28 ( ! [X0 : $int] : ($sum(X0,0) = X0) )),
% 0.09/0.28 introduced(theory,[tha_right_identity])).
% 0.09/0.28 tff(f22,definition,(
% 0.09/0.28 ( ! [X0 : $int] : (~$less(X0,X0)) )),
% 0.09/0.28 introduced(theory,[tha_non-reflexivity])).
% 0.09/0.28 tff(f23,definition,(
% 0.09/0.28 ( ! [X2 : $int,X0 : $int,X1 : $int] : (~$less(X0,X1) | ~$less(X1,X2) | $less(X0,X2)) )),
% 0.09/0.28 introduced(theory,[tha_transitivity])).
% 0.09/0.28 tff(f24,definition,(
% 0.09/0.28 ( ! [X0 : $int,X1 : $int] : ($less(X0,X1) | $less(X1,X0) | X0 = X1) )),
% 0.09/0.28 introduced(theory,[tha_order_totality])).
% 0.09/0.28 tff(f26,definition,(
% 0.09/0.28 ( ! [X0 : $int,X1 : $int] : ($less(X1,$sum(X0,1)) | $less(X0,X1)) )),
% 0.09/0.28 introduced(theory,[tha_order_plus_one_dichotomy])).
% 0.09/0.28 tff(f30,plain,(
% 0.09/0.28 ! [X0 : $int,X1 : $int] : distinct(init(X0),X1)),
% 0.09/0.28 inference(flattening,[],[f11])).
% 0.09/0.28 tff(f31,plain,(
% 0.09/0.28 ! [X0 : array,X1 : $int] : (distinct(X0,X1) => ! [X2 : $int,X3 : $int] : (($less(X2,X1) & $less(X3,X1) & ~$less(X3,0) & ~$less(X2,0)) => (read(X0,X2) = read(X0,X3) => X2 = X3)))),
% 0.09/0.28 inference(unused_predicate_definition_removal,[],[f15])).
% 0.09/0.28 tff(f35,plain,(
% 0.09/0.28 ! [X0 : array,X1 : $int] : (! [X2 : $int,X3 : $int] : ((X2 = X3 | read(X0,X2) != read(X0,X3)) | (~$less(X2,X1) | ~$less(X3,X1) | $less(X3,0) | $less(X2,0))) | ~distinct(X0,X1))),
% 0.09/0.28 inference(ennf_transformation,[],[f31])).
% 0.09/0.28 tff(f36,plain,(
% 0.09/0.28 ! [X0 : array,X1 : $int] : (! [X2 : $int,X3 : $int] : (X2 = X3 | read(X0,X2) != read(X0,X3) | ~$less(X2,X1) | ~$less(X3,X1) | $less(X3,0) | $less(X2,0)) | ~distinct(X0,X1))),
% 0.09/0.28 inference(flattening,[],[f35])).
% 0.09/0.28 tff(f41,plain,(
% 0.09/0.28 ( ! [X0 : $int,X1 : $int] : (read(init(X0),X1) = X0) )),
% 0.09/0.28 inference(cnf_transformation,[],[f4])).
% 0.09/0.28 tff(f45,plain,(
% 0.09/0.28 ( ! [X2 : $int,X3 : $int,X0 : array,X1 : $int] : (~distinct(X0,X1) | $less(X2,0) | $less(X3,0) | ~$less(X3,X1) | ~$less(X2,X1) | read(X0,X2) != read(X0,X3) | X2 = X3) )),
% 0.09/0.28 inference(cnf_transformation,[],[f36])).
% 0.09/0.28 tff(f49,plain,(
% 0.09/0.28 ( ! [X0 : $int,X1 : $int] : (distinct(init(X0),X1)) )),
% 0.09/0.28 inference(cnf_transformation,[],[f30])).
% 0.09/0.28 tff(f59,plain,(
% 0.09/0.28 ( ! [X0 : $int] : ($less(X0,$sum(X0,1))) )),
% 0.09/0.28 inference(resolution,[],[f26,f22])).
% 0.09/0.28 tff(f61,plain,(
% 0.09/0.28 ( ! [X0 : $int,X1 : $int] : ($less(X1,$sum(1,X0)) | $less(X0,X1)) )),
% 0.09/0.28 inference(superposition,[],[f26,f17])).
% 0.09/0.28 tff(f63,plain,(
% 0.09/0.28 ( ! [X0 : $int] : ($less(X0,$sum(1,X0))) )),
% 0.09/0.28 inference(superposition,[],[f59,f17])).
% 0.09/0.28 tff(f75,plain,(
% 0.09/0.28 ( ! [X0 : $int] : ($less(X0,1) | $less(0,X0)) )),
% 0.09/0.28 inference(superposition,[],[f61,f19])).
% 0.09/0.28 tff(f90,plain,(
% 0.09/0.28 ( ! [X0 : $int,X1 : $int] : (~$less(X0,X1) | ~$less(X1,X0)) )),
% 0.09/0.28 inference(resolution,[],[f23,f22])).
% 0.09/0.28 tff(f109,plain,(
% 0.09/0.28 ( ! [X2 : $int,X0 : $int,X1 : $int] : ($less(X1,X0) | X0 = X1 | ~$less(X1,X2) | $less(X0,X2)) )),
% 0.09/0.28 inference(resolution,[],[f24,f23])).
% 0.09/0.28 tff(f113,plain,(
% 0.09/0.28 ( ! [X0 : $int] : (~$less(1,X0) | $less(0,X0)) )),
% 0.09/0.28 inference(resolution,[],[f75,f90])).
% 0.09/0.28 tff(f287,plain,(
% 0.09/0.28 ( ! [X2 : $int,X3 : $int,X0 : $int,X1 : $int] : ($less(X0,0) | $less(X1,0) | ~$less(X1,X2) | ~$less(X0,X2) | read(init(X3),X0) != read(init(X3),X1) | X0 = X1) )),
% 0.09/0.28 inference(resolution,[],[f45,f49])).
% 0.09/0.28 tff(f288,plain,(
% 0.09/0.28 ( ! [X2 : $int,X3 : $int,X0 : $int,X1 : $int] : (read(init(X3),X0) != X3 | $less(X0,0) | $less(X1,0) | ~$less(X1,X2) | ~$less(X0,X2) | X0 = X1) )),
% 0.09/0.28 inference(forward_demodulation,[],[f287,f41])).
% 0.09/0.28 tff(f289,plain,(
% 0.09/0.28 ( ! [X2 : $int,X0 : $int,X1 : $int] : ($less(X0,0) | $less(X1,0) | ~$less(X1,X2) | ~$less(X0,X2) | X0 = X1) )),
% 0.09/0.28 inference(forward_subsumption_resolution,[],[f288,f41])).
% 0.09/0.28 tff(f301,plain,(
% 0.09/0.28 ( ! [X0 : $int,X1 : $int] : ($less(X0,0) | ~$less(0,X1) | ~$less(X0,X1) | 0 = X0) )),
% 0.09/0.28 inference(resolution,[],[f289,f22])).
% 0.09/0.28 tff(f352,plain,(
% 0.09/0.28 ( ! [X0 : $int,X1 : $int] : ($less(X0,0) | ~$less(X0,X1) | 0 = X0) )),
% 0.09/0.28 inference(forward_subsumption_resolution,[],[f301,f109])).
% 0.09/0.28 tff(f375,plain,(
% 0.09/0.28 ( ! [X0 : $int] : (~$less(1,X0) | 0 = 1 | $less(0,0)) )),
% 0.09/0.28 inference(resolution,[],[f352,f113])).
% 0.09/0.28 tff(f395,plain,(
% 0.09/0.28 ( ! [X0 : $int] : (~$less(1,X0)) )),
% 0.09/0.28 inference(evaluation,[],[f375])).
% 0.09/0.28 tff(f440,plain,(
% 0.09/0.28 $false),
% 0.09/0.28 inference(resolution,[],[f395,f63])).
% 0.09/0.28 % SZS output end Proof for theBenchmark
% 0.09/0.28 % (217146)------------------------------
% 0.09/0.28 % (217146)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.28 % (217146)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.28 % (217146)CaDiCaL version: 2.1.3
% 0.09/0.28 % (217146)Termination reason: Refutation
% 0.09/0.28 % (217146)Time elapsed: 0.010 s
% 0.09/0.28 % (217146)Peak memory usage: 12 MB
% 0.09/0.28 % (217146)Instructions burned: 27 (million)
% 0.09/0.28 % (217137)Success in time 0.038 s
% 0.09/0.28 % Vampire exiting
%------------------------------------------------------------------------------