%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : MGT043+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n017.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:02:12 PM UTC 2026
% Result : Theorem 1.66s 1.31s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 7
% Syntax : Number of formulae : 52 ( 16 unt; 0 def)
% Number of atoms : 196 ( 49 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 235 ( 91 ~; 73 |; 53 &)
% ( 3 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 71 ( 65 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( smaller_or_equal(X0,X1)
<=> ( smaller(X0,X1)
| X0 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',definition_smaller_or_equal) ).
fof(f2,axiom,
! [X0,X1] :
( greater_or_equal(X0,X1)
<=> ( greater(X0,X1)
| X0 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',definition_greater_or_equal) ).
fof(f3,axiom,
! [X0,X1] :
( smaller(X0,X1)
<=> greater(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',definition_smaller) ).
fof(f7,axiom,
! [X0,X1,X2] :
( ( organization(X0)
& ~ has_immunity(X0,X1)
& ~ has_immunity(X0,X2) )
=> ( ( ( greater(capability(X0,X2),capability(X0,X1))
& greater_or_equal(position(X0,X2),position(X0,X1)) )
=> smaller(hazard_of_mortality(X0,X2),hazard_of_mortality(X0,X1)) )
& ( ( greater_or_equal(capability(X0,X2),capability(X0,X1))
& greater(position(X0,X2),position(X0,X1)) )
=> smaller(hazard_of_mortality(X0,X2),hazard_of_mortality(X0,X1)) )
& ( ( capability(X0,X2) = capability(X0,X1)
& position(X0,X2) = position(X0,X1) )
=> hazard_of_mortality(X0,X2) = hazard_of_mortality(X0,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_4) ).
fof(f8,axiom,
! [X0,X1,X2] :
( organization(X0)
=> ( ( ( greater(stock_of_knowledge(X0,X2),stock_of_knowledge(X0,X1))
& smaller_or_equal(internal_friction(X0,X2),internal_friction(X0,X1)) )
=> greater(capability(X0,X2),capability(X0,X1)) )
& ( ( smaller_or_equal(stock_of_knowledge(X0,X2),stock_of_knowledge(X0,X1))
& greater(internal_friction(X0,X2),internal_friction(X0,X1)) )
=> smaller(capability(X0,X2),capability(X0,X1)) )
& ( ( stock_of_knowledge(X0,X2) = stock_of_knowledge(X0,X1)
& internal_friction(X0,X2) = internal_friction(X0,X1) )
=> capability(X0,X2) = capability(X0,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_5) ).
fof(f9,axiom,
! [X0,X1,X2] :
( organization(X0)
=> ( ( greater(external_ties(X0,X2),external_ties(X0,X1))
=> greater(position(X0,X2),position(X0,X1)) )
& ( external_ties(X0,X2) = external_ties(X0,X1)
=> position(X0,X2) = position(X0,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_6) ).
fof(f10,conjecture,
! [X0,X1,X2] :
( ( organization(X0)
& ~ has_immunity(X0,X1)
& ~ has_immunity(X0,X2)
& stock_of_knowledge(X0,X2) = stock_of_knowledge(X0,X1)
& greater(internal_friction(X0,X2),internal_friction(X0,X1))
& external_ties(X0,X1) = external_ties(X0,X2) )
=> greater(hazard_of_mortality(X0,X2),hazard_of_mortality(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_2) ).
fof(f11,negated_conjecture,
~ ! [X0,X1,X2] :
( ( organization(X0)
& ~ has_immunity(X0,X1)
& ~ has_immunity(X0,X2)
& stock_of_knowledge(X0,X2) = stock_of_knowledge(X0,X1)
& greater(internal_friction(X0,X2),internal_friction(X0,X1))
& external_ties(X0,X1) = external_ties(X0,X2) )
=> greater(hazard_of_mortality(X0,X2),hazard_of_mortality(X0,X1)) ),
inference(negated_conjecture,[status(cth)],[f10]) ).
fof(f12,plain,
! [X0,X1] :
( ( greater(X0,X1)
| X0 = X1 )
=> greater_or_equal(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f13,plain,
! [X0,X1] :
( ( smaller(X0,X1)
| X0 = X1 )
=> smaller_or_equal(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f1]) ).
fof(f14,plain,
? [X0,X1,X2] :
( ~ greater(hazard_of_mortality(X0,X2),hazard_of_mortality(X0,X1))
& organization(X0)
& ~ has_immunity(X0,X1)
& ~ has_immunity(X0,X2)
& stock_of_knowledge(X0,X2) = stock_of_knowledge(X0,X1)
& greater(internal_friction(X0,X2),internal_friction(X0,X1))
& external_ties(X0,X1) = external_ties(X0,X2) ),
inference(ennf_transformation,[],[f11]) ).
fof(f15,plain,
? [X0,X1,X2] :
( ~ greater(hazard_of_mortality(X0,X2),hazard_of_mortality(X0,X1))
& organization(X0)
& ~ has_immunity(X0,X1)
& ~ has_immunity(X0,X2)
& stock_of_knowledge(X0,X2) = stock_of_knowledge(X0,X1)
& greater(internal_friction(X0,X2),internal_friction(X0,X1))
& external_ties(X0,X1) = external_ties(X0,X2) ),
inference(flattening,[],[f14]) ).
fof(f16,plain,
! [X0,X1,X2] :
( ( ( smaller(hazard_of_mortality(X0,X2),hazard_of_mortality(X0,X1))
| ~ greater(capability(X0,X2),capability(X0,X1))
| ~ greater_or_equal(position(X0,X2),position(X0,X1)) )
& ( smaller(hazard_of_mortality(X0,X2),hazard_of_mortality(X0,X1))
| ~ greater_or_equal(capability(X0,X2),capability(X0,X1))
| ~ greater(position(X0,X2),position(X0,X1)) )
& ( hazard_of_mortality(X0,X2) = hazard_of_mortality(X0,X1)
| capability(X0,X2) != capability(X0,X1)
| position(X0,X2) != position(X0,X1) ) )
| ~ organization(X0)
| has_immunity(X0,X1)
| has_immunity(X0,X2) ),
inference(ennf_transformation,[],[f7]) ).
fof(f17,plain,
! [X0,X1,X2] :
( ( ( smaller(hazard_of_mortality(X0,X2),hazard_of_mortality(X0,X1))
| ~ greater(capability(X0,X2),capability(X0,X1))
| ~ greater_or_equal(position(X0,X2),position(X0,X1)) )
& ( smaller(hazard_of_mortality(X0,X2),hazard_of_mortality(X0,X1))
| ~ greater_or_equal(capability(X0,X2),capability(X0,X1))
| ~ greater(position(X0,X2),position(X0,X1)) )
& ( hazard_of_mortality(X0,X2) = hazard_of_mortality(X0,X1)
| capability(X0,X2) != capability(X0,X1)
| position(X0,X2) != position(X0,X1) ) )
| ~ organization(X0)
| has_immunity(X0,X1)
| has_immunity(X0,X2) ),
inference(flattening,[],[f16]) ).
fof(f18,plain,
! [X0,X1,X2] :
( ( ( greater(capability(X0,X2),capability(X0,X1))
| ~ greater(stock_of_knowledge(X0,X2),stock_of_knowledge(X0,X1))
| ~ smaller_or_equal(internal_friction(X0,X2),internal_friction(X0,X1)) )
& ( smaller(capability(X0,X2),capability(X0,X1))
| ~ smaller_or_equal(stock_of_knowledge(X0,X2),stock_of_knowledge(X0,X1))
| ~ greater(internal_friction(X0,X2),internal_friction(X0,X1)) )
& ( capability(X0,X2) = capability(X0,X1)
| stock_of_knowledge(X0,X2) != stock_of_knowledge(X0,X1)
| internal_friction(X0,X2) != internal_friction(X0,X1) ) )
| ~ organization(X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f19,plain,
! [X0,X1,X2] :
( ( ( greater(capability(X0,X2),capability(X0,X1))
| ~ greater(stock_of_knowledge(X0,X2),stock_of_knowledge(X0,X1))
| ~ smaller_or_equal(internal_friction(X0,X2),internal_friction(X0,X1)) )
& ( smaller(capability(X0,X2),capability(X0,X1))
| ~ smaller_or_equal(stock_of_knowledge(X0,X2),stock_of_knowledge(X0,X1))
| ~ greater(internal_friction(X0,X2),internal_friction(X0,X1)) )
& ( capability(X0,X2) = capability(X0,X1)
| stock_of_knowledge(X0,X2) != stock_of_knowledge(X0,X1)
| internal_friction(X0,X2) != internal_friction(X0,X1) ) )
| ~ organization(X0) ),
inference(flattening,[],[f18]) ).
fof(f23,plain,
! [X0,X1,X2] :
( ( ( greater(position(X0,X2),position(X0,X1))
| ~ greater(external_ties(X0,X2),external_ties(X0,X1)) )
& ( position(X0,X2) = position(X0,X1)
| external_ties(X0,X2) != external_ties(X0,X1) ) )
| ~ organization(X0) ),
inference(ennf_transformation,[],[f9]) ).
fof(f24,plain,
! [X0,X1] :
( greater_or_equal(X0,X1)
| ( ~ greater(X0,X1)
& X0 != X1 ) ),
inference(ennf_transformation,[],[f12]) ).
fof(f25,plain,
! [X0,X1] :
( smaller_or_equal(X0,X1)
| ( ~ smaller(X0,X1)
& X0 != X1 ) ),
inference(ennf_transformation,[],[f13]) ).
fof(f26,plain,
( ~ greater(hazard_of_mortality(sK0,sK2),hazard_of_mortality(sK0,sK1))
& organization(sK0)
& ~ has_immunity(sK0,sK1)
& ~ has_immunity(sK0,sK2)
& stock_of_knowledge(sK0,sK2) = stock_of_knowledge(sK0,sK1)
& greater(internal_friction(sK0,sK2),internal_friction(sK0,sK1))
& external_ties(sK0,sK2) = external_ties(sK0,sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f15]) ).
fof(f27,plain,
! [X0,X1] :
( ( smaller(X0,X1)
| ~ greater(X1,X0) )
& ( greater(X1,X0)
| ~ smaller(X0,X1) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f28,plain,
external_ties(sK0,sK2) = external_ties(sK0,sK1),
inference(cnf_transformation,[],[f26]) ).
fof(f29,plain,
greater(internal_friction(sK0,sK2),internal_friction(sK0,sK1)),
inference(cnf_transformation,[],[f26]) ).
fof(f30,plain,
stock_of_knowledge(sK0,sK2) = stock_of_knowledge(sK0,sK1),
inference(cnf_transformation,[],[f26]) ).
fof(f31,plain,
~ has_immunity(sK0,sK2),
inference(cnf_transformation,[],[f26]) ).
fof(f32,plain,
~ has_immunity(sK0,sK1),
inference(cnf_transformation,[],[f26]) ).
fof(f33,plain,
organization(sK0),
inference(cnf_transformation,[],[f26]) ).
fof(f34,plain,
~ greater(hazard_of_mortality(sK0,sK2),hazard_of_mortality(sK0,sK1)),
inference(cnf_transformation,[],[f26]) ).
fof(f37,plain,
! [X2,X0,X1] :
( smaller(hazard_of_mortality(X0,X2),hazard_of_mortality(X0,X1))
| ~ greater(capability(X0,X2),capability(X0,X1))
| ~ greater_or_equal(position(X0,X2),position(X0,X1))
| ~ organization(X0)
| has_immunity(X0,X1)
| has_immunity(X0,X2) ),
inference(cnf_transformation,[],[f17]) ).
fof(f39,plain,
! [X2,X0,X1] :
( smaller(capability(X0,X2),capability(X0,X1))
| ~ smaller_or_equal(stock_of_knowledge(X0,X2),stock_of_knowledge(X0,X1))
| ~ greater(internal_friction(X0,X2),internal_friction(X0,X1))
| ~ organization(X0) ),
inference(cnf_transformation,[],[f19]) ).
fof(f43,plain,
! [X2,X0,X1] :
( external_ties(X0,X2) != external_ties(X0,X1)
| position(X0,X2) = position(X0,X1)
| ~ organization(X0) ),
inference(cnf_transformation,[],[f23]) ).
fof(f46,plain,
! [X0,X1] :
( greater(X1,X0)
| ~ smaller(X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f48,plain,
! [X0,X1] :
( greater_or_equal(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f24]) ).
fof(f50,plain,
! [X0,X1] :
( smaller_or_equal(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f25]) ).
fof(f52,plain,
! [X1] : greater_or_equal(X1,X1),
inference(equality_resolution,[],[f48]) ).
fof(f53,plain,
! [X1] : smaller_or_equal(X1,X1),
inference(equality_resolution,[],[f50]) ).
fof(f56,plain,
~ smaller(hazard_of_mortality(sK0,sK1),hazard_of_mortality(sK0,sK2)),
inference(resolution,[],[f46,f34]) ).
fof(f87,plain,
! [X0] :
( external_ties(sK0,sK1) != external_ties(sK0,X0)
| position(sK0,sK2) = position(sK0,X0)
| ~ organization(sK0) ),
inference(superposition,[],[f43,f28]) ).
fof(f89,plain,
! [X0] :
( external_ties(sK0,sK1) != external_ties(sK0,X0)
| position(sK0,sK2) = position(sK0,X0) ),
inference(forward_subsumption_resolution,[],[f87,f33]) ).
fof(f140,plain,
( ~ greater(capability(sK0,sK1),capability(sK0,sK2))
| ~ greater_or_equal(position(sK0,sK1),position(sK0,sK2))
| ~ organization(sK0)
| has_immunity(sK0,sK2)
| has_immunity(sK0,sK1) ),
inference(resolution,[],[f37,f56]) ).
fof(f148,plain,
( ~ greater(capability(sK0,sK1),capability(sK0,sK2))
| ~ greater_or_equal(position(sK0,sK1),position(sK0,sK2))
| has_immunity(sK0,sK2)
| has_immunity(sK0,sK1) ),
inference(forward_subsumption_resolution,[],[f140,f33]) ).
fof(f151,plain,
( ~ greater(capability(sK0,sK1),capability(sK0,sK2))
| ~ greater_or_equal(position(sK0,sK1),position(sK0,sK2))
| has_immunity(sK0,sK1) ),
inference(forward_subsumption_resolution,[],[f148,f31]) ).
fof(f152,plain,
( ~ greater(capability(sK0,sK1),capability(sK0,sK2))
| ~ greater_or_equal(position(sK0,sK1),position(sK0,sK2)) ),
inference(forward_subsumption_resolution,[],[f151,f32]) ).
fof(f156,plain,
position(sK0,sK2) = position(sK0,sK1),
inference(equality_resolution,[],[f89]) ).
fof(f181,plain,
( ~ greater_or_equal(position(sK0,sK1),position(sK0,sK1))
| ~ greater(capability(sK0,sK1),capability(sK0,sK2)) ),
inference(forward_demodulation,[],[f152,f156]) ).
fof(f182,plain,
~ greater(capability(sK0,sK1),capability(sK0,sK2)),
inference(forward_subsumption_resolution,[],[f181,f52]) ).
fof(f195,plain,
~ smaller(capability(sK0,sK2),capability(sK0,sK1)),
inference(resolution,[],[f182,f46]) ).
fof(f198,plain,
( ~ smaller_or_equal(stock_of_knowledge(sK0,sK2),stock_of_knowledge(sK0,sK1))
| ~ greater(internal_friction(sK0,sK2),internal_friction(sK0,sK1))
| ~ organization(sK0) ),
inference(resolution,[],[f195,f39]) ).
fof(f200,plain,
( ~ smaller_or_equal(stock_of_knowledge(sK0,sK2),stock_of_knowledge(sK0,sK1))
| ~ organization(sK0) ),
inference(forward_subsumption_resolution,[],[f198,f29]) ).
fof(f201,plain,
~ smaller_or_equal(stock_of_knowledge(sK0,sK2),stock_of_knowledge(sK0,sK1)),
inference(forward_subsumption_resolution,[],[f200,f33]) ).
fof(f202,plain,
~ smaller_or_equal(stock_of_knowledge(sK0,sK1),stock_of_knowledge(sK0,sK1)),
inference(forward_demodulation,[],[f201,f30]) ).
fof(f203,plain,
$false,
inference(forward_subsumption_resolution,[],[f202,f53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT043+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.39 % Computer : n017.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Sun Sep 27 17:21:50 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.66/1.31 % (2820356)Detected formulas, will run a generic FOF schedule.
% 1.66/1.31 % (2820362)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=586220394:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 1.66/1.31 % (2820367)dis-21_1_sil=8000:lcm=predicate:random_seed=3289296230:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 1.66/1.31 % (2820365)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3487661804:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 1.66/1.31 % (2820366)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2475263134:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 1.66/1.31 % (2820364)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1579830779:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 1.66/1.31 % (2820361)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=2034199113:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 1.66/1.31 % (2820363)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=1669042435:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 1.66/1.31 % (2820364)Refutation not found, incomplete strategy
% 1.66/1.31 % (2820364)------------------------------
% 1.66/1.31 % (2820364)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.66/1.31 % (2820364)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.66/1.31 % (2820364)CaDiCaL version: 2.1.3
% 1.66/1.31 % (2820364)Termination reason: Refutation not found, incomplete strategy
% 1.66/1.31 % (2820364)Time elapsed: 0.003 s
% 1.66/1.31 % (2820364)Peak memory usage: 88 MB
% 1.66/1.31 % (2820364)Instructions burned: 2 (million)
% 1.66/1.31 % (2820365)First to succeed.
% 1.66/1.31 % (2820365)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2820356"
% 1.66/1.31 % (2820366)Also succeeded, but the first one will report.
% 1.66/1.31 % (2820367)Instruction limit reached!
% 1.66/1.31 % (2820367)------------------------------
% 1.66/1.31 % (2820367)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.66/1.31 % (2820367)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.66/1.31 % (2820367)CaDiCaL version: 2.1.3
% 1.66/1.31 % (2820367)Termination reason: Instruction limit
% 1.66/1.31 % (2820367)Termination phase: Saturation
% 1.66/1.31 % (2820367)Time elapsed: 0.049 s
% 1.66/1.31 % (2820367)Peak memory usage: 88 MB
% 1.66/1.31 % (2820367)Instructions burned: 132 (million)
% 1.66/1.31 % (2820375)lrs+10_1_sil=8000:sp=occurrence:random_seed=2549520616:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 1.66/1.31 % (2820375)Also succeeded, but the first one will report.
% 1.66/1.31 % (2820364)------------------------------
% 1.66/1.31 % (2820364)------------------------------
% 1.66/1.31 % (2820365)Refutation found. Thanks to Tanya!
% 1.66/1.31 % SZS status Theorem for theBenchmark
% 1.66/1.31 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/1.51 % (2820365)------------------------------
% 0.16/1.51 % (2820365)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.16/1.51 % (2820365)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/1.51 % (2820365)CaDiCaL version: 2.1.3
% 0.16/1.51 % (2820365)Termination reason: Refutation
% 0.16/1.51 % (2820365)Time elapsed: 0.007 s
% 0.16/1.51 % (2820365)Peak memory usage: 88 MB
% 0.16/1.51 % (2820365)Instructions burned: 9 (million)
% 0.16/1.51 % (2820365)------------------------------
% 0.16/1.51 % (2820365)------------------------------
% 0.16/1.51 % (2820356)Success in time 0.443 s
% 0.16/1.51 % Vampire exiting
%------------------------------------------------------------------------------