%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : MGT040+1 : 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 : CounterSatisfiable 0.10s 0.43s
% Output : Saturation 0.10s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(u77,negated_conjecture,
selection_favors(efficient_producers,first_movers,sK1) ).
cnf(u81,negated_conjecture,
environment(sK0(sK1)) ).
cnf(u87,negated_conjecture,
~ in_environment(sK1,sK0(sK1)) ).
cnf(u109,negated_conjecture,
~ in_environment(sK0(sK1),appear(an_organisation,sK0(sK1))) ).
cnf(u60,hypothesis,
( ~ greater(appear(efficient_producers,X0),X1)
| ~ greater_or_equal(X1,appear(first_movers,X0))
| ~ in_environment(X0,X1)
| ~ environment(X0)
| selection_favors(first_movers,efficient_producers,X1) ) ).
cnf(u59,axiom,
( greater(appear(efficient_producers,X0),X1)
| ~ in_environment(X0,X1)
| greater_or_equal(X1,appear(efficient_producers,X0)) ) ).
cnf(u71,axiom,
( ~ observational_period(X0)
| environment(sK0(X0))
| selection_favors(efficient_producers,first_movers,X0) ) ).
cnf(u53,axiom,
( greater(critical_point(X0),end_time(X0))
| ~ environment(X0)
| in_environment(X0,critical_point(X0)) ) ).
cnf(u48,axiom,
( ~ rapid_change(X0)
| ~ observational_period(X0)
| ~ in_environment(X0,X1)
| ~ environment(X1)
| ~ in_environment(X1,critical_point(X1)) ) ).
cnf(u66,negated_conjecture,
~ selection_favors(first_movers,efficient_producers,sK1) ).
cnf(u63,negated_conjecture,
~ extreme(sK1) ).
cnf(u58,axiom,
( greater(X0,X1)
| X0 = X1
| ~ greater_or_equal(X0,X1) ) ).
cnf(u121,axiom,
( ~ greater_or_equal(end_time(X0),appear(efficient_producers,X0))
| ~ environment(X0)
| in_environment(X0,critical_point(X0))
| selection_favors(first_movers,efficient_producers,end_time(X0)) ) ).
cnf(u52,axiom,
( ~ environment(X0)
| in_environment(X0,end_time(X0)) ) ).
cnf(u49,axiom,
( ~ empty(X1)
| ~ observational_period(X0)
| ~ in_environment(X0,X1)
| ~ environment(X1)
| extreme(X0) ) ).
cnf(u94,negated_conjecture,
( ~ environment(X0)
| ~ in_environment(sK1,X0)
| ~ in_environment(X0,critical_point(X0)) ) ).
cnf(u70,axiom,
( ~ observational_period(X0)
| in_environment(X0,sK0(X0))
| selection_favors(efficient_producers,first_movers,X0) ) ).
cnf(u51,axiom,
propagation_strategy(efficient_producers) ).
cnf(u62,hypothesis,
( ~ environment(X0)
| ~ in_environment(X0,appear(an_organisation,X0))
| appear(an_organisation,X0) = appear(first_movers,X0) ) ).
cnf(u72,axiom,
( ~ observational_period(X0)
| ~ selection_favors(efficient_producers,first_movers,end_time(sK0(X0)))
| selection_favors(efficient_producers,first_movers,X0) ) ).
cnf(u120,axiom,
( ~ greater_or_equal(X0,appear(efficient_producers,X1))
| ~ environment(X1)
| in_environment(X1,critical_point(X1))
| selection_favors(first_movers,efficient_producers,end_time(X1))
| critical_point(X1) = X0
| ~ greater_or_equal(critical_point(X1),X0) ) ).
cnf(u118,negated_conjecture,
( greater_or_equal(end_time(X0),appear(an_organisation,X0))
| ~ environment(X0)
| ~ in_environment(sK1,X0) ) ).
cnf(u55,axiom,
( ~ greater_or_equal(end_time(X0),appear(an_organisation,X0))
| ~ environment(X0)
| in_environment(X0,appear(an_organisation,X0)) ) ).
cnf(u65,negated_conjecture,
observational_period(sK1) ).
cnf(u50,axiom,
propagation_strategy(first_movers) ).
cnf(u123,negated_conjecture,
( ~ environment(X0)
| ~ in_environment(sK1,X0)
| in_environment(X0,appear(an_organisation,X0)) ) ).
cnf(u115,hypothesis,
( ~ greater_or_equal(X0,appear(efficient_producers,X1))
| ~ in_environment(X1,critical_point(X1))
| ~ environment(X1)
| selection_favors(first_movers,efficient_producers,X0)
| critical_point(X1) = X0
| ~ greater_or_equal(critical_point(X1),X0) ) ).
cnf(u64,negated_conjecture,
rapid_change(sK1) ).
cnf(u54,axiom,
( empty(X0)
| ~ environment(X0)
| greater_or_equal(end_time(X0),appear(an_organisation,X0)) ) ).
cnf(u61,hypothesis,
( ~ greater(critical_point(X0),X1)
| ~ greater_or_equal(X1,appear(efficient_producers,X0))
| ~ in_environment(X0,critical_point(X0))
| ~ environment(X0)
| selection_favors(first_movers,efficient_producers,X1) ) ).
cnf(u56,axiom,
( ~ greater(critical_point(X0),X1)
| ~ greater_or_equal(X1,appear(efficient_producers,X0))
| ~ environment(X0)
| in_environment(X0,critical_point(X0))
| selection_favors(first_movers,efficient_producers,end_time(X0)) ) ).
cnf(u113,hypothesis,
( ~ greater_or_equal(X0,appear(first_movers,X1))
| ~ in_environment(X1,X0)
| ~ environment(X1)
| selection_favors(first_movers,efficient_producers,X0)
| greater_or_equal(X0,appear(efficient_producers,X1)) ) ).
cnf(u112,hypothesis,
( ~ greater_or_equal(X0,appear(first_movers,X1))
| ~ greater_or_equal(appear(efficient_producers,X1),X0)
| ~ environment(X1)
| selection_favors(first_movers,efficient_producers,X0)
| appear(efficient_producers,X1) = X0
| ~ in_environment(X1,X0) ) ).
cnf(u83,negated_conjecture,
in_environment(sK0(sK1),end_time(sK0(sK1))) ).
cnf(u91,axiom,
( extreme(X0)
| ~ in_environment(X0,X1)
| ~ environment(X1)
| ~ observational_period(X0)
| greater_or_equal(end_time(X1),appear(an_organisation,X1)) ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT040+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.36 % Computer : n019.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 27 17:25:34 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40 Running first-order model finding
% 0.10/0.40 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.10/0.43 % (3293308)Will run a generic schedule for satisfiability detection.
% 0.10/0.43 % (3293317)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4098994368:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.43 % (3293317) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3293308-3293317"...
% 0.10/0.43 % (3293317)...printing done.
% 0.10/0.43 % SZS status CounterSatisfiable for theBenchmark
% 0.10/0.43 % SZS output start Saturation.
% See solution above
% 0.10/0.43 % SZS output start Definitions and Model Updates.
% 0.10/0.43 % SZS output end Definitions and Model Updates.
% 0.10/0.43 % (3293317)------------------------------
% 0.10/0.43 % (3293317)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.43 % (3293317)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.43 % (3293317)CaDiCaL version: 2.1.3
% 0.10/0.43 % (3293317)Termination reason: Satisfiable
% 0.10/0.43 % (3293317)Time elapsed: 0.002 s
% 0.10/0.43 % (3293317)Peak memory usage: 12 MB
% 0.10/0.43 % (3293317)Instructions burned: 3 (million)
% 0.10/0.43 % (3293308)Success in time 0.027 s
% 0.10/0.44 % Vampire exiting
%------------------------------------------------------------------------------