%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : MGT005-2 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n017.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 : Unsatisfiable 2.13s 1.17s
% Output : Refutation 2.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 38
% Syntax : Number of formulae : 133 ( 46 unt; 14 def)
% Number of atoms : 466 ( 18 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 662 ( 329 ~; 319 |; 0 &)
% ( 14 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 32 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 23 ( 21 usr; 15 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 13 con; 0-0 aty)
% Number of variables : 143 ( 0 sgn 143 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X2,X3,X0,X1] :
( organization(X0,X3)
| ~ organization(X0,X2)
| ~ greater(X3,X1)
| ~ greater(X2,X3)
| ~ organization(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp13_31) ).
fof(f7,axiom,
! [X2,X0,X1] :
( ~ reorganization(X0,X1,X2)
| greater(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp7_32) ).
fof(f10,axiom,
! [X2,X3,X0,X1,X8,X6,X7,X4,X5] :
( ~ complexity(X2,X8,X1)
| ~ organization(X2,X1)
| ~ organization(X2,X3)
| ~ class(X0,X4,X1)
| ~ class(X2,X4,X1)
| ~ reorganization(X0,X1,X5)
| ~ reorganization(X2,X1,X3)
| ~ reorganization_type(X0,X6,X1)
| ~ reorganization_type(X2,X6,X1)
| ~ complexity(X0,X7,X1)
| ~ organization(X0,X1)
| ~ greater(X8,X7)
| greater(X3,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a10_FOL_35) ).
fof(f11,axiom,
! [X2,X3,X10,X0,X11,X1,X8,X6,X9,X7,X4,X5] :
( ~ complexity(X2,X11,X1)
| ~ organization(X2,X1)
| ~ organization(X0,X3)
| ~ organization(X2,X3)
| ~ class(X0,X4,X1)
| ~ class(X2,X4,X1)
| ~ survival_chance(X0,X5,X1)
| ~ survival_chance(X2,X5,X1)
| ~ reorganization(X0,X1,X3)
| ~ reorganization(X2,X1,X6)
| ~ reorganization_type(X0,X7,X1)
| ~ reorganization_type(X2,X7,X1)
| ~ survival_chance(X0,X8,X3)
| ~ survival_chance(X2,X9,X3)
| ~ complexity(X0,X10,X1)
| ~ organization(X0,X1)
| ~ greater(X11,X10)
| greater(X8,X9)
| X8 = X9 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a11_FOL_36) ).
fof(f17,negated_conjecture,
organization(sk5,sk15),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_plus_FOL_42) ).
fof(f18,negated_conjecture,
organization(sk6,sk15),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_plus_FOL_43) ).
fof(f19,negated_conjecture,
organization(sk5,sk17),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_plus_FOL_44) ).
fof(f20,negated_conjecture,
organization(sk6,sk17),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_plus_FOL_45) ).
fof(f21,negated_conjecture,
class(sk5,sk8,sk15),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_plus_FOL_46) ).
fof(f22,negated_conjecture,
class(sk6,sk8,sk15),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_plus_FOL_47) ).
fof(f23,negated_conjecture,
survival_chance(sk5,sk9,sk15),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_plus_FOL_48) ).
fof(f24,negated_conjecture,
survival_chance(sk6,sk9,sk15),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_plus_FOL_49) ).
fof(f25,negated_conjecture,
reorganization(sk5,sk15,sk16),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_plus_FOL_50) ).
fof(f26,negated_conjecture,
reorganization(sk6,sk15,sk17),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_plus_FOL_51) ).
fof(f27,negated_conjecture,
reorganization_type(sk5,sk7,sk15),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_plus_FOL_52) ).
fof(f28,negated_conjecture,
reorganization_type(sk6,sk7,sk15),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_plus_FOL_53) ).
fof(f30,negated_conjecture,
survival_chance(sk5,sk10,sk14),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_plus_FOL_55) ).
fof(f31,negated_conjecture,
survival_chance(sk6,sk11,sk14),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_plus_FOL_56) ).
fof(f32,negated_conjecture,
complexity(sk5,sk12,sk15),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_plus_FOL_57) ).
fof(f33,negated_conjecture,
complexity(sk6,sk13,sk15),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_plus_FOL_58) ).
fof(f34,negated_conjecture,
greater(sk13,sk12),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_plus_FOL_59) ).
fof(f37,negated_conjecture,
sk14 = sk16,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_plus_FOL_61) ).
fof(f38,plain,
sk16 = sk14,
inference(reorient_equations,[],[f37]) ).
fof(f39,negated_conjecture,
~ greater(sk10,sk11),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_plus_FOL_62) ).
fof(f40,negated_conjecture,
sk10 != sk11,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_plus_FOL_63) ).
fof(f41,plain,
reorganization(sk5,sk15,sk14),
inference(definition_unfolding,[],[f25,f38]) ).
fof(f54,plain,
greater(sk14,sk15),
inference(resolution,[],[f7,f41]) ).
fof(f70,definition,
( spl0_5
<=> organization(sk5,sk14) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f71,plain,
( ~ organization(sk5,sk14)
| spl0_5 ),
inference(avatar_component_clause,[],[f70]) ).
fof(f93,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ organization(sk6,sk15)
| ~ organization(sk6,X0)
| ~ class(X1,X2,sk15)
| ~ class(sk6,X2,sk15)
| ~ reorganization(X1,sk15,X3)
| ~ reorganization(sk6,sk15,X0)
| ~ reorganization_type(X1,X4,sk15)
| ~ reorganization_type(sk6,X4,sk15)
| ~ complexity(X1,X5,sk15)
| ~ organization(X1,sk15)
| ~ greater(sk13,X5)
| greater(X0,X3) ),
inference(resolution,[],[f10,f33]) ).
fof(f96,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ complexity(X1,X5,sk15)
| ~ class(X1,X2,sk15)
| ~ class(sk6,X2,sk15)
| ~ reorganization(X1,sk15,X3)
| ~ reorganization(sk6,sk15,X0)
| ~ reorganization_type(X1,X4,sk15)
| ~ reorganization_type(sk6,X4,sk15)
| ~ organization(sk6,X0)
| ~ organization(X1,sk15)
| ~ greater(sk13,X5)
| greater(X0,X3) ),
inference(forward_subsumption_resolution,[],[f93,f18]) ).
fof(f103,plain,
! [X2,X3,X0,X1,X8,X6,X7,X4,X5] :
( ~ organization(sk6,sk15)
| ~ organization(X0,X1)
| ~ organization(sk6,X1)
| ~ class(X0,X2,sk15)
| ~ class(sk6,X2,sk15)
| ~ survival_chance(X0,X3,sk15)
| ~ survival_chance(sk6,X3,sk15)
| ~ reorganization(X0,sk15,X1)
| ~ reorganization(sk6,sk15,X4)
| ~ reorganization_type(X0,X5,sk15)
| ~ reorganization_type(sk6,X5,sk15)
| ~ survival_chance(X0,X6,X1)
| ~ survival_chance(sk6,X7,X1)
| ~ complexity(X0,X8,sk15)
| ~ organization(X0,sk15)
| ~ greater(sk13,X8)
| greater(X6,X7)
| X6 = X7 ),
inference(resolution,[],[f11,f33]) ).
fof(f106,plain,
! [X2,X3,X0,X1,X8,X6,X7,X4,X5] :
( ~ organization(X0,X1)
| ~ organization(sk6,X1)
| ~ class(X0,X2,sk15)
| ~ class(sk6,X2,sk15)
| ~ survival_chance(X0,X3,sk15)
| ~ survival_chance(sk6,X3,sk15)
| ~ reorganization(X0,sk15,X1)
| ~ reorganization(sk6,sk15,X4)
| ~ reorganization_type(X0,X5,sk15)
| ~ reorganization_type(sk6,X5,sk15)
| ~ survival_chance(X0,X6,X1)
| ~ survival_chance(sk6,X7,X1)
| ~ complexity(X0,X8,sk15)
| ~ organization(X0,sk15)
| ~ greater(sk13,X8)
| greater(X6,X7)
| X6 = X7 ),
inference(forward_subsumption_resolution,[],[f103,f18]) ).
fof(f109,definition,
( spl0_6
<=> ! [X4] : ~ reorganization(sk6,sk15,X4) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f110,plain,
( ! [X4] : ~ reorganization(sk6,sk15,X4)
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f109]) ).
fof(f112,definition,
( spl0_7
<=> ! [X5,X3,X2,X0,X8,X6,X1,X7] :
( ~ organization(X0,X1)
| X6 = X7
| greater(X6,X7)
| ~ greater(sk13,X8)
| ~ organization(X0,sk15)
| ~ complexity(X0,X8,sk15)
| ~ survival_chance(sk6,X7,X1)
| ~ survival_chance(X0,X6,X1)
| ~ reorganization_type(sk6,X5,sk15)
| ~ reorganization_type(X0,X5,sk15)
| ~ reorganization(X0,sk15,X1)
| ~ survival_chance(sk6,X3,sk15)
| ~ survival_chance(X0,X3,sk15)
| ~ class(sk6,X2,sk15)
| ~ class(X0,X2,sk15)
| ~ organization(sk6,X1) ) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f113,plain,
( ! [X2,X3,X0,X1,X8,X6,X7,X5] :
( ~ complexity(X0,X8,sk15)
| X6 = X7
| greater(X6,X7)
| ~ greater(sk13,X8)
| ~ organization(X0,sk15)
| ~ organization(X0,X1)
| ~ survival_chance(sk6,X7,X1)
| ~ survival_chance(X0,X6,X1)
| ~ reorganization_type(sk6,X5,sk15)
| ~ reorganization_type(X0,X5,sk15)
| ~ reorganization(X0,sk15,X1)
| ~ survival_chance(sk6,X3,sk15)
| ~ survival_chance(X0,X3,sk15)
| ~ class(sk6,X2,sk15)
| ~ class(X0,X2,sk15)
| ~ organization(sk6,X1) )
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f112]) ).
fof(f114,plain,
( spl0_6
| spl0_7 ),
inference(avatar_split_clause,[],[f106,f112,f109]) ).
fof(f122,plain,
( $false
| ~ spl0_6 ),
inference(resolution,[],[f110,f26]) ).
fof(f123,plain,
~ spl0_6,
inference(avatar_contradiction_clause,[],[f122]) ).
fof(f140,definition,
( spl0_11
<=> organization(sk6,sk14) ),
introduced(definition,[new_symbols(definition,[spl0_11])],[avatar_definition]) ).
fof(f141,plain,
( ~ organization(sk6,sk14)
| spl0_11 ),
inference(avatar_component_clause,[],[f140]) ).
fof(f148,definition,
( spl0_13
<=> ! [X1] :
( ~ greater(sk14,X1)
| ~ organization(sk6,X1) ) ),
introduced(definition,[new_symbols(definition,[spl0_13])],[avatar_definition]) ).
fof(f149,plain,
( ! [X1] :
( ~ organization(sk6,X1)
| ~ greater(sk14,X1) )
| ~ spl0_13 ),
inference(avatar_component_clause,[],[f148]) ).
fof(f151,definition,
( spl0_14
<=> ! [X0] :
( ~ organization(sk6,X0)
| ~ greater(X0,sk14) ) ),
introduced(definition,[new_symbols(definition,[spl0_14])],[avatar_definition]) ).
fof(f152,plain,
( ! [X0] :
( ~ organization(sk6,X0)
| ~ greater(X0,sk14) )
| ~ spl0_14 ),
inference(avatar_component_clause,[],[f151]) ).
fof(f167,definition,
( spl0_16
<=> ! [X1] :
( ~ greater(sk14,X1)
| ~ organization(sk5,X1) ) ),
introduced(definition,[new_symbols(definition,[spl0_16])],[avatar_definition]) ).
fof(f168,plain,
( ! [X1] :
( ~ organization(sk5,X1)
| ~ greater(sk14,X1) )
| ~ spl0_16 ),
inference(avatar_component_clause,[],[f167]) ).
fof(f170,definition,
( spl0_17
<=> ! [X0] :
( ~ organization(sk5,X0)
| ~ greater(X0,sk14) ) ),
introduced(definition,[new_symbols(definition,[spl0_17])],[avatar_definition]) ).
fof(f171,plain,
( ! [X0] :
( ~ organization(sk5,X0)
| ~ greater(X0,sk14) )
| ~ spl0_17 ),
inference(avatar_component_clause,[],[f170]) ).
fof(f173,plain,
! [X2,X3,X0,X1] :
( ~ class(sk5,X0,sk15)
| ~ class(sk6,X0,sk15)
| ~ reorganization(sk5,sk15,X1)
| ~ reorganization(sk6,sk15,X2)
| ~ reorganization_type(sk5,X3,sk15)
| ~ reorganization_type(sk6,X3,sk15)
| ~ organization(sk6,X2)
| ~ organization(sk5,sk15)
| ~ greater(sk13,sk12)
| greater(X2,X1) ),
inference(resolution,[],[f96,f32]) ).
fof(f176,plain,
! [X2,X3,X0,X1] :
( ~ class(sk5,X0,sk15)
| ~ class(sk6,X0,sk15)
| ~ reorganization(sk5,sk15,X1)
| ~ reorganization(sk6,sk15,X2)
| ~ reorganization_type(sk5,X3,sk15)
| ~ reorganization_type(sk6,X3,sk15)
| ~ organization(sk6,X2)
| ~ greater(sk13,sk12)
| greater(X2,X1) ),
inference(forward_subsumption_resolution,[],[f173,f17]) ).
fof(f177,plain,
! [X2,X3,X0,X1] :
( ~ class(sk5,X0,sk15)
| ~ class(sk6,X0,sk15)
| ~ reorganization(sk5,sk15,X1)
| ~ reorganization(sk6,sk15,X2)
| ~ reorganization_type(sk5,X3,sk15)
| ~ reorganization_type(sk6,X3,sk15)
| ~ organization(sk6,X2)
| greater(X2,X1) ),
inference(forward_subsumption_resolution,[],[f176,f34]) ).
fof(f179,definition,
( spl0_18
<=> ! [X3] :
( ~ reorganization_type(sk5,X3,sk15)
| ~ reorganization_type(sk6,X3,sk15) ) ),
introduced(definition,[new_symbols(definition,[spl0_18])],[avatar_definition]) ).
fof(f180,plain,
( ! [X3] :
( ~ reorganization_type(sk6,X3,sk15)
| ~ reorganization_type(sk5,X3,sk15) )
| ~ spl0_18 ),
inference(avatar_component_clause,[],[f179]) ).
fof(f182,definition,
( spl0_19
<=> ! [X2,X1] :
( ~ reorganization(sk5,sk15,X1)
| ~ reorganization(sk6,sk15,X2)
| greater(X2,X1)
| ~ organization(sk6,X2) ) ),
introduced(definition,[new_symbols(definition,[spl0_19])],[avatar_definition]) ).
fof(f183,plain,
( ! [X2,X1] :
( ~ reorganization(sk6,sk15,X2)
| ~ reorganization(sk5,sk15,X1)
| greater(X2,X1)
| ~ organization(sk6,X2) )
| ~ spl0_19 ),
inference(avatar_component_clause,[],[f182]) ).
fof(f185,definition,
( spl0_20
<=> ! [X0] :
( ~ class(sk5,X0,sk15)
| ~ class(sk6,X0,sk15) ) ),
introduced(definition,[new_symbols(definition,[spl0_20])],[avatar_definition]) ).
fof(f186,plain,
( ! [X0] :
( ~ class(sk6,X0,sk15)
| ~ class(sk5,X0,sk15) )
| ~ spl0_20 ),
inference(avatar_component_clause,[],[f185]) ).
fof(f187,plain,
( spl0_18
| spl0_19
| spl0_20 ),
inference(avatar_split_clause,[],[f177,f185,f182,f179]) ).
fof(f192,plain,
( ~ reorganization_type(sk5,sk7,sk15)
| ~ spl0_18 ),
inference(resolution,[],[f180,f28]) ).
fof(f193,plain,
( $false
| ~ spl0_18 ),
inference(forward_subsumption_resolution,[],[f192,f27]) ).
fof(f194,plain,
~ spl0_18,
inference(avatar_contradiction_clause,[],[f193]) ).
fof(f195,plain,
( ! [X2,X3,X0,X1,X4,X5] :
( X0 = X1
| greater(X0,X1)
| ~ greater(sk13,sk12)
| ~ organization(sk5,sk15)
| ~ organization(sk5,X2)
| ~ survival_chance(sk6,X1,X2)
| ~ survival_chance(sk5,X0,X2)
| ~ reorganization_type(sk6,X3,sk15)
| ~ reorganization_type(sk5,X3,sk15)
| ~ reorganization(sk5,sk15,X2)
| ~ survival_chance(sk6,X4,sk15)
| ~ survival_chance(sk5,X4,sk15)
| ~ class(sk6,X5,sk15)
| ~ class(sk5,X5,sk15)
| ~ organization(sk6,X2) )
| ~ spl0_7 ),
inference(resolution,[],[f113,f32]) ).
fof(f198,plain,
( ! [X2,X3,X0,X1,X4,X5] :
( X0 = X1
| greater(X0,X1)
| ~ organization(sk5,sk15)
| ~ organization(sk5,X2)
| ~ survival_chance(sk6,X1,X2)
| ~ survival_chance(sk5,X0,X2)
| ~ reorganization_type(sk6,X3,sk15)
| ~ reorganization_type(sk5,X3,sk15)
| ~ reorganization(sk5,sk15,X2)
| ~ survival_chance(sk6,X4,sk15)
| ~ survival_chance(sk5,X4,sk15)
| ~ class(sk6,X5,sk15)
| ~ class(sk5,X5,sk15)
| ~ organization(sk6,X2) )
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f195,f34]) ).
fof(f199,plain,
( ! [X2,X3,X0,X1,X4,X5] :
( X0 = X1
| greater(X0,X1)
| ~ organization(sk5,X2)
| ~ survival_chance(sk6,X1,X2)
| ~ survival_chance(sk5,X0,X2)
| ~ reorganization_type(sk6,X3,sk15)
| ~ reorganization_type(sk5,X3,sk15)
| ~ reorganization(sk5,sk15,X2)
| ~ survival_chance(sk6,X4,sk15)
| ~ survival_chance(sk5,X4,sk15)
| ~ class(sk6,X5,sk15)
| ~ class(sk5,X5,sk15)
| ~ organization(sk6,X2) )
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f198,f17]) ).
fof(f201,definition,
( spl0_21
<=> ! [X4] :
( ~ survival_chance(sk6,X4,sk15)
| ~ survival_chance(sk5,X4,sk15) ) ),
introduced(definition,[new_symbols(definition,[spl0_21])],[avatar_definition]) ).
fof(f202,plain,
( ! [X4] :
( ~ survival_chance(sk6,X4,sk15)
| ~ survival_chance(sk5,X4,sk15) )
| ~ spl0_21 ),
inference(avatar_component_clause,[],[f201]) ).
fof(f204,definition,
( spl0_22
<=> ! [X2,X0,X1] :
( X0 = X1
| ~ organization(sk6,X2)
| ~ reorganization(sk5,sk15,X2)
| ~ survival_chance(sk5,X0,X2)
| ~ survival_chance(sk6,X1,X2)
| ~ organization(sk5,X2)
| greater(X0,X1) ) ),
introduced(definition,[new_symbols(definition,[spl0_22])],[avatar_definition]) ).
fof(f205,plain,
( ! [X2,X0,X1] :
( ~ reorganization(sk5,sk15,X2)
| ~ organization(sk6,X2)
| X0 = X1
| ~ survival_chance(sk5,X0,X2)
| ~ survival_chance(sk6,X1,X2)
| ~ organization(sk5,X2)
| greater(X0,X1) )
| ~ spl0_22 ),
inference(avatar_component_clause,[],[f204]) ).
fof(f206,plain,
( spl0_20
| spl0_21
| spl0_18
| spl0_22
| ~ spl0_7 ),
inference(avatar_split_clause,[],[f199,f112,f204,f179,f201,f185]) ).
fof(f207,plain,
( ~ class(sk5,sk8,sk15)
| ~ spl0_20 ),
inference(resolution,[],[f186,f22]) ).
fof(f208,plain,
( $false
| ~ spl0_20 ),
inference(forward_subsumption_resolution,[],[f207,f21]) ).
fof(f209,plain,
~ spl0_20,
inference(avatar_contradiction_clause,[],[f208]) ).
fof(f213,plain,
( ~ survival_chance(sk5,sk9,sk15)
| ~ spl0_21 ),
inference(resolution,[],[f202,f24]) ).
fof(f214,plain,
( $false
| ~ spl0_21 ),
inference(forward_subsumption_resolution,[],[f213,f23]) ).
fof(f215,plain,
~ spl0_21,
inference(avatar_contradiction_clause,[],[f214]) ).
fof(f246,plain,
( ! [X0] :
( ~ reorganization(sk5,sk15,X0)
| greater(sk17,X0)
| ~ organization(sk6,sk17) )
| ~ spl0_19 ),
inference(resolution,[],[f183,f26]) ).
fof(f247,plain,
( ! [X0] :
( ~ reorganization(sk5,sk15,X0)
| greater(sk17,X0) )
| ~ spl0_19 ),
inference(forward_subsumption_resolution,[],[f246,f20]) ).
fof(f248,plain,
( greater(sk17,sk14)
| ~ spl0_19 ),
inference(resolution,[],[f247,f41]) ).
fof(f272,plain,
( ! [X0,X1] :
( ~ organization(sk6,sk14)
| X0 = X1
| ~ survival_chance(sk5,X0,sk14)
| ~ survival_chance(sk6,X1,sk14)
| ~ organization(sk5,sk14)
| greater(X0,X1) )
| ~ spl0_22 ),
inference(resolution,[],[f205,f41]) ).
fof(f274,definition,
( spl0_23
<=> ! [X0,X1] :
( X0 = X1
| greater(X0,X1)
| ~ survival_chance(sk6,X1,sk14)
| ~ survival_chance(sk5,X0,sk14) ) ),
introduced(definition,[new_symbols(definition,[spl0_23])],[avatar_definition]) ).
fof(f275,plain,
( ! [X0,X1] :
( ~ survival_chance(sk6,X1,sk14)
| greater(X0,X1)
| X0 = X1
| ~ survival_chance(sk5,X0,sk14) )
| ~ spl0_23 ),
inference(avatar_component_clause,[],[f274]) ).
fof(f276,plain,
( ~ spl0_5
| spl0_23
| ~ spl0_11
| ~ spl0_22 ),
inference(avatar_split_clause,[],[f272,f204,f140,f274,f70]) ).
fof(f277,plain,
( ! [X0,X1] :
( ~ organization(sk6,X0)
| ~ greater(sk14,X1)
| ~ greater(X0,sk14)
| ~ organization(sk6,X1) )
| spl0_11 ),
inference(resolution,[],[f141,f6]) ).
fof(f278,plain,
( spl0_13
| spl0_14
| spl0_11 ),
inference(avatar_split_clause,[],[f277,f140,f151,f148]) ).
fof(f291,plain,
( ~ greater(sk14,sk15)
| ~ spl0_13 ),
inference(resolution,[],[f149,f18]) ).
fof(f294,plain,
( $false
| ~ spl0_13 ),
inference(forward_subsumption_resolution,[],[f291,f54]) ).
fof(f295,plain,
~ spl0_13,
inference(avatar_contradiction_clause,[],[f294]) ).
fof(f299,plain,
( ~ greater(sk17,sk14)
| ~ spl0_14 ),
inference(resolution,[],[f152,f20]) ).
fof(f301,plain,
( $false
| ~ spl0_14
| ~ spl0_19 ),
inference(forward_subsumption_resolution,[],[f299,f248]) ).
fof(f302,plain,
( ~ spl0_14
| ~ spl0_19 ),
inference(avatar_contradiction_clause,[],[f301]) ).
fof(f303,plain,
( ! [X0,X1] :
( ~ organization(sk5,X0)
| ~ greater(sk14,X1)
| ~ greater(X0,sk14)
| ~ organization(sk5,X1) )
| spl0_5 ),
inference(resolution,[],[f71,f6]) ).
fof(f304,plain,
( spl0_16
| spl0_17
| spl0_5 ),
inference(avatar_split_clause,[],[f303,f70,f170,f167]) ).
fof(f305,plain,
( ~ greater(sk14,sk15)
| ~ spl0_16 ),
inference(resolution,[],[f168,f17]) ).
fof(f308,plain,
( $false
| ~ spl0_16 ),
inference(forward_subsumption_resolution,[],[f305,f54]) ).
fof(f309,plain,
~ spl0_16,
inference(avatar_contradiction_clause,[],[f308]) ).
fof(f311,plain,
( ~ greater(sk17,sk14)
| ~ spl0_17 ),
inference(resolution,[],[f171,f19]) ).
fof(f313,plain,
( $false
| ~ spl0_17
| ~ spl0_19 ),
inference(forward_subsumption_resolution,[],[f311,f248]) ).
fof(f314,plain,
( ~ spl0_17
| ~ spl0_19 ),
inference(avatar_contradiction_clause,[],[f313]) ).
fof(f352,plain,
( ! [X0] :
( ~ survival_chance(sk5,X0,sk14)
| sk11 = X0
| greater(X0,sk11) )
| ~ spl0_23 ),
inference(resolution,[],[f275,f31]) ).
fof(f371,plain,
( sk10 = sk11
| greater(sk10,sk11)
| ~ spl0_23 ),
inference(resolution,[],[f352,f30]) ).
fof(f372,plain,
( greater(sk10,sk11)
| ~ spl0_23 ),
inference(forward_subsumption_resolution,[],[f371,f40]) ).
fof(f373,plain,
( $false
| ~ spl0_23 ),
inference(forward_subsumption_resolution,[],[f372,f39]) ).
fof(f374,plain,
~ spl0_23,
inference(avatar_contradiction_clause,[],[f373]) ).
cnf(s3,plain,
( spl0_6
| spl0_7 ),
inference(sat_conversion,[],[f114]) ).
cnf(s5,plain,
~ spl0_6,
inference(sat_conversion,[],[f123]) ).
cnf(s11,plain,
( spl0_18
| spl0_19
| spl0_20 ),
inference(sat_conversion,[],[f187]) ).
cnf(s12,plain,
~ spl0_18,
inference(sat_conversion,[],[f194]) ).
cnf(s13,plain,
( ~ spl0_7
| spl0_18
| spl0_20
| spl0_21
| spl0_22 ),
inference(sat_conversion,[],[f206]) ).
cnf(s14,plain,
~ spl0_20,
inference(sat_conversion,[],[f209]) ).
cnf(s15,plain,
~ spl0_21,
inference(sat_conversion,[],[f215]) ).
cnf(s18,plain,
( ~ spl0_5
| ~ spl0_11
| ~ spl0_22
| spl0_23 ),
inference(sat_conversion,[],[f276]) ).
cnf(s19,plain,
( spl0_11
| spl0_13
| spl0_14 ),
inference(sat_conversion,[],[f278]) ).
cnf(s20,plain,
~ spl0_13,
inference(sat_conversion,[],[f295]) ).
cnf(s21,plain,
( ~ spl0_14
| ~ spl0_19 ),
inference(sat_conversion,[],[f302]) ).
cnf(s22,plain,
( spl0_5
| spl0_16
| spl0_17 ),
inference(sat_conversion,[],[f304]) ).
cnf(s23,plain,
~ spl0_16,
inference(sat_conversion,[],[f309]) ).
cnf(s24,plain,
( ~ spl0_17
| ~ spl0_19 ),
inference(sat_conversion,[],[f314]) ).
cnf(s25,plain,
~ spl0_23,
inference(sat_conversion,[],[f374]) ).
cnf(s26,plain,
( spl0_5
| spl0_17 ),
inference(rat,[],[s22,s23]) ).
cnf(s27,plain,
( spl0_11
| spl0_14 ),
inference(rat,[],[s19,s20]) ).
cnf(s28,plain,
( ~ spl0_5
| ~ spl0_11
| ~ spl0_22 ),
inference(rat,[],[s18,s25]) ).
cnf(s29,plain,
( ~ spl0_7
| spl0_18
| spl0_22 ),
inference(rat,[],[s13,s15,s14]) ).
cnf(s30,plain,
spl0_19,
inference(rat,[],[s11,s14,s12]) ).
cnf(s31,plain,
~ spl0_17,
inference(rat,[],[s24,s30]) ).
cnf(s32,plain,
~ spl0_14,
inference(rat,[],[s21,s30]) ).
cnf(s34,plain,
spl0_5,
inference(rat,[],[s26,s31]) ).
cnf(s35,plain,
spl0_11,
inference(rat,[],[s27,s32]) ).
cnf(s37,plain,
~ spl0_22,
inference(rat,[],[s28,s34,s35]) ).
cnf(s38,plain,
~ spl0_7,
inference(rat,[],[s29,s12,s37]) ).
cnf(s42,plain,
$false,
inference(rat,[],[s3,s38,s5]) ).
fof(f375,plain,
$false,
inference(avatar_sat_refutation,[],[s42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT005-2 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n017.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 27 17:11:05 UTC 2026
% 0.04/0.39 % CPUTime :
% 0.04/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.44 Running first-order theorem proving
% 0.04/0.44 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
% 2.13/1.17 % (2817073)Input is clausal, will run a generic CNF schedule.
% 2.13/1.17 % (2817122)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=1317953279:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.13/1.17 % (2817122)First to succeed.
% 2.13/1.17 % (2817122)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2817073"
% 2.13/1.17 % (2817121)lrs+10_1_sil=8000:sp=occurrence:random_seed=3999466950:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.13/1.17 % (2817118)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=4134602145:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.13/1.17 % (2817119)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=393318049:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.13/1.17 % (2817120)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=377634747:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.13/1.17 % (2817126)dis-21_1_sil=8000:lcm=predicate:random_seed=3139603788:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 2.13/1.17 % (2817121)Also succeeded, but the first one will report.
% 2.13/1.17 % (2817124)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1617334481:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.13/1.17 % (2817126)Instruction limit reached!
% 2.13/1.17 % (2817126)------------------------------
% 2.13/1.17 % (2817126)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.13/1.17 % (2817126)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.13/1.17 % (2817126)CaDiCaL version: 2.1.3
% 2.13/1.17 % (2817126)Termination reason: Instruction limit
% 2.13/1.17 % (2817126)Termination phase: Saturation
% 2.13/1.17 % (2817126)Time elapsed: 0.050 s
% 2.13/1.17 % (2817126)Peak memory usage: 88 MB
% 2.13/1.17 % (2817126)Instructions burned: 118 (million)
% 2.13/1.17 % (2817124)Instruction limit reached!
% 2.13/1.17 % (2817124)------------------------------
% 2.13/1.17 % (2817124)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.13/1.17 % (2817124)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.13/1.17 % (2817124)CaDiCaL version: 2.1.3
% 2.13/1.17 % (2817124)Termination reason: Instruction limit
% 2.13/1.17 % (2817124)Termination phase: Saturation
% 2.13/1.17 % (2817124)Time elapsed: 0.104 s
% 2.13/1.17 % (2817124)Peak memory usage: 89 MB
% 2.13/1.17 % (2817124)Instructions burned: 181 (million)
% 2.13/1.17 % (2817122)Refutation found. Thanks to Tanya!
% 2.13/1.17 % SZS status Unsatisfiable for theBenchmark
% 2.13/1.17 % SZS output start Proof for theBenchmark
% See solution above
% 2.49/1.27 % (2817122)------------------------------
% 2.49/1.27 % (2817122)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.49/1.27 % (2817122)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.49/1.27 % (2817122)CaDiCaL version: 2.1.3
% 2.49/1.27 % (2817122)Termination reason: Refutation
% 2.49/1.27 % (2817122)Time elapsed: 0.012 s
% 2.49/1.27 % (2817122)Peak memory usage: 90 MB
% 2.49/1.27 % (2817122)Instructions burned: 31 (million)
% 2.49/1.27 % (2817122)------------------------------
% 2.49/1.27 % (2817122)------------------------------
% 2.49/1.27 % (2817073)Success in time 0.274 s
% 2.49/1.27 % Vampire exiting
%------------------------------------------------------------------------------