%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : ARI592_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 : n015.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:56 AM UTC 2026
% Result : Theorem 0.24s 0.26s
% Output : Refutation 0.24s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ARI592_1 : TPTP v9.3.1. Released v5.1.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.18 % Computer : n015.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Mon Sep 28 20:56:17 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.21 Running first-order model finding
% 0.09/0.21 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.24/0.26 % (3006992)Will run a generic schedule for satisfiability detection.
% 0.24/0.26 % (3007001)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1882234829:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.24/0.26 % (3006998)% WARNING: option uhcvi not known.
% 0.24/0.26 % (3006997)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1435625507_2999 on theBenchmark for (2999ds/0Mi)
% 0.24/0.26 % (3006998)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3803100702:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.24/0.26 % (3006999)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1626492831:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.24/0.26 % (3006997)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.24/0.26 % (3006997)Terminated due to inappropriate strategy.
% 0.24/0.26 % (3006997)------------------------------
% 0.24/0.26 % (3006997)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.24/0.26 % (3006997)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.24/0.26 % (3007000)dis+10_1_sil=32000:sp=arity:random_seed=1271733949:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.24/0.26 % (3006997)CaDiCaL version: 2.1.3
% 0.24/0.26 % (3006997)Termination reason: Inappropriate
% 0.24/0.26 % (3006997)Time elapsed: 0.0000 s
% 0.24/0.26 % (3006997)Peak memory usage: 10 MB
% 0.24/0.26 % (3007003)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2861885723:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.24/0.26 % (3007002)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2801922795:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.24/0.26 % (3006997)------------------------------
% 0.24/0.26 % (3006997)------------------------------
% 0.24/0.26 % (3007003) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3006992-3007003"...
% 0.24/0.26 % (3007003)...printing done.
% 0.24/0.26 % (3007003)Refutation found. Thanks to Tanya!
% 0.24/0.26 % SZS status Theorem for theBenchmark
% 0.24/0.26 % SZS output start Proof for theBenchmark
% 0.24/0.26 tff(func_def_5, type, sK0: $int).
% 0.24/0.26 tff(func_def_6, type, sK1: $int).
% 0.24/0.26 tff(f1,conjecture,(
% 0.24/0.26 ! [X0 : $int,X1 : $int] : ($less(2,X1) => ? [X2 : $int] : ($less(0,X2) & $less(X2,X1) & X0 != X2))),
% 0.24/0.26 file('/export/starexec/sandbox/benchmark/theBenchmark.p',exists_X_0_Z_noteq_Y)).
% 0.24/0.26 tff(f2,negated_conjecture,(
% 0.24/0.26 ~ ! [X0 : $int,X1 : $int] : ($less(2,X1) => ? [X2 : $int] : ($less(0,X2) & $less(X2,X1) & X0 != X2))),
% 0.24/0.26 inference(negated_conjecture,[status(cth)],[f1])).
% 0.24/0.26 tff(f3,definition,(
% 0.24/0.26 ( ! [X0 : $int,X1 : $int] : ($sum(X0,X1) = $sum(X1,X0)) )),
% 0.24/0.26 introduced(theory,[tha_commutativity])).
% 0.24/0.26 tff(f5,definition,(
% 0.24/0.26 ( ! [X0 : $int] : ($sum(X0,0) = X0) )),
% 0.24/0.26 introduced(theory,[tha_right_identity])).
% 0.24/0.26 tff(f8,definition,(
% 0.24/0.26 ( ! [X0 : $int] : (~$less(X0,X0)) )),
% 0.24/0.26 introduced(theory,[tha_non-reflexivity])).
% 0.24/0.26 tff(f9,definition,(
% 0.24/0.26 ( ! [X2 : $int,X0 : $int,X1 : $int] : ($less(X0,X2) | ~$less(X1,X2) | ~$less(X0,X1)) )),
% 0.24/0.26 introduced(theory,[tha_transitivity])).
% 0.24/0.26 tff(f12,definition,(
% 0.24/0.26 ( ! [X0 : $int,X1 : $int] : ($less(X1,$sum(X0,1)) | $less(X0,X1)) )),
% 0.24/0.26 introduced(theory,[tha_order_plus_one_dichotomy])).
% 0.24/0.26 tff(f15,plain,(
% 0.24/0.26 ? [X0 : $int,X1 : $int] : (! [X2 : $int] : (~$less(0,X2) | ~$less(X2,X1) | X0 = X2) & $less(2,X1))),
% 0.24/0.26 inference(ennf_transformation,[],[f2])).
% 0.24/0.26 tff(f16,plain,(
% 0.24/0.26 ! [X2 : $int] : (~$less(0,X2) | ~$less(X2,sK1) | sK0 = X2) & $less(2,sK1)),
% 0.24/0.26 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f15])).
% 0.24/0.26 tff(f17,plain,(
% 0.24/0.26 $less(2,sK1)),
% 0.24/0.26 inference(cnf_transformation,[],[f16])).
% 0.24/0.26 tff(f18,plain,(
% 0.24/0.26 ( ! [X2 : $int] : (~$less(0,X2) | ~$less(X2,sK1) | sK0 = X2) )),
% 0.24/0.26 inference(cnf_transformation,[],[f16])).
% 0.24/0.26 tff(f19,plain,(
% 0.24/0.26 ~$less(0,2) | 2 = sK0),
% 0.24/0.26 inference(resolution,[],[f18,f17])).
% 0.24/0.26 tff(f20,plain,(
% 0.24/0.26 2 = sK0),
% 0.24/0.26 inference(evaluation,[],[f19])).
% 0.24/0.26 tff(f35,plain,(
% 0.24/0.26 ( ! [X0 : $int,X1 : $int] : ($less(X1,$sum(1,X0)) | $less(X0,X1)) )),
% 0.24/0.26 inference(superposition,[],[f12,f3])).
% 0.24/0.26 tff(f62,plain,(
% 0.24/0.26 ( ! [X0 : $int] : ($less(0,X0) | $less(X0,1)) )),
% 0.24/0.26 inference(superposition,[],[f35,f5])).
% 0.24/0.26 tff(f67,plain,(
% 0.24/0.26 ( ! [X0 : $int] : ($less(X0,1) | ~$less(X0,sK1) | sK0 = X0) )),
% 0.24/0.26 inference(resolution,[],[f62,f18])).
% 0.24/0.26 tff(f73,plain,(
% 0.24/0.26 ~$less(1,sK1) | 1 = sK0),
% 0.24/0.26 inference(resolution,[],[f67,f8])).
% 0.24/0.26 tff(f77,definition,(
% 0.24/0.26 spl2_1 <=> 1 = sK0),
% 0.24/0.26 introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition])).
% 0.24/0.26 tff(f79,plain,(
% 0.24/0.26 1 = sK0 | ~spl2_1),
% 0.24/0.26 inference(avatar_component_clause,[],[f77])).
% 0.24/0.26 tff(f81,definition,(
% 0.24/0.26 spl2_2 <=> $less(1,sK1)),
% 0.24/0.26 introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition])).
% 0.24/0.26 tff(f83,plain,(
% 0.24/0.26 ~$less(1,sK1) | spl2_2),
% 0.24/0.26 inference(avatar_component_clause,[],[f81])).
% 0.24/0.26 tff(f84,plain,(
% 0.24/0.26 spl2_1 | ~spl2_2),
% 0.24/0.26 inference(avatar_split_clause,[],[f73,f81,f77])).
% 0.24/0.26 tff(f93,plain,(
% 0.24/0.26 ( ! [X0 : $int] : (~$less(X0,sK1) | ~$less(1,X0)) ) | spl2_2),
% 0.24/0.26 inference(resolution,[],[f83,f9])).
% 0.24/0.26 tff(f95,plain,(
% 0.24/0.26 ~$less(1,2) | spl2_2),
% 0.24/0.26 inference(resolution,[],[f93,f17])).
% 0.24/0.26 tff(f98,plain,(
% 0.24/0.26 $false | spl2_2),
% 0.24/0.26 inference(evaluation,[],[f95])).
% 0.24/0.26 tff(f99,plain,(
% 0.24/0.26 spl2_2),
% 0.24/0.26 inference(avatar_contradiction_clause,[],[f98])).
% 0.24/0.26 tff(f100,plain,(
% 0.24/0.26 2 = 1 | ~spl2_1),
% 0.24/0.26 inference(superposition,[],[f79,f20])).
% 0.24/0.26 tff(f104,plain,(
% 0.24/0.26 $false | ~spl2_1),
% 0.24/0.26 inference(evaluation,[],[f100])).
% 0.24/0.26 tff(f105,plain,(
% 0.24/0.26 ~spl2_1),
% 0.24/0.26 inference(avatar_contradiction_clause,[],[f104])).
% 0.24/0.26 cnf(s1, plain, spl2_1 | ~spl2_2, inference(sat_conversion,[],[f84])).
% 0.24/0.26 cnf(s2, plain, spl2_2, inference(sat_conversion,[],[f99])).
% 0.24/0.26 cnf(s4, plain, ~spl2_1, inference(sat_conversion,[],[f105])).
% 0.24/0.26 cnf(s5, plain, $false, inference(rat,[],[s1,s2,s4])).
% 0.24/0.26 tff(f106,plain,(
% 0.24/0.26 $false),
% 0.24/0.26 inference(avatar_sat_refutation,[],[s5])).
% 0.24/0.26 % SZS output end Proof for theBenchmark
% 0.24/0.26 % (3007003)------------------------------
% 0.24/0.26 % (3007003)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.24/0.26 % (3007003)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.24/0.26 % (3007003)CaDiCaL version: 2.1.3
% 0.24/0.26 % (3007003)Termination reason: Refutation
% 0.24/0.26 % (3007003)Time elapsed: 0.004 s
% 0.24/0.26 % (3007003)Peak memory usage: 13 MB
% 0.24/0.26 % (3007003)Instructions burned: 4 (million)
% 0.24/0.26 % (3006992)Success in time 0.037 s
% 0.24/0.26 % Vampire exiting
%------------------------------------------------------------------------------