%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : ARI572_1 : TPTP v9.3.1. Released v5.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n001.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:34:53 AM UTC 2026
% Result : Theorem 0.32s 0.37s
% Output : Refutation 0.32s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : ARI572_1 : TPTP v9.3.1. Released v5.1.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.25 % Computer : n001.cluster.edu
% 0.10/0.25 % Model : x86_64 x86_64
% 0.10/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.25 % Memory : 8046.5625MB
% 0.10/0.25 % OS : Linux 6.8.0-71-generic
% 0.10/0.25 % CPULimit : 300
% 0.10/0.25 % WCLimit : 300
% 0.10/0.25 % DateTime : Mon Sep 28 20:58:19 UTC 2026
% 0.10/0.26 % CPUTime :
% 0.10/0.26 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.25/0.31 Running first-order model finding
% 0.25/0.31 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.32/0.37 % (733107)Will run a generic schedule for satisfiability detection.
% 0.32/0.37 % (733116)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3530798430:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 0.32/0.37 % (733113)% WARNING: option uhcvi not known.
% 0.32/0.37 % (733112)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=34372276_3000 on theBenchmark for (3000ds/0Mi)
% 0.32/0.37 % (733115)dis+10_1_sil=32000:sp=arity:random_seed=668036093:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 0.32/0.37 % (733117)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3003689343:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.32/0.37 % (733114)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=231718043:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.32/0.37 % (733113)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1967195880:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 0.32/0.37 % (733118)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3573021649:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 0.32/0.37 % (733112)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.32/0.37 % (733112)Terminated due to inappropriate strategy.
% 0.32/0.37 % (733112)------------------------------
% 0.32/0.37 % (733112)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.32/0.37 % (733112)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.32/0.37 % (733112)CaDiCaL version: 2.1.3
% 0.32/0.37 % (733112)Termination reason: Inappropriate
% 0.32/0.37 % (733112)Time elapsed: 0.001 s
% 0.32/0.37 % (733112)Peak memory usage: 10 MB
% 0.32/0.37 % (733112)------------------------------
% 0.32/0.37 % (733112)------------------------------
% 0.32/0.37 % (733115) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-733107-733115"...
% 0.32/0.37 % (733115)...printing done.
% 0.32/0.37 % (733115)Refutation found. Thanks to Tanya!
% 0.32/0.37 % SZS status Theorem for theBenchmark
% 0.32/0.37 % SZS output start Proof for theBenchmark
% 0.32/0.37 tff(func_def_4, type, sK0: $int).
% 0.32/0.37 tff(func_def_5, type, sK1: $int).
% 0.32/0.37 tff(f1,conjecture,(
% 0.32/0.37 ! [X0 : $int,X1 : $int] : ($less($sum(X1,$uminus(X0)),$sum(X0,$uminus(X1))) => $less(X1,X0))),
% 0.32/0.37 file('/export/starexec/sandbox/benchmark/theBenchmark.p',impl_ineq)).
% 0.32/0.37 tff(f2,negated_conjecture,(
% 0.32/0.37 ~ ! [X0 : $int,X1 : $int] : ($less($sum(X1,$uminus(X0)),$sum(X0,$uminus(X1))) => $less(X1,X0))),
% 0.32/0.37 inference(negated_conjecture,[status(cth)],[f1])).
% 0.32/0.37 tff(f7,definition,(
% 0.32/0.37 ( ! [X0 : $int] : (0 = $sum(X0,$uminus(X0))) )),
% 0.32/0.37 introduced(theory,[tha_inverse_op_unit])).
% 0.32/0.37 tff(f8,definition,(
% 0.32/0.37 ( ! [X0 : $int] : (~$less(X0,X0)) )),
% 0.32/0.37 introduced(theory,[tha_non-reflexivity])).
% 0.32/0.37 tff(f9,definition,(
% 0.32/0.37 ( ! [X2 : $int,X0 : $int,X1 : $int] : (~$less(X1,X2) | ~$less(X0,X1) | $less(X0,X2)) )),
% 0.32/0.37 introduced(theory,[tha_transitivity])).
% 0.32/0.37 tff(f10,definition,(
% 0.32/0.37 ( ! [X0 : $int,X1 : $int] : ($less(X1,X0) | $less(X0,X1) | X0 = X1) )),
% 0.32/0.37 introduced(theory,[tha_order_totality])).
% 0.32/0.37 tff(f11,definition,(
% 0.32/0.37 ( ! [X2 : $int,X0 : $int,X1 : $int] : ($less($sum(X0,X2),$sum(X1,X2)) | ~$less(X0,X1)) )),
% 0.32/0.37 introduced(theory,[tha_order_monotonicity])).
% 0.32/0.37 tff(f13,definition,(
% 0.32/0.37 ( ! [X0 : $int] : ($uminus($uminus(X0)) = X0) )),
% 0.32/0.37 introduced(theory,[tha_minus_minus_x])).
% 0.32/0.37 tff(f15,plain,(
% 0.32/0.37 ? [X0 : $int,X1 : $int] : (~$less(X1,X0) & $less($sum(X1,$uminus(X0)),$sum(X0,$uminus(X1))))),
% 0.32/0.37 inference(ennf_transformation,[],[f2])).
% 0.32/0.37 tff(f16,plain,(
% 0.32/0.37 ~$less(sK1,sK0) & $less($sum(sK1,$uminus(sK0)),$sum(sK0,$uminus(sK1)))),
% 0.32/0.37 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f15])).
% 0.32/0.37 tff(f17,plain,(
% 0.32/0.37 $less($sum(sK1,$uminus(sK0)),$sum(sK0,$uminus(sK1)))),
% 0.32/0.37 inference(cnf_transformation,[],[f16])).
% 0.32/0.37 tff(f18,plain,(
% 0.32/0.37 ~$less(sK1,sK0)),
% 0.32/0.37 inference(cnf_transformation,[],[f16])).
% 0.32/0.37 tff(f19,plain,(
% 0.32/0.37 ( ! [X0 : $int] : (0 = $sum($uminus(X0),X0)) )),
% 0.32/0.37 inference(superposition,[],[f7,f13])).
% 0.32/0.37 tff(f45,plain,(
% 0.32/0.37 ( ! [X0 : $int] : (~$less(X0,$sum(sK1,$uminus(sK0))) | $less(X0,$sum(sK0,$uminus(sK1)))) )),
% 0.32/0.37 inference(resolution,[],[f9,f17])).
% 0.32/0.37 tff(f48,plain,(
% 0.32/0.37 $less(sK0,sK1) | sK0 = sK1),
% 0.32/0.37 inference(resolution,[],[f10,f18])).
% 0.32/0.37 tff(f58,definition,(
% 0.32/0.37 spl2_1 <=> sK0 = sK1),
% 0.32/0.37 introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition])).
% 0.32/0.37 tff(f60,plain,(
% 0.32/0.37 sK0 = sK1 | ~spl2_1),
% 0.32/0.37 inference(avatar_component_clause,[],[f58])).
% 0.32/0.37 tff(f62,definition,(
% 0.32/0.37 spl2_2 <=> $less(sK0,sK1)),
% 0.32/0.37 introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition])).
% 0.32/0.37 tff(f64,plain,(
% 0.32/0.37 $less(sK0,sK1) | ~spl2_2),
% 0.32/0.37 inference(avatar_component_clause,[],[f62])).
% 0.32/0.37 tff(f66,plain,(
% 0.32/0.37 spl2_1 | spl2_2),
% 0.32/0.37 inference(avatar_split_clause,[],[f48,f62,f58])).
% 0.32/0.37 tff(f87,plain,(
% 0.32/0.37 ( ! [X0 : $int] : ($less($sum(X0,$uminus(sK0)),$sum(sK0,$uminus(sK1))) | ~$less(X0,sK1)) )),
% 0.32/0.37 inference(resolution,[],[f11,f45])).
% 0.32/0.37 tff(f97,plain,(
% 0.32/0.37 ( ! [X0 : $int,X1 : $int] : ($less($sum(X0,$uminus(X1)),0) | ~$less(X0,X1)) )),
% 0.32/0.37 inference(superposition,[],[f11,f7])).
% 0.32/0.37 tff(f144,plain,(
% 0.32/0.37 $less(0,$sum(sK0,$uminus(sK1))) | ~$less($uminus($uminus(sK0)),sK1)),
% 0.32/0.37 inference(superposition,[],[f87,f19])).
% 0.32/0.37 tff(f146,plain,(
% 0.32/0.37 $less(0,$sum(sK0,$uminus(sK1))) | ~$less(sK0,sK1)),
% 0.32/0.37 inference(evaluation,[],[f144])).
% 0.32/0.37 tff(f147,plain,(
% 0.32/0.37 $less(0,$sum(sK0,$uminus(sK1))) | ~spl2_2),
% 0.32/0.37 inference(forward_subsumption_resolution,[],[f146,f64])).
% 0.32/0.37 tff(f149,plain,(
% 0.32/0.37 ( ! [X0 : $int] : ($less(X0,$sum(sK0,$uminus(sK1))) | ~$less(X0,0)) ) | ~spl2_2),
% 0.32/0.37 inference(resolution,[],[f147,f9])).
% 0.32/0.37 tff(f161,plain,(
% 0.32/0.37 ~$less($sum(sK0,$uminus(sK1)),0) | ~spl2_2),
% 0.32/0.37 inference(resolution,[],[f149,f8])).
% 0.32/0.37 tff(f214,plain,(
% 0.32/0.37 ~$less(sK0,sK1) | ~spl2_2),
% 0.32/0.37 inference(resolution,[],[f97,f161])).
% 0.32/0.37 tff(f225,plain,(
% 0.32/0.37 $false | ~spl2_2),
% 0.32/0.37 inference(forward_subsumption_resolution,[],[f214,f64])).
% 0.32/0.37 tff(f226,plain,(
% 0.32/0.37 ~spl2_2),
% 0.32/0.37 inference(avatar_contradiction_clause,[],[f225])).
% 0.32/0.37 tff(f236,plain,(
% 0.32/0.37 $less($sum(sK0,$uminus(sK0)),$sum(sK0,$uminus(sK0))) | ~spl2_1),
% 0.32/0.37 inference(superposition,[],[f17,f60])).
% 0.32/0.37 tff(f242,plain,(
% 0.32/0.37 $false | ~spl2_1),
% 0.32/0.37 inference(forward_subsumption_resolution,[],[f236,f8])).
% 0.32/0.37 tff(f243,plain,(
% 0.32/0.37 ~spl2_1),
% 0.32/0.37 inference(avatar_contradiction_clause,[],[f242])).
% 0.32/0.37 cnf(s2, plain, spl2_1 | spl2_2, inference(sat_conversion,[],[f66])).
% 0.32/0.37 cnf(s4, plain, ~spl2_2, inference(sat_conversion,[],[f226])).
% 0.32/0.37 cnf(s10, plain, ~spl2_1, inference(sat_conversion,[],[f243])).
% 0.32/0.37 cnf(s11, plain, $false, inference(rat,[],[s2,s4,s10])).
% 0.32/0.37 tff(f244,plain,(
% 0.32/0.37 $false),
% 0.32/0.37 inference(avatar_sat_refutation,[],[s11])).
% 0.32/0.37 % SZS output end Proof for theBenchmark
% 0.32/0.37 % (733115)------------------------------
% 0.32/0.37 % (733115)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.32/0.37 % (733115)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.32/0.37 % (733115)CaDiCaL version: 2.1.3
% 0.32/0.37 % (733115)Termination reason: Refutation
% 0.32/0.37 % (733115)Time elapsed: 0.013 s
% 0.32/0.37 % (733115)Peak memory usage: 12 MB
% 0.32/0.37 % (733115)Instructions burned: 9 (million)
% 0.32/0.37 % (733107)Success in time 0.053 s
% 0.32/0.37 % Vampire exiting
%------------------------------------------------------------------------------