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