%------------------------------------------------------------------------------
% File : Vampire-SAT---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 SAT
% Computer : n019.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:40 PM UTC 2026
% Result : Theorem 0.11s 0.46s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 41 ( 12 unt; 2 def)
% Number of atoms : 96 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 106 ( 51 ~; 36 |; 15 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 3 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 32 ( 0 sgn 26 !; 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] :
( ~ founding_time(X0,X1)
| ~ organisation_at_time(X0,X1)
| ~ efficient_producer(X0)
| has_elaborated_routines(X0,X1) ),
inference(cnf_transformation,[],[f9]) ).
fof(f16,plain,
! [X0,X1] :
( number_of_routines(X0,X1,low)
| ~ organisation_at_time(X0,X1)
| ~ first_mover(X0)
| ~ 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] :
( ~ organisation_at_time(X0,X1)
| first_mover(X0)
| efficient_producer(X0) ),
inference(cnf_transformation,[],[f12]) ).
fof(f22,plain,
( first_mover(sK0)
| efficient_producer(sK0) ),
inference(resolution,[],[f20,f21]) ).
fof(f24,definition,
( spl2_1
<=> efficient_producer(sK0) ),
introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition]) ).
fof(f28,definition,
( spl2_2
<=> first_mover(sK0) ),
introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition]) ).
fof(f30,plain,
( first_mover(sK0)
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f28]) ).
fof(f31,plain,
( spl2_1
| spl2_2 ),
inference(avatar_split_clause,[],[f22,f28,f24]) ).
fof(f32,plain,
~ number_of_routines(sK0,sK1,low),
inference(resolution,[],[f14,f18]) ).
fof(f33,plain,
( ~ organisation_at_time(sK0,sK1)
| ~ efficient_producer(sK0)
| has_elaborated_routines(sK0,sK1) ),
inference(resolution,[],[f15,f19]) ).
fof(f34,plain,
( ~ efficient_producer(sK0)
| has_elaborated_routines(sK0,sK1) ),
inference(forward_subsumption_resolution,[],[f33,f20]) ).
fof(f35,plain,
~ efficient_producer(sK0),
inference(forward_subsumption_resolution,[],[f34,f17]) ).
fof(f36,plain,
~ spl2_1,
inference(avatar_split_clause,[],[f35,f24]) ).
fof(f37,plain,
( ~ organisation_at_time(sK0,sK1)
| ~ first_mover(sK0)
| ~ founding_time(sK0,sK1) ),
inference(resolution,[],[f32,f16]) ).
fof(f38,plain,
( ~ first_mover(sK0)
| ~ founding_time(sK0,sK1) ),
inference(forward_subsumption_resolution,[],[f37,f20]) ).
fof(f39,plain,
( ~ founding_time(sK0,sK1)
| ~ spl2_2 ),
inference(forward_subsumption_resolution,[],[f38,f30]) ).
fof(f40,plain,
( $false
| ~ spl2_2 ),
inference(forward_subsumption_resolution,[],[f39,f19]) ).
fof(f41,plain,
~ spl2_2,
inference(avatar_contradiction_clause,[],[f40]) ).
cnf(s1,plain,
( spl2_1
| spl2_2 ),
inference(sat_conversion,[],[f31]) ).
cnf(s2,plain,
~ spl2_1,
inference(sat_conversion,[],[f36]) ).
cnf(s3,plain,
~ spl2_2,
inference(sat_conversion,[],[f41]) ).
cnf(s4,plain,
$false,
inference(rat,[],[s1,s3,s2]) ).
fof(f42,plain,
$false,
inference(avatar_sat_refutation,[],[s4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT041+2 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.39 % Computer : n019.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Sun Sep 27 17:24:19 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42 Running first-order model finding
% 0.11/0.42 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.46 % (3291678)Will run a generic schedule for satisfiability detection.
% 0.11/0.46 % (3291686)dis+10_1_sil=32000:sp=arity:random_seed=3393126241:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.46 % (3291686) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3291678-3291686"...
% 0.11/0.46 % (3291686)...printing done.
% 0.11/0.46 % (3291686)Refutation found. Thanks to Tanya!
% 0.11/0.46 % SZS status Theorem for theBenchmark
% 0.11/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.46 % (3291686)------------------------------
% 0.11/0.46 % (3291686)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.46 % (3291686)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.46 % (3291686)CaDiCaL version: 2.1.3
% 0.11/0.46 % (3291686)Termination reason: Refutation
% 0.11/0.46 % (3291686)Time elapsed: 0.001 s
% 0.11/0.46 % (3291686)Peak memory usage: 12 MB
% 0.11/0.46 % (3291686)Instructions burned: 1 (million)
% 0.11/0.46 % (3291678)Success in time 0.03 s
% 0.11/0.46 % Vampire exiting
%------------------------------------------------------------------------------