TSTP Solution File: MGT033+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT033+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n019.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 : 600s
% DateTime : Sun Jul 17 22:22:57 EDT 2022
% Result : Unknown 0.73s 0.99s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : MGT033+1 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n019.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 9 07:32:55 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.44/0.98 ============================== Prover9 ===============================
% 0.44/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.44/0.98 Process 8706 was started by sandbox on n019.cluster.edu,
% 0.44/0.98 Thu Jun 9 07:32:55 2022
% 0.44/0.98 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_8553_n019.cluster.edu".
% 0.44/0.98 ============================== end of head ===========================
% 0.44/0.98
% 0.44/0.98 ============================== INPUT =================================
% 0.44/0.98
% 0.44/0.98 % Reading from file /tmp/Prover9_8553_n019.cluster.edu
% 0.44/0.98
% 0.44/0.98 set(prolog_style_variables).
% 0.44/0.98 set(auto2).
% 0.44/0.98 % set(auto2) -> set(auto).
% 0.44/0.98 % set(auto) -> set(auto_inference).
% 0.44/0.98 % set(auto) -> set(auto_setup).
% 0.44/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.44/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/0.98 % set(auto) -> set(auto_limits).
% 0.44/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/0.98 % set(auto) -> set(auto_denials).
% 0.44/0.98 % set(auto) -> set(auto_process).
% 0.44/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.44/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.44/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.44/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.44/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.44/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.44/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.44/0.98 % set(auto2) -> assign(stats, some).
% 0.44/0.98 % set(auto2) -> clear(echo_input).
% 0.44/0.98 % set(auto2) -> set(quiet).
% 0.44/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.44/0.98 % set(auto2) -> clear(print_given).
% 0.44/0.98 assign(lrs_ticks,-1).
% 0.44/0.98 assign(sos_limit,10000).
% 0.44/0.98 assign(order,kbo).
% 0.44/0.98 set(lex_order_vars).
% 0.44/0.98 clear(print_given).
% 0.44/0.98
% 0.44/0.98 % formulas(sos). % not echoed (14 formulas)
% 0.44/0.98
% 0.44/0.98 ============================== end of input ==========================
% 0.44/0.98
% 0.44/0.98 % From the command line: assign(max_seconds, 300).
% 0.44/0.98
% 0.44/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/0.98
% 0.44/0.98 % Formulas that are not ordinary clauses:
% 0.44/0.98 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.44/0.98 2 (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.44/0.98 3 (all E all T (environment(E) & greater(number_of_organizations(E,T),zero) -> (exists X (subpopulation(X,E,T) & greater(cardinality_at_time(X,T),zero))))) # label(mp_positive_sum_means_members) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.98 4 (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.44/0.98 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.44/0.98 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.44/0.98 7 (all E (environment(E) -> in_environment(E,start_time(E)))) # label(mp_opening_time_in_duration) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.98 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.44/0.98 9 (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.44/0.98 10 (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.44/0.98 11 (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.44/0.98 12 (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(a9) # label(hypothesis) # label(non_clause). [assumption].
% 0.44/0.98 13 (all E (environment(E) & in_environment(E,appear(an_organisation,E)) -> appear(an_organisation,E) = appear(first_movers,E))) # label(l13) # label(hypothesis) # label(non_clause). [assumption].
% 0.44/0.98 14 -(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.44/0.98
% 0.44/0.98 ============================== end of process non-clausal formulas ===
% 0.44/0.98
% 0.44/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/0.98
% 0.44/0.98 ============================== PREDICATE ELIMINATION =================
% 0.44/0.98 15 -environment(A) | in_environment(A,start_time(A)) # label(mp_opening_time_in_duration) # label(axiom). [clausify(7)].
% 0.44/0.98 16 environment(c1) # label(prove_t2) # label(negated_conjecture). [clausify(14)].
% 0.44/0.98 Derived: in_environment(c1,start_time(c1)). [resolve(15,a,16,a)].
% 0.44/0.98 17 -environment(A) | greater_or_equal(appear(first_movers,A),start_time(A)) # label(mp_no_FM_before_opening) # label(axiom). [clausify(8)].
% 0.44/0.98 Derived: greater_or_equal(appear(first_movers,c1),start_time(c1)). [resolve(17,a,16,a)].
% 0.44/0.98 18 -environment(A) | -in_environment(A,B) | subpopulation(first_movers,A,B) # label(mp_subpopulations) # label(axiom). [clausify(9)].
% 0.44/0.98 Derived: -in_environment(c1,A) | subpopulation(first_movers,c1,A). [resolve(18,a,16,a)].
% 0.44/0.98 19 -environment(A) | -in_environment(A,B) | subpopulation(efficient_producers,A,B) # label(mp_subpopulations) # label(axiom). [clausify(9)].
% 0.44/0.98 Derived: -in_environment(c1,A) | subpopulation(efficient_producers,c1,A). [resolve(19,a,16,a)].
% 0.44/0.98 20 -environment(A) | -greater(number_of_organizations(A,B),zero) | in_environment(A,B) # label(mp_positive_and_sustains) # label(axiom). [clausify(5)].
% 0.44/0.98 Derived: -greater(number_of_organizations(c1,A),zero) | in_environment(c1,A). [resolve(20,a,16,a)].
% 0.44/0.98 21 -environment(A) | -in_environment(A,appear(first_movers,A)) | in_environment(A,appear(an_organisation,A)) # label(mp_FM_means_organisations) # label(axiom). [clausify(10)].
% 0.44/0.98 Derived: -in_environment(c1,appear(first_movers,c1)) | in_environment(c1,appear(an_organisation,c1)). [resolve(21,a,16,a)].
% 0.44/0.98 22 -environment(A) | -greater(number_of_organizations(A,B),zero) | subpopulation(f1(A,B),A,B) # label(mp_positive_sum_means_members) # label(axiom). [clausify(3)].
% 0.44/0.98 Derived: -greater(number_of_organizations(c1,A),zero) | subpopulation(f1(c1,A),c1,A). [resolve(22,a,16,a)].
% 0.44/0.98 23 -environment(A) | -greater(number_of_organizations(A,B),zero) | greater(cardinality_at_time(f1(A,B),B),zero) # label(mp_positive_sum_means_members) # label(axiom). [clausify(3)].
% 0.44/0.98 Derived: -greater(number_of_organizations(c1,A),zero) | greater(cardinality_at_time(f1(c1,A),A),zero). [resolve(23,a,16,a)].
% 0.44/0.98 24 -environment(A) | -in_environment(A,appear(an_organisation,A)) | appear(an_organisation,A) = appear(first_movers,A) # label(l13) # label(hypothesis). [clausify(13)].
% 0.44/0.98 Derived: -in_environment(c1,appear(an_organisation,c1)) | appear(an_organisation,c1) = appear(first_movers,c1). [resolve(24,a,16,a)].
% 0.44/0.98 25 -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). [clausify(2)].
% 0.44/0.98 Derived: -in_environment(c1,A) | -greater(appear(B,c1),A) | cardinality_at_time(B,A) = zero. [resolve(25,a,16,a)].
% 0.44/0.98 26 -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). [clausify(11)].
% 0.73/0.99 Derived: -in_environment(c1,A) | -greater_or_equal(A,appear(an_organisation,c1)) | greater(number_of_organizations(c1,A),zero). [resolve(26,a,16,a)].
% 0.73/0.99 27 -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). [clausify(6)].
% 0.73/0.99 Derived: -in_environment(c1,A) | -in_environment(c1,B) | -greater_or_equal(B,C) | -greater_or_equal(C,A) | in_environment(c1,C). [resolve(27,a,16,a)].
% 0.73/0.99 28 -environment(A) | -subpopulation(B,A,C) | -greater(cardinality_at_time(B,C),zero) | efficient_producers = B | first_movers = B # label(a9) # label(hypothesis). [clausify(12)].
% 0.73/0.99 Derived: -subpopulation(A,c1,B) | -greater(cardinality_at_time(A,B),zero) | efficient_producers = A | first_movers = A. [resolve(28,a,16,a)].
% 0.73/0.99 29 -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). [clausify(1)].
% 0.73/0.99 Derived: -subpopulation(A,c1,B) | -subpopulation(C,c1,B) | -greater(cardinality_at_time(A,B),zero) | cardinality_at_time(C,B) != zero | selection_favors(A,C,B). [resolve(29,a,16,a)].
% 0.73/0.99
% 0.73/0.99 ============================== end predicate elimination =============
% 0.73/0.99
% 0.73/0.99 Auto_denials: (non-Horn, no changes).
% 0.73/0.99
% 0.73/0.99 Term ordering decisions:
% 0.73/0.99
% 0.73/0.99 % Assigning unary symbol start_time kb_weight 0 and highest precedence (18).
% 0.73/0.99 Function symbol KB weights: zero=1. first_movers=1. an_organisation=1. efficient_producers=1. t=1. c1=1. c2=1. appear=1. cardinality_at_time=1. number_of_organizations=1. f1=1. start_time=0.
% 0.73/0.99
% 0.73/0.99 ============================== end of process initial clauses ========
% 0.73/0.99
% 0.73/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.73/0.99
% 0.73/0.99 ============================== end of clauses for search =============
% 0.73/0.99
% 0.73/0.99 ============================== SEARCH ================================
% 0.73/0.99
% 0.73/0.99 % Starting search at 0.01 seconds.
% 0.73/0.99
% 0.73/0.99 ============================== STATISTICS ============================
% 0.73/0.99
% 0.73/0.99 Given=73. Generated=127. Kept=79. proofs=0.
% 0.73/0.99 Usable=69. Sos=0. Demods=2. Limbo=0, Disabled=44. Hints=0.
% 0.73/0.99 Megabytes=0.15.
% 0.73/0.99 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.73/0.99
% 0.73/0.99 ============================== end of statistics =====================
% 0.73/0.99
% 0.73/0.99 ============================== end of search =========================
% 0.73/0.99
% 0.73/0.99 SEARCH FAILED
% 0.73/0.99
% 0.73/0.99 Exiting with failure.
% 0.73/0.99
% 0.73/0.99 Process 8706 exit (sos_empty) Thu Jun 9 07:32:55 2022
% 0.73/0.99 Prover9 interrupted
%------------------------------------------------------------------------------