TSTP Solution File: MGT058-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT058-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n019.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:09 EDT 2022
% Result : Unsatisfiable 0.45s 1.01s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT058-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 : n019.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 12:10:25 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.45/1.00 ============================== Prover9 ===============================
% 0.45/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.00 Process 1017 was started by sandbox on n019.cluster.edu,
% 0.45/1.00 Thu Jun 9 12:10:25 2022
% 0.45/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_847_n019.cluster.edu".
% 0.45/1.00 ============================== end of head ===========================
% 0.45/1.00
% 0.45/1.00 ============================== INPUT =================================
% 0.45/1.00
% 0.45/1.00 % Reading from file /tmp/Prover9_847_n019.cluster.edu
% 0.45/1.00
% 0.45/1.00 set(prolog_style_variables).
% 0.45/1.00 set(auto2).
% 0.45/1.00 % set(auto2) -> set(auto).
% 0.45/1.00 % set(auto) -> set(auto_inference).
% 0.45/1.00 % set(auto) -> set(auto_setup).
% 0.45/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.00 % set(auto) -> set(auto_limits).
% 0.45/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.00 % set(auto) -> set(auto_denials).
% 0.45/1.00 % set(auto) -> set(auto_process).
% 0.45/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.45/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.45/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.45/1.00 % set(auto2) -> assign(stats, some).
% 0.45/1.00 % set(auto2) -> clear(echo_input).
% 0.45/1.00 % set(auto2) -> set(quiet).
% 0.45/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.00 % set(auto2) -> clear(print_given).
% 0.45/1.00 assign(lrs_ticks,-1).
% 0.45/1.00 assign(sos_limit,10000).
% 0.45/1.00 assign(order,kbo).
% 0.45/1.00 set(lex_order_vars).
% 0.45/1.00 clear(print_given).
% 0.45/1.00
% 0.45/1.00 % formulas(sos). % not echoed (29 formulas)
% 0.45/1.00
% 0.45/1.00 ============================== end of input ==========================
% 0.45/1.00
% 0.45/1.00 % From the command line: assign(max_seconds, 300).
% 0.45/1.00
% 0.45/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.00
% 0.45/1.00 % Formulas that are not ordinary clauses:
% 0.45/1.00
% 0.45/1.00 ============================== end of process non-clausal formulas ===
% 0.45/1.00
% 0.45/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.00
% 0.45/1.00 ============================== PREDICATE ELIMINATION =================
% 0.45/1.00 1 -fragile_position(A) | -greater(age(A,B),sigma) | -positional_advantage(A,B) # label(definition_3_31) # label(axiom). [assumption].
% 0.45/1.00 2 fragile_position(sk3) # label(lemma_10_46) # label(negated_conjecture). [assumption].
% 0.45/1.00 3 smaller_or_equal(age(A,sk1(A)),sigma) | positional_advantage(A,sk1(A)) | fragile_position(A) # label(definition_3_33) # label(axiom). [assumption].
% 0.45/1.00 4 smaller_or_equal(age(A,sk1(A)),sigma) | greater(age(A,sk1(A)),sigma) | fragile_position(A) # label(definition_3_32) # label(axiom). [assumption].
% 0.45/1.00 Derived: -greater(age(sk3,A),sigma) | -positional_advantage(sk3,A). [resolve(1,a,2,a)].
% 0.45/1.00 Derived: -greater(age(A,B),sigma) | -positional_advantage(A,B) | smaller_or_equal(age(A,sk1(A)),sigma) | positional_advantage(A,sk1(A)). [resolve(1,a,3,c)].
% 0.45/1.00 Derived: -greater(age(A,B),sigma) | -positional_advantage(A,B) | smaller_or_equal(age(A,sk1(A)),sigma) | greater(age(A,sk1(A)),sigma). [resolve(1,a,4,c)].
% 0.45/1.00 5 -fragile_position(A) | -smaller_or_equal(age(A,B),sigma) | positional_advantage(A,B) # label(definition_3_30) # label(axiom). [assumption].
% 0.45/1.00 Derived: -smaller_or_equal(age(sk3,A),sigma) | positional_advantage(sk3,A). [resolve(5,a,2,a)].
% 0.45/1.00 Derived: -smaller_or_equal(age(A,B),sigma) | positional_advantage(A,B) | smaller_or_equal(age(A,sk1(A)),sigma) | positional_advantage(A,sk1(A)). [resolve(5,a,3,c)].
% 0.45/1.00 Derived: -smaller_or_equal(age(A,B),sigma) | positional_advantage(A,B) | smaller_or_equal(age(A,sk1(A)),sigma) | greater(age(A,sk1(A)),sigma). [resolve(5,a,4,c)].
% 0.45/1.00 6 -positional_advantage(A,sk1(A)) | positional_advantage(A,sk1(A)) | fragile_position(A) # label(definition_3_35) # label(axiom). [assumption].
% 0.45/1.00 7 -positional_advantage(A,sk1(A)) | greater(age(A,sk1(A)),sigma) | fragile_position(A) # label(definition_3_34) # label(axiom). [assumption].
% 0.45/1.00 Derived: -positional_advantage(A,sk1(A)) | greater(age(A,sk1(A)),sigma) | -greater(age(A,B),sigma) | -positional_advantage(A,B). [resolve(7,c,1,a)].
% 0.45/1.00 Derived: -positional_advantage(A,sk1(A)) | greater(age(A,sk1(A)),sigma) | -smaller_or_equal(age(A,B),sigma) | positional_advantage(A,B). [resolve(7,c,5,a)].
% 0.45/1.00 8 -robust_position(A) | -smaller_or_equal(age(A,B),tau) | -positional_advantage(A,B) # label(definition_4_36) # label(axiom). [assumption].
% 0.45/1.00 9 robust_position(sk3) # label(lemma_10_47) # label(negated_conjecture). [assumption].
% 0.45/1.00 10 positional_advantage(A,sk2(A)) | greater(age(A,sk2(A)),tau) | robust_position(A) # label(definition_4_40) # label(axiom). [assumption].
% 0.45/1.00 11 smaller_or_equal(age(A,sk2(A)),tau) | greater(age(A,sk2(A)),tau) | robust_position(A) # label(definition_4_38) # label(axiom). [assumption].
% 0.45/1.00 Derived: -smaller_or_equal(age(sk3,A),tau) | -positional_advantage(sk3,A). [resolve(8,a,9,a)].
% 0.45/1.00 Derived: -smaller_or_equal(age(A,B),tau) | -positional_advantage(A,B) | positional_advantage(A,sk2(A)) | greater(age(A,sk2(A)),tau). [resolve(8,a,10,c)].
% 0.45/1.00 Derived: -smaller_or_equal(age(A,B),tau) | -positional_advantage(A,B) | smaller_or_equal(age(A,sk2(A)),tau) | greater(age(A,sk2(A)),tau). [resolve(8,a,11,c)].
% 0.45/1.00 12 -robust_position(A) | -greater(age(A,B),tau) | positional_advantage(A,B) # label(definition_4_37) # label(axiom). [assumption].
% 0.45/1.00 Derived: -greater(age(sk3,A),tau) | positional_advantage(sk3,A). [resolve(12,a,9,a)].
% 0.45/1.00 Derived: -greater(age(A,B),tau) | positional_advantage(A,B) | positional_advantage(A,sk2(A)) | greater(age(A,sk2(A)),tau). [resolve(12,a,10,c)].
% 0.45/1.00 Derived: -greater(age(A,B),tau) | positional_advantage(A,B) | smaller_or_equal(age(A,sk2(A)),tau) | greater(age(A,sk2(A)),tau). [resolve(12,a,11,c)].
% 0.45/1.00 13 positional_advantage(A,sk2(A)) | -positional_advantage(A,sk2(A)) | robust_position(A) # label(definition_4_41) # label(axiom). [assumption].
% 0.45/1.00 14 smaller_or_equal(age(A,sk2(A)),tau) | -positional_advantage(A,sk2(A)) | robust_position(A) # label(definition_4_39) # label(axiom). [assumption].
% 0.45/1.00 Derived: smaller_or_equal(age(A,sk2(A)),tau) | -positional_advantage(A,sk2(A)) | -smaller_or_equal(age(A,B),tau) | -positional_advantage(A,B). [resolve(14,c,8,a)].
% 0.45/1.00 Derived: smaller_or_equal(age(A,sk2(A)),tau) | -positional_advantage(A,sk2(A)) | -greater(age(A,B),tau) | positional_advantage(A,B). [resolve(14,c,12,a)].
% 0.45/1.00 15 -greater_or_equal(A,B) | greater(A,B) | A = B # label(definition_greater_or_equal_4) # label(axiom). [assumption].
% 0.45/1.00 16 greater_or_equal(sigma,zero) # label(lemma_10_44) # label(negated_conjecture). [assumption].
% 0.45/1.00 17 greater_or_equal(tau,zero) # label(lemma_10_45) # label(negated_conjecture). [assumption].
% 0.45/1.00 18 -greater(A,B) | greater_or_equal(A,B) # label(definition_greater_or_equal_5) # label(axiom). [assumption].
% 0.45/1.00 19 A != B | greater_or_equal(A,B) # label(definition_greater_or_equal_6) # label(axiom). [assumption].
% 0.45/1.00 Derived: greater(sigma,zero) | sigma = zero. [resolve(15,a,16,a)].
% 0.45/1.00 Derived: greater(tau,zero) | tau = zero. [resolve(15,a,17,a)].
% 0.45/1.00 20 -smaller(A,B) | smaller_or_equal(A,B) # label(definition_smaller_or_equal_2) # label(axiom). [assumption].
% 0.45/1.00 21 smaller(A,B) | A = B | greater(A,B) # label(meaning_postulate_greater_comparable_11) # label(axiom). [assumption].
% 0.45/1.00 Derived: smaller_or_equal(A,B) | A = B | greater(A,B). [resolve(20,a,21,a)].
% 0.45/1.00 22 -smaller(A,B) | greater(B,A) # label(definition_smaller_7) # label(axiom). [assumption].
% 0.45/1.00 Derived: greater(A,B) | B = A | greater(B,A). [resolve(22,a,21,a)].
% 0.45/1.00 23 -greater(A,B) | smaller(B,A) # label(definition_smaller_8) # label(axiom). [assumption].
% 0.45/1.00 Derived: -greater(A,B) | smaller_or_equal(B,A). [resolve(23,b,20,a)].
% 0.45/1.00 24 -smaller_or_equal(A,B) | smaller(A,B) | A = B # label(definition_smaller_or_equal_1) # label(axiom). [assumption].
% 0.45/1.00 Derived: -smaller_or_equal(A,B) | A = B | greater(B,A). [resolve(24,b,22,a)].
% 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: sigma=1. tau=1. sk3=1. zero=1. sk4=1. age=1. sk1=1. sk2=1.
% 0.45/1.01
% 0.45/1.01 ============================== end of process initial clauses ========
% 0.45/1.01
% 0.45/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.45/1.01
% 0.45/1.01 ============================== end of clauses for search =============
% 0.45/1.01
% 0.45/1.01 ============================== SEARCH ================================
% 0.45/1.01
% 0.45/1.01 % Starting search at 0.01 seconds.
% 0.45/1.01
% 0.45/1.01 ============================== PROOF =================================
% 0.45/1.01 % SZS status Unsatisfiable
% 0.45/1.01 % SZS output start Refutation
% 0.45/1.01
% 0.45/1.01 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.45/1.01 % Length of proof is 34.
% 0.45/1.01 % Level of proof is 10.
% 0.45/1.01 % Maximum clause weight is 8.000.
% 0.45/1.01 % Given clauses 45.
% 0.45/1.01
% 0.45/1.01 2 fragile_position(sk3) # label(lemma_10_46) # label(negated_conjecture). [assumption].
% 0.45/1.01 5 -fragile_position(A) | -smaller_or_equal(age(A,B),sigma) | positional_advantage(A,B) # label(definition_3_30) # label(axiom). [assumption].
% 0.45/1.01 8 -robust_position(A) | -smaller_or_equal(age(A,B),tau) | -positional_advantage(A,B) # label(definition_4_36) # label(axiom). [assumption].
% 0.45/1.01 9 robust_position(sk3) # label(lemma_10_47) # label(negated_conjecture). [assumption].
% 0.45/1.01 15 -greater_or_equal(A,B) | greater(A,B) | A = B # label(definition_greater_or_equal_4) # label(axiom). [assumption].
% 0.45/1.01 16 greater_or_equal(sigma,zero) # label(lemma_10_44) # label(negated_conjecture). [assumption].
% 0.45/1.01 17 greater_or_equal(tau,zero) # label(lemma_10_45) # label(negated_conjecture). [assumption].
% 0.45/1.01 20 -smaller(A,B) | smaller_or_equal(A,B) # label(definition_smaller_or_equal_2) # label(axiom). [assumption].
% 0.45/1.01 23 -greater(A,B) | smaller(B,A) # label(definition_smaller_8) # label(axiom). [assumption].
% 0.45/1.01 25 age(sk3,sk4) = zero # label(lemma_10_43) # label(negated_conjecture). [assumption].
% 0.45/1.01 27 A != B | smaller_or_equal(A,B) # label(definition_smaller_or_equal_3) # label(axiom). [assumption].
% 0.45/1.01 32 -smaller_or_equal(age(sk3,A),sigma) | positional_advantage(sk3,A). [resolve(5,a,2,a)].
% 0.45/1.01 37 -smaller_or_equal(age(sk3,A),tau) | -positional_advantage(sk3,A). [resolve(8,a,9,a)].
% 0.45/1.01 45 greater(sigma,zero) | sigma = zero. [resolve(15,a,16,a)].
% 0.45/1.01 46 greater(sigma,zero) | zero = sigma. [copy(45),flip(b)].
% 0.45/1.01 47 greater(tau,zero) | tau = zero. [resolve(15,a,17,a)].
% 0.45/1.01 48 greater(tau,zero) | zero = tau. [copy(47),flip(b)].
% 0.45/1.01 51 -greater(A,B) | smaller_or_equal(B,A). [resolve(23,b,20,a)].
% 0.45/1.01 55 smaller_or_equal(A,A). [xx_res(27,a)].
% 0.45/1.01 56 -smaller_or_equal(zero,sigma) | positional_advantage(sk3,sk4). [para(25(a,1),32(a,1))].
% 0.45/1.01 57 -smaller_or_equal(zero,tau) | -positional_advantage(sk3,sk4). [para(25(a,1),37(a,1))].
% 0.45/1.01 81 smaller_or_equal(zero,tau) | zero = tau. [resolve(51,a,48,a)].
% 0.45/1.01 82 smaller_or_equal(zero,sigma) | zero = sigma. [resolve(51,a,46,a)].
% 0.45/1.01 86 zero = tau | -positional_advantage(sk3,sk4). [resolve(81,a,57,a)].
% 0.45/1.01 87 zero = sigma | positional_advantage(sk3,sk4). [resolve(82,a,56,a)].
% 0.45/1.01 88 zero = sigma | zero = tau. [resolve(87,b,86,b)].
% 0.45/1.01 93 zero = sigma | -positional_advantage(sk3,sk4). [para(88(b,1),57(a,1)),unit_del(b,55)].
% 0.45/1.01 99 zero = sigma. [resolve(93,b,87,b),merge(b)].
% 0.45/1.01 101 tau = sigma | -positional_advantage(sk3,sk4). [back_rewrite(86),rewrite([99(1)]),flip(a)].
% 0.45/1.01 107 -smaller_or_equal(sigma,tau) | -positional_advantage(sk3,sk4). [back_rewrite(57),rewrite([99(1)])].
% 0.45/1.01 108 positional_advantage(sk3,sk4). [back_rewrite(56),rewrite([99(1)]),unit_del(a,55)].
% 0.45/1.01 111 -smaller_or_equal(sigma,tau). [back_unit_del(107),unit_del(b,108)].
% 0.45/1.01 112 tau = sigma. [back_unit_del(101),unit_del(b,108)].
% 0.45/1.01 113 $F. [back_rewrite(111),rewrite([112(2)]),unit_del(a,55)].
% 0.45/1.01
% 0.45/1.01 % SZS output end Refutation
% 0.45/1.01 ============================== end of proof ==========================
% 0.45/1.01
% 0.45/1.01 ============================== STATISTICS ============================
% 0.45/1.01
% 0.45/1.01 Given=45. Generated=163. Kept=86. proofs=1.
% 0.45/1.01 Usable=25. Sos=19. Demods=3. Limbo=1, Disabled=92. Hints=0.
% 0.45/1.01 Megabytes=0.10.
% 0.45/1.01 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.45/1.01
% 0.45/1.01 ============================== end of statistics =====================
% 0.45/1.01
% 0.45/1.01 ============================== end of search =========================
% 0.45/1.01
% 0.45/1.01 THEOREM PROVED
% 0.45/1.01 % SZS status Unsatisfiable
% 0.45/1.01
% 0.45/1.01 Exiting with 1 proof.
% 0.45/1.01
% 0.45/1.01 Process 1017 exit (max_proofs) Thu Jun 9 12:10:25 2022
% 0.45/1.01 Prover9 interrupted
%------------------------------------------------------------------------------