TSTP Solution File: MGT040-1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : MGT040-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n018.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 : Tue May 21 00:43:40 EDT 2024
% Result : Satisfiable 0.13s 0.37s
% Output : Saturation 0.13s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(u33,negated_conjecture,
( ~ greater_or_equal(sk2,appear(first_movers,X0))
| critical_point(X0) = sk2
| ~ greater_or_equal(critical_point(X0),sk2)
| ~ in_environment(X0,sk2)
| ~ environment(X0)
| selection_favors(first_movers,efficient_producers,sk2)
| ~ in_environment(X0,critical_point(X0)) ) ).
cnf(u30,negated_conjecture,
( ~ greater_or_equal(sk2,appear(efficient_producers,X0))
| ~ environment(X0)
| ~ in_environment(X0,critical_point(X0))
| critical_point(X0) = sk2
| ~ greater_or_equal(critical_point(X0),sk2) ) ).
cnf(u23,negated_conjecture,
( ~ empty(X0)
| ~ environment(X0)
| ~ observational_period(sk2)
| ~ in_environment(sk2,X0) ) ).
cnf(mp_selection_favours_in_time_34,axiom,
( selection_favors(first_movers,efficient_producers,end_time(X0))
| ~ greater(critical_point(X0),X1)
| in_environment(X0,critical_point(X0))
| ~ greater_or_equal(X1,appear(efficient_producers,X0))
| ~ environment(X0) ) ).
cnf(mp6_not_extreme_change_means_not_empty_27,axiom,
( extreme(X0)
| ~ observational_period(X0)
| ~ environment(X1)
| ~ empty(X1)
| ~ in_environment(X0,X1) ) ).
cnf(t3_39,hypothesis,
( selection_favors(first_movers,efficient_producers,X1)
| ~ greater(critical_point(X0),X1)
| ~ in_environment(X0,critical_point(X0))
| ~ environment(X0)
| ~ greater_or_equal(X1,appear(efficient_producers,X0)) ) ).
cnf(mp_greater_or_equal_36,axiom,
( greater(X0,X1)
| X0 = X1
| ~ greater_or_equal(X0,X1) ) ).
cnf(mp_organizational_sets2_29,axiom,
propagation_strategy(efficient_producers) ).
cnf(prove_t9_41,negated_conjecture,
observational_period(sk2) ).
cnf(mp_endpoint_in_environment_30,axiom,
( in_environment(X0,end_time(X0))
| ~ environment(X0) ) ).
cnf(mp3_favoured_trategy_23,axiom,
( selection_favors(efficient_producers,first_movers,X0)
| ~ propagation_strategy(efficient_producers)
| ~ observational_period(X0)
| environment(sk1(X0))
| ~ propagation_strategy(first_movers) ) ).
cnf(u36,hypothesis,
( ~ greater_or_equal(appear(efficient_producers,X1),appear(first_movers,X0))
| ~ greater_or_equal(appear(efficient_producers,X0),appear(first_movers,X1))
| appear(efficient_producers,X0) = appear(efficient_producers,X1)
| ~ in_environment(X1,appear(efficient_producers,X0))
| ~ in_environment(X0,appear(efficient_producers,X1))
| ~ environment(X1)
| selection_favors(first_movers,efficient_producers,appear(efficient_producers,X1))
| selection_favors(first_movers,efficient_producers,appear(efficient_producers,X0))
| ~ environment(X0) ) ).
cnf(u29,negated_conjecture,
( ~ greater(critical_point(X0),sk2)
| ~ in_environment(X0,critical_point(X0))
| ~ environment(X0)
| ~ greater_or_equal(sk2,appear(efficient_producers,X0)) ) ).
cnf(mp_non_empty_means_organisations_32,axiom,
( greater_or_equal(end_time(X0),appear(an_organisation,X0))
| empty(X0)
| ~ environment(X0) ) ).
cnf(mp3_favoured_trategy_25,axiom,
( selection_favors(efficient_producers,first_movers,X0)
| ~ propagation_strategy(efficient_producers)
| ~ observational_period(X0)
| ~ propagation_strategy(first_movers)
| ~ selection_favors(efficient_producers,first_movers,end_time(sk1(X0))) ) ).
cnf(u31,negated_conjecture,
( greater(appear(efficient_producers,X0),sk2)
| ~ in_environment(X0,critical_point(X0))
| critical_point(X0) = sk2
| ~ greater_or_equal(critical_point(X0),sk2)
| ~ in_environment(X0,sk2)
| ~ environment(X0) ) ).
cnf(prove_t9_42,negated_conjecture,
rapid_change(sk2) ).
cnf(u25,negated_conjecture,
( ~ environment(X0)
| ~ in_environment(sk2,X0)
| ~ in_environment(X0,critical_point(X0)) ) ).
cnf(prove_t9_44,negated_conjecture,
~ selection_favors(first_movers,efficient_producers,sk2) ).
cnf(mp_appearance_of_EP_37,axiom,
( greater_or_equal(X1,appear(efficient_producers,X0))
| ~ in_environment(X0,X1)
| greater(appear(efficient_producers,X0),X1) ) ).
cnf(u34,hypothesis,
( greater(appear(efficient_producers,X1),appear(efficient_producers,X0))
| selection_favors(first_movers,efficient_producers,appear(efficient_producers,X1))
| ~ environment(X0)
| appear(efficient_producers,X0) = appear(efficient_producers,X1)
| ~ in_environment(X0,appear(efficient_producers,X1))
| ~ in_environment(X1,appear(efficient_producers,X0))
| ~ greater_or_equal(appear(efficient_producers,X1),appear(first_movers,X0)) ) ).
cnf(mp5_rapid_change_is_non_critical_26,axiom,
( ~ rapid_change(X0)
| ~ observational_period(X0)
| ~ environment(X1)
| ~ in_environment(X0,X1)
| ~ in_environment(X1,critical_point(X1)) ) ).
cnf(u27,axiom,
( in_environment(X0,appear(an_organisation,X0))
| ~ environment(X0)
| empty(X0) ) ).
cnf(t2_38,hypothesis,
( ~ greater(appear(efficient_producers,X0),X1)
| ~ in_environment(X0,X1)
| selection_favors(first_movers,efficient_producers,X1)
| ~ greater_or_equal(X1,appear(first_movers,X0))
| ~ environment(X0) ) ).
cnf(mp_critical_point_not_before_opening_31,axiom,
( greater(critical_point(X0),end_time(X0))
| in_environment(X0,critical_point(X0))
| ~ environment(X0) ) ).
cnf(mp_organizational_sets1_28,axiom,
propagation_strategy(first_movers) ).
cnf(l13_40,hypothesis,
( ~ environment(X0)
| ~ in_environment(X0,appear(an_organisation,X0))
| appear(an_organisation,X0) = appear(first_movers,X0) ) ).
cnf(mp_appearance_before_end_holds_33,axiom,
( ~ greater_or_equal(end_time(X0),appear(an_organisation,X0))
| in_environment(X0,appear(an_organisation,X0))
| ~ environment(X0) ) ).
cnf(u28,hypothesis,
( ~ greater_or_equal(appear(efficient_producers,X0),X1)
| ~ greater_or_equal(X1,appear(first_movers,X0))
| selection_favors(first_movers,efficient_producers,X1)
| ~ environment(X0)
| appear(efficient_producers,X0) = X1
| ~ in_environment(X0,X1) ) ).
cnf(prove_t9_43,negated_conjecture,
~ extreme(sk2) ).
cnf(mp3_favoured_trategy_24,axiom,
( in_environment(X0,sk1(X0))
| ~ propagation_strategy(efficient_producers)
| ~ observational_period(X0)
| ~ propagation_strategy(first_movers)
| selection_favors(efficient_producers,first_movers,X0) ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT040-1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.33 % Computer : n018.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 00:07:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 % (31282)Running in auto input_syntax mode. Trying TPTP
% 0.13/0.36 % (31288)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.13/0.36 % (31287)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.13/0.37 % (31283)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.13/0.37 % (31289)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.13/0.37 % (31288)First to succeed.
% 0.13/0.37 % (31288)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-31282"
% 0.13/0.37 % (31285)WARNING: value z3 for option sas not known
% 0.13/0.37 TRYING [1]
% 0.13/0.37 % SZS status Satisfiable for theBenchmark
% 0.13/0.37 % (31288)# SZS output start Saturation.
% See solution above
% 0.13/0.37 % (31288)------------------------------
% 0.13/0.37 % (31288)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.13/0.37 % (31288)Termination reason: Satisfiable
% 0.13/0.37
% 0.13/0.37 % (31288)Memory used [KB]: 776
% 0.13/0.37 % (31288)Time elapsed: 0.008 s
% 0.13/0.37 % (31288)Instructions burned: 4 (million)
% 0.13/0.37 % (31282)Success in time 0.025 s
%------------------------------------------------------------------------------