TSTP Solution File: MGT041+2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT041+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 : Theorem 0.44s 0.98s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT041+2 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n027.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 9 08:12:12 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.44/0.98 ============================== Prover9 ===============================
% 0.44/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.44/0.98 Process 4751 was started by sandbox on n027.cluster.edu,
% 0.44/0.98 Thu Jun 9 08:12:13 2022
% 0.44/0.98 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_4441_n027.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_4441_n027.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 (5 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 X all T -(number_of_routines(X,T,low) & number_of_routines(X,T,high))) # label(mp_not_high_and_low) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.98 2 (all X all T (organisation_at_time(X,T) & efficient_producer(X) & founding_time(X,T) -> has_elaborated_routines(X,T))) # label(a14) # label(hypothesis) # label(non_clause). [assumption].
% 0.44/0.98 3 (all X all T (organisation_at_time(X,T) & first_mover(X) & founding_time(X,T) -> number_of_routines(X,T,low))) # label(a15) # label(hypothesis) # label(non_clause). [assumption].
% 0.44/0.98 4 (exists X exists T (organisation_at_time(X,T) & founding_time(X,T) & number_of_routines(X,T,high) & -has_elaborated_routines(X,T))) # label(a16) # label(hypothesis) # label(non_clause). [assumption].
% 0.44/0.98 5 -(exists X exists T (organisation_at_time(X,T) & -first_mover(X) & -efficient_producer(X))) # label(prove_t10) # 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 6 -organisation_at_time(A,B) | first_mover(A) | efficient_producer(A) # label(prove_t10) # label(negated_conjecture). [clausify(5)].
% 0.44/0.98 7 organisation_at_time(c1,c2) # label(a16) # label(hypothesis). [clausify(4)].
% 0.44/0.98 Derived: first_mover(c1) | efficient_producer(c1). [resolve(6,a,7,a)].
% 0.44/0.98 8 -organisation_at_time(A,B) | -efficient_producer(A) | -founding_time(A,B) | has_elaborated_routines(A,B) # label(a14) # label(hypothesis). [clausify(2)].
% 0.44/0.98 Derived: -efficient_producer(c1) | -founding_time(c1,c2) | has_elaborated_routines(c1,c2). [resolve(8,a,7,a)].
% 0.44/0.98 9 -organisation_at_time(A,B) | -first_mover(A) | -founding_time(A,B) | number_of_routines(A,B,low) # label(a15) # label(hypothesis). [clausify(3)].
% 0.44/0.98 Derived: -first_mover(c1) | -founding_time(c1,c2) | number_of_routines(c1,c2,low). [resolve(9,a,7,a)].
% 0.44/0.98 10 -efficient_producer(c1) | -founding_time(c1,c2) | has_elaborated_routines(c1,c2). [resolve(8,a,7,a)].
% 0.44/0.98 11 founding_time(c1,c2) # label(a16) # label(hypothesis). [clausify(4)].
% 0.44/0.98 Derived: -efficient_producer(c1) | has_elaborated_routines(c1,c2). [resolve(10,b,11,a)].
% 0.44/0.98 12 -first_mover(c1) | -founding_time(c1,c2) | number_of_routines(c1,c2,low). [resolve(9,a,7,a)].
% 0.44/0.98 Derived: -first_mover(c1) | number_of_routines(c1,c2,low). [resolve(12,b,11,a)].
% 0.44/0.98 13 -efficient_producer(c1) | has_elaborated_routines(c1,c2). [resolve(10,b,11,a)].
% 0.44/0.98 14 -has_elaborated_routines(c1,c2) # label(a16) # label(hypothesis). [clausify(4)].
% 0.44/0.98 Derived: -efficient_producer(c1). [resolve(13,b,14,a)].
% 0.44/0.98 15 -first_mover(c1) | number_of_routines(c1,c2,low). [resolve(12,b,11,a)].
% 0.44/0.98 16 first_mover(c1) | efficient_producer(c1). [resolve(6,a,7,a)].
% 0.44/0.98 Derived: number_of_routines(c1,c2,low) | efficient_producer(c1). [resolve(15,a,16,a)].
% 0.44/0.98 17 number_of_routines(c1,c2,low) | efficient_producer(c1). [resolve(15,a,16,a)].
% 0.44/0.98 18 -efficient_producer(c1). [resolve(13,b,14,a)].
% 0.44/0.98 Derived: number_of_routines(c1,c2,low). [resolve(17,b,18,a)].
% 0.44/0.98
% 0.44/0.98 ============================== end predicate elimination =============
% 0.44/0.98
% 0.44/0.98 Auto_denials:
% 0.44/0.98 % copying label mp_not_high_and_low to answer in negative clause
% 0.44/0.98
% 0.44/0.98 Term ordering decisions:
% 0.44/0.98 Function symbol KB weights: high=1. low=1. c1=1. c2=1.
% 0.44/0.98
% 0.44/0.98 ============================== end of process initial clauses ========
% 0.44/0.98
% 0.44/0.98 ============================== CLAUSES FOR SEARCH ====================
% 0.44/0.98
% 0.44/0.98 ============================== end of clauses for search =============
% 0.44/0.98
% 0.44/0.98 ============================== SEARCH ================================
% 0.44/0.98
% 0.44/0.98 % Starting search at 0.01 seconds.
% 0.44/0.98
% 0.44/0.98 ============================== PROOF =================================
% 0.44/0.98 % SZS status Theorem
% 0.44/0.98 % SZS output start Refutation
% 0.44/0.98
% 0.44/0.98 % Proof 1 at 0.01 (+ 0.00) seconds: mp_not_high_and_low.
% 0.44/0.98 % Length of proof is 22.
% 0.44/0.98 % Level of proof is 6.
% 0.44/0.98 % Maximum clause weight is 8.000.
% 0.44/0.98 % Given clauses 2.
% 0.44/0.98
% 0.44/0.98 1 (all X all T -(number_of_routines(X,T,low) & number_of_routines(X,T,high))) # label(mp_not_high_and_low) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.98 2 (all X all T (organisation_at_time(X,T) & efficient_producer(X) & founding_time(X,T) -> has_elaborated_routines(X,T))) # label(a14) # label(hypothesis) # label(non_clause). [assumption].
% 0.44/0.98 3 (all X all T (organisation_at_time(X,T) & first_mover(X) & founding_time(X,T) -> number_of_routines(X,T,low))) # label(a15) # label(hypothesis) # label(non_clause). [assumption].
% 0.44/0.98 4 (exists X exists T (organisation_at_time(X,T) & founding_time(X,T) & number_of_routines(X,T,high) & -has_elaborated_routines(X,T))) # label(a16) # label(hypothesis) # label(non_clause). [assumption].
% 0.44/0.98 5 -(exists X exists T (organisation_at_time(X,T) & -first_mover(X) & -efficient_producer(X))) # label(prove_t10) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.44/0.98 6 -organisation_at_time(A,B) | first_mover(A) | efficient_producer(A) # label(prove_t10) # label(negated_conjecture). [clausify(5)].
% 0.44/0.98 7 organisation_at_time(c1,c2) # label(a16) # label(hypothesis). [clausify(4)].
% 0.44/0.98 8 -organisation_at_time(A,B) | -efficient_producer(A) | -founding_time(A,B) | has_elaborated_routines(A,B) # label(a14) # label(hypothesis). [clausify(2)].
% 0.44/0.98 9 -organisation_at_time(A,B) | -first_mover(A) | -founding_time(A,B) | number_of_routines(A,B,low) # label(a15) # label(hypothesis). [clausify(3)].
% 0.44/0.98 10 -efficient_producer(c1) | -founding_time(c1,c2) | has_elaborated_routines(c1,c2). [resolve(8,a,7,a)].
% 0.44/0.98 11 founding_time(c1,c2) # label(a16) # label(hypothesis). [clausify(4)].
% 0.44/0.98 12 -first_mover(c1) | -founding_time(c1,c2) | number_of_routines(c1,c2,low). [resolve(9,a,7,a)].
% 0.44/0.98 13 -efficient_producer(c1) | has_elaborated_routines(c1,c2). [resolve(10,b,11,a)].
% 0.44/0.98 14 -has_elaborated_routines(c1,c2) # label(a16) # label(hypothesis). [clausify(4)].
% 0.44/0.98 15 -first_mover(c1) | number_of_routines(c1,c2,low). [resolve(12,b,11,a)].
% 0.44/0.98 16 first_mover(c1) | efficient_producer(c1). [resolve(6,a,7,a)].
% 0.44/0.98 17 number_of_routines(c1,c2,low) | efficient_producer(c1). [resolve(15,a,16,a)].
% 0.44/0.98 18 -efficient_producer(c1). [resolve(13,b,14,a)].
% 0.44/0.98 19 number_of_routines(c1,c2,high) # label(a16) # label(hypothesis). [clausify(4)].
% 0.44/0.98 20 -number_of_routines(A,B,low) | -number_of_routines(A,B,high) # label(mp_not_high_and_low) # label(axiom) # answer(mp_not_high_and_low). [clausify(1)].
% 0.44/0.98 21 number_of_routines(c1,c2,low). [resolve(17,b,18,a)].
% 0.44/0.98 22 $F # answer(mp_not_high_and_low). [resolve(20,b,19,a),unit_del(a,21)].
% 0.44/0.98
% 0.44/0.98 % SZS output end Refutation
% 0.44/0.98 ============================== end of proof ==========================
% 0.44/0.98
% 0.44/0.98 ============================== STATISTICS ============================
% 0.44/0.98
% 0.44/0.98 Given=2. Generated=4. Kept=3. proofs=1.
% 0.44/0.98 Usable=2. Sos=1. Demods=0. Limbo=0, Disabled=16. Hints=0.
% 0.44/0.98 Megabytes=0.03.
% 0.44/0.98 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.44/0.98
% 0.44/0.98 ============================== end of statistics =====================
% 0.44/0.98
% 0.44/0.98 ============================== end of search =========================
% 0.44/0.98
% 0.44/0.98 THEOREM PROVED
% 0.44/0.98 % SZS status Theorem
% 0.44/0.98
% 0.44/0.98 Exiting with 1 proof.
% 0.44/0.98
% 0.44/0.98 Process 4751 exit (max_proofs) Thu Jun 9 08:12:13 2022
% 0.44/0.98 Prover9 interrupted
%------------------------------------------------------------------------------