%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM900_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 : n020.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 12:26:01 PM UTC 2026
% Result : Theorem 0.14s 5.47s
% Output : Refutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM900_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.09/5.38 % Computer : n020.cluster.edu
% 0.09/5.38 % Model : x86_64 x86_64
% 0.09/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.38 % Memory : 8046.5625MB
% 0.09/5.38 % OS : Linux 6.8.0-71-generic
% 0.09/5.38 % CPULimit : 300
% 0.09/5.38 % WCLimit : 300
% 0.09/5.38 % DateTime : Sun Sep 27 21:39:41 UTC 2026
% 0.09/5.38 % CPUTime :
% 0.09/5.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.14/5.42 Running first-order model finding
% 0.14/5.42 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.14/5.47 % (3778817)Will run a generic schedule for satisfiability detection.
% 0.14/5.47 % (3778827)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3322757620:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.14/5.47 % (3778823)% WARNING: option uhcvi not known.
% 0.14/5.47 % (3778823)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1038214247:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.14/5.47 % (3778822)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3392987834_2999 on theBenchmark for (2999ds/0Mi)
% 0.14/5.47 % (3778824)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=675064932:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.14/5.47 % (3778825)dis+10_1_sil=32000:sp=arity:random_seed=4059153606:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.14/5.47 % (3778826)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=222702527:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.14/5.47 % (3778822)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.14/5.47 % (3778822)Terminated due to inappropriate strategy.
% 0.14/5.47 % (3778822)------------------------------
% 0.14/5.47 % (3778822)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.14/5.47 % (3778822)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.14/5.47 % (3778822)CaDiCaL version: 2.1.3
% 0.14/5.47 % (3778822)Termination reason: Inappropriate
% 0.14/5.47 % (3778822)Time elapsed: 0.0000 s
% 0.14/5.47 % (3778822)Peak memory usage: 10 MB
% 0.14/5.47 % (3778828)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=431258737:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.14/5.47 % (3778822)------------------------------
% 0.14/5.47 % (3778822)------------------------------
% 0.14/5.47 % (3778825) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3778817-3778825"...
% 0.14/5.47 % (3778826) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3778817-3778826"...
% 0.14/5.47 % (3778825)...printing done.
% 0.14/5.47 % (3778825)Refutation found. Thanks to Tanya!
% 0.14/5.47 % SZS status Theorem for theBenchmark
% 0.14/5.47 % SZS output start Proof for theBenchmark
% 0.14/5.47 tff(func_def_5, type, sK0: $int).
% 0.14/5.47 tff(func_def_6, type, sK1: $int).
% 0.14/5.47 tff(func_def_7, type, sK2: $int).
% 0.14/5.47 tff(f1,conjecture,(
% 0.14/5.47 ! [X0 : $int,X1 : $int,X2 : $int] : (($difference(X0,X1) = X2 & $less(0,X2)) => $less(X1,X0))),
% 0.14/5.47 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',difference_greater)).
% 0.14/5.47 tff(f2,negated_conjecture,(
% 0.14/5.47 ~ ! [X0 : $int,X1 : $int,X2 : $int] : (($difference(X0,X1) = X2 & $less(0,X2)) => $less(X1,X0))),
% 0.14/5.47 inference(negated_conjecture,[status(cth)],[f1])).
% 0.14/5.47 tff(f3,plain,(
% 0.14/5.47 ~ ! [X0 : $int,X1 : $int,X2 : $int] : (($sum(X0,$uminus(X1)) = X2 & $less(0,X2)) => $less(X1,X0))),
% 0.14/5.47 inference(theory_normalization,[],[f2])).
% 0.14/5.47 tff(f8,definition,(
% 0.14/5.47 ( ! [X0 : $int] : (0 = $sum(X0,$uminus(X0))) )),
% 0.14/5.47 introduced(theory,[tha_inverse_op_unit])).
% 0.14/5.47 tff(f9,definition,(
% 0.14/5.47 ( ! [X0 : $int] : (~$less(X0,X0)) )),
% 0.14/5.47 introduced(theory,[tha_non-reflexivity])).
% 0.14/5.47 tff(f10,definition,(
% 0.14/5.47 ( ! [X2 : $int,X0 : $int,X1 : $int] : (~$less(X1,X2) | ~$less(X0,X1) | $less(X0,X2)) )),
% 0.14/5.47 introduced(theory,[tha_transitivity])).
% 0.14/5.47 tff(f11,definition,(
% 0.14/5.47 ( ! [X0 : $int,X1 : $int] : ($less(X1,X0) | $less(X0,X1) | X0 = X1) )),
% 0.14/5.47 introduced(theory,[tha_order_totality])).
% 0.14/5.47 tff(f12,definition,(
% 0.14/5.47 ( ! [X2 : $int,X0 : $int,X1 : $int] : ($less($sum(X0,X2),$sum(X1,X2)) | ~$less(X0,X1)) )),
% 0.14/5.47 introduced(theory,[tha_order_monotonicity])).
% 0.14/5.47 tff(f16,plain,(
% 0.14/5.47 ? [X0 : $int,X1 : $int,X2 : $int] : (~$less(X1,X0) & ($sum(X0,$uminus(X1)) = X2 & $less(0,X2)))),
% 0.14/5.47 inference(ennf_transformation,[],[f3])).
% 0.14/5.47 tff(f17,plain,(
% 0.14/5.47 ? [X0 : $int,X1 : $int,X2 : $int] : (~$less(X1,X0) & $sum(X0,$uminus(X1)) = X2 & $less(0,X2))),
% 0.14/5.47 inference(flattening,[],[f16])).
% 0.14/5.47 tff(f18,plain,(
% 0.14/5.47 ~$less(sK1,sK0) & sK2 = $sum(sK0,$uminus(sK1)) & $less(0,sK2)),
% 0.14/5.47 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f17])).
% 0.14/5.47 tff(f19,plain,(
% 0.14/5.47 $less(0,sK2)),
% 0.14/5.47 inference(cnf_transformation,[],[f18])).
% 0.14/5.47 tff(f20,plain,(
% 0.14/5.47 sK2 = $sum(sK0,$uminus(sK1))),
% 0.14/5.47 inference(cnf_transformation,[],[f18])).
% 0.14/5.47 tff(f21,plain,(
% 0.14/5.47 ~$less(sK1,sK0)),
% 0.14/5.47 inference(cnf_transformation,[],[f18])).
% 0.14/5.47 tff(f42,plain,(
% 0.14/5.47 ( ! [X0 : $int] : (~$less(X0,0) | $less(X0,sK2)) )),
% 0.14/5.47 inference(resolution,[],[f10,f19])).
% 0.14/5.47 tff(f46,plain,(
% 0.14/5.47 $less(sK0,sK1) | sK0 = sK1),
% 0.14/5.47 inference(resolution,[],[f11,f21])).
% 0.14/5.47 tff(f56,definition,(
% 0.14/5.47 spl3_1 <=> sK0 = sK1),
% 0.14/5.47 introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition])).
% 0.14/5.47 tff(f58,plain,(
% 0.14/5.47 sK0 = sK1 | ~spl3_1),
% 0.14/5.47 inference(avatar_component_clause,[],[f56])).
% 0.14/5.47 tff(f60,definition,(
% 0.14/5.47 spl3_2 <=> $less(sK0,sK1)),
% 0.14/5.47 introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition])).
% 0.14/5.47 tff(f62,plain,(
% 0.14/5.47 $less(sK0,sK1) | ~spl3_2),
% 0.14/5.47 inference(avatar_component_clause,[],[f60])).
% 0.14/5.47 tff(f64,plain,(
% 0.14/5.47 spl3_1 | spl3_2),
% 0.14/5.47 inference(avatar_split_clause,[],[f46,f60,f56])).
% 0.14/5.47 tff(f83,plain,(
% 0.14/5.47 ( ! [X0 : $int] : ($less(sK2,$sum(X0,$uminus(sK1))) | ~$less(sK0,X0)) )),
% 0.14/5.47 inference(superposition,[],[f12,f20])).
% 0.14/5.47 tff(f99,plain,(
% 0.14/5.47 $less(sK2,0) | ~$less(sK0,sK1)),
% 0.14/5.47 inference(superposition,[],[f83,f8])).
% 0.14/5.47 tff(f103,plain,(
% 0.14/5.47 $less(sK2,0) | ~spl3_2),
% 0.14/5.47 inference(forward_subsumption_resolution,[],[f99,f62])).
% 0.14/5.47 tff(f128,plain,(
% 0.14/5.47 $less(sK2,sK2) | ~spl3_2),
% 0.14/5.47 inference(resolution,[],[f103,f42])).
% 0.14/5.47 tff(f130,plain,(
% 0.14/5.47 $false | ~spl3_2),
% 0.14/5.47 inference(forward_subsumption_resolution,[],[f128,f9])).
% 0.14/5.47 tff(f131,plain,(
% 0.14/5.47 ~spl3_2),
% 0.14/5.47 inference(avatar_contradiction_clause,[],[f130])).
% 0.14/5.47 tff(f138,plain,(
% 0.14/5.47 sK2 = $sum(sK0,$uminus(sK0)) | ~spl3_1),
% 0.14/5.47 inference(superposition,[],[f20,f58])).
% 0.14/5.47 tff(f140,plain,(
% 0.14/5.47 0 = sK2 | ~spl3_1),
% 0.14/5.47 inference(forward_demodulation,[],[f138,f8])).
% 0.14/5.47 tff(f144,plain,(
% 0.14/5.47 $less(0,0) | ~spl3_1),
% 0.14/5.47 inference(superposition,[],[f19,f140])).
% 0.14/5.47 tff(f145,plain,(
% 0.14/5.47 $false | ~spl3_1),
% 0.14/5.47 inference(evaluation,[],[f144])).
% 0.14/5.47 tff(f146,plain,(
% 0.14/5.47 ~spl3_1),
% 0.14/5.47 inference(avatar_contradiction_clause,[],[f145])).
% 0.14/5.47 cnf(s2, plain, spl3_1 | spl3_2, inference(sat_conversion,[],[f64])).
% 0.14/5.47 cnf(s3, plain, ~spl3_2, inference(sat_conversion,[],[f131])).
% 0.14/5.47 cnf(s5, plain, ~spl3_1, inference(sat_conversion,[],[f146])).
% 0.14/5.47 cnf(s6, plain, $false, inference(rat,[],[s2,s3,s5])).
% 0.14/5.47 tff(f148,plain,(
% 0.14/5.47 $false),
% 0.14/5.47 inference(avatar_sat_refutation,[],[s6])).
% 0.14/5.47 % SZS output end Proof for theBenchmark
% 0.14/5.47 % (3778825)------------------------------
% 0.14/5.47 % (3778825)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.14/5.47 % (3778825)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.14/5.47 % (3778825)CaDiCaL version: 2.1.3
% 0.14/5.47 % (3778825)Termination reason: Refutation
% 0.14/5.47 % (3778825)Time elapsed: 0.005 s
% 0.14/5.47 % (3778825)Peak memory usage: 12 MB
% 0.14/5.47 % (3778825)Instructions burned: 6 (million)
% 0.14/5.47 % (3778817)Success in time 0.04 s
% 0.14/5.47 % Vampire exiting
%------------------------------------------------------------------------------