%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : MGT009-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n009.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:59 PM UTC 2026
% Result : Unsatisfiable 3.48s 1.44s
% Output : Refutation 3.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 18
% Syntax : Number of formulae : 50 ( 20 unt; 3 def)
% Number of atoms : 155 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 223 ( 118 ~; 102 |; 0 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 4 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 72 ( 0 sgn 72 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( inertia(X0,sk1(X1,X0),X1)
| ~ organization(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp5_1) ).
fof(f3,axiom,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( ~ reproducibility(X2,X5,X3)
| ~ organization(X2,X3)
| ~ reorganization_free(X0,X1,X1)
| ~ reorganization_free(X2,X3,X3)
| ~ reproducibility(X0,X4,X1)
| ~ organization(X0,X1)
| ~ inertia(X0,X6,X1)
| ~ inertia(X2,X7,X3)
| ~ greater(X7,X6)
| greater(X5,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a3_FOL_3) ).
fof(f4,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/sandbox/benchmark/theBenchmark.p',a5_FOL_4) ).
fof(f5,negated_conjecture,
organization(sk2,sk9),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t9_FOL_5) ).
fof(f6,negated_conjecture,
organization(sk3,sk10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t9_FOL_6) ).
fof(f7,negated_conjecture,
reorganization_free(sk2,sk9,sk9),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t9_FOL_7) ).
fof(f8,negated_conjecture,
reorganization_free(sk3,sk10,sk10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t9_FOL_8) ).
fof(f9,negated_conjecture,
class(sk2,sk4,sk9),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t9_FOL_9) ).
fof(f10,negated_conjecture,
class(sk3,sk4,sk10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t9_FOL_10) ).
fof(f11,negated_conjecture,
reproducibility(sk2,sk5,sk9),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t9_FOL_11) ).
fof(f12,negated_conjecture,
reproducibility(sk3,sk6,sk10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t9_FOL_12) ).
fof(f13,negated_conjecture,
size(sk2,sk7,sk9),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t9_FOL_13) ).
fof(f14,negated_conjecture,
size(sk3,sk8,sk10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t9_FOL_14) ).
fof(f15,negated_conjecture,
greater(sk8,sk7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t9_FOL_15) ).
fof(f16,negated_conjecture,
~ greater(sk6,sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t9_FOL_16) ).
fof(f36,plain,
! [X2,X3,X0,X1,X4] :
( ~ organization(sk3,sk10)
| ~ reorganization_free(X0,X1,X1)
| ~ reorganization_free(sk3,sk10,sk10)
| ~ reproducibility(X0,X2,X1)
| ~ organization(X0,X1)
| ~ inertia(X0,X3,X1)
| ~ inertia(sk3,X4,sk10)
| ~ greater(X4,X3)
| greater(sk6,X2) ),
inference(resolution,[],[f3,f12]) ).
fof(f37,plain,
! [X2,X3,X0,X1,X4] :
( ~ reorganization_free(X0,X1,X1)
| ~ reorganization_free(sk3,sk10,sk10)
| ~ reproducibility(X0,X2,X1)
| ~ organization(X0,X1)
| ~ inertia(X0,X3,X1)
| ~ inertia(sk3,X4,sk10)
| ~ greater(X4,X3)
| greater(sk6,X2) ),
inference(forward_subsumption_resolution,[],[f36,f6]) ).
fof(f39,plain,
! [X2,X3,X0,X1,X4] :
( ~ reproducibility(X0,X2,X1)
| ~ reorganization_free(X0,X1,X1)
| ~ organization(X0,X1)
| ~ inertia(X0,X3,X1)
| ~ inertia(sk3,X4,sk10)
| ~ greater(X4,X3)
| greater(sk6,X2) ),
inference(forward_subsumption_resolution,[],[f37,f8]) ).
fof(f42,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,[],[f4,f14]) ).
fof(f43,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,[],[f42,f6]) ).
fof(f67,plain,
! [X0,X1] :
( ~ reorganization_free(sk2,sk9,sk9)
| ~ organization(sk2,sk9)
| ~ inertia(sk2,X0,sk9)
| ~ inertia(sk3,X1,sk10)
| ~ greater(X1,X0)
| greater(sk6,sk5) ),
inference(resolution,[],[f39,f11]) ).
fof(f70,plain,
! [X0,X1] :
( ~ organization(sk2,sk9)
| ~ inertia(sk2,X0,sk9)
| ~ inertia(sk3,X1,sk10)
| ~ greater(X1,X0)
| greater(sk6,sk5) ),
inference(forward_subsumption_resolution,[],[f67,f7]) ).
fof(f72,plain,
! [X0,X1] :
( ~ inertia(sk2,X0,sk9)
| ~ inertia(sk3,X1,sk10)
| ~ greater(X1,X0)
| greater(sk6,sk5) ),
inference(forward_subsumption_resolution,[],[f70,f5]) ).
fof(f74,plain,
! [X0,X1] :
( ~ inertia(sk2,X0,sk9)
| ~ inertia(sk3,X1,sk10)
| ~ greater(X1,X0) ),
inference(forward_subsumption_resolution,[],[f72,f16]) ).
fof(f83,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,[],[f43,f13]) ).
fof(f87,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) ),
inference(forward_subsumption_resolution,[],[f83,f74]) ).
fof(f89,plain,
! [X2,X0,X1] :
( ~ class(sk3,X0,sk10)
| ~ class(sk2,X0,sk9)
| ~ inertia(sk2,X1,sk9)
| ~ inertia(sk3,X2,sk10)
| ~ greater(sk8,sk7) ),
inference(forward_subsumption_resolution,[],[f87,f5]) ).
fof(f95,definition,
( spl0_8
<=> ! [X2] : ~ inertia(sk3,X2,sk10) ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f96,plain,
( ! [X2] : ~ inertia(sk3,X2,sk10)
| ~ spl0_8 ),
inference(avatar_component_clause,[],[f95]) ).
fof(f101,plain,
! [X2,X0,X1] :
( ~ class(sk3,X0,sk10)
| ~ class(sk2,X0,sk9)
| ~ inertia(sk2,X1,sk9)
| ~ inertia(sk3,X2,sk10) ),
inference(forward_subsumption_resolution,[],[f89,f15]) ).
fof(f103,definition,
( spl0_10
<=> ! [X1] : ~ inertia(sk2,X1,sk9) ),
introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition]) ).
fof(f104,plain,
( ! [X1] : ~ inertia(sk2,X1,sk9)
| ~ spl0_10 ),
inference(avatar_component_clause,[],[f103]) ).
fof(f106,definition,
( spl0_11
<=> ! [X0] :
( ~ class(sk3,X0,sk10)
| ~ class(sk2,X0,sk9) ) ),
introduced(definition,[new_symbols(definition,[spl0_11])],[avatar_definition]) ).
fof(f107,plain,
( ! [X0] :
( ~ class(sk3,X0,sk10)
| ~ class(sk2,X0,sk9) )
| ~ spl0_11 ),
inference(avatar_component_clause,[],[f106]) ).
fof(f108,plain,
( spl0_8
| spl0_10
| spl0_11 ),
inference(avatar_split_clause,[],[f101,f106,f103,f95]) ).
fof(f109,plain,
( ~ organization(sk3,sk10)
| ~ spl0_8 ),
inference(resolution,[],[f96,f1]) ).
fof(f110,plain,
( $false
| ~ spl0_8 ),
inference(forward_subsumption_resolution,[],[f109,f6]) ).
fof(f111,plain,
~ spl0_8,
inference(avatar_contradiction_clause,[],[f110]) ).
fof(f117,plain,
( ~ organization(sk2,sk9)
| ~ spl0_10 ),
inference(resolution,[],[f104,f1]) ).
fof(f118,plain,
( $false
| ~ spl0_10 ),
inference(forward_subsumption_resolution,[],[f117,f5]) ).
fof(f119,plain,
~ spl0_10,
inference(avatar_contradiction_clause,[],[f118]) ).
fof(f129,plain,
( ~ class(sk2,sk4,sk9)
| ~ spl0_11 ),
inference(resolution,[],[f107,f10]) ).
fof(f130,plain,
( $false
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f129,f9]) ).
fof(f131,plain,
~ spl0_11,
inference(avatar_contradiction_clause,[],[f130]) ).
cnf(s6,plain,
( spl0_8
| spl0_10
| spl0_11 ),
inference(sat_conversion,[],[f108]) ).
cnf(s7,plain,
~ spl0_8,
inference(sat_conversion,[],[f111]) ).
cnf(s8,plain,
~ spl0_10,
inference(sat_conversion,[],[f119]) ).
cnf(s11,plain,
~ spl0_11,
inference(sat_conversion,[],[f131]) ).
cnf(s12,plain,
$false,
inference(rat,[],[s6,s11,s8,s7]) ).
fof(f132,plain,
$false,
inference(avatar_sat_refutation,[],[s12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT009-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n009.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 27 17:16:15 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.48/1.44 % (2265774)Input is clausal, will run a generic CNF schedule.
% 3.48/1.44 % (2265783)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=86474847:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.48/1.44 % (2265783)Refutation not found, incomplete strategy
% 3.48/1.44 % (2265783)------------------------------
% 3.48/1.44 % (2265783)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.48/1.44 % (2265783)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.48/1.44 % (2265783)CaDiCaL version: 2.1.3
% 3.48/1.44 % (2265783)Termination reason: Refutation not found, incomplete strategy
% 3.48/1.44 % (2265783)Time elapsed: 0.0000 s
% 3.48/1.44 % (2265783)Peak memory usage: 87 MB
% 3.48/1.44 % (2265779)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=3869982140:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.48/1.44 % (2265784)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1084898191:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.48/1.44 % (2265782)lrs+10_1_sil=8000:sp=occurrence:random_seed=3495425658:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.48/1.44 % (2265780)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2234705944:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.48/1.44 % (2265781)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=2389097811:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.48/1.44 % (2265782)First to succeed.
% 3.48/1.44 % (2265782)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2265774"
% 3.48/1.44 % (2265784)Also succeeded, but the first one will report.
% 3.48/1.44 % (2265785)dis-21_1_sil=8000:lcm=predicate:random_seed=2818197514: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)
% 3.48/1.44 % (2265785)Also succeeded, but the first one will report.
% 3.48/1.44 % (2265783)------------------------------
% 3.48/1.44 % (2265783)------------------------------
% 3.48/1.44 % (2265793)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=598606682:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 3.48/1.44 % (2265793)Also succeeded, but the first one will report.
% 3.48/1.44 % (2265782)Refutation found. Thanks to Tanya!
% 3.48/1.44 % SZS status Unsatisfiable for theBenchmark
% 3.48/1.44 % SZS output start Proof for theBenchmark
% See solution above
% 3.48/1.44 % (2265782)------------------------------
% 3.48/1.44 % (2265782)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.48/1.44 % (2265782)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.48/1.44 % (2265782)CaDiCaL version: 2.1.3
% 3.48/1.44 % (2265782)Termination reason: Refutation
% 3.48/1.44 % (2265782)Time elapsed: 0.004 s
% 3.48/1.44 % (2265782)Peak memory usage: 89 MB
% 3.48/1.44 % (2265782)Instructions burned: 4 (million)
% 3.48/1.44 % (2265782)------------------------------
% 3.48/1.44 % (2265782)------------------------------
% 3.48/1.44 % (2265774)Success in time 0.41 s
% 3.48/1.44 % Vampire exiting
%------------------------------------------------------------------------------