TSTP Solution File: MGT040+2 by Mace4---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Mace4---1109a
% Problem : MGT040+2 : TPTP v6.4.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : mace4 -t %d -f %s
% Computer : n080.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:59:00 EST 2017
% Result : CounterSatisfiable 0.06s
% Output : FiniteModel 0.06s
% 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 : MGT040+2 : TPTP v6.4.0. Released v2.0.0.
% 0.00/0.04 % Command : mace4 -t %d -f %s
% 0.02/0.23 % Computer : n080.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:31 CST 2017
% 0.02/0.23 % CPUTime :
% 0.06/0.46 % SZS status CounterSatisfiable
% 0.06/0.46 ============================== Mace4 =================================
% 0.06/0.46 Mace4 (32) version 2009-11A, November 2009.
% 0.06/0.46 Process 51664 was started by sandbox on n080.star.cs.uiowa.edu,
% 0.06/0.46 Tue Feb 7 19:47:31 2017
% 0.06/0.46 The command was "/export/starexec/sandbox/solver/bin/mace4 -t 300 -f /tmp/Mace4_input_51631_n080.star.cs.uiowa.edu".
% 0.06/0.46 ============================== end of head ===========================
% 0.06/0.46
% 0.06/0.46 ============================== INPUT =================================
% 0.06/0.46
% 0.06/0.46 % Reading from file /tmp/Mace4_input_51631_n080.star.cs.uiowa.edu
% 0.06/0.46
% 0.06/0.46 set(prolog_style_variables).
% 0.06/0.46 set(print_models_tabular).
% 0.06/0.46 % set(print_models_tabular) -> clear(print_models).
% 0.06/0.46
% 0.06/0.46 formulas(sos).
% 0.06/0.46 (all P (observational_period(P) & propagation_strategy(first_movers) & propagation_strategy(efficient_producers) & (all E (environment(E) & in_environment(P,E) -> selection_favors(efficient_producers,first_movers,end_time(E)))) -> selection_favors(efficient_producers,first_movers,P))) # label(mp3_favoured_trategy) # label(axiom).
% 0.06/0.46 (all P (observational_period(P) & rapid_change(P) -> (all E (environment(E) & in_environment(P,E) -> -in_environment(E,critical_point(E)))))) # label(mp5_rapid_change_is_non_critical) # label(axiom).
% 0.06/0.46 (all P (observational_period(P) & -extreme(P) -> (all E (environment(E) & in_environment(P,E) -> -empty(E))))) # label(mp6_not_extreme_change_means_not_empty) # label(axiom).
% 0.06/0.46 propagation_strategy(first_movers) # label(mp_organizational_sets1) # label(axiom).
% 0.06/0.46 propagation_strategy(efficient_producers) # label(mp_organizational_sets2) # label(axiom).
% 0.06/0.46 (all E (environment(E) -> in_environment(E,end_time(E)))) # label(mp_endpoint_in_environment) # label(axiom).
% 0.06/0.46 (all E (environment(E) & -in_environment(E,critical_point(E)) -> greater(critical_point(E),end_time(E)))) # label(mp_critical_point_not_before_opening) # label(axiom).
% 0.06/0.46 (all E (environment(E) & -empty(E) -> greater_or_equal(end_time(E),appear(an_organisation,E)))) # label(mp_non_empty_means_organisations) # label(axiom).
% 0.06/0.46 (all E all T (environment(E) & greater_or_equal(T,appear(efficient_producers,E)) & greater(critical_point(E),T) & (in_environment(E,critical_point(E)) -> selection_favors(first_movers,efficient_producers,T)) -> (-in_environment(E,critical_point(E)) -> selection_favors(first_movers,efficient_producers,end_time(E))))) # label(mp_selection_favours_in_time) # label(axiom).
% 0.06/0.46 (all X all Y (greater_or_equal(X,Y) -> greater(X,Y) | X = Y)) # label(mp_greater_or_equal) # label(axiom).
% 0.06/0.46 (all E all T (in_environment(E,T) & -greater(appear(efficient_producers,E),T) -> greater_or_equal(T,appear(efficient_producers,E)))) # label(mp_appearance_of_EP) # label(axiom).
% 0.06/0.46 (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(t2) # label(hypothesis).
% 0.06/0.46 (all E all T (environment(E) & in_environment(E,critical_point(E)) & greater_or_equal(T,appear(efficient_producers,E)) & greater(critical_point(E),T) -> selection_favors(first_movers,efficient_producers,T))) # label(t3) # label(hypothesis).
% 0.06/0.46 -(all P (observational_period(P) & rapid_change(P) & -extreme(P) -> selection_favors(first_movers,efficient_producers,P))) # label(prove_t9) # label(negated_conjecture).
% 0.06/0.46 end_of_list.
% 0.06/0.46
% 0.06/0.46 % From the command line: assign(max_seconds, 300).
% 0.06/0.46
% 0.06/0.46 ============================== end of input ==========================
% 0.06/0.46
% 0.06/0.46 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.06/0.46
% 0.06/0.46 % Formulas that are not ordinary clauses:
% 0.06/0.46 1 (all P (observational_period(P) & propagation_strategy(first_movers) & propagation_strategy(efficient_producers) & (all E (environment(E) & in_environment(P,E) -> selection_favors(efficient_producers,first_movers,end_time(E)))) -> selection_favors(efficient_producers,first_movers,P))) # label(mp3_favoured_trategy) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.46 2 (all P (observational_period(P) & rapid_change(P) -> (all E (environment(E) & in_environment(P,E) -> -in_environment(E,critical_point(E)))))) # label(mp5_rapid_change_is_non_critical) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.46 3 (all P (observational_period(P) & -extreme(P) -> (all E (environment(E) & in_environment(P,E) -> -empty(E))))) # label(mp6_not_extreme_change_means_not_empty) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.46 4 (all E (environment(E) -> in_environment(E,end_time(E)))) # label(mp_endpoint_in_environment) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.46 5 (all E (environment(E) & -in_environment(E,critical_point(E)) -> greater(critical_point(E),end_time(E)))) # label(mp_critical_point_not_before_opening) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.46 6 (all E (environment(E) & -empty(E) -> greater_or_equal(end_time(E),appear(an_organisation,E)))) # label(mp_non_empty_means_organisations) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.46 7 (all E all T (environment(E) & greater_or_equal(T,appear(efficient_producers,E)) & greater(critical_point(E),T) & (in_environment(E,critical_point(E)) -> selection_favors(first_movers,efficient_producers,T)) -> (-in_environment(E,critical_point(E)) -> selection_favors(first_movers,efficient_producers,end_time(E))))) # label(mp_selection_favours_in_time) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.46 8 (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.06/0.46 9 (all E all T (in_environment(E,T) & -greater(appear(efficient_producers,E),T) -> greater_or_equal(T,appear(efficient_producers,E)))) # label(mp_appearance_of_EP) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.46 10 (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(t2) # label(hypothesis) # label(non_clause). [assumption].
% 0.06/0.46 11 (all E all T (environment(E) & in_environment(E,critical_point(E)) & greater_or_equal(T,appear(efficient_producers,E)) & greater(critical_point(E),T) -> selection_favors(first_movers,efficient_producers,T))) # label(t3) # label(hypothesis) # label(non_clause). [assumption].
% 0.06/0.46 12 -(all P (observational_period(P) & rapid_change(P) & -extreme(P) -> selection_favors(first_movers,efficient_producers,P))) # label(prove_t9) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.06/0.46
% 0.06/0.46 ============================== end of process non-clausal formulas ===
% 0.06/0.46
% 0.06/0.46 ============================== CLAUSES FOR SEARCH ====================
% 0.06/0.46
% 0.06/0.46 formulas(mace4_clauses).
% 0.06/0.46 -observational_period(A) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | environment(f1(A)) | selection_favors(efficient_producers,first_movers,A) # label(mp3_favoured_trategy) # label(axiom).
% 0.06/0.46 -observational_period(A) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | in_environment(A,f1(A)) | selection_favors(efficient_producers,first_movers,A) # label(mp3_favoured_trategy) # label(axiom).
% 0.06/0.46 -observational_period(A) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | -selection_favors(efficient_producers,first_movers,end_time(f1(A))) | selection_favors(efficient_producers,first_movers,A) # label(mp3_favoured_trategy) # label(axiom).
% 0.06/0.46 -observational_period(A) | -rapid_change(A) | -environment(B) | -in_environment(A,B) | -in_environment(B,critical_point(B)) # label(mp5_rapid_change_is_non_critical) # label(axiom).
% 0.06/0.46 -observational_period(A) | extreme(A) | -environment(B) | -in_environment(A,B) | -empty(B) # label(mp6_not_extreme_change_means_not_empty) # label(axiom).
% 0.06/0.46 propagation_strategy(first_movers) # label(mp_organizational_sets1) # label(axiom).
% 0.06/0.46 propagation_strategy(efficient_producers) # label(mp_organizational_sets2) # label(axiom).
% 0.06/0.46 -environment(A) | in_environment(A,end_time(A)) # label(mp_endpoint_in_environment) # label(axiom).
% 0.06/0.46 -environment(A) | in_environment(A,critical_point(A)) | greater(critical_point(A),end_time(A)) # label(mp_critical_point_not_before_opening) # label(axiom).
% 0.06/0.46 -environment(A) | empty(A) | greater_or_equal(end_time(A),appear(an_organisation,A)) # label(mp_non_empty_means_organisations) # label(axiom).
% 0.06/0.46 -environment(A) | -greater_or_equal(B,appear(efficient_producers,A)) | -greater(critical_point(A),B) | in_environment(A,critical_point(A)) | selection_favors(first_movers,efficient_producers,end_time(A)) # label(mp_selection_favours_in_time) # label(axiom).
% 0.06/0.46 -greater_or_equal(A,B) | greater(A,B) | B = A # label(mp_greater_or_equal) # label(axiom).
% 0.06/0.46 -in_environment(A,B) | greater(appear(efficient_producers,A),B) | greater_or_equal(B,appear(efficient_producers,A)) # label(mp_appearance_of_EP) # label(axiom).
% 0.06/0.46 -environment(A) | -in_environment(A,B) | -greater_or_equal(B,appear(first_movers,A)) | -greater(appear(efficient_producers,A),B) | selection_favors(first_movers,efficient_producers,B) # label(t2) # label(hypothesis).
% 0.06/0.46 -environment(A) | -in_environment(A,critical_point(A)) | -greater_or_equal(B,appear(efficient_producers,A)) | -greater(critical_point(A),B) | selection_favors(first_movers,efficient_producers,B) # label(t3) # label(hypothesis).
% 0.06/0.46 observational_period(c1) # label(prove_t9) # label(negated_conjecture).
% 0.06/0.46 rapid_change(c1) # label(prove_t9) # label(negated_conjecture).
% 0.06/0.46 -extreme(c1) # label(prove_t9) # label(negated_conjecture).
% 0.06/0.46 -selection_favors(first_movers,efficient_producers,c1) # label(prove_t9) # label(negated_conjecture).
% 0.06/0.46 end_of_list.
% 0.06/0.46
% 0.06/0.46 ============================== end of clauses for search =============
% 0.06/0.46 % SZS output start FiniteModel
% 0.06/0.46
% 0.06/0.46 % There are no natural numbers in the input.
% 0.06/0.46
% 0.06/0.46 an_organisation : 0
% 0.06/0.46
% 0.06/0.46 efficient_producers : 0
% 0.06/0.46
% 0.06/0.46 first_movers : 1
% 0.06/0.46
% 0.06/0.46 c1 : 0
% 0.06/0.46
% 0.06/0.46 critical_point :
% 0.06/0.46 0 1
% 0.06/0.46 -------
% 0.06/0.46 0 0
% 0.06/0.46
% 0.06/0.46 end_time :
% 0.06/0.46 0 1
% 0.06/0.46 -------
% 0.06/0.46 0 0
% 0.06/0.46
% 0.06/0.46 f1 :
% 0.06/0.46 0 1
% 0.06/0.46 -------
% 0.06/0.46 0 0
% 0.06/0.46
% 0.06/0.46 appear :
% 0.06/0.46 | 0 1
% 0.06/0.46 --+----
% 0.06/0.46 0 | 0 0
% 0.06/0.46 1 | 0 0
% 0.06/0.46
% 0.06/0.46 empty :
% 0.06/0.46 0 1
% 0.06/0.46 -------
% 0.06/0.46 0 0
% 0.06/0.46
% 0.06/0.46 environment :
% 0.06/0.46 0 1
% 0.06/0.46 -------
% 0.06/0.46 0 0
% 0.06/0.46
% 0.06/0.46 extreme :
% 0.06/0.46 0 1
% 0.06/0.46 -------
% 0.06/0.46 0 0
% 0.06/0.46
% 0.06/0.46 observational_period :
% 0.06/0.46 0 1
% 0.06/0.46 -------
% 0.06/0.46 1 0
% 0.06/0.46
% 0.06/0.46 propagation_strategy :
% 0.06/0.46 0 1
% 0.06/0.46 -------
% 0.06/0.46 1 1
% 0.06/0.46
% 0.06/0.46 rapid_change :
% 0.06/0.46 0 1
% 0.06/0.46 -------
% 0.06/0.46 1 0
% 0.06/0.46
% 0.06/0.46 greater :
% 0.06/0.46 | 0 1
% 0.06/0.46 --+----
% 0.06/0.46 0 | 0 0
% 0.06/0.46 1 | 0 0
% 0.06/0.46
% 0.06/0.46 greater_or_equal :
% 0.06/0.46 | 0 1
% 0.06/0.46 --+----
% 0.06/0.46 0 | 0 0
% 0.06/0.46 1 | 0 0
% 0.06/0.46
% 0.06/0.46 in_environment :
% 0.06/0.46 | 0 1
% 0.06/0.46 --+----
% 0.06/0.46 0 | 0 0
% 0.06/0.46 1 | 0 0
% 0.06/0.46 selection_favors(0,0,0) = 0.
% 0.06/0.46 selection_favors(0,0,1) = 0.
% 0.06/0.46 selection_favors(0,1,0) = 1.
% 0.06/0.46 selection_favors(0,1,1) = 0.
% 0.06/0.46 selection_favors(1,0,0) = 0.
% 0.06/0.46 selection_favors(1,0,1) = 0.
% 0.06/0.46 selection_favors(1,1,0) = 0.
% 0.06/0.46 selection_favors(1,1,1) = 0.
% 0.06/0.46
% 0.06/0.46 % SZS output end FiniteModel
% 0.06/0.46 ------ process 51664 exit (max_models) ------
% 0.06/0.46
% 0.06/0.46 User_CPU=0.03, System_CPU=0.01, Wall_clock=0.
% 0.06/0.46
% 0.06/0.46 Exiting with 1 model.
% 0.06/0.46
% 0.06/0.46 Process 51664 exit (max_models) Tue Feb 7 19:47:31 2017
% 0.06/0.46 The process finished Tue Feb 7 19:47:31 2017
% 0.06/0.46 Mace4 ended
%------------------------------------------------------------------------------