%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : MGT009+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 : n007.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.35s 0.97s
% Output : Refutation 2.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 4
% Syntax : Number of formulae : 53 ( 15 unt; 0 def)
% Number of atoms : 285 ( 0 equ)
% Maximal formula atoms : 12 ( 5 avg)
% Number of connectives : 414 ( 182 ~; 155 |; 69 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 9 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 182 ( 162 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( organization(X0,X1)
=> ? [X2] : inertia(X0,X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp5) ).
fof(f2,axiom,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( ( organization(X0,X2)
& organization(X1,X3)
& reorganization_free(X0,X2,X2)
& reorganization_free(X1,X3,X3)
& reproducibility(X0,X4,X2)
& reproducibility(X1,X5,X3)
& inertia(X0,X6,X2)
& inertia(X1,X7,X3) )
=> ( greater(X5,X4)
<=> greater(X7,X6) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a3_FOL) ).
fof(f3,axiom,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( ( organization(X0,X7)
& organization(X1,X8)
& class(X0,X2,X7)
& class(X1,X2,X8)
& size(X0,X3,X7)
& size(X1,X4,X8)
& inertia(X0,X5,X7)
& inertia(X1,X6,X8)
& greater(X4,X3) )
=> greater(X6,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a5_FOL) ).
fof(f4,conjecture,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( ( organization(X0,X7)
& organization(X1,X8)
& reorganization_free(X0,X7,X7)
& reorganization_free(X1,X8,X8)
& class(X0,X2,X7)
& class(X1,X2,X8)
& reproducibility(X0,X3,X7)
& reproducibility(X1,X4,X8)
& size(X0,X5,X7)
& size(X1,X6,X8)
& greater(X6,X5) )
=> greater(X4,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t9_FOL) ).
fof(f5,negated_conjecture,
~ ! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( ( organization(X0,X7)
& organization(X1,X8)
& reorganization_free(X0,X7,X7)
& reorganization_free(X1,X8,X8)
& class(X0,X2,X7)
& class(X1,X2,X8)
& reproducibility(X0,X3,X7)
& reproducibility(X1,X4,X8)
& size(X0,X5,X7)
& size(X1,X6,X8)
& greater(X6,X5) )
=> greater(X4,X3) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
fof(f6,plain,
! [X0,X1] :
( ? [X2] : inertia(X0,X2,X1)
| ~ organization(X0,X1) ),
inference(ennf_transformation,[],[f1]) ).
fof(f7,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( ( greater(X5,X4)
<=> greater(X7,X6) )
| ~ organization(X0,X2)
| ~ organization(X1,X3)
| ~ reorganization_free(X0,X2,X2)
| ~ reorganization_free(X1,X3,X3)
| ~ reproducibility(X0,X4,X2)
| ~ reproducibility(X1,X5,X3)
| ~ inertia(X0,X6,X2)
| ~ inertia(X1,X7,X3) ),
inference(ennf_transformation,[],[f2]) ).
fof(f8,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( ( greater(X5,X4)
<=> greater(X7,X6) )
| ~ organization(X0,X2)
| ~ organization(X1,X3)
| ~ reorganization_free(X0,X2,X2)
| ~ reorganization_free(X1,X3,X3)
| ~ reproducibility(X0,X4,X2)
| ~ reproducibility(X1,X5,X3)
| ~ inertia(X0,X6,X2)
| ~ inertia(X1,X7,X3) ),
inference(flattening,[],[f7]) ).
fof(f9,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)
| ~ size(X0,X3,X7)
| ~ size(X1,X4,X8)
| ~ inertia(X0,X5,X7)
| ~ inertia(X1,X6,X8)
| ~ greater(X4,X3) ),
inference(ennf_transformation,[],[f3]) ).
fof(f10,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)
| ~ size(X0,X3,X7)
| ~ size(X1,X4,X8)
| ~ inertia(X0,X5,X7)
| ~ inertia(X1,X6,X8)
| ~ greater(X4,X3) ),
inference(flattening,[],[f9]) ).
fof(f11,plain,
? [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( ~ greater(X4,X3)
& organization(X0,X7)
& organization(X1,X8)
& reorganization_free(X0,X7,X7)
& reorganization_free(X1,X8,X8)
& class(X0,X2,X7)
& class(X1,X2,X8)
& reproducibility(X0,X3,X7)
& reproducibility(X1,X4,X8)
& size(X0,X5,X7)
& size(X1,X6,X8)
& greater(X6,X5) ),
inference(ennf_transformation,[],[f5]) ).
fof(f12,plain,
? [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( ~ greater(X4,X3)
& organization(X0,X7)
& organization(X1,X8)
& reorganization_free(X0,X7,X7)
& reorganization_free(X1,X8,X8)
& class(X0,X2,X7)
& class(X1,X2,X8)
& reproducibility(X0,X3,X7)
& reproducibility(X1,X4,X8)
& size(X0,X5,X7)
& size(X1,X6,X8)
& greater(X6,X5) ),
inference(flattening,[],[f11]) ).
fof(f13,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))],[f6]) ).
fof(f14,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( ( ( greater(X5,X4)
| ~ greater(X7,X6) )
& ( greater(X7,X6)
| ~ greater(X5,X4) ) )
| ~ organization(X0,X2)
| ~ organization(X1,X3)
| ~ reorganization_free(X0,X2,X2)
| ~ reorganization_free(X1,X3,X3)
| ~ reproducibility(X0,X4,X2)
| ~ reproducibility(X1,X5,X3)
| ~ inertia(X0,X6,X2)
| ~ inertia(X1,X7,X3) ),
inference(nnf_transformation,[],[f8]) ).
fof(f15,plain,
( ~ greater(sK5,sK4)
& organization(sK1,sK8)
& organization(sK2,sK9)
& reorganization_free(sK1,sK8,sK8)
& reorganization_free(sK2,sK9,sK9)
& class(sK1,sK3,sK8)
& class(sK2,sK3,sK9)
& reproducibility(sK1,sK4,sK8)
& reproducibility(sK2,sK5,sK9)
& size(sK1,sK6,sK8)
& size(sK2,sK7,sK9)
& greater(sK7,sK6) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4,sK5,sK6,sK7,sK8,sK9]),skolemize(X0,sK1),skolemize(X1,sK2),skolemize(X2,sK3),skolemize(X3,sK4),skolemize(X4,sK5),skolemize(X5,sK6),skolemize(X6,sK7),skolemize(X7,sK8),skolemize(X8,sK9)],[f12]) ).
fof(f16,plain,
! [X0,X1] :
( inertia(X0,sK0(X0,X1),X1)
| ~ organization(X0,X1) ),
inference(cnf_transformation,[],[f13]) ).
fof(f18,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( greater(X5,X4)
| ~ greater(X7,X6)
| ~ organization(X0,X2)
| ~ organization(X1,X3)
| ~ reorganization_free(X0,X2,X2)
| ~ reorganization_free(X1,X3,X3)
| ~ reproducibility(X0,X4,X2)
| ~ reproducibility(X1,X5,X3)
| ~ inertia(X0,X6,X2)
| ~ inertia(X1,X7,X3) ),
inference(cnf_transformation,[],[f14]) ).
fof(f19,plain,
! [X2,X3,X0,X1,X8,X6,X7,X4,X5] :
( greater(X6,X5)
| ~ organization(X0,X7)
| ~ organization(X1,X8)
| ~ class(X0,X2,X7)
| ~ class(X1,X2,X8)
| ~ size(X0,X3,X7)
| ~ size(X1,X4,X8)
| ~ inertia(X0,X5,X7)
| ~ inertia(X1,X6,X8)
| ~ greater(X4,X3) ),
inference(cnf_transformation,[],[f10]) ).
fof(f20,plain,
greater(sK7,sK6),
inference(cnf_transformation,[],[f15]) ).
fof(f21,plain,
size(sK2,sK7,sK9),
inference(cnf_transformation,[],[f15]) ).
fof(f22,plain,
size(sK1,sK6,sK8),
inference(cnf_transformation,[],[f15]) ).
fof(f23,plain,
reproducibility(sK2,sK5,sK9),
inference(cnf_transformation,[],[f15]) ).
fof(f24,plain,
reproducibility(sK1,sK4,sK8),
inference(cnf_transformation,[],[f15]) ).
fof(f25,plain,
class(sK2,sK3,sK9),
inference(cnf_transformation,[],[f15]) ).
fof(f26,plain,
class(sK1,sK3,sK8),
inference(cnf_transformation,[],[f15]) ).
fof(f27,plain,
reorganization_free(sK2,sK9,sK9),
inference(cnf_transformation,[],[f15]) ).
fof(f28,plain,
reorganization_free(sK1,sK8,sK8),
inference(cnf_transformation,[],[f15]) ).
fof(f29,plain,
organization(sK2,sK9),
inference(cnf_transformation,[],[f15]) ).
fof(f30,plain,
organization(sK1,sK8),
inference(cnf_transformation,[],[f15]) ).
fof(f31,plain,
~ greater(sK5,sK4),
inference(cnf_transformation,[],[f15]) ).
fof(f33,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ reproducibility(X4,sK5,X5)
| ~ organization(X2,X3)
| ~ organization(X4,X5)
| ~ reorganization_free(X2,X3,X3)
| ~ reorganization_free(X4,X5,X5)
| ~ reproducibility(X2,sK4,X3)
| ~ greater(X0,X1)
| ~ inertia(X2,X1,X3)
| ~ inertia(X4,X0,X5) ),
inference(resolution,[],[f18,f31]) ).
fof(f34,plain,
! [X2,X3,X0,X1] :
( ~ organization(X0,X1)
| ~ organization(sK2,sK9)
| ~ reorganization_free(X0,X1,X1)
| ~ reorganization_free(sK2,sK9,sK9)
| ~ reproducibility(X0,sK4,X1)
| ~ greater(X2,X3)
| ~ inertia(X0,X3,X1)
| ~ inertia(sK2,X2,sK9) ),
inference(resolution,[],[f33,f23]) ).
fof(f35,plain,
! [X2,X3,X0,X1] :
( ~ organization(X0,X1)
| ~ reorganization_free(X0,X1,X1)
| ~ reorganization_free(sK2,sK9,sK9)
| ~ reproducibility(X0,sK4,X1)
| ~ greater(X2,X3)
| ~ inertia(X0,X3,X1)
| ~ inertia(sK2,X2,sK9) ),
inference(forward_subsumption_resolution,[],[f34,f29]) ).
fof(f36,plain,
! [X2,X3,X0,X1] :
( ~ inertia(sK2,X2,sK9)
| ~ reorganization_free(X0,X1,X1)
| ~ reproducibility(X0,sK4,X1)
| ~ greater(X2,X3)
| ~ inertia(X0,X3,X1)
| ~ organization(X0,X1) ),
inference(forward_subsumption_resolution,[],[f35,f27]) ).
fof(f38,plain,
! [X2,X0,X1] :
( ~ reorganization_free(X0,X1,X1)
| ~ reproducibility(X0,sK4,X1)
| ~ greater(sK0(sK2,sK9),X2)
| ~ inertia(X0,X2,X1)
| ~ organization(X0,X1)
| ~ organization(sK2,sK9) ),
inference(resolution,[],[f36,f16]) ).
fof(f41,plain,
! [X2,X0,X1] :
( ~ reproducibility(X0,sK4,X1)
| ~ reorganization_free(X0,X1,X1)
| ~ greater(sK0(sK2,sK9),X2)
| ~ inertia(X0,X2,X1)
| ~ organization(X0,X1) ),
inference(forward_subsumption_resolution,[],[f38,f29]) ).
fof(f51,plain,
! [X0] :
( ~ reorganization_free(sK1,sK8,sK8)
| ~ greater(sK0(sK2,sK9),X0)
| ~ inertia(sK1,X0,sK8)
| ~ organization(sK1,sK8) ),
inference(resolution,[],[f41,f24]) ).
fof(f52,plain,
! [X0] :
( ~ greater(sK0(sK2,sK9),X0)
| ~ inertia(sK1,X0,sK8)
| ~ organization(sK1,sK8) ),
inference(forward_subsumption_resolution,[],[f51,f28]) ).
fof(f53,plain,
! [X0] :
( ~ inertia(sK1,X0,sK8)
| ~ greater(sK0(sK2,sK9),X0) ),
inference(forward_subsumption_resolution,[],[f52,f30]) ).
fof(f54,plain,
( ~ greater(sK0(sK2,sK9),sK0(sK1,sK8))
| ~ organization(sK1,sK8) ),
inference(resolution,[],[f53,f16]) ).
fof(f55,plain,
~ greater(sK0(sK2,sK9),sK0(sK1,sK8)),
inference(forward_subsumption_resolution,[],[f54,f30]) ).
fof(f56,plain,
! [X2,X3,X0,X1,X6,X4,X5] :
( ~ inertia(X2,sK0(sK2,sK9),X3)
| ~ organization(X2,X3)
| ~ class(X0,X4,X1)
| ~ class(X2,X4,X3)
| ~ size(X0,X5,X1)
| ~ size(X2,X6,X3)
| ~ inertia(X0,sK0(sK1,sK8),X1)
| ~ organization(X0,X1)
| ~ greater(X6,X5) ),
inference(resolution,[],[f55,f19]) ).
fof(f59,plain,
! [X2,X3,X0,X1,X4] :
( ~ organization(sK2,sK9)
| ~ class(X0,X1,X2)
| ~ class(sK2,X1,sK9)
| ~ size(X0,X3,X2)
| ~ size(sK2,X4,sK9)
| ~ inertia(X0,sK0(sK1,sK8),X2)
| ~ organization(X0,X2)
| ~ greater(X4,X3)
| ~ organization(sK2,sK9) ),
inference(resolution,[],[f56,f16]) ).
fof(f60,plain,
! [X2,X3,X0,X1,X4] :
( ~ organization(sK2,sK9)
| ~ class(X0,X1,X2)
| ~ class(sK2,X1,sK9)
| ~ size(X0,X3,X2)
| ~ size(sK2,X4,sK9)
| ~ inertia(X0,sK0(sK1,sK8),X2)
| ~ organization(X0,X2)
| ~ greater(X4,X3) ),
inference(duplicate_literal_removal,[],[f59]) ).
fof(f61,plain,
! [X2,X3,X0,X1,X4] :
( ~ size(sK2,X4,sK9)
| ~ class(sK2,X1,sK9)
| ~ size(X0,X3,X2)
| ~ class(X0,X1,X2)
| ~ inertia(X0,sK0(sK1,sK8),X2)
| ~ organization(X0,X2)
| ~ greater(X4,X3) ),
inference(forward_subsumption_resolution,[],[f60,f29]) ).
fof(f62,plain,
! [X2,X3,X0,X1] :
( ~ class(sK2,X0,sK9)
| ~ size(X1,X2,X3)
| ~ class(X1,X0,X3)
| ~ inertia(X1,sK0(sK1,sK8),X3)
| ~ organization(X1,X3)
| ~ greater(sK7,X2) ),
inference(resolution,[],[f61,f21]) ).
fof(f87,plain,
! [X2,X0,X1] :
( ~ inertia(X0,sK0(sK1,sK8),X2)
| ~ class(X0,sK3,X2)
| ~ size(X0,X1,X2)
| ~ organization(X0,X2)
| ~ greater(sK7,X1) ),
inference(resolution,[],[f62,f25]) ).
fof(f90,plain,
! [X0] :
( ~ class(sK1,sK3,sK8)
| ~ size(sK1,X0,sK8)
| ~ organization(sK1,sK8)
| ~ greater(sK7,X0)
| ~ organization(sK1,sK8) ),
inference(resolution,[],[f87,f16]) ).
fof(f91,plain,
! [X0] :
( ~ class(sK1,sK3,sK8)
| ~ size(sK1,X0,sK8)
| ~ organization(sK1,sK8)
| ~ greater(sK7,X0) ),
inference(duplicate_literal_removal,[],[f90]) ).
fof(f92,plain,
! [X0] :
( ~ size(sK1,X0,sK8)
| ~ organization(sK1,sK8)
| ~ greater(sK7,X0) ),
inference(forward_subsumption_resolution,[],[f91,f26]) ).
fof(f93,plain,
! [X0] :
( ~ size(sK1,X0,sK8)
| ~ greater(sK7,X0) ),
inference(forward_subsumption_resolution,[],[f92,f30]) ).
fof(f94,plain,
~ greater(sK7,sK6),
inference(resolution,[],[f93,f22]) ).
fof(f95,plain,
$false,
inference(forward_subsumption_resolution,[],[f94,f20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT009+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.09/0.34 % Computer : n007.cluster.edu
% 0.09/0.34 % Model : x86_64 x86_64
% 0.09/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34 % Memory : 8046.5625MB
% 0.09/0.34 % OS : Linux 6.8.0-71-generic
% 0.09/0.34 % CPULimit : 300
% 0.09/0.34 % WCLimit : 300
% 0.09/0.34 % DateTime : Sun Sep 27 17:13:55 UTC 2026
% 0.09/0.34 % CPUTime :
% 0.09/0.34 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.38 Running first-order theorem proving
% 0.09/0.38 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.35/0.97 % (1672068)Detected formulas, will run a generic FOF schedule.
% 0.35/0.97 % (1672157)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3144476790:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 0.35/0.97 % (1672156)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1265369977:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 0.35/0.97 % (1672158)dis-21_1_sil=8000:lcm=predicate:random_seed=1115695967: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.35/0.97 % (1672153)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=2198258327:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 0.35/0.97 % (1672155)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2249094406:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 0.35/0.97 % (1672154)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=923420089:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 0.35/0.97 % (1672152)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=651796828:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 0.35/0.97 % (1672157)First to succeed.
% 0.35/0.97 % (1672156)Also succeeded, but the first one will report.
% 0.35/0.97 % (1672158)Also succeeded, but the first one will report.
% 0.35/0.97 % (1672155)Also succeeded, but the first one will report.
% 0.35/0.97 % (1672157)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1672068"
% 0.35/0.97 % (1672157)Refutation found. Thanks to Tanya!
% 0.35/0.97 % SZS status Theorem for theBenchmark
% 0.35/0.97 % SZS output start Proof for theBenchmark
% See solution above
% 2.90/1.08 % (1672157)------------------------------
% 2.90/1.08 % (1672157)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.90/1.08 % (1672157)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.90/1.08 % (1672157)CaDiCaL version: 2.1.3
% 2.90/1.08 % (1672157)Termination reason: Refutation
% 2.90/1.08 % (1672157)Time elapsed: 0.005 s
% 2.90/1.08 % (1672157)Peak memory usage: 88 MB
% 2.90/1.08 % (1672157)Instructions burned: 6 (million)
% 2.90/1.08 % (1672157)------------------------------
% 2.90/1.08 % (1672157)------------------------------
% 2.90/1.08 % (1672068)Success in time 0.381 s
% 2.90/1.08 % Vampire exiting
%------------------------------------------------------------------------------