%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : MGT015-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 : n004.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:00 PM UTC 2026
% Result : Unsatisfiable 3.49s 1.45s
% Output : Refutation 3.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 21
% Syntax : Number of formulae : 61 ( 24 unt; 5 def)
% Number of atoms : 205 ( 0 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 294 ( 150 ~; 139 |; 0 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 5 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 : 84 ( 0 sgn 84 !; 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] :
( ~ complexity(X2,X6,X3)
| ~ organization(X2,X3)
| ~ class(X0,X4,X1)
| ~ class(X2,X4,X3)
| ~ complexity(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',a12_FOL_2) ).
fof(f3,axiom,
! [X2,X3,X0,X1,X8,X6,X7,X4,X5] :
( ~ reorganization_type(X2,X6,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)
| ~ organization(X0,X1)
| ~ inertia(X0,X7,X1)
| ~ inertia(X2,X8,X1)
| ~ greater(X8,X7)
| greater(X3,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a13_FOL_3) ).
fof(f4,negated_conjecture,
organization(sk2,sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t15_FOL_4) ).
fof(f5,negated_conjecture,
organization(sk3,sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t15_FOL_5) ).
fof(f6,negated_conjecture,
organization(sk3,sk10),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t15_FOL_6) ).
fof(f7,negated_conjecture,
class(sk2,sk5,sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t15_FOL_7) ).
fof(f8,negated_conjecture,
class(sk3,sk5,sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t15_FOL_8) ).
fof(f9,negated_conjecture,
reorganization(sk2,sk8,sk9),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t15_FOL_9) ).
fof(f10,negated_conjecture,
reorganization(sk3,sk8,sk10),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t15_FOL_10) ).
fof(f11,negated_conjecture,
reorganization_type(sk2,sk4,sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t15_FOL_11) ).
fof(f12,negated_conjecture,
reorganization_type(sk3,sk4,sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t15_FOL_12) ).
fof(f13,negated_conjecture,
complexity(sk2,sk6,sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t15_FOL_13) ).
fof(f14,negated_conjecture,
complexity(sk3,sk7,sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t15_FOL_14) ).
fof(f15,negated_conjecture,
greater(sk7,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t15_FOL_15) ).
fof(f16,negated_conjecture,
~ greater(sk10,sk9),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t15_FOL_16) ).
fof(f18,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ organization(sk3,sk8)
| ~ class(X0,X1,X2)
| ~ class(sk3,X1,sk8)
| ~ complexity(X0,X3,X2)
| ~ organization(X0,X2)
| ~ inertia(X0,X4,X2)
| ~ inertia(sk3,X5,sk8)
| ~ greater(sk7,X3)
| greater(X5,X4) ),
inference(resolution,[],[f2,f14]) ).
fof(f19,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ complexity(X0,X3,X2)
| ~ class(sk3,X1,sk8)
| ~ class(X0,X1,X2)
| ~ organization(X0,X2)
| ~ inertia(X0,X4,X2)
| ~ inertia(sk3,X5,sk8)
| ~ greater(sk7,X3)
| greater(X5,X4) ),
inference(forward_subsumption_resolution,[],[f18,f5]) ).
fof(f22,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ organization(sk3,sk8)
| ~ organization(sk3,X0)
| ~ class(X1,X2,sk8)
| ~ class(sk3,X2,sk8)
| ~ reorganization(X1,sk8,X3)
| ~ reorganization(sk3,sk8,X0)
| ~ reorganization_type(X1,sk4,sk8)
| ~ organization(X1,sk8)
| ~ inertia(X1,X4,sk8)
| ~ inertia(sk3,X5,sk8)
| ~ greater(X5,X4)
| greater(X0,X3) ),
inference(resolution,[],[f3,f12]) ).
fof(f23,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ reorganization_type(X1,sk4,sk8)
| ~ class(X1,X2,sk8)
| ~ class(sk3,X2,sk8)
| ~ reorganization(X1,sk8,X3)
| ~ reorganization(sk3,sk8,X0)
| ~ organization(sk3,X0)
| ~ organization(X1,sk8)
| ~ inertia(X1,X4,sk8)
| ~ inertia(sk3,X5,sk8)
| ~ greater(X5,X4)
| greater(X0,X3) ),
inference(forward_subsumption_resolution,[],[f22,f5]) ).
fof(f25,plain,
! [X2,X0,X1] :
( ~ class(sk3,X0,sk8)
| ~ class(sk2,X0,sk8)
| ~ organization(sk2,sk8)
| ~ inertia(sk2,X1,sk8)
| ~ inertia(sk3,X2,sk8)
| ~ greater(sk7,sk6)
| greater(X2,X1) ),
inference(resolution,[],[f19,f13]) ).
fof(f29,plain,
! [X2,X0,X1] :
( ~ class(sk3,X0,sk8)
| ~ class(sk2,X0,sk8)
| ~ inertia(sk2,X1,sk8)
| ~ inertia(sk3,X2,sk8)
| ~ greater(sk7,sk6)
| greater(X2,X1) ),
inference(forward_subsumption_resolution,[],[f25,f4]) ).
fof(f41,plain,
! [X2,X0,X1] :
( ~ class(sk3,X0,sk8)
| ~ class(sk2,X0,sk8)
| ~ inertia(sk2,X1,sk8)
| ~ inertia(sk3,X2,sk8)
| greater(X2,X1) ),
inference(forward_subsumption_resolution,[],[f29,f15]) ).
fof(f43,definition,
( spl0_4
<=> ! [X2,X1] :
( ~ inertia(sk2,X1,sk8)
| ~ inertia(sk3,X2,sk8)
| greater(X2,X1) ) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f44,plain,
( ! [X2,X1] :
( ~ inertia(sk3,X2,sk8)
| ~ inertia(sk2,X1,sk8)
| greater(X2,X1) )
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f43]) ).
fof(f46,definition,
( spl0_5
<=> ! [X0] :
( ~ class(sk3,X0,sk8)
| ~ class(sk2,X0,sk8) ) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f47,plain,
( ! [X0] :
( ~ class(sk3,X0,sk8)
| ~ class(sk2,X0,sk8) )
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f46]) ).
fof(f48,plain,
( spl0_4
| spl0_5 ),
inference(avatar_split_clause,[],[f41,f46,f43]) ).
fof(f73,plain,
! [X2,X3,X0,X1,X4] :
( ~ class(sk2,X0,sk8)
| ~ class(sk3,X0,sk8)
| ~ reorganization(sk2,sk8,X1)
| ~ reorganization(sk3,sk8,X2)
| ~ organization(sk3,X2)
| ~ organization(sk2,sk8)
| ~ inertia(sk2,X3,sk8)
| ~ inertia(sk3,X4,sk8)
| ~ greater(X4,X3)
| greater(X2,X1) ),
inference(resolution,[],[f23,f11]) ).
fof(f77,plain,
( ! [X2,X3,X0,X1,X4] :
( ~ class(sk2,X0,sk8)
| ~ class(sk3,X0,sk8)
| ~ reorganization(sk2,sk8,X1)
| ~ reorganization(sk3,sk8,X2)
| ~ organization(sk3,X2)
| ~ organization(sk2,sk8)
| ~ inertia(sk2,X3,sk8)
| ~ inertia(sk3,X4,sk8)
| greater(X2,X1) )
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f73,f44]) ).
fof(f85,plain,
( ! [X2,X3,X0,X1,X4] :
( ~ class(sk2,X0,sk8)
| ~ class(sk3,X0,sk8)
| ~ reorganization(sk2,sk8,X1)
| ~ reorganization(sk3,sk8,X2)
| ~ organization(sk3,X2)
| ~ inertia(sk2,X3,sk8)
| ~ inertia(sk3,X4,sk8)
| greater(X2,X1) )
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f77,f4]) ).
fof(f87,definition,
( spl0_13
<=> ! [X4] : ~ inertia(sk3,X4,sk8) ),
introduced(definition,[new_symbols(definition,[spl0_13])],[avatar_definition]) ).
fof(f88,plain,
( ! [X4] : ~ inertia(sk3,X4,sk8)
| ~ spl0_13 ),
inference(avatar_component_clause,[],[f87]) ).
fof(f90,definition,
( spl0_14
<=> ! [X3] : ~ inertia(sk2,X3,sk8) ),
introduced(definition,[new_symbols(definition,[spl0_14])],[avatar_definition]) ).
fof(f91,plain,
( ! [X3] : ~ inertia(sk2,X3,sk8)
| ~ spl0_14 ),
inference(avatar_component_clause,[],[f90]) ).
fof(f93,definition,
( spl0_15
<=> ! [X2,X1] :
( ~ reorganization(sk2,sk8,X1)
| ~ reorganization(sk3,sk8,X2)
| greater(X2,X1)
| ~ organization(sk3,X2) ) ),
introduced(definition,[new_symbols(definition,[spl0_15])],[avatar_definition]) ).
fof(f94,plain,
( ! [X2,X1] :
( ~ reorganization(sk3,sk8,X2)
| ~ reorganization(sk2,sk8,X1)
| greater(X2,X1)
| ~ organization(sk3,X2) )
| ~ spl0_15 ),
inference(avatar_component_clause,[],[f93]) ).
fof(f95,plain,
( spl0_13
| spl0_14
| spl0_15
| spl0_5
| ~ spl0_4 ),
inference(avatar_split_clause,[],[f85,f43,f46,f93,f90,f87]) ).
fof(f107,plain,
( ~ class(sk2,sk5,sk8)
| ~ spl0_5 ),
inference(resolution,[],[f47,f8]) ).
fof(f108,plain,
( $false
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[],[f107,f7]) ).
fof(f109,plain,
~ spl0_5,
inference(avatar_contradiction_clause,[],[f108]) ).
fof(f125,plain,
( ! [X0] :
( ~ reorganization(sk2,sk8,X0)
| greater(sk10,X0)
| ~ organization(sk3,sk10) )
| ~ spl0_15 ),
inference(resolution,[],[f94,f10]) ).
fof(f126,plain,
( ! [X0] :
( ~ reorganization(sk2,sk8,X0)
| greater(sk10,X0) )
| ~ spl0_15 ),
inference(forward_subsumption_resolution,[],[f125,f6]) ).
fof(f127,plain,
( greater(sk10,sk9)
| ~ spl0_15 ),
inference(resolution,[],[f126,f9]) ).
fof(f128,plain,
( $false
| ~ spl0_15 ),
inference(forward_subsumption_resolution,[],[f127,f16]) ).
fof(f129,plain,
~ spl0_15,
inference(avatar_contradiction_clause,[],[f128]) ).
fof(f130,plain,
( ~ organization(sk2,sk8)
| ~ spl0_14 ),
inference(resolution,[],[f91,f1]) ).
fof(f131,plain,
( $false
| ~ spl0_14 ),
inference(forward_subsumption_resolution,[],[f130,f4]) ).
fof(f132,plain,
~ spl0_14,
inference(avatar_contradiction_clause,[],[f131]) ).
fof(f133,plain,
( ~ organization(sk3,sk8)
| ~ spl0_13 ),
inference(resolution,[],[f88,f1]) ).
fof(f134,plain,
( $false
| ~ spl0_13 ),
inference(forward_subsumption_resolution,[],[f133,f5]) ).
fof(f135,plain,
~ spl0_13,
inference(avatar_contradiction_clause,[],[f134]) ).
cnf(s2,plain,
( spl0_4
| spl0_5 ),
inference(sat_conversion,[],[f48]) ).
cnf(s6,plain,
( ~ spl0_4
| spl0_5
| spl0_13
| spl0_14
| spl0_15 ),
inference(sat_conversion,[],[f95]) ).
cnf(s8,plain,
~ spl0_5,
inference(sat_conversion,[],[f109]) ).
cnf(s10,plain,
~ spl0_15,
inference(sat_conversion,[],[f129]) ).
cnf(s11,plain,
~ spl0_14,
inference(sat_conversion,[],[f132]) ).
cnf(s12,plain,
~ spl0_13,
inference(sat_conversion,[],[f135]) ).
cnf(s13,plain,
~ spl0_4,
inference(rat,[],[s6,s10,s11,s12,s8]) ).
cnf(s15,plain,
$false,
inference(rat,[],[s2,s8,s13]) ).
fof(f136,plain,
$false,
inference(avatar_sat_refutation,[],[s15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT015-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.10/0.38 % Computer : n004.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sun Sep 27 17:16:22 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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
% 3.49/1.45 % (3767629)Input is clausal, will run a generic CNF schedule.
% 3.49/1.45 % (3767635)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=187172846:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.49/1.45 % (3767638)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2104984769:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.49/1.45 % (3767638)Refutation not found, incomplete strategy
% 3.49/1.45 % (3767638)------------------------------
% 3.49/1.45 % (3767638)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.49/1.45 % (3767638)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.49/1.45 % (3767638)CaDiCaL version: 2.1.3
% 3.49/1.45 % (3767638)Termination reason: Refutation not found, incomplete strategy
% 3.49/1.45 % (3767638)Time elapsed: 0.001 s
% 3.49/1.45 % (3767638)Peak memory usage: 87 MB
% 3.49/1.45 % (3767636)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1488556696:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.49/1.45 % (3767634)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=1331259684:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.49/1.45 % (3767637)lrs+10_1_sil=8000:sp=occurrence:random_seed=3316758373:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.49/1.45 % (3767637)First to succeed.
% 3.49/1.45 % (3767637)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3767629"
% 3.49/1.45 % (3767640)dis-21_1_sil=8000:lcm=predicate:random_seed=4214735890: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.49/1.45 % (3767640)Also succeeded, but the first one will report.
% 3.49/1.45 % (3767639)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1884234249:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.49/1.45 % (3767639)Also succeeded, but the first one will report.
% 3.49/1.45 % (3767638)------------------------------
% 3.49/1.45 % (3767638)------------------------------
% 3.49/1.45 % (3767637)Refutation found. Thanks to Tanya!
% 3.49/1.45 % SZS status Unsatisfiable for theBenchmark
% 3.49/1.45 % SZS output start Proof for theBenchmark
% See solution above
% 3.49/1.45 % (3767637)------------------------------
% 3.49/1.45 % (3767637)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.49/1.45 % (3767637)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.49/1.45 % (3767637)CaDiCaL version: 2.1.3
% 3.49/1.45 % (3767637)Termination reason: Refutation
% 3.49/1.45 % (3767637)Time elapsed: 0.004 s
% 3.49/1.45 % (3767637)Peak memory usage: 89 MB
% 3.49/1.45 % (3767637)Instructions burned: 4 (million)
% 3.49/1.45 % (3767637)------------------------------
% 3.49/1.45 % (3767637)------------------------------
% 3.49/1.45 % (3767629)Success in time 0.408 s
% 3.49/1.45 % Vampire exiting
%------------------------------------------------------------------------------