%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : MGT003-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 : n017.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:57 PM UTC 2026
% Result : Unsatisfiable 2.63s 1.36s
% Output : Refutation 2.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 16
% Syntax : Number of formulae : 55 ( 16 unt; 4 def)
% Number of atoms : 177 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 263 ( 141 ~; 118 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 5 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 61 ( 0 sgn 61 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] :
( reorganization_free(X0,X1,X1)
| ~ reorganization_free(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp4_1) ).
fof(f2,axiom,
! [X2,X0,X1] :
( reorganization_free(X0,X2,X2)
| ~ reorganization_free(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp4_2) ).
fof(f3,axiom,
! [X0,X1] :
( inertia(X0,sk1(X1,X0),X1)
| ~ organization(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp5_3) ).
fof(f4,axiom,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( greater(X7,X6)
| ~ 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)
| ~ survival_chance(X2,X7,X3)
| ~ greater(X5,X4)
| ~ organization(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_FOL_4) ).
fof(f5,axiom,
! [X2,X3,X0,X1,X4] :
( greater(X4,X3)
| ~ organization(X0,X2)
| ~ reorganization_free(X0,X1,X2)
| ~ inertia(X0,X3,X1)
| ~ inertia(X0,X4,X2)
| ~ greater(X2,X1)
| ~ organization(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_FOL_5) ).
fof(f6,negated_conjecture,
organization(sk2,sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_FOL_6) ).
fof(f7,negated_conjecture,
organization(sk2,sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_FOL_7) ).
fof(f8,negated_conjecture,
reorganization_free(sk2,sk5,sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_FOL_8) ).
fof(f9,negated_conjecture,
survival_chance(sk2,sk3,sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_FOL_9) ).
fof(f10,negated_conjecture,
survival_chance(sk2,sk4,sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_FOL_10) ).
fof(f11,negated_conjecture,
greater(sk6,sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_FOL_11) ).
fof(f12,negated_conjecture,
~ greater(sk4,sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_FOL_12) ).
fof(f14,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ survival_chance(X2,sk3,X3)
| ~ reorganization_free(X2,X3,X3)
| ~ reorganization_free(X0,X1,X1)
| ~ inertia(X2,X4,X3)
| ~ inertia(X0,X5,X1)
| ~ organization(X0,X1)
| ~ survival_chance(X0,sk4,X1)
| ~ greater(X5,X4)
| ~ organization(X2,X3) ),
inference(resolution,[],[f4,f12]) ).
fof(f15,plain,
! [X2,X3,X0,X1] :
( ~ reorganization_free(sk2,sk5,sk5)
| ~ reorganization_free(X0,X1,X1)
| ~ inertia(sk2,X2,sk5)
| ~ inertia(X0,X3,X1)
| ~ organization(X0,X1)
| ~ survival_chance(X0,sk4,X1)
| ~ greater(X3,X2)
| ~ organization(sk2,sk5) ),
inference(resolution,[],[f14,f9]) ).
fof(f16,plain,
! [X2,X3,X0,X1] :
( ~ reorganization_free(sk2,sk5,sk5)
| ~ reorganization_free(X0,X1,X1)
| ~ inertia(sk2,X2,sk5)
| ~ inertia(X0,X3,X1)
| ~ organization(X0,X1)
| ~ survival_chance(X0,sk4,X1)
| ~ greater(X3,X2) ),
inference(forward_subsumption_resolution,[],[f15,f6]) ).
fof(f18,definition,
( spl0_1
<=> ! [X0,X3,X2,X1] :
( ~ reorganization_free(X0,X1,X1)
| ~ greater(X3,X2)
| ~ survival_chance(X0,sk4,X1)
| ~ organization(X0,X1)
| ~ inertia(X0,X3,X1)
| ~ inertia(sk2,X2,sk5) ) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f19,plain,
( ! [X2,X3,X0,X1] :
( ~ inertia(sk2,X2,sk5)
| ~ greater(X3,X2)
| ~ survival_chance(X0,sk4,X1)
| ~ organization(X0,X1)
| ~ inertia(X0,X3,X1)
| ~ reorganization_free(X0,X1,X1) )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f18]) ).
fof(f21,definition,
( spl0_2
<=> reorganization_free(sk2,sk5,sk5) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f23,plain,
( ~ reorganization_free(sk2,sk5,sk5)
| spl0_2 ),
inference(avatar_component_clause,[],[f21]) ).
fof(f24,plain,
( spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f16,f21,f18]) ).
fof(f26,plain,
( ! [X0] : ~ reorganization_free(sk2,sk5,X0)
| spl0_2 ),
inference(resolution,[],[f23,f1]) ).
fof(f29,plain,
( $false
| spl0_2 ),
inference(resolution,[],[f26,f8]) ).
fof(f32,plain,
spl0_2,
inference(avatar_contradiction_clause,[],[f29]) ).
fof(f33,plain,
( ! [X2,X0,X1] :
( ~ greater(X0,sk1(sk5,sk2))
| ~ survival_chance(X1,sk4,X2)
| ~ organization(X1,X2)
| ~ inertia(X1,X0,X2)
| ~ reorganization_free(X1,X2,X2)
| ~ organization(sk2,sk5) )
| ~ spl0_1 ),
inference(resolution,[],[f19,f3]) ).
fof(f36,plain,
( ! [X2,X0,X1] :
( ~ survival_chance(X1,sk4,X2)
| ~ greater(X0,sk1(sk5,sk2))
| ~ organization(X1,X2)
| ~ inertia(X1,X0,X2)
| ~ reorganization_free(X1,X2,X2) )
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f33,f6]) ).
fof(f46,plain,
( ! [X0] :
( ~ greater(X0,sk1(sk5,sk2))
| ~ organization(sk2,sk6)
| ~ inertia(sk2,X0,sk6)
| ~ reorganization_free(sk2,sk6,sk6) )
| ~ spl0_1 ),
inference(resolution,[],[f36,f10]) ).
fof(f47,plain,
( ! [X0] :
( ~ greater(X0,sk1(sk5,sk2))
| ~ inertia(sk2,X0,sk6)
| ~ reorganization_free(sk2,sk6,sk6) )
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f46,f7]) ).
fof(f49,definition,
( spl0_5
<=> reorganization_free(sk2,sk6,sk6) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f51,plain,
( ~ reorganization_free(sk2,sk6,sk6)
| spl0_5 ),
inference(avatar_component_clause,[],[f49]) ).
fof(f53,definition,
( spl0_6
<=> ! [X0] :
( ~ greater(X0,sk1(sk5,sk2))
| ~ inertia(sk2,X0,sk6) ) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f54,plain,
( ! [X0] :
( ~ inertia(sk2,X0,sk6)
| ~ greater(X0,sk1(sk5,sk2)) )
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f53]) ).
fof(f55,plain,
( ~ spl0_5
| spl0_6
| ~ spl0_1 ),
inference(avatar_split_clause,[],[f47,f18,f53,f49]) ).
fof(f56,plain,
( ! [X0] : ~ reorganization_free(sk2,X0,sk6)
| spl0_5 ),
inference(resolution,[],[f51,f2]) ).
fof(f58,plain,
( $false
| spl0_5 ),
inference(resolution,[],[f56,f8]) ).
fof(f61,plain,
spl0_5,
inference(avatar_contradiction_clause,[],[f58]) ).
fof(f62,plain,
( ~ greater(sk1(sk6,sk2),sk1(sk5,sk2))
| ~ organization(sk2,sk6)
| ~ spl0_6 ),
inference(resolution,[],[f54,f3]) ).
fof(f63,plain,
( ~ greater(sk1(sk6,sk2),sk1(sk5,sk2))
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f62,f7]) ).
fof(f65,plain,
( ! [X2,X0,X1] :
( ~ inertia(X0,sk1(sk6,sk2),X1)
| ~ reorganization_free(X0,X2,X1)
| ~ inertia(X0,sk1(sk5,sk2),X2)
| ~ organization(X0,X1)
| ~ greater(X1,X2)
| ~ organization(X0,X2) )
| ~ spl0_6 ),
inference(resolution,[],[f63,f5]) ).
fof(f66,plain,
( ! [X0] :
( ~ reorganization_free(sk2,X0,sk6)
| ~ inertia(sk2,sk1(sk5,sk2),X0)
| ~ organization(sk2,sk6)
| ~ greater(sk6,X0)
| ~ organization(sk2,X0)
| ~ organization(sk2,sk6) )
| ~ spl0_6 ),
inference(resolution,[],[f65,f3]) ).
fof(f67,plain,
( ! [X0] :
( ~ reorganization_free(sk2,X0,sk6)
| ~ inertia(sk2,sk1(sk5,sk2),X0)
| ~ organization(sk2,sk6)
| ~ greater(sk6,X0)
| ~ organization(sk2,X0) )
| ~ spl0_6 ),
inference(duplicate_literal_removal,[],[f66]) ).
fof(f68,plain,
( ! [X0] :
( ~ inertia(sk2,sk1(sk5,sk2),X0)
| ~ reorganization_free(sk2,X0,sk6)
| ~ greater(sk6,X0)
| ~ organization(sk2,X0) )
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f67,f7]) ).
fof(f69,plain,
( ~ reorganization_free(sk2,sk5,sk6)
| ~ greater(sk6,sk5)
| ~ organization(sk2,sk5)
| ~ organization(sk2,sk5)
| ~ spl0_6 ),
inference(resolution,[],[f68,f3]) ).
fof(f70,plain,
( ~ reorganization_free(sk2,sk5,sk6)
| ~ greater(sk6,sk5)
| ~ organization(sk2,sk5)
| ~ spl0_6 ),
inference(duplicate_literal_removal,[],[f69]) ).
fof(f71,plain,
( ~ greater(sk6,sk5)
| ~ organization(sk2,sk5)
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f70,f8]) ).
fof(f72,plain,
( ~ organization(sk2,sk5)
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f71,f11]) ).
fof(f73,plain,
( $false
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f72,f6]) ).
fof(f74,plain,
~ spl0_6,
inference(avatar_contradiction_clause,[],[f73]) ).
cnf(s1,plain,
( spl0_1
| ~ spl0_2 ),
inference(sat_conversion,[],[f24]) ).
cnf(s2,plain,
spl0_2,
inference(sat_conversion,[],[f32]) ).
cnf(s4,plain,
( ~ spl0_1
| ~ spl0_5
| spl0_6 ),
inference(sat_conversion,[],[f55]) ).
cnf(s5,plain,
spl0_5,
inference(sat_conversion,[],[f61]) ).
cnf(s6,plain,
~ spl0_6,
inference(sat_conversion,[],[f74]) ).
cnf(s7,plain,
~ spl0_1,
inference(rat,[],[s4,s6,s5]) ).
cnf(s8,plain,
$false,
inference(rat,[],[s1,s2,s7]) ).
fof(f75,plain,
$false,
inference(avatar_sat_refutation,[],[s8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT003-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.39 % Computer : n017.cluster.edu
% 0.13/0.39 % Model : x86_64 x86_64
% 0.13/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39 % Memory : 8046.5625MB
% 0.13/0.39 % OS : Linux 6.8.0-71-generic
% 0.13/0.39 % CPULimit : 300
% 0.13/0.39 % WCLimit : 300
% 0.13/0.39 % DateTime : Sun Sep 27 17:11:05 UTC 2026
% 0.13/0.40 % CPUTime :
% 0.13/0.40 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.43 Running first-order theorem proving
% 0.13/0.43 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
% 2.63/1.36 % (2816944)Input is clausal, will run a generic CNF schedule.
% 2.63/1.36 % (2817055)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3481700917:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.63/1.36 % (2817055)First to succeed.
% 2.63/1.36 % (2817055)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2816944"
% 2.63/1.36 % (2817054)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2741215188:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.63/1.36 % (2817052)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=2874838403:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.63/1.36 % (2817050)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=1795700248:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.63/1.36 % (2817051)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=1050707077:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.63/1.36 % (2817053)lrs+10_1_sil=8000:sp=occurrence:random_seed=2116770922:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.63/1.36 % (2817054)Refutation not found, incomplete strategy
% 2.63/1.36 % (2817054)------------------------------
% 2.63/1.36 % (2817054)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.63/1.36 % (2817054)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.63/1.36 % (2817054)CaDiCaL version: 2.1.3
% 2.63/1.36 % (2817054)Termination reason: Refutation not found, incomplete strategy
% 2.63/1.36 % (2817054)Time elapsed: 0.001 s
% 2.63/1.36 % (2817054)Peak memory usage: 87 MB
% 2.63/1.36 % (2817053)Also succeeded, but the first one will report.
% 2.63/1.36 % (2817056)dis-21_1_sil=8000:lcm=predicate:random_seed=129981656: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)
% 2.63/1.36 % (2817056)Also succeeded, but the first one will report.
% 2.63/1.36 % (2817055)Refutation found. Thanks to Tanya!
% 2.63/1.36 % SZS status Unsatisfiable for theBenchmark
% 2.63/1.36 % SZS output start Proof for theBenchmark
% See solution above
% 2.63/1.37 % (2817055)------------------------------
% 2.63/1.37 % (2817055)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.63/1.37 % (2817055)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.63/1.37 % (2817055)CaDiCaL version: 2.1.3
% 2.63/1.37 % (2817055)Termination reason: Refutation
% 2.63/1.37 % (2817055)Time elapsed: 0.002 s
% 2.63/1.37 % (2817055)Peak memory usage: 89 MB
% 2.63/1.37 % (2817055)Instructions burned: 3 (million)
% 2.63/1.37 % (2817055)------------------------------
% 2.63/1.37 % (2817055)------------------------------
% 2.63/1.37 % (2816944)Success in time 0.288 s
% 2.63/1.37 % Vampire exiting
%------------------------------------------------------------------------------