TSTP Solution File: MGT045-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT045-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:04 EDT 2022
% Result : Unsatisfiable 0.45s 1.00s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT045-1 : TPTP v8.1.0. Released v2.4.0.
% 0.13/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:44:12 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 20019 was started by sandbox on n027.cluster.edu,
% 0.45/0.99 Thu Jun 9 10:44:13 2022
% 0.45/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_19668_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_19668_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 (17 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
% 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 1 -organization(A) | -greater(external_ties(A,B),external_ties(A,C)) | greater(position(A,B),position(A,C)) # label(assumption_6_30) # label(axiom). [assumption].
% 0.45/0.99 2 organization(sk1) # label(lemma_4_33) # label(negated_conjecture). [assumption].
% 0.45/0.99 Derived: -greater(external_ties(sk1,A),external_ties(sk1,B)) | greater(position(sk1,A),position(sk1,B)). [resolve(1,a,2,a)].
% 0.45/0.99 3 -organization(A) | external_ties(A,B) != external_ties(A,C) | position(A,B) = position(A,C) # label(assumption_6_31) # label(axiom). [assumption].
% 0.45/0.99 Derived: external_ties(sk1,A) != external_ties(sk1,B) | position(sk1,A) = position(sk1,B). [resolve(3,a,2,a)].
% 0.45/0.99 4 -organization(A) | -greater(age(A,B),age(A,C)) | greater(external_ties(A,B),external_ties(A,C)) # label(assumption_8_32) # label(axiom). [assumption].
% 0.45/0.99 Derived: -greater(age(sk1,A),age(sk1,B)) | greater(external_ties(sk1,A),external_ties(sk1,B)). [resolve(4,a,2,a)].
% 0.45/0.99 5 -smaller(A,B) | smaller_or_equal(A,B) # label(definition_smaller_or_equal_2) # label(axiom). [assumption].
% 0.45/0.99 6 smaller(A,B) | A = B | greater(A,B) # label(meaning_postulate_greater_comparable_11) # label(axiom). [assumption].
% 0.45/0.99 Derived: smaller_or_equal(A,B) | A = B | greater(A,B). [resolve(5,a,6,a)].
% 0.45/0.99 7 -smaller(A,B) | greater(B,A) # label(definition_smaller_7) # label(axiom). [assumption].
% 0.45/0.99 Derived: greater(A,B) | B = A | greater(B,A). [resolve(7,a,6,a)].
% 0.45/0.99 8 -greater(A,B) | smaller(B,A) # label(definition_smaller_8) # label(axiom). [assumption].
% 0.45/0.99 Derived: -greater(A,B) | smaller_or_equal(B,A). [resolve(8,b,5,a)].
% 0.45/0.99 9 -smaller_or_equal(A,B) | smaller(A,B) | A = B # label(definition_smaller_or_equal_1) # label(axiom). [assumption].
% 0.45/0.99 Derived: -smaller_or_equal(A,B) | A = B | greater(B,A). [resolve(9,b,7,a)].
% 0.45/0.99 10 -smaller_or_equal(A,B) | A = B | greater(B,A). [resolve(9,b,7,a)].
% 0.45/1.00 11 A != B | smaller_or_equal(A,B) # label(definition_smaller_or_equal_3) # label(axiom). [assumption].
% 0.45/1.00 12 smaller_or_equal(A,B) | A = B | greater(A,B). [resolve(5,a,6,a)].
% 0.45/1.00 13 -greater(A,B) | smaller_or_equal(B,A). [resolve(8,b,5,a)].
% 0.45/1.00 Derived: A = B | greater(B,A) | A = B | greater(A,B). [resolve(10,a,12,a)].
% 0.45/1.00 14 -greater_or_equal(A,B) | greater(A,B) | A = B # label(definition_greater_or_equal_4) # label(axiom). [assumption].
% 0.45/1.00 15 -greater(A,B) | greater_or_equal(A,B) # label(definition_greater_or_equal_5) # label(axiom). [assumption].
% 0.45/1.00 16 A != B | greater_or_equal(A,B) # label(definition_greater_or_equal_6) # label(axiom). [assumption].
% 0.45/1.00
% 0.45/1.00 ============================== end predicate elimination =============
% 0.45/1.00
% 0.45/1.00 Auto_denials: (non-Horn, no changes).
% 0.45/1.00
% 0.45/1.00 Term ordering decisions:
% 0.45/1.00 Function symbol KB weights: sk1=1. sk2=1. sk3=1. external_ties=1. age=1. position=1.
% 0.45/1.00
% 0.45/1.00 ============================== end of process initial clauses ========
% 0.45/1.00
% 0.45/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.45/1.00
% 0.45/1.00 ============================== end of clauses for search =============
% 0.45/1.00
% 0.45/1.00 ============================== SEARCH ================================
% 0.45/1.00
% 0.45/1.00 % Starting search at 0.01 seconds.
% 0.45/1.00
% 0.45/1.00 ============================== PROOF =================================
% 0.45/1.00 % SZS status Unsatisfiable
% 0.45/1.00 % SZS output start Refutation
% 0.45/1.00
% 0.45/1.00 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.45/1.00 % Length of proof is 9.
% 0.45/1.00 % Level of proof is 3.
% 0.45/1.00 % Maximum clause weight is 14.000.
% 0.45/1.00 % Given clauses 7.
% 0.45/1.00
% 0.45/1.00 1 -organization(A) | -greater(external_ties(A,B),external_ties(A,C)) | greater(position(A,B),position(A,C)) # label(assumption_6_30) # label(axiom). [assumption].
% 0.45/1.00 2 organization(sk1) # label(lemma_4_33) # label(negated_conjecture). [assumption].
% 0.45/1.00 4 -organization(A) | -greater(age(A,B),age(A,C)) | greater(external_ties(A,B),external_ties(A,C)) # label(assumption_8_32) # label(axiom). [assumption].
% 0.45/1.00 17 greater(age(sk1,sk3),age(sk1,sk2)) # label(lemma_4_34) # label(negated_conjecture). [assumption].
% 0.45/1.00 19 -greater(position(sk1,sk3),position(sk1,sk2)) # label(lemma_4_35) # label(negated_conjecture). [assumption].
% 0.45/1.00 21 -greater(external_ties(sk1,A),external_ties(sk1,B)) | greater(position(sk1,A),position(sk1,B)). [resolve(1,a,2,a)].
% 0.45/1.00 23 -greater(age(sk1,A),age(sk1,B)) | greater(external_ties(sk1,A),external_ties(sk1,B)). [resolve(4,a,2,a)].
% 0.45/1.00 30 -greater(external_ties(sk1,sk3),external_ties(sk1,sk2)). [ur(21,b,19,a)].
% 0.45/1.00 31 $F. [resolve(23,a,17,a),unit_del(a,30)].
% 0.45/1.00
% 0.45/1.00 % SZS output end Refutation
% 0.45/1.00 ============================== end of proof ==========================
% 0.45/1.00
% 0.45/1.00 ============================== STATISTICS ============================
% 0.45/1.00
% 0.45/1.00 Given=7. Generated=21. Kept=13. proofs=1.
% 0.45/1.00 Usable=7. Sos=6. Demods=0. Limbo=0, Disabled=25. Hints=0.
% 0.45/1.00 Megabytes=0.04.
% 0.45/1.00 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.45/1.00
% 0.45/1.00 ============================== end of statistics =====================
% 0.45/1.00
% 0.45/1.00 ============================== end of search =========================
% 0.45/1.00
% 0.45/1.00 THEOREM PROVED
% 0.45/1.00 % SZS status Unsatisfiable
% 0.45/1.00
% 0.45/1.00 Exiting with 1 proof.
% 0.45/1.00
% 0.45/1.00 Process 20019 exit (max_proofs) Thu Jun 9 10:44:13 2022
% 0.45/1.00 Prover9 interrupted
%------------------------------------------------------------------------------