%------------------------------------------------------------------------------
% File : Vampire-SAT---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 SAT
% Computer : n003.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:27 PM UTC 2026
% Result : Theorem 0.18s 0.47s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 4
% Syntax : Number of formulae : 58 ( 21 unt; 0 def)
% Number of atoms : 292 ( 0 equ)
% Maximal formula atoms : 12 ( 5 avg)
% Number of connectives : 366 ( 132 ~; 171 |; 58 &)
% ( 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 : 196 ( 176 !; 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] : inertia(X0,X2,X1)
| ~ organization(X0,X1) ),
inference(ennf_transformation,[],[f1]) ).
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(ennf_transformation,[],[f2]) ).
fof(f8,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,[],[f7]) ).
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(ennf_transformation,[],[f3]) ).
fof(f10,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,[],[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)
& 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(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)
& survival_chance(X0,X3,X7)
& survival_chance(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(cnf_transformation,[],[f6]) ).
fof(f14,plain,
! [X2,X3,X0,X1,X8,X6,X7,X4,X5] :
( ~ greater(X4,X3)
| ~ inertia(X1,X6,X8)
| ~ inertia(X0,X5,X7)
| ~ size(X1,X4,X8)
| ~ size(X0,X3,X7)
| ~ class(X1,X2,X8)
| ~ class(X0,X2,X7)
| ~ organization(X1,X8)
| ~ organization(X0,X7)
| greater(X6,X5) ),
inference(cnf_transformation,[],[f8]) ).
fof(f15,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( ~ greater(X5,X4)
| ~ survival_chance(X1,X7,X3)
| ~ survival_chance(X0,X6,X2)
| ~ inertia(X1,X5,X3)
| ~ inertia(X0,X4,X2)
| ~ reorganization_free(X1,X3,X3)
| ~ reorganization_free(X0,X2,X2)
| ~ organization(X1,X3)
| ~ organization(X0,X2)
| greater(X7,X6) ),
inference(cnf_transformation,[],[f10]) ).
fof(f16,plain,
greater(sK7,sK6),
inference(cnf_transformation,[],[f12]) ).
fof(f17,plain,
size(sK2,sK7,sK9),
inference(cnf_transformation,[],[f12]) ).
fof(f18,plain,
size(sK1,sK6,sK8),
inference(cnf_transformation,[],[f12]) ).
fof(f19,plain,
survival_chance(sK2,sK5,sK9),
inference(cnf_transformation,[],[f12]) ).
fof(f20,plain,
survival_chance(sK1,sK4,sK8),
inference(cnf_transformation,[],[f12]) ).
fof(f21,plain,
class(sK2,sK3,sK9),
inference(cnf_transformation,[],[f12]) ).
fof(f22,plain,
class(sK1,sK3,sK8),
inference(cnf_transformation,[],[f12]) ).
fof(f23,plain,
reorganization_free(sK2,sK9,sK9),
inference(cnf_transformation,[],[f12]) ).
fof(f24,plain,
reorganization_free(sK1,sK8,sK8),
inference(cnf_transformation,[],[f12]) ).
fof(f25,plain,
organization(sK2,sK9),
inference(cnf_transformation,[],[f12]) ).
fof(f26,plain,
organization(sK1,sK8),
inference(cnf_transformation,[],[f12]) ).
fof(f27,plain,
~ greater(sK5,sK4),
inference(cnf_transformation,[],[f12]) ).
fof(f28,plain,
! [X2,X3,X0,X1,X8,X6,X7,X4,X5] :
( ~ class(X1,X2,X8)
| ~ inertia(X1,X6,X8)
| ~ inertia(X0,X5,X7)
| size(X1,X4,X8)
| size(X0,X3,X7)
| ~ greater(X4,X3)
| ~ class(X0,X2,X7)
| ~ organization(X1,X8)
| ~ organization(X0,X7)
| greater(X6,X5) ),
inference(consistent_polarity_flipping,[],[f14]) ).
fof(f29,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( ~ inertia(X1,X5,X3)
| survival_chance(X1,X7,X3)
| survival_chance(X0,X6,X2)
| ~ greater(X5,X4)
| ~ inertia(X0,X4,X2)
| reorganization_free(X1,X3,X3)
| reorganization_free(X0,X2,X2)
| ~ organization(X1,X3)
| ~ organization(X0,X2)
| greater(X7,X6) ),
inference(consistent_polarity_flipping,[],[f15]) ).
fof(f30,plain,
~ reorganization_free(sK1,sK8,sK8),
inference(consistent_polarity_flipping,[],[f24]) ).
fof(f31,plain,
~ reorganization_free(sK2,sK9,sK9),
inference(consistent_polarity_flipping,[],[f23]) ).
fof(f32,plain,
~ survival_chance(sK1,sK4,sK8),
inference(consistent_polarity_flipping,[],[f20]) ).
fof(f33,plain,
~ survival_chance(sK2,sK5,sK9),
inference(consistent_polarity_flipping,[],[f19]) ).
fof(f34,plain,
~ size(sK1,sK6,sK8),
inference(consistent_polarity_flipping,[],[f18]) ).
fof(f35,plain,
~ size(sK2,sK7,sK9),
inference(consistent_polarity_flipping,[],[f17]) ).
fof(f36,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ inertia(sK2,X0,sK9)
| ~ inertia(X1,X2,X3)
| size(sK2,X4,sK9)
| size(X1,X5,X3)
| ~ greater(X4,X5)
| ~ class(X1,sK3,X3)
| ~ organization(sK2,sK9)
| ~ organization(X1,X3)
| greater(X0,X2) ),
inference(resolution,[],[f28,f21]) ).
fof(f39,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ inertia(sK2,X0,sK9)
| ~ inertia(X1,X2,X3)
| size(sK2,X4,sK9)
| size(X1,X5,X3)
| ~ greater(X4,X5)
| ~ class(X1,sK3,X3)
| ~ organization(X1,X3)
| greater(X0,X2) ),
inference(forward_subsumption_resolution,[],[f36,f25]) ).
fof(f40,plain,
! [X2,X3,X0,X1,X6,X4,X5] :
( survival_chance(X0,X1,X2)
| survival_chance(X3,X4,X5)
| ~ greater(sK0(X0,X2),X6)
| ~ inertia(X3,X6,X5)
| reorganization_free(X0,X2,X2)
| reorganization_free(X3,X5,X5)
| ~ organization(X0,X2)
| ~ organization(X3,X5)
| greater(X1,X4)
| ~ organization(X0,X2) ),
inference(resolution,[],[f29,f13]) ).
fof(f41,plain,
! [X2,X3,X0,X1,X6,X4,X5] :
( ~ greater(sK0(X0,X2),X6)
| survival_chance(X3,X4,X5)
| survival_chance(X0,X1,X2)
| ~ inertia(X3,X6,X5)
| reorganization_free(X0,X2,X2)
| reorganization_free(X3,X5,X5)
| ~ organization(X0,X2)
| ~ organization(X3,X5)
| greater(X1,X4) ),
inference(duplicate_literal_removal,[],[f40]) ).
fof(f62,plain,
! [X2,X3,X0,X1,X4] :
( ~ inertia(X0,X1,X2)
| size(sK2,X3,sK9)
| size(X0,X4,X2)
| ~ greater(X3,X4)
| ~ class(X0,sK3,X2)
| ~ organization(X0,X2)
| greater(sK0(sK2,sK9),X1)
| ~ organization(sK2,sK9) ),
inference(resolution,[],[f39,f13]) ).
fof(f63,plain,
! [X2,X3,X0,X1,X4] :
( ~ greater(X3,X4)
| size(sK2,X3,sK9)
| size(X0,X4,X2)
| ~ inertia(X0,X1,X2)
| ~ class(X0,sK3,X2)
| ~ organization(X0,X2)
| greater(sK0(sK2,sK9),X1) ),
inference(forward_subsumption_resolution,[],[f62,f25]) ).
fof(f74,plain,
! [X2,X0,X1] :
( size(sK2,sK7,sK9)
| size(X0,sK6,X1)
| ~ inertia(X0,X2,X1)
| ~ class(X0,sK3,X1)
| ~ organization(X0,X1)
| greater(sK0(sK2,sK9),X2) ),
inference(resolution,[],[f63,f16]) ).
fof(f75,plain,
! [X2,X0,X1] :
( ~ inertia(X0,X2,X1)
| size(X0,sK6,X1)
| ~ class(X0,sK3,X1)
| ~ organization(X0,X1)
| greater(sK0(sK2,sK9),X2) ),
inference(forward_subsumption_resolution,[],[f74,f35]) ).
fof(f78,plain,
! [X0,X1] :
( size(X0,sK6,X1)
| ~ class(X0,sK3,X1)
| ~ organization(X0,X1)
| greater(sK0(sK2,sK9),sK0(X0,X1))
| ~ organization(X0,X1) ),
inference(resolution,[],[f75,f13]) ).
fof(f79,plain,
! [X0,X1] :
( ~ class(X0,sK3,X1)
| size(X0,sK6,X1)
| ~ organization(X0,X1)
| greater(sK0(sK2,sK9),sK0(X0,X1)) ),
inference(duplicate_literal_removal,[],[f78]) ).
fof(f102,plain,
( size(sK1,sK6,sK8)
| ~ organization(sK1,sK8)
| greater(sK0(sK2,sK9),sK0(sK1,sK8)) ),
inference(resolution,[],[f79,f22]) ).
fof(f103,plain,
( ~ organization(sK1,sK8)
| greater(sK0(sK2,sK9),sK0(sK1,sK8)) ),
inference(forward_subsumption_resolution,[],[f102,f34]) ).
fof(f104,plain,
greater(sK0(sK2,sK9),sK0(sK1,sK8)),
inference(forward_subsumption_resolution,[],[f103,f26]) ).
fof(f105,plain,
! [X2,X3,X0,X1] :
( survival_chance(X0,X1,X2)
| survival_chance(sK2,X3,sK9)
| ~ inertia(X0,sK0(sK1,sK8),X2)
| reorganization_free(sK2,sK9,sK9)
| reorganization_free(X0,X2,X2)
| ~ organization(sK2,sK9)
| ~ organization(X0,X2)
| greater(X3,X1) ),
inference(resolution,[],[f104,f41]) ).
fof(f120,plain,
! [X2,X3,X0,X1] :
( survival_chance(X0,X1,X2)
| survival_chance(sK2,X3,sK9)
| ~ inertia(X0,sK0(sK1,sK8),X2)
| reorganization_free(X0,X2,X2)
| ~ organization(sK2,sK9)
| ~ organization(X0,X2)
| greater(X3,X1) ),
inference(forward_subsumption_resolution,[],[f105,f31]) ).
fof(f121,plain,
! [X2,X3,X0,X1] :
( ~ inertia(X0,sK0(sK1,sK8),X2)
| survival_chance(sK2,X3,sK9)
| survival_chance(X0,X1,X2)
| reorganization_free(X0,X2,X2)
| ~ organization(X0,X2)
| greater(X3,X1) ),
inference(forward_subsumption_resolution,[],[f120,f25]) ).
fof(f158,plain,
! [X0,X1] :
( survival_chance(sK2,X0,sK9)
| survival_chance(sK1,X1,sK8)
| reorganization_free(sK1,sK8,sK8)
| ~ organization(sK1,sK8)
| greater(X0,X1)
| ~ organization(sK1,sK8) ),
inference(resolution,[],[f121,f13]) ).
fof(f159,plain,
! [X0,X1] :
( survival_chance(sK2,X0,sK9)
| survival_chance(sK1,X1,sK8)
| reorganization_free(sK1,sK8,sK8)
| ~ organization(sK1,sK8)
| greater(X0,X1) ),
inference(duplicate_literal_removal,[],[f158]) ).
fof(f160,plain,
! [X0,X1] :
( survival_chance(sK2,X0,sK9)
| survival_chance(sK1,X1,sK8)
| ~ organization(sK1,sK8)
| greater(X0,X1) ),
inference(forward_subsumption_resolution,[],[f159,f30]) ).
fof(f161,plain,
! [X0,X1] :
( survival_chance(sK2,X0,sK9)
| survival_chance(sK1,X1,sK8)
| greater(X0,X1) ),
inference(forward_subsumption_resolution,[],[f160,f26]) ).
fof(f168,plain,
! [X0] :
( survival_chance(sK1,X0,sK8)
| greater(sK5,X0) ),
inference(resolution,[],[f161,f33]) ).
fof(f240,plain,
greater(sK5,sK4),
inference(resolution,[],[f168,f32]) ).
fof(f241,plain,
$false,
inference(forward_subsumption_resolution,[],[f240,f27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT008+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.39 % Computer : n003.cluster.edu
% 0.13/0.39 % Model : x86_64 x86_64
% 0.13/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39 % Memory : 8046.5625MB
% 0.13/0.39 % OS : Linux 6.8.0-71-generic
% 0.13/0.39 % CPULimit : 300
% 0.13/0.39 % WCLimit : 300
% 0.13/0.39 % DateTime : Sun Sep 27 17:17:41 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.42 Running first-order model finding
% 0.13/0.42 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.47 % (804111)Will run a generic schedule for satisfiability detection.
% 0.18/0.47 % (804122)% WARNING: option uhcvi not known.
% 0.18/0.47 % (804122)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3061354378:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.47 % (804122) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-804111-804122"...
% 0.18/0.47 % (804122)...printing done.
% 0.18/0.47 % (804122)Refutation found. Thanks to Tanya!
% 0.18/0.47 % SZS status Theorem for theBenchmark
% 0.18/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.47 % (804122)------------------------------
% 0.18/0.47 % (804122)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.47 % (804122)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.47 % (804122)CaDiCaL version: 2.1.3
% 0.18/0.47 % (804122)Termination reason: Refutation
% 0.18/0.47 % (804122)Time elapsed: 0.004 s
% 0.18/0.47 % (804122)Peak memory usage: 11 MB
% 0.18/0.47 % (804122)Instructions burned: 10 (million)
% 0.18/0.47 % (804111)Success in time 0.041 s
% 0.18/0.47 % Vampire exiting
%------------------------------------------------------------------------------