TSTP Solution File: MGT031-1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : MGT031-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 : n022.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:28 EDT 2022
% Result : Satisfiable 0.20s 0.52s
% Output : Saturation 0.20s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(u85,negated_conjecture,
~ environment(e) ).
cnf(u30,negated_conjecture,
greater_or_equal(sF1,sF0) ).
cnf(u46,axiom,
( greater_or_equal(cardinality_at_time(sk1(X4,X3),X4),zero)
| ~ environment(X3)
| ~ greater(number_of_organizations(X3,X4),zero) ) ).
cnf(u44,negated_conjecture,
greater_or_equal(number_of_organizations(e,sF0),zero) ).
cnf(u24,axiom,
( greater_or_equal(number_of_organizations(e,appear(an_organisation,X0)),zero)
| ~ environment(X0) ) ).
cnf(u70,negated_conjecture,
greater_or_equal(appear(efficient_producers,e),sF0) ).
cnf(u42,negated_conjecture,
greater_or_equal(appear(efficient_producers,e),sF1) ).
cnf(u99,hypothesis,
( greater_or_equal(appear(efficient_producers,e),appear(an_organisation,X2))
| ~ environment(X2)
| appear(first_movers,X2) = appear(an_organisation,X2) ) ).
cnf(u21,hypothesis,
( greater_or_equal(appear(efficient_producers,e),appear(first_movers,X0))
| ~ environment(X0) ) ).
cnf(mp_FM_not_precede_first_25,axiom,
( greater_or_equal(appear(first_movers,X0),appear(an_organisation,X0))
| ~ environment(X0) ) ).
cnf(u16,axiom,
greater_or_equal(X1,X1) ).
cnf(mp_greater_or_equal_27,axiom,
( ~ greater_or_equal(X0,X1)
| X0 = X1
| greater(X0,X1) ) ).
cnf(u20,negated_conjecture,
in_environment(sk2,sF0) ).
cnf(mp_number_mean_non_empty_21,axiom,
( subpopulation(sk1(X1,X0),X0,X1)
| ~ greater(number_of_organizations(X0,X1),zero)
| ~ environment(X0) ) ).
cnf(u47,hypothesis,
( ~ subpopulation(sk1(X1,X2),X0,X1)
| ~ greater(number_of_organizations(X2,X1),zero)
| efficient_producers = sk1(X1,X2)
| ~ environment(X2)
| ~ environment(X0)
| first_movers = sk1(X1,X2) ) ).
cnf(u38,negated_conjecture,
greater(sF1,sF0) ).
cnf(mp_number_mean_non_empty_22,axiom,
( greater(cardinality_at_time(sk1(X1,X0),X1),zero)
| ~ environment(X0)
| ~ greater(number_of_organizations(X0,X1),zero) ) ).
cnf(u26,negated_conjecture,
greater(number_of_organizations(e,sF0),zero) ).
cnf(mp_positive_number_when_appear_20,axiom,
( greater(number_of_organizations(e,appear(an_organisation,X0)),zero)
| ~ environment(X0) ) ).
cnf(u36,axiom,
( greater(appear(first_movers,X1),appear(an_organisation,X1))
| appear(first_movers,X1) = appear(an_organisation,X1)
| ~ environment(X1) ) ).
cnf(u56,negated_conjecture,
greater(appear(efficient_producers,e),sF0) ).
cnf(u23,negated_conjecture,
greater(appear(efficient_producers,e),sF1) ).
cnf(u93,hypothesis,
( greater(appear(efficient_producers,e),appear(an_organisation,X0))
| ~ environment(X0)
| appear(an_organisation,X0) = appear(first_movers,X0) ) ).
cnf(a13_31,hypothesis,
( greater(appear(efficient_producers,e),appear(first_movers,X0))
| ~ environment(X0) ) ).
cnf(u68,hypothesis,
( ~ greater(number_of_organizations(X0,X1),zero)
| ~ environment(X0)
| sk1(X1,X0) = efficient_producers
| sk1(X1,X0) = first_movers ) ).
cnf(a9_30,hypothesis,
( ~ greater(cardinality_at_time(X1,X2),zero)
| ~ environment(X0)
| first_movers = X1
| ~ subpopulation(X1,X0,X2)
| efficient_producers = X1 ) ).
cnf(mp_no_FM_before_appearance_24,axiom,
( ~ greater(cardinality_at_time(first_movers,X1),zero)
| ~ environment(X0)
| ~ in_environment(X0,X1)
| ~ greater(appear(first_movers,X0),X1) ) ).
cnf(mp_no_EP_before_appearance_23,axiom,
( ~ greater(cardinality_at_time(efficient_producers,X1),zero)
| ~ greater(appear(efficient_producers,X0),X1)
| ~ environment(X0)
| ~ in_environment(X0,X1) ) ).
cnf(u39,negated_conjecture,
( ~ greater(X0,sF1)
| greater(X0,sF0) ) ).
cnf(u45,axiom,
( ~ greater(X2,cardinality_at_time(sk1(X1,X0),X1))
| greater(X2,zero)
| ~ greater(number_of_organizations(X0,X1),zero)
| ~ environment(X0) ) ).
cnf(u43,negated_conjecture,
( ~ greater(X0,number_of_organizations(e,sF0))
| greater(X0,zero) ) ).
cnf(u34,axiom,
( ~ greater(X2,number_of_organizations(e,appear(an_organisation,X3)))
| ~ environment(X3)
| greater(X2,zero) ) ).
cnf(u57,axiom,
( ~ greater(X1,appear(first_movers,X0))
| ~ environment(X0)
| appear(an_organisation,X0) = appear(first_movers,X0)
| greater(X1,appear(an_organisation,X0)) ) ).
cnf(u33,hypothesis,
( ~ greater(X0,appear(efficient_producers,e))
| greater(X0,appear(first_movers,X1))
| ~ environment(X1) ) ).
cnf(u41,negated_conjecture,
( ~ greater(X0,appear(efficient_producers,e))
| greater(X0,sF1) ) ).
cnf(u69,negated_conjecture,
( ~ greater(X0,appear(efficient_producers,e))
| greater(X0,sF0) ) ).
cnf(u98,hypothesis,
( ~ greater(X1,appear(efficient_producers,e))
| appear(an_organisation,X0) = appear(first_movers,X0)
| ~ environment(X0)
| greater(X1,appear(an_organisation,X0)) ) ).
cnf(mp_greater_or_equal_28,axiom,
( ~ greater(X0,X1)
| greater_or_equal(X0,X1) ) ).
cnf(mp_greater_transitivity_26,axiom,
( ~ greater(X1,X2)
| greater(X0,X2)
| ~ greater(X0,X1) ) ).
cnf(prove_l13_32,negated_conjecture,
environment(sk2) ).
cnf(u18,axiom,
appear(first_movers,sk2) = sF1 ).
cnf(u17,axiom,
appear(an_organisation,sk2) = sF0 ).
cnf(u19,negated_conjecture,
sF1 != sF0 ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT031-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.13/0.34 % Computer : n022.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 30 03:16:56 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.51 % (20066)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.20/0.51 % (20048)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)
% 0.20/0.52 % (20066)First to succeed.
% 0.20/0.52 TRYING [1]
% 0.20/0.52 TRYING [2]
% 0.20/0.52 Finite Model Found!
% 0.20/0.52 % (20056)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.20/0.52 % (20071)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 0.20/0.52 % SZS status Satisfiable for theBenchmark
% 0.20/0.52 % (20066)# SZS output start Saturation.
% See solution above
% 0.20/0.52 % (20066)------------------------------
% 0.20/0.52 % (20066)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (20066)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (20066)Termination reason: Satisfiable
% 0.20/0.52
% 0.20/0.52 % (20066)Memory used [KB]: 5500
% 0.20/0.52 % (20066)Time elapsed: 0.127 s
% 0.20/0.52 % (20066)Instructions burned: 3 (million)
% 0.20/0.52 % (20066)------------------------------
% 0.20/0.52 % (20066)------------------------------
% 0.20/0.52 % (20041)Success in time 0.172 s
%------------------------------------------------------------------------------