%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : MGT018+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 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 12:02:01 PM UTC 2026
% Result : Theorem 2.87s 1.27s
% Output : Refutation 3.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 4
% Syntax : Number of formulae : 50 ( 16 unt; 0 def)
% Number of atoms : 295 ( 0 equ)
% Maximal formula atoms : 13 ( 5 avg)
% Number of connectives : 417 ( 172 ~; 163 |; 77 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 10 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 : 186 ( 166 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( organization(X0,X1)
=> ? [X2] : inertia(X0,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp5) ).
fof(f2,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/sandbox2/benchmark/theBenchmark.p',a5_FOL) ).
fof(f3,axiom,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( ( organization(X0,X6)
& organization(X1,X6)
& ~ organization(X1,X8)
& class(X0,X3,X6)
& class(X1,X3,X6)
& reorganization(X0,X6,X7)
& reorganization(X1,X6,X8)
& reorganization_type(X0,X2,X6)
& reorganization_type(X1,X2,X6)
& inertia(X0,X4,X6)
& inertia(X1,X5,X6)
& greater(X5,X4) )
=> greater(X7,X8) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a14_FOL) ).
fof(f4,conjecture,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( ( organization(X0,X6)
& organization(X1,X6)
& ~ organization(X1,X8)
& class(X0,X3,X6)
& class(X1,X3,X6)
& reorganization(X0,X6,X7)
& reorganization(X1,X6,X8)
& reorganization_type(X0,X2,X6)
& reorganization_type(X1,X2,X6)
& size(X0,X4,X6)
& size(X1,X5,X6)
& greater(X5,X4) )
=> greater(X7,X8) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t18_FOL) ).
fof(f5,negated_conjecture,
~ ! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( ( organization(X0,X6)
& organization(X1,X6)
& ~ organization(X1,X8)
& class(X0,X3,X6)
& class(X1,X3,X6)
& reorganization(X0,X6,X7)
& reorganization(X1,X6,X8)
& reorganization_type(X0,X2,X6)
& reorganization_type(X1,X2,X6)
& size(X0,X4,X6)
& size(X1,X5,X6)
& greater(X5,X4) )
=> greater(X7,X8) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
fof(f6,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,[],[f2]) ).
fof(f7,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,[],[f6]) ).
fof(f8,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( greater(X7,X8)
| ~ organization(X0,X6)
| ~ organization(X1,X6)
| organization(X1,X8)
| ~ class(X0,X3,X6)
| ~ class(X1,X3,X6)
| ~ reorganization(X0,X6,X7)
| ~ reorganization(X1,X6,X8)
| ~ reorganization_type(X0,X2,X6)
| ~ reorganization_type(X1,X2,X6)
| ~ inertia(X0,X4,X6)
| ~ inertia(X1,X5,X6)
| ~ greater(X5,X4) ),
inference(ennf_transformation,[],[f3]) ).
fof(f9,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( greater(X7,X8)
| ~ organization(X0,X6)
| ~ organization(X1,X6)
| organization(X1,X8)
| ~ class(X0,X3,X6)
| ~ class(X1,X3,X6)
| ~ reorganization(X0,X6,X7)
| ~ reorganization(X1,X6,X8)
| ~ reorganization_type(X0,X2,X6)
| ~ reorganization_type(X1,X2,X6)
| ~ inertia(X0,X4,X6)
| ~ inertia(X1,X5,X6)
| ~ greater(X5,X4) ),
inference(flattening,[],[f8]) ).
fof(f10,plain,
? [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( ~ greater(X7,X8)
& organization(X0,X6)
& organization(X1,X6)
& ~ organization(X1,X8)
& class(X0,X3,X6)
& class(X1,X3,X6)
& reorganization(X0,X6,X7)
& reorganization(X1,X6,X8)
& reorganization_type(X0,X2,X6)
& reorganization_type(X1,X2,X6)
& size(X0,X4,X6)
& size(X1,X5,X6)
& greater(X5,X4) ),
inference(ennf_transformation,[],[f5]) ).
fof(f11,plain,
? [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( ~ greater(X7,X8)
& organization(X0,X6)
& organization(X1,X6)
& ~ organization(X1,X8)
& class(X0,X3,X6)
& class(X1,X3,X6)
& reorganization(X0,X6,X7)
& reorganization(X1,X6,X8)
& reorganization_type(X0,X2,X6)
& reorganization_type(X1,X2,X6)
& size(X0,X4,X6)
& size(X1,X5,X6)
& greater(X5,X4) ),
inference(flattening,[],[f10]) ).
fof(f12,plain,
! [X0,X1] :
( ? [X2] : inertia(X0,X2,X1)
| ~ organization(X0,X1) ),
inference(ennf_transformation,[],[f1]) ).
fof(f13,plain,
( ~ greater(sK7,sK8)
& organization(sK0,sK6)
& organization(sK1,sK6)
& ~ organization(sK1,sK8)
& class(sK0,sK3,sK6)
& class(sK1,sK3,sK6)
& reorganization(sK0,sK6,sK7)
& reorganization(sK1,sK6,sK8)
& reorganization_type(sK0,sK2,sK6)
& reorganization_type(sK1,sK2,sK6)
& size(sK0,sK4,sK6)
& size(sK1,sK5,sK6)
& greater(sK5,sK4) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6,sK7,sK8]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4),skolemize(X5,sK5),skolemize(X6,sK6),skolemize(X7,sK7),skolemize(X8,sK8)],[f11]) ).
fof(f14,plain,
! [X0,X1] :
( inertia(X0,sK9(X0,X1),X1)
| ~ organization(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9]),skolemize(X2,sK9(X0,X1))],[f12]) ).
fof(f15,plain,
! [X2,X3,X0,X1,X8,X6,X7,X4,X5] :
( ~ size(X1,X4,X8)
| ~ organization(X0,X7)
| ~ organization(X1,X8)
| ~ class(X0,X2,X7)
| ~ class(X1,X2,X8)
| ~ size(X0,X3,X7)
| greater(X6,X5)
| ~ inertia(X0,X5,X7)
| ~ inertia(X1,X6,X8)
| ~ greater(X4,X3) ),
inference(cnf_transformation,[],[f7]) ).
fof(f16,plain,
! [X2,X3,X0,X1,X8,X6,X7,X4,X5] :
( ~ reorganization_type(X1,X2,X6)
| ~ organization(X0,X6)
| ~ organization(X1,X6)
| organization(X1,X8)
| ~ class(X0,X3,X6)
| ~ class(X1,X3,X6)
| ~ reorganization(X0,X6,X7)
| ~ reorganization(X1,X6,X8)
| ~ reorganization_type(X0,X2,X6)
| greater(X7,X8)
| ~ inertia(X0,X4,X6)
| ~ inertia(X1,X5,X6)
| ~ greater(X5,X4) ),
inference(cnf_transformation,[],[f9]) ).
fof(f17,plain,
greater(sK5,sK4),
inference(cnf_transformation,[],[f13]) ).
fof(f18,plain,
size(sK1,sK5,sK6),
inference(cnf_transformation,[],[f13]) ).
fof(f19,plain,
size(sK0,sK4,sK6),
inference(cnf_transformation,[],[f13]) ).
fof(f20,plain,
reorganization_type(sK1,sK2,sK6),
inference(cnf_transformation,[],[f13]) ).
fof(f21,plain,
reorganization_type(sK0,sK2,sK6),
inference(cnf_transformation,[],[f13]) ).
fof(f22,plain,
reorganization(sK1,sK6,sK8),
inference(cnf_transformation,[],[f13]) ).
fof(f23,plain,
reorganization(sK0,sK6,sK7),
inference(cnf_transformation,[],[f13]) ).
fof(f24,plain,
class(sK1,sK3,sK6),
inference(cnf_transformation,[],[f13]) ).
fof(f25,plain,
class(sK0,sK3,sK6),
inference(cnf_transformation,[],[f13]) ).
fof(f26,plain,
~ organization(sK1,sK8),
inference(cnf_transformation,[],[f13]) ).
fof(f27,plain,
organization(sK1,sK6),
inference(cnf_transformation,[],[f13]) ).
fof(f28,plain,
organization(sK0,sK6),
inference(cnf_transformation,[],[f13]) ).
fof(f29,plain,
~ greater(sK7,sK8),
inference(cnf_transformation,[],[f13]) ).
fof(f30,plain,
! [X0,X1] :
( inertia(X0,sK9(X0,X1),X1)
| ~ organization(X0,X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f31,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ organization(X0,X1)
| ~ organization(sK1,sK6)
| ~ class(X0,X2,X1)
| ~ class(sK1,X2,sK6)
| ~ size(X0,X3,X1)
| greater(X4,X5)
| ~ inertia(X0,X5,X1)
| ~ inertia(sK1,X4,sK6)
| ~ greater(sK5,X3) ),
inference(resolution,[],[f15,f18]) ).
fof(f36,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ size(X0,X3,X1)
| ~ class(X0,X2,X1)
| ~ class(sK1,X2,sK6)
| ~ organization(X0,X1)
| greater(X4,X5)
| ~ inertia(X0,X5,X1)
| ~ inertia(sK1,X4,sK6)
| ~ greater(sK5,X3) ),
inference(forward_subsumption_resolution,[],[f31,f27]) ).
fof(f42,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ organization(X0,sK6)
| ~ organization(sK1,sK6)
| organization(sK1,X1)
| ~ class(X0,X2,sK6)
| ~ class(sK1,X2,sK6)
| ~ reorganization(X0,sK6,X3)
| ~ reorganization(sK1,sK6,X1)
| ~ reorganization_type(X0,sK2,sK6)
| greater(X3,X1)
| ~ inertia(X0,X4,sK6)
| ~ inertia(sK1,X5,sK6)
| ~ greater(X5,X4) ),
inference(resolution,[],[f16,f20]) ).
fof(f47,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ reorganization_type(X0,sK2,sK6)
| organization(sK1,X1)
| ~ class(X0,X2,sK6)
| ~ class(sK1,X2,sK6)
| ~ reorganization(X0,sK6,X3)
| ~ reorganization(sK1,sK6,X1)
| ~ organization(X0,sK6)
| greater(X3,X1)
| ~ inertia(X0,X4,sK6)
| ~ inertia(sK1,X5,sK6)
| ~ greater(X5,X4) ),
inference(forward_subsumption_resolution,[],[f42,f27]) ).
fof(f50,plain,
! [X2,X0,X1] :
( ~ class(sK0,X0,sK6)
| ~ class(sK1,X0,sK6)
| ~ organization(sK0,sK6)
| greater(X1,X2)
| ~ inertia(sK0,X2,sK6)
| ~ inertia(sK1,X1,sK6)
| ~ greater(sK5,sK4) ),
inference(resolution,[],[f36,f19]) ).
fof(f52,plain,
! [X2,X0,X1] :
( ~ class(sK0,X0,sK6)
| ~ class(sK1,X0,sK6)
| greater(X1,X2)
| ~ inertia(sK0,X2,sK6)
| ~ inertia(sK1,X1,sK6)
| ~ greater(sK5,sK4) ),
inference(forward_subsumption_resolution,[],[f50,f28]) ).
fof(f54,plain,
! [X2,X0,X1] :
( ~ class(sK1,X0,sK6)
| ~ class(sK0,X0,sK6)
| greater(X1,X2)
| ~ inertia(sK0,X2,sK6)
| ~ inertia(sK1,X1,sK6) ),
inference(forward_subsumption_resolution,[],[f52,f17]) ).
fof(f66,plain,
! [X2,X3,X0,X1,X4] :
( organization(sK1,X0)
| ~ class(sK0,X1,sK6)
| ~ class(sK1,X1,sK6)
| ~ reorganization(sK0,sK6,X2)
| ~ reorganization(sK1,sK6,X0)
| ~ organization(sK0,sK6)
| greater(X2,X0)
| ~ inertia(sK0,X3,sK6)
| ~ inertia(sK1,X4,sK6)
| ~ greater(X4,X3) ),
inference(resolution,[],[f47,f21]) ).
fof(f68,plain,
! [X2,X3,X0,X1,X4] :
( organization(sK1,X0)
| ~ class(sK0,X1,sK6)
| ~ class(sK1,X1,sK6)
| ~ reorganization(sK0,sK6,X2)
| ~ reorganization(sK1,sK6,X0)
| greater(X2,X0)
| ~ inertia(sK0,X3,sK6)
| ~ inertia(sK1,X4,sK6)
| ~ greater(X4,X3) ),
inference(forward_subsumption_resolution,[],[f66,f28]) ).
fof(f104,plain,
! [X2,X3,X0,X1,X4] :
( ~ reorganization(sK1,sK6,X0)
| ~ class(sK0,X1,sK6)
| ~ class(sK1,X1,sK6)
| ~ reorganization(sK0,sK6,X2)
| organization(sK1,X0)
| greater(X2,X0)
| ~ inertia(sK0,X3,sK6)
| ~ inertia(sK1,X4,sK6) ),
inference(forward_subsumption_resolution,[],[f68,f54]) ).
fof(f110,plain,
! [X2,X3,X0,X1] :
( ~ class(sK0,X0,sK6)
| ~ class(sK1,X0,sK6)
| ~ reorganization(sK0,sK6,X1)
| organization(sK1,sK8)
| greater(X1,sK8)
| ~ inertia(sK0,X2,sK6)
| ~ inertia(sK1,X3,sK6) ),
inference(resolution,[],[f104,f22]) ).
fof(f111,plain,
! [X2,X3,X0,X1] :
( ~ reorganization(sK0,sK6,X1)
| ~ class(sK1,X0,sK6)
| ~ class(sK0,X0,sK6)
| greater(X1,sK8)
| ~ inertia(sK0,X2,sK6)
| ~ inertia(sK1,X3,sK6) ),
inference(forward_subsumption_resolution,[],[f110,f26]) ).
fof(f112,plain,
! [X2,X0,X1] :
( ~ class(sK1,X0,sK6)
| ~ class(sK0,X0,sK6)
| greater(sK7,sK8)
| ~ inertia(sK0,X1,sK6)
| ~ inertia(sK1,X2,sK6) ),
inference(resolution,[],[f111,f23]) ).
fof(f113,plain,
! [X2,X0,X1] :
( ~ class(sK1,X0,sK6)
| ~ class(sK0,X0,sK6)
| ~ inertia(sK0,X1,sK6)
| ~ inertia(sK1,X2,sK6) ),
inference(forward_subsumption_resolution,[],[f112,f29]) ).
fof(f114,plain,
! [X0,X1] :
( ~ class(sK0,sK3,sK6)
| ~ inertia(sK0,X0,sK6)
| ~ inertia(sK1,X1,sK6) ),
inference(resolution,[],[f113,f24]) ).
fof(f115,plain,
! [X0,X1] :
( ~ inertia(sK1,X1,sK6)
| ~ inertia(sK0,X0,sK6) ),
inference(forward_subsumption_resolution,[],[f114,f25]) ).
fof(f116,plain,
! [X0] :
( ~ inertia(sK0,X0,sK6)
| ~ organization(sK1,sK6) ),
inference(resolution,[],[f115,f30]) ).
fof(f117,plain,
! [X0] : ~ inertia(sK0,X0,sK6),
inference(forward_subsumption_resolution,[],[f116,f27]) ).
fof(f119,plain,
~ organization(sK0,sK6),
inference(resolution,[],[f117,f30]) ).
fof(f120,plain,
$false,
inference(forward_subsumption_resolution,[],[f119,f28]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT018+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n015.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Sun Sep 27 17:20:16 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/0.41 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
% 2.87/1.27 % (1877706)Detected formulas, will run a generic FOF schedule.
% 2.87/1.27 % (1877712)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=2881007722:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.87/1.27 % (1877714)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2470558322:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.87/1.27 % (1877715)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1972448291:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.87/1.27 % (1877711)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=1071796537:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.87/1.27 % (1877717)dis-21_1_sil=8000:lcm=predicate:random_seed=827303308: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)
% 2.87/1.27 % (1877713)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=2778405816:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.87/1.27 % (1877716)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1203554222:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.87/1.27 % (1877714)Also succeeded, but the first one will report.
% 2.87/1.27 % (1877715)First to succeed.
% 2.87/1.27 % (1877717)Also succeeded, but the first one will report.
% 2.87/1.27 % (1877716)Also succeeded, but the first one will report.
% 2.87/1.27 % (1877715)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1877706"
% 2.87/1.27 % (1877715)Refutation found. Thanks to Tanya!
% 2.87/1.27 % SZS status Theorem for theBenchmark
% 2.87/1.27 % SZS output start Proof for theBenchmark
% See solution above
% 3.44/1.37 % (1877715)------------------------------
% 3.44/1.37 % (1877715)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.44/1.37 % (1877715)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.44/1.37 % (1877715)CaDiCaL version: 2.1.3
% 3.44/1.37 % (1877715)Termination reason: Refutation
% 3.44/1.37 % (1877715)Time elapsed: 0.005 s
% 3.44/1.37 % (1877715)Peak memory usage: 88 MB
% 3.44/1.37 % (1877715)Instructions burned: 7 (million)
% 3.44/1.37 % (1877715)------------------------------
% 3.44/1.37 % (1877715)------------------------------
% 3.44/1.37 % (1877706)Success in time 0.42 s
% 3.44/1.37 % Vampire exiting
%------------------------------------------------------------------------------