%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM892_1 : TPTP v9.3.1. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/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 12:26:00 PM UTC 2026
% Result : Theorem 0.18s 10.51s
% Output : Refutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM892_1 : TPTP v9.3.1. Released v5.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.14/10.42 % Computer : n008.cluster.edu
% 0.14/10.42 % Model : x86_64 x86_64
% 0.14/10.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/10.42 % Memory : 8046.5625MB
% 0.14/10.42 % OS : Linux 6.8.0-71-generic
% 0.14/10.42 % CPULimit : 300
% 0.14/10.42 % WCLimit : 300
% 0.14/10.42 % DateTime : Sun Sep 27 21:39:35 UTC 2026
% 0.14/10.42 % CPUTime :
% 0.14/10.42 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.14/10.47 Running first-order model finding
% 0.14/10.47 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.18/10.51 % (1625135)Will run a generic schedule for satisfiability detection.
% 0.18/10.51 % (1625145)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4251065053:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.18/10.51 % (1625140)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3837499683_3000 on theBenchmark for (3000ds/0Mi)
% 0.18/10.51 % (1625140)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.18/10.51 % (1625140)Terminated due to inappropriate strategy.
% 0.18/10.51 % (1625140)------------------------------
% 0.18/10.51 % (1625140)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/10.51 % (1625140)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/10.51 % (1625140)CaDiCaL version: 2.1.3
% 0.18/10.51 % (1625140)Termination reason: Inappropriate
% 0.18/10.51 % (1625140)Time elapsed: 0.0000 s
% 0.18/10.51 % (1625140)Peak memory usage: 10 MB
% 0.18/10.51 % (1625140)------------------------------
% 0.18/10.51 % (1625140)------------------------------
% 0.18/10.51 % (1625145) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1625135-1625145"...
% 0.18/10.51 % (1625145)...printing done.
% 0.18/10.51 % (1625141)% WARNING: option uhcvi not known.
% 0.18/10.51 % (1625145)Refutation found. Thanks to Tanya!
% 0.18/10.51 % SZS status Theorem for theBenchmark
% 0.18/10.51 % SZS output start Proof for theBenchmark
% 0.18/10.51 tff(func_def_4, type, sK0: $int).
% 0.18/10.51 tff(func_def_5, type, sK1: $int).
% 0.18/10.51 tff(f1,conjecture,(
% 0.18/10.51 ! [X0 : $int,X1 : $int] : ($lesseq(X0,X1) <=> ($less(X0,X1) | X0 = X1))),
% 0.18/10.51 file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_lesseq)).
% 0.18/10.51 tff(f2,negated_conjecture,(
% 0.18/10.51 ~ ! [X0 : $int,X1 : $int] : ($lesseq(X0,X1) <=> ($less(X0,X1) | X0 = X1))),
% 0.18/10.51 inference(negated_conjecture,[status(cth)],[f1])).
% 0.18/10.51 tff(f3,plain,(
% 0.18/10.51 ~ ! [X0 : $int,X1 : $int] : (~$less(X1,X0) <=> ($less(X0,X1) | X0 = X1))),
% 0.18/10.51 inference(theory_normalization,[],[f2])).
% 0.18/10.51 tff(f9,definition,(
% 0.18/10.51 ( ! [X0 : $int] : (~$less(X0,X0)) )),
% 0.18/10.51 introduced(theory,[tha_non-reflexivity])).
% 0.18/10.51 tff(f10,definition,(
% 0.18/10.51 ( ! [X2 : $int,X0 : $int,X1 : $int] : (~$less(X0,X1) | ~$less(X1,X2) | $less(X0,X2)) )),
% 0.18/10.51 introduced(theory,[tha_transitivity])).
% 0.18/10.51 tff(f11,definition,(
% 0.18/10.51 ( ! [X0 : $int,X1 : $int] : ($less(X0,X1) | $less(X1,X0) | X0 = X1) )),
% 0.18/10.51 introduced(theory,[tha_order_totality])).
% 0.18/10.51 tff(f16,plain,(
% 0.18/10.51 ? [X0 : $int,X1 : $int] : (~$less(X1,X0) <~> ($less(X0,X1) | X0 = X1))),
% 0.18/10.51 inference(ennf_transformation,[],[f3])).
% 0.18/10.51 tff(f17,plain,(
% 0.18/10.51 ? [X0 : $int,X1 : $int] : (((~$less(X0,X1) & X0 != X1) | $less(X1,X0)) & (($less(X0,X1) | X0 = X1) | ~$less(X1,X0)))),
% 0.18/10.51 inference(nnf_transformation,[],[f16])).
% 0.18/10.51 tff(f18,plain,(
% 0.18/10.51 ? [X0 : $int,X1 : $int] : (((~$less(X0,X1) & X0 != X1) | $less(X1,X0)) & ($less(X0,X1) | X0 = X1 | ~$less(X1,X0)))),
% 0.18/10.51 inference(flattening,[],[f17])).
% 0.18/10.51 tff(f19,plain,(
% 0.18/10.51 ((~$less(sK0,sK1) & sK0 != sK1) | $less(sK1,sK0)) & ($less(sK0,sK1) | sK0 = sK1 | ~$less(sK1,sK0))),
% 0.18/10.51 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f18])).
% 0.18/10.51 tff(f20,plain,(
% 0.18/10.51 $less(sK0,sK1) | sK0 = sK1 | ~$less(sK1,sK0)),
% 0.18/10.51 inference(cnf_transformation,[],[f19])).
% 0.18/10.51 tff(f21,plain,(
% 0.18/10.51 sK0 != sK1 | $less(sK1,sK0)),
% 0.18/10.51 inference(cnf_transformation,[],[f19])).
% 0.18/10.51 tff(f22,plain,(
% 0.18/10.51 ~$less(sK0,sK1) | $less(sK1,sK0)),
% 0.18/10.51 inference(cnf_transformation,[],[f19])).
% 0.18/10.51 tff(f24,definition,(
% 0.18/10.51 spl2_1 <=> $less(sK1,sK0)),
% 0.18/10.51 introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition])).
% 0.18/10.51 tff(f25,plain,(
% 0.18/10.51 $less(sK1,sK0) | ~spl2_1),
% 0.18/10.51 inference(avatar_component_clause,[],[f24])).
% 0.18/10.51 tff(f26,plain,(
% 0.18/10.51 ~$less(sK1,sK0) | spl2_1),
% 0.18/10.51 inference(avatar_component_clause,[],[f24])).
% 0.18/10.51 tff(f28,definition,(
% 0.18/10.51 spl2_2 <=> sK0 = sK1),
% 0.18/10.51 introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition])).
% 0.18/10.51 tff(f29,plain,(
% 0.18/10.51 sK0 != sK1 | spl2_2),
% 0.18/10.51 inference(avatar_component_clause,[],[f28])).
% 0.18/10.51 tff(f30,plain,(
% 0.18/10.51 sK0 = sK1 | ~spl2_2),
% 0.18/10.51 inference(avatar_component_clause,[],[f28])).
% 0.18/10.51 tff(f32,definition,(
% 0.18/10.51 spl2_3 <=> $less(sK0,sK1)),
% 0.18/10.51 introduced(definition,[new_symbols(definition,[spl2_3])],[avatar_definition])).
% 0.18/10.51 tff(f33,plain,(
% 0.18/10.51 ~$less(sK0,sK1) | spl2_3),
% 0.18/10.51 inference(avatar_component_clause,[],[f32])).
% 0.18/10.51 tff(f34,plain,(
% 0.18/10.51 $less(sK0,sK1) | ~spl2_3),
% 0.18/10.51 inference(avatar_component_clause,[],[f32])).
% 0.18/10.51 tff(f35,plain,(
% 0.18/10.51 ~spl2_1 | spl2_2 | spl2_3),
% 0.18/10.51 inference(avatar_split_clause,[],[f20,f32,f28,f24])).
% 0.18/10.51 tff(f36,plain,(
% 0.18/10.51 spl2_1 | ~spl2_2),
% 0.18/10.51 inference(avatar_split_clause,[],[f21,f28,f24])).
% 0.18/10.51 tff(f37,plain,(
% 0.18/10.51 spl2_1 | ~spl2_3),
% 0.18/10.51 inference(avatar_split_clause,[],[f22,f32,f24])).
% 0.18/10.51 tff(f61,plain,(
% 0.18/10.51 $less(sK0,sK1) | sK0 = sK1 | spl2_1),
% 0.18/10.51 inference(resolution,[],[f11,f26])).
% 0.18/10.51 tff(f77,plain,(
% 0.18/10.51 sK0 = sK1 | (spl2_1 | spl2_3)),
% 0.18/10.51 inference(forward_subsumption_resolution,[],[f61,f33])).
% 0.18/10.51 tff(f81,plain,(
% 0.18/10.51 $false | (spl2_1 | spl2_2 | spl2_3)),
% 0.18/10.51 inference(forward_subsumption_resolution,[],[f77,f29])).
% 0.18/10.51 tff(f82,plain,(
% 0.18/10.51 spl2_1 | spl2_2 | spl2_3),
% 0.18/10.51 inference(avatar_contradiction_clause,[],[f81])).
% 0.18/10.51 tff(f83,plain,(
% 0.18/10.51 ( ! [X0 : $int] : (~$less(sK0,X0) | $less(sK1,X0)) ) | ~spl2_1),
% 0.18/10.51 inference(resolution,[],[f25,f10])).
% 0.18/10.51 tff(f88,plain,(
% 0.18/10.51 $less(sK0,sK0) | (~spl2_1 | ~spl2_2)),
% 0.18/10.51 inference(superposition,[],[f25,f30])).
% 0.18/10.51 tff(f90,plain,(
% 0.18/10.51 $false | (~spl2_1 | ~spl2_2)),
% 0.18/10.51 inference(forward_subsumption_resolution,[],[f88,f9])).
% 0.18/10.51 tff(f91,plain,(
% 0.18/10.51 ~spl2_1 | ~spl2_2),
% 0.18/10.51 inference(avatar_contradiction_clause,[],[f90])).
% 0.18/10.51 tff(f163,plain,(
% 0.18/10.51 $less(sK1,sK1) | (~spl2_1 | ~spl2_3)),
% 0.18/10.51 inference(resolution,[],[f83,f34])).
% 0.18/10.51 tff(f175,plain,(
% 0.18/10.51 $false | (~spl2_1 | ~spl2_3)),
% 0.18/10.51 inference(forward_subsumption_resolution,[],[f163,f9])).
% 0.18/10.51 tff(f176,plain,(
% 0.18/10.51 ~spl2_1 | ~spl2_3),
% 0.18/10.51 inference(avatar_contradiction_clause,[],[f175])).
% 0.18/10.51 cnf(s1, plain, ~spl2_1 | spl2_2 | spl2_3, inference(sat_conversion,[],[f35])).
% 0.18/10.51 cnf(s2, plain, spl2_1 | ~spl2_2, inference(sat_conversion,[],[f36])).
% 0.18/10.51 cnf(s3, plain, spl2_1 | ~spl2_3, inference(sat_conversion,[],[f37])).
% 0.18/10.51 cnf(s7, plain, spl2_1 | spl2_2 | spl2_3, inference(sat_conversion,[],[f82])).
% 0.18/10.51 cnf(s8, plain, ~spl2_1 | ~spl2_2, inference(sat_conversion,[],[f91])).
% 0.18/10.51 cnf(s13, plain, ~spl2_1 | ~spl2_3, inference(sat_conversion,[],[f176])).
% 0.18/10.51 cnf(s14, plain, spl2_1, inference(rat,[],[s7,s2,s3])).
% 0.18/10.51 cnf(s15, plain, ~spl2_3, inference(rat,[],[s13,s14])).
% 0.18/10.51 cnf(s16, plain, ~spl2_2, inference(rat,[],[s8,s14])).
% 0.18/10.51 cnf(s17, plain, $false, inference(rat,[],[s1,s15,s16,s14])).
% 0.18/10.51 tff(f178,plain,(
% 0.18/10.51 $false),
% 0.18/10.51 inference(avatar_sat_refutation,[],[s17])).
% 0.18/10.51 % SZS output end Proof for theBenchmark
% 0.18/10.51 % (1625145)------------------------------
% 0.18/10.51 % (1625145)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/10.51 % (1625145)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/10.51 % (1625145)CaDiCaL version: 2.1.3
% 0.18/10.51 % (1625145)Termination reason: Refutation
% 0.18/10.51 % (1625145)Time elapsed: 0.005 s
% 0.18/10.51 % (1625145)Peak memory usage: 12 MB
% 0.18/10.51 % (1625145)Instructions burned: 6 (million)
% 0.18/10.51 % (1625135)Success in time 0.028 s
% 0.18/10.51 % Vampire exiting
%------------------------------------------------------------------------------