%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : MGT041+2 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n002.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:11 PM UTC 2026
% Result : Theorem 2.52s 1.32s
% Output : Refutation 2.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of formulae : 62 ( 17 unt; 6 def)
% Number of atoms : 149 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 163 ( 76 ~; 64 |; 15 &)
% ( 6 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 13 ( 12 usr; 7 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 41 ( 0 sgn 35 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
~ ( number_of_routines(X0,X1,low)
& number_of_routines(X0,X1,high) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_not_high_and_low) ).
fof(f2,axiom,
! [X0,X1] :
( ( organisation_at_time(X0,X1)
& efficient_producer(X0)
& founding_time(X0,X1) )
=> has_elaborated_routines(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a14) ).
fof(f3,axiom,
! [X0,X1] :
( ( organisation_at_time(X0,X1)
& first_mover(X0)
& founding_time(X0,X1) )
=> number_of_routines(X0,X1,low) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a15) ).
fof(f4,axiom,
? [X0,X1] :
( organisation_at_time(X0,X1)
& founding_time(X0,X1)
& number_of_routines(X0,X1,high)
& ~ has_elaborated_routines(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a16) ).
fof(f5,conjecture,
? [X0,X1] :
( organisation_at_time(X0,X1)
& ~ first_mover(X0)
& ~ efficient_producer(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t10) ).
fof(f6,negated_conjecture,
~ ? [X0,X1] :
( organisation_at_time(X0,X1)
& ~ first_mover(X0)
& ~ efficient_producer(X0) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
fof(f7,plain,
! [X0,X1] :
( ~ number_of_routines(X0,X1,low)
| ~ number_of_routines(X0,X1,high) ),
inference(ennf_transformation,[],[f1]) ).
fof(f8,plain,
! [X0,X1] :
( has_elaborated_routines(X0,X1)
| ~ organisation_at_time(X0,X1)
| ~ efficient_producer(X0)
| ~ founding_time(X0,X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f9,plain,
! [X0,X1] :
( has_elaborated_routines(X0,X1)
| ~ organisation_at_time(X0,X1)
| ~ efficient_producer(X0)
| ~ founding_time(X0,X1) ),
inference(flattening,[],[f8]) ).
fof(f10,plain,
! [X0,X1] :
( number_of_routines(X0,X1,low)
| ~ organisation_at_time(X0,X1)
| ~ first_mover(X0)
| ~ founding_time(X0,X1) ),
inference(ennf_transformation,[],[f3]) ).
fof(f11,plain,
! [X0,X1] :
( number_of_routines(X0,X1,low)
| ~ organisation_at_time(X0,X1)
| ~ first_mover(X0)
| ~ founding_time(X0,X1) ),
inference(flattening,[],[f10]) ).
fof(f12,plain,
! [X0,X1] :
( ~ organisation_at_time(X0,X1)
| first_mover(X0)
| efficient_producer(X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f13,plain,
( organisation_at_time(sK0,sK1)
& founding_time(sK0,sK1)
& number_of_routines(sK0,sK1,high)
& ~ has_elaborated_routines(sK0,sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f4]) ).
fof(f14,plain,
! [X0,X1] :
( ~ number_of_routines(X0,X1,high)
| ~ number_of_routines(X0,X1,low) ),
inference(cnf_transformation,[],[f7]) ).
fof(f15,plain,
! [X0,X1] :
( has_elaborated_routines(X0,X1)
| ~ organisation_at_time(X0,X1)
| ~ efficient_producer(X0)
| ~ founding_time(X0,X1) ),
inference(cnf_transformation,[],[f9]) ).
fof(f16,plain,
! [X0,X1] :
( ~ first_mover(X0)
| ~ organisation_at_time(X0,X1)
| number_of_routines(X0,X1,low)
| ~ founding_time(X0,X1) ),
inference(cnf_transformation,[],[f11]) ).
fof(f17,plain,
~ has_elaborated_routines(sK0,sK1),
inference(cnf_transformation,[],[f13]) ).
fof(f18,plain,
number_of_routines(sK0,sK1,high),
inference(cnf_transformation,[],[f13]) ).
fof(f19,plain,
founding_time(sK0,sK1),
inference(cnf_transformation,[],[f13]) ).
fof(f20,plain,
organisation_at_time(sK0,sK1),
inference(cnf_transformation,[],[f13]) ).
fof(f21,plain,
! [X0,X1] :
( first_mover(X0)
| ~ organisation_at_time(X0,X1)
| efficient_producer(X0) ),
inference(cnf_transformation,[],[f12]) ).
fof(f22,plain,
~ number_of_routines(sK0,sK1,low),
inference(resolution,[],[f14,f18]) ).
fof(f23,plain,
( ~ organisation_at_time(sK0,sK1)
| ~ efficient_producer(sK0)
| ~ founding_time(sK0,sK1) ),
inference(resolution,[],[f15,f17]) ).
fof(f25,definition,
( spl2_1
<=> founding_time(sK0,sK1) ),
introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition]) ).
fof(f26,plain,
( ~ founding_time(sK0,sK1)
| spl2_1 ),
inference(avatar_component_clause,[],[f25]) ).
fof(f28,definition,
( spl2_2
<=> efficient_producer(sK0) ),
introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition]) ).
fof(f29,plain,
( ~ efficient_producer(sK0)
| spl2_2 ),
inference(avatar_component_clause,[],[f28]) ).
fof(f31,definition,
( spl2_3
<=> organisation_at_time(sK0,sK1) ),
introduced(definition,[new_symbols(definition,[spl2_3])],[avatar_definition]) ).
fof(f32,plain,
( ~ organisation_at_time(sK0,sK1)
| spl2_3 ),
inference(avatar_component_clause,[],[f31]) ).
fof(f33,plain,
( ~ spl2_1
| ~ spl2_2
| ~ spl2_3 ),
inference(avatar_split_clause,[],[f23,f31,f28,f25]) ).
fof(f34,plain,
( $false
| spl2_1 ),
inference(resolution,[],[f26,f19]) ).
fof(f35,plain,
spl2_1,
inference(avatar_contradiction_clause,[],[f34]) ).
fof(f36,plain,
! [X2,X0,X1] :
( efficient_producer(X0)
| number_of_routines(X0,X1,low)
| ~ founding_time(X0,X1)
| ~ organisation_at_time(X0,X2)
| ~ organisation_at_time(X0,X1) ),
inference(resolution,[],[f16,f21]) ).
fof(f39,definition,
( spl2_4
<=> ! [X1] : ~ organisation_at_time(sK0,X1) ),
introduced(definition,[new_symbols(definition,[spl2_4])],[avatar_definition]) ).
fof(f40,plain,
( ! [X1] : ~ organisation_at_time(sK0,X1)
| ~ spl2_4 ),
inference(avatar_component_clause,[],[f39]) ).
fof(f42,definition,
( spl2_5
<=> ! [X0] :
( number_of_routines(sK0,X0,low)
| ~ organisation_at_time(sK0,X0)
| ~ founding_time(sK0,X0) ) ),
introduced(definition,[new_symbols(definition,[spl2_5])],[avatar_definition]) ).
fof(f43,plain,
( ! [X0] :
( ~ founding_time(sK0,X0)
| ~ organisation_at_time(sK0,X0)
| number_of_routines(sK0,X0,low) )
| ~ spl2_5 ),
inference(avatar_component_clause,[],[f42]) ).
fof(f45,plain,
( $false
| spl2_3 ),
inference(resolution,[],[f32,f20]) ).
fof(f46,plain,
spl2_3,
inference(avatar_contradiction_clause,[],[f45]) ).
fof(f47,plain,
( ! [X0,X1] :
( number_of_routines(sK0,X0,low)
| ~ founding_time(sK0,X0)
| ~ organisation_at_time(sK0,X1)
| ~ organisation_at_time(sK0,X0) )
| spl2_2 ),
inference(resolution,[],[f29,f36]) ).
fof(f48,plain,
( spl2_4
| spl2_5
| spl2_2 ),
inference(avatar_split_clause,[],[f47,f28,f42,f39]) ).
fof(f49,plain,
( ~ organisation_at_time(sK0,sK1)
| number_of_routines(sK0,sK1,low)
| ~ spl2_5 ),
inference(resolution,[],[f43,f19]) ).
fof(f51,definition,
( spl2_6
<=> number_of_routines(sK0,sK1,low) ),
introduced(definition,[new_symbols(definition,[spl2_6])],[avatar_definition]) ).
fof(f52,plain,
( number_of_routines(sK0,sK1,low)
| ~ spl2_6 ),
inference(avatar_component_clause,[],[f51]) ).
fof(f53,plain,
( spl2_6
| ~ spl2_3
| ~ spl2_5 ),
inference(avatar_split_clause,[],[f49,f42,f31,f51]) ).
fof(f54,plain,
( $false
| ~ spl2_6 ),
inference(resolution,[],[f52,f22]) ).
fof(f55,plain,
~ spl2_6,
inference(avatar_contradiction_clause,[],[f54]) ).
fof(f56,plain,
( $false
| ~ spl2_4 ),
inference(resolution,[],[f40,f20]) ).
fof(f57,plain,
~ spl2_4,
inference(avatar_contradiction_clause,[],[f56]) ).
cnf(s1,plain,
( ~ spl2_1
| ~ spl2_2
| ~ spl2_3 ),
inference(sat_conversion,[],[f33]) ).
cnf(s2,plain,
spl2_1,
inference(sat_conversion,[],[f35]) ).
cnf(s4,plain,
spl2_3,
inference(sat_conversion,[],[f46]) ).
cnf(s5,plain,
( spl2_2
| spl2_4
| spl2_5 ),
inference(sat_conversion,[],[f48]) ).
cnf(s6,plain,
( ~ spl2_3
| ~ spl2_5
| spl2_6 ),
inference(sat_conversion,[],[f53]) ).
cnf(s7,plain,
~ spl2_6,
inference(sat_conversion,[],[f55]) ).
cnf(s8,plain,
~ spl2_4,
inference(sat_conversion,[],[f57]) ).
cnf(s9,plain,
( ~ spl2_3
| ~ spl2_5 ),
inference(rat,[],[s6,s7]) ).
cnf(s10,plain,
( spl2_2
| spl2_5 ),
inference(rat,[],[s5,s8]) ).
cnf(s11,plain,
~ spl2_5,
inference(rat,[],[s9,s4]) ).
cnf(s12,plain,
spl2_2,
inference(rat,[],[s10,s11]) ).
cnf(s13,plain,
$false,
inference(rat,[],[s1,s4,s12,s2]) ).
fof(f58,plain,
$false,
inference(avatar_sat_refutation,[],[s13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT041+2 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.38 % Computer : n002.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:27:10 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.42 Running first-order theorem proving
% 0.10/0.42 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
% 2.52/1.32 % (3761574)Detected formulas, will run a generic FOF schedule.
% 2.52/1.32 % (3761585)dis-21_1_sil=8000:lcm=predicate:random_seed=3180374843:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 2.52/1.32 % (3761585)First to succeed.
% 2.52/1.32 % (3761585)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3761574"
% 2.52/1.32 % (3761584)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3336939112:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.52/1.32 % (3761581)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=857948191:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.52/1.32 % (3761584)Also succeeded, but the first one will report.
% 2.52/1.32 % (3761579)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=3162426434:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.52/1.32 % (3761580)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=3246118396:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.52/1.32 % (3761583)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3093702950:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.52/1.32 % (3761582)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=4255523296:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.52/1.32 % (3761583)Also succeeded, but the first one will report.
% 2.52/1.32 % (3761582)Also succeeded, but the first one will report.
% 2.52/1.32 % (3761585)Refutation found. Thanks to Tanya!
% 2.52/1.32 % SZS status Theorem for theBenchmark
% 2.52/1.32 % SZS output start Proof for theBenchmark
% See solution above
% 2.52/1.32 % (3761585)------------------------------
% 2.52/1.32 % (3761585)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.52/1.32 % (3761585)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.52/1.32 % (3761585)CaDiCaL version: 2.1.3
% 2.52/1.32 % (3761585)Termination reason: Refutation
% 2.52/1.32 % (3761585)Time elapsed: 0.002 s
% 2.52/1.32 % (3761585)Peak memory usage: 89 MB
% 2.52/1.32 % (3761585)Instructions burned: 2 (million)
% 2.52/1.32 % (3761585)------------------------------
% 2.52/1.32 % (3761585)------------------------------
% 2.52/1.32 % (3761574)Success in time 0.271 s
% 2.52/1.32 % Vampire exiting
%------------------------------------------------------------------------------