%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : MGT008-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/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 : Unsatisfiable 0.10s 0.43s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 19
% Syntax : Number of formulae : 56 ( 22 unt; 4 def)
% Number of atoms : 171 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 239 ( 124 ~; 111 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 5 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 75 ( 0 sgn 75 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( inertia(X0,sk1(X1,X0),X1)
| ~ organization(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp5_1) ).
fof(f2,axiom,
! [X2,X3,X0,X1,X8,X6,X7,X4,X5] :
( ~ size(X2,X6,X3)
| ~ organization(X2,X3)
| ~ class(X0,X4,X1)
| ~ class(X2,X4,X3)
| ~ size(X0,X5,X1)
| ~ organization(X0,X1)
| ~ inertia(X0,X7,X1)
| ~ inertia(X2,X8,X3)
| ~ greater(X6,X5)
| greater(X8,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a5_FOL_2) ).
fof(f3,axiom,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( ~ survival_chance(X2,X7,X3)
| ~ organization(X2,X3)
| ~ reorganization_free(X0,X1,X1)
| ~ reorganization_free(X2,X3,X3)
| ~ inertia(X0,X4,X1)
| ~ inertia(X2,X5,X3)
| ~ survival_chance(X0,X6,X1)
| ~ organization(X0,X1)
| ~ greater(X5,X4)
| greater(X7,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_FOL_3) ).
fof(f4,negated_conjecture,
organization(sk2,sk9),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_FOL_4) ).
fof(f5,negated_conjecture,
organization(sk3,sk10),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_FOL_5) ).
fof(f6,negated_conjecture,
reorganization_free(sk2,sk9,sk9),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_FOL_6) ).
fof(f7,negated_conjecture,
reorganization_free(sk3,sk10,sk10),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_FOL_7) ).
fof(f8,negated_conjecture,
class(sk2,sk4,sk9),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_FOL_8) ).
fof(f9,negated_conjecture,
class(sk3,sk4,sk10),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_FOL_9) ).
fof(f10,negated_conjecture,
survival_chance(sk2,sk5,sk9),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_FOL_10) ).
fof(f11,negated_conjecture,
survival_chance(sk3,sk6,sk10),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_FOL_11) ).
fof(f12,negated_conjecture,
size(sk2,sk7,sk9),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_FOL_12) ).
fof(f13,negated_conjecture,
size(sk3,sk8,sk10),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_FOL_13) ).
fof(f14,negated_conjecture,
greater(sk8,sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_FOL_14) ).
fof(f15,negated_conjecture,
~ greater(sk6,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_FOL_15) ).
fof(f35,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ organization(sk3,sk10)
| ~ class(X0,X1,X2)
| ~ class(sk3,X1,sk10)
| ~ size(X0,X3,X2)
| ~ organization(X0,X2)
| ~ inertia(X0,X4,X2)
| ~ inertia(sk3,X5,sk10)
| ~ greater(sk8,X3)
| greater(X5,X4) ),
inference(resolution,[],[f2,f13]) ).
fof(f36,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ size(X0,X3,X2)
| ~ class(sk3,X1,sk10)
| ~ class(X0,X1,X2)
| ~ organization(X0,X2)
| ~ inertia(X0,X4,X2)
| ~ inertia(sk3,X5,sk10)
| ~ greater(sk8,X3)
| greater(X5,X4) ),
inference(forward_subsumption_resolution,[],[f35,f5]) ).
fof(f60,definition,
( spl0_8
<=> ! [X5] : ~ inertia(sk3,X5,sk10) ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f61,plain,
( ! [X5] : ~ inertia(sk3,X5,sk10)
| ~ spl0_8 ),
inference(avatar_component_clause,[],[f60]) ).
fof(f65,plain,
! [X2,X0,X1] :
( ~ class(sk3,X0,sk10)
| ~ class(sk2,X0,sk9)
| ~ organization(sk2,sk9)
| ~ inertia(sk2,X1,sk9)
| ~ inertia(sk3,X2,sk10)
| ~ greater(sk8,sk7)
| greater(X2,X1) ),
inference(resolution,[],[f36,f12]) ).
fof(f69,plain,
! [X2,X0,X1] :
( ~ class(sk3,X0,sk10)
| ~ class(sk2,X0,sk9)
| ~ inertia(sk2,X1,sk9)
| ~ inertia(sk3,X2,sk10)
| ~ greater(sk8,sk7)
| greater(X2,X1) ),
inference(forward_subsumption_resolution,[],[f65,f4]) ).
fof(f70,plain,
! [X2,X0,X1] :
( ~ class(sk3,X0,sk10)
| ~ class(sk2,X0,sk9)
| ~ inertia(sk2,X1,sk9)
| ~ inertia(sk3,X2,sk10)
| greater(X2,X1) ),
inference(forward_subsumption_resolution,[],[f69,f14]) ).
fof(f79,definition,
( spl0_11
<=> ! [X5] : ~ inertia(sk2,X5,sk9) ),
introduced(definition,[new_symbols(definition,[spl0_11])],[avatar_definition]) ).
fof(f80,plain,
( ! [X5] : ~ inertia(sk2,X5,sk9)
| ~ spl0_11 ),
inference(avatar_component_clause,[],[f79]) ).
fof(f97,plain,
! [X2,X3,X0,X1,X4] :
( ~ organization(sk3,sk10)
| ~ reorganization_free(X0,X1,X1)
| ~ reorganization_free(sk3,sk10,sk10)
| ~ inertia(X0,X2,X1)
| ~ inertia(sk3,X3,sk10)
| ~ survival_chance(X0,X4,X1)
| ~ organization(X0,X1)
| ~ greater(X3,X2)
| greater(sk6,X4) ),
inference(resolution,[],[f3,f11]) ).
fof(f109,plain,
( ~ organization(sk3,sk10)
| ~ spl0_8 ),
inference(resolution,[],[f1,f61]) ).
fof(f110,plain,
( ~ organization(sk2,sk9)
| ~ spl0_11 ),
inference(resolution,[],[f1,f80]) ).
fof(f111,plain,
( $false
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f110,f4]) ).
fof(f112,plain,
~ spl0_11,
inference(avatar_contradiction_clause,[],[f111]) ).
fof(f113,plain,
( $false
| ~ spl0_8 ),
inference(forward_subsumption_resolution,[],[f109,f5]) ).
fof(f114,plain,
~ spl0_8,
inference(avatar_contradiction_clause,[],[f113]) ).
fof(f116,plain,
! [X2,X3,X0,X1,X4] :
( ~ reorganization_free(X0,X1,X1)
| ~ reorganization_free(sk3,sk10,sk10)
| ~ inertia(X0,X2,X1)
| ~ inertia(sk3,X3,sk10)
| ~ survival_chance(X0,X4,X1)
| ~ organization(X0,X1)
| ~ greater(X3,X2)
| greater(sk6,X4) ),
inference(forward_subsumption_resolution,[],[f97,f5]) ).
fof(f118,plain,
! [X2,X3,X0,X1,X4] :
( ~ survival_chance(X0,X4,X1)
| ~ inertia(X0,X2,X1)
| ~ inertia(sk3,X3,sk10)
| ~ reorganization_free(X0,X1,X1)
| ~ organization(X0,X1)
| ~ greater(X3,X2)
| greater(sk6,X4) ),
inference(forward_subsumption_resolution,[],[f116,f7]) ).
fof(f137,definition,
( spl0_19
<=> ! [X2,X1] :
( ~ inertia(sk2,X1,sk9)
| ~ inertia(sk3,X2,sk10)
| greater(X2,X1) ) ),
introduced(definition,[new_symbols(definition,[spl0_19])],[avatar_definition]) ).
fof(f138,plain,
( ! [X2,X1] :
( ~ inertia(sk3,X2,sk10)
| ~ inertia(sk2,X1,sk9)
| greater(X2,X1) )
| ~ spl0_19 ),
inference(avatar_component_clause,[],[f137]) ).
fof(f140,definition,
( spl0_20
<=> ! [X0] :
( ~ class(sk3,X0,sk10)
| ~ class(sk2,X0,sk9) ) ),
introduced(definition,[new_symbols(definition,[spl0_20])],[avatar_definition]) ).
fof(f141,plain,
( ! [X0] :
( ~ class(sk3,X0,sk10)
| ~ class(sk2,X0,sk9) )
| ~ spl0_20 ),
inference(avatar_component_clause,[],[f140]) ).
fof(f142,plain,
( spl0_19
| spl0_20 ),
inference(avatar_split_clause,[],[f70,f140,f137]) ).
fof(f151,plain,
! [X0,X1] :
( ~ inertia(sk2,X0,sk9)
| ~ inertia(sk3,X1,sk10)
| ~ reorganization_free(sk2,sk9,sk9)
| ~ organization(sk2,sk9)
| ~ greater(X1,X0)
| greater(sk6,sk5) ),
inference(resolution,[],[f118,f10]) ).
fof(f154,plain,
( ! [X0,X1] :
( ~ inertia(sk2,X0,sk9)
| ~ inertia(sk3,X1,sk10)
| ~ reorganization_free(sk2,sk9,sk9)
| ~ organization(sk2,sk9)
| greater(sk6,sk5) )
| ~ spl0_19 ),
inference(forward_subsumption_resolution,[],[f151,f138]) ).
fof(f156,plain,
( ! [X0,X1] :
( ~ inertia(sk2,X0,sk9)
| ~ inertia(sk3,X1,sk10)
| ~ organization(sk2,sk9)
| greater(sk6,sk5) )
| ~ spl0_19 ),
inference(forward_subsumption_resolution,[],[f154,f6]) ).
fof(f157,plain,
( ! [X0,X1] :
( ~ inertia(sk2,X0,sk9)
| ~ inertia(sk3,X1,sk10)
| greater(sk6,sk5) )
| ~ spl0_19 ),
inference(forward_subsumption_resolution,[],[f156,f4]) ).
fof(f158,plain,
( ! [X0,X1] :
( ~ inertia(sk2,X0,sk9)
| ~ inertia(sk3,X1,sk10) )
| ~ spl0_19 ),
inference(forward_subsumption_resolution,[],[f157,f15]) ).
fof(f159,plain,
( spl0_8
| spl0_11
| ~ spl0_19 ),
inference(avatar_split_clause,[],[f158,f137,f79,f60]) ).
fof(f163,plain,
( ~ class(sk2,sk4,sk9)
| ~ spl0_20 ),
inference(resolution,[],[f141,f9]) ).
fof(f164,plain,
( $false
| ~ spl0_20 ),
inference(forward_subsumption_resolution,[],[f163,f8]) ).
fof(f165,plain,
~ spl0_20,
inference(avatar_contradiction_clause,[],[f164]) ).
cnf(s87,plain,
~ spl0_11,
inference(sat_conversion,[],[f112]) ).
cnf(s88,plain,
~ spl0_8,
inference(sat_conversion,[],[f114]) ).
cnf(s104,plain,
( spl0_19
| spl0_20 ),
inference(sat_conversion,[],[f142]) ).
cnf(s116,plain,
( spl0_8
| spl0_11
| ~ spl0_19 ),
inference(sat_conversion,[],[f159]) ).
cnf(s120,plain,
~ spl0_20,
inference(sat_conversion,[],[f165]) ).
cnf(s121,plain,
spl0_19,
inference(rat,[],[s104,s120]) ).
cnf(s122,plain,
spl0_11,
inference(rat,[],[s116,s121,s88]) ).
cnf(s123,plain,
$false,
inference(rat,[],[s87,s122]) ).
fof(f166,plain,
$false,
inference(avatar_sat_refutation,[],[s123]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT008-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37 % Computer : n003.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 27 17:17:41 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40 Running first-order model finding
% 0.10/0.40 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.43 % (804327)Will run a generic schedule for satisfiability detection.
% 0.10/0.43 % (804334)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1625763651:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.10/0.43 % (804334) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-804327-804334"...
% 0.10/0.43 % (804334)...printing done.
% 0.10/0.43 % (804334)Refutation found. Thanks to Tanya!
% 0.10/0.43 % SZS status Unsatisfiable for theBenchmark
% 0.10/0.43 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.43 % (804334)------------------------------
% 0.10/0.43 % (804334)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.43 % (804334)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.43 % (804334)CaDiCaL version: 2.1.3
% 0.10/0.43 % (804334)Termination reason: Refutation
% 0.10/0.43 % (804334)Time elapsed: 0.002 s
% 0.10/0.43 % (804334)Peak memory usage: 12 MB
% 0.10/0.43 % (804334)Instructions burned: 5 (million)
% 0.10/0.43 % (804327)Success in time 0.017 s
% 0.10/0.43 % Vampire exiting
%------------------------------------------------------------------------------