%------------------------------------------------------------------------------
% File : Vampire-SAT---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 SAT
% Computer : n020.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:28 PM UTC 2026
% Result : Theorem 0.14s 0.43s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 15
% Syntax : Number of formulae : 112 ( 35 unt; 11 def)
% Number of atoms : 422 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 552 ( 242 ~; 222 |; 69 &)
% ( 14 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 19 ( 18 usr; 12 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 198 ( 0 sgn 178 !; 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(f32,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( 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(consistent_polarity_flipping,[],[f18]) ).
fof(f34,plain,
! [X2,X3,X0,X1,X8,X6,X7,X4,X5] :
( greater(X4,X3)
| ~ 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(X6,X5) ),
inference(consistent_polarity_flipping,[],[f19]) ).
fof(f35,plain,
greater(sK5,sK4),
inference(consistent_polarity_flipping,[],[f31]) ).
fof(f36,plain,
~ reorganization_free(sK1,sK8,sK8),
inference(consistent_polarity_flipping,[],[f28]) ).
fof(f37,plain,
~ reorganization_free(sK2,sK9,sK9),
inference(consistent_polarity_flipping,[],[f27]) ).
fof(f38,plain,
~ size(sK1,sK6,sK8),
inference(consistent_polarity_flipping,[],[f22]) ).
fof(f39,plain,
~ size(sK2,sK7,sK9),
inference(consistent_polarity_flipping,[],[f21]) ).
fof(f40,plain,
~ greater(sK7,sK6),
inference(consistent_polarity_flipping,[],[f20]) ).
fof(f49,definition,
( spl10_2
<=> organization(sK2,sK9) ),
introduced(definition,[new_symbols(definition,[spl10_2])],[avatar_definition]) ).
fof(f51,plain,
( ~ organization(sK2,sK9)
| spl10_2 ),
inference(avatar_component_clause,[],[f49]) ).
fof(f61,definition,
( spl10_5
<=> organization(sK1,sK8) ),
introduced(definition,[new_symbols(definition,[spl10_5])],[avatar_definition]) ).
fof(f63,plain,
( ~ organization(sK1,sK8)
| spl10_5 ),
inference(avatar_component_clause,[],[f61]) ).
fof(f68,plain,
( $false
| spl10_2 ),
inference(resolution,[],[f51,f29]) ).
fof(f69,plain,
spl10_2,
inference(avatar_contradiction_clause,[],[f68]) ).
fof(f70,plain,
( $false
| spl10_5 ),
inference(resolution,[],[f63,f30]) ).
fof(f71,plain,
spl10_5,
inference(avatar_contradiction_clause,[],[f70]) ).
fof(f73,plain,
! [X2,X3,X0,X1,X6,X4,X5] :
( size(X2,sK7,X3)
| ~ organization(X2,X3)
| ~ class(X0,X4,X1)
| ~ class(X2,X4,X3)
| size(X0,sK6,X1)
| ~ organization(X0,X1)
| ~ inertia(X0,X5,X1)
| ~ inertia(X2,X6,X3)
| ~ greater(X6,X5) ),
inference(resolution,[],[f34,f40]) ).
fof(f74,plain,
! [X2,X3,X0,X1,X4] :
( ~ organization(sK2,sK9)
| ~ class(X0,X1,X2)
| ~ class(sK2,X1,sK9)
| size(X0,sK6,X2)
| ~ organization(X0,X2)
| ~ inertia(X0,X3,X2)
| ~ inertia(sK2,X4,sK9)
| ~ greater(X4,X3) ),
inference(resolution,[],[f73,f39]) ).
fof(f76,definition,
( spl10_7
<=> ! [X4,X0,X3,X2,X1] :
( ~ class(X0,X1,X2)
| ~ inertia(sK2,X4,sK9)
| ~ greater(X4,X3)
| ~ inertia(X0,X3,X2)
| ~ organization(X0,X2)
| size(X0,sK6,X2)
| ~ class(sK2,X1,sK9) ) ),
introduced(definition,[new_symbols(definition,[spl10_7])],[avatar_definition]) ).
fof(f77,plain,
( ! [X2,X3,X0,X1,X4] :
( size(X0,sK6,X2)
| ~ inertia(sK2,X4,sK9)
| ~ greater(X4,X3)
| ~ inertia(X0,X3,X2)
| ~ organization(X0,X2)
| ~ class(X0,X1,X2)
| ~ class(sK2,X1,sK9) )
| ~ spl10_7 ),
inference(avatar_component_clause,[],[f76]) ).
fof(f78,plain,
( spl10_7
| ~ spl10_2 ),
inference(avatar_split_clause,[],[f74,f49,f76]) ).
fof(f79,plain,
( ! [X2,X0,X1] :
( ~ inertia(sK2,X0,sK9)
| ~ greater(X0,X1)
| ~ inertia(sK1,X1,sK8)
| ~ organization(sK1,sK8)
| ~ class(sK1,X2,sK8)
| ~ class(sK2,X2,sK9) )
| ~ spl10_7 ),
inference(resolution,[],[f77,f38]) ).
fof(f81,definition,
( spl10_8
<=> ! [X2] :
( ~ class(sK1,X2,sK8)
| ~ class(sK2,X2,sK9) ) ),
introduced(definition,[new_symbols(definition,[spl10_8])],[avatar_definition]) ).
fof(f82,plain,
( ! [X2] :
( ~ class(sK2,X2,sK9)
| ~ class(sK1,X2,sK8) )
| ~ spl10_8 ),
inference(avatar_component_clause,[],[f81]) ).
fof(f84,definition,
( spl10_9
<=> ! [X0,X1] :
( ~ inertia(sK2,X0,sK9)
| ~ inertia(sK1,X1,sK8)
| ~ greater(X0,X1) ) ),
introduced(definition,[new_symbols(definition,[spl10_9])],[avatar_definition]) ).
fof(f85,plain,
( ! [X0,X1] :
( ~ inertia(sK2,X0,sK9)
| ~ inertia(sK1,X1,sK8)
| ~ greater(X0,X1) )
| ~ spl10_9 ),
inference(avatar_component_clause,[],[f84]) ).
fof(f86,plain,
( spl10_8
| ~ spl10_5
| spl10_9
| ~ spl10_7 ),
inference(avatar_split_clause,[],[f79,f76,f84,f61,f81]) ).
fof(f87,plain,
( ~ class(sK1,sK3,sK8)
| ~ spl10_8 ),
inference(resolution,[],[f82,f25]) ).
fof(f88,plain,
( $false
| ~ spl10_8 ),
inference(resolution,[],[f87,f26]) ).
fof(f89,plain,
~ spl10_8,
inference(avatar_contradiction_clause,[],[f88]) ).
fof(f90,plain,
( ! [X0] :
( ~ inertia(sK1,X0,sK8)
| ~ greater(sK0(sK2,sK9),X0)
| ~ organization(sK2,sK9) )
| ~ spl10_9 ),
inference(resolution,[],[f85,f16]) ).
fof(f92,definition,
( spl10_10
<=> ! [X0] :
( ~ inertia(sK1,X0,sK8)
| ~ greater(sK0(sK2,sK9),X0) ) ),
introduced(definition,[new_symbols(definition,[spl10_10])],[avatar_definition]) ).
fof(f93,plain,
( ! [X0] :
( ~ inertia(sK1,X0,sK8)
| ~ greater(sK0(sK2,sK9),X0) )
| ~ spl10_10 ),
inference(avatar_component_clause,[],[f92]) ).
fof(f94,plain,
( ~ spl10_2
| spl10_10
| ~ spl10_9 ),
inference(avatar_split_clause,[],[f90,f84,f92,f49]) ).
fof(f95,plain,
( ~ greater(sK0(sK2,sK9),sK0(sK1,sK8))
| ~ organization(sK1,sK8)
| ~ spl10_10 ),
inference(resolution,[],[f93,f16]) ).
fof(f97,definition,
( spl10_11
<=> greater(sK0(sK2,sK9),sK0(sK1,sK8)) ),
introduced(definition,[new_symbols(definition,[spl10_11])],[avatar_definition]) ).
fof(f99,plain,
( ~ greater(sK0(sK2,sK9),sK0(sK1,sK8))
| spl10_11 ),
inference(avatar_component_clause,[],[f97]) ).
fof(f100,plain,
( ~ spl10_5
| ~ spl10_11
| ~ spl10_10 ),
inference(avatar_split_clause,[],[f95,f92,f97,f61]) ).
fof(f103,plain,
( ! [X2,X3,X0,X1,X4,X5] :
( reorganization_free(X4,X5,X5)
| ~ organization(X2,X3)
| ~ organization(X4,X5)
| reorganization_free(X2,X3,X3)
| ~ greater(X0,X1)
| ~ reproducibility(X2,X1,X3)
| ~ reproducibility(X4,X0,X5)
| ~ inertia(X2,sK0(sK1,sK8),X3)
| ~ inertia(X4,sK0(sK2,sK9),X5) )
| spl10_11 ),
inference(resolution,[],[f99,f32]) ).
fof(f105,plain,
( ! [X2,X3,X0,X1] :
( ~ organization(X0,X1)
| ~ organization(sK2,sK9)
| reorganization_free(X0,X1,X1)
| ~ greater(X2,X3)
| ~ reproducibility(X0,X3,X1)
| ~ reproducibility(sK2,X2,sK9)
| ~ inertia(X0,sK0(sK1,sK8),X1)
| ~ inertia(sK2,sK0(sK2,sK9),sK9) )
| spl10_11 ),
inference(resolution,[],[f103,f37]) ).
fof(f107,definition,
( spl10_12
<=> inertia(sK2,sK0(sK2,sK9),sK9) ),
introduced(definition,[new_symbols(definition,[spl10_12])],[avatar_definition]) ).
fof(f109,plain,
( ~ inertia(sK2,sK0(sK2,sK9),sK9)
| spl10_12 ),
inference(avatar_component_clause,[],[f107]) ).
fof(f111,definition,
( spl10_13
<=> ! [X0,X3,X2,X1] :
( ~ organization(X0,X1)
| ~ inertia(X0,sK0(sK1,sK8),X1)
| ~ reproducibility(sK2,X2,sK9)
| ~ reproducibility(X0,X3,X1)
| ~ greater(X2,X3)
| reorganization_free(X0,X1,X1) ) ),
introduced(definition,[new_symbols(definition,[spl10_13])],[avatar_definition]) ).
fof(f112,plain,
( ! [X2,X3,X0,X1] :
( reorganization_free(X0,X1,X1)
| ~ inertia(X0,sK0(sK1,sK8),X1)
| ~ reproducibility(sK2,X2,sK9)
| ~ reproducibility(X0,X3,X1)
| ~ greater(X2,X3)
| ~ organization(X0,X1) )
| ~ spl10_13 ),
inference(avatar_component_clause,[],[f111]) ).
fof(f113,plain,
( ~ spl10_12
| ~ spl10_2
| spl10_13
| spl10_11 ),
inference(avatar_split_clause,[],[f105,f97,f111,f49,f107]) ).
fof(f122,plain,
( ~ organization(sK2,sK9)
| spl10_12 ),
inference(resolution,[],[f109,f16]) ).
fof(f123,plain,
( ~ spl10_2
| spl10_12 ),
inference(avatar_split_clause,[],[f122,f107,f49]) ).
fof(f125,plain,
( ! [X0,X1] :
( ~ inertia(sK1,sK0(sK1,sK8),sK8)
| ~ reproducibility(sK2,X0,sK9)
| ~ reproducibility(sK1,X1,sK8)
| ~ greater(X0,X1)
| ~ organization(sK1,sK8) )
| ~ spl10_13 ),
inference(resolution,[],[f112,f36]) ).
fof(f136,definition,
( spl10_18
<=> ! [X0,X1] :
( ~ reproducibility(sK2,X0,sK9)
| ~ greater(X0,X1)
| ~ reproducibility(sK1,X1,sK8) ) ),
introduced(definition,[new_symbols(definition,[spl10_18])],[avatar_definition]) ).
fof(f137,plain,
( ! [X0,X1] :
( ~ reproducibility(sK2,X0,sK9)
| ~ greater(X0,X1)
| ~ reproducibility(sK1,X1,sK8) )
| ~ spl10_18 ),
inference(avatar_component_clause,[],[f136]) ).
fof(f139,definition,
( spl10_19
<=> inertia(sK1,sK0(sK1,sK8),sK8) ),
introduced(definition,[new_symbols(definition,[spl10_19])],[avatar_definition]) ).
fof(f141,plain,
( ~ inertia(sK1,sK0(sK1,sK8),sK8)
| spl10_19 ),
inference(avatar_component_clause,[],[f139]) ).
fof(f142,plain,
( ~ spl10_5
| spl10_18
| ~ spl10_19
| ~ spl10_13 ),
inference(avatar_split_clause,[],[f125,f111,f139,f136,f61]) ).
fof(f143,plain,
( ~ organization(sK1,sK8)
| spl10_19 ),
inference(resolution,[],[f141,f16]) ).
fof(f144,plain,
( ~ spl10_5
| spl10_19 ),
inference(avatar_split_clause,[],[f143,f139,f61]) ).
fof(f146,plain,
( ! [X0] :
( ~ reproducibility(sK1,X0,sK8)
| ~ greater(sK5,X0) )
| ~ spl10_18 ),
inference(resolution,[],[f137,f23]) ).
fof(f147,plain,
( ~ greater(sK5,sK4)
| ~ spl10_18 ),
inference(resolution,[],[f146,f24]) ).
fof(f148,plain,
( $false
| ~ spl10_18 ),
inference(resolution,[],[f147,f35]) ).
fof(f152,plain,
~ spl10_18,
inference(avatar_contradiction_clause,[],[f148]) ).
cnf(s3,plain,
spl10_2,
inference(sat_conversion,[],[f69]) ).
cnf(s4,plain,
spl10_5,
inference(sat_conversion,[],[f71]) ).
cnf(s5,plain,
( ~ spl10_2
| spl10_7 ),
inference(sat_conversion,[],[f78]) ).
cnf(s6,plain,
( ~ spl10_5
| ~ spl10_7
| spl10_8
| spl10_9 ),
inference(sat_conversion,[],[f86]) ).
cnf(s7,plain,
~ spl10_8,
inference(sat_conversion,[],[f89]) ).
cnf(s8,plain,
( ~ spl10_2
| ~ spl10_9
| spl10_10 ),
inference(sat_conversion,[],[f94]) ).
cnf(s9,plain,
( ~ spl10_5
| ~ spl10_10
| ~ spl10_11 ),
inference(sat_conversion,[],[f100]) ).
cnf(s10,plain,
( ~ spl10_2
| spl10_11
| ~ spl10_12
| spl10_13 ),
inference(sat_conversion,[],[f113]) ).
cnf(s12,plain,
( ~ spl10_2
| spl10_12 ),
inference(sat_conversion,[],[f123]) ).
cnf(s14,plain,
( ~ spl10_5
| ~ spl10_13
| spl10_18
| ~ spl10_19 ),
inference(sat_conversion,[],[f142]) ).
cnf(s15,plain,
( ~ spl10_5
| spl10_19 ),
inference(sat_conversion,[],[f144]) ).
cnf(s16,plain,
~ spl10_18,
inference(sat_conversion,[],[f152]) ).
cnf(s17,plain,
( ~ spl10_5
| ~ spl10_13
| ~ spl10_19 ),
inference(rat,[],[s14,s16]) ).
cnf(s18,plain,
( ~ spl10_5
| ~ spl10_7
| spl10_9 ),
inference(rat,[],[s6,s7]) ).
cnf(s19,plain,
spl10_19,
inference(rat,[],[s15,s4]) ).
cnf(s20,plain,
~ spl10_13,
inference(rat,[],[s17,s19,s4]) ).
cnf(s21,plain,
spl10_12,
inference(rat,[],[s12,s3]) ).
cnf(s22,plain,
spl10_11,
inference(rat,[],[s10,s20,s21,s3]) ).
cnf(s23,plain,
spl10_7,
inference(rat,[],[s5,s3]) ).
cnf(s24,plain,
~ spl10_10,
inference(rat,[],[s9,s4,s22]) ).
cnf(s25,plain,
spl10_9,
inference(rat,[],[s18,s4,s23]) ).
cnf(s26,plain,
$false,
inference(rat,[],[s8,s3,s24,s25]) ).
fof(f153,plain,
$false,
inference(avatar_sat_refutation,[],[s26]) ).
%------------------------------------------------------------------------------
%----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 SAT
% 0.11/0.35 % Computer : n020.cluster.edu
% 0.11/0.35 % Model : x86_64 x86_64
% 0.11/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.35 % Memory : 8046.5625MB
% 0.11/0.35 % OS : Linux 6.8.0-71-generic
% 0.11/0.35 % CPULimit : 300
% 0.11/0.35 % WCLimit : 300
% 0.11/0.35 % DateTime : Sun Sep 27 17:16:49 UTC 2026
% 0.11/0.35 % CPUTime :
% 0.11/0.35 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.14/0.38 Running first-order model finding
% 0.14/0.38 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.14/0.43 % (3626167)Will run a generic schedule for satisfiability detection.
% 0.14/0.43 % (3626178)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2643506492:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.14/0.43 % (3626178) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3626167-3626178"...
% 0.14/0.43 % (3626173)% WARNING: option uhcvi not known.
% 0.14/0.43 % (3626178)...printing done.
% 0.14/0.43 % (3626178)Refutation found. Thanks to Tanya!
% 0.14/0.43 % SZS status Theorem for theBenchmark
% 0.14/0.43 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.43 % (3626178)------------------------------
% 0.14/0.43 % (3626178)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.14/0.43 % (3626178)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.14/0.43 % (3626178)CaDiCaL version: 2.1.3
% 0.14/0.43 % (3626178)Termination reason: Refutation
% 0.14/0.43 % (3626178)Time elapsed: 0.003 s
% 0.14/0.43 % (3626178)Peak memory usage: 12 MB
% 0.14/0.43 % (3626178)Instructions burned: 6 (million)
% 0.14/0.43 % (3626167)Success in time 0.034 s
% 0.14/0.43 % Vampire exiting
%------------------------------------------------------------------------------