%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : MGT016+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 : n018.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 1.62s 1.13s
% Output : Refutation 2.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 31
% Number of leaves : 15
% Syntax : Number of formulae : 104 ( 24 unt; 11 def)
% Number of atoms : 443 ( 0 equ)
% Maximal formula atoms : 13 ( 4 avg)
% Number of connectives : 622 ( 283 ~; 246 |; 77 &)
% ( 11 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 19 ( 18 usr; 3 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 300 ( 0 sgn 280 !; 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)
& 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/sandbox2/benchmark/theBenchmark.p',a12_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)
& complexity(X0,X4,X6)
& complexity(X1,X5,X6)
& greater(X5,X4) )
=> greater(X7,X8) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t16_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)
& complexity(X0,X4,X6)
& complexity(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)
| ~ complexity(X0,X3,X7)
| ~ complexity(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)
| ~ complexity(X0,X3,X7)
| ~ complexity(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)
& complexity(X0,X4,X6)
& complexity(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)
& complexity(X0,X4,X6)
& complexity(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)
& complexity(sK0,sK4,sK6)
& complexity(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] :
( 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(cnf_transformation,[],[f7]) ).
fof(f16,plain,
! [X2,X3,X0,X1,X8,X6,X7,X4,X5] :
( 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(cnf_transformation,[],[f9]) ).
fof(f17,plain,
greater(sK5,sK4),
inference(cnf_transformation,[],[f13]) ).
fof(f18,plain,
complexity(sK1,sK5,sK6),
inference(cnf_transformation,[],[f13]) ).
fof(f19,plain,
complexity(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,
! [X3,X0,X7,X4] :
( ~ complexity(X0,X3,X7)
| ~ greater(X4,X3)
| sP10(X0,X7,X4) ),
inference(cnf_transformation,[],[f31_D]) ).
fof(f31_D,definition,
! [X4,X7,X0] :
( ! [X3] :
( ~ complexity(X0,X3,X7)
| ~ greater(X4,X3) )
<=> ~ sP10(X0,X7,X4) ),
introduced(definition,[new_symbols(definition,[sP10])],[general_splitting_component_introduction]) ).
fof(f32,plain,
! [X2,X0,X1,X8,X6,X7,X4,X5] :
( greater(X6,X5)
| ~ organization(X0,X7)
| ~ organization(X1,X8)
| ~ class(X0,X2,X7)
| ~ class(X1,X2,X8)
| ~ complexity(X1,X4,X8)
| ~ inertia(X0,X5,X7)
| ~ inertia(X1,X6,X8)
| ~ sP10(X0,X7,X4) ),
inference(general_splitting,[],[f15,f31_D]) ).
fof(f33,plain,
! [X1,X8,X6,X5] :
( ~ inertia(X1,X6,X8)
| greater(X6,X5)
| sP11(X5,X8,X1) ),
inference(cnf_transformation,[],[f33_D]) ).
fof(f33_D,definition,
! [X1,X8,X5] :
( ! [X6] :
( ~ inertia(X1,X6,X8)
| greater(X6,X5) )
<=> ~ sP11(X5,X8,X1) ),
introduced(definition,[new_symbols(definition,[sP11])],[general_splitting_component_introduction]) ).
fof(f34,plain,
! [X2,X0,X1,X8,X7,X4,X5] :
( ~ organization(X0,X7)
| ~ organization(X1,X8)
| ~ class(X0,X2,X7)
| ~ class(X1,X2,X8)
| ~ complexity(X1,X4,X8)
| ~ inertia(X0,X5,X7)
| ~ sP10(X0,X7,X4)
| ~ sP11(X5,X8,X1) ),
inference(general_splitting,[],[f32,f33_D]) ).
fof(f35,plain,
! [X2,X0,X1,X8,X7] :
( sP12(X0,X8,X1,X7)
| ~ class(X1,X2,X8)
| ~ class(X0,X2,X7) ),
inference(cnf_transformation,[],[f35_D]) ).
fof(f35_D,definition,
! [X7,X1,X8,X0] :
( ! [X2] :
( ~ class(X1,X2,X8)
| ~ class(X0,X2,X7) )
<=> ~ sP12(X0,X8,X1,X7) ),
introduced(definition,[new_symbols(definition,[sP12])],[general_splitting_component_introduction]) ).
fof(f36,plain,
! [X0,X1,X8,X7,X4,X5] :
( ~ organization(X0,X7)
| ~ organization(X1,X8)
| ~ complexity(X1,X4,X8)
| ~ inertia(X0,X5,X7)
| ~ sP10(X0,X7,X4)
| ~ sP11(X5,X8,X1)
| ~ sP12(X0,X8,X1,X7) ),
inference(general_splitting,[],[f34,f35_D]) ).
fof(f37,plain,
! [X0,X1,X8,X7,X4] :
( sP13(X0,X8,X1,X7)
| ~ sP10(X0,X7,X4)
| ~ complexity(X1,X4,X8) ),
inference(cnf_transformation,[],[f37_D]) ).
fof(f37_D,definition,
! [X7,X1,X8,X0] :
( ! [X4] :
( ~ sP10(X0,X7,X4)
| ~ complexity(X1,X4,X8) )
<=> ~ sP13(X0,X8,X1,X7) ),
introduced(definition,[new_symbols(definition,[sP13])],[general_splitting_component_introduction]) ).
fof(f38,plain,
! [X0,X1,X8,X7,X5] :
( ~ sP13(X0,X8,X1,X7)
| ~ organization(X1,X8)
| ~ inertia(X0,X5,X7)
| ~ sP11(X5,X8,X1)
| ~ sP12(X0,X8,X1,X7)
| ~ organization(X0,X7) ),
inference(general_splitting,[],[f36,f37_D]) ).
fof(f39,plain,
! [X2,X0,X1,X6] :
( ~ reorganization_type(X1,X2,X6)
| ~ reorganization_type(X0,X2,X6)
| sP14(X0,X1,X6) ),
inference(cnf_transformation,[],[f39_D]) ).
fof(f39_D,definition,
! [X6,X1,X0] :
( ! [X2] :
( ~ reorganization_type(X1,X2,X6)
| ~ reorganization_type(X0,X2,X6) )
<=> ~ sP14(X0,X1,X6) ),
introduced(definition,[new_symbols(definition,[sP14])],[general_splitting_component_introduction]) ).
fof(f40,plain,
! [X3,X0,X1,X8,X6,X7,X4,X5] :
( 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)
| ~ inertia(X0,X4,X6)
| ~ inertia(X1,X5,X6)
| ~ greater(X5,X4)
| ~ sP14(X0,X1,X6) ),
inference(general_splitting,[],[f16,f39_D]) ).
fof(f41,plain,
! [X3,X0,X1,X6] :
( ~ class(X1,X3,X6)
| ~ class(X0,X3,X6)
| sP15(X1,X0,X6) ),
inference(cnf_transformation,[],[f41_D]) ).
fof(f41_D,definition,
! [X6,X0,X1] :
( ! [X3] :
( ~ class(X1,X3,X6)
| ~ class(X0,X3,X6) )
<=> ~ sP15(X1,X0,X6) ),
introduced(definition,[new_symbols(definition,[sP15])],[general_splitting_component_introduction]) ).
fof(f42,plain,
! [X0,X1,X8,X6,X7,X4,X5] :
( greater(X7,X8)
| ~ organization(X0,X6)
| ~ organization(X1,X6)
| organization(X1,X8)
| ~ reorganization(X0,X6,X7)
| ~ reorganization(X1,X6,X8)
| ~ inertia(X0,X4,X6)
| ~ inertia(X1,X5,X6)
| ~ greater(X5,X4)
| ~ sP14(X0,X1,X6)
| ~ sP15(X1,X0,X6) ),
inference(general_splitting,[],[f40,f41_D]) ).
fof(f43,plain,
! [X1,X8,X6,X7] :
( ~ reorganization(X1,X6,X8)
| organization(X1,X8)
| greater(X7,X8)
| sP16(X1,X6,X7) ),
inference(cnf_transformation,[],[f43_D]) ).
fof(f43_D,definition,
! [X7,X6,X1] :
( ! [X8] :
( ~ reorganization(X1,X6,X8)
| organization(X1,X8)
| greater(X7,X8) )
<=> ~ sP16(X1,X6,X7) ),
introduced(definition,[new_symbols(definition,[sP16])],[general_splitting_component_introduction]) ).
fof(f44,plain,
! [X0,X1,X6,X7,X4,X5] :
( ~ organization(X0,X6)
| ~ organization(X1,X6)
| ~ reorganization(X0,X6,X7)
| ~ inertia(X0,X4,X6)
| ~ inertia(X1,X5,X6)
| ~ greater(X5,X4)
| ~ sP14(X0,X1,X6)
| ~ sP15(X1,X0,X6)
| ~ sP16(X1,X6,X7) ),
inference(general_splitting,[],[f42,f43_D]) ).
fof(f45,plain,
! [X0,X1,X6,X7] :
( ~ sP16(X1,X6,X7)
| ~ reorganization(X0,X6,X7)
| sP17(X0,X6,X1) ),
inference(cnf_transformation,[],[f45_D]) ).
fof(f45_D,definition,
! [X1,X6,X0] :
( ! [X7] :
( ~ sP16(X1,X6,X7)
| ~ reorganization(X0,X6,X7) )
<=> ~ sP17(X0,X6,X1) ),
introduced(definition,[new_symbols(definition,[sP17])],[general_splitting_component_introduction]) ).
fof(f46,plain,
! [X0,X1,X6,X4,X5] :
( ~ organization(X0,X6)
| ~ organization(X1,X6)
| ~ inertia(X0,X4,X6)
| ~ inertia(X1,X5,X6)
| ~ greater(X5,X4)
| ~ sP14(X0,X1,X6)
| ~ sP15(X1,X0,X6)
| ~ sP17(X0,X6,X1) ),
inference(general_splitting,[],[f44,f45_D]) ).
fof(f47,plain,
! [X0,X1,X6,X4] :
( ~ sP17(X0,X6,X1)
| ~ inertia(X0,X4,X6)
| ~ sP14(X0,X1,X6)
| ~ sP15(X1,X0,X6)
| ~ organization(X0,X6)
| sP18(X4,X6,X1) ),
inference(cnf_transformation,[],[f47_D]) ).
fof(f47_D,definition,
! [X1,X6,X4] :
( ! [X0] :
( ~ sP17(X0,X6,X1)
| ~ inertia(X0,X4,X6)
| ~ sP14(X0,X1,X6)
| ~ sP15(X1,X0,X6)
| ~ organization(X0,X6) )
<=> ~ sP18(X4,X6,X1) ),
introduced(definition,[new_symbols(definition,[sP18])],[general_splitting_component_introduction]) ).
fof(f48,plain,
! [X1,X6,X4,X5] :
( ~ sP18(X4,X6,X1)
| ~ inertia(X1,X5,X6)
| ~ greater(X5,X4)
| ~ organization(X1,X6) ),
inference(general_splitting,[],[f46,f47_D]) ).
fof(f50,plain,
! [X0] :
( sP10(sK0,sK6,X0)
| ~ greater(X0,sK4) ),
inference(resolution,[],[f31,f19]) ).
fof(f51,plain,
! [X2,X0,X1] :
( greater(sK9(X0,X1),X2)
| sP11(X2,X1,X0)
| ~ organization(X0,X1) ),
inference(resolution,[],[f33,f30]) ).
fof(f52,plain,
! [X0] :
( ~ reorganization_type(X0,sK2,sK6)
| sP14(X0,sK1,sK6) ),
inference(resolution,[],[f39,f20]) ).
fof(f55,plain,
sP14(sK0,sK1,sK6),
inference(resolution,[],[f52,f21]) ).
fof(f56,plain,
! [X0] :
( ~ class(X0,sK3,sK6)
| sP15(sK1,X0,sK6) ),
inference(resolution,[],[f41,f24]) ).
fof(f60,plain,
! [X0] :
( organization(sK1,sK8)
| greater(X0,sK8)
| sP16(sK1,sK6,X0) ),
inference(resolution,[],[f43,f22]) ).
fof(f70,plain,
! [X0] :
( sP16(sK1,sK6,X0)
| greater(X0,sK8) ),
inference(forward_subsumption_resolution,[],[f60,f26]) ).
fof(f71,plain,
! [X0,X1] :
( ~ reorganization(X1,sK6,X0)
| greater(X0,sK8)
| sP17(X1,sK6,sK1) ),
inference(resolution,[],[f70,f45]) ).
fof(f72,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ sP12(X2,X1,X0,X4)
| ~ inertia(X2,X3,X4)
| ~ sP11(X3,X1,X0)
| ~ organization(X0,X1)
| ~ organization(X2,X4)
| ~ sP10(X2,X4,X5)
| ~ complexity(X0,X5,X1) ),
inference(resolution,[],[f38,f37]) ).
fof(f74,plain,
sP15(sK1,sK0,sK6),
inference(resolution,[],[f56,f25]) ).
fof(f77,plain,
! [X2,X3,X0,X1,X6,X4,X5] :
( ~ sP11(X1,X3,X4)
| ~ inertia(X0,X1,X2)
| ~ organization(X4,X3)
| ~ organization(X0,X2)
| ~ sP10(X0,X2,X5)
| ~ complexity(X4,X5,X3)
| ~ class(X4,X6,X3)
| ~ class(X0,X6,X2) ),
inference(resolution,[],[f72,f35]) ).
fof(f79,plain,
( greater(sK7,sK8)
| sP17(sK0,sK6,sK1) ),
inference(resolution,[],[f71,f23]) ).
fof(f80,plain,
sP17(sK0,sK6,sK1),
inference(forward_subsumption_resolution,[],[f79,f29]) ).
fof(f90,plain,
! [X0] :
( ~ inertia(sK0,X0,sK6)
| ~ sP14(sK0,sK1,sK6)
| ~ sP15(sK1,sK0,sK6)
| ~ organization(sK0,sK6)
| sP18(X0,sK6,sK1) ),
inference(resolution,[],[f80,f47]) ).
fof(f91,plain,
! [X0] :
( ~ inertia(sK0,X0,sK6)
| ~ sP15(sK1,sK0,sK6)
| ~ organization(sK0,sK6)
| sP18(X0,sK6,sK1) ),
inference(forward_subsumption_resolution,[],[f90,f55]) ).
fof(f92,plain,
! [X0] :
( ~ inertia(sK0,X0,sK6)
| ~ organization(sK0,sK6)
| sP18(X0,sK6,sK1) ),
inference(forward_subsumption_resolution,[],[f91,f74]) ).
fof(f93,plain,
! [X0] :
( ~ inertia(sK0,X0,sK6)
| sP18(X0,sK6,sK1) ),
inference(forward_subsumption_resolution,[],[f92,f28]) ).
fof(f98,plain,
( sP18(sK9(sK0,sK6),sK6,sK1)
| ~ organization(sK0,sK6) ),
inference(resolution,[],[f93,f30]) ).
fof(f99,plain,
sP18(sK9(sK0,sK6),sK6,sK1),
inference(forward_subsumption_resolution,[],[f98,f28]) ).
fof(f102,plain,
! [X0] :
( ~ inertia(sK1,X0,sK6)
| ~ greater(X0,sK9(sK0,sK6))
| ~ organization(sK1,sK6) ),
inference(resolution,[],[f99,f48]) ).
fof(f103,plain,
! [X0] :
( ~ greater(X0,sK9(sK0,sK6))
| ~ inertia(sK1,X0,sK6) ),
inference(forward_subsumption_resolution,[],[f102,f27]) ).
fof(f106,plain,
! [X0,X1] :
( ~ inertia(sK1,sK9(X0,X1),sK6)
| sP11(sK9(sK0,sK6),X1,X0)
| ~ organization(X0,X1) ),
inference(resolution,[],[f103,f51]) ).
fof(f108,plain,
( sP11(sK9(sK0,sK6),sK6,sK1)
| ~ organization(sK1,sK6)
| ~ organization(sK1,sK6) ),
inference(resolution,[],[f106,f30]) ).
fof(f109,plain,
( sP11(sK9(sK0,sK6),sK6,sK1)
| ~ organization(sK1,sK6) ),
inference(duplicate_literal_removal,[],[f108]) ).
fof(f110,plain,
sP11(sK9(sK0,sK6),sK6,sK1),
inference(forward_subsumption_resolution,[],[f109,f27]) ).
fof(f114,plain,
! [X2,X3,X0,X1] :
( ~ inertia(X0,sK9(sK0,sK6),X1)
| ~ organization(sK1,sK6)
| ~ organization(X0,X1)
| ~ sP10(X0,X1,X2)
| ~ complexity(sK1,X2,sK6)
| ~ class(sK1,X3,sK6)
| ~ class(X0,X3,X1) ),
inference(resolution,[],[f110,f77]) ).
fof(f115,plain,
! [X2,X3,X0,X1] :
( ~ inertia(X0,sK9(sK0,sK6),X1)
| ~ organization(X0,X1)
| ~ sP10(X0,X1,X2)
| ~ complexity(sK1,X2,sK6)
| ~ class(sK1,X3,sK6)
| ~ class(X0,X3,X1) ),
inference(forward_subsumption_resolution,[],[f114,f27]) ).
fof(f118,plain,
! [X0,X1] :
( ~ organization(sK0,sK6)
| ~ sP10(sK0,sK6,X0)
| ~ complexity(sK1,X0,sK6)
| ~ class(sK1,X1,sK6)
| ~ class(sK0,X1,sK6)
| ~ organization(sK0,sK6) ),
inference(resolution,[],[f115,f30]) ).
fof(f119,plain,
! [X0,X1] :
( ~ organization(sK0,sK6)
| ~ sP10(sK0,sK6,X0)
| ~ complexity(sK1,X0,sK6)
| ~ class(sK1,X1,sK6)
| ~ class(sK0,X1,sK6) ),
inference(duplicate_literal_removal,[],[f118]) ).
fof(f120,plain,
! [X0,X1] :
( ~ sP10(sK0,sK6,X0)
| ~ complexity(sK1,X0,sK6)
| ~ class(sK1,X1,sK6)
| ~ class(sK0,X1,sK6) ),
inference(forward_subsumption_resolution,[],[f119,f28]) ).
fof(f122,definition,
( spl19_5
<=> ! [X1] :
( ~ class(sK1,X1,sK6)
| ~ class(sK0,X1,sK6) ) ),
introduced(definition,[new_symbols(definition,[spl19_5])],[avatar_definition]) ).
fof(f123,plain,
( ! [X1] :
( ~ class(sK1,X1,sK6)
| ~ class(sK0,X1,sK6) )
| ~ spl19_5 ),
inference(avatar_component_clause,[],[f122]) ).
fof(f125,definition,
( spl19_6
<=> ! [X0] :
( ~ sP10(sK0,sK6,X0)
| ~ complexity(sK1,X0,sK6) ) ),
introduced(definition,[new_symbols(definition,[spl19_6])],[avatar_definition]) ).
fof(f126,plain,
( ! [X0] :
( ~ sP10(sK0,sK6,X0)
| ~ complexity(sK1,X0,sK6) )
| ~ spl19_6 ),
inference(avatar_component_clause,[],[f125]) ).
fof(f127,plain,
( spl19_5
| spl19_6 ),
inference(avatar_split_clause,[],[f120,f125,f122]) ).
fof(f140,plain,
( ~ class(sK0,sK3,sK6)
| ~ spl19_5 ),
inference(resolution,[],[f123,f24]) ).
fof(f141,plain,
( $false
| ~ spl19_5 ),
inference(forward_subsumption_resolution,[],[f140,f25]) ).
fof(f142,plain,
~ spl19_5,
inference(avatar_contradiction_clause,[],[f141]) ).
fof(f143,plain,
( ! [X0] :
( ~ complexity(sK1,X0,sK6)
| ~ greater(X0,sK4) )
| ~ spl19_6 ),
inference(resolution,[],[f126,f50]) ).
fof(f144,plain,
( ~ greater(sK5,sK4)
| ~ spl19_6 ),
inference(resolution,[],[f143,f18]) ).
fof(f145,plain,
( $false
| ~ spl19_6 ),
inference(forward_subsumption_resolution,[],[f144,f17]) ).
fof(f146,plain,
~ spl19_6,
inference(avatar_contradiction_clause,[],[f145]) ).
cnf(s3,plain,
( spl19_5
| spl19_6 ),
inference(sat_conversion,[],[f127]) ).
cnf(s6,plain,
~ spl19_5,
inference(sat_conversion,[],[f142]) ).
cnf(s7,plain,
~ spl19_6,
inference(sat_conversion,[],[f146]) ).
cnf(s9,plain,
$false,
inference(rat,[],[s3,s7,s6]) ).
fof(f147,plain,
$false,
inference(avatar_sat_refutation,[],[s9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT016+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.39 % Computer : n018.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:18:39 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.43 Running first-order theorem proving
% 0.12/0.43 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
% 1.62/1.13 % (2614105)Detected formulas, will run a generic FOF schedule.
% 1.62/1.13 % (2614113)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=4108852264:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 1.62/1.13 % (2614113)First to succeed.
% 1.62/1.13 % (2614113)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2614105"
% 1.62/1.13 % (2614110)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=2287438619:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 1.62/1.13 % (2614116)dis-21_1_sil=8000:lcm=predicate:random_seed=893682466: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.62/1.13 % (2614114)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3623545975:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 1.62/1.13 % (2614111)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=1431378973:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 1.62/1.13 % (2614112)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=2897799326:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 1.62/1.13 % (2614115)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=4136894284:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 1.62/1.13 % (2614114)Also succeeded, but the first one will report.
% 1.62/1.13 % (2614116)Also succeeded, but the first one will report.
% 1.62/1.13 % (2614115)Also succeeded, but the first one will report.
% 1.62/1.13 % (2614113)Refutation found. Thanks to Tanya!
% 1.62/1.13 % SZS status Theorem for theBenchmark
% 1.62/1.13 % SZS output start Proof for theBenchmark
% See solution above
% 2.54/1.33 % (2614113)------------------------------
% 2.54/1.33 % (2614113)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.54/1.33 % (2614113)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.54/1.33 % (2614113)CaDiCaL version: 2.1.3
% 2.54/1.33 % (2614113)Termination reason: Refutation
% 2.54/1.33 % (2614113)Time elapsed: 0.003 s
% 2.54/1.33 % (2614113)Peak memory usage: 89 MB
% 2.54/1.33 % (2614113)Instructions burned: 8 (million)
% 2.54/1.33 % (2614113)------------------------------
% 2.54/1.33 % (2614113)------------------------------
% 2.54/1.33 % (2614105)Success in time 0.269 s
% 2.54/1.33 % Vampire exiting
%------------------------------------------------------------------------------