%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : MGT016+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 : n014.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:30 PM UTC 2026
% Result : Theorem 0.10s 0.46s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 9
% Syntax : Number of formulae : 74 ( 24 unt; 5 def)
% Number of atoms : 332 ( 0 equ)
% Maximal formula atoms : 13 ( 4 avg)
% Number of connectives : 449 ( 191 ~; 183 |; 65 &)
% ( 5 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 13 ( 12 usr; 6 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 179 ( 0 sgn 159 !; 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)
& 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/sandbox/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/sandbox/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/sandbox/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] : 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)
| ~ complexity(X0,X3,X7)
| ~ complexity(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)
| ~ complexity(X0,X3,X7)
| ~ complexity(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,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(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)
| ~ inertia(X0,X4,X6)
| ~ inertia(X1,X5,X6)
| ~ greater(X5,X4) ),
inference(flattening,[],[f9]) ).
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(ennf_transformation,[],[f5]) ).
fof(f12,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,[],[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] :
( ~ complexity(X1,X4,X8)
| ~ complexity(X0,X3,X7)
| ~ inertia(X0,X5,X7)
| ~ greater(X4,X3)
| ~ inertia(X1,X6,X8)
| ~ 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,X8,X6,X7,X4,X5] :
( ~ reorganization_type(X1,X2,X6)
| ~ reorganization_type(X0,X2,X6)
| ~ inertia(X0,X4,X6)
| ~ greater(X5,X4)
| ~ inertia(X1,X5,X6)
| ~ reorganization(X1,X6,X8)
| ~ reorganization(X0,X6,X7)
| ~ class(X1,X3,X6)
| ~ class(X0,X3,X6)
| organization(X1,X8)
| ~ organization(X1,X6)
| ~ organization(X0,X6)
| greater(X7,X8) ),
inference(cnf_transformation,[],[f10]) ).
fof(f16,plain,
greater(sK6,sK5),
inference(cnf_transformation,[],[f12]) ).
fof(f17,plain,
complexity(sK2,sK6,sK7),
inference(cnf_transformation,[],[f12]) ).
fof(f18,plain,
complexity(sK1,sK5,sK7),
inference(cnf_transformation,[],[f12]) ).
fof(f19,plain,
reorganization_type(sK2,sK3,sK7),
inference(cnf_transformation,[],[f12]) ).
fof(f20,plain,
reorganization_type(sK1,sK3,sK7),
inference(cnf_transformation,[],[f12]) ).
fof(f21,plain,
reorganization(sK2,sK7,sK9),
inference(cnf_transformation,[],[f12]) ).
fof(f22,plain,
reorganization(sK1,sK7,sK8),
inference(cnf_transformation,[],[f12]) ).
fof(f23,plain,
class(sK2,sK4,sK7),
inference(cnf_transformation,[],[f12]) ).
fof(f24,plain,
class(sK1,sK4,sK7),
inference(cnf_transformation,[],[f12]) ).
fof(f25,plain,
~ organization(sK2,sK9),
inference(cnf_transformation,[],[f12]) ).
fof(f26,plain,
organization(sK2,sK7),
inference(cnf_transformation,[],[f12]) ).
fof(f27,plain,
organization(sK1,sK7),
inference(cnf_transformation,[],[f12]) ).
fof(f28,plain,
~ greater(sK8,sK9),
inference(cnf_transformation,[],[f12]) ).
fof(f32,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ complexity(X0,X1,X2)
| ~ inertia(sK1,X3,sK7)
| ~ greater(X1,sK5)
| ~ inertia(X0,X4,X2)
| ~ class(X0,X5,X2)
| ~ class(sK1,X5,sK7)
| ~ organization(X0,X2)
| ~ organization(sK1,sK7)
| greater(X4,X3) ),
inference(resolution,[],[f14,f18]) ).
fof(f33,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ complexity(X0,X1,X2)
| ~ inertia(sK1,X3,sK7)
| ~ greater(X1,sK5)
| ~ inertia(X0,X4,X2)
| ~ class(X0,X5,X2)
| ~ class(sK1,X5,sK7)
| ~ organization(X0,X2)
| greater(X4,X3) ),
inference(forward_subsumption_resolution,[],[f32,f27]) ).
fof(f40,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ reorganization_type(X0,sK3,sK7)
| ~ inertia(sK1,X1,sK7)
| ~ greater(X2,X1)
| ~ inertia(X0,X2,sK7)
| ~ reorganization(X0,sK7,X3)
| ~ reorganization(sK1,sK7,X4)
| ~ class(X0,X5,sK7)
| ~ class(sK1,X5,sK7)
| organization(X0,X3)
| ~ organization(X0,sK7)
| ~ organization(sK1,sK7)
| greater(X4,X3) ),
inference(resolution,[],[f15,f20]) ).
fof(f41,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ reorganization_type(X0,sK3,sK7)
| ~ inertia(sK1,X1,sK7)
| ~ greater(X2,X1)
| ~ inertia(X0,X2,sK7)
| ~ reorganization(X0,sK7,X3)
| ~ reorganization(sK1,sK7,X4)
| ~ class(X0,X5,sK7)
| ~ class(sK1,X5,sK7)
| organization(X0,X3)
| ~ organization(X0,sK7)
| greater(X4,X3) ),
inference(forward_subsumption_resolution,[],[f40,f27]) ).
fof(f45,plain,
! [X2,X0,X1] :
( ~ inertia(sK1,X0,sK7)
| ~ greater(sK6,sK5)
| ~ inertia(sK2,X1,sK7)
| ~ class(sK2,X2,sK7)
| ~ class(sK1,X2,sK7)
| ~ organization(sK2,sK7)
| greater(X1,X0) ),
inference(resolution,[],[f33,f17]) ).
fof(f49,plain,
! [X2,X0,X1] :
( ~ inertia(sK1,X0,sK7)
| ~ inertia(sK2,X1,sK7)
| ~ class(sK2,X2,sK7)
| ~ class(sK1,X2,sK7)
| ~ organization(sK2,sK7)
| greater(X1,X0) ),
inference(forward_subsumption_resolution,[],[f45,f16]) ).
fof(f61,plain,
! [X2,X0,X1] :
( ~ inertia(sK1,X0,sK7)
| ~ inertia(sK2,X1,sK7)
| ~ class(sK2,X2,sK7)
| ~ class(sK1,X2,sK7)
| greater(X1,X0) ),
inference(forward_subsumption_resolution,[],[f49,f26]) ).
fof(f63,definition,
( spl10_4
<=> ! [X2] :
( ~ class(sK2,X2,sK7)
| ~ class(sK1,X2,sK7) ) ),
introduced(definition,[new_symbols(definition,[spl10_4])],[avatar_definition]) ).
fof(f64,plain,
( ! [X2] :
( ~ class(sK1,X2,sK7)
| ~ class(sK2,X2,sK7) )
| ~ spl10_4 ),
inference(avatar_component_clause,[],[f63]) ).
fof(f66,definition,
( spl10_5
<=> ! [X0,X1] :
( ~ inertia(sK1,X0,sK7)
| ~ inertia(sK2,X1,sK7)
| greater(X1,X0) ) ),
introduced(definition,[new_symbols(definition,[spl10_5])],[avatar_definition]) ).
fof(f67,plain,
( ! [X0,X1] :
( ~ inertia(sK1,X0,sK7)
| ~ inertia(sK2,X1,sK7)
| greater(X1,X0) )
| ~ spl10_5 ),
inference(avatar_component_clause,[],[f66]) ).
fof(f68,plain,
( spl10_4
| spl10_5 ),
inference(avatar_split_clause,[],[f61,f66,f63]) ).
fof(f90,plain,
( ~ class(sK2,sK4,sK7)
| ~ spl10_4 ),
inference(resolution,[],[f64,f24]) ).
fof(f91,plain,
( $false
| ~ spl10_4 ),
inference(forward_subsumption_resolution,[],[f90,f23]) ).
fof(f92,plain,
~ spl10_4,
inference(avatar_contradiction_clause,[],[f91]) ).
fof(f104,plain,
! [X2,X3,X0,X1,X4] :
( ~ inertia(sK1,X0,sK7)
| ~ greater(X1,X0)
| ~ inertia(sK2,X1,sK7)
| ~ reorganization(sK2,sK7,X2)
| ~ reorganization(sK1,sK7,X3)
| ~ class(sK2,X4,sK7)
| ~ class(sK1,X4,sK7)
| organization(sK2,X2)
| ~ organization(sK2,sK7)
| greater(X3,X2) ),
inference(resolution,[],[f41,f19]) ).
fof(f108,plain,
( ! [X2,X3,X0,X1,X4] :
( ~ inertia(sK1,X0,sK7)
| ~ inertia(sK2,X1,sK7)
| ~ reorganization(sK2,sK7,X2)
| ~ reorganization(sK1,sK7,X3)
| ~ class(sK2,X4,sK7)
| ~ class(sK1,X4,sK7)
| organization(sK2,X2)
| ~ organization(sK2,sK7)
| greater(X3,X2) )
| ~ spl10_5 ),
inference(forward_subsumption_resolution,[],[f104,f67]) ).
fof(f116,plain,
( ! [X2,X3,X0,X1,X4] :
( ~ inertia(sK1,X0,sK7)
| ~ inertia(sK2,X1,sK7)
| ~ reorganization(sK2,sK7,X2)
| ~ reorganization(sK1,sK7,X3)
| ~ class(sK2,X4,sK7)
| ~ class(sK1,X4,sK7)
| organization(sK2,X2)
| greater(X3,X2) )
| ~ spl10_5 ),
inference(forward_subsumption_resolution,[],[f108,f26]) ).
fof(f118,definition,
( spl10_13
<=> ! [X2,X3] :
( ~ reorganization(sK2,sK7,X2)
| organization(sK2,X2)
| ~ reorganization(sK1,sK7,X3)
| greater(X3,X2) ) ),
introduced(definition,[new_symbols(definition,[spl10_13])],[avatar_definition]) ).
fof(f119,plain,
( ! [X2,X3] :
( ~ reorganization(sK2,sK7,X2)
| ~ reorganization(sK1,sK7,X3)
| organization(sK2,X2)
| greater(X3,X2) )
| ~ spl10_13 ),
inference(avatar_component_clause,[],[f118]) ).
fof(f121,definition,
( spl10_14
<=> ! [X1] : ~ inertia(sK2,X1,sK7) ),
introduced(definition,[new_symbols(definition,[spl10_14])],[avatar_definition]) ).
fof(f122,plain,
( ! [X1] : ~ inertia(sK2,X1,sK7)
| ~ spl10_14 ),
inference(avatar_component_clause,[],[f121]) ).
fof(f124,definition,
( spl10_15
<=> ! [X0] : ~ inertia(sK1,X0,sK7) ),
introduced(definition,[new_symbols(definition,[spl10_15])],[avatar_definition]) ).
fof(f125,plain,
( ! [X0] : ~ inertia(sK1,X0,sK7)
| ~ spl10_15 ),
inference(avatar_component_clause,[],[f124]) ).
fof(f126,plain,
( spl10_4
| spl10_13
| spl10_14
| spl10_15
| ~ spl10_5 ),
inference(avatar_split_clause,[],[f116,f66,f124,f121,f118,f63]) ).
fof(f176,plain,
( ! [X0] :
( ~ reorganization(sK2,sK7,X0)
| organization(sK2,X0)
| greater(sK8,X0) )
| ~ spl10_13 ),
inference(resolution,[],[f119,f22]) ).
fof(f196,plain,
( organization(sK2,sK9)
| greater(sK8,sK9)
| ~ spl10_13 ),
inference(resolution,[],[f176,f21]) ).
fof(f197,plain,
( greater(sK8,sK9)
| ~ spl10_13 ),
inference(forward_subsumption_resolution,[],[f196,f25]) ).
fof(f198,plain,
( $false
| ~ spl10_13 ),
inference(forward_subsumption_resolution,[],[f197,f28]) ).
fof(f199,plain,
~ spl10_13,
inference(avatar_contradiction_clause,[],[f198]) ).
fof(f200,plain,
( ~ organization(sK2,sK7)
| ~ spl10_14 ),
inference(resolution,[],[f122,f13]) ).
fof(f201,plain,
( $false
| ~ spl10_14 ),
inference(forward_subsumption_resolution,[],[f200,f26]) ).
fof(f202,plain,
~ spl10_14,
inference(avatar_contradiction_clause,[],[f201]) ).
fof(f203,plain,
( ~ organization(sK1,sK7)
| ~ spl10_15 ),
inference(resolution,[],[f125,f13]) ).
fof(f204,plain,
( $false
| ~ spl10_15 ),
inference(forward_subsumption_resolution,[],[f203,f27]) ).
fof(f205,plain,
~ spl10_15,
inference(avatar_contradiction_clause,[],[f204]) ).
cnf(s2,plain,
( spl10_4
| spl10_5 ),
inference(sat_conversion,[],[f68]) ).
cnf(s4,plain,
~ spl10_4,
inference(sat_conversion,[],[f92]) ).
cnf(s8,plain,
( spl10_4
| ~ spl10_5
| spl10_13
| spl10_14
| spl10_15 ),
inference(sat_conversion,[],[f126]) ).
cnf(s14,plain,
~ spl10_13,
inference(sat_conversion,[],[f199]) ).
cnf(s15,plain,
~ spl10_14,
inference(sat_conversion,[],[f202]) ).
cnf(s16,plain,
~ spl10_15,
inference(sat_conversion,[],[f205]) ).
cnf(s17,plain,
( spl10_4
| ~ spl10_5 ),
inference(rat,[],[s8,s16,s15,s14]) ).
cnf(s19,plain,
~ spl10_5,
inference(rat,[],[s17,s4]) ).
cnf(s20,plain,
$false,
inference(rat,[],[s2,s19,s4]) ).
fof(f206,plain,
$false,
inference(avatar_sat_refutation,[],[s20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT016+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.10/0.39 % Computer : n014.cluster.edu
% 0.10/0.39 % Model : x86_64 x86_64
% 0.10/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.39 % Memory : 8046.5625MB
% 0.10/0.39 % OS : Linux 6.8.0-71-generic
% 0.10/0.39 % CPULimit : 300
% 0.10/0.39 % WCLimit : 300
% 0.10/0.39 % DateTime : Sun Sep 27 17:16:16 UTC 2026
% 0.10/0.39 % CPUTime :
% 0.10/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.42 Running first-order model finding
% 0.10/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.10/0.46 % (1035477)Will run a generic schedule for satisfiability detection.
% 0.10/0.46 % (1035486)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2246678412:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.46 % (1035483)% WARNING: option uhcvi not known.
% 0.10/0.46 % (1035486) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1035477-1035486"...
% 0.10/0.46 % (1035486)...printing done.
% 0.10/0.46 % (1035486)Refutation found. Thanks to Tanya!
% 0.10/0.46 % SZS status Theorem for theBenchmark
% 0.10/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.46 % (1035486)------------------------------
% 0.10/0.46 % (1035486)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.46 % (1035486)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.46 % (1035486)CaDiCaL version: 2.1.3
% 0.10/0.46 % (1035486)Termination reason: Refutation
% 0.10/0.46 % (1035486)Time elapsed: 0.004 s
% 0.10/0.46 % (1035486)Peak memory usage: 12 MB
% 0.10/0.46 % (1035486)Instructions burned: 8 (million)
% 0.10/0.46 % (1035477)Success in time 0.027 s
% 0.10/0.46 % Vampire exiting
%------------------------------------------------------------------------------