TSTP Solution File: MGT049+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT049+1 : TPTP v8.1.0. Released v2.4.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:06 EDT 2022
% Result : Theorem 0.45s 0.99s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : MGT049+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/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 10:52:57 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.45/0.99 ============================== Prover9 ===============================
% 0.45/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.45/0.99 Process 10608 was started by sandbox2 on n027.cluster.edu,
% 0.45/0.99 Thu Jun 9 10:52:58 2022
% 0.45/0.99 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_10454_n027.cluster.edu".
% 0.45/0.99 ============================== end of head ===========================
% 0.45/0.99
% 0.45/0.99 ============================== INPUT =================================
% 0.45/0.99
% 0.45/0.99 % Reading from file /tmp/Prover9_10454_n027.cluster.edu
% 0.45/0.99
% 0.45/0.99 set(prolog_style_variables).
% 0.45/0.99 set(auto2).
% 0.45/0.99 % set(auto2) -> set(auto).
% 0.45/0.99 % set(auto) -> set(auto_inference).
% 0.45/0.99 % set(auto) -> set(auto_setup).
% 0.45/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.45/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/0.99 % set(auto) -> set(auto_limits).
% 0.45/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/0.99 % set(auto) -> set(auto_denials).
% 0.45/0.99 % set(auto) -> set(auto_process).
% 0.45/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.45/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.45/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.45/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.45/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.45/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.45/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.45/0.99 % set(auto2) -> assign(stats, some).
% 0.45/0.99 % set(auto2) -> clear(echo_input).
% 0.45/0.99 % set(auto2) -> set(quiet).
% 0.45/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.45/0.99 % set(auto2) -> clear(print_given).
% 0.45/0.99 assign(lrs_ticks,-1).
% 0.45/0.99 assign(sos_limit,10000).
% 0.45/0.99 assign(order,kbo).
% 0.45/0.99 set(lex_order_vars).
% 0.45/0.99 clear(print_given).
% 0.45/0.99
% 0.45/0.99 % formulas(sos). % not echoed (9 formulas)
% 0.45/0.99
% 0.45/0.99 ============================== end of input ==========================
% 0.45/0.99
% 0.45/0.99 % From the command line: assign(max_seconds, 300).
% 0.45/0.99
% 0.45/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/0.99
% 0.45/0.99 % Formulas that are not ordinary clauses:
% 0.45/0.99 1 (all X all Y (smaller_or_equal(X,Y) <-> smaller(X,Y) | X = Y)) # label(definition_smaller_or_equal) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.99 2 (all X all Y (greater_or_equal(X,Y) <-> greater(X,Y) | X = Y)) # label(definition_greater_or_equal) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.99 3 (all X all Y (smaller(X,Y) <-> greater(Y,X))) # label(definition_smaller) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.99 4 (all X all Y -(greater(X,Y) & greater(Y,X))) # label(meaning_postulate_greater_strict) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.99 5 (all X all Y all Z (greater(X,Y) & greater(Y,Z) -> greater(X,Z))) # label(meaning_postulate_greater_transitive) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.99 6 (all X all Y (smaller(X,Y) | X = Y | greater(X,Y))) # label(meaning_postulate_greater_comparable) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.99 7 (all X all T0 all T (organization(X) -> (greater(external_ties(X,T),external_ties(X,T0)) -> greater(position(X,T),position(X,T0))) & (external_ties(X,T) = external_ties(X,T0) -> position(X,T) = position(X,T0)))) # label(assumption_6) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.99 8 (all X all T0 all T (organization(X) -> external_ties(X,T) = external_ties(X,T0))) # label(assumption_11) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.99 9 -(all X all T0 all T (organization(X) & greater(age(X,T),age(X,T0)) -> position(X,T) = position(X,T0))) # label(lemma_6) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.45/0.99
% 0.45/0.99 ============================== end of process non-clausal formulas ===
% 0.45/0.99
% 0.45/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/0.99
% 0.45/0.99 ============================== PREDICATE ELIMINATION =================
% 0.45/0.99 10 -organization(A) | external_ties(A,B) = external_ties(A,C) # label(assumption_11) # label(axiom). [clausify(8)].
% 0.45/0.99 11 organization(c1) # label(lemma_6) # label(negated_conjecture). [clausify(9)].
% 0.45/0.99 Derived: external_ties(c1,A) = external_ties(c1,B). [resolve(10,a,11,a)].
% 0.45/0.99 12 -organization(A) | -greater(external_ties(A,B),external_ties(A,C)) | greater(position(A,B),position(A,C)) # label(assumption_6) # label(axiom). [clausify(7)].
% 0.45/0.99 Derived: -greater(external_ties(c1,A),external_ties(c1,B)) | greater(position(c1,A),position(c1,B)). [resolve(12,a,11,a)].
% 0.45/0.99 13 -organization(A) | external_ties(A,B) != external_ties(A,C) | position(A,B) = position(A,C) # label(assumption_6) # label(axiom). [clausify(7)].
% 0.45/0.99 Derived: external_ties(c1,A) != external_ties(c1,B) | position(c1,A) = position(c1,B). [resolve(13,a,11,a)].
% 0.45/0.99 14 smaller_or_equal(A,B) | -smaller(A,B) # label(definition_smaller_or_equal) # label(axiom). [clausify(1)].
% 0.45/0.99 15 smaller(A,B) | B = A | greater(A,B) # label(meaning_postulate_greater_comparable) # label(axiom). [clausify(6)].
% 0.45/0.99 Derived: smaller_or_equal(A,B) | B = A | greater(A,B). [resolve(14,b,15,a)].
% 0.45/0.99 16 -smaller(A,B) | greater(B,A) # label(definition_smaller) # label(axiom). [clausify(3)].
% 0.45/0.99 Derived: greater(A,B) | A = B | greater(B,A). [resolve(16,a,15,a)].
% 0.45/0.99 17 smaller(A,B) | -greater(B,A) # label(definition_smaller) # label(axiom). [clausify(3)].
% 0.45/0.99 Derived: -greater(A,B) | smaller_or_equal(B,A). [resolve(17,a,14,b)].
% 0.45/0.99 18 -smaller_or_equal(A,B) | smaller(A,B) | B = A # label(definition_smaller_or_equal) # label(axiom). [clausify(1)].
% 0.45/0.99 Derived: -smaller_or_equal(A,B) | B = A | greater(B,A). [resolve(18,b,16,a)].
% 0.45/0.99 19 -smaller_or_equal(A,B) | B = A | greater(B,A). [resolve(18,b,16,a)].
% 0.45/0.99 20 smaller_or_equal(A,B) | B != A # label(definition_smaller_or_equal) # label(axiom). [clausify(1)].
% 0.45/0.99 21 smaller_or_equal(A,B) | B = A | greater(A,B). [resolve(14,b,15,a)].
% 0.45/0.99 22 -greater(A,B) | smaller_or_equal(B,A). [resolve(17,a,14,b)].
% 0.45/0.99 Derived: A = B | greater(A,B) | A = B | greater(B,A). [resolve(19,a,21,a)].
% 0.45/0.99 23 -greater_or_equal(A,B) | greater(A,B) | B = A # label(definition_greater_or_equal) # label(axiom). [clausify(2)].
% 0.45/0.99 24 greater_or_equal(A,B) | -greater(A,B) # label(definition_greater_or_equal) # label(axiom). [clausify(2)].
% 0.45/0.99 25 greater_or_equal(A,B) | B != A # label(definition_greater_or_equal) # label(axiom). [clausify(2)].
% 0.45/0.99
% 0.45/0.99 ============================== end predicate elimination =============
% 0.45/0.99
% 0.45/0.99 Auto_denials: (non-Horn, no changes).
% 0.45/0.99
% 0.45/0.99 Term ordering decisions:
% 0.45/0.99 Function symbol KB weights: c1=1. c2=1. c3=1. external_ties=1. position=1. age=1.
% 0.45/0.99
% 0.45/0.99 ============================== PROOF =================================
% 0.45/0.99 % SZS status Theorem
% 0.45/0.99 % SZS output start Refutation
% 0.45/0.99
% 0.45/0.99 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.45/0.99 % Length of proof is 11.
% 0.45/0.99 % Level of proof is 4.
% 0.45/0.99 % Maximum clause weight is 7.000.
% 0.45/0.99 % Given clauses 0.
% 0.45/0.99
% 0.45/0.99 7 (all X all T0 all T (organization(X) -> (greater(external_ties(X,T),external_ties(X,T0)) -> greater(position(X,T),position(X,T0))) & (external_ties(X,T) = external_ties(X,T0) -> position(X,T) = position(X,T0)))) # label(assumption_6) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.99 8 (all X all T0 all T (organization(X) -> external_ties(X,T) = external_ties(X,T0))) # label(assumption_11) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.99 9 -(all X all T0 all T (organization(X) & greater(age(X,T),age(X,T0)) -> position(X,T) = position(X,T0))) # label(lemma_6) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.45/0.99 10 -organization(A) | external_ties(A,B) = external_ties(A,C) # label(assumption_11) # label(axiom). [clausify(8)].
% 0.45/0.99 11 organization(c1) # label(lemma_6) # label(negated_conjecture). [clausify(9)].
% 0.45/0.99 13 -organization(A) | external_ties(A,B) != external_ties(A,C) | position(A,B) = position(A,C) # label(assumption_6) # label(axiom). [clausify(7)].
% 0.45/0.99 28 position(c1,c3) != position(c1,c2) # label(lemma_6) # label(negated_conjecture). [clausify(9)].
% 0.45/0.99 30 external_ties(c1,A) = external_ties(c1,B). [resolve(10,a,11,a)].
% 0.45/0.99 32 external_ties(c1,A) != external_ties(c1,B) | position(c1,A) = position(c1,B). [resolve(13,a,11,a)].
% 0.45/0.99 33 position(c1,A) = position(c1,B). [copy(32),unit_del(a,30)].
% 0.45/0.99 34 $F. [resolve(33,a,28,a)].
% 0.45/0.99
% 0.45/0.99 % SZS output end Refutation
% 0.45/0.99 ============================== end of proof ==========================
% 0.45/0.99
% 0.45/0.99 ============================== STATISTICS ============================
% 0.45/0.99
% 0.45/0.99 Given=0. Generated=7. Kept=7. proofs=1.
% 0.45/0.99 Usable=0. Sos=0. Demods=0. Limbo=6, Disabled=23. Hints=0.
% 0.45/0.99 Megabytes=0.04.
% 0.45/0.99 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.45/0.99
% 0.45/0.99 ============================== end of statistics =====================
% 0.45/0.99
% 0.45/0.99 ============================== end of search =========================
% 0.45/0.99
% 0.45/0.99 THEOREM PROVED
% 0.45/0.99 % SZS status Theorem
% 0.45/0.99
% 0.45/0.99 Exiting with 1 proof.
% 0.45/0.99
% 0.45/0.99 Process 10608 exit (max_proofs) Thu Jun 9 10:52:58 2022
% 0.45/0.99 Prover9 interrupted
%------------------------------------------------------------------------------