%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : ARI762_1 : TPTP v9.3.1. Released v9.1.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 09:35:13 AM UTC 2026
% Result : Theorem 0.20s 0.26s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ARI762_1 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.18 % Computer : n003.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Mon Sep 28 21:03:57 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22 Running first-order model finding
% 0.08/0.22 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.20/0.26 % (2013270)Will run a generic schedule for satisfiability detection.
% 0.20/0.26 % (2013279)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1147577464:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.26 % (2013276)% WARNING: option uhcvi not known.
% 0.20/0.26 % (2013279) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2013270-2013279"...
% 0.20/0.26 % (2013279)...printing done.
% 0.20/0.26 % (2013279)Refutation found. Thanks to Tanya!
% 0.20/0.26 % SZS status Theorem for theBenchmark
% 0.20/0.26 % SZS output start Proof for theBenchmark
% 0.20/0.26 tff(func_def_0, type, max: ($int * $int) > $int).
% 0.20/0.26 tff(func_def_5, type, sK0: $int).
% 0.20/0.26 tff(func_def_6, type, sK1: $int).
% 0.20/0.26 tff(f1,axiom,(
% 0.20/0.26 ! [X0 : $int,X1 : $int] : max(X0,X1) = $ite($less(X0,X1), (X1,X0)),
% 0.20/0.26 file('/export/starexec/sandbox/benchmark/theBenchmark.p',max_definition)).
% 0.20/0.26 tff(f2,conjecture,(
% 0.20/0.26 ! [X0 : $int,X1 : $int] : $ite(max(X0,X1) = X0, ($greatereq(X0,X1),$greatereq(X1,X0))),
% 0.20/0.26 file('/export/starexec/sandbox/benchmark/theBenchmark.p',max_conjecture)).
% 0.20/0.26 tff(f3,negated_conjecture,(
% 0.20/0.26 ~ ! [X0 : $int,X1 : $int] : $ite(max(X0,X1) = X0, ($greatereq(X0,X1),$greatereq(X1,X0))),
% 0.20/0.26 inference(negated_conjecture,[status(cth)],[f2])).
% 0.20/0.26 tff(f4,plain,(
% 0.20/0.26 ! [X0 : $int,X1 : $int] : max(X0,X1) = $ite($less(X0,X1), (X1,X0)),
% 0.20/0.26 inference(theory_normalization,[],[f1])).
% 0.20/0.26 tff(f5,plain,(
% 0.20/0.26 ~ ! [X0 : $int,X1 : $int] : $ite(max(X0,X1) = X0, (~$less(X0,X1),~$less(X1,X0))),
% 0.20/0.26 inference(theory_normalization,[],[f3])).
% 0.20/0.26 tff(f11,definition,(
% 0.20/0.26 ( ! [X0 : $int] : (~$less(X0,X0)) )),
% 0.20/0.26 introduced(theory,[tha_non-reflexivity])).
% 0.20/0.26 tff(f12,definition,(
% 0.20/0.26 ( ! [X2 : $int,X0 : $int,X1 : $int] : (~$less(X0,X1) | ~$less(X1,X2) | $less(X0,X2)) )),
% 0.20/0.26 introduced(theory,[tha_transitivity])).
% 0.20/0.26 tff(f18,plain,(
% 0.20/0.26 ~ ! [X0 : $int,X1 : $int] : $ite(max(X0,X1) = X0, (~$less(X0,X1),~$less(X1,X0))),
% 0.20/0.26 inference(rectify,[],[f5])).
% 0.20/0.26 tff(f19,plain,(
% 0.20/0.26 ? [X0 : $int,X1 : $int] : $ite(max(X0,X1) = X0, ($less(X0,X1),$less(X1,X0))),
% 0.20/0.26 inference(ennf_transformation,[],[f18])).
% 0.20/0.26 tff(f20,plain,(
% 0.20/0.26 ( ! [X0 : $int,X1 : $int] : (~$less(X0,X1) | max(X0,X1) = X1) )),
% 0.20/0.26 inference(cnf_transformation,[],[f4])).
% 0.20/0.26 tff(f21,plain,(
% 0.20/0.26 ( ! [X0 : $int,X1 : $int] : ($less(X0,X1) | max(X0,X1) = X0) )),
% 0.20/0.26 inference(cnf_transformation,[],[f4])).
% 0.20/0.26 tff(f22,plain,(
% 0.20/0.26 $less(sK1,sK0) | sK0 = max(sK0,sK1)),
% 0.20/0.26 inference(cnf_transformation,[],[f19])).
% 0.20/0.26 tff(f23,plain,(
% 0.20/0.26 $less(sK0,sK1) | sK0 != max(sK0,sK1)),
% 0.20/0.26 inference(cnf_transformation,[],[f19])).
% 0.20/0.26 tff(f25,definition,(
% 0.20/0.26 spl2_1 <=> sK0 = max(sK0,sK1)),
% 0.20/0.26 introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition])).
% 0.20/0.26 tff(f26,plain,(
% 0.20/0.26 sK0 != max(sK0,sK1) | spl2_1),
% 0.20/0.26 inference(avatar_component_clause,[],[f25])).
% 0.20/0.26 tff(f27,plain,(
% 0.20/0.26 sK0 = max(sK0,sK1) | ~spl2_1),
% 0.20/0.26 inference(avatar_component_clause,[],[f25])).
% 0.20/0.26 tff(f29,definition,(
% 0.20/0.26 spl2_2 <=> $less(sK1,sK0)),
% 0.20/0.26 introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition])).
% 0.20/0.26 tff(f31,plain,(
% 0.20/0.26 $less(sK1,sK0) | ~spl2_2),
% 0.20/0.26 inference(avatar_component_clause,[],[f29])).
% 0.20/0.26 tff(f32,plain,(
% 0.20/0.26 spl2_1 | spl2_2),
% 0.20/0.26 inference(avatar_split_clause,[],[f22,f29,f25])).
% 0.20/0.26 tff(f34,definition,(
% 0.20/0.26 spl2_3 <=> $less(sK0,sK1)),
% 0.20/0.26 introduced(definition,[new_symbols(definition,[spl2_3])],[avatar_definition])).
% 0.20/0.26 tff(f35,plain,(
% 0.20/0.26 ~$less(sK0,sK1) | spl2_3),
% 0.20/0.26 inference(avatar_component_clause,[],[f34])).
% 0.20/0.26 tff(f36,plain,(
% 0.20/0.26 $less(sK0,sK1) | ~spl2_3),
% 0.20/0.26 inference(avatar_component_clause,[],[f34])).
% 0.20/0.26 tff(f37,plain,(
% 0.20/0.26 ~spl2_1 | spl2_3),
% 0.20/0.26 inference(avatar_split_clause,[],[f23,f34,f25])).
% 0.20/0.26 tff(f65,plain,(
% 0.20/0.26 ( ! [X0 : $int] : ($less(sK1,X0) | ~$less(sK0,X0)) ) | ~spl2_2),
% 0.20/0.26 inference(resolution,[],[f12,f31])).
% 0.20/0.26 tff(f82,plain,(
% 0.20/0.26 ~$less(sK0,sK1) | ~spl2_2),
% 0.20/0.26 inference(resolution,[],[f65,f11])).
% 0.20/0.26 tff(f87,plain,(
% 0.20/0.26 ~spl2_3 | ~spl2_2),
% 0.20/0.26 inference(avatar_split_clause,[],[f82,f29,f34])).
% 0.20/0.26 tff(f89,plain,(
% 0.20/0.26 sK0 = max(sK0,sK1) | spl2_3),
% 0.20/0.26 inference(resolution,[],[f35,f21])).
% 0.20/0.26 tff(f90,plain,(
% 0.20/0.26 $false | (spl2_1 | spl2_3)),
% 0.20/0.26 inference(forward_subsumption_resolution,[],[f89,f26])).
% 0.20/0.26 tff(f91,plain,(
% 0.20/0.26 spl2_1 | spl2_3),
% 0.20/0.26 inference(avatar_contradiction_clause,[],[f90])).
% 0.20/0.26 tff(f95,plain,(
% 0.20/0.26 sK1 = max(sK0,sK1) | ~spl2_3),
% 0.20/0.26 inference(resolution,[],[f36,f20])).
% 0.20/0.26 tff(f96,plain,(
% 0.20/0.26 sK0 = sK1 | (~spl2_1 | ~spl2_3)),
% 0.20/0.26 inference(forward_demodulation,[],[f95,f27])).
% 0.20/0.26 tff(f97,plain,(
% 0.20/0.26 $less(sK0,sK0) | (~spl2_1 | ~spl2_3)),
% 0.20/0.26 inference(superposition,[],[f36,f96])).
% 0.20/0.26 tff(f99,plain,(
% 0.20/0.26 $false | (~spl2_1 | ~spl2_3)),
% 0.20/0.26 inference(forward_subsumption_resolution,[],[f97,f11])).
% 0.20/0.26 tff(f100,plain,(
% 0.20/0.26 ~spl2_1 | ~spl2_3),
% 0.20/0.26 inference(avatar_contradiction_clause,[],[f99])).
% 0.20/0.26 cnf(s1, plain, spl2_1 | spl2_2, inference(sat_conversion,[],[f32])).
% 0.20/0.26 cnf(s2, plain, ~spl2_1 | spl2_3, inference(sat_conversion,[],[f37])).
% 0.20/0.26 cnf(s3, plain, ~spl2_2 | ~spl2_3, inference(sat_conversion,[],[f87])).
% 0.20/0.26 cnf(s4, plain, spl2_1 | spl2_3, inference(sat_conversion,[],[f91])).
% 0.20/0.26 cnf(s5, plain, ~spl2_1 | ~spl2_3, inference(sat_conversion,[],[f100])).
% 0.20/0.26 cnf(s6, plain, spl2_1, inference(rat,[],[s3,s1,s4])).
% 0.20/0.26 cnf(s7, plain, ~spl2_3, inference(rat,[],[s5,s6])).
% 0.20/0.26 cnf(s8, plain, $false, inference(rat,[],[s2,s7,s6])).
% 0.20/0.26 tff(f101,plain,(
% 0.20/0.26 $false),
% 0.20/0.26 inference(avatar_sat_refutation,[],[s8])).
% 0.20/0.26 % SZS output end Proof for theBenchmark
% 0.20/0.26 % (2013279)------------------------------
% 0.20/0.26 % (2013279)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.26 % (2013279)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.26 % (2013279)CaDiCaL version: 2.1.3
% 0.20/0.26 % (2013279)Termination reason: Refutation
% 0.20/0.26 % (2013279)Time elapsed: 0.003 s
% 0.20/0.26 % (2013279)Peak memory usage: 12 MB
% 0.20/0.26 % (2013279)Instructions burned: 4 (million)
% 0.20/0.26 % (2013270)Success in time 0.034 s
% 0.20/0.26 % Vampire exiting
%------------------------------------------------------------------------------