%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : MGT008+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 : n008.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:58 PM UTC 2026
% Result : Theorem 1.53s 1.40s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 4
% Syntax : Number of formulae : 48 ( 15 unt; 0 def)
% Number of atoms : 251 ( 0 equ)
% Maximal formula atoms : 12 ( 5 avg)
% Number of connectives : 346 ( 143 ~; 129 |; 69 &)
% ( 0 <=>; 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 : 167 ( 147 !; 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,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(f3,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)
& inertia(X0,X4,X2)
& inertia(X1,X5,X3)
& survival_chance(X0,X6,X2)
& survival_chance(X1,X7,X3)
& greater(X5,X4) )
=> greater(X7,X6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_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)
& survival_chance(X0,X3,X7)
& survival_chance(X1,X4,X8)
& size(X0,X5,X7)
& size(X1,X6,X8)
& greater(X6,X5) )
=> greater(X4,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_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)
& survival_chance(X0,X3,X7)
& survival_chance(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,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] :
( greater(X7,X6)
| ~ organization(X0,X2)
| ~ organization(X1,X3)
| ~ reorganization_free(X0,X2,X2)
| ~ reorganization_free(X1,X3,X3)
| ~ inertia(X0,X4,X2)
| ~ inertia(X1,X5,X3)
| ~ survival_chance(X0,X6,X2)
| ~ survival_chance(X1,X7,X3)
| ~ greater(X5,X4) ),
inference(ennf_transformation,[],[f3]) ).
fof(f9,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( greater(X7,X6)
| ~ organization(X0,X2)
| ~ organization(X1,X3)
| ~ reorganization_free(X0,X2,X2)
| ~ reorganization_free(X1,X3,X3)
| ~ inertia(X0,X4,X2)
| ~ inertia(X1,X5,X3)
| ~ survival_chance(X0,X6,X2)
| ~ survival_chance(X1,X7,X3)
| ~ greater(X5,X4) ),
inference(flattening,[],[f8]) ).
fof(f10,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)
& survival_chance(X0,X3,X7)
& survival_chance(X1,X4,X8)
& size(X0,X5,X7)
& size(X1,X6,X8)
& greater(X6,X5) ),
inference(ennf_transformation,[],[f5]) ).
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)
& survival_chance(X0,X3,X7)
& survival_chance(X1,X4,X8)
& size(X0,X5,X7)
& size(X1,X6,X8)
& greater(X6,X5) ),
inference(flattening,[],[f10]) ).
fof(f12,plain,
! [X0,X1] :
( ? [X2] : inertia(X0,X2,X1)
| ~ organization(X0,X1) ),
inference(ennf_transformation,[],[f1]) ).
fof(f13,plain,
( ~ greater(sK4,sK3)
& organization(sK0,sK7)
& organization(sK1,sK8)
& reorganization_free(sK0,sK7,sK7)
& reorganization_free(sK1,sK8,sK8)
& class(sK0,sK2,sK7)
& class(sK1,sK2,sK8)
& survival_chance(sK0,sK3,sK7)
& survival_chance(sK1,sK4,sK8)
& size(sK0,sK5,sK7)
& size(sK1,sK6,sK8)
& greater(sK6,sK5) ),
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,X6,X7,X4,X5] :
( ~ survival_chance(X1,X7,X3)
| ~ organization(X0,X2)
| ~ organization(X1,X3)
| ~ reorganization_free(X0,X2,X2)
| ~ reorganization_free(X1,X3,X3)
| ~ inertia(X0,X4,X2)
| ~ inertia(X1,X5,X3)
| ~ survival_chance(X0,X6,X2)
| greater(X7,X6)
| ~ greater(X5,X4) ),
inference(cnf_transformation,[],[f9]) ).
fof(f17,plain,
greater(sK6,sK5),
inference(cnf_transformation,[],[f13]) ).
fof(f18,plain,
size(sK1,sK6,sK8),
inference(cnf_transformation,[],[f13]) ).
fof(f19,plain,
size(sK0,sK5,sK7),
inference(cnf_transformation,[],[f13]) ).
fof(f20,plain,
survival_chance(sK1,sK4,sK8),
inference(cnf_transformation,[],[f13]) ).
fof(f21,plain,
survival_chance(sK0,sK3,sK7),
inference(cnf_transformation,[],[f13]) ).
fof(f22,plain,
class(sK1,sK2,sK8),
inference(cnf_transformation,[],[f13]) ).
fof(f23,plain,
class(sK0,sK2,sK7),
inference(cnf_transformation,[],[f13]) ).
fof(f24,plain,
reorganization_free(sK1,sK8,sK8),
inference(cnf_transformation,[],[f13]) ).
fof(f25,plain,
reorganization_free(sK0,sK7,sK7),
inference(cnf_transformation,[],[f13]) ).
fof(f26,plain,
organization(sK1,sK8),
inference(cnf_transformation,[],[f13]) ).
fof(f27,plain,
organization(sK0,sK7),
inference(cnf_transformation,[],[f13]) ).
fof(f28,plain,
~ greater(sK4,sK3),
inference(cnf_transformation,[],[f13]) ).
fof(f29,plain,
! [X0,X1] :
( inertia(X0,sK9(X0,X1),X1)
| ~ organization(X0,X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f30,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ organization(X0,X1)
| ~ organization(sK1,sK8)
| ~ class(X0,X2,X1)
| ~ class(sK1,X2,sK8)
| ~ size(X0,X3,X1)
| greater(X4,X5)
| ~ inertia(X0,X5,X1)
| ~ inertia(sK1,X4,sK8)
| ~ greater(sK6,X3) ),
inference(resolution,[],[f15,f18]) ).
fof(f35,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ size(X0,X3,X1)
| ~ class(X0,X2,X1)
| ~ class(sK1,X2,sK8)
| ~ organization(X0,X1)
| greater(X4,X5)
| ~ inertia(X0,X5,X1)
| ~ inertia(sK1,X4,sK8)
| ~ greater(sK6,X3) ),
inference(forward_subsumption_resolution,[],[f30,f26]) ).
fof(f42,plain,
! [X2,X3,X0,X1,X4] :
( ~ organization(X0,X1)
| ~ organization(sK1,sK8)
| ~ reorganization_free(X0,X1,X1)
| ~ reorganization_free(sK1,sK8,sK8)
| ~ inertia(X0,X2,X1)
| ~ inertia(sK1,X3,sK8)
| ~ survival_chance(X0,X4,X1)
| greater(sK4,X4)
| ~ greater(X3,X2) ),
inference(resolution,[],[f16,f20]) ).
fof(f47,plain,
! [X2,X3,X0,X1,X4] :
( ~ organization(X0,X1)
| ~ reorganization_free(X0,X1,X1)
| ~ reorganization_free(sK1,sK8,sK8)
| ~ inertia(X0,X2,X1)
| ~ inertia(sK1,X3,sK8)
| ~ survival_chance(X0,X4,X1)
| greater(sK4,X4)
| ~ greater(X3,X2) ),
inference(forward_subsumption_resolution,[],[f42,f26]) ).
fof(f49,plain,
! [X2,X3,X0,X1,X4] :
( ~ survival_chance(X0,X4,X1)
| ~ reorganization_free(X0,X1,X1)
| ~ inertia(X0,X2,X1)
| ~ inertia(sK1,X3,sK8)
| ~ organization(X0,X1)
| greater(sK4,X4)
| ~ greater(X3,X2) ),
inference(forward_subsumption_resolution,[],[f47,f24]) ).
fof(f62,plain,
! [X0,X1] :
( ~ reorganization_free(sK0,sK7,sK7)
| ~ inertia(sK0,X0,sK7)
| ~ inertia(sK1,X1,sK8)
| ~ organization(sK0,sK7)
| greater(sK4,sK3)
| ~ greater(X1,X0) ),
inference(resolution,[],[f49,f21]) ).
fof(f63,plain,
! [X0,X1] :
( ~ inertia(sK0,X0,sK7)
| ~ inertia(sK1,X1,sK8)
| ~ organization(sK0,sK7)
| greater(sK4,sK3)
| ~ greater(X1,X0) ),
inference(forward_subsumption_resolution,[],[f62,f25]) ).
fof(f65,plain,
! [X0,X1] :
( ~ inertia(sK0,X0,sK7)
| ~ inertia(sK1,X1,sK8)
| greater(sK4,sK3)
| ~ greater(X1,X0) ),
inference(forward_subsumption_resolution,[],[f63,f27]) ).
fof(f67,plain,
! [X0,X1] :
( ~ inertia(sK1,X1,sK8)
| ~ inertia(sK0,X0,sK7)
| ~ greater(X1,X0) ),
inference(forward_subsumption_resolution,[],[f65,f28]) ).
fof(f71,plain,
! [X2,X0,X1] :
( ~ class(sK0,X0,sK7)
| ~ class(sK1,X0,sK8)
| ~ organization(sK0,sK7)
| greater(X1,X2)
| ~ inertia(sK0,X2,sK7)
| ~ inertia(sK1,X1,sK8)
| ~ greater(sK6,sK5) ),
inference(resolution,[],[f35,f19]) ).
fof(f73,plain,
! [X2,X0,X1] :
( ~ class(sK0,X0,sK7)
| ~ class(sK1,X0,sK8)
| ~ organization(sK0,sK7)
| ~ inertia(sK0,X2,sK7)
| ~ inertia(sK1,X1,sK8)
| ~ greater(sK6,sK5) ),
inference(forward_subsumption_resolution,[],[f71,f67]) ).
fof(f75,plain,
! [X2,X0,X1] :
( ~ class(sK0,X0,sK7)
| ~ class(sK1,X0,sK8)
| ~ inertia(sK0,X2,sK7)
| ~ inertia(sK1,X1,sK8)
| ~ greater(sK6,sK5) ),
inference(forward_subsumption_resolution,[],[f73,f27]) ).
fof(f76,plain,
! [X2,X0,X1] :
( ~ class(sK1,X0,sK8)
| ~ class(sK0,X0,sK7)
| ~ inertia(sK0,X2,sK7)
| ~ inertia(sK1,X1,sK8) ),
inference(forward_subsumption_resolution,[],[f75,f17]) ).
fof(f102,plain,
! [X0,X1] :
( ~ class(sK0,sK2,sK7)
| ~ inertia(sK0,X0,sK7)
| ~ inertia(sK1,X1,sK8) ),
inference(resolution,[],[f76,f22]) ).
fof(f103,plain,
! [X0,X1] :
( ~ inertia(sK1,X1,sK8)
| ~ inertia(sK0,X0,sK7) ),
inference(forward_subsumption_resolution,[],[f102,f23]) ).
fof(f104,plain,
! [X0] :
( ~ inertia(sK0,X0,sK7)
| ~ organization(sK1,sK8) ),
inference(resolution,[],[f103,f29]) ).
fof(f105,plain,
! [X0] : ~ inertia(sK0,X0,sK7),
inference(forward_subsumption_resolution,[],[f104,f26]) ).
fof(f106,plain,
~ organization(sK0,sK7),
inference(resolution,[],[f105,f29]) ).
fof(f107,plain,
$false,
inference(forward_subsumption_resolution,[],[f106,f27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT008+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.10/0.37 % Computer : n008.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sun Sep 27 17:16:39 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.44 Running first-order theorem proving
% 0.10/0.44 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
% 1.53/1.40 % (1475400)Detected formulas, will run a generic FOF schedule.
% 1.53/1.40 % (1475424)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=3810578732:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 1.53/1.40 % (1475427)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=943859857:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 1.53/1.40 % (1475428)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1099470811:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 1.53/1.40 % (1475426)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=789556215:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 1.53/1.40 % (1475425)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=186890514:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 1.53/1.40 % (1475428)First to succeed.
% 1.53/1.40 % (1475427)Also succeeded, but the first one will report.
% 1.53/1.40 % (1475428)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1475400"
% 1.53/1.40 % (1475429)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2325313054:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 1.53/1.40 % (1475429)Also succeeded, but the first one will report.
% 1.53/1.40 % (1475430)dis-21_1_sil=8000:lcm=predicate:random_seed=463815930: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.53/1.40 % (1475430)Also succeeded, but the first one will report.
% 1.53/1.40 % (1475428)Refutation found. Thanks to Tanya!
% 1.53/1.40 % SZS status Theorem for theBenchmark
% 1.53/1.40 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/1.60 % (1475428)------------------------------
% 0.20/1.60 % (1475428)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.20/1.60 % (1475428)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/1.60 % (1475428)CaDiCaL version: 2.1.3
% 0.20/1.60 % (1475428)Termination reason: Refutation
% 0.20/1.60 % (1475428)Time elapsed: 0.004 s
% 0.20/1.60 % (1475428)Peak memory usage: 88 MB
% 0.20/1.60 % (1475428)Instructions burned: 5 (million)
% 0.20/1.60 % (1475428)------------------------------
% 0.20/1.60 % (1475428)------------------------------
% 0.20/1.60 % (1475400)Success in time 0.424 s
% 0.20/1.60 % Vampire exiting
%------------------------------------------------------------------------------