TSTP Solution File: MGT033-1 by Mace4---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Mace4---1109a
% Problem : MGT033-1 : TPTP v6.4.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : mace4 -t %d -f %s
% Computer : n132.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 : Satisfiable 2.10s
% Output : FiniteModel 2.10s
% 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-1 : TPTP v6.4.0. Released v2.4.0.
% 0.00/0.04 % Command : mace4 -t %d -f %s
% 0.02/0.23 % Computer : n132.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:01 CST 2017
% 0.02/0.23 % CPUTime :
% 2.10/2.35 % SZS status Satisfiable
% 2.10/2.35 ============================== Mace4 =================================
% 2.10/2.35 Mace4 (32) version 2009-11A, November 2009.
% 2.10/2.35 Process 34194 was started by sandbox2 on n132.star.cs.uiowa.edu,
% 2.10/2.35 Tue Feb 7 19:47:01 2017
% 2.10/2.35 The command was "/export/starexec/sandbox2/solver/bin/mace4 -t 300 -f /tmp/Mace4_input_34161_n132.star.cs.uiowa.edu".
% 2.10/2.35 ============================== end of head ===========================
% 2.10/2.35
% 2.10/2.35 ============================== INPUT =================================
% 2.10/2.35
% 2.10/2.35 % Reading from file /tmp/Mace4_input_34161_n132.star.cs.uiowa.edu
% 2.10/2.35
% 2.10/2.35 set(prolog_style_variables).
% 2.10/2.35 set(print_models_tabular).
% 2.10/2.35 % set(print_models_tabular) -> clear(print_models).
% 2.10/2.35
% 2.10/2.35 formulas(sos).
% 2.10/2.35 -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_24) # label(axiom).
% 2.10/2.35 -environment(A) | -in_environment(A,B) | -greater(appear(C,A),B) | cardinality_at_time(C,B) = zero # label(mp_not_present_before_appearance_25) # label(axiom).
% 2.10/2.35 -environment(A) | -greater(number_of_organizations(A,B),zero) | subpopulation(sk1(B,A),A,B) # label(mp_positive_sum_means_members_26) # label(axiom).
% 2.10/2.35 -environment(A) | -greater(number_of_organizations(A,B),zero) | greater(cardinality_at_time(sk1(B,A),B),zero) # label(mp_positive_sum_means_members_27) # label(axiom).
% 2.10/2.35 cardinality_at_time(A,t) != zero | -greater(cardinality_at_time(A,B),zero) # label(mp_zero_is_not_positive_28) # label(axiom).
% 2.10/2.35 -environment(A) | -greater(number_of_organizations(A,B),zero) | in_environment(A,B) # label(mp_positive_and_sustains_29) # label(axiom).
% 2.10/2.35 -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_30) # label(axiom).
% 2.10/2.35 -environment(A) | in_environment(A,start_time(A)) # label(mp_opening_time_in_duration_31) # label(axiom).
% 2.10/2.35 -environment(A) | greater_or_equal(appear(first_movers,A),start_time(A)) # label(mp_no_FM_before_opening_32) # label(axiom).
% 2.10/2.35 -environment(A) | -in_environment(A,B) | subpopulation(first_movers,A,B) # label(mp_subpopulations_33) # label(axiom).
% 2.10/2.35 -environment(A) | -in_environment(A,B) | subpopulation(efficient_producers,A,B) # label(mp_subpopulations_34) # label(axiom).
% 2.10/2.35 -environment(A) | -in_environment(A,appear(first_movers,A)) | in_environment(A,appear(an_organisation,A)) # label(mp_FM_means_organisations_35) # label(axiom).
% 2.10/2.35 -environment(A) | -in_environment(A,B) | -greater_or_equal(B,appear(an_organisation,A)) | greater(number_of_organizations(A,B),zero) # label(a1_36) # label(hypothesis).
% 2.10/2.35 -environment(A) | -subpopulation(B,A,C) | -greater(cardinality_at_time(B,C),zero) | B = efficient_producers | B = first_movers # label(a9_37) # label(hypothesis).
% 2.10/2.35 -environment(A) | -in_environment(A,appear(an_organisation,A)) | appear(an_organisation,A) = appear(first_movers,A) # label(l13_38) # label(hypothesis).
% 2.10/2.35 environment(sk2) # label(prove_t2_39) # label(negated_conjecture).
% 2.10/2.35 in_environment(sk2,sk3) # label(prove_t2_40) # label(negated_conjecture).
% 2.10/2.35 greater_or_equal(sk3,appear(first_movers,sk2)) # label(prove_t2_41) # label(negated_conjecture).
% 2.10/2.35 greater(appear(efficient_producers,sk2),sk3) # label(prove_t2_42) # label(negated_conjecture).
% 2.10/2.35 -selection_favors(first_movers,efficient_producers,sk3) # label(prove_t2_43) # label(negated_conjecture).
% 2.10/2.35 end_of_list.
% 2.10/2.35
% 2.10/2.35 % From the command line: assign(max_seconds, 300).
% 2.10/2.35
% 2.10/2.35 ============================== end of input ==========================
% 2.10/2.35
% 2.10/2.35 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 2.10/2.35
% 2.10/2.35 % Formulas that are not ordinary clauses:
% 2.10/2.35
% 2.10/2.35 ============================== end of process non-clausal formulas ===
% 2.10/2.35
% 2.10/2.35 ============================== CLAUSES FOR SEARCH ====================
% 2.10/2.35
% 2.10/2.35 formulas(mace4_clauses).
% 2.10/2.35 -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_24) # label(axiom).
% 2.10/2.35 -environment(A) | -in_environment(A,B) | -greater(appear(C,A),B) | cardinality_at_time(C,B) = zero # label(mp_not_present_before_appearance_25) # label(axiom).
% 2.10/2.35 -environment(A) | -greater(number_of_organizations(A,B),zero) | subpopulation(sk1(B,A),A,B) # label(mp_positive_sum_means_members_26) # label(axiom).
% 2.10/2.35 -environment(A) | -greater(number_of_organizations(A,B),zero) | greater(cardinality_at_time(sk1(B,A),B),zero) # label(mp_positive_sum_means_members_27) # label(axiom).
% 2.10/2.35 cardinality_at_time(A,t) != zero | -greater(cardinality_at_time(A,B),zero) # label(mp_zero_is_not_positive_28) # label(axiom).
% 2.10/2.35 -environment(A) | -greater(number_of_organizations(A,B),zero) | in_environment(A,B) # label(mp_positive_and_sustains_29) # label(axiom).
% 2.10/2.35 -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_30) # label(axiom).
% 2.10/2.35 -environment(A) | in_environment(A,start_time(A)) # label(mp_opening_time_in_duration_31) # label(axiom).
% 2.10/2.35 -environment(A) | greater_or_equal(appear(first_movers,A),start_time(A)) # label(mp_no_FM_before_opening_32) # label(axiom).
% 2.10/2.35 -environment(A) | -in_environment(A,B) | subpopulation(first_movers,A,B) # label(mp_subpopulations_33) # label(axiom).
% 2.10/2.35 -environment(A) | -in_environment(A,B) | subpopulation(efficient_producers,A,B) # label(mp_subpopulations_34) # label(axiom).
% 2.10/2.35 -environment(A) | -in_environment(A,appear(first_movers,A)) | in_environment(A,appear(an_organisation,A)) # label(mp_FM_means_organisations_35) # label(axiom).
% 2.10/2.35 -environment(A) | -in_environment(A,B) | -greater_or_equal(B,appear(an_organisation,A)) | greater(number_of_organizations(A,B),zero) # label(a1_36) # label(hypothesis).
% 2.10/2.35 -environment(A) | -subpopulation(B,A,C) | -greater(cardinality_at_time(B,C),zero) | B = efficient_producers | B = first_movers # label(a9_37) # label(hypothesis).
% 2.10/2.35 -environment(A) | -in_environment(A,appear(an_organisation,A)) | appear(an_organisation,A) = appear(first_movers,A) # label(l13_38) # label(hypothesis).
% 2.10/2.35 environment(sk2) # label(prove_t2_39) # label(negated_conjecture).
% 2.10/2.35 in_environment(sk2,sk3) # label(prove_t2_40) # label(negated_conjecture).
% 2.10/2.35 greater_or_equal(sk3,appear(first_movers,sk2)) # label(prove_t2_41) # label(negated_conjecture).
% 2.10/2.35 greater(appear(efficient_producers,sk2),sk3) # label(prove_t2_42) # label(negated_conjecture).
% 2.10/2.35 -selection_favors(first_movers,efficient_producers,sk3) # label(prove_t2_43) # label(negated_conjecture).
% 2.10/2.35 end_of_list.
% 2.10/2.35
% 2.10/2.35 ============================== end of clauses for search =============
% 2.10/2.35 % SZS output start FiniteModel
% 2.10/2.35
% 2.10/2.35 % There are no natural numbers in the input.
% 2.10/2.35
% 2.10/2.35 an_organisation : 0
% 2.10/2.35
% 2.10/2.35 efficient_producers : 1
% 2.10/2.35
% 2.10/2.35 first_movers : 0
% 2.10/2.35
% 2.10/2.35 sk2 : 0
% 2.10/2.35
% 2.10/2.35 sk3 : 0
% 2.10/2.35
% 2.10/2.35 t : 1
% 2.10/2.35
% 2.10/2.35 zero : 0
% 2.10/2.35
% 2.10/2.35 start_time :
% 2.10/2.35 0 1
% 2.10/2.35 -------
% 2.10/2.35 0 0
% 2.10/2.35
% 2.10/2.35 appear :
% 2.10/2.35 | 0 1
% 2.10/2.35 --+----
% 2.10/2.35 0 | 1 0
% 2.10/2.35 1 | 0 0
% 2.10/2.35
% 2.10/2.35 cardinality_at_time :
% 2.10/2.35 | 0 1
% 2.10/2.35 --+----
% 2.10/2.35 0 | 1 1
% 2.10/2.35 1 | 0 1
% 2.10/2.35
% 2.10/2.35 number_of_organizations :
% 2.10/2.35 | 0 1
% 2.10/2.35 --+----
% 2.10/2.35 0 | 0 1
% 2.10/2.35 1 | 0 0
% 2.10/2.35
% 2.10/2.35 sk1 :
% 2.10/2.35 | 0 1
% 2.10/2.35 --+----
% 2.10/2.35 0 | 1 0
% 2.10/2.35 1 | 0 0
% 2.10/2.35
% 2.10/2.35 environment :
% 2.10/2.35 0 1
% 2.10/2.35 -------
% 2.10/2.35 1 0
% 2.10/2.35
% 2.10/2.35 greater :
% 2.10/2.35 | 0 1
% 2.10/2.35 --+----
% 2.10/2.35 0 | 1 0
% 2.10/2.35 1 | 0 0
% 2.10/2.35
% 2.10/2.35 greater_or_equal :
% 2.10/2.35 | 0 1
% 2.10/2.35 --+----
% 2.10/2.35 0 | 0 1
% 2.10/2.35 1 | 1 0
% 2.10/2.35
% 2.10/2.35 in_environment :
% 2.10/2.35 | 0 1
% 2.10/2.35 --+----
% 2.10/2.35 0 | 1 1
% 2.10/2.35 1 | 0 0
% 2.10/2.35 selection_favors(0,0,0) = 0.
% 2.10/2.35 selection_favors(0,0,1) = 0.
% 2.10/2.35 selection_favors(0,1,0) = 0.
% 2.10/2.35 selection_favors(0,1,1) = 0.
% 2.10/2.35 selection_favors(1,0,0) = 0.
% 2.10/2.35 selection_favors(1,0,1) = 0.
% 2.10/2.35 selection_favors(1,1,0) = 1.
% 2.10/2.35 selection_favors(1,1,1) = 0.
% 2.10/2.35 subpopulation(0,0,0) = 1.
% 2.10/2.35 subpopulation(0,0,1) = 1.
% 2.10/2.35 subpopulation(0,1,0) = 0.
% 2.10/2.35 subpopulation(0,1,1) = 0.
% 2.10/2.35 subpopulation(1,0,0) = 1.
% 2.10/2.35 subpopulation(1,0,1) = 1.
% 2.10/2.35 subpopulation(1,1,0) = 0.
% 2.10/2.35 subpopulation(1,1,1) = 0.
% 2.10/2.35
% 2.10/2.35 % SZS output end FiniteModel
% 2.10/2.35 ------ process 34194 exit (max_models) ------
% 2.10/2.35
% 2.10/2.35 User_CPU=1.59, System_CPU=0.34, Wall_clock=2.
% 2.10/2.35
% 2.10/2.35 Exiting with 1 model.
% 2.10/2.35
% 2.10/2.35 Process 34194 exit (max_models) Tue Feb 7 19:47:03 2017
% 2.10/2.35 The process finished Tue Feb 7 19:47:03 2017
% 2.10/2.35 Mace4 ended
%------------------------------------------------------------------------------