%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWX002_1 : TPTP v9.3.1. Released v9.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 01:46:17 PM UTC 2026
% Result : Theorem 0.09s 0.26s
% Output : Refutation 0.09s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWX002_1 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.16 % Computer : n010.cluster.edu
% 0.09/0.16 % Model : x86_64 x86_64
% 0.09/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.16 % Memory : 8046.5625MB
% 0.09/0.16 % OS : Linux 6.8.0-71-generic
% 0.09/0.16 % CPULimit : 300
% 0.09/0.16 % WCLimit : 300
% 0.09/0.16 % DateTime : Mon Sep 28 14:51:33 UTC 2026
% 0.09/0.17 % CPUTime :
% 0.09/0.17 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19 Running first-order model finding
% 0.09/0.20 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.26 % (1979316)Will run a generic schedule for satisfiability detection.
% 0.09/0.26 % (1979324)dis+10_1_sil=32000:sp=arity:random_seed=1589845577:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.09/0.26 % Exception at run slice level
% 0.09/0.26 User error: Immediate (shared) subterms of term/literal (iG5 = lG3) have different types/not well-typed!
% 0.09/0.26 % (1979322)% WARNING: option uhcvi not known.
% 0.09/0.26 % (1979323)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4252424918:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.09/0.26 % (1979321)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2533570257_2999 on theBenchmark for (2999ds/0Mi)
% 0.09/0.26 % (1979327)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3930386641:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.09/0.26 % (1979325)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1310535161:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.09/0.26 % Exception at run slice level
% 0.09/0.26 User error: Immediate (shared) subterms of term/literal (iG5 = lG3) have different types/not well-typed!
% 0.09/0.26 % Exception at run slice level
% 0.09/0.26 User error: Immediate (shared) subterms of term/literal (iG5 = lG3) have different types/not well-typed!
% 0.09/0.26 % (1979326)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2921493754:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.09/0.26 % Exception at run slice level
% 0.09/0.26 User error: Immediate (shared) subterms of term/literal (iG5 = lG3) have different types/not well-typed!
% 0.09/0.26 % Exception at run slice level
% 0.09/0.26 User error: Immediate (shared) subterms of term/literal (iG5 = lG3) have different types/not well-typed!
% 0.09/0.26 % (1979329)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1355730402:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.09/0.26 % Exception at run slice level
% 0.09/0.26 User error: Immediate (shared) subterms of term/literal (iG5 = lG3) have different types/not well-typed!
% 0.09/0.26 % (1979322)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2956633455:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.09/0.26 % (1979325) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1979316-1979325"...
% 0.09/0.26 % (1979325)...printing done.
% 0.09/0.26 % (1979325)Refutation found. Thanks to Tanya!
% 0.09/0.26 % SZS status Theorem for theBenchmark
% 0.09/0.26 % SZS output start Proof for theBenchmark
% 0.09/0.26 tff(type_def_5, type, array_int_int: $tType).
% 0.09/0.26 tff(func_def_0, type, select_int_int: (array_int_int * $int) > $int).
% 0.09/0.26 tff(func_def_1, type, store_int_int: (array_int_int * $int * $int) > array_int_int).
% 0.09/0.26 tff(func_def_2, type, a: array_int_int).
% 0.09/0.26 tff(func_def_3, type, i: $int).
% 0.09/0.26 tff(func_def_4, type, max: $int).
% 0.09/0.26 tff(func_def_5, type, n: $int).
% 0.09/0.26 tff(func_def_7, type, max1: $int).
% 0.09/0.26 tff(func_def_8, type, i2: $int).
% 0.09/0.26 tff(func_def_14, type, sK3: (array_int_int * array_int_int) > $int).
% 0.09/0.26 tff(func_def_15, type, sK4: $int).
% 0.09/0.26 tff(pred_def_6, type, ':=': !>[X0: $tType]:((X0 * X0) > $o)).
% 0.09/0.26 tff(f5,axiom,(
% 0.09/0.26 ! [X0 : $int] : (($greatereq(X0,0) & $less(X0,i)) => $greatereq(max,select_int_int(a,X0)))),
% 0.09/0.26 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',voogie_precondition_5)).
% 0.09/0.26 tff(f6,conjecture,(
% 0.09/0.26 $let(n: $int, n := $ite(~$less(i,n), ($true,bad), ($let(max1: $int, max1 := $ite($less(max,select_int_int(a,i)), (select_int_int(a,i),max), ($let(i2: $int, i2 := $sum(i,1), (bad0 | ! [X0 : $int] : (($greatereq(X0,0) & $less(X0,i2)) => $greatereq(max1,select_int_int(a,X0))))))),
% 0.09/0.26 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',voogie_conjecture)).
% 0.09/0.26 tff(f7,negated_conjecture,(
% 0.09/0.26 ~$let(n: $int, n := $ite(~$less(i,n), ($true,bad), ($let(max1: $int, max1 := $ite($less(max,select_int_int(a,i)), (select_int_int(a,i),max), ($let(i2: $int, i2 := $sum(i,1), (bad0 | ! [X0 : $int] : (($greatereq(X0,0) & $less(X0,i2)) => $greatereq(max1,select_int_int(a,X0))))))),
% 0.09/0.26 inference(negated_conjecture,[status(cth)],[f6])).
% 0.09/0.26 tff(f9,plain,(
% 0.09/0.26 ! [X0 : $int] : ((~$less(X0,0) & $less(X0,i)) => ~$less(max,select_int_int(a,X0)))),
% 0.09/0.26 inference(theory_normalization,[],[f5])).
% 0.09/0.26 tff(f10,plain,(
% 0.09/0.26 ~$let(n: $int, n := $ite(~$less(i,n), ($true,bad), ($let(max1: $int, max1 := $ite($less(max,select_int_int(a,i)), (select_int_int(a,i),max), ($let(i2: $int, i2 := $sum(i,1), (bad0 | ! [X0 : $int] : ((~$less(X0,0) & $less(X0,i2)) => ~$less(max1,select_int_int(a,X0))))))),
% 0.09/0.26 inference(theory_normalization,[],[f7])).
% 0.09/0.26 tff(f16,definition,(
% 0.09/0.26 ( ! [X0 : $int] : (~$less(X0,X0)) )),
% 0.09/0.26 introduced(theory,[tha_non-reflexivity])).
% 0.09/0.26 tff(f17,definition,(
% 0.09/0.26 ( ! [X2 : $int,X0 : $int,X1 : $int] : (~$less(X0,X1) | ~$less(X1,X2) | $less(X0,X2)) )),
% 0.09/0.26 introduced(theory,[tha_transitivity])).
% 0.09/0.26 tff(f18,definition,(
% 0.09/0.26 ( ! [X0 : $int,X1 : $int] : ($less(X0,X1) | $less(X1,X0) | X0 = X1) )),
% 0.09/0.26 introduced(theory,[tha_order_totality])).
% 0.09/0.26 tff(f22,definition,(
% 0.09/0.26 ( ! [X0 : $int,X1 : $int] : (~$less(X1,$sum(X0,1)) | ~$less(X0,X1)) )),
% 0.09/0.26 introduced(theory,[tha_extra_integer_ordering])).
% 0.09/0.26 tff(f23,plain,(
% 0.09/0.26 ~$let(n: $int, n := $ite(~$less(i,n), ($true,bad), ($let(max1: $int, max1 := $ite($less(max,select_int_int(a,i)), (select_int_int(a,i),max), ($let(i2: $int, i2 := $sum(i,1), (bad0 | ! [X0 : $int] : ((~$less(X0,0) & $less(X0,i2)) => ~$less(max1,select_int_int(a,X0))))))),
% 0.09/0.26 inference(rectify,[],[f10])).
% 0.09/0.26 tff(f27,plain,(
% 0.09/0.26 ! [X0 : $int] : (~$less(max,select_int_int(a,X0)) | ($less(X0,0) | ~$less(X0,i)))),
% 0.09/0.26 inference(ennf_transformation,[],[f9])).
% 0.09/0.26 tff(f28,plain,(
% 0.09/0.26 ! [X0 : $int] : (~$less(max,select_int_int(a,X0)) | $less(X0,0) | ~$less(X0,i))),
% 0.09/0.26 inference(flattening,[],[f27])).
% 0.09/0.26 tff(f29,plain,(
% 0.09/0.26 $let(n: $int, n := $ite(~$less(i,n), ($true,bad), ($let(max1: $int, max1 := $ite($less(max,select_int_int(a,i)), (select_int_int(a,i),max), ($let(i2: $int, i2 := $sum(i,1), (~bad0 & ? [X0 : $int] : ($less(max1,select_int_int(a,X0)) & (~$less(X0,0) & $less(X0,i2))))))),
% 0.09/0.26 inference(ennf_transformation,[],[f23])).
% 0.09/0.26 tff(f30,plain,(
% 0.09/0.26 $let(n: $int, n := $ite(~$less(i,n), ($true,bad), ($let(max1: $int, max1 := $ite($less(max,select_int_int(a,i)), (select_int_int(a,i),max), ($let(i2: $int, i2 := $sum(i,1), (~bad0 & ? [X0 : $int] : ($less(max1,select_int_int(a,X0)) & ~$less(X0,0) & $less(X0,i2)))))),
% 0.09/0.26 inference(flattening,[],[f29])).
% 0.09/0.26 tff(f35,plain,(
% 0.09/0.26 ( ! [X0 : $int] : (~$less(max,select_int_int(a,X0)) | $less(X0,0) | ~$less(X0,i)) )),
% 0.09/0.26 inference(cnf_transformation,[],[f28])).
% 0.09/0.26 tff(f36,plain,(
% 0.09/0.26 ~$less(max,select_int_int(a,i)) | $less(select_int_int(a,i),select_int_int(a,sK4))),
% 0.09/0.26 inference(cnf_transformation,[],[f30])).
% 0.09/0.26 tff(f37,plain,(
% 0.09/0.26 $less(max,select_int_int(a,i)) | $less(max,select_int_int(a,sK4))),
% 0.09/0.26 inference(cnf_transformation,[],[f30])).
% 0.09/0.26 tff(f38,plain,(
% 0.09/0.26 $less(sK4,$sum(i,1))),
% 0.09/0.26 inference(cnf_transformation,[],[f30])).
% 0.09/0.26 tff(f39,plain,(
% 0.09/0.26 ~$less(sK4,0)),
% 0.09/0.26 inference(cnf_transformation,[],[f30])).
% 0.09/0.26 tff(f43,definition,(
% 0.09/0.26 spl5_1 <=> $less(select_int_int(a,i),select_int_int(a,sK4))),
% 0.09/0.26 introduced(definition,[new_symbols(definition,[spl5_1])],[avatar_definition])).
% 0.09/0.26 tff(f45,plain,(
% 0.09/0.26 $less(select_int_int(a,i),select_int_int(a,sK4)) | ~spl5_1),
% 0.09/0.26 inference(avatar_component_clause,[],[f43])).
% 0.09/0.26 tff(f47,definition,(
% 0.09/0.26 spl5_2 <=> $less(max,select_int_int(a,i))),
% 0.09/0.26 introduced(definition,[new_symbols(definition,[spl5_2])],[avatar_definition])).
% 0.09/0.26 tff(f48,plain,(
% 0.09/0.26 $less(max,select_int_int(a,i)) | ~spl5_2),
% 0.09/0.26 inference(avatar_component_clause,[],[f47])).
% 0.09/0.26 tff(f49,plain,(
% 0.09/0.26 ~$less(max,select_int_int(a,i)) | spl5_2),
% 0.09/0.26 inference(avatar_component_clause,[],[f47])).
% 0.09/0.26 tff(f50,plain,(
% 0.09/0.26 spl5_1 | ~spl5_2),
% 0.09/0.26 inference(avatar_split_clause,[],[f36,f47,f43])).
% 0.09/0.26 tff(f52,definition,(
% 0.09/0.26 spl5_3 <=> $less(max,select_int_int(a,sK4))),
% 0.09/0.26 introduced(definition,[new_symbols(definition,[spl5_3])],[avatar_definition])).
% 0.09/0.26 tff(f53,plain,(
% 0.09/0.26 ~$less(max,select_int_int(a,sK4)) | spl5_3),
% 0.09/0.26 inference(avatar_component_clause,[],[f52])).
% 0.09/0.26 tff(f54,plain,(
% 0.09/0.26 $less(max,select_int_int(a,sK4)) | ~spl5_3),
% 0.09/0.26 inference(avatar_component_clause,[],[f52])).
% 0.09/0.26 tff(f55,plain,(
% 0.09/0.26 spl5_3 | spl5_2),
% 0.09/0.26 inference(avatar_split_clause,[],[f37,f47,f52])).
% 0.09/0.26 tff(f71,plain,(
% 0.09/0.26 ~$less(i,sK4)),
% 0.09/0.26 inference(resolution,[],[f22,f38])).
% 0.09/0.26 tff(f195,plain,(
% 0.09/0.26 $less(sK4,0) | ~$less(sK4,i) | ~spl5_3),
% 0.09/0.26 inference(resolution,[],[f35,f54])).
% 0.09/0.26 tff(f197,plain,(
% 0.09/0.26 ~$less(sK4,i) | ~spl5_3),
% 0.09/0.26 inference(forward_subsumption_resolution,[],[f195,f39])).
% 0.09/0.26 tff(f199,plain,(
% 0.09/0.26 $less(i,sK4) | i = sK4 | ~spl5_3),
% 0.09/0.26 inference(resolution,[],[f197,f18])).
% 0.09/0.26 tff(f201,plain,(
% 0.09/0.26 i = sK4 | ~spl5_3),
% 0.09/0.26 inference(forward_subsumption_resolution,[],[f199,f71])).
% 0.09/0.26 tff(f205,plain,(
% 0.09/0.26 $less(max,select_int_int(a,i)) | ~spl5_3),
% 0.09/0.26 inference(superposition,[],[f54,f201])).
% 0.09/0.26 tff(f214,plain,(
% 0.09/0.26 $false | (spl5_2 | ~spl5_3)),
% 0.09/0.26 inference(forward_subsumption_resolution,[],[f205,f49])).
% 0.09/0.26 tff(f215,plain,(
% 0.09/0.26 spl5_2 | ~spl5_3),
% 0.09/0.26 inference(avatar_contradiction_clause,[],[f214])).
% 0.09/0.26 tff(f216,plain,(
% 0.09/0.26 $less(select_int_int(a,i),select_int_int(a,i)) | (~spl5_1 | ~spl5_3)),
% 0.09/0.26 inference(forward_demodulation,[],[f45,f201])).
% 0.09/0.26 tff(f218,plain,(
% 0.09/0.26 $false | (~spl5_1 | ~spl5_3)),
% 0.09/0.26 inference(forward_subsumption_resolution,[],[f216,f16])).
% 0.09/0.26 tff(f219,plain,(
% 0.09/0.26 ~spl5_1 | ~spl5_3),
% 0.09/0.26 inference(avatar_contradiction_clause,[],[f218])).
% 0.09/0.26 tff(f257,plain,(
% 0.09/0.26 ( ! [X0 : $int] : (~$less(X0,select_int_int(a,sK4)) | ~$less(max,X0)) ) | spl5_3),
% 0.09/0.26 inference(resolution,[],[f53,f17])).
% 0.09/0.26 tff(f267,plain,(
% 0.09/0.26 ~$less(max,select_int_int(a,i)) | (~spl5_1 | spl5_3)),
% 0.09/0.26 inference(resolution,[],[f257,f45])).
% 0.09/0.26 tff(f268,plain,(
% 0.09/0.26 $false | (~spl5_1 | ~spl5_2 | spl5_3)),
% 0.09/0.26 inference(forward_subsumption_resolution,[],[f267,f48])).
% 0.09/0.26 tff(f269,plain,(
% 0.09/0.26 ~spl5_1 | ~spl5_2 | spl5_3),
% 0.09/0.26 inference(avatar_contradiction_clause,[],[f268])).
% 0.09/0.26 cnf(s1, plain, spl5_1 | ~spl5_2, inference(sat_conversion,[],[f50])).
% 0.09/0.26 cnf(s2, plain, spl5_2 | spl5_3, inference(sat_conversion,[],[f55])).
% 0.09/0.26 cnf(s9, plain, spl5_2 | ~spl5_3, inference(sat_conversion,[],[f215])).
% 0.09/0.26 cnf(s10, plain, ~spl5_1 | ~spl5_3, inference(sat_conversion,[],[f219])).
% 0.09/0.26 cnf(s13, plain, ~spl5_1 | ~spl5_2 | spl5_3, inference(sat_conversion,[],[f269])).
% 0.09/0.26 cnf(s14, plain, spl5_2, inference(rat,[],[s2,s9])).
% 0.09/0.26 cnf(s15, plain, spl5_1, inference(rat,[],[s1,s14])).
% 0.09/0.26 cnf(s16, plain, ~spl5_3, inference(rat,[],[s10,s15])).
% 0.09/0.26 cnf(s17, plain, $false, inference(rat,[],[s13,s14,s16,s15])).
% 0.09/0.26 tff(f270,plain,(
% 0.09/0.26 $false),
% 0.09/0.26 inference(avatar_sat_refutation,[],[s17])).
% 0.09/0.26 % SZS output end Proof for theBenchmark
% 0.09/0.26 % (1979325)------------------------------
% 0.09/0.26 % (1979325)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.26 % (1979325)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.26 % (1979325)CaDiCaL version: 2.1.3
% 0.09/0.26 % (1979325)Termination reason: Refutation
% 0.09/0.26 % (1979325)Time elapsed: 0.010 s
% 0.09/0.26 % (1979325)Peak memory usage: 12 MB
% 0.09/0.26 % (1979325)Instructions burned: 11 (million)
% 0.09/0.26 % (1979316)Success in time 0.052 s
% 0.09/0.26 % Vampire exiting
%------------------------------------------------------------------------------