TSTP Solution File: MGT033+2 by Mace4---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Mace4---1109a
% Problem : MGT033+2 : TPTP v6.4.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : mace4 -t %d -f %s
% Computer : n011.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 32218.75MB
% OS : Linux 3.10.0-327.36.3.el7.x86_64
% CPULimit : 300s
% DateTime : Wed Feb 8 09:58:57 EST 2017
% Result : CounterSatisfiable 0.43s
% Output : FiniteModel 0.43s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT033+2 : TPTP v6.4.0. Released v2.0.0.
% 0.00/0.04 % Command : mace4 -t %d -f %s
% 0.02/0.23 % Computer : n011.star.cs.uiowa.edu
% 0.02/0.23 % Model : x86_64 x86_64
% 0.02/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.23 % Memory : 32218.75MB
% 0.02/0.23 % OS : Linux 3.10.0-327.36.3.el7.x86_64
% 0.02/0.23 % CPULimit : 300
% 0.02/0.23 % DateTime : Tue Feb 7 19:47:00 CST 2017
% 0.02/0.23 % CPUTime :
% 0.43/0.63 % SZS status CounterSatisfiable
% 0.43/0.63 ============================== Mace4 =================================
% 0.43/0.63 Mace4 (32) version 2009-11A, November 2009.
% 0.43/0.63 Process 25487 was started by sandbox on n011.star.cs.uiowa.edu,
% 0.43/0.63 Tue Feb 7 19:47:01 2017
% 0.43/0.63 The command was "/export/starexec/sandbox/solver/bin/mace4 -t 300 -f /tmp/Mace4_input_25423_n011.star.cs.uiowa.edu".
% 0.43/0.63 ============================== end of head ===========================
% 0.43/0.63
% 0.43/0.63 ============================== INPUT =================================
% 0.43/0.63
% 0.43/0.63 % Reading from file /tmp/Mace4_input_25423_n011.star.cs.uiowa.edu
% 0.43/0.63
% 0.43/0.63 set(prolog_style_variables).
% 0.43/0.63 set(print_models_tabular).
% 0.43/0.63 % set(print_models_tabular) -> clear(print_models).
% 0.43/0.63
% 0.43/0.63 formulas(sos).
% 0.43/0.63 (all E all S1 all S2 all T (environment(E) & subpopulation(S1,E,T) & subpopulation(S2,E,T) & greater(cardinality_at_time(S1,T),zero) & cardinality_at_time(S2,T) = zero -> selection_favors(S1,S2,T))) # label(mp2_favour_members) # label(axiom).
% 0.43/0.63 (all E all T (environment(E) & greater(number_of_organizations(E,T),zero) -> (exists S (subpopulation(S,E,T) & greater(cardinality_at_time(S,T),zero))))) # label(mp_number_mean_non_empty) # label(axiom).
% 0.43/0.63 (all X all T (cardinality_at_time(X,t) = zero -> -greater(cardinality_at_time(X,T),zero))) # label(mp_zero_is_not_positive) # label(axiom).
% 0.43/0.63 (all E all X all T (environment(E) & in_environment(E,T) & greater(appear(X,E),T) -> cardinality_at_time(X,T) = zero)) # label(mp_not_present_before_appearance) # label(axiom).
% 0.43/0.63 (all E all T (environment(E) & greater(number_of_organizations(E,T),zero) -> in_environment(E,T))) # label(mp_positive_and_sustains) # label(axiom).
% 0.43/0.63 (all E all T1 all T2 all T (environment(E) & in_environment(E,T1) & in_environment(E,T2) & greater_or_equal(T2,T) & greater_or_equal(T,T1) -> in_environment(E,T))) # label(mp_durations_are_time_intervals) # label(axiom).
% 0.43/0.63 (all E (environment(E) -> in_environment(E,start_time(E)))) # label(mp_opening_time_in_duration) # label(axiom).
% 0.43/0.63 (all E (environment(E) -> greater_or_equal(appear(first_movers,E),start_time(E)))) # label(mp_no_FM_before_opening) # label(axiom).
% 0.43/0.63 (all E (environment(E) & in_environment(E,appear(first_movers,E)) -> in_environment(E,appear(an_organisation,E)))) # label(mp_FM_means_organisations) # label(axiom).
% 0.43/0.63 (all E (environment(E) -> greater_or_equal(appear(first_movers,E),appear(an_organisation,E)))) # label(mp_FM_not_precede_first) # label(axiom).
% 0.43/0.63 (all E (environment(E) -> greater(number_of_organizations(e,appear(an_organisation,E)),zero))) # label(mp_positive_number_when_appear) # label(axiom).
% 0.43/0.63 (all E all T (environment(E) & in_environment(E,T) -> subpopulation(first_movers,E,T) & subpopulation(efficient_producers,E,T))) # label(mp_subpopulations) # label(axiom).
% 0.43/0.63 (all X all Y all Z (greater(X,Y) & greater(Y,Z) -> greater(X,Z))) # label(mp_greater_transitivity) # label(axiom).
% 0.43/0.63 (all X all Y (greater_or_equal(X,Y) <-> greater(X,Y) | X = Y)) # label(mp_greater_or_equal) # label(axiom).
% 0.43/0.63 (all E all T (environment(E) & in_environment(E,T) & greater_or_equal(T,appear(an_organisation,E)) -> greater(number_of_organizations(E,T),zero))) # label(a1) # label(hypothesis).
% 0.43/0.63 (all E (environment(E) -> greater(appear(efficient_producers,e),appear(first_movers,E)))) # label(a3) # label(hypothesis).
% 0.43/0.63 (all E all X all T (environment(E) & subpopulation(X,E,T) & greater(cardinality_at_time(X,T),zero) -> X = efficient_producers | X = first_movers)) # label(a11) # label(hypothesis).
% 0.43/0.63 -(all E all T (environment(E) & in_environment(E,T) & greater_or_equal(T,appear(first_movers,E)) & greater(appear(efficient_producers,E),T) -> selection_favors(first_movers,efficient_producers,T))) # label(prove_t2) # label(negated_conjecture).
% 0.43/0.63 end_of_list.
% 0.43/0.63
% 0.43/0.63 % From the command line: assign(max_seconds, 300).
% 0.43/0.63
% 0.43/0.63 ============================== end of input ==========================
% 0.43/0.63
% 0.43/0.63 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/0.63
% 0.43/0.63 % Formulas that are not ordinary clauses:
% 0.43/0.63 1 (all E all S1 all S2 all T (environment(E) & subpopulation(S1,E,T) & subpopulation(S2,E,T) & greater(cardinality_at_time(S1,T),zero) & cardinality_at_time(S2,T) = zero -> selection_favors(S1,S2,T))) # label(mp2_favour_members) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.63 2 (all E all T (environment(E) & greater(number_of_organizations(E,T),zero) -> (exists S (subpopulation(S,E,T) & greater(cardinality_at_time(S,T),zero))))) # label(mp_number_mean_non_empty) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.63 3 (all X all T (cardinality_at_time(X,t) = zero -> -greater(cardinality_at_time(X,T),zero))) # label(mp_zero_is_not_positive) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.63 4 (all E all X all T (environment(E) & in_environment(E,T) & greater(appear(X,E),T) -> cardinality_at_time(X,T) = zero)) # label(mp_not_present_before_appearance) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.63 5 (all E all T (environment(E) & greater(number_of_organizations(E,T),zero) -> in_environment(E,T))) # label(mp_positive_and_sustains) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.63 6 (all E all T1 all T2 all T (environment(E) & in_environment(E,T1) & in_environment(E,T2) & greater_or_equal(T2,T) & greater_or_equal(T,T1) -> in_environment(E,T))) # label(mp_durations_are_time_intervals) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.63 7 (all E (environment(E) -> in_environment(E,start_time(E)))) # label(mp_opening_time_in_duration) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.63 8 (all E (environment(E) -> greater_or_equal(appear(first_movers,E),start_time(E)))) # label(mp_no_FM_before_opening) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.63 9 (all E (environment(E) & in_environment(E,appear(first_movers,E)) -> in_environment(E,appear(an_organisation,E)))) # label(mp_FM_means_organisations) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.63 10 (all E (environment(E) -> greater_or_equal(appear(first_movers,E),appear(an_organisation,E)))) # label(mp_FM_not_precede_first) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.63 11 (all E (environment(E) -> greater(number_of_organizations(e,appear(an_organisation,E)),zero))) # label(mp_positive_number_when_appear) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.63 12 (all E all T (environment(E) & in_environment(E,T) -> subpopulation(first_movers,E,T) & subpopulation(efficient_producers,E,T))) # label(mp_subpopulations) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.63 13 (all X all Y all Z (greater(X,Y) & greater(Y,Z) -> greater(X,Z))) # label(mp_greater_transitivity) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.63 14 (all X all Y (greater_or_equal(X,Y) <-> greater(X,Y) | X = Y)) # label(mp_greater_or_equal) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.63 15 (all E all T (environment(E) & in_environment(E,T) & greater_or_equal(T,appear(an_organisation,E)) -> greater(number_of_organizations(E,T),zero))) # label(a1) # label(hypothesis) # label(non_clause). [assumption].
% 0.43/0.63 16 (all E (environment(E) -> greater(appear(efficient_producers,e),appear(first_movers,E)))) # label(a3) # label(hypothesis) # label(non_clause). [assumption].
% 0.43/0.63 17 (all E all X all T (environment(E) & subpopulation(X,E,T) & greater(cardinality_at_time(X,T),zero) -> X = efficient_producers | X = first_movers)) # label(a11) # label(hypothesis) # label(non_clause). [assumption].
% 0.43/0.63 18 -(all E all T (environment(E) & in_environment(E,T) & greater_or_equal(T,appear(first_movers,E)) & greater(appear(efficient_producers,E),T) -> selection_favors(first_movers,efficient_producers,T))) # label(prove_t2) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.43/0.63
% 0.43/0.63 ============================== end of process non-clausal formulas ===
% 0.43/0.63
% 0.43/0.63 ============================== CLAUSES FOR SEARCH ====================
% 0.43/0.63
% 0.43/0.63 formulas(mace4_clauses).
% 0.43/0.63 -environment(A) | -subpopulation(B,A,C) | -subpopulation(D,A,C) | -greater(cardinality_at_time(B,C),zero) | cardinality_at_time(D,C) != zero | selection_favors(B,D,C) # label(mp2_favour_members) # label(axiom).
% 0.43/0.63 -environment(A) | -greater(number_of_organizations(A,B),zero) | subpopulation(f1(A,B),A,B) # label(mp_number_mean_non_empty) # label(axiom).
% 0.43/0.63 -environment(A) | -greater(number_of_organizations(A,B),zero) | greater(cardinality_at_time(f1(A,B),B),zero) # label(mp_number_mean_non_empty) # label(axiom).
% 0.43/0.63 cardinality_at_time(A,t) != zero | -greater(cardinality_at_time(A,B),zero) # label(mp_zero_is_not_positive) # label(axiom).
% 0.43/0.63 -environment(A) | -in_environment(A,B) | -greater(appear(C,A),B) | cardinality_at_time(C,B) = zero # label(mp_not_present_before_appearance) # label(axiom).
% 0.43/0.63 -environment(A) | -greater(number_of_organizations(A,B),zero) | in_environment(A,B) # label(mp_positive_and_sustains) # label(axiom).
% 0.43/0.63 -environment(A) | -in_environment(A,B) | -in_environment(A,C) | -greater_or_equal(C,D) | -greater_or_equal(D,B) | in_environment(A,D) # label(mp_durations_are_time_intervals) # label(axiom).
% 0.43/0.63 -environment(A) | in_environment(A,start_time(A)) # label(mp_opening_time_in_duration) # label(axiom).
% 0.43/0.63 -environment(A) | greater_or_equal(appear(first_movers,A),start_time(A)) # label(mp_no_FM_before_opening) # label(axiom).
% 0.43/0.63 -environment(A) | -in_environment(A,appear(first_movers,A)) | in_environment(A,appear(an_organisation,A)) # label(mp_FM_means_organisations) # label(axiom).
% 0.43/0.63 -environment(A) | greater_or_equal(appear(first_movers,A),appear(an_organisation,A)) # label(mp_FM_not_precede_first) # label(axiom).
% 0.43/0.63 -environment(A) | greater(number_of_organizations(e,appear(an_organisation,A)),zero) # label(mp_positive_number_when_appear) # label(axiom).
% 0.43/0.63 -environment(A) | -in_environment(A,B) | subpopulation(first_movers,A,B) # label(mp_subpopulations) # label(axiom).
% 0.43/0.63 -environment(A) | -in_environment(A,B) | subpopulation(efficient_producers,A,B) # label(mp_subpopulations) # label(axiom).
% 0.43/0.63 -greater(A,B) | -greater(B,C) | greater(A,C) # label(mp_greater_transitivity) # label(axiom).
% 0.43/0.63 -greater_or_equal(A,B) | greater(A,B) | B = A # label(mp_greater_or_equal) # label(axiom).
% 0.43/0.63 greater_or_equal(A,B) | -greater(A,B) # label(mp_greater_or_equal) # label(axiom).
% 0.43/0.63 greater_or_equal(A,B) | B != A # label(mp_greater_or_equal) # label(axiom).
% 0.43/0.63 -environment(A) | -in_environment(A,B) | -greater_or_equal(B,appear(an_organisation,A)) | greater(number_of_organizations(A,B),zero) # label(a1) # label(hypothesis).
% 0.43/0.63 -environment(A) | greater(appear(efficient_producers,e),appear(first_movers,A)) # label(a3) # label(hypothesis).
% 0.43/0.63 -environment(A) | -subpopulation(B,A,C) | -greater(cardinality_at_time(B,C),zero) | efficient_producers = B | first_movers = B # label(a11) # label(hypothesis).
% 0.43/0.63 environment(c1) # label(prove_t2) # label(negated_conjecture).
% 0.43/0.63 in_environment(c1,c2) # label(prove_t2) # label(negated_conjecture).
% 0.43/0.63 greater_or_equal(c2,appear(first_movers,c1)) # label(prove_t2) # label(negated_conjecture).
% 0.43/0.63 greater(appear(efficient_producers,c1),c2) # label(prove_t2) # label(negated_conjecture).
% 0.43/0.63 -selection_favors(first_movers,efficient_producers,c2) # label(prove_t2) # label(negated_conjecture).
% 0.43/0.63 end_of_list.
% 0.43/0.63
% 0.43/0.63 ============================== end of clauses for search =============
% 0.43/0.63 % SZS output start FiniteModel
% 0.43/0.63
% 0.43/0.63 % There are no natural numbers in the input.
% 0.43/0.63
% 0.43/0.63 an_organisation : 0
% 0.43/0.63
% 0.43/0.63 e : 0
% 0.43/0.63
% 0.43/0.63 efficient_producers : 1
% 0.43/0.63
% 0.43/0.63 first_movers : 0
% 0.43/0.63
% 0.43/0.63 t : 0
% 0.43/0.63
% 0.43/0.63 zero : 0
% 0.43/0.63
% 0.43/0.63 c1 : 0
% 0.43/0.63
% 0.43/0.63 c2 : 1
% 0.43/0.63
% 0.43/0.63 start_time :
% 0.43/0.63 0 1
% 0.43/0.63 -------
% 0.43/0.63 1 0
% 0.43/0.63
% 0.43/0.63 appear :
% 0.43/0.63 | 0 1
% 0.43/0.63 --+----
% 0.43/0.63 0 | 1 0
% 0.43/0.63 1 | 0 0
% 0.43/0.63
% 0.43/0.63 cardinality_at_time :
% 0.43/0.63 | 0 1
% 0.43/0.63 --+----
% 0.43/0.63 0 | 1 1
% 0.43/0.63 1 | 1 0
% 0.43/0.63
% 0.43/0.63 number_of_organizations :
% 0.43/0.63 | 0 1
% 0.43/0.63 --+----
% 0.43/0.63 0 | 1 0
% 0.43/0.63 1 | 0 0
% 0.43/0.63
% 0.43/0.63 f1 :
% 0.43/0.63 | 0 1
% 0.43/0.63 --+----
% 0.43/0.63 0 | 0 1
% 0.43/0.63 1 | 0 0
% 0.43/0.63
% 0.43/0.63 environment :
% 0.43/0.63 0 1
% 0.43/0.63 -------
% 0.43/0.63 1 0
% 0.43/0.63
% 0.43/0.63 greater :
% 0.43/0.63 | 0 1
% 0.43/0.63 --+----
% 0.43/0.63 0 | 1 1
% 0.43/0.63 1 | 0 0
% 0.43/0.63
% 0.43/0.63 greater_or_equal :
% 0.43/0.63 | 0 1
% 0.43/0.63 --+----
% 0.43/0.63 0 | 1 1
% 0.43/0.63 1 | 0 1
% 0.43/0.63
% 0.43/0.63 in_environment :
% 0.43/0.63 | 0 1
% 0.43/0.63 --+----
% 0.43/0.63 0 | 0 1
% 0.43/0.63 1 | 0 0
% 0.43/0.63 selection_favors(0,0,0) = 0.
% 0.43/0.63 selection_favors(0,0,1) = 0.
% 0.43/0.63 selection_favors(0,1,0) = 0.
% 0.43/0.63 selection_favors(0,1,1) = 0.
% 0.43/0.63 selection_favors(1,0,0) = 0.
% 0.43/0.63 selection_favors(1,0,1) = 0.
% 0.43/0.63 selection_favors(1,1,0) = 0.
% 0.43/0.63 selection_favors(1,1,1) = 1.
% 0.43/0.63 subpopulation(0,0,0) = 0.
% 0.43/0.63 subpopulation(0,0,1) = 1.
% 0.43/0.63 subpopulation(0,1,0) = 0.
% 0.43/0.63 subpopulation(0,1,1) = 0.
% 0.43/0.63 subpopulation(1,0,0) = 0.
% 0.43/0.63 subpopulation(1,0,1) = 1.
% 0.43/0.63 subpopulation(1,1,0) = 0.
% 0.43/0.63 subpopulation(1,1,1) = 0.
% 0.43/0.63
% 0.43/0.63 % SZS output end FiniteModel
% 0.43/0.63 ------ process 25487 exit (max_models) ------
% 0.43/0.63
% 0.43/0.63 User_CPU=0.17, System_CPU=0.03, Wall_clock=0.
% 0.43/0.63
% 0.43/0.63 Exiting with 1 model.
% 0.43/0.63
% 0.43/0.63 Process 25487 exit (max_models) Tue Feb 7 19:47:01 2017
% 0.43/0.63 The process finished Tue Feb 7 19:47:01 2017
% 0.43/0.63 Mace4 ended
%------------------------------------------------------------------------------