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 : n017.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 : Unsatisfiable 0.43s 1.01s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT053-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n017.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:48:34 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.43/1.01 ============================== Prover9 ===============================
% 0.43/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.01 Process 30231 was started by sandbox on n017.cluster.edu,
% 0.43/1.01 Thu Jun 9 10:48:35 2022
% 0.43/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_29779_n017.cluster.edu".
% 0.43/1.01 ============================== end of head ===========================
% 0.43/1.01
% 0.43/1.01 ============================== INPUT =================================
% 0.43/1.01
% 0.43/1.01 % Reading from file /tmp/Prover9_29779_n017.cluster.edu
% 0.43/1.01
% 0.43/1.01 set(prolog_style_variables).
% 0.43/1.01 set(auto2).
% 0.43/1.01 % set(auto2) -> set(auto).
% 0.43/1.01 % set(auto) -> set(auto_inference).
% 0.43/1.01 % set(auto) -> set(auto_setup).
% 0.43/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.43/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/1.01 % set(auto) -> set(auto_limits).
% 0.43/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/1.01 % set(auto) -> set(auto_denials).
% 0.43/1.01 % set(auto) -> set(auto_process).
% 0.43/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.43/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.43/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.43/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.43/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.43/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.43/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.43/1.01 % set(auto2) -> assign(stats, some).
% 0.43/1.01 % set(auto2) -> clear(echo_input).
% 0.43/1.01 % set(auto2) -> set(quiet).
% 0.43/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.43/1.01 % set(auto2) -> clear(print_given).
% 0.43/1.01 assign(lrs_ticks,-1).
% 0.43/1.01 assign(sos_limit,10000).
% 0.43/1.01 assign(order,kbo).
% 0.43/1.01 set(lex_order_vars).
% 0.43/1.01 clear(print_given).
% 0.43/1.01
% 0.43/1.01 % formulas(sos). % not echoed (22 formulas)
% 0.43/1.01
% 0.43/1.01 ============================== end of input ==========================
% 0.43/1.01
% 0.43/1.01 % From the command line: assign(max_seconds, 300).
% 0.43/1.01
% 0.43/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/1.01
% 0.43/1.01 % Formulas that are not ordinary clauses:
% 0.43/1.01
% 0.43/1.01 ============================== end of process non-clausal formulas ===
% 0.43/1.01
% 0.43/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/1.01
% 0.43/1.01 ============================== PREDICATE ELIMINATION =================
% 0.43/1.01 1 -smaller(A,B) | smaller_or_equal(A,B) # label(definition_smaller_or_equal_2) # label(axiom). [assumption].
% 0.43/1.01 2 smaller(A,B) | A = B | greater(A,B) # label(meaning_postulate_greater_comparable_11) # label(axiom). [assumption].
% 0.43/1.01 Derived: smaller_or_equal(A,B) | A = B | greater(A,B). [resolve(1,a,2,a)].
% 0.43/1.01 3 -smaller(A,B) | greater(B,A) # label(definition_smaller_7) # label(axiom). [assumption].
% 0.43/1.01 Derived: greater(A,B) | B = A | greater(B,A). [resolve(3,a,2,a)].
% 0.43/1.01 4 -greater(A,B) | smaller(B,A) # label(definition_smaller_8) # label(axiom). [assumption].
% 0.43/1.01 Derived: -greater(A,B) | smaller_or_equal(B,A). [resolve(4,b,1,a)].
% 0.43/1.01 5 -smaller_or_equal(A,B) | smaller(A,B) | A = B # label(definition_smaller_or_equal_1) # label(axiom). [assumption].
% 0.43/1.01 Derived: -smaller_or_equal(A,B) | A = B | greater(B,A). [resolve(5,b,3,a)].
% 0.43/1.01 6 -smaller_or_equal(A,B) | A = B | greater(B,A). [resolve(5,b,3,a)].
% 0.43/1.01 7 A != B | smaller_or_equal(A,B) # label(definition_smaller_or_equal_3) # label(axiom). [assumption].
% 0.43/1.01 8 smaller_or_equal(A,B) | A = B | greater(A,B). [resolve(1,a,2,a)].
% 0.43/1.01 9 -greater(A,B) | smaller_or_equal(B,A). [resolve(4,b,1,a)].
% 0.43/1.01 Derived: A = B | greater(B,A) | A = B | greater(A,B). [resolve(6,a,8,a)].
% 0.43/1.01 10 -greater_or_equal(A,B) | greater(A,B) | A = B # label(definition_greater_or_equal_4) # label(axiom). [assumption].
% 0.43/1.01 11 -greater(A,B) | greater_or_equal(A,B) # label(definition_greater_or_equal_5) # label(axiom). [assumption].
% 0.43/1.01 12 A != B | greater_or_equal(A,B) # label(definition_greater_or_equal_6) # label(axiom). [assumption].
% 0.43/1.01 13 -organization(A) | -is_aligned(A,B) | is_aligned(A,B) | dissimilar(A,B,C) # label(definition_2_32) # label(axiom). [assumption].
% 0.43/1.01 14 -dissimilar(A,B,C) | organization(A) # label(definition_2_29) # label(axiom). [assumption].
% 0.43/1.01 15 -organization(A) | -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,B,C) # label(definition_2_33) # label(axiom). [assumption].
% 0.43/1.01 Derived: -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,B,C) | -dissimilar(A,D,E). [resolve(15,a,14,b)].
% 0.43/1.01 16 -organization(A) | -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,C,B) # label(definition_2_34) # label(axiom). [assumption].
% 0.43/1.01 Derived: -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,C,B) | -dissimilar(A,D,E). [resolve(16,a,14,b)].
% 0.43/1.01 17 -organization(A) | -is_aligned(A,B) | is_aligned(A,B) | dissimilar(A,C,B) # label(definition_2_35) # label(axiom). [assumption].
% 0.43/1.01
% 0.43/1.01 ============================== end predicate elimination =============
% 0.43/1.01
% 0.43/1.01 Auto_denials: (non-Horn, no changes).
% 0.43/1.01
% 0.43/1.01 Term ordering decisions:
% 0.43/1.01 Function symbol KB weights: sk1=1. sk2=1. sk3=1.
% 0.43/1.01
% 0.43/1.01 ============================== end of process initial clauses ========
% 0.43/1.01
% 0.43/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.43/1.01
% 0.43/1.01 ============================== end of clauses for search =============
% 0.43/1.01
% 0.43/1.01 ============================== SEARCH ================================
% 0.43/1.01
% 0.43/1.01 % Starting search at 0.01 seconds.
% 0.43/1.01
% 0.43/1.01 ============================== PROOF =================================
% 0.43/1.01 % SZS status Unsatisfiable
% 0.43/1.01 % SZS output start Refutation
% 0.43/1.01
% 0.43/1.01 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.43/1.01 % Length of proof is 31.
% 0.43/1.01 % Level of proof is 17.
% 0.43/1.01 % Maximum clause weight is 14.000.
% 0.43/1.01 % Given clauses 33.
% 0.43/1.01
% 0.43/1.01 14 -dissimilar(A,B,C) | organization(A) # label(definition_2_29) # label(axiom). [assumption].
% 0.43/1.01 15 -organization(A) | -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,B,C) # label(definition_2_33) # label(axiom). [assumption].
% 0.43/1.01 16 -organization(A) | -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,C,B) # label(definition_2_34) # label(axiom). [assumption].
% 0.43/1.01 18 dissimilar(sk1,sk2,sk3) | dissimilar(sk1,sk3,sk2) # label(lemma_7_36) # label(negated_conjecture). [assumption].
% 0.43/1.01 20 -dissimilar(sk1,sk3,sk2) | -dissimilar(sk1,sk2,sk3) # label(lemma_7_39) # label(negated_conjecture). [assumption].
% 0.43/1.01 21 -dissimilar(A,B,C) | -is_aligned(A,B) | -is_aligned(A,C) # label(definition_2_31) # label(axiom). [assumption].
% 0.43/1.01 23 -dissimilar(A,B,C) | is_aligned(A,B) | is_aligned(A,C) # label(definition_2_30) # label(axiom). [assumption].
% 0.43/1.01 26 -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,B,C) | -dissimilar(A,D,E). [resolve(15,a,14,b)].
% 0.43/1.01 27 -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,C,B) | -dissimilar(A,D,E). [resolve(16,a,14,b)].
% 0.43/1.01 31 -is_aligned(sk1,sk3) | -is_aligned(sk1,sk2) | dissimilar(sk1,sk2,sk3). [resolve(21,a,18,b)].
% 0.43/1.01 32 is_aligned(sk1,sk3) | is_aligned(sk1,sk2) | dissimilar(sk1,sk2,sk3). [resolve(23,a,18,b)].
% 0.43/1.01 37 -is_aligned(sk1,A) | is_aligned(sk1,B) | dissimilar(sk1,A,B) | dissimilar(sk1,sk2,sk3). [resolve(26,d,18,b)].
% 0.43/1.01 38 -is_aligned(sk1,sk2) | is_aligned(sk1,sk3) | dissimilar(sk1,sk2,sk3). [factor(37,c,d)].
% 0.43/1.01 39 -is_aligned(sk1,A) | is_aligned(sk1,B) | dissimilar(sk1,B,A) | dissimilar(sk1,sk2,sk3). [resolve(27,d,18,b)].
% 0.43/1.01 40 -is_aligned(sk1,sk3) | is_aligned(sk1,sk2) | dissimilar(sk1,sk2,sk3). [factor(39,c,d)].
% 0.43/1.01 43 is_aligned(sk1,sk3) | is_aligned(sk1,sk2). [resolve(32,c,23,a),merge(c),merge(d)].
% 0.43/1.01 44 is_aligned(sk1,sk2) | dissimilar(sk1,sk2,sk3). [resolve(40,a,43,a),merge(c)].
% 0.43/1.01 48 is_aligned(sk1,sk2) | -is_aligned(sk1,A) | is_aligned(sk1,B) | dissimilar(sk1,A,B). [resolve(44,b,26,d)].
% 0.43/1.01 50 is_aligned(sk1,sk2) | -is_aligned(sk1,A) | dissimilar(sk1,A,sk2). [factor(48,a,c)].
% 0.43/1.01 51 is_aligned(sk1,sk2) | dissimilar(sk1,sk3,sk2). [resolve(50,b,43,a),merge(c)].
% 0.43/1.01 52 is_aligned(sk1,sk2) | -dissimilar(sk1,sk2,sk3). [resolve(51,b,20,a)].
% 0.43/1.01 54 is_aligned(sk1,sk2). [resolve(52,b,44,b),merge(b)].
% 0.43/1.01 55 is_aligned(sk1,sk3) | dissimilar(sk1,sk2,sk3). [back_unit_del(38),unit_del(a,54)].
% 0.43/1.01 56 -is_aligned(sk1,sk3) | dissimilar(sk1,sk2,sk3). [back_unit_del(31),unit_del(b,54)].
% 0.43/1.01 58 is_aligned(sk1,sk3) | -is_aligned(sk1,A) | is_aligned(sk1,B) | dissimilar(sk1,B,A). [resolve(55,b,27,d)].
% 0.43/1.01 60 is_aligned(sk1,sk3) | -is_aligned(sk1,A) | dissimilar(sk1,sk3,A). [factor(58,a,c)].
% 0.43/1.01 63 is_aligned(sk1,sk3) | dissimilar(sk1,sk3,sk2). [resolve(60,b,54,a)].
% 0.43/1.01 64 is_aligned(sk1,sk3) | -dissimilar(sk1,sk2,sk3). [resolve(63,b,20,a)].
% 0.43/1.01 65 is_aligned(sk1,sk3). [resolve(64,b,55,b),merge(b)].
% 0.43/1.01 66 dissimilar(sk1,sk2,sk3). [back_unit_del(56),unit_del(a,65)].
% 0.43/1.01 69 $F. [ur(21,b,54,a,c,65,a),unit_del(a,66)].
% 0.43/1.01
% 0.43/1.01 % SZS output end Refutation
% 0.43/1.01 ============================== end of proof ==========================
% 0.43/1.01
% 0.43/1.01 ============================== STATISTICS ============================
% 0.43/1.01
% 0.43/1.01 Given=33. Generated=107. Kept=50. proofs=1.
% 0.43/1.01 Usable=16. Sos=7. Demods=0. Limbo=1, Disabled=55. Hints=0.
% 0.43/1.01 Megabytes=0.06.
% 0.43/1.01 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.43/1.01
% 0.43/1.01 ============================== end of statistics =====================
% 0.43/1.01
% 0.43/1.01 ============================== end of search =========================
% 0.43/1.01
% 0.43/1.01 THEOREM PROVED
% 0.43/1.01 % SZS status Unsatisfiable
% 0.43/1.01
% 0.43/1.01 Exiting with 1 proof.
% 0.43/1.01
% 0.43/1.01 Process 30231 exit (max_proofs) Thu Jun 9 10:48:35 2022
% 0.43/1.01 Prover9 interrupted
%------------------------------------------------------------------------------