TSTP Solution File: MGT040-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT040-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n020.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:01 EDT 2022
% Result : Unknown 0.72s 1.03s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : MGT040-1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n020.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:09:21 EDT 2022
% 0.12/0.35 % CPUTime :
% 0.72/1.02 ============================== Prover9 ===============================
% 0.72/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.72/1.02 Process 26459 was started by sandbox2 on n020.cluster.edu,
% 0.72/1.02 Thu Jun 9 11:09:22 2022
% 0.72/1.02 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_26305_n020.cluster.edu".
% 0.72/1.02 ============================== end of head ===========================
% 0.72/1.02
% 0.72/1.02 ============================== INPUT =================================
% 0.72/1.02
% 0.72/1.02 % Reading from file /tmp/Prover9_26305_n020.cluster.edu
% 0.72/1.02
% 0.72/1.02 set(prolog_style_variables).
% 0.72/1.02 set(auto2).
% 0.72/1.02 % set(auto2) -> set(auto).
% 0.72/1.02 % set(auto) -> set(auto_inference).
% 0.72/1.02 % set(auto) -> set(auto_setup).
% 0.72/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.72/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.72/1.02 % set(auto) -> set(auto_limits).
% 0.72/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.72/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.72/1.02 % set(auto) -> set(auto_denials).
% 0.72/1.02 % set(auto) -> set(auto_process).
% 0.72/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.72/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.72/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.72/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.72/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.72/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.72/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.72/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.72/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.72/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.72/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.72/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.72/1.02 % set(auto2) -> assign(stats, some).
% 0.72/1.02 % set(auto2) -> clear(echo_input).
% 0.72/1.02 % set(auto2) -> set(quiet).
% 0.72/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.72/1.02 % set(auto2) -> clear(print_given).
% 0.72/1.02 assign(lrs_ticks,-1).
% 0.72/1.02 assign(sos_limit,10000).
% 0.72/1.02 assign(order,kbo).
% 0.72/1.02 set(lex_order_vars).
% 0.72/1.02 clear(print_given).
% 0.72/1.02
% 0.72/1.02 % formulas(sos). % not echoed (22 formulas)
% 0.72/1.02
% 0.72/1.02 ============================== end of input ==========================
% 0.72/1.02
% 0.72/1.02 % From the command line: assign(max_seconds, 300).
% 0.72/1.02
% 0.72/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.72/1.02
% 0.72/1.02 % Formulas that are not ordinary clauses:
% 0.72/1.02
% 0.72/1.02 ============================== end of process non-clausal formulas ===
% 0.72/1.02
% 0.72/1.02 ============================== PROCESS INITIAL CLAUSES ===============
% 0.72/1.02
% 0.72/1.02 ============================== PREDICATE ELIMINATION =================
% 0.72/1.02 1 -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_26) # label(axiom). [assumption].
% 0.72/1.02 2 observational_period(sk2) # label(prove_t9_41) # label(negated_conjecture). [assumption].
% 0.72/1.02 Derived: -rapid_change(sk2) | -environment(A) | -in_environment(sk2,A) | -in_environment(A,critical_point(A)). [resolve(1,a,2,a)].
% 0.72/1.02 3 -observational_period(A) | extreme(A) | -environment(B) | -in_environment(A,B) | -empty(B) # label(mp6_not_extreme_change_means_not_empty_27) # label(axiom). [assumption].
% 0.72/1.02 Derived: extreme(sk2) | -environment(A) | -in_environment(sk2,A) | -empty(A). [resolve(3,a,2,a)].
% 0.72/1.02 4 -observational_period(A) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | environment(sk1(A)) | selection_favors(efficient_producers,first_movers,A) # label(mp3_favoured_trategy_23) # label(axiom). [assumption].
% 0.72/1.02 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | environment(sk1(sk2)) | selection_favors(efficient_producers,first_movers,sk2). [resolve(4,a,2,a)].
% 0.72/1.02 5 -observational_period(A) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | in_environment(A,sk1(A)) | selection_favors(efficient_producers,first_movers,A) # label(mp3_favoured_trategy_24) # label(axiom). [assumption].
% 0.72/1.02 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | in_environment(sk2,sk1(sk2)) | selection_favors(efficient_producers,first_movers,sk2). [resolve(5,a,2,a)].
% 0.72/1.02 6 -observational_period(A) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | -selection_favors(efficient_producers,first_movers,end_time(sk1(A))) | selection_favors(efficient_producers,first_movers,A) # label(mp3_favoured_trategy_25) # label(axiom). [assumption].
% 0.72/1.02 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | -selection_favors(efficient_producers,first_movers,end_time(sk1(sk2))) | selection_favors(efficient_producers,first_movers,sk2). [resolve(6,a,2,a)].
% 0.72/1.02 7 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | environment(sk1(sk2)) | selection_favors(efficient_producers,first_movers,sk2). [resolve(4,a,2,a)].
% 0.72/1.02 8 -environment(A) | in_environment(A,end_time(A)) # label(mp_endpoint_in_environment_30) # label(axiom). [assumption].
% 0.72/1.02 9 -environment(A) | empty(A) | greater_or_equal(end_time(A),appear(an_organisation,A)) # label(mp_non_empty_means_organisations_32) # label(axiom). [assumption].
% 0.72/1.02 10 -environment(A) | in_environment(A,critical_point(A)) | greater(critical_point(A),end_time(A)) # label(mp_critical_point_not_before_opening_31) # label(axiom). [assumption].
% 0.72/1.02 11 -environment(A) | -greater_or_equal(end_time(A),appear(an_organisation,A)) | in_environment(A,appear(an_organisation,A)) # label(mp_appearance_before_end_holds_33) # label(axiom). [assumption].
% 0.72/1.02 12 -environment(A) | -in_environment(A,appear(an_organisation,A)) | appear(an_organisation,A) = appear(first_movers,A) # label(l13_40) # label(hypothesis). [assumption].
% 0.72/1.02 13 -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_38) # label(hypothesis). [assumption].
% 0.72/1.02 14 -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_39) # label(hypothesis). [assumption].
% 0.72/1.02 15 -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_34) # label(axiom). [assumption].
% 0.72/1.02 16 -environment(A) | -greater_or_equal(B,appear(efficient_producers,A)) | -greater(critical_point(A),B) | -selection_favors(first_movers,efficient_producers,B) | in_environment(A,critical_point(A)) | selection_favors(first_movers,efficient_producers,end_time(A)) # label(mp_selection_favours_in_time_35) # label(axiom). [assumption].
% 0.72/1.02 17 -rapid_change(sk2) | -environment(A) | -in_environment(sk2,A) | -in_environment(A,critical_point(A)). [resolve(1,a,2,a)].
% 0.72/1.02 18 extreme(sk2) | -environment(A) | -in_environment(sk2,A) | -empty(A). [resolve(3,a,2,a)].
% 0.72/1.02 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk2) | in_environment(sk1(sk2),end_time(sk1(sk2))). [resolve(7,c,8,a)].
% 0.72/1.02 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk2) | empty(sk1(sk2)) | greater_or_equal(end_time(sk1(sk2)),appear(an_organisation,sk1(sk2))). [resolve(7,c,9,a)].
% 0.72/1.02 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk2) | in_environment(sk1(sk2),critical_point(sk1(sk2))) | greater(critical_point(sk1(sk2)),end_time(sk1(sk2))). [resolve(7,c,10,a)].
% 0.72/1.02 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk2) | -greater_or_equal(end_time(sk1(sk2)),appear(an_organisation,sk1(sk2))) | in_environment(sk1(sk2),appear(an_organisation,sk1(sk2))). [resolve(7,c,11,a)].
% 0.72/1.02 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk2) | -in_environment(sk1(sk2),appear(an_organisation,sk1(sk2))) | appear(an_organisation,sk1(sk2)) = appear(first_movers,sk1(sk2)). [resolve(7,c,12,a)].
% 0.72/1.02 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk2) | -in_environment(sk1(sk2),A) | -greater_or_equal(A,appear(first_movers,sk1(sk2))) | -greater(appear(efficient_producers,sk1(sk2)),A) | selection_favors(first_movers,efficient_producers,A). [resolve(7,c,13,a)].
% 0.72/1.02 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk2) | -in_environment(sk1(sk2),critical_point(sk1(sk2))) | -greater_or_equal(A,appear(efficient_producers,sk1(sk2))) | -greater(critical_point(sk1(sk2)),A) | selection_favors(first_movers,efficient_producers,A). [resolve(7,c,14,a)].
% 0.72/1.02 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk2) | -greater_or_equal(A,appear(efficient_producers,sk1(sk2))) | -greater(critical_point(sk1(sk2)),A) | in_environment(sk1(sk2),critical_point(sk1(sk2))) | selection_favors(first_movers,efficient_producers,end_time(sk1(sk2))). [resolve(7,c,15,a)].
% 0.72/1.02 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk2) | -rapid_change(sk2) | -in_environment(sk2,sk1(sk2)) | -in_environment(sk1(sk2),critical_point(sk1(sk2))). [resolve(7,c,17,b)].
% 0.72/1.02 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk2) | extreme(sk2) | -in_environment(sk2,sk1(sk2)) | -empty(sk1(sk2)). [resolve(7,c,18,b)].
% 0.72/1.02
% 0.72/1.02 ============================== end predicate elimination =============
% 0.72/1.02
% 0.72/1.02 Auto_denials: (non-Horn, no changes).
% 0.72/1.02
% 0.72/1.02 Term ordering decisions:
% 0.72/1.02 Function symbol KB weights: sk2=1. efficient_producers=1. first_movers=1. an_organisation=1. appear=1. sk1=1. critical_point=1. end_time=1.
% 0.72/1.02
% 0.72/1.02 ============================== end of process initial clauses ========
% 0.72/1.02
% 0.72/1.02 ============================== CLAUSES FOR SEARCH ====================
% 0.72/1.02
% 0.72/1.02 ============================== end of clauses for search =============
% 0.72/1.02
% 0.72/1.02 ============================== SEARCH ================================
% 0.72/1.02
% 0.72/1.02 % Starting search at 0.01 seconds.
% 0.72/1.02
% 0.72/1.02 ============================== STATISTICS ============================
% 0.72/1.02
% 0.72/1.02 Given=19. Generated=19. Kept=19. proofs=0.
% 0.72/1.02 Usable=19. Sos=0. Demods=0. Limbo=0, Disabled=37. Hints=0.
% 0.72/1.02 Megabytes=0.07.
% 0.72/1.02 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.72/1.02
% 0.72/1.02 ============================== end of statistics =====================
% 0.72/1.02
% 0.72/1.02 ============================== end of search =========================
% 0.72/1.02
% 0.72/1.02 SEARCH FAILED
% 0.72/1.02
% 0.72/1.02 Exiting with failure.
% 0.72/1.02
% 0.72/1.02 Process 26459 exit (sos_empty) Thu Jun 9 11:09:22 2022
% 0.72/1.02 Prover9 interrupted
%------------------------------------------------------------------------------