%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM913_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 : n003.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:02 PM UTC 2026
% Result : Theorem 0.12s 0.46s
% Output : Refutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM913_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.12/0.38 % Computer : n003.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Sun Sep 27 21:41:11 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42 Running first-order model finding
% 0.12/0.42 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.12/0.46 % (940527)Will run a generic schedule for satisfiability detection.
% 0.12/0.46 % (940535)dis+10_1_sil=32000:sp=arity:random_seed=2239678171:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.12/0.46 % (940535) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-940527-940535"...
% 0.12/0.46 % (940533)% WARNING: option uhcvi not known.
% 0.12/0.46 % (940535)...printing done.
% 0.12/0.46 % (940535)Refutation found. Thanks to Tanya!
% 0.12/0.46 % SZS status Theorem for theBenchmark
% 0.12/0.46 % SZS output start Proof for theBenchmark
% 0.12/0.46 tff(func_def_4, type, sK0: $real).
% 0.12/0.46 tff(func_def_5, type, sK1: $real).
% 0.12/0.46 tff(f1,conjecture,(
% 0.12/0.46 ! [X0 : $real,X1 : $real] : ($lesseq(X0,X1) <=> ($less(X0,X1) | X0 = X1))),
% 0.12/0.46 file('/export/starexec/sandbox/benchmark/theBenchmark.p',real_combined_problem_1)).
% 0.12/0.46 tff(f2,negated_conjecture,(
% 0.12/0.46 ~ ! [X0 : $real,X1 : $real] : ($lesseq(X0,X1) <=> ($less(X0,X1) | X0 = X1))),
% 0.12/0.46 inference(negated_conjecture,[status(cth)],[f1])).
% 0.12/0.46 tff(f3,plain,(
% 0.12/0.46 ~ ! [X0 : $real,X1 : $real] : (~$less(X1,X0) <=> ($less(X0,X1) | X0 = X1))),
% 0.12/0.46 inference(theory_normalization,[],[f2])).
% 0.12/0.46 tff(f9,definition,(
% 0.12/0.46 ( ! [X0 : $real] : (~$less(X0,X0)) )),
% 0.12/0.46 introduced(theory,[tha_non-reflexivity])).
% 0.12/0.46 tff(f10,definition,(
% 0.12/0.46 ( ! [X2 : $real,X0 : $real,X1 : $real] : (~$less(X1,X2) | ~$less(X0,X1) | $less(X0,X2)) )),
% 0.12/0.46 introduced(theory,[tha_transitivity])).
% 0.12/0.46 tff(f11,definition,(
% 0.12/0.46 ( ! [X0 : $real,X1 : $real] : ($less(X1,X0) | $less(X0,X1) | X0 = X1) )),
% 0.12/0.46 introduced(theory,[tha_order_totality])).
% 0.12/0.46 tff(f15,plain,(
% 0.12/0.46 ? [X0 : $real,X1 : $real] : (~$less(X1,X0) <~> ($less(X0,X1) | X0 = X1))),
% 0.12/0.46 inference(ennf_transformation,[],[f3])).
% 0.12/0.46 tff(f16,plain,(
% 0.12/0.46 ? [X0 : $real,X1 : $real] : (((~$less(X0,X1) & X0 != X1) | $less(X1,X0)) & (($less(X0,X1) | X0 = X1) | ~$less(X1,X0)))),
% 0.12/0.46 inference(nnf_transformation,[],[f15])).
% 0.12/0.46 tff(f17,plain,(
% 0.12/0.46 ? [X0 : $real,X1 : $real] : (((~$less(X0,X1) & X0 != X1) | $less(X1,X0)) & ($less(X0,X1) | X0 = X1 | ~$less(X1,X0)))),
% 0.12/0.46 inference(flattening,[],[f16])).
% 0.12/0.46 tff(f18,plain,(
% 0.12/0.46 ((~$less(sK0,sK1) & sK0 != sK1) | $less(sK1,sK0)) & ($less(sK0,sK1) | sK0 = sK1 | ~$less(sK1,sK0))),
% 0.12/0.46 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f17])).
% 0.12/0.46 tff(f19,plain,(
% 0.12/0.46 $less(sK0,sK1) | sK0 = sK1 | ~$less(sK1,sK0)),
% 0.12/0.46 inference(cnf_transformation,[],[f18])).
% 0.12/0.46 tff(f20,plain,(
% 0.12/0.46 sK0 != sK1 | $less(sK1,sK0)),
% 0.12/0.46 inference(cnf_transformation,[],[f18])).
% 0.12/0.46 tff(f21,plain,(
% 0.12/0.46 ~$less(sK0,sK1) | $less(sK1,sK0)),
% 0.12/0.46 inference(cnf_transformation,[],[f18])).
% 0.12/0.46 tff(f23,definition,(
% 0.12/0.46 spl2_1 <=> $less(sK1,sK0)),
% 0.12/0.46 introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition])).
% 0.12/0.46 tff(f24,plain,(
% 0.12/0.46 $less(sK1,sK0) | ~spl2_1),
% 0.12/0.46 inference(avatar_component_clause,[],[f23])).
% 0.12/0.46 tff(f25,plain,(
% 0.12/0.46 ~$less(sK1,sK0) | spl2_1),
% 0.12/0.46 inference(avatar_component_clause,[],[f23])).
% 0.12/0.46 tff(f27,definition,(
% 0.12/0.46 spl2_2 <=> sK0 = sK1),
% 0.12/0.46 introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition])).
% 0.12/0.46 tff(f28,plain,(
% 0.12/0.46 sK0 != sK1 | spl2_2),
% 0.12/0.46 inference(avatar_component_clause,[],[f27])).
% 0.12/0.46 tff(f29,plain,(
% 0.12/0.46 sK0 = sK1 | ~spl2_2),
% 0.12/0.46 inference(avatar_component_clause,[],[f27])).
% 0.12/0.46 tff(f31,definition,(
% 0.12/0.46 spl2_3 <=> $less(sK0,sK1)),
% 0.12/0.46 introduced(definition,[new_symbols(definition,[spl2_3])],[avatar_definition])).
% 0.12/0.46 tff(f32,plain,(
% 0.12/0.46 ~$less(sK0,sK1) | spl2_3),
% 0.12/0.46 inference(avatar_component_clause,[],[f31])).
% 0.12/0.46 tff(f33,plain,(
% 0.12/0.46 $less(sK0,sK1) | ~spl2_3),
% 0.12/0.46 inference(avatar_component_clause,[],[f31])).
% 0.12/0.46 tff(f34,plain,(
% 0.12/0.46 ~spl2_1 | spl2_2 | spl2_3),
% 0.12/0.46 inference(avatar_split_clause,[],[f19,f31,f27,f23])).
% 0.12/0.46 tff(f35,plain,(
% 0.12/0.46 spl2_1 | ~spl2_2),
% 0.12/0.46 inference(avatar_split_clause,[],[f20,f27,f23])).
% 0.12/0.46 tff(f36,plain,(
% 0.12/0.46 spl2_1 | ~spl2_3),
% 0.12/0.46 inference(avatar_split_clause,[],[f21,f31,f23])).
% 0.12/0.46 tff(f55,plain,(
% 0.12/0.46 $less(sK0,sK1) | sK0 = sK1 | spl2_1),
% 0.12/0.46 inference(resolution,[],[f11,f25])).
% 0.12/0.46 tff(f61,plain,(
% 0.12/0.46 sK0 = sK1 | (spl2_1 | spl2_3)),
% 0.12/0.46 inference(forward_subsumption_resolution,[],[f55,f32])).
% 0.12/0.46 tff(f64,plain,(
% 0.12/0.46 $false | (spl2_1 | spl2_2 | spl2_3)),
% 0.12/0.46 inference(forward_subsumption_resolution,[],[f61,f28])).
% 0.12/0.46 tff(f65,plain,(
% 0.12/0.46 spl2_1 | spl2_2 | spl2_3),
% 0.12/0.46 inference(avatar_contradiction_clause,[],[f64])).
% 0.12/0.46 tff(f66,plain,(
% 0.12/0.46 ( ! [X0 : $real] : (~$less(X0,sK1) | $less(X0,sK0)) ) | ~spl2_1),
% 0.12/0.46 inference(resolution,[],[f24,f10])).
% 0.12/0.46 tff(f67,plain,(
% 0.12/0.46 $less(sK0,sK0) | (~spl2_1 | ~spl2_2)),
% 0.12/0.46 inference(superposition,[],[f24,f29])).
% 0.12/0.46 tff(f69,plain,(
% 0.12/0.46 $false | (~spl2_1 | ~spl2_2)),
% 0.12/0.46 inference(forward_subsumption_resolution,[],[f67,f9])).
% 0.12/0.46 tff(f70,plain,(
% 0.12/0.46 ~spl2_1 | ~spl2_2),
% 0.12/0.46 inference(avatar_contradiction_clause,[],[f69])).
% 0.12/0.46 tff(f74,plain,(
% 0.12/0.46 $less(sK0,sK0) | (~spl2_1 | ~spl2_3)),
% 0.12/0.46 inference(resolution,[],[f66,f33])).
% 0.12/0.46 tff(f75,plain,(
% 0.12/0.46 $false | (~spl2_1 | ~spl2_3)),
% 0.12/0.46 inference(forward_subsumption_resolution,[],[f74,f9])).
% 0.12/0.46 tff(f76,plain,(
% 0.12/0.46 ~spl2_1 | ~spl2_3),
% 0.12/0.46 inference(avatar_contradiction_clause,[],[f75])).
% 0.12/0.46 cnf(s1, plain, ~spl2_1 | spl2_2 | spl2_3, inference(sat_conversion,[],[f34])).
% 0.12/0.46 cnf(s2, plain, spl2_1 | ~spl2_2, inference(sat_conversion,[],[f35])).
% 0.12/0.46 cnf(s3, plain, spl2_1 | ~spl2_3, inference(sat_conversion,[],[f36])).
% 0.12/0.46 cnf(s5, plain, spl2_1 | spl2_2 | spl2_3, inference(sat_conversion,[],[f65])).
% 0.12/0.46 cnf(s6, plain, ~spl2_1 | ~spl2_2, inference(sat_conversion,[],[f70])).
% 0.12/0.46 cnf(s7, plain, ~spl2_1 | ~spl2_3, inference(sat_conversion,[],[f76])).
% 0.12/0.46 cnf(s8, plain, spl2_1, inference(rat,[],[s5,s2,s3])).
% 0.12/0.46 cnf(s9, plain, ~spl2_3, inference(rat,[],[s7,s8])).
% 0.12/0.46 cnf(s10, plain, ~spl2_2, inference(rat,[],[s6,s8])).
% 0.12/0.46 cnf(s11, plain, $false, inference(rat,[],[s1,s9,s10,s8])).
% 0.12/0.46 tff(f77,plain,(
% 0.12/0.46 $false),
% 0.12/0.46 inference(avatar_sat_refutation,[],[s11])).
% 0.12/0.46 % SZS output end Proof for theBenchmark
% 0.12/0.46 % (940535)------------------------------
% 0.12/0.46 % (940535)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.12/0.46 % (940535)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.12/0.46 % (940535)CaDiCaL version: 2.1.3
% 0.12/0.46 % (940535)Termination reason: Refutation
% 0.12/0.46 % (940535)Time elapsed: 0.002 s
% 0.12/0.46 % (940535)Peak memory usage: 13 MB
% 0.12/0.46 % (940535)Instructions burned: 3 (million)
% 0.12/0.46 % (940527)Success in time 0.032 s
% 0.12/0.46 % Vampire exiting
%------------------------------------------------------------------------------