%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : MGT002-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:01:56 PM UTC 2026
% Result : Unsatisfiable 3.64s 1.53s
% Output : Refutation 3.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 14
% Syntax : Number of formulae : 42 ( 15 unt; 2 def)
% Number of atoms : 120 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 164 ( 86 ~; 76 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 3 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 58 ( 0 sgn 58 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( reproducibility(X0,sk1(X1,X0),X1)
| ~ organization(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp3_1) ).
fof(f2,axiom,
! [X2,X0,X1] :
( ~ reorganization_free(X0,X1,X2)
| reorganization_free(X0,X1,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp4_2) ).
fof(f3,axiom,
! [X2,X0,X1] :
( ~ reorganization_free(X0,X1,X2)
| reorganization_free(X0,X2,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp4_3) ).
fof(f4,axiom,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( ~ inertia(X2,X7,X3)
| ~ organization(X2,X3)
| ~ reorganization_free(X0,X1,X1)
| ~ reorganization_free(X2,X3,X3)
| ~ reproducibility(X0,X4,X1)
| ~ reproducibility(X2,X5,X3)
| ~ inertia(X0,X6,X1)
| ~ organization(X0,X1)
| ~ greater(X5,X4)
| greater(X7,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a3_FOL_4) ).
fof(f6,axiom,
! [X2,X3,X0,X1,X4] :
( ~ reorganization_free(X0,X1,X2)
| ~ organization(X0,X2)
| ~ organization(X0,X1)
| ~ reproducibility(X0,X3,X1)
| ~ reproducibility(X0,X4,X2)
| ~ greater(X2,X1)
| greater(X4,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a4_FOL_6) ).
fof(f7,negated_conjecture,
organization(sk2,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_FOL_7) ).
fof(f8,negated_conjecture,
organization(sk2,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_FOL_8) ).
fof(f9,negated_conjecture,
reorganization_free(sk2,sk5,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_FOL_9) ).
fof(f10,negated_conjecture,
inertia(sk2,sk3,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_FOL_10) ).
fof(f11,negated_conjecture,
inertia(sk2,sk4,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_FOL_11) ).
fof(f12,negated_conjecture,
greater(sk6,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_FOL_12) ).
fof(f13,negated_conjecture,
~ greater(sk4,sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_FOL_13) ).
fof(f14,plain,
reorganization_free(sk2,sk5,sk5),
inference(resolution,[],[f2,f9]) ).
fof(f16,plain,
reorganization_free(sk2,sk6,sk6),
inference(resolution,[],[f3,f9]) ).
fof(f20,plain,
! [X0,X1] :
( ~ organization(sk2,sk6)
| ~ organization(sk2,sk5)
| ~ reproducibility(sk2,X0,sk5)
| ~ reproducibility(sk2,X1,sk6)
| ~ greater(sk6,sk5)
| greater(X1,X0) ),
inference(resolution,[],[f6,f9]) ).
fof(f27,plain,
! [X0,X1] :
( ~ organization(sk2,sk5)
| ~ reproducibility(sk2,X0,sk5)
| ~ reproducibility(sk2,X1,sk6)
| ~ greater(sk6,sk5)
| greater(X1,X0) ),
inference(forward_subsumption_resolution,[],[f20,f8]) ).
fof(f44,plain,
! [X0,X1] :
( ~ reproducibility(sk2,X0,sk5)
| ~ reproducibility(sk2,X1,sk6)
| ~ greater(sk6,sk5)
| greater(X1,X0) ),
inference(forward_subsumption_resolution,[],[f27,f7]) ).
fof(f45,plain,
! [X0,X1] :
( ~ reproducibility(sk2,X1,sk6)
| ~ reproducibility(sk2,X0,sk5)
| greater(X1,X0) ),
inference(forward_subsumption_resolution,[],[f44,f12]) ).
fof(f47,plain,
! [X2,X3,X0,X1,X4] :
( ~ organization(sk2,sk6)
| ~ reorganization_free(X0,X1,X1)
| ~ reorganization_free(sk2,sk6,sk6)
| ~ reproducibility(X0,X2,X1)
| ~ reproducibility(sk2,X3,sk6)
| ~ inertia(X0,X4,X1)
| ~ organization(X0,X1)
| ~ greater(X3,X2)
| greater(sk4,X4) ),
inference(resolution,[],[f4,f11]) ).
fof(f48,plain,
! [X2,X3,X0,X1,X4] :
( ~ reorganization_free(X0,X1,X1)
| ~ reorganization_free(sk2,sk6,sk6)
| ~ reproducibility(X0,X2,X1)
| ~ reproducibility(sk2,X3,sk6)
| ~ inertia(X0,X4,X1)
| ~ organization(X0,X1)
| ~ greater(X3,X2)
| greater(sk4,X4) ),
inference(forward_subsumption_resolution,[],[f47,f8]) ).
fof(f50,plain,
! [X2,X3,X0,X1,X4] :
( ~ inertia(X0,X4,X1)
| ~ reproducibility(X0,X2,X1)
| ~ reproducibility(sk2,X3,sk6)
| ~ reorganization_free(X0,X1,X1)
| ~ organization(X0,X1)
| ~ greater(X3,X2)
| greater(sk4,X4) ),
inference(forward_subsumption_resolution,[],[f48,f16]) ).
fof(f60,plain,
! [X0,X1] :
( ~ reproducibility(sk2,X0,sk5)
| ~ reproducibility(sk2,X1,sk6)
| ~ reorganization_free(sk2,sk5,sk5)
| ~ organization(sk2,sk5)
| ~ greater(X1,X0)
| greater(sk4,sk3) ),
inference(resolution,[],[f50,f10]) ).
fof(f63,plain,
! [X0,X1] :
( ~ reproducibility(sk2,X0,sk5)
| ~ reproducibility(sk2,X1,sk6)
| ~ reorganization_free(sk2,sk5,sk5)
| ~ organization(sk2,sk5)
| greater(sk4,sk3) ),
inference(forward_subsumption_resolution,[],[f60,f45]) ).
fof(f65,plain,
! [X0,X1] :
( ~ reproducibility(sk2,X0,sk5)
| ~ reproducibility(sk2,X1,sk6)
| ~ organization(sk2,sk5)
| greater(sk4,sk3) ),
inference(forward_subsumption_resolution,[],[f63,f14]) ).
fof(f74,plain,
! [X0,X1] :
( ~ reproducibility(sk2,X0,sk5)
| ~ reproducibility(sk2,X1,sk6)
| greater(sk4,sk3) ),
inference(forward_subsumption_resolution,[],[f65,f7]) ).
fof(f75,plain,
! [X0,X1] :
( ~ reproducibility(sk2,X0,sk5)
| ~ reproducibility(sk2,X1,sk6) ),
inference(forward_subsumption_resolution,[],[f74,f13]) ).
fof(f77,definition,
( spl0_7
<=> ! [X1] : ~ reproducibility(sk2,X1,sk6) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f78,plain,
( ! [X1] : ~ reproducibility(sk2,X1,sk6)
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f77]) ).
fof(f80,definition,
( spl0_8
<=> ! [X0] : ~ reproducibility(sk2,X0,sk5) ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f81,plain,
( ! [X0] : ~ reproducibility(sk2,X0,sk5)
| ~ spl0_8 ),
inference(avatar_component_clause,[],[f80]) ).
fof(f82,plain,
( spl0_7
| spl0_8 ),
inference(avatar_split_clause,[],[f75,f80,f77]) ).
fof(f97,plain,
( ~ organization(sk2,sk6)
| ~ spl0_7 ),
inference(resolution,[],[f78,f1]) ).
fof(f98,plain,
( $false
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f97,f8]) ).
fof(f99,plain,
~ spl0_7,
inference(avatar_contradiction_clause,[],[f98]) ).
fof(f106,plain,
( ~ organization(sk2,sk5)
| ~ spl0_8 ),
inference(resolution,[],[f81,f1]) ).
fof(f107,plain,
( $false
| ~ spl0_8 ),
inference(forward_subsumption_resolution,[],[f106,f7]) ).
fof(f108,plain,
~ spl0_8,
inference(avatar_contradiction_clause,[],[f107]) ).
cnf(s4,plain,
( spl0_7
| spl0_8 ),
inference(sat_conversion,[],[f82]) ).
cnf(s6,plain,
~ spl0_7,
inference(sat_conversion,[],[f99]) ).
cnf(s8,plain,
~ spl0_8,
inference(sat_conversion,[],[f108]) ).
cnf(s9,plain,
$false,
inference(rat,[],[s4,s8,s6]) ).
fof(f109,plain,
$false,
inference(avatar_sat_refutation,[],[s9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT002-1 : 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.43 % Computer : n004.cluster.edu
% 0.11/0.43 % Model : x86_64 x86_64
% 0.11/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.43 % Memory : 8046.5625MB
% 0.11/0.43 % OS : Linux 6.8.0-71-generic
% 0.11/0.43 % CPULimit : 300
% 0.11/0.43 % WCLimit : 300
% 0.11/0.43 % DateTime : Sun Sep 27 17:15:22 UTC 2026
% 0.11/0.43 % CPUTime :
% 0.11/0.43 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.47 Running first-order theorem proving
% 0.17/0.47 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.64/1.53 % (3765971)Input is clausal, will run a generic CNF schedule.
% 3.64/1.53 % (3765977)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=177362206:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.64/1.53 % (3765982)dis-21_1_sil=8000:lcm=predicate:random_seed=227894012: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.64/1.53 % (3765981)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=584281886:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.64/1.53 % (3765976)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=1115781998:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.64/1.53 % (3765980)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=1844675827:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.64/1.53 % (3765978)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=2525999763:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.64/1.53 % (3765979)lrs+10_1_sil=8000:sp=occurrence:random_seed=253311735:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.64/1.53 % (3765980)Refutation not found, incomplete strategy
% 3.64/1.53 % (3765980)------------------------------
% 3.64/1.53 % (3765980)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.64/1.53 % (3765980)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.64/1.53 % (3765980)CaDiCaL version: 2.1.3
% 3.64/1.53 % (3765980)Termination reason: Refutation not found, incomplete strategy
% 3.64/1.53 % (3765980)Time elapsed: 0.001 s
% 3.64/1.53 % (3765980)Peak memory usage: 86 MB
% 3.64/1.53 % (3765979)First to succeed.
% 3.64/1.53 % (3765981)Also succeeded, but the first one will report.
% 3.64/1.53 % (3765979)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3765971"
% 3.64/1.53 % (3765982)Also succeeded, but the first one will report.
% 3.64/1.53 % (3765980)------------------------------
% 3.64/1.53 % (3765980)------------------------------
% 3.64/1.53 % (3765979)Refutation found. Thanks to Tanya!
% 3.64/1.53 % SZS status Unsatisfiable for theBenchmark
% 3.64/1.53 % SZS output start Proof for theBenchmark
% See solution above
% 3.64/1.53 % (3765979)------------------------------
% 3.64/1.53 % (3765979)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.64/1.53 % (3765979)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.64/1.53 % (3765979)CaDiCaL version: 2.1.3
% 3.64/1.53 % (3765979)Termination reason: Refutation
% 3.64/1.53 % (3765979)Time elapsed: 0.004 s
% 3.64/1.53 % (3765979)Peak memory usage: 89 MB
% 3.64/1.53 % (3765979)Instructions burned: 3 (million)
% 3.64/1.53 % (3765979)------------------------------
% 3.64/1.53 % (3765979)------------------------------
% 3.64/1.53 % (3765971)Success in time 0.422 s
% 3.64/1.53 % Vampire exiting
%------------------------------------------------------------------------------