TSTP Solution File: MGT040+2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT040+2 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n027.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:23:02 EDT 2022
% Result : Unknown 0.66s 0.98s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : MGT040+2 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n027.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 10:53:27 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.66/0.97 ============================== Prover9 ===============================
% 0.66/0.97 Prover9 (32) version 2009-11A, November 2009.
% 0.66/0.97 Process 12479 was started by sandbox on n027.cluster.edu,
% 0.66/0.97 Thu Jun 9 10:53:28 2022
% 0.66/0.97 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_12321_n027.cluster.edu".
% 0.66/0.97 ============================== end of head ===========================
% 0.66/0.97
% 0.66/0.97 ============================== INPUT =================================
% 0.66/0.97
% 0.66/0.97 % Reading from file /tmp/Prover9_12321_n027.cluster.edu
% 0.66/0.97
% 0.66/0.97 set(prolog_style_variables).
% 0.66/0.97 set(auto2).
% 0.66/0.97 % set(auto2) -> set(auto).
% 0.66/0.97 % set(auto) -> set(auto_inference).
% 0.66/0.97 % set(auto) -> set(auto_setup).
% 0.66/0.97 % set(auto_setup) -> set(predicate_elim).
% 0.66/0.97 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.66/0.97 % set(auto) -> set(auto_limits).
% 0.66/0.97 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.66/0.97 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.66/0.97 % set(auto) -> set(auto_denials).
% 0.66/0.97 % set(auto) -> set(auto_process).
% 0.66/0.97 % set(auto2) -> assign(new_constants, 1).
% 0.66/0.97 % set(auto2) -> assign(fold_denial_max, 3).
% 0.66/0.97 % set(auto2) -> assign(max_weight, "200.000").
% 0.66/0.97 % set(auto2) -> assign(max_hours, 1).
% 0.66/0.97 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.66/0.97 % set(auto2) -> assign(max_seconds, 0).
% 0.66/0.97 % set(auto2) -> assign(max_minutes, 5).
% 0.66/0.97 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.66/0.97 % set(auto2) -> set(sort_initial_sos).
% 0.66/0.97 % set(auto2) -> assign(sos_limit, -1).
% 0.66/0.97 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.66/0.97 % set(auto2) -> assign(max_megs, 400).
% 0.66/0.97 % set(auto2) -> assign(stats, some).
% 0.66/0.97 % set(auto2) -> clear(echo_input).
% 0.66/0.97 % set(auto2) -> set(quiet).
% 0.66/0.97 % set(auto2) -> clear(print_initial_clauses).
% 0.66/0.97 % set(auto2) -> clear(print_given).
% 0.66/0.97 assign(lrs_ticks,-1).
% 0.66/0.97 assign(sos_limit,10000).
% 0.66/0.97 assign(order,kbo).
% 0.66/0.97 set(lex_order_vars).
% 0.66/0.97 clear(print_given).
% 0.66/0.97
% 0.66/0.97 % formulas(sos). % not echoed (14 formulas)
% 0.66/0.97
% 0.66/0.97 ============================== end of input ==========================
% 0.66/0.97
% 0.66/0.97 % From the command line: assign(max_seconds, 300).
% 0.66/0.97
% 0.66/0.97 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.66/0.97
% 0.66/0.97 % Formulas that are not ordinary clauses:
% 0.66/0.97 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.66/0.97 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.66/0.97 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.66/0.97 4 (all E (environment(E) -> in_environment(E,end_time(E)))) # label(mp_endpoint_in_environment) # label(axiom) # label(non_clause). [assumption].
% 0.66/0.97 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.66/0.97 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.66/0.97 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.66/0.97 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.66/0.97 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.66/0.97 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.66/0.97 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.66/0.97 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.66/0.97
% 0.66/0.97 ============================== end of process non-clausal formulas ===
% 0.66/0.97
% 0.66/0.97 ============================== PROCESS INITIAL CLAUSES ===============
% 0.66/0.97
% 0.66/0.97 ============================== PREDICATE ELIMINATION =================
% 0.66/0.97 13 -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). [clausify(2)].
% 0.66/0.97 14 observational_period(c1) # label(prove_t9) # label(negated_conjecture). [clausify(12)].
% 0.66/0.97 Derived: -rapid_change(c1) | -environment(A) | -in_environment(c1,A) | -in_environment(A,critical_point(A)). [resolve(13,a,14,a)].
% 0.66/0.97 15 -observational_period(A) | extreme(A) | -environment(B) | -in_environment(A,B) | -empty(B) # label(mp6_not_extreme_change_means_not_empty) # label(axiom). [clausify(3)].
% 0.66/0.97 Derived: extreme(c1) | -environment(A) | -in_environment(c1,A) | -empty(A). [resolve(15,a,14,a)].
% 0.66/0.97 16 -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). [clausify(1)].
% 0.66/0.97 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | environment(f1(c1)) | selection_favors(efficient_producers,first_movers,c1). [resolve(16,a,14,a)].
% 0.66/0.97 17 -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). [clausify(1)].
% 0.66/0.97 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | in_environment(c1,f1(c1)) | selection_favors(efficient_producers,first_movers,c1). [resolve(17,a,14,a)].
% 0.66/0.97 18 -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). [clausify(1)].
% 0.66/0.97 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | -selection_favors(efficient_producers,first_movers,end_time(f1(c1))) | selection_favors(efficient_producers,first_movers,c1). [resolve(18,a,14,a)].
% 0.66/0.97 19 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | environment(f1(c1)) | selection_favors(efficient_producers,first_movers,c1). [resolve(16,a,14,a)].
% 0.66/0.97 20 -environment(A) | in_environment(A,end_time(A)) # label(mp_endpoint_in_environment) # label(axiom). [clausify(4)].
% 0.66/0.97 21 -environment(A) | empty(A) | greater_or_equal(end_time(A),appear(an_organisation,A)) # label(mp_non_empty_means_organisations) # label(axiom). [clausify(6)].
% 0.66/0.97 22 -environment(A) | in_environment(A,critical_point(A)) | greater(critical_point(A),end_time(A)) # label(mp_critical_point_not_before_opening) # label(axiom). [clausify(5)].
% 0.66/0.97 23 -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). [clausify(10)].
% 0.66/0.97 24 -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). [clausify(11)].
% 0.66/0.97 25 -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). [clausify(7)].
% 0.66/0.97 26 -rapid_change(c1) | -environment(A) | -in_environment(c1,A) | -in_environment(A,critical_point(A)). [resolve(13,a,14,a)].
% 0.66/0.97 27 extreme(c1) | -environment(A) | -in_environment(c1,A) | -empty(A). [resolve(15,a,14,a)].
% 0.66/0.97 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1) | in_environment(f1(c1),end_time(f1(c1))). [resolve(19,c,20,a)].
% 0.66/0.97 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1) | empty(f1(c1)) | greater_or_equal(end_time(f1(c1)),appear(an_organisation,f1(c1))). [resolve(19,c,21,a)].
% 0.66/0.97 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1) | in_environment(f1(c1),critical_point(f1(c1))) | greater(critical_point(f1(c1)),end_time(f1(c1))). [resolve(19,c,22,a)].
% 0.66/0.97 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1) | -in_environment(f1(c1),A) | -greater_or_equal(A,appear(first_movers,f1(c1))) | -greater(appear(efficient_producers,f1(c1)),A) | selection_favors(first_movers,efficient_producers,A). [resolve(19,c,23,a)].
% 0.66/0.97 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1) | -in_environment(f1(c1),critical_point(f1(c1))) | -greater_or_equal(A,appear(efficient_producers,f1(c1))) | -greater(critical_point(f1(c1)),A) | selection_favors(first_movers,efficient_producers,A). [resolve(19,c,24,a)].
% 0.66/0.97 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1) | -greater_or_equal(A,appear(efficient_producers,f1(c1))) | -greater(critical_point(f1(c1)),A) | in_environment(f1(c1),critical_point(f1(c1))) | selection_favors(first_movers,efficient_producers,end_time(f1(c1))). [resolve(19,c,25,a)].
% 0.66/0.97 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1) | -rapid_change(c1) | -in_environment(c1,f1(c1)) | -in_environment(f1(c1),critical_point(f1(c1))). [resolve(19,c,26,b)].
% 0.66/0.97 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1) | extreme(c1) | -in_environment(c1,f1(c1)) | -empty(f1(c1)). [resolve(19,c,27,b)].
% 0.66/0.97
% 0.66/0.97 ============================== end predicate elimination =============
% 0.66/0.97
% 0.66/0.97 Auto_denials: (non-Horn, no changes).
% 0.66/0.97
% 0.66/0.97 Term ordering decisions:
% 0.66/0.97 Function symbol KB weights: efficient_producers=1. first_movers=1. an_organisation=1. c1=1. appear=1. critical_point=1. end_time=1. f1=1.
% 0.66/0.97
% 0.66/0.97 ============================== end of process initial clauses ========
% 0.66/0.97
% 0.66/0.97 ============================== CLAUSES FOR SEARCH ====================
% 0.66/0.97
% 0.66/0.97 ============================== end of clauses for search =============
% 0.66/0.97
% 0.66/0.97 ============================== SEARCH ================================
% 0.66/0.97
% 0.66/0.97 % Starting search at 0.01 seconds.
% 0.66/0.97
% 0.66/0.97 ============================== STATISTICS ============================
% 0.66/0.97
% 0.66/0.97 Given=17. Generated=17. Kept=17. proofs=0.
% 0.66/0.97 Usable=17. Sos=0. Demods=0. Limbo=0, Disabled=32. Hints=0.
% 0.66/0.97 Megabytes=0.08.
% 0.66/0.97 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.66/0.97
% 0.66/0.97 ============================== end of statistics =====================
% 0.66/0.97
% 0.66/0.97 ============================== end of search =========================
% 0.66/0.97
% 0.66/0.97 SEARCH FAILED
% 0.66/0.97
% 0.66/0.97 Exiting with failure.
% 0.66/0.97
% 0.66/0.97 Process 12479 exit (sos_empty) Thu Jun 9 10:53:28 2022
% 0.66/0.97 Prover9 interrupted
%------------------------------------------------------------------------------