TSTP Solution File: MGT034-1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : MGT034-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n006.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Aug 31 17:51:29 EDT 2022
% Result : Satisfiable 1.28s 0.51s
% Output : Saturation 1.28s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(u51,negated_conjecture,
start_time(sk1) = appear(first_movers,sk1) ).
cnf(u56,negated_conjecture,
greater(sk2,sF1) ).
cnf(u78,negated_conjecture,
greater(sF0,sF1) ).
cnf(u90,negated_conjecture,
~ in_environment(sk1,sF1) ).
cnf(u120,negated_conjecture,
~ greater_or_equal(sF1,sF0) ).
cnf(u129,negated_conjecture,
~ greater_or_equal(sk2,sF0) ).
cnf(u134,negated_conjecture,
~ decreases(difference(disbanding_rate(first_movers,sF0),disbanding_rate(efficient_producers,sF0))) ).
cnf(u139,negated_conjecture,
decreases(difference(growth_rate(first_movers,sF0),growth_rate(efficient_producers,sF0))) ).
cnf(u146,negated_conjecture,
~ greater(zero,difference(growth_rate(first_movers,sF0),growth_rate(efficient_producers,sF0))) ).
cnf(u151,negated_conjecture,
greater_or_equal(difference(growth_rate(first_movers,sF0),growth_rate(efficient_producers,sF0)),zero) ).
cnf(u164,negated_conjecture,
~ greater(difference(growth_rate(first_movers,sF0),growth_rate(efficient_producers,sF0)),zero) ).
cnf(u169,negated_conjecture,
zero = difference(growth_rate(first_movers,sF0),growth_rate(efficient_producers,sF0)) ).
cnf(u73,negated_conjecture,
greater_or_equal(sF0,sF1) ).
cnf(u37,negated_conjecture,
greater_or_equal(sF0,sk2) ).
cnf(u36,negated_conjecture,
greater_or_equal(sk2,sF1) ).
cnf(u31,axiom,
greater_or_equal(X1,X1) ).
cnf(u113,negated_conjecture,
( ~ greater_or_equal(sF0,X0)
| ~ greater_or_equal(X0,sF0)
| subpopulations(first_movers,efficient_producers,sk1,X0) ) ).
cnf(u103,negated_conjecture,
( ~ greater_or_equal(start_time(sk1),X1)
| ~ greater_or_equal(X1,sF0)
| in_environment(sk1,X1) ) ).
cnf(mp_decreasing_function_35,axiom,
( ~ greater_or_equal(difference(growth_rate(first_movers,X1),growth_rate(efficient_producers,X1)),zero)
| ~ greater(X1,X2)
| ~ in_environment(X0,X1)
| ~ environment(X0)
| ~ greater_or_equal(X2,appear(efficient_producers,X0))
| greater(difference(growth_rate(first_movers,X2),growth_rate(efficient_producers,X2)),zero)
| ~ decreases(difference(growth_rate(first_movers,X2),growth_rate(efficient_producers,X2))) ) ).
cnf(u100,negated_conjecture,
( ~ greater_or_equal(X2,start_time(sk1))
| in_environment(sk1,X2)
| ~ in_environment(sk1,X3)
| ~ greater_or_equal(X3,X2) ) ).
cnf(u102,negated_conjecture,
( ~ greater_or_equal(X0,sF0)
| ~ greater_or_equal(sF0,X0)
| in_environment(sk1,X0) ) ).
cnf(mp_greater_or_equal_46,axiom,
( ~ greater_or_equal(X0,X1)
| X0 = X1
| greater(X0,X1) ) ).
cnf(u38,negated_conjecture,
in_environment(sk1,start_time(sk1)) ).
cnf(u33,negated_conjecture,
in_environment(sk1,sF0) ).
cnf(u101,negated_conjecture,
( ~ in_environment(sk1,X1)
| ~ greater_or_equal(X0,sF0)
| ~ greater_or_equal(X1,X0)
| in_environment(sk1,X0) ) ).
cnf(mp_durations_are_time_intervals_41,axiom,
( ~ in_environment(X0,X1)
| in_environment(X0,X3)
| ~ greater_or_equal(X3,X1)
| ~ environment(X0)
| ~ greater_or_equal(X2,X3)
| ~ in_environment(X0,X2) ) ).
cnf(mp_FM_and_EP_when_EP_appears_34,axiom,
( ~ in_environment(X0,appear(efficient_producers,X0))
| subpopulations(first_movers,efficient_producers,X0,appear(efficient_producers,X0))
| ~ environment(X0) ) ).
cnf(mp_critical_point_means_FM_and_EP_33,axiom,
( ~ in_environment(X0,critical_point(X0))
| ~ environment(X0)
| subpopulations(first_movers,efficient_producers,X0,critical_point(X0)) ) ).
cnf(u187,negated_conjecture,
decreases(zero) ).
cnf(u97,negated_conjecture,
decreases(difference(founding_rate(first_movers,sF0),founding_rate(efficient_producers,sF0))) ).
cnf(u160,negated_conjecture,
( ~ decreases(difference(growth_rate(first_movers,X0),growth_rate(efficient_producers,X0)))
| ~ environment(X1)
| ~ in_environment(X1,sF0)
| ~ greater(sF0,X0)
| ~ greater_or_equal(X0,appear(efficient_producers,X1))
| greater(difference(growth_rate(first_movers,X0),growth_rate(efficient_producers,X0)),zero) ) ).
cnf(mp_difference_between_founding_rates_36,axiom,
( ~ decreases(difference(founding_rate(first_movers,X0),founding_rate(efficient_producers,X0)))
| decreases(difference(growth_rate(first_movers,X0),growth_rate(efficient_producers,X0)))
| decreases(difference(disbanding_rate(first_movers,X0),disbanding_rate(efficient_producers,X0))) ) ).
cnf(l3_32,axiom,
( ~ decreases(difference(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1)))
| ~ environment(X0)
| ~ subpopulations(first_movers,efficient_producers,X0,X1) ) ).
cnf(prove_t3_58,negated_conjecture,
~ selection_favors(first_movers,efficient_producers,sk2) ).
cnf(u34,negated_conjecture,
greater(sF0,sk2) ).
cnf(u107,negated_conjecture,
~ greater(sF0,sF0) ).
cnf(u185,negated_conjecture,
~ greater(zero,zero) ).
cnf(mp_negative_growth_rate_difference_37,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(mp_positive_growth_rate_difference_39,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(mp1_high_growth_rates_31,axiom,
( ~ greater(growth_rate(X2,X3),growth_rate(X1,X3))
| ~ subpopulations(X1,X2,X0,X3)
| selection_favors(X2,X1,X3)
| ~ environment(X0) ) ).
cnf(mp_positive_growth_rate_difference_40,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(mp_negative_growth_rate_difference_38,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(u65,negated_conjecture,
~ greater(growth_rate(efficient_producers,sF0),growth_rate(first_movers,sF0)) ).
cnf(u29,hypothesis,
( ~ greater(growth_rate(efficient_producers,critical_point(X0)),growth_rate(first_movers,critical_point(X0)))
| ~ environment(X0) ) ).
cnf(mp_greater_or_equal_47,axiom,
( ~ greater(X0,X1)
| greater_or_equal(X0,X1) ) ).
cnf(u70,negated_conjecture,
subpopulations(efficient_producers,first_movers,sk1,sF0) ).
cnf(u68,negated_conjecture,
subpopulations(first_movers,efficient_producers,sk1,sF0) ).
cnf(u109,negated_conjecture,
( ~ subpopulations(first_movers,efficient_producers,sk1,X0)
| ~ greater_or_equal(X1,X0)
| ~ greater_or_equal(sF0,X1)
| subpopulations(first_movers,efficient_producers,sk1,X1) ) ).
cnf(mp_symmetry_of_FM_and_EP_44,axiom,
( ~ subpopulations(first_movers,efficient_producers,X0,X1)
| subpopulations(efficient_producers,first_movers,X0,X1)
| ~ environment(X0) ) ).
cnf(mp_FM_and_EP_members_EP_appeared_45,axiom,
( ~ subpopulations(first_movers,efficient_producers,X0,X1)
| ~ environment(X0)
| greater_or_equal(X1,appear(efficient_producers,X0)) ) ).
cnf(a11_53,hypothesis,
( ~ subpopulations(first_movers,efficient_producers,X0,X1)
| decreases(difference(founding_rate(first_movers,X1),founding_rate(efficient_producers,X1)))
| ~ environment(X0) ) ).
cnf(u30,hypothesis,
( ~ subpopulations(first_movers,efficient_producers,X0,X2)
| ~ environment(X0)
| ~ greater(X2,critical_point(X0))
| greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2)) ) ).
cnf(a10_50,hypothesis,
( ~ subpopulations(first_movers,efficient_producers,X0,X2)
| ~ subpopulations(first_movers,efficient_producers,X0,X1)
| ~ greater_or_equal(X3,X1)
| ~ greater_or_equal(X2,X3)
| subpopulations(first_movers,efficient_producers,X0,X3)
| ~ environment(X0) ) ).
cnf(mp_relationship_of_growth_rates_49,axiom,
( ~ subpopulations(first_movers,efficient_producers,X0,X1)
| greater_or_equal(difference(growth_rate(first_movers,X1),growth_rate(efficient_producers,X1)),zero)
| greater(zero,difference(growth_rate(first_movers,X1),growth_rate(efficient_producers,X1)))
| ~ environment(X0) ) ).
cnf(prove_t3_54,negated_conjecture,
environment(sk1) ).
cnf(mp_opening_time_in_duration_42,axiom,
( ~ environment(X0)
| in_environment(X0,start_time(X0)) ) ).
cnf(mp_no_FM_before_opening_43,axiom,
( ~ environment(X0)
| greater_or_equal(appear(first_movers,X0),start_time(X0)) ) ).
cnf(u35,axiom,
appear(efficient_producers,sk1) = sF1 ).
cnf(u32,axiom,
critical_point(sk1) = sF0 ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT034-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.14/0.34 % Computer : n006.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Aug 30 03:15:40 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.49 % (30349)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.20/0.49 % (30352)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.50 TRYING [1]
% 0.20/0.50 % (30365)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.50 % (30368)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.51 % (30353)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.51 % (30355)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.28/0.51 TRYING [2]
% 1.28/0.51 % (30371)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 1.28/0.51 % (30353)First to succeed.
% 1.28/0.51 Finite Model Found!
% 1.28/0.51 % SZS status Satisfiable for theBenchmark
% 1.28/0.51 % (30349)Also succeeded, but the first one will report.
% 1.28/0.51 % SZS status Satisfiable for theBenchmark
% 1.28/0.51 % (30353)# SZS output start Saturation.
% See solution above
% 1.28/0.51 % (30353)------------------------------
% 1.28/0.51 % (30353)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.28/0.51 % (30353)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.28/0.51 % (30353)Termination reason: Satisfiable
% 1.28/0.51
% 1.28/0.51 % (30353)Memory used [KB]: 5500
% 1.28/0.51 % (30353)Time elapsed: 0.119 s
% 1.28/0.51 % (30353)Instructions burned: 6 (million)
% 1.28/0.51 % (30353)------------------------------
% 1.28/0.51 % (30353)------------------------------
% 1.28/0.51 % (30345)Success in time 0.169 s
%------------------------------------------------------------------------------