%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : DAT073_1 : TPTP v9.3.1. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n009.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.19s 0.27s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : DAT073_1 : TPTP v9.3.1. Released v6.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19 % Computer : n009.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:07:45 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22 Running first-order model finding
% 0.08/0.22 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.27 % (3621642)Will run a generic schedule for satisfiability detection.
% 0.19/0.27 % (3621652)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3965794667:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.27 % (3621648)% WARNING: option uhcvi not known.
% 0.19/0.27 % (3621652) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3621642-3621652"...
% 0.19/0.27 % (3621648)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=807954241:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.27 % (3621647)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=977044913_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.27 % (3621650)dis+10_1_sil=32000:sp=arity:random_seed=3873832819:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.27 % (3621649)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2958453226:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.27 % (3621651)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2621833076:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.27 % (3621652)...printing done.
% 0.19/0.27 % (3621652)Refutation found. Thanks to Tanya!
% 0.19/0.27 % SZS status Theorem for theBenchmark
% 0.19/0.27 % SZS output start Proof for theBenchmark
% 0.19/0.27 tff(type_def_5, type, array: $tType).
% 0.19/0.27 tff(func_def_0, type, read: (array * $int) > $int).
% 0.19/0.27 tff(func_def_1, type, write: (array * $int * $int) > array).
% 0.19/0.27 tff(func_def_2, type, init: $int > array).
% 0.19/0.27 tff(func_def_3, type, max: (array * $int) > $int).
% 0.19/0.27 tff(func_def_5, type, rev: (array * $int) > array).
% 0.19/0.27 tff(func_def_10, type, sK0: (array * array) > $int).
% 0.19/0.27 tff(func_def_11, type, sK1: (array * $int * $int) > $int).
% 0.19/0.27 tff(func_def_12, type, sK2: (array * array * $int) > $int).
% 0.19/0.27 tff(pred_def_4, type, sorted: (array * $int) > $o).
% 0.19/0.27 tff(pred_def_6, type, inRange: (array * $int * $int) > $o).
% 0.19/0.27 tff(pred_def_7, type, distinct: (array * $int) > $o).
% 0.19/0.27 tff(f4,axiom,(
% 0.19/0.27 ! [X0 : $int,X1 : $int] : read(init(X0),X1) = X0),
% 0.19/0.27 file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3)).
% 0.19/0.27 tff(f7,axiom,(
% 0.19/0.27 ! [X0 : array,X1 : $int,X2 : $int] : (inRange(X0,X1,X2) <=> ! [X3 : $int] : (($greater(X2,X3) & $greatereq(X3,0)) => ($greatereq(X1,read(X0,X3)) & $greatereq(read(X0,X3),0))))),
% 0.19/0.27 file('/export/starexec/sandbox/benchmark/theBenchmark.p',inRange)).
% 0.19/0.27 tff(f10,conjecture,(
% 0.19/0.27 ~ ! [X0 : array,X1 : $int] : ($greatereq(X1,0) => inRange(X0,max(X0,X1),X1))),
% 0.19/0.27 file('/export/starexec/sandbox/benchmark/theBenchmark.p',c1)).
% 0.19/0.27 tff(f11,negated_conjecture,(
% 0.19/0.27 ~ ~ ! [X0 : array,X1 : $int] : ($greatereq(X1,0) => inRange(X0,max(X0,X1),X1))),
% 0.19/0.27 inference(negated_conjecture,[status(cth)],[f10])).
% 0.19/0.27 tff(f14,plain,(
% 0.19/0.27 ! [X0 : array,X1 : $int,X2 : $int] : (inRange(X0,X1,X2) <=> ! [X3 : $int] : (($less(X3,X2) & ~$less(X3,0)) => (~$less(X1,read(X0,X3)) & ~$less(read(X0,X3),0))))),
% 0.19/0.27 inference(theory_normalization,[],[f7])).
% 0.19/0.27 tff(f17,plain,(
% 0.19/0.27 ! [X0 : array,X1 : $int] : (~$less(X1,0) => inRange(X0,max(X0,X1),X1))),
% 0.19/0.27 inference(theory_normalization,[],[f11])).
% 0.19/0.27 tff(f18,definition,(
% 0.19/0.27 ( ! [X0 : $int,X1 : $int] : ($sum(X0,X1) = $sum(X1,X0)) )),
% 0.19/0.27 introduced(theory,[tha_commutativity])).
% 0.19/0.27 tff(f20,definition,(
% 0.19/0.27 ( ! [X0 : $int] : ($sum(X0,0) = X0) )),
% 0.19/0.27 introduced(theory,[tha_right_identity])).
% 0.19/0.27 tff(f22,definition,(
% 0.19/0.27 ( ! [X0 : $int] : (0 = $sum(X0,$uminus(X0))) )),
% 0.19/0.27 introduced(theory,[tha_inverse_op_unit])).
% 0.19/0.27 tff(f23,definition,(
% 0.19/0.27 ( ! [X0 : $int] : (~$less(X0,X0)) )),
% 0.19/0.27 introduced(theory,[tha_non-reflexivity])).
% 0.19/0.27 tff(f24,definition,(
% 0.19/0.27 ( ! [X2 : $int,X0 : $int,X1 : $int] : (~$less(X0,X1) | ~$less(X1,X2) | $less(X0,X2)) )),
% 0.19/0.27 introduced(theory,[tha_transitivity])).
% 0.19/0.27 tff(f27,definition,(
% 0.19/0.27 ( ! [X0 : $int,X1 : $int] : ($less(X0,X1) | $less(X1,$sum(X0,1))) )),
% 0.19/0.27 introduced(theory,[tha_order_plus_one_dichotomy])).
% 0.19/0.27 tff(f31,plain,(
% 0.19/0.27 ! [X0 : array,X1 : $int,X2 : $int] : (inRange(X0,X1,X2) => ! [X3 : $int] : (($less(X3,X2) & ~$less(X3,0)) => (~$less(X1,read(X0,X3)) & ~$less(read(X0,X3),0))))),
% 0.19/0.27 inference(unused_predicate_definition_removal,[],[f14])).
% 0.19/0.27 tff(f35,plain,(
% 0.19/0.27 ! [X0 : array,X1 : $int,X2 : $int] : (! [X3 : $int] : ((~$less(X1,read(X0,X3)) & ~$less(read(X0,X3),0)) | (~$less(X3,X2) | $less(X3,0))) | ~inRange(X0,X1,X2))),
% 0.19/0.27 inference(ennf_transformation,[],[f31])).
% 0.19/0.27 tff(f36,plain,(
% 0.19/0.27 ! [X0 : array,X1 : $int,X2 : $int] : (! [X3 : $int] : ((~$less(X1,read(X0,X3)) & ~$less(read(X0,X3),0)) | ~$less(X3,X2) | $less(X3,0)) | ~inRange(X0,X1,X2))),
% 0.19/0.27 inference(flattening,[],[f35])).
% 0.19/0.27 tff(f38,plain,(
% 0.19/0.27 ! [X0 : array,X1 : $int] : (inRange(X0,max(X0,X1),X1) | $less(X1,0))),
% 0.19/0.27 inference(ennf_transformation,[],[f17])).
% 0.19/0.27 tff(f45,plain,(
% 0.19/0.27 ( ! [X0 : $int,X1 : $int] : (read(init(X0),X1) = X0) )),
% 0.19/0.27 inference(cnf_transformation,[],[f4])).
% 0.19/0.27 tff(f49,plain,(
% 0.19/0.27 ( ! [X2 : $int,X3 : $int,X0 : array,X1 : $int] : (~inRange(X0,X1,X2) | ~$less(X3,X2) | $less(X3,0) | ~$less(read(X0,X3),0)) )),
% 0.19/0.27 inference(cnf_transformation,[],[f36])).
% 0.19/0.27 tff(f54,plain,(
% 0.19/0.27 ( ! [X0 : array,X1 : $int] : (inRange(X0,max(X0,X1),X1) | $less(X1,0)) )),
% 0.19/0.27 inference(cnf_transformation,[],[f38])).
% 0.19/0.27 tff(f63,plain,(
% 0.19/0.27 ( ! [X0 : $int,X1 : $int] : ($less(X1,$sum(1,X0)) | $less(X0,X1)) )),
% 0.19/0.27 inference(superposition,[],[f27,f18])).
% 0.19/0.27 tff(f94,plain,(
% 0.19/0.27 ( ! [X0 : $int] : ($less(X0,1) | $less(0,X0)) )),
% 0.19/0.27 inference(superposition,[],[f63,f20])).
% 0.19/0.27 tff(f95,plain,(
% 0.19/0.27 ( ! [X0 : $int] : ($less(X0,0) | $less($uminus(1),X0)) )),
% 0.19/0.27 inference(superposition,[],[f63,f22])).
% 0.19/0.27 tff(f98,plain,(
% 0.19/0.27 ( ! [X0 : $int] : ($less(X0,0) | $less(-1,X0)) )),
% 0.19/0.27 inference(evaluation,[],[f95])).
% 0.19/0.27 tff(f245,plain,(
% 0.19/0.27 ( ! [X2 : array,X0 : $int,X1 : $int] : (~$less(X0,X1) | $less(X0,0) | ~$less(read(X2,X0),0) | $less(X1,0)) )),
% 0.19/0.27 inference(resolution,[],[f49,f54])).
% 0.19/0.27 tff(f246,plain,(
% 0.19/0.27 ( ! [X2 : array,X0 : $int,X1 : $int] : (~$less(read(X2,X0),0) | $less(X0,0) | ~$less(X0,X1)) )),
% 0.19/0.27 inference(forward_subsumption_resolution,[],[f245,f24])).
% 0.19/0.27 tff(f252,plain,(
% 0.19/0.27 ( ! [X2 : $int,X0 : $int,X1 : $int] : (~$less(X0,0) | $less(X1,0) | ~$less(X1,X2)) )),
% 0.19/0.27 inference(superposition,[],[f246,f45])).
% 0.19/0.27 tff(f256,definition,(
% 0.19/0.27 spl3_1 <=> ! [X2 : $int,X3 : $int] : ($less(X2,0) | ~$less(X2,X3))),
% 0.19/0.27 introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition])).
% 0.19/0.27 tff(f257,plain,(
% 0.19/0.27 ( ! [X2 : $int,X3 : $int] : (~$less(X2,X3) | $less(X2,0)) ) | ~spl3_1),
% 0.19/0.27 inference(avatar_component_clause,[],[f256])).
% 0.19/0.27 tff(f259,definition,(
% 0.19/0.27 spl3_2 <=> ! [X0 : $int] : ~$less(X0,0)),
% 0.19/0.27 introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition])).
% 0.19/0.27 tff(f260,plain,(
% 0.19/0.27 ( ! [X0 : $int] : (~$less(X0,0)) ) | ~spl3_2),
% 0.19/0.27 inference(avatar_component_clause,[],[f259])).
% 0.19/0.27 tff(f262,plain,(
% 0.19/0.27 spl3_1 | spl3_2),
% 0.19/0.27 inference(avatar_split_clause,[],[f252,f259,f256])).
% 0.19/0.27 tff(f272,plain,(
% 0.19/0.27 $less(0,0) | ~spl3_2),
% 0.19/0.27 inference(resolution,[],[f260,f98])).
% 0.19/0.27 tff(f273,plain,(
% 0.19/0.27 $false | ~spl3_2),
% 0.19/0.27 inference(evaluation,[],[f272])).
% 0.19/0.27 tff(f274,plain,(
% 0.19/0.27 ~spl3_2),
% 0.19/0.27 inference(avatar_contradiction_clause,[],[f273])).
% 0.19/0.27 tff(f292,plain,(
% 0.19/0.27 ( ! [X0 : $int] : ($less(0,0) | $less(X0,1)) ) | ~spl3_1),
% 0.19/0.27 inference(resolution,[],[f257,f94])).
% 0.19/0.27 tff(f294,plain,(
% 0.19/0.27 ( ! [X0 : $int] : ($less(X0,1)) ) | ~spl3_1),
% 0.19/0.27 inference(evaluation,[],[f292])).
% 0.19/0.27 tff(f310,plain,(
% 0.19/0.27 $false | ~spl3_1),
% 0.19/0.27 inference(resolution,[],[f294,f23])).
% 0.19/0.27 tff(f317,plain,(
% 0.19/0.27 ~spl3_1),
% 0.19/0.27 inference(avatar_contradiction_clause,[],[f310])).
% 0.19/0.27 cnf(s2, plain, spl3_1 | spl3_2, inference(sat_conversion,[],[f262])).
% 0.19/0.27 cnf(s3, plain, ~spl3_2, inference(sat_conversion,[],[f274])).
% 0.19/0.27 cnf(s4, plain, ~spl3_1, inference(sat_conversion,[],[f317])).
% 0.19/0.27 cnf(s5, plain, $false, inference(rat,[],[s2,s3,s4])).
% 0.19/0.27 tff(f318,plain,(
% 0.19/0.27 $false),
% 0.19/0.27 inference(avatar_sat_refutation,[],[s5])).
% 0.19/0.27 % SZS output end Proof for theBenchmark
% 0.19/0.27 % (3621652)------------------------------
% 0.19/0.27 % (3621652)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.27 % (3621652)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.27 % (3621652)CaDiCaL version: 2.1.3
% 0.19/0.27 % (3621652)Termination reason: Refutation
% 0.19/0.27 % (3621652)Time elapsed: 0.006 s
% 0.19/0.27 % (3621652)Peak memory usage: 13 MB
% 0.19/0.27 % (3621652)Instructions burned: 13 (million)
% 0.19/0.27 % (3621642)Success in time 0.041 s
% 0.19/0.27 % Vampire exiting
%------------------------------------------------------------------------------