TSTP Solution File: MGT033-2 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : MGT033-2 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n023.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.78s 1.14s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13  % Problem  : MGT033-2 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.14/0.35  % Computer : n023.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Thu Jun  9 10:22:08 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.76/1.04  ============================== Prover9 ===============================
% 0.76/1.04  Prover9 (32) version 2009-11A, November 2009.
% 0.76/1.04  Process 21109 was started by sandbox2 on n023.cluster.edu,
% 0.76/1.04  Thu Jun  9 10:22:08 2022
% 0.76/1.04  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_20956_n023.cluster.edu".
% 0.76/1.04  ============================== end of head ===========================
% 0.76/1.04  
% 0.76/1.04  ============================== INPUT =================================
% 0.76/1.04  
% 0.76/1.04  % Reading from file /tmp/Prover9_20956_n023.cluster.edu
% 0.76/1.04  
% 0.76/1.04  set(prolog_style_variables).
% 0.76/1.04  set(auto2).
% 0.76/1.04      % set(auto2) -> set(auto).
% 0.76/1.04      % set(auto) -> set(auto_inference).
% 0.76/1.04      % set(auto) -> set(auto_setup).
% 0.76/1.04      % set(auto_setup) -> set(predicate_elim).
% 0.76/1.04      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.76/1.04      % set(auto) -> set(auto_limits).
% 0.76/1.04      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.76/1.04      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.76/1.04      % set(auto) -> set(auto_denials).
% 0.76/1.04      % set(auto) -> set(auto_process).
% 0.76/1.04      % set(auto2) -> assign(new_constants, 1).
% 0.76/1.04      % set(auto2) -> assign(fold_denial_max, 3).
% 0.76/1.04      % set(auto2) -> assign(max_weight, "200.000").
% 0.76/1.04      % set(auto2) -> assign(max_hours, 1).
% 0.76/1.04      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.76/1.04      % set(auto2) -> assign(max_seconds, 0).
% 0.76/1.04      % set(auto2) -> assign(max_minutes, 5).
% 0.76/1.04      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.76/1.04      % set(auto2) -> set(sort_initial_sos).
% 0.76/1.04      % set(auto2) -> assign(sos_limit, -1).
% 0.76/1.04      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.76/1.04      % set(auto2) -> assign(max_megs, 400).
% 0.76/1.04      % set(auto2) -> assign(stats, some).
% 0.76/1.04      % set(auto2) -> clear(echo_input).
% 0.76/1.04      % set(auto2) -> set(quiet).
% 0.76/1.04      % set(auto2) -> clear(print_initial_clauses).
% 0.76/1.04      % set(auto2) -> clear(print_given).
% 0.76/1.04  assign(lrs_ticks,-1).
% 0.76/1.04  assign(sos_limit,10000).
% 0.76/1.04  assign(order,kbo).
% 0.76/1.04  set(lex_order_vars).
% 0.76/1.04  clear(print_given).
% 0.76/1.04  
% 0.76/1.04  % formulas(sos).  % not echoed (26 formulas)
% 0.76/1.04  
% 0.76/1.04  ============================== end of input ==========================
% 0.76/1.04  
% 0.76/1.04  % From the command line: assign(max_seconds, 300).
% 0.76/1.04  
% 0.76/1.04  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.76/1.04  
% 0.76/1.04  % Formulas that are not ordinary clauses:
% 0.76/1.04  
% 0.76/1.04  ============================== end of process non-clausal formulas ===
% 0.76/1.04  
% 0.76/1.04  ============================== PROCESS INITIAL CLAUSES ===============
% 0.76/1.04  
% 0.76/1.04  ============================== PREDICATE ELIMINATION =================
% 0.76/1.04  1 -environment(A) | in_environment(A,start_time(A)) # label(mp_opening_time_in_duration_31) # label(axiom).  [assumption].
% 0.76/1.04  2 environment(sk2) # label(prove_t2_45) # label(negated_conjecture).  [assumption].
% 0.76/1.04  Derived: in_environment(sk2,start_time(sk2)).  [resolve(1,a,2,a)].
% 0.76/1.04  3 -environment(A) | greater_or_equal(appear(first_movers,A),start_time(A)) # label(mp_no_FM_before_opening_32) # label(axiom).  [assumption].
% 0.76/1.04  Derived: greater_or_equal(appear(first_movers,sk2),start_time(sk2)).  [resolve(3,a,2,a)].
% 0.76/1.04  4 -environment(A) | greater_or_equal(appear(first_movers,A),appear(an_organisation,A)) # label(mp_FM_not_precede_first_34) # label(axiom).  [assumption].
% 0.76/1.04  Derived: greater_or_equal(appear(first_movers,sk2),appear(an_organisation,sk2)).  [resolve(4,a,2,a)].
% 0.76/1.04  5 -environment(A) | greater(number_of_organizations(e,appear(an_organisation,A)),zero) # label(mp_positive_number_when_appear_35) # label(axiom).  [assumption].
% 0.76/1.04  Derived: greater(number_of_organizations(e,appear(an_organisation,sk2)),zero).  [resolve(5,a,2,a)].
% 0.76/1.04  6 -environment(A) | -in_environment(A,B) | subpopulation(first_movers,A,B) # label(mp_subpopulations_36) # label(axiom).  [assumption].
% 0.76/1.04  Derived: -in_environment(sk2,A) | subpopulation(first_movers,sk2,A).  [resolve(6,a,2,a)].
% 0.76/1.04  7 -environment(A) | -in_environment(A,B) | subpopulation(efficient_producers,A,B) # label(mp_subpopulations_37) # label(axiom).  [assumption].
% 0.76/1.04  Derived: -in_environment(sk2,A) | subpopulation(efficient_producers,sk2,A).  [resolve(7,a,2,a)].
% 0.76/1.04  8 -environment(A) | greater(appear(efficient_producers,e),appear(first_movers,A)) # label(a3_43) # label(hypothesis).  [assumption].
% 0.76/1.04  Derived: greater(appear(efficient_producers,e),appear(first_movers,sk2)).  [resolve(8,a,2,a)].
% 0.76/1.04  9 -environment(A) | -greater(number_of_organizations(A,B),zero) | in_environment(A,B) # label(mp_positive_and_sustains_29) # label(axiom).  [assumption].
% 0.78/1.14  Derived: -greater(number_of_organizations(sk2,A),zero) | in_environment(sk2,A).  [resolve(9,a,2,a)].
% 0.78/1.14  10 -environment(A) | -in_environment(A,appear(first_movers,A)) | in_environment(A,appear(an_organisation,A)) # label(mp_FM_means_organisations_33) # label(axiom).  [assumption].
% 0.78/1.14  Derived: -in_environment(sk2,appear(first_movers,sk2)) | in_environment(sk2,appear(an_organisation,sk2)).  [resolve(10,a,2,a)].
% 0.78/1.14  11 -environment(A) | -greater(number_of_organizations(A,B),zero) | subpopulation(sk1(B,A),A,B) # label(mp_number_mean_non_empty_25) # label(axiom).  [assumption].
% 0.78/1.14  Derived: -greater(number_of_organizations(sk2,A),zero) | subpopulation(sk1(A,sk2),sk2,A).  [resolve(11,a,2,a)].
% 0.78/1.14  12 -environment(A) | -greater(number_of_organizations(A,B),zero) | greater(cardinality_at_time(sk1(B,A),B),zero) # label(mp_number_mean_non_empty_26) # label(axiom).  [assumption].
% 0.78/1.14  Derived: -greater(number_of_organizations(sk2,A),zero) | greater(cardinality_at_time(sk1(A,sk2),A),zero).  [resolve(12,a,2,a)].
% 0.78/1.14  13 -environment(A) | -in_environment(A,B) | -greater(appear(C,A),B) | cardinality_at_time(C,B) = zero # label(mp_not_present_before_appearance_28) # label(axiom).  [assumption].
% 0.78/1.14  Derived: -in_environment(sk2,A) | -greater(appear(B,sk2),A) | cardinality_at_time(B,A) = zero.  [resolve(13,a,2,a)].
% 0.78/1.14  14 -environment(A) | -in_environment(A,B) | -greater_or_equal(B,appear(an_organisation,A)) | greater(number_of_organizations(A,B),zero) # label(a1_42) # label(hypothesis).  [assumption].
% 0.78/1.14  Derived: -in_environment(sk2,A) | -greater_or_equal(A,appear(an_organisation,sk2)) | greater(number_of_organizations(sk2,A),zero).  [resolve(14,a,2,a)].
% 0.78/1.14  15 -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).  [assumption].
% 0.78/1.14  Derived: -in_environment(sk2,A) | -in_environment(sk2,B) | -greater_or_equal(B,C) | -greater_or_equal(C,A) | in_environment(sk2,C).  [resolve(15,a,2,a)].
% 0.78/1.14  16 -environment(A) | -subpopulation(B,A,C) | -greater(cardinality_at_time(B,C),zero) | B = efficient_producers | B = first_movers # label(a11_44) # label(hypothesis).  [assumption].
% 0.78/1.14  Derived: -subpopulation(A,sk2,B) | -greater(cardinality_at_time(A,B),zero) | A = efficient_producers | A = first_movers.  [resolve(16,a,2,a)].
% 0.78/1.14  17 -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).  [assumption].
% 0.78/1.14  Derived: -subpopulation(A,sk2,B) | -subpopulation(C,sk2,B) | -greater(cardinality_at_time(A,B),zero) | cardinality_at_time(C,B) != zero | selection_favors(A,C,B).  [resolve(17,a,2,a)].
% 0.78/1.14  
% 0.78/1.14  ============================== end predicate elimination =============
% 0.78/1.14  
% 0.78/1.14  Auto_denials:  (non-Horn, no changes).
% 0.78/1.14  
% 0.78/1.14  Term ordering decisions:
% 0.78/1.14  
% 0.78/1.14  % Assigning unary symbol start_time kb_weight 0 and highest precedence (19).
% 0.78/1.14  Function symbol KB weights:  sk2=1. zero=1. first_movers=1. an_organisation=1. efficient_producers=1. sk3=1. e=1. t=1. appear=1. cardinality_at_time=1. number_of_organizations=1. sk1=1. start_time=0.
% 0.78/1.14  
% 0.78/1.14  ============================== end of process initial clauses ========
% 0.78/1.14  
% 0.78/1.14  ============================== CLAUSES FOR SEARCH ====================
% 0.78/1.14  
% 0.78/1.14  ============================== end of clauses for search =============
% 0.78/1.14  
% 0.78/1.14  ============================== SEARCH ================================
% 0.78/1.14  
% 0.78/1.14  % Starting search at 0.01 seconds.
% 0.78/1.14  
% 0.78/1.14  ============================== STATISTICS ============================
% 0.78/1.14  
% 0.78/1.14  Given=425. Generated=969. Kept=523. proofs=0.
% 0.78/1.14  Usable=373. Sos=0. Demods=1. Limbo=0, Disabled=192. Hints=0.
% 0.78/1.14  Megabytes=0.73.
% 0.78/1.14  User_CPU=0.11, System_CPU=0.00, Wall_clock=0.
% 0.78/1.14  
% 0.78/1.14  ============================== end of statistics =====================
% 0.78/1.14  
% 0.78/1.14  ============================== end of search =========================
% 0.78/1.14  
% 0.78/1.14  SEARCH FAILED
% 0.78/1.14  
% 0.78/1.14  Exiting with failure.
% 0.78/1.14  
% 0.78/1.14  Process 21109 exit (sos_empty) Thu Jun  9 10:22:08 2022
% 0.78/1.14  Prover9 interrupted
%------------------------------------------------------------------------------