%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : DAT071_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 : n008.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.11s 0.27s
% Output : Refutation 0.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : DAT071_1 : TPTP v9.3.1. Released v6.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.19 % Computer : n008.cluster.edu
% 0.11/0.19 % Model : x86_64 x86_64
% 0.11/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.19 % Memory : 8046.5625MB
% 0.11/0.19 % OS : Linux 6.8.0-71-generic
% 0.11/0.20 % CPULimit : 300
% 0.11/0.20 % WCLimit : 300
% 0.11/0.20 % DateTime : Tue Sep 29 00:08:24 UTC 2026
% 0.11/0.20 % CPUTime :
% 0.11/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.22 Running first-order model finding
% 0.11/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.11/0.27 % (2782116)Will run a generic schedule for satisfiability detection.
% 0.11/0.27 % (2782129)% WARNING: option uhcvi not known.
% 0.11/0.27 % (2782129)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2333721783:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.11/0.27 % (2782129) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2782116-2782129"...
% 0.11/0.27 % (2782129)...printing done.
% 0.11/0.27 % (2782129)Refutation found. Thanks to Tanya!
% 0.11/0.27 % SZS status Theorem for theBenchmark
% 0.11/0.27 % SZS output start Proof for theBenchmark
% 0.11/0.27 tff(type_def_5, type, array: $tType).
% 0.11/0.27 tff(func_def_0, type, read: (array * $int) > $int).
% 0.11/0.27 tff(func_def_1, type, write: (array * $int * $int) > array).
% 0.11/0.27 tff(func_def_2, type, init: $int > array).
% 0.11/0.27 tff(func_def_3, type, max: (array * $int) > $int).
% 0.11/0.27 tff(func_def_5, type, rev: (array * $int) > array).
% 0.11/0.27 tff(func_def_10, type, sK0: (array * array) > $int).
% 0.11/0.27 tff(func_def_11, type, sK1: (array * $int * $int) > $int).
% 0.11/0.27 tff(func_def_12, type, sK2: (array * array * $int) > $int).
% 0.11/0.27 tff(func_def_13, type, sK3: array).
% 0.11/0.27 tff(func_def_14, type, sK4: $int).
% 0.11/0.27 tff(func_def_15, type, sK5: $int).
% 0.11/0.27 tff(func_def_16, type, sK6: $int).
% 0.11/0.27 tff(func_def_17, type, sK7: $int).
% 0.11/0.27 tff(func_def_18, type, sK8: $int).
% 0.11/0.27 tff(pred_def_4, type, sorted: (array * $int) > $o).
% 0.11/0.27 tff(pred_def_6, type, inRange: (array * $int * $int) > $o).
% 0.11/0.27 tff(pred_def_7, type, distinct: (array * $int) > $o).
% 0.11/0.27 tff(f10,conjecture,(
% 0.11/0.27 ! [X0 : array,X1 : $int,X2 : $int,X3 : $int] : ((! [X4 : $int] : (($greater(X1,X4) & $greatereq(X4,0)) => $lesseq(read(X0,X4),X2)) & ? [X4 : $int] : ($greater(X1,X4) & $greatereq(X4,0) & read(X0,X4) = X2) & ! [X4 : $int] : (($greater(X1,X4) & $greatereq(X4,0)) => $lesseq(read(X0,X4),X3)) & ? [X4 : $int] : ($greater(X1,X4) & $greatereq(X4,0) & read(X0,X4) = X3)) => X2 = X3)),
% 0.11/0.27 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c)).
% 0.11/0.27 tff(f11,negated_conjecture,(
% 0.11/0.27 ~ ! [X0 : array,X1 : $int,X2 : $int,X3 : $int] : ((! [X4 : $int] : (($greater(X1,X4) & $greatereq(X4,0)) => $lesseq(read(X0,X4),X2)) & ? [X4 : $int] : ($greater(X1,X4) & $greatereq(X4,0) & read(X0,X4) = X2) & ! [X4 : $int] : (($greater(X1,X4) & $greatereq(X4,0)) => $lesseq(read(X0,X4),X3)) & ? [X4 : $int] : ($greater(X1,X4) & $greatereq(X4,0) & read(X0,X4) = X3)) => X2 = X3)),
% 0.11/0.27 inference(negated_conjecture,[status(cth)],[f10])).
% 0.11/0.27 tff(f17,plain,(
% 0.11/0.27 ~ ! [X0 : array,X1 : $int,X2 : $int,X3 : $int] : ((! [X4 : $int] : (($less(X4,X1) & ~$less(X4,0)) => ~$less(X2,read(X0,X4))) & ? [X4 : $int] : ($less(X4,X1) & ~$less(X4,0) & read(X0,X4) = X2) & ! [X4 : $int] : (($less(X4,X1) & ~$less(X4,0)) => ~$less(X3,read(X0,X4))) & ? [X4 : $int] : ($less(X4,X1) & ~$less(X4,0) & read(X0,X4) = X3)) => X2 = X3)),
% 0.11/0.27 inference(theory_normalization,[],[f11])).
% 0.11/0.27 tff(f25,definition,(
% 0.11/0.27 ( ! [X0 : $int,X1 : $int] : ($less(X0,X1) | $less(X1,X0) | X0 = X1) )),
% 0.11/0.27 introduced(theory,[tha_order_totality])).
% 0.11/0.27 tff(f31,plain,(
% 0.11/0.27 ~ ! [X0 : array,X1 : $int,X2 : $int,X3 : $int] : ((! [X4 : $int] : (($less(X4,X1) & ~$less(X4,0)) => ~$less(X2,read(X0,X4))) & ? [X5 : $int] : ($less(X5,X1) & ~$less(X5,0) & read(X0,X5) = X2) & ! [X6 : $int] : (($less(X6,X1) & ~$less(X6,0)) => ~$less(X3,read(X0,X6))) & ? [X7 : $int] : ($less(X7,X1) & ~$less(X7,0) & read(X0,X7) = X3)) => X2 = X3)),
% 0.11/0.27 inference(rectify,[],[f17])).
% 0.11/0.27 tff(f36,plain,(
% 0.11/0.27 ? [X0 : array,X1 : $int,X2 : $int,X3 : $int] : (X2 != X3 & (! [X4 : $int] : (~$less(X2,read(X0,X4)) | (~$less(X4,X1) | $less(X4,0))) & ? [X5 : $int] : ($less(X5,X1) & ~$less(X5,0) & read(X0,X5) = X2) & ! [X6 : $int] : (~$less(X3,read(X0,X6)) | (~$less(X6,X1) | $less(X6,0))) & ? [X7 : $int] : ($less(X7,X1) & ~$less(X7,0) & read(X0,X7) = X3)))),
% 0.11/0.27 inference(ennf_transformation,[],[f31])).
% 0.11/0.27 tff(f37,plain,(
% 0.11/0.27 ? [X0 : array,X1 : $int,X2 : $int,X3 : $int] : (X2 != X3 & ! [X4 : $int] : (~$less(X2,read(X0,X4)) | ~$less(X4,X1) | $less(X4,0)) & ? [X5 : $int] : ($less(X5,X1) & ~$less(X5,0) & read(X0,X5) = X2) & ! [X6 : $int] : (~$less(X3,read(X0,X6)) | ~$less(X6,X1) | $less(X6,0)) & ? [X7 : $int] : ($less(X7,X1) & ~$less(X7,0) & read(X0,X7) = X3))),
% 0.11/0.27 inference(flattening,[],[f36])).
% 0.11/0.27 tff(f48,plain,(
% 0.11/0.27 ( ! [X4 : $int] : (~$less(sK5,read(sK3,X4)) | ~$less(X4,sK4) | $less(X4,0)) )),
% 0.11/0.27 inference(cnf_transformation,[],[f37])).
% 0.11/0.27 tff(f49,plain,(
% 0.11/0.27 sK5 = read(sK3,sK8)),
% 0.11/0.27 inference(cnf_transformation,[],[f37])).
% 0.11/0.27 tff(f50,plain,(
% 0.11/0.27 ~$less(sK8,0)),
% 0.11/0.27 inference(cnf_transformation,[],[f37])).
% 0.11/0.27 tff(f51,plain,(
% 0.11/0.27 $less(sK8,sK4)),
% 0.11/0.27 inference(cnf_transformation,[],[f37])).
% 0.11/0.27 tff(f52,plain,(
% 0.11/0.27 ( ! [X6 : $int] : (~$less(sK6,read(sK3,X6)) | ~$less(X6,sK4) | $less(X6,0)) )),
% 0.11/0.27 inference(cnf_transformation,[],[f37])).
% 0.11/0.27 tff(f53,plain,(
% 0.11/0.27 sK6 = read(sK3,sK7)),
% 0.11/0.27 inference(cnf_transformation,[],[f37])).
% 0.11/0.27 tff(f54,plain,(
% 0.11/0.27 ~$less(sK7,0)),
% 0.11/0.27 inference(cnf_transformation,[],[f37])).
% 0.11/0.27 tff(f55,plain,(
% 0.11/0.27 $less(sK7,sK4)),
% 0.11/0.27 inference(cnf_transformation,[],[f37])).
% 0.11/0.27 tff(f56,plain,(
% 0.11/0.27 sK5 != sK6),
% 0.11/0.27 inference(cnf_transformation,[],[f37])).
% 0.11/0.27 tff(f61,plain,(
% 0.11/0.27 ~$less(sK5,sK6) | ~$less(sK7,sK4) | $less(sK7,0)),
% 0.11/0.27 inference(superposition,[],[f48,f53])).
% 0.11/0.27 tff(f62,plain,(
% 0.11/0.27 ~$less(sK5,sK6) | $less(sK7,0)),
% 0.11/0.27 inference(forward_subsumption_resolution,[],[f61,f55])).
% 0.11/0.27 tff(f64,plain,(
% 0.11/0.27 ~$less(sK5,sK6)),
% 0.11/0.27 inference(forward_subsumption_resolution,[],[f62,f54])).
% 0.11/0.27 tff(f66,plain,(
% 0.11/0.27 ~$less(sK6,sK5) | ~$less(sK8,sK4) | $less(sK8,0)),
% 0.11/0.27 inference(superposition,[],[f52,f49])).
% 0.11/0.27 tff(f69,plain,(
% 0.11/0.27 ~$less(sK6,sK5) | $less(sK8,0)),
% 0.11/0.27 inference(forward_subsumption_resolution,[],[f66,f51])).
% 0.11/0.27 tff(f71,plain,(
% 0.11/0.27 ~$less(sK6,sK5)),
% 0.11/0.27 inference(forward_subsumption_resolution,[],[f69,f50])).
% 0.11/0.27 tff(f133,plain,(
% 0.11/0.27 $less(sK5,sK6) | sK5 = sK6),
% 0.11/0.27 inference(resolution,[],[f71,f25])).
% 0.11/0.27 tff(f134,plain,(
% 0.11/0.27 sK5 = sK6),
% 0.11/0.27 inference(forward_subsumption_resolution,[],[f133,f64])).
% 0.11/0.27 tff(f136,plain,(
% 0.11/0.27 $false),
% 0.11/0.27 inference(forward_subsumption_resolution,[],[f134,f56])).
% 0.11/0.27 % SZS output end Proof for theBenchmark
% 0.11/0.27 % (2782129)------------------------------
% 0.11/0.27 % (2782129)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.27 % (2782129)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.27 % (2782129)CaDiCaL version: 2.1.3
% 0.11/0.27 % (2782129)Termination reason: Refutation
% 0.11/0.27 % (2782129)Time elapsed: 0.003 s
% 0.11/0.27 % (2782129)Peak memory usage: 12 MB
% 0.11/0.27 % (2782129)Instructions burned: 6 (million)
% 0.11/0.27 % (2782116)Success in time 0.039 s
% 0.11/0.27 % Vampire exiting
%------------------------------------------------------------------------------