TSTP Solution File: MGT053+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT053+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n021.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:08 EDT 2022
% Result : Theorem 0.68s 0.97s
% Output : Refutation 0.68s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : MGT053+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n021.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jun 9 09:23:08 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.68/0.97 ============================== Prover9 ===============================
% 0.68/0.97 Prover9 (32) version 2009-11A, November 2009.
% 0.68/0.97 Process 13564 was started by sandbox2 on n021.cluster.edu,
% 0.68/0.97 Thu Jun 9 09:23:08 2022
% 0.68/0.97 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_13411_n021.cluster.edu".
% 0.68/0.97 ============================== end of head ===========================
% 0.68/0.97
% 0.68/0.97 ============================== INPUT =================================
% 0.68/0.97
% 0.68/0.97 % Reading from file /tmp/Prover9_13411_n021.cluster.edu
% 0.68/0.97
% 0.68/0.97 set(prolog_style_variables).
% 0.68/0.97 set(auto2).
% 0.68/0.97 % set(auto2) -> set(auto).
% 0.68/0.97 % set(auto) -> set(auto_inference).
% 0.68/0.97 % set(auto) -> set(auto_setup).
% 0.68/0.97 % set(auto_setup) -> set(predicate_elim).
% 0.68/0.97 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.68/0.97 % set(auto) -> set(auto_limits).
% 0.68/0.97 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.68/0.97 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.68/0.97 % set(auto) -> set(auto_denials).
% 0.68/0.97 % set(auto) -> set(auto_process).
% 0.68/0.97 % set(auto2) -> assign(new_constants, 1).
% 0.68/0.97 % set(auto2) -> assign(fold_denial_max, 3).
% 0.68/0.97 % set(auto2) -> assign(max_weight, "200.000").
% 0.68/0.97 % set(auto2) -> assign(max_hours, 1).
% 0.68/0.97 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.68/0.97 % set(auto2) -> assign(max_seconds, 0).
% 0.68/0.97 % set(auto2) -> assign(max_minutes, 5).
% 0.68/0.97 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.68/0.97 % set(auto2) -> set(sort_initial_sos).
% 0.68/0.97 % set(auto2) -> assign(sos_limit, -1).
% 0.68/0.97 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.68/0.97 % set(auto2) -> assign(max_megs, 400).
% 0.68/0.97 % set(auto2) -> assign(stats, some).
% 0.68/0.97 % set(auto2) -> clear(echo_input).
% 0.68/0.97 % set(auto2) -> set(quiet).
% 0.68/0.97 % set(auto2) -> clear(print_initial_clauses).
% 0.68/0.97 % set(auto2) -> clear(print_given).
% 0.68/0.97 assign(lrs_ticks,-1).
% 0.68/0.97 assign(sos_limit,10000).
% 0.68/0.97 assign(order,kbo).
% 0.68/0.97 set(lex_order_vars).
% 0.68/0.97 clear(print_given).
% 0.68/0.97
% 0.68/0.97 % formulas(sos). % not echoed (8 formulas)
% 0.68/0.97
% 0.68/0.97 ============================== end of input ==========================
% 0.68/0.97
% 0.68/0.97 % From the command line: assign(max_seconds, 300).
% 0.68/0.97
% 0.68/0.97 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.68/0.97
% 0.68/0.97 % Formulas that are not ordinary clauses:
% 0.68/0.97 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.68/0.97 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.68/0.97 3 (all X all Y (smaller(X,Y) <-> greater(Y,X))) # label(definition_smaller) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.97 4 (all X all Y -(greater(X,Y) & greater(Y,X))) # label(meaning_postulate_greater_strict) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.97 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.68/0.97 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.68/0.97 7 (all X all T0 all T (dissimilar(X,T0,T) <-> organization(X) & -(is_aligned(X,T0) <-> is_aligned(X,T)))) # label(definition_2) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.97 8 -(all X all T1 all T2 (dissimilar(X,T1,T2) <-> dissimilar(X,T2,T1))) # label(lemma_7) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.68/0.97
% 0.68/0.97 ============================== end of process non-clausal formulas ===
% 0.68/0.97
% 0.68/0.97 ============================== PROCESS INITIAL CLAUSES ===============
% 0.68/0.97
% 0.68/0.97 ============================== PREDICATE ELIMINATION =================
% 0.68/0.97 9 smaller_or_equal(A,B) | -smaller(A,B) # label(definition_smaller_or_equal) # label(axiom). [clausify(1)].
% 0.68/0.97 10 smaller(A,B) | B = A | greater(A,B) # label(meaning_postulate_greater_comparable) # label(axiom). [clausify(6)].
% 0.68/0.97 Derived: smaller_or_equal(A,B) | B = A | greater(A,B). [resolve(9,b,10,a)].
% 0.68/0.97 11 -smaller(A,B) | greater(B,A) # label(definition_smaller) # label(axiom). [clausify(3)].
% 0.68/0.97 Derived: greater(A,B) | A = B | greater(B,A). [resolve(11,a,10,a)].
% 0.68/0.97 12 smaller(A,B) | -greater(B,A) # label(definition_smaller) # label(axiom). [clausify(3)].
% 0.68/0.97 Derived: -greater(A,B) | smaller_or_equal(B,A). [resolve(12,a,9,b)].
% 0.68/0.97 13 -smaller_or_equal(A,B) | smaller(A,B) | B = A # label(definition_smaller_or_equal) # label(axiom). [clausify(1)].
% 0.68/0.97 Derived: -smaller_or_equal(A,B) | B = A | greater(B,A). [resolve(13,b,11,a)].
% 0.68/0.97 14 -smaller_or_equal(A,B) | B = A | greater(B,A). [resolve(13,b,11,a)].
% 0.68/0.97 15 smaller_or_equal(A,B) | B != A # label(definition_smaller_or_equal) # label(axiom). [clausify(1)].
% 0.68/0.97 16 smaller_or_equal(A,B) | B = A | greater(A,B). [resolve(9,b,10,a)].
% 0.68/0.97 17 -greater(A,B) | smaller_or_equal(B,A). [resolve(12,a,9,b)].
% 0.68/0.97 Derived: A = B | greater(A,B) | A = B | greater(B,A). [resolve(14,a,16,a)].
% 0.68/0.97 18 -greater_or_equal(A,B) | greater(A,B) | B = A # label(definition_greater_or_equal) # label(axiom). [clausify(2)].
% 0.68/0.97 19 greater_or_equal(A,B) | -greater(A,B) # label(definition_greater_or_equal) # label(axiom). [clausify(2)].
% 0.68/0.97 20 greater_or_equal(A,B) | B != A # label(definition_greater_or_equal) # label(axiom). [clausify(2)].
% 0.68/0.97 21 dissimilar(A,B,C) | -organization(A) | -is_aligned(A,B) | is_aligned(A,C) # label(definition_2) # label(axiom). [clausify(7)].
% 0.68/0.97 22 -dissimilar(A,B,C) | organization(A) # label(definition_2) # label(axiom). [clausify(7)].
% 0.68/0.97 Derived: dissimilar(A,B,C) | -is_aligned(A,B) | is_aligned(A,C) | -dissimilar(A,D,E). [resolve(21,b,22,b)].
% 0.68/0.97 23 dissimilar(A,B,C) | -organization(A) | is_aligned(A,B) | -is_aligned(A,C) # label(definition_2) # label(axiom). [clausify(7)].
% 0.68/0.97 Derived: dissimilar(A,B,C) | is_aligned(A,B) | -is_aligned(A,C) | -dissimilar(A,D,E). [resolve(23,b,22,b)].
% 0.68/0.97
% 0.68/0.97 ============================== end predicate elimination =============
% 0.68/0.97
% 0.68/0.97 Auto_denials: (non-Horn, no changes).
% 0.68/0.97
% 0.68/0.97 Term ordering decisions:
% 0.68/0.97 Function symbol KB weights: c1=1. c2=1. c3=1.
% 0.68/0.97
% 0.68/0.97 ============================== end of process initial clauses ========
% 0.68/0.97
% 0.68/0.97 ============================== CLAUSES FOR SEARCH ====================
% 0.68/0.97
% 0.68/0.97 ============================== end of clauses for search =============
% 0.68/0.97
% 0.68/0.97 ============================== SEARCH ================================
% 0.68/0.97
% 0.68/0.97 % Starting search at 0.01 seconds.
% 0.68/0.97
% 0.68/0.97 ============================== PROOF =================================
% 0.68/0.97 % SZS status Theorem
% 0.68/0.97 % SZS output start Refutation
% 0.68/0.97
% 0.68/0.97 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.68/0.97 % Length of proof is 33.
% 0.68/0.97 % Level of proof is 18.
% 0.68/0.97 % Maximum clause weight is 14.000.
% 0.68/0.97 % Given clauses 33.
% 0.68/0.97
% 0.68/0.97 7 (all X all T0 all T (dissimilar(X,T0,T) <-> organization(X) & -(is_aligned(X,T0) <-> is_aligned(X,T)))) # label(definition_2) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.97 8 -(all X all T1 all T2 (dissimilar(X,T1,T2) <-> dissimilar(X,T2,T1))) # label(lemma_7) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.68/0.97 21 dissimilar(A,B,C) | -organization(A) | -is_aligned(A,B) | is_aligned(A,C) # label(definition_2) # label(axiom). [clausify(7)].
% 0.68/0.97 22 -dissimilar(A,B,C) | organization(A) # label(definition_2) # label(axiom). [clausify(7)].
% 0.68/0.97 23 dissimilar(A,B,C) | -organization(A) | is_aligned(A,B) | -is_aligned(A,C) # label(definition_2) # label(axiom). [clausify(7)].
% 0.68/0.97 24 dissimilar(c1,c2,c3) | dissimilar(c1,c3,c2) # label(lemma_7) # label(negated_conjecture). [clausify(8)].
% 0.68/0.97 26 -dissimilar(c1,c2,c3) | -dissimilar(c1,c3,c2) # label(lemma_7) # label(negated_conjecture). [clausify(8)].
% 0.68/0.97 27 -dissimilar(A,B,C) | -is_aligned(A,B) | -is_aligned(A,C) # label(definition_2) # label(axiom). [clausify(7)].
% 0.68/0.97 29 -dissimilar(A,B,C) | is_aligned(A,B) | is_aligned(A,C) # label(definition_2) # label(axiom). [clausify(7)].
% 0.68/0.97 32 dissimilar(A,B,C) | -is_aligned(A,B) | is_aligned(A,C) | -dissimilar(A,D,E). [resolve(21,b,22,b)].
% 0.68/0.97 33 dissimilar(A,B,C) | is_aligned(A,B) | -is_aligned(A,C) | -dissimilar(A,D,E). [resolve(23,b,22,b)].
% 0.68/0.97 37 -is_aligned(c1,c3) | -is_aligned(c1,c2) | dissimilar(c1,c2,c3). [resolve(27,a,24,b)].
% 0.68/0.97 38 is_aligned(c1,c3) | is_aligned(c1,c2) | dissimilar(c1,c2,c3). [resolve(29,a,24,b)].
% 0.68/0.97 43 dissimilar(c1,A,B) | -is_aligned(c1,A) | is_aligned(c1,B) | dissimilar(c1,c2,c3). [resolve(32,d,24,b)].
% 0.68/0.97 44 dissimilar(c1,c2,c3) | -is_aligned(c1,c2) | is_aligned(c1,c3). [factor(43,a,d)].
% 0.68/0.97 45 dissimilar(c1,A,B) | is_aligned(c1,A) | -is_aligned(c1,B) | dissimilar(c1,c2,c3). [resolve(33,d,24,b)].
% 0.68/0.97 46 dissimilar(c1,c2,c3) | is_aligned(c1,c2) | -is_aligned(c1,c3). [factor(45,a,d)].
% 0.68/0.97 49 is_aligned(c1,c3) | is_aligned(c1,c2). [resolve(38,c,29,a),merge(c),merge(d)].
% 0.68/0.97 50 dissimilar(c1,c2,c3) | is_aligned(c1,c2). [resolve(46,c,49,a),merge(c)].
% 0.68/0.97 54 is_aligned(c1,c2) | dissimilar(c1,A,B) | -is_aligned(c1,A) | is_aligned(c1,B). [resolve(50,a,32,d)].
% 0.68/0.97 56 is_aligned(c1,c2) | dissimilar(c1,A,c2) | -is_aligned(c1,A). [factor(54,a,d)].
% 0.68/0.97 57 is_aligned(c1,c2) | dissimilar(c1,c3,c2). [resolve(56,c,49,a),merge(c)].
% 0.68/0.97 58 is_aligned(c1,c2) | -dissimilar(c1,c2,c3). [resolve(57,b,26,b)].
% 0.68/0.97 60 is_aligned(c1,c2). [resolve(58,b,50,a),merge(b)].
% 0.68/0.97 61 dissimilar(c1,c2,c3) | is_aligned(c1,c3). [back_unit_del(44),unit_del(b,60)].
% 0.68/0.97 62 -is_aligned(c1,c3) | dissimilar(c1,c2,c3). [back_unit_del(37),unit_del(b,60)].
% 0.68/0.97 64 is_aligned(c1,c3) | dissimilar(c1,A,B) | is_aligned(c1,A) | -is_aligned(c1,B). [resolve(61,a,33,d)].
% 0.68/0.97 66 is_aligned(c1,c3) | dissimilar(c1,c3,A) | -is_aligned(c1,A). [factor(64,a,c)].
% 0.68/0.97 69 is_aligned(c1,c3) | dissimilar(c1,c3,c2). [resolve(66,c,60,a)].
% 0.68/0.97 70 is_aligned(c1,c3) | -dissimilar(c1,c2,c3). [resolve(69,b,26,b)].
% 0.68/0.97 71 is_aligned(c1,c3). [resolve(70,b,61,a),merge(b)].
% 0.68/0.97 72 dissimilar(c1,c2,c3). [back_unit_del(62),unit_del(a,71)].
% 0.68/0.97 75 $F. [ur(27,b,60,a,c,71,a),unit_del(a,72)].
% 0.68/0.97
% 0.68/0.97 % SZS output end Refutation
% 0.68/0.97 ============================== end of proof ==========================
% 0.68/0.97
% 0.68/0.97 ============================== STATISTICS ============================
% 0.68/0.97
% 0.68/0.97 Given=33. Generated=105. Kept=50. proofs=1.
% 0.68/0.97 Usable=16. Sos=7. Demods=0. Limbo=1, Disabled=51. Hints=0.
% 0.68/0.97 Megabytes=0.06.
% 0.68/0.97 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.68/0.97
% 0.68/0.97 ============================== end of statistics =====================
% 0.68/0.97
% 0.68/0.97 ============================== end of search =========================
% 0.68/0.97
% 0.68/0.97 THEOREM PROVED
% 0.68/0.97 % SZS status Theorem
% 0.68/0.97
% 0.68/0.97 Exiting with 1 proof.
% 0.68/0.97
% 0.68/0.97 Process 13564 exit (max_proofs) Thu Jun 9 09:23:08 2022
% 0.68/0.97 Prover9 interrupted
%------------------------------------------------------------------------------