%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : MGT012+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n006.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:01:59 PM UTC 2026
% Result : Theorem 0.38s 0.96s
% Output : Refutation 2.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 7
% Syntax : Number of formulae : 66 ( 14 unt; 0 def)
% Number of atoms : 278 ( 11 equ)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 382 ( 170 ~; 159 |; 46 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 191 ( 177 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( organization(X0,X1)
=> ? [X2] : inertia(X0,X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp5) ).
fof(f3,axiom,
! [X0,X1] :
~ ( greater(X0,X1)
& greater(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp6_2) ).
fof(f4,axiom,
! [X0,X1] :
( organization(X0,X1)
=> ? [X2] : class(X0,X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp9) ).
fof(f5,axiom,
! [X0,X1,X2,X3,X4] :
( ( organization(X0,X1)
& organization(X0,X2)
& reorganization_free(X0,X1,X2)
& class(X0,X3,X1)
& class(X0,X4,X2) )
=> X3 = X4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp10) ).
fof(f6,axiom,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( ( organization(X0,X7)
& organization(X1,X8)
& class(X0,X2,X7)
& class(X1,X2,X8)
& complexity(X0,X3,X7)
& complexity(X1,X4,X8)
& inertia(X0,X5,X7)
& inertia(X1,X6,X8)
& greater(X4,X3) )
=> greater(X6,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a12_FOL) ).
fof(f7,axiom,
! [X0,X1,X2,X3,X4] :
( ( organization(X0,X3)
& organization(X0,X4)
& reorganization_free(X0,X3,X4)
& inertia(X0,X1,X3)
& inertia(X0,X2,X4)
& greater(X4,X3) )
=> greater(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_FOL) ).
fof(f8,conjecture,
! [X0,X1,X2,X3,X4] :
( ( organization(X0,X3)
& organization(X0,X4)
& reorganization_free(X0,X3,X4)
& complexity(X0,X1,X3)
& complexity(X0,X2,X4)
& greater(X4,X3) )
=> ~ greater(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_FOL) ).
fof(f9,negated_conjecture,
~ ! [X0,X1,X2,X3,X4] :
( ( organization(X0,X3)
& organization(X0,X4)
& reorganization_free(X0,X3,X4)
& complexity(X0,X1,X3)
& complexity(X0,X2,X4)
& greater(X4,X3) )
=> ~ greater(X1,X2) ),
inference(negated_conjecture,[status(cth)],[f8]) ).
fof(f10,plain,
! [X0,X1] :
( ? [X2] : inertia(X0,X2,X1)
| ~ organization(X0,X1) ),
inference(ennf_transformation,[],[f1]) ).
fof(f12,plain,
! [X0,X1] :
( ~ greater(X0,X1)
| ~ greater(X1,X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f13,plain,
! [X0,X1] :
( ? [X2] : class(X0,X2,X1)
| ~ organization(X0,X1) ),
inference(ennf_transformation,[],[f4]) ).
fof(f14,plain,
! [X0,X1,X2,X3,X4] :
( X3 = X4
| ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ reorganization_free(X0,X1,X2)
| ~ class(X0,X3,X1)
| ~ class(X0,X4,X2) ),
inference(ennf_transformation,[],[f5]) ).
fof(f15,plain,
! [X0,X1,X2,X3,X4] :
( X3 = X4
| ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ reorganization_free(X0,X1,X2)
| ~ class(X0,X3,X1)
| ~ class(X0,X4,X2) ),
inference(flattening,[],[f14]) ).
fof(f16,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( greater(X6,X5)
| ~ organization(X0,X7)
| ~ organization(X1,X8)
| ~ class(X0,X2,X7)
| ~ class(X1,X2,X8)
| ~ complexity(X0,X3,X7)
| ~ complexity(X1,X4,X8)
| ~ inertia(X0,X5,X7)
| ~ inertia(X1,X6,X8)
| ~ greater(X4,X3) ),
inference(ennf_transformation,[],[f6]) ).
fof(f17,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( greater(X6,X5)
| ~ organization(X0,X7)
| ~ organization(X1,X8)
| ~ class(X0,X2,X7)
| ~ class(X1,X2,X8)
| ~ complexity(X0,X3,X7)
| ~ complexity(X1,X4,X8)
| ~ inertia(X0,X5,X7)
| ~ inertia(X1,X6,X8)
| ~ greater(X4,X3) ),
inference(flattening,[],[f16]) ).
fof(f18,plain,
! [X0,X1,X2,X3,X4] :
( greater(X2,X1)
| ~ organization(X0,X3)
| ~ organization(X0,X4)
| ~ reorganization_free(X0,X3,X4)
| ~ inertia(X0,X1,X3)
| ~ inertia(X0,X2,X4)
| ~ greater(X4,X3) ),
inference(ennf_transformation,[],[f7]) ).
fof(f19,plain,
! [X0,X1,X2,X3,X4] :
( greater(X2,X1)
| ~ organization(X0,X3)
| ~ organization(X0,X4)
| ~ reorganization_free(X0,X3,X4)
| ~ inertia(X0,X1,X3)
| ~ inertia(X0,X2,X4)
| ~ greater(X4,X3) ),
inference(flattening,[],[f18]) ).
fof(f20,plain,
? [X0,X1,X2,X3,X4] :
( greater(X1,X2)
& organization(X0,X3)
& organization(X0,X4)
& reorganization_free(X0,X3,X4)
& complexity(X0,X1,X3)
& complexity(X0,X2,X4)
& greater(X4,X3) ),
inference(ennf_transformation,[],[f9]) ).
fof(f21,plain,
? [X0,X1,X2,X3,X4] :
( greater(X1,X2)
& organization(X0,X3)
& organization(X0,X4)
& reorganization_free(X0,X3,X4)
& complexity(X0,X1,X3)
& complexity(X0,X2,X4)
& greater(X4,X3) ),
inference(flattening,[],[f20]) ).
fof(f22,plain,
! [X0,X1] :
( inertia(X0,sK0(X0,X1),X1)
| ~ organization(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f10]) ).
fof(f23,plain,
! [X0,X1] :
( class(X0,sK1(X0,X1),X1)
| ~ organization(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X2,sK1(X0,X1))],[f13]) ).
fof(f24,plain,
( greater(sK3,sK4)
& organization(sK2,sK5)
& organization(sK2,sK6)
& reorganization_free(sK2,sK5,sK6)
& complexity(sK2,sK3,sK5)
& complexity(sK2,sK4,sK6)
& greater(sK6,sK5) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5,sK6]),skolemize(X0,sK2),skolemize(X1,sK3),skolemize(X2,sK4),skolemize(X3,sK5),skolemize(X4,sK6)],[f21]) ).
fof(f25,plain,
! [X0,X1] :
( inertia(X0,sK0(X0,X1),X1)
| ~ organization(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f27,plain,
! [X0,X1] :
( ~ greater(X0,X1)
| ~ greater(X1,X0) ),
inference(cnf_transformation,[],[f12]) ).
fof(f28,plain,
! [X0,X1] :
( class(X0,sK1(X0,X1),X1)
| ~ organization(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f29,plain,
! [X2,X3,X0,X1,X4] :
( ~ reorganization_free(X0,X1,X2)
| ~ organization(X0,X1)
| ~ organization(X0,X2)
| X3 = X4
| ~ class(X0,X3,X1)
| ~ class(X0,X4,X2) ),
inference(cnf_transformation,[],[f15]) ).
fof(f30,plain,
! [X2,X3,X0,X1,X8,X6,X7,X4,X5] :
( ~ class(X0,X2,X7)
| ~ organization(X0,X7)
| ~ organization(X1,X8)
| greater(X6,X5)
| ~ class(X1,X2,X8)
| ~ complexity(X0,X3,X7)
| ~ complexity(X1,X4,X8)
| ~ inertia(X0,X5,X7)
| ~ inertia(X1,X6,X8)
| ~ greater(X4,X3) ),
inference(cnf_transformation,[],[f17]) ).
fof(f31,plain,
! [X2,X3,X0,X1,X4] :
( ~ reorganization_free(X0,X3,X4)
| ~ organization(X0,X3)
| ~ organization(X0,X4)
| greater(X2,X1)
| ~ inertia(X0,X1,X3)
| ~ inertia(X0,X2,X4)
| ~ greater(X4,X3) ),
inference(cnf_transformation,[],[f19]) ).
fof(f32,plain,
greater(sK6,sK5),
inference(cnf_transformation,[],[f24]) ).
fof(f33,plain,
complexity(sK2,sK4,sK6),
inference(cnf_transformation,[],[f24]) ).
fof(f34,plain,
complexity(sK2,sK3,sK5),
inference(cnf_transformation,[],[f24]) ).
fof(f35,plain,
reorganization_free(sK2,sK5,sK6),
inference(cnf_transformation,[],[f24]) ).
fof(f36,plain,
organization(sK2,sK6),
inference(cnf_transformation,[],[f24]) ).
fof(f37,plain,
organization(sK2,sK5),
inference(cnf_transformation,[],[f24]) ).
fof(f38,plain,
greater(sK3,sK4),
inference(cnf_transformation,[],[f24]) ).
fof(f43,plain,
! [X0,X1] :
( ~ organization(sK2,sK5)
| ~ organization(sK2,sK6)
| X0 = X1
| ~ class(sK2,X0,sK5)
| ~ class(sK2,X1,sK6) ),
inference(resolution,[],[f29,f35]) ).
fof(f44,plain,
! [X0,X1] :
( ~ organization(sK2,sK6)
| X0 = X1
| ~ class(sK2,X0,sK5)
| ~ class(sK2,X1,sK6) ),
inference(forward_subsumption_resolution,[],[f43,f37]) ).
fof(f45,plain,
! [X0,X1] :
( ~ class(sK2,X1,sK6)
| ~ class(sK2,X0,sK5)
| X0 = X1 ),
inference(forward_subsumption_resolution,[],[f44,f36]) ).
fof(f46,plain,
! [X0] :
( ~ class(sK2,X0,sK5)
| sK1(sK2,sK6) = X0
| ~ organization(sK2,sK6) ),
inference(resolution,[],[f45,f28]) ).
fof(f47,plain,
! [X0] :
( ~ class(sK2,X0,sK5)
| sK1(sK2,sK6) = X0 ),
inference(forward_subsumption_resolution,[],[f46,f36]) ).
fof(f48,plain,
! [X0,X1] :
( ~ organization(sK2,sK5)
| ~ organization(sK2,sK6)
| greater(X0,X1)
| ~ inertia(sK2,X1,sK5)
| ~ inertia(sK2,X0,sK6)
| ~ greater(sK6,sK5) ),
inference(resolution,[],[f31,f35]) ).
fof(f49,plain,
! [X0,X1] :
( ~ organization(sK2,sK6)
| greater(X0,X1)
| ~ inertia(sK2,X1,sK5)
| ~ inertia(sK2,X0,sK6)
| ~ greater(sK6,sK5) ),
inference(forward_subsumption_resolution,[],[f48,f37]) ).
fof(f50,plain,
! [X0,X1] :
( greater(X0,X1)
| ~ inertia(sK2,X1,sK5)
| ~ inertia(sK2,X0,sK6)
| ~ greater(sK6,sK5) ),
inference(forward_subsumption_resolution,[],[f49,f36]) ).
fof(f51,plain,
! [X0,X1] :
( ~ inertia(sK2,X1,sK5)
| greater(X0,X1)
| ~ inertia(sK2,X0,sK6) ),
inference(forward_subsumption_resolution,[],[f50,f32]) ).
fof(f52,plain,
( sK1(sK2,sK6) = sK1(sK2,sK5)
| ~ organization(sK2,sK5) ),
inference(resolution,[],[f47,f28]) ).
fof(f53,plain,
sK1(sK2,sK6) = sK1(sK2,sK5),
inference(forward_subsumption_resolution,[],[f52,f37]) ).
fof(f54,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( ~ organization(X0,X1)
| ~ organization(X2,X3)
| greater(X4,X5)
| ~ class(X2,sK1(X0,X1),X3)
| ~ complexity(X0,X6,X1)
| ~ complexity(X2,X7,X3)
| ~ inertia(X0,X5,X1)
| ~ inertia(X2,X4,X3)
| ~ greater(X7,X6)
| ~ organization(X0,X1) ),
inference(resolution,[],[f30,f28]) ).
fof(f57,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( ~ inertia(X2,X4,X3)
| ~ organization(X2,X3)
| greater(X4,X5)
| ~ class(X2,sK1(X0,X1),X3)
| ~ complexity(X0,X6,X1)
| ~ complexity(X2,X7,X3)
| ~ inertia(X0,X5,X1)
| ~ organization(X0,X1)
| ~ greater(X7,X6) ),
inference(duplicate_literal_removal,[],[f54]) ).
fof(f60,plain,
! [X0] :
( greater(X0,sK0(sK2,sK5))
| ~ inertia(sK2,X0,sK6)
| ~ organization(sK2,sK5) ),
inference(resolution,[],[f51,f25]) ).
fof(f61,plain,
! [X0] :
( ~ inertia(sK2,X0,sK6)
| greater(X0,sK0(sK2,sK5)) ),
inference(forward_subsumption_resolution,[],[f60,f37]) ).
fof(f69,plain,
( greater(sK0(sK2,sK6),sK0(sK2,sK5))
| ~ organization(sK2,sK6) ),
inference(resolution,[],[f61,f25]) ).
fof(f70,plain,
greater(sK0(sK2,sK6),sK0(sK2,sK5)),
inference(forward_subsumption_resolution,[],[f69,f36]) ).
fof(f71,plain,
! [X2,X3,X0,X1,X6,X4,X5] :
( ~ organization(X0,X1)
| greater(sK0(X0,X1),X2)
| ~ class(X0,sK1(X3,X4),X1)
| ~ complexity(X3,X5,X4)
| ~ complexity(X0,X6,X1)
| ~ inertia(X3,X2,X4)
| ~ organization(X3,X4)
| ~ greater(X6,X5)
| ~ organization(X0,X1) ),
inference(resolution,[],[f57,f25]) ).
fof(f74,plain,
! [X2,X3,X0,X1,X6,X4,X5] :
( ~ inertia(X3,X2,X4)
| greater(sK0(X0,X1),X2)
| ~ class(X0,sK1(X3,X4),X1)
| ~ complexity(X3,X5,X4)
| ~ complexity(X0,X6,X1)
| ~ organization(X0,X1)
| ~ organization(X3,X4)
| ~ greater(X6,X5) ),
inference(duplicate_literal_removal,[],[f71]) ).
fof(f77,plain,
~ greater(sK0(sK2,sK5),sK0(sK2,sK6)),
inference(resolution,[],[f70,f27]) ).
fof(f83,plain,
! [X2,X3,X0,X1,X4,X5] :
( greater(sK0(X0,X1),sK0(X2,X3))
| ~ class(X0,sK1(X2,X3),X1)
| ~ complexity(X2,X4,X3)
| ~ complexity(X0,X5,X1)
| ~ organization(X0,X1)
| ~ organization(X2,X3)
| ~ greater(X5,X4)
| ~ organization(X2,X3) ),
inference(resolution,[],[f74,f25]) ).
fof(f84,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ organization(X0,X1)
| ~ class(X0,sK1(X2,X3),X1)
| ~ complexity(X2,X4,X3)
| ~ complexity(X0,X5,X1)
| greater(sK0(X0,X1),sK0(X2,X3))
| ~ organization(X2,X3)
| ~ greater(X5,X4) ),
inference(duplicate_literal_removal,[],[f83]) ).
fof(f91,plain,
! [X2,X3,X0,X1] :
( ~ complexity(sK2,X3,sK5)
| ~ complexity(X0,X2,X1)
| ~ class(sK2,sK1(X0,X1),sK5)
| greater(sK0(sK2,sK5),sK0(X0,X1))
| ~ organization(X0,X1)
| ~ greater(X3,X2) ),
inference(resolution,[],[f84,f37]) ).
fof(f98,plain,
! [X2,X0,X1] :
( ~ greater(sK3,X1)
| ~ class(sK2,sK1(X0,X2),sK5)
| greater(sK0(sK2,sK5),sK0(X0,X2))
| ~ organization(X0,X2)
| ~ complexity(X0,X1,X2) ),
inference(resolution,[],[f91,f34]) ).
fof(f100,plain,
! [X0,X1] :
( ~ complexity(X0,sK4,X1)
| greater(sK0(sK2,sK5),sK0(X0,X1))
| ~ organization(X0,X1)
| ~ class(sK2,sK1(X0,X1),sK5) ),
inference(resolution,[],[f98,f38]) ).
fof(f101,plain,
( greater(sK0(sK2,sK5),sK0(sK2,sK6))
| ~ organization(sK2,sK6)
| ~ class(sK2,sK1(sK2,sK6),sK5) ),
inference(resolution,[],[f100,f33]) ).
fof(f102,plain,
( ~ organization(sK2,sK6)
| ~ class(sK2,sK1(sK2,sK6),sK5) ),
inference(forward_subsumption_resolution,[],[f101,f77]) ).
fof(f103,plain,
~ class(sK2,sK1(sK2,sK6),sK5),
inference(forward_subsumption_resolution,[],[f102,f36]) ).
fof(f104,plain,
~ class(sK2,sK1(sK2,sK5),sK5),
inference(forward_demodulation,[],[f103,f53]) ).
fof(f105,plain,
~ organization(sK2,sK5),
inference(resolution,[],[f104,f28]) ).
fof(f106,plain,
$false,
inference(forward_subsumption_resolution,[],[f105,f37]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT012+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.39 % Computer : n006.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % 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 17:15:55 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.43 Running first-order theorem proving
% 0.12/0.43 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.38/0.96 % (3190558)Detected formulas, will run a generic FOF schedule.
% 0.38/0.96 % (3190568)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1256998398:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 0.38/0.96 % (3190569)dis-21_1_sil=8000:lcm=predicate:random_seed=3533575924: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)
% 0.38/0.96 % (3190567)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=4159748848:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 0.38/0.96 % (3190563)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=292624375:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 0.38/0.96 % (3190566)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2063663834:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 0.38/0.96 % (3190564)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=2067986040:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 0.38/0.96 % (3190565)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=2360937265:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 0.38/0.96 % (3190568)First to succeed.
% 0.38/0.96 % (3190568)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3190558"
% 0.38/0.96 % (3190567)Refutation not found, incomplete strategy
% 0.38/0.96 % (3190567)------------------------------
% 0.38/0.96 % (3190567)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.38/0.96 % (3190567)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.38/0.96 % (3190567)CaDiCaL version: 2.1.3
% 0.38/0.96 % (3190567)Termination reason: Refutation not found, incomplete strategy
% 0.38/0.96 % (3190567)Time elapsed: 0.002 s
% 0.38/0.96 % (3190567)Peak memory usage: 88 MB
% 0.38/0.96 % (3190567)Instructions burned: 1 (million)
% 0.38/0.96 % (3190566)Refutation not found, incomplete strategy
% 0.38/0.96 % (3190566)------------------------------
% 0.38/0.96 % (3190566)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.38/0.96 % (3190566)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.38/0.96 % (3190566)CaDiCaL version: 2.1.3
% 0.38/0.96 % (3190566)Termination reason: Refutation not found, incomplete strategy
% 0.38/0.96 % (3190566)Time elapsed: 0.004 s
% 0.38/0.96 % (3190566)Peak memory usage: 88 MB
% 0.38/0.96 % (3190566)Instructions burned: 5 (million)
% 0.38/0.96 % (3190569)Refutation not found, incomplete strategy
% 0.38/0.96 % (3190569)------------------------------
% 0.38/0.96 % (3190569)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.38/0.96 % (3190569)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.38/0.96 % (3190569)CaDiCaL version: 2.1.3
% 0.38/0.96 % (3190569)Termination reason: Refutation not found, incomplete strategy
% 0.38/0.96 % (3190569)Time elapsed: 0.004 s
% 0.38/0.96 % (3190569)Peak memory usage: 88 MB
% 0.38/0.96 % (3190569)Instructions burned: 5 (million)
% 0.38/0.96 % (3190568)Refutation found. Thanks to Tanya!
% 0.38/0.96 % SZS status Theorem for theBenchmark
% 0.38/0.96 % SZS output start Proof for theBenchmark
% See solution above
% 2.75/1.15 % (3190568)------------------------------
% 2.75/1.15 % (3190568)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.75/1.15 % (3190568)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.75/1.15 % (3190568)CaDiCaL version: 2.1.3
% 2.75/1.15 % (3190568)Termination reason: Refutation
% 2.75/1.15 % (3190568)Time elapsed: 0.004 s
% 2.75/1.15 % (3190568)Peak memory usage: 89 MB
% 2.75/1.15 % (3190568)Instructions burned: 8 (million)
% 2.75/1.15 % (3190568)------------------------------
% 2.75/1.15 % (3190568)------------------------------
% 2.75/1.15 % (3190558)Success in time 0.327 s
% 2.75/1.15 % Vampire exiting
%------------------------------------------------------------------------------