%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : MGT033-1 : 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 : n011.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:35 PM UTC 2026
% Result : Satisfiable 0.10s 0.44s
% Output : Saturation 0.10s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(u39,negated_conjecture,
in_environment(sk2,appear(an_organisation,sk2)) ).
cnf(u42,negated_conjecture,
in_environment(sk2,appear(first_movers,sk2)) ).
cnf(u50,negated_conjecture,
appear(first_movers,sk2) = appear(an_organisation,sk2) ).
cnf(u69,negated_conjecture,
zero != cardinality_at_time(efficient_producers,t) ).
cnf(u72,negated_conjecture,
greater(zero,zero) ).
cnf(u79,negated_conjecture,
( ~ subpopulation(X0,sk2,sk3)
| selection_favors(efficient_producers,X0,sk3)
| zero != cardinality_at_time(X0,sk3) ) ).
cnf(u104,negated_conjecture,
~ greater(appear(first_movers,sk2),sk3) ).
cnf(u114,negated_conjecture,
~ greater(appear(first_movers,sk2),start_time(sk2)) ).
cnf(u129,negated_conjecture,
~ greater(appear(first_movers,sk2),appear(first_movers,sk2)) ).
cnf(u138,negated_conjecture,
first_movers != sk1(sk3,sk2) ).
cnf(u143,negated_conjecture,
efficient_producers = sk1(sk3,sk2) ).
cnf(u163,negated_conjecture,
zero != cardinality_at_time(first_movers,sk3) ).
cnf(mp_subpopulations_33,axiom,
( ~ environment(X0)
| ~ in_environment(X0,X1)
| subpopulation(first_movers,X0,X1) ) ).
cnf(mp_positive_sum_means_members_26,axiom,
( ~ environment(X0)
| ~ greater(number_of_organizations(X0,X1),zero)
| subpopulation(sk1(X1,X0),X0,X1) ) ).
cnf(u52,negated_conjecture,
( ~ greater(number_of_organizations(sk2,X0),zero)
| greater(cardinality_at_time(sk1(X0,sk2),X0),zero) ) ).
cnf(u34,negated_conjecture,
subpopulation(efficient_producers,sk2,start_time(sk2)) ).
cnf(u32,negated_conjecture,
( ~ greater(number_of_organizations(sk2,X0),zero)
| in_environment(sk2,X0) ) ).
cnf(prove_t2_42,negated_conjecture,
greater(appear(efficient_producers,sk2),sk3) ).
cnf(u26,negated_conjecture,
in_environment(sk2,start_time(sk2)) ).
cnf(u117,negated_conjecture,
greater(number_of_organizations(sk2,sk3),zero) ).
cnf(u18,hypothesis,
( ~ environment(X0)
| ~ subpopulation(X1,X0,X2)
| ~ greater(cardinality_at_time(X1,X2),zero)
| efficient_producers = X1
| first_movers = X1 ) ).
cnf(u88,negated_conjecture,
subpopulation(efficient_producers,sk2,appear(first_movers,sk2)) ).
cnf(u87,negated_conjecture,
subpopulation(first_movers,sk2,appear(first_movers,sk2)) ).
cnf(u28,negated_conjecture,
( ~ in_environment(sk2,X0)
| subpopulation(first_movers,sk2,X0) ) ).
cnf(u30,negated_conjecture,
subpopulation(first_movers,sk2,start_time(sk2)) ).
cnf(u119,negated_conjecture,
subpopulation(sk1(sk3,sk2),sk2,sk3) ).
cnf(prove_t2_40,negated_conjecture,
in_environment(sk2,sk3) ).
cnf(a1_36,hypothesis,
( ~ environment(X0)
| ~ in_environment(X0,X1)
| ~ greater_or_equal(X1,appear(an_organisation,X0))
| greater(number_of_organizations(X0,X1),zero) ) ).
cnf(u57,negated_conjecture,
( ~ greater(cardinality_at_time(X0,X1),zero)
| ~ subpopulation(X2,sk2,X1)
| ~ subpopulation(X0,sk2,X1)
| zero != cardinality_at_time(X2,X1)
| selection_favors(X0,X2,X1) ) ).
cnf(u8,axiom,
( ~ greater(cardinality_at_time(X0,X1),zero)
| zero != cardinality_at_time(X0,t) ) ).
cnf(u59,negated_conjecture,
( ~ greater(appear(X0,sk2),start_time(sk2))
| zero = cardinality_at_time(X0,start_time(sk2)) ) ).
cnf(mp_durations_are_time_intervals_30,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(u20,hypothesis,
( ~ environment(X0)
| ~ in_environment(X0,appear(an_organisation,X0))
| appear(first_movers,X0) = appear(an_organisation,X0) ) ).
cnf(u2,axiom,
( ~ environment(X0)
| ~ subpopulation(X1,X0,X2)
| ~ subpopulation(X3,X0,X2)
| ~ greater(cardinality_at_time(X1,X2),zero)
| zero != cardinality_at_time(X3,X2)
| selection_favors(X1,X3,X2) ) ).
cnf(mp_no_FM_before_opening_32,axiom,
( ~ environment(X0)
| greater_or_equal(appear(first_movers,X0),start_time(X0)) ) ).
cnf(u53,negated_conjecture,
( ~ greater_or_equal(X0,appear(an_organisation,sk2))
| ~ in_environment(sk2,X0)
| greater(number_of_organizations(sk2,X0),zero) ) ).
cnf(mp_subpopulations_34,axiom,
( ~ environment(X0)
| ~ in_environment(X0,X1)
| subpopulation(efficient_producers,X0,X1) ) ).
cnf(u55,negated_conjecture,
( ~ greater(cardinality_at_time(X0,X1),zero)
| ~ subpopulation(X0,sk2,X1)
| efficient_producers = X0
| first_movers = X0 ) ).
cnf(u174,negated_conjecture,
selection_favors(efficient_producers,efficient_producers,sk3) ).
cnf(mp_positive_sum_means_members_27,axiom,
( ~ environment(X0)
| ~ greater(number_of_organizations(X0,X1),zero)
| greater(cardinality_at_time(sk1(X1,X0),X1),zero) ) ).
cnf(u133,negated_conjecture,
zero != cardinality_at_time(sk1(sk3,sk2),t) ).
cnf(u135,negated_conjecture,
( ~ subpopulation(X0,sk2,sk3)
| zero != cardinality_at_time(X0,sk3)
| selection_favors(sk1(sk3,sk2),X0,sk3) ) ).
cnf(u182,negated_conjecture,
first_movers != efficient_producers ).
cnf(u4,axiom,
( ~ environment(X0)
| ~ in_environment(X0,X1)
| ~ greater(appear(X2,X0),X1)
| zero = cardinality_at_time(X2,X1) ) ).
cnf(u45,negated_conjecture,
( ~ greater(number_of_organizations(sk2,X0),zero)
| subpopulation(sk1(X0,sk2),sk2,X0) ) ).
cnf(u118,negated_conjecture,
greater(cardinality_at_time(sk1(sk3,sk2),sk3),zero) ).
cnf(u33,negated_conjecture,
subpopulation(efficient_producers,sk2,sk3) ).
cnf(u31,negated_conjecture,
( ~ in_environment(sk2,X0)
| subpopulation(efficient_producers,sk2,X0) ) ).
cnf(u95,negated_conjecture,
( ~ greater_or_equal(X0,appear(first_movers,sk2))
| ~ in_environment(sk2,X0)
| greater(number_of_organizations(sk2,X0),zero) ) ).
cnf(prove_t2_43,negated_conjecture,
~ selection_favors(first_movers,efficient_producers,sk3) ).
cnf(u27,negated_conjecture,
greater_or_equal(appear(first_movers,sk2),start_time(sk2)) ).
cnf(u56,negated_conjecture,
( ~ greater_or_equal(X1,X2)
| ~ in_environment(sk2,X1)
| ~ in_environment(sk2,X0)
| ~ greater_or_equal(X2,X0)
| in_environment(sk2,X2) ) ).
cnf(u29,negated_conjecture,
subpopulation(first_movers,sk2,sk3) ).
cnf(u58,negated_conjecture,
( ~ greater(appear(X0,sk2),sk3)
| zero = cardinality_at_time(X0,sk3) ) ).
cnf(prove_t2_39,negated_conjecture,
environment(sk2) ).
cnf(prove_t2_41,negated_conjecture,
greater_or_equal(sk3,appear(first_movers,sk2)) ).
cnf(u60,negated_conjecture,
zero = cardinality_at_time(efficient_producers,sk3) ).
cnf(mp_FM_means_organisations_35,axiom,
( ~ environment(X0)
| ~ in_environment(X0,appear(first_movers,X0))
| in_environment(X0,appear(an_organisation,X0)) ) ).
cnf(mp_positive_and_sustains_29,axiom,
( ~ environment(X0)
| ~ greater(number_of_organizations(X0,X1),zero)
| in_environment(X0,X1) ) ).
cnf(u54,negated_conjecture,
( ~ in_environment(sk2,X0)
| ~ greater(appear(X1,sk2),X0)
| zero = cardinality_at_time(X1,X0) ) ).
cnf(mp_opening_time_in_duration_31,axiom,
( ~ environment(X0)
| in_environment(X0,start_time(X0)) ) ).
cnf(u90,negated_conjecture,
( ~ greater(appear(X0,sk2),appear(first_movers,sk2))
| zero = cardinality_at_time(X0,appear(first_movers,sk2)) ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT033-1 : 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.37 % Computer : n011.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 27 17:21:01 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40 Running first-order model finding
% 0.10/0.40 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.10/0.44 % (2638946)Will run a generic schedule for satisfiability detection.
% 0.10/0.44 % (2638956)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1147626872:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.10/0.44 % (2638956) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2638946-2638956"...
% 0.10/0.44 % (2638956)...printing done.
% 0.10/0.44 % SZS status Satisfiable for theBenchmark
% 0.10/0.44 % SZS output start Saturation.
% See solution above
% 0.10/0.44 % SZS output start Definitions and Model Updates.
% 0.10/0.44 % SZS output end Definitions and Model Updates.
% 0.10/0.44 % (2638956)------------------------------
% 0.10/0.44 % (2638956)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.44 % (2638956)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.44 % (2638956)CaDiCaL version: 2.1.3
% 0.10/0.44 % (2638956)Termination reason: Satisfiable
% 0.10/0.44 % (2638956)Time elapsed: 0.003 s
% 0.10/0.44 % (2638956)Peak memory usage: 11 MB
% 0.10/0.44 % (2638956)Instructions burned: 5 (million)
% 0.10/0.44 % (2638946)Success in time 0.028 s
% 0.10/0.44 % Vampire exiting
%------------------------------------------------------------------------------