%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : MGT036-2 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n010.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:38 PM UTC 2026
% Result : Unsatisfiable 0.16s 0.46s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 14
% Syntax : Number of formulae : 48 ( 11 unt; 2 def)
% Number of atoms : 111 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 134 ( 71 ~; 61 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 3 prp; 0-4 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 64 ( 0 sgn 64 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X3,X0,X1] :
( ~ subpopulations(X1,X2,X0,X3)
| ~ environment(X0)
| subpopulations(X2,X1,X0,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_symmetry_of_subpopulations_1) ).
fof(f2,axiom,
! [X0,X1] :
( ~ subpopulations(first_movers,efficient_producers,X0,X1)
| ~ environment(X0)
| in_environment(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_time_point_occur_2) ).
fof(f3,axiom,
! [X2,X0,X1] :
( environment(X0)
| ~ greater(zero,growth_rate(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_growth_rate_relationships_3) ).
fof(f4,axiom,
! [X2,X3,X0,X1] :
( ~ greater(zero,growth_rate(X0,X3))
| subpopulations(X0,X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_growth_rate_relationships_4) ).
fof(f5,axiom,
! [X0,X1] :
( ~ greater_or_equal(growth_rate(X0,X1),zero)
| ~ greater(zero,growth_rate(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_growth_rate_relationships_5) ).
fof(f8,axiom,
! [X2,X3,X0,X1] :
( ~ subpopulations(X1,X2,X0,X3)
| ~ environment(X0)
| ~ outcompetes(X2,X1,X3)
| greater_or_equal(growth_rate(X2,X3),zero) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_8) ).
fof(f9,axiom,
! [X2,X3,X0,X1] :
( ~ environment(X0)
| ~ subpopulations(X1,X2,X0,X3)
| ~ outcompetes(X2,X1,X3)
| greater(zero,growth_rate(X1,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_9) ).
fof(f10,axiom,
greater(resilience(efficient_producers),resilience(first_movers)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a2_10) ).
fof(f11,axiom,
! [X2,X3,X0,X1] :
( ~ environment(X0)
| ~ in_environment(X0,X1)
| greater(zero,growth_rate(X2,X1))
| ~ greater(resilience(X3),resilience(X2))
| ~ greater(zero,growth_rate(X3,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a13_11) ).
fof(f12,negated_conjecture,
environment(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t5_12) ).
fof(f13,negated_conjecture,
subpopulations(first_movers,efficient_producers,sk1,sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t5_13) ).
fof(f14,negated_conjecture,
outcompetes(first_movers,efficient_producers,sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t5_14) ).
fof(f16,definition,
( spl0_1
<=> ! [X2,X1] : ~ greater(zero,growth_rate(X1,X2)) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f17,plain,
( ! [X2,X1] : ~ greater(zero,growth_rate(X1,X2))
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f16]) ).
fof(f19,definition,
( spl0_2
<=> ! [X0] : environment(X0) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f20,plain,
( ! [X0] : environment(X0)
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f19]) ).
fof(f21,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f3,f19,f16]) ).
fof(f22,plain,
( ! [X0,X1] :
( ~ subpopulations(first_movers,efficient_producers,X0,X1)
| in_environment(X0,X1) )
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f2,f20]) ).
fof(f24,plain,
( ! [X2,X3,X0,X1] :
( ~ subpopulations(X1,X2,X0,X3)
| subpopulations(X2,X1,X0,X3) )
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f1,f20]) ).
fof(f25,plain,
( subpopulations(efficient_producers,first_movers,sk1,sk2)
| ~ spl0_2 ),
inference(resolution,[],[f24,f13]) ).
fof(f27,plain,
( ! [X2,X3,X0,X1] :
( ~ subpopulations(X1,X2,X0,X3)
| ~ outcompetes(X2,X1,X3)
| greater_or_equal(growth_rate(X2,X3),zero) )
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f8,f20]) ).
fof(f29,plain,
( ~ outcompetes(first_movers,efficient_producers,sk2)
| greater_or_equal(growth_rate(first_movers,sk2),zero)
| ~ spl0_2 ),
inference(resolution,[],[f27,f25]) ).
fof(f30,plain,
( greater_or_equal(growth_rate(first_movers,sk2),zero)
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f29,f14]) ).
fof(f40,plain,
( ! [X2,X3,X0,X1] :
( ~ subpopulations(X1,X2,X0,X3)
| ~ outcompetes(X2,X1,X3)
| greater(zero,growth_rate(X1,X3)) )
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f9,f20]) ).
fof(f42,plain,
( ~ outcompetes(first_movers,efficient_producers,sk2)
| greater(zero,growth_rate(efficient_producers,sk2))
| ~ spl0_2 ),
inference(resolution,[],[f40,f25]) ).
fof(f43,plain,
( greater(zero,growth_rate(efficient_producers,sk2))
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f42,f14]) ).
fof(f44,plain,
( ~ greater(zero,growth_rate(first_movers,sk2))
| ~ spl0_2 ),
inference(resolution,[],[f30,f5]) ).
fof(f46,plain,
( ! [X0,X1] : subpopulations(efficient_producers,X0,X1,sk2)
| ~ spl0_2 ),
inference(resolution,[],[f43,f4]) ).
fof(f49,plain,
( ! [X2,X3,X0,X1] :
( ~ greater(resilience(X3),resilience(X2))
| greater(zero,growth_rate(X2,X1))
| ~ in_environment(X0,X1)
| ~ greater(zero,growth_rate(X3,X1)) )
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f11,f20]) ).
fof(f53,plain,
( ! [X0,X1] : subpopulations(X0,efficient_producers,X1,sk2)
| ~ spl0_2 ),
inference(resolution,[],[f46,f24]) ).
fof(f54,plain,
( ! [X0,X1] :
( ~ greater(zero,growth_rate(efficient_producers,X0))
| ~ in_environment(X1,X0)
| greater(zero,growth_rate(first_movers,X0)) )
| ~ spl0_2 ),
inference(resolution,[],[f49,f10]) ).
fof(f55,plain,
( ! [X0] : in_environment(X0,sk2)
| ~ spl0_2 ),
inference(resolution,[],[f53,f22]) ).
fof(f71,plain,
( ! [X0] :
( ~ in_environment(X0,sk2)
| greater(zero,growth_rate(first_movers,sk2)) )
| ~ spl0_2 ),
inference(resolution,[],[f54,f43]) ).
fof(f72,plain,
( ! [X0] : ~ in_environment(X0,sk2)
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f71,f44]) ).
fof(f73,plain,
( $false
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f72,f55]) ).
fof(f74,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f73]) ).
fof(f85,plain,
( ~ environment(sk1)
| subpopulations(efficient_producers,first_movers,sk1,sk2) ),
inference(resolution,[],[f1,f13]) ).
fof(f86,plain,
subpopulations(efficient_producers,first_movers,sk1,sk2),
inference(forward_subsumption_resolution,[],[f85,f12]) ).
fof(f92,plain,
( ! [X2,X3,X0,X1] :
( ~ subpopulations(X1,X2,X0,X3)
| ~ environment(X0)
| ~ outcompetes(X2,X1,X3) )
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f9,f17]) ).
fof(f95,plain,
( ~ environment(sk1)
| ~ outcompetes(first_movers,efficient_producers,sk2)
| ~ spl0_1 ),
inference(resolution,[],[f92,f86]) ).
fof(f96,plain,
( ~ outcompetes(first_movers,efficient_producers,sk2)
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f95,f12]) ).
fof(f97,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f96,f14]) ).
fof(f98,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f97]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f21]) ).
cnf(s5,plain,
~ spl0_2,
inference(sat_conversion,[],[f74]) ).
cnf(s7,plain,
~ spl0_1,
inference(sat_conversion,[],[f98]) ).
cnf(s8,plain,
$false,
inference(rat,[],[s1,s5,s7]) ).
fof(f99,plain,
$false,
inference(avatar_sat_refutation,[],[s8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT036-2 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.38 % Computer : n010.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:23:32 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.41 Running first-order model finding
% 0.10/0.41 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.46 % (1186202)Will run a generic schedule for satisfiability detection.
% 0.16/0.46 % (1186207)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4029608978_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.46 % TRYING [1]
% 0.16/0.46 % TRYING [2]
% 0.16/0.46 % TRYING [3]
% 0.16/0.46 % TRYING [4]
% 0.16/0.46 % (1186208)% WARNING: option uhcvi not known.
% 0.16/0.46 % TRYING [5]
% 0.16/0.46 % TRYING [6]
% 0.16/0.46 % TRYING [7]
% 0.16/0.46 % (1186209)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=349591842:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.46 % (1186208)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1202513550:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.46 % TRYING [8]
% 0.16/0.46 % (1186210)dis+10_1_sil=32000:sp=arity:random_seed=3441957576:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.46 % (1186211)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4287086065:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.46 % (1186213)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3539785981:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/0.46 % (1186212)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2910944719:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.46 % TRYING [9]
% 0.16/0.46 % (1186210) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1186202-1186210"...
% 0.16/0.46 % (1186211) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1186202-1186211"...
% 0.16/0.46 % (1186212) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1186202-1186212"...
% 0.16/0.46 % (1186213) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1186202-1186213"...
% 0.16/0.46 % (1186209) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1186202-1186209"...
% 0.16/0.46 % (1186210)...printing done.
% 0.16/0.46 % (1186211)...printing done.
% 0.16/0.46 % TRYING [10]
% 0.16/0.46 % (1186208) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1186202-1186208"...
% 0.16/0.46 % (1186212)...printing done.
% 0.16/0.46 % (1186213)...printing done.
% 0.16/0.46 % (1186210)Refutation found. Thanks to Tanya!
% 0.16/0.46 % SZS status Unsatisfiable for theBenchmark
% 0.16/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.46 % (1186210)------------------------------
% 0.16/0.46 % (1186210)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.46 % (1186210)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.46 % (1186210)CaDiCaL version: 2.1.3
% 0.16/0.46 % (1186210)Termination reason: Refutation
% 0.16/0.46 % (1186210)Time elapsed: 0.003 s
% 0.16/0.46 % (1186210)Peak memory usage: 11 MB
% 0.16/0.46 % (1186210)Instructions burned: 3 (million)
% 0.16/0.46 % (1186202)Success in time 0.039 s
% 0.16/0.46 % Vampire exiting
%------------------------------------------------------------------------------