%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : MGT034-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n026.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:36 PM UTC 2026
% Result : Satisfiable 0.18s 0.46s
% Output : Saturation 0.18s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(u67,negated_conjecture,
sk2 != appear(efficient_producers,sk1) ).
cnf(u72,negated_conjecture,
~ greater(sk2,appear(efficient_producers,sk1)) ).
cnf(u78,negated_conjecture,
~ environment(sk1) ).
cnf(u82,negated_conjecture,
in_environment(sk1,critical_point(sk1)) ).
cnf(u87,negated_conjecture,
~ subpopulations(efficient_producers,first_movers,sk1,critical_point(sk1)) ).
cnf(u96,negated_conjecture,
~ greater_or_equal(critical_point(sk1),appear(efficient_producers,sk1)) ).
cnf(u101,negated_conjecture,
critical_point(sk1) != appear(efficient_producers,sk1) ).
cnf(u106,negated_conjecture,
~ greater(critical_point(sk1),appear(efficient_producers,sk1)) ).
cnf(u113,negated_conjecture,
~ subpopulations(efficient_producers,first_movers,sk1,appear(efficient_producers,sk1)) ).
cnf(u117,negated_conjecture,
~ in_environment(sk1,appear(efficient_producers,sk1)) ).
cnf(u125,negated_conjecture,
~ decreases(difference(founding_rate(first_movers,critical_point(sk1)),founding_rate(efficient_producers,critical_point(sk1)))) ).
cnf(u131,negated_conjecture,
( greater_or_equal(appear(efficient_producers,sk1),X1)
| ~ in_environment(sk1,X1) ) ).
cnf(u139,negated_conjecture,
~ decreases(difference(founding_rate(first_movers,appear(efficient_producers,sk1)),founding_rate(efficient_producers,appear(efficient_producers,sk1)))) ).
cnf(u147,negated_conjecture,
( greater_or_equal(appear(efficient_producers,sk1),X1)
| ~ subpopulations(first_movers,efficient_producers,sk1,X1)
| subpopulations(first_movers,efficient_producers,sk1,X0)
| greater_or_equal(X1,X0) ) ).
cnf(u151,negated_conjecture,
( greater_or_equal(critical_point(sk1),X1)
| ~ subpopulations(first_movers,efficient_producers,sk1,X1)
| subpopulations(first_movers,efficient_producers,sk1,X0)
| greater_or_equal(X1,X0) ) ).
cnf(u164,negated_conjecture,
greater(appear(efficient_producers,sk1),start_time(sk1)) ).
cnf(u180,negated_conjecture,
~ subpopulations(first_movers,efficient_producers,sk1,critical_point(sk1)) ).
cnf(u184,negated_conjecture,
( greater_or_equal(appear(efficient_producers,sk1),X0)
| subpopulations(first_movers,efficient_producers,sk1,X0) ) ).
cnf(u187,negated_conjecture,
subpopulations(first_movers,efficient_producers,sk1,appear(efficient_producers,sk1)) ).
cnf(u195,negated_conjecture,
~ decreases(difference(growth_rate(first_movers,appear(efficient_producers,sk1)),growth_rate(efficient_producers,appear(efficient_producers,sk1)))) ).
cnf(u199,negated_conjecture,
~ decreases(difference(disbanding_rate(first_movers,appear(efficient_producers,sk1)),disbanding_rate(efficient_producers,appear(efficient_producers,sk1)))) ).
cnf(u204,negated_conjecture,
~ decreases(difference(growth_rate(first_movers,critical_point(sk1)),growth_rate(efficient_producers,critical_point(sk1)))) ).
cnf(u207,negated_conjecture,
decreases(difference(disbanding_rate(first_movers,critical_point(sk1)),disbanding_rate(efficient_producers,critical_point(sk1)))) ).
cnf(u245,negated_conjecture,
subpopulations(first_movers,efficient_producers,sk1,sk2) ).
cnf(u249,negated_conjecture,
( greater_or_equal(sk2,X0)
| subpopulations(first_movers,efficient_producers,sk1,X0) ) ).
cnf(u258,negated_conjecture,
decreases(difference(growth_rate(first_movers,sk2),growth_rate(efficient_producers,sk2))) ).
cnf(u263,negated_conjecture,
~ decreases(difference(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2))) ).
cnf(u280,negated_conjecture,
~ greater_or_equal(difference(growth_rate(first_movers,critical_point(sk1)),growth_rate(efficient_producers,critical_point(sk1))),zero) ).
cnf(u283,negated_conjecture,
greater(zero,difference(growth_rate(first_movers,critical_point(sk1)),growth_rate(efficient_producers,critical_point(sk1)))) ).
cnf(u290,negated_conjecture,
zero != difference(growth_rate(first_movers,critical_point(sk1)),growth_rate(efficient_producers,critical_point(sk1))) ).
cnf(u295,negated_conjecture,
~ greater(difference(growth_rate(first_movers,critical_point(sk1)),growth_rate(efficient_producers,critical_point(sk1))),zero) ).
cnf(u306,negated_conjecture,
~ selection_favors(efficient_producers,first_movers,critical_point(sk1)) ).
cnf(u318,negated_conjecture,
~ selection_favors(first_movers,efficient_producers,critical_point(sk1)) ).
cnf(u328,negated_conjecture,
greater(difference(growth_rate(first_movers,sk2),growth_rate(efficient_producers,sk2)),zero) ).
cnf(u332,negated_conjecture,
~ greater(critical_point(sk1),sk2) ).
cnf(u341,negated_conjecture,
~ greater(difference(growth_rate(first_movers,appear(efficient_producers,sk1)),growth_rate(efficient_producers,appear(efficient_producers,sk1))),zero) ).
cnf(u351,negated_conjecture,
selection_favors(first_movers,efficient_producers,sk2) ).
cnf(u365,negated_conjecture,
~ selection_favors(first_movers,efficient_producers,appear(efficient_producers,sk1)) ).
cnf(u58,negated_conjecture,
~ greater_or_equal(sk2,appear(efficient_producers,sk1)) ).
cnf(u37,axiom,
( ~ subpopulations(first_movers,efficient_producers,X0,appear(efficient_producers,X0))
| ~ in_environment(X0,appear(efficient_producers,X0))
| environment(X0) ) ).
cnf(u47,axiom,
( environment(X0)
| subpopulations(first_movers,efficient_producers,X0,X1)
| ~ subpopulations(efficient_producers,first_movers,X0,X1) ) ).
cnf(prove_t3_55,negated_conjecture,
in_environment(sk1,critical_point(sk1)) ).
cnf(u45,axiom,
( in_environment(X0,start_time(X0))
| environment(X0) ) ).
cnf(u55,hypothesis,
( environment(X0)
| subpopulations(first_movers,efficient_producers,X0,X2)
| greater(X2,critical_point(X0))
| ~ greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2)) ) ).
cnf(u57,negated_conjecture,
~ environment(sk1) ).
cnf(u34,axiom,
( greater(growth_rate(X2,X3),growth_rate(X1,X3))
| subpopulations(X1,X2,X0,X3)
| environment(X0)
| ~ selection_favors(X2,X1,X3) ) ).
cnf(u91,negated_conjecture,
( subpopulations(first_movers,efficient_producers,sk1,X0)
| ~ greater_or_equal(X0,appear(efficient_producers,sk1)) ) ).
cnf(u312,negated_conjecture,
~ greater(growth_rate(first_movers,critical_point(sk1)),growth_rate(efficient_producers,critical_point(sk1))) ).
cnf(u119,negated_conjecture,
( subpopulations(first_movers,efficient_producers,sk1,X0)
| ~ decreases(difference(founding_rate(first_movers,X0),founding_rate(efficient_producers,X0))) ) ).
cnf(u42,axiom,
( greater(difference(growth_rate(first_movers,X0),growth_rate(efficient_producers,X0)),zero)
| ~ greater(growth_rate(first_movers,X0),growth_rate(efficient_producers,X0)) ) ).
cnf(u60,negated_conjecture,
selection_favors(first_movers,efficient_producers,sk2) ).
cnf(u265,negated_conjecture,
( subpopulations(first_movers,efficient_producers,X0,sk2)
| environment(X0) ) ).
cnf(u240,negated_conjecture,
( subpopulations(first_movers,efficient_producers,sk1,X0)
| ~ greater(zero,difference(growth_rate(first_movers,X0),growth_rate(efficient_producers,X0)))
| ~ greater_or_equal(difference(growth_rate(first_movers,X0),growth_rate(efficient_producers,X0)),zero) ) ).
cnf(u173,negated_conjecture,
( greater(critical_point(sk1),X0)
| subpopulations(first_movers,efficient_producers,sk1,X1)
| greater_or_equal(X0,X1)
| ~ subpopulations(first_movers,efficient_producers,sk1,X0) ) ).
cnf(u39,axiom,
( decreases(difference(founding_rate(first_movers,X0),founding_rate(efficient_producers,X0)))
| ~ decreases(difference(disbanding_rate(first_movers,X0),disbanding_rate(efficient_producers,X0)))
| ~ decreases(difference(growth_rate(first_movers,X0),growth_rate(efficient_producers,X0))) ) ).
cnf(u239,negated_conjecture,
( greater(appear(efficient_producers,sk1),X0)
| subpopulations(first_movers,efficient_producers,sk1,X0) ) ).
cnf(u41,axiom,
( greater(growth_rate(efficient_producers,X0),growth_rate(first_movers,X0))
| ~ greater(zero,difference(growth_rate(first_movers,X0),growth_rate(efficient_producers,X0))) ) ).
cnf(u51,axiom,
~ greater_or_equal(X1,X1) ).
cnf(u273,negated_conjecture,
( greater(appear(efficient_producers,sk1),X0)
| subpopulations(first_movers,efficient_producers,sk1,X1)
| greater_or_equal(X0,X1)
| ~ subpopulations(first_movers,efficient_producers,sk1,X0) ) ).
cnf(u158,negated_conjecture,
greater(appear(efficient_producers,sk1),critical_point(sk1)) ).
cnf(u53,hypothesis,
( environment(X0)
| subpopulations(first_movers,efficient_producers,X0,X1)
| subpopulations(first_movers,efficient_producers,X0,X2)
| greater_or_equal(X3,X1)
| greater_or_equal(X2,X3)
| ~ subpopulations(first_movers,efficient_producers,X0,X3) ) ).
cnf(u49,axiom,
( greater_or_equal(X0,X1)
| ~ greater(X0,X1)
| X0 = X1 ) ).
cnf(u59,negated_conjecture,
~ greater(critical_point(sk1),sk2) ).
cnf(u44,axiom,
( environment(X0)
| ~ in_environment(X0,X1)
| ~ in_environment(X0,X2)
| greater_or_equal(X2,X3)
| greater_or_equal(X3,X1)
| in_environment(X0,X3) ) ).
cnf(u54,hypothesis,
( greater(growth_rate(efficient_producers,critical_point(X0)),growth_rate(first_movers,critical_point(X0)))
| environment(X0) ) ).
cnf(u56,hypothesis,
( environment(X0)
| subpopulations(first_movers,efficient_producers,X0,X1)
| ~ decreases(difference(founding_rate(first_movers,X1),founding_rate(efficient_producers,X1))) ) ).
cnf(u43,axiom,
( greater(growth_rate(first_movers,X0),growth_rate(efficient_producers,X0))
| ~ greater(difference(growth_rate(first_movers,X0),growth_rate(efficient_producers,X0)),zero) ) ).
cnf(u224,negated_conjecture,
( subpopulations(first_movers,efficient_producers,X0,appear(efficient_producers,sk1))
| environment(X0) ) ).
cnf(u157,negated_conjecture,
( ~ in_environment(sk1,X0)
| greater(appear(efficient_producers,sk1),X0) ) ).
cnf(u52,axiom,
( environment(X0)
| subpopulations(first_movers,efficient_producers,X0,X1)
| ~ greater(zero,difference(growth_rate(first_movers,X1),growth_rate(efficient_producers,X1)))
| ~ greater_or_equal(difference(growth_rate(first_movers,X1),growth_rate(efficient_producers,X1)),zero) ) ).
cnf(u270,negated_conjecture,
( greater(sk2,X0)
| subpopulations(first_movers,efficient_producers,sk1,X0) ) ).
cnf(u35,axiom,
( decreases(difference(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1)))
| subpopulations(first_movers,efficient_producers,X0,X1)
| environment(X0) ) ).
cnf(u297,negated_conjecture,
( decreases(difference(growth_rate(first_movers,X1),growth_rate(efficient_producers,X1)))
| environment(X0)
| greater_or_equal(X1,appear(efficient_producers,X0))
| greater(critical_point(sk1),X1)
| ~ in_environment(X0,critical_point(sk1))
| ~ greater(difference(growth_rate(first_movers,X1),growth_rate(efficient_producers,X1)),zero) ) ).
cnf(u142,negated_conjecture,
( subpopulations(first_movers,efficient_producers,sk1,X1)
| subpopulations(first_movers,efficient_producers,sk1,X0)
| greater_or_equal(X2,X0)
| greater_or_equal(X1,X2)
| ~ subpopulations(first_movers,efficient_producers,sk1,X2) ) ).
cnf(u38,axiom,
( greater_or_equal(difference(growth_rate(first_movers,X1),growth_rate(efficient_producers,X1)),zero)
| ~ in_environment(X0,X1)
| environment(X0)
| greater_or_equal(X2,appear(efficient_producers,X0))
| greater(X1,X2)
| decreases(difference(growth_rate(first_movers,X2),growth_rate(efficient_producers,X2)))
| ~ greater(difference(growth_rate(first_movers,X2),growth_rate(efficient_producers,X2)),zero) ) ).
cnf(u127,negated_conjecture,
( in_environment(sk1,X2)
| ~ in_environment(sk1,X1)
| greater_or_equal(X1,X2)
| greater_or_equal(X2,X0)
| ~ in_environment(sk1,X0) ) ).
cnf(u40,axiom,
( greater(zero,difference(growth_rate(first_movers,X0),growth_rate(efficient_producers,X0)))
| ~ greater(growth_rate(efficient_producers,X0),growth_rate(first_movers,X0)) ) ).
cnf(u50,axiom,
( ~ greater_or_equal(X0,X1)
| greater(X0,X1) ) ).
cnf(u359,negated_conjecture,
~ greater(growth_rate(first_movers,appear(efficient_producers,sk1)),growth_rate(efficient_producers,appear(efficient_producers,sk1))) ).
cnf(u298,axiom,
( decreases(difference(growth_rate(first_movers,X2),growth_rate(efficient_producers,X2)))
| environment(X0)
| greater_or_equal(X2,appear(efficient_producers,X0))
| greater(X1,X2)
| ~ in_environment(X0,X1)
| ~ greater(difference(growth_rate(first_movers,X2),growth_rate(efficient_producers,X2)),zero)
| greater(difference(growth_rate(first_movers,X1),growth_rate(efficient_producers,X1)),zero) ) ).
cnf(u141,negated_conjecture,
( greater(X0,critical_point(sk1))
| subpopulations(first_movers,efficient_producers,sk1,X0)
| ~ greater(growth_rate(efficient_producers,X0),growth_rate(first_movers,X0)) ) ).
cnf(u36,axiom,
( ~ subpopulations(first_movers,efficient_producers,X0,critical_point(X0))
| ~ in_environment(X0,critical_point(X0))
| environment(X0) ) ).
cnf(u64,axiom,
( ~ greater(appear(first_movers,X0),start_time(X0))
| start_time(X0) = appear(first_movers,X0)
| environment(X0) ) ).
cnf(u236,negated_conjecture,
( greater(appear(efficient_producers,sk1),X0)
| ~ in_environment(sk1,X1)
| greater_or_equal(X1,X0)
| greater_or_equal(X0,X2)
| ~ in_environment(sk1,X2) ) ).
cnf(u46,axiom,
( ~ greater_or_equal(appear(first_movers,X0),start_time(X0))
| environment(X0) ) ).
cnf(u74,negated_conjecture,
( subpopulations(first_movers,efficient_producers,sk1,X0)
| ~ subpopulations(efficient_producers,first_movers,sk1,X0) ) ).
cnf(u48,axiom,
( environment(X0)
| subpopulations(first_movers,efficient_producers,X0,X1)
| ~ greater_or_equal(X1,appear(efficient_producers,X0)) ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT034-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.39 % Computer : n026.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:57 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.18/0.46 % (3083461)Will run a generic schedule for satisfiability detection.
% 0.18/0.46 % (3083472)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3765647964:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.46 % (3083467)% WARNING: option uhcvi not known.
% 0.18/0.46 % (3083472) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3083461-3083472"...
% 0.18/0.46 % (3083472)...printing done.
% 0.18/0.46 % SZS status Satisfiable for theBenchmark
% 0.18/0.46 % SZS output start Saturation.
% See solution above
% 0.18/0.46 % SZS output start Definitions and Model Updates.
% 0.18/0.46 globally flip the polarity of every occurrence of predicate "greater_or_equal"
% 0.18/0.46 globally flip the polarity of every occurrence of predicate "decreases"
% 0.18/0.46 globally flip the polarity of every occurrence of predicate "selection_favors"
% 0.18/0.46 globally flip the polarity of every occurrence of predicate "greater"
% 0.18/0.46 globally flip the polarity of every occurrence of predicate "subpopulations"
% 0.18/0.46 globally flip the polarity of every occurrence of predicate "environment"
% 0.18/0.46 % SZS output end Definitions and Model Updates.
% 0.18/0.46 % (3083472)------------------------------
% 0.18/0.46 % (3083472)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.46 % (3083472)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.46 % (3083472)CaDiCaL version: 2.1.3
% 0.18/0.46 % (3083472)Termination reason: Satisfiable
% 0.18/0.46 % (3083472)Time elapsed: 0.005 s
% 0.18/0.46 % (3083472)Peak memory usage: 12 MB
% 0.18/0.46 % (3083472)Instructions burned: 9 (million)
% 0.18/0.46 % (3083461)Success in time 0.031 s
% 0.18/0.46 % Vampire exiting
%------------------------------------------------------------------------------