%------------------------------------------------------------------------------
% File : Vampire---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 THM
% Computer : n001.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 0.15s 1.50s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 19
% Syntax : Number of formulae : 55 ( 21 unt; 4 def)
% Number of atoms : 170 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 240 ( 125 ~; 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(f17,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(f18,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,[],[f17,f5]) ).
fof(f20,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,[],[f18,f12]) ).
fof(f24,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,[],[f20,f4]) ).
fof(f36,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,[],[f24,f14]) ).
fof(f38,definition,
( spl0_4
<=> ! [X2,X1] :
( ~ inertia(sk2,X1,sk9)
| ~ inertia(sk3,X2,sk10)
| greater(X2,X1) ) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f39,plain,
( ! [X2,X1] :
( ~ inertia(sk2,X1,sk9)
| ~ inertia(sk3,X2,sk10)
| greater(X2,X1) )
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f38]) ).
fof(f41,definition,
( spl0_5
<=> ! [X0] :
( ~ class(sk3,X0,sk10)
| ~ class(sk2,X0,sk9) ) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f42,plain,
( ! [X0] :
( ~ class(sk3,X0,sk10)
| ~ class(sk2,X0,sk9) )
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f41]) ).
fof(f43,plain,
( spl0_4
| spl0_5 ),
inference(avatar_split_clause,[],[f36,f41,f38]) ).
fof(f45,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(f46,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,[],[f45,f5]) ).
fof(f48,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,[],[f46,f7]) ).
fof(f50,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,[],[f48,f10]) ).
fof(f53,plain,
( ! [X0,X1] :
( ~ inertia(sk2,X0,sk9)
| ~ inertia(sk3,X1,sk10)
| ~ reorganization_free(sk2,sk9,sk9)
| ~ organization(sk2,sk9)
| greater(sk6,sk5) )
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f50,f39]) ).
fof(f55,plain,
( ! [X0,X1] :
( ~ inertia(sk2,X0,sk9)
| ~ inertia(sk3,X1,sk10)
| ~ organization(sk2,sk9)
| greater(sk6,sk5) )
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f53,f6]) ).
fof(f64,plain,
( ! [X0,X1] :
( ~ inertia(sk2,X0,sk9)
| ~ inertia(sk3,X1,sk10)
| greater(sk6,sk5) )
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f55,f4]) ).
fof(f65,plain,
( ! [X0,X1] :
( ~ inertia(sk2,X0,sk9)
| ~ inertia(sk3,X1,sk10) )
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f64,f15]) ).
fof(f67,definition,
( spl0_8
<=> ! [X1] : ~ inertia(sk3,X1,sk10) ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f68,plain,
( ! [X1] : ~ inertia(sk3,X1,sk10)
| ~ spl0_8 ),
inference(avatar_component_clause,[],[f67]) ).
fof(f70,definition,
( spl0_9
<=> ! [X0] : ~ inertia(sk2,X0,sk9) ),
introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).
fof(f71,plain,
( ! [X0] : ~ inertia(sk2,X0,sk9)
| ~ spl0_9 ),
inference(avatar_component_clause,[],[f70]) ).
fof(f113,plain,
( ~ class(sk2,sk4,sk9)
| ~ spl0_5 ),
inference(resolution,[],[f42,f9]) ).
fof(f114,plain,
( $false
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[],[f113,f8]) ).
fof(f115,plain,
~ spl0_5,
inference(avatar_contradiction_clause,[],[f114]) ).
fof(f117,plain,
( spl0_8
| spl0_9
| ~ spl0_4 ),
inference(avatar_split_clause,[],[f65,f38,f70,f67]) ).
fof(f118,plain,
( ~ organization(sk3,sk10)
| ~ spl0_8 ),
inference(resolution,[],[f68,f1]) ).
fof(f119,plain,
( $false
| ~ spl0_8 ),
inference(forward_subsumption_resolution,[],[f118,f5]) ).
fof(f120,plain,
~ spl0_8,
inference(avatar_contradiction_clause,[],[f119]) ).
fof(f121,plain,
( ~ organization(sk2,sk9)
| ~ spl0_9 ),
inference(resolution,[],[f71,f1]) ).
fof(f122,plain,
( $false
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f121,f4]) ).
fof(f123,plain,
~ spl0_9,
inference(avatar_contradiction_clause,[],[f122]) ).
cnf(s2,plain,
( spl0_4
| spl0_5 ),
inference(sat_conversion,[],[f43]) ).
cnf(s8,plain,
~ spl0_5,
inference(sat_conversion,[],[f115]) ).
cnf(s9,plain,
( ~ spl0_4
| spl0_8
| spl0_9 ),
inference(sat_conversion,[],[f117]) ).
cnf(s10,plain,
~ spl0_8,
inference(sat_conversion,[],[f120]) ).
cnf(s11,plain,
~ spl0_9,
inference(sat_conversion,[],[f123]) ).
cnf(s12,plain,
~ spl0_4,
inference(rat,[],[s9,s11,s10]) ).
cnf(s13,plain,
$false,
inference(rat,[],[s2,s8,s12]) ).
fof(f124,plain,
$false,
inference(avatar_sat_refutation,[],[s13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT008-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n001.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sun Sep 27 17:21:46 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/0.40 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
% 0.15/1.50 % (3819704)Input is clausal, will run a generic CNF schedule.
% 0.15/1.50 % (3819713)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2752276738:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 0.15/1.50 % (3819713)Refutation not found, incomplete strategy
% 0.15/1.50 % (3819713)------------------------------
% 0.15/1.50 % (3819713)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.15/1.50 % (3819713)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/1.50 % (3819713)CaDiCaL version: 2.1.3
% 0.15/1.50 % (3819713)Termination reason: Refutation not found, incomplete strategy
% 0.15/1.50 % (3819713)Time elapsed: 0.0000 s
% 0.15/1.50 % (3819713)Peak memory usage: 87 MB
% 0.15/1.50 % (3819712)lrs+10_1_sil=8000:sp=occurrence:random_seed=1681841525:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 0.15/1.50 % (3819709)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=1941781804:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 0.15/1.50 % (3819710)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=403912180:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 0.15/1.50 % (3819711)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=3287114007:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 0.15/1.50 % (3819712)First to succeed.
% 0.15/1.50 % (3819712)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3819704"
% 0.15/1.50 % (3819714)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3158937970:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 0.15/1.50 % (3819715)dis-21_1_sil=8000:lcm=predicate:random_seed=2389666850: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)
% 0.15/1.50 % (3819714)Also succeeded, but the first one will report.
% 0.15/1.50 % (3819715)Also succeeded, but the first one will report.
% 0.15/1.50 % (3819713)------------------------------
% 0.15/1.50 % (3819713)------------------------------
% 0.15/1.50 % (3819723)dis+1010_3_sil=8000:plsq=on:drc=off:fde=none:plsqc=1:bsd=on:plsqr=7,2:sos=on:spb=goal_then_units:random_seed=210690106:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 0.15/1.50 % (3819723)Also succeeded, but the first one will report.
% 0.15/1.50 % (3819712)Refutation found. Thanks to Tanya!
% 0.15/1.50 % SZS status Unsatisfiable for theBenchmark
% 0.15/1.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/1.50 % (3819712)------------------------------
% 0.15/1.50 % (3819712)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.15/1.50 % (3819712)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/1.50 % (3819712)CaDiCaL version: 2.1.3
% 0.15/1.50 % (3819712)Termination reason: Refutation
% 0.15/1.50 % (3819712)Time elapsed: 0.004 s
% 0.15/1.50 % (3819712)Peak memory usage: 89 MB
% 0.15/1.50 % (3819712)Instructions burned: 3 (million)
% 0.15/1.50 % (3819712)------------------------------
% 0.15/1.50 % (3819712)------------------------------
% 0.15/1.50 % (3819704)Success in time 0.448 s
% 0.15/1.50 % Vampire exiting
%------------------------------------------------------------------------------