TSTP Solution File: MGT011+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT011+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n026.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:22:49 EDT 2022
% Result : Theorem 0.70s 1.00s
% Output : Refutation 0.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT011+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n026.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 9 10:12:32 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.70/0.99 ============================== Prover9 ===============================
% 0.70/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.70/0.99 Process 19265 was started by sandbox on n026.cluster.edu,
% 0.70/0.99 Thu Jun 9 10:12:33 2022
% 0.70/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_19112_n026.cluster.edu".
% 0.70/0.99 ============================== end of head ===========================
% 0.70/0.99
% 0.70/0.99 ============================== INPUT =================================
% 0.70/0.99
% 0.70/0.99 % Reading from file /tmp/Prover9_19112_n026.cluster.edu
% 0.70/0.99
% 0.70/0.99 set(prolog_style_variables).
% 0.70/0.99 set(auto2).
% 0.70/0.99 % set(auto2) -> set(auto).
% 0.70/0.99 % set(auto) -> set(auto_inference).
% 0.70/0.99 % set(auto) -> set(auto_setup).
% 0.70/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.70/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.70/0.99 % set(auto) -> set(auto_limits).
% 0.70/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.70/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.70/0.99 % set(auto) -> set(auto_denials).
% 0.70/0.99 % set(auto) -> set(auto_process).
% 0.70/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.70/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.70/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.70/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.70/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.70/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.70/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.70/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.70/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.70/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.70/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.70/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.70/0.99 % set(auto2) -> assign(stats, some).
% 0.70/0.99 % set(auto2) -> clear(echo_input).
% 0.70/0.99 % set(auto2) -> set(quiet).
% 0.70/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.70/0.99 % set(auto2) -> clear(print_given).
% 0.70/0.99 assign(lrs_ticks,-1).
% 0.70/0.99 assign(sos_limit,10000).
% 0.70/0.99 assign(order,kbo).
% 0.70/0.99 set(lex_order_vars).
% 0.70/0.99 clear(print_given).
% 0.70/0.99
% 0.70/0.99 % formulas(sos). % not echoed (8 formulas)
% 0.70/0.99
% 0.70/0.99 ============================== end of input ==========================
% 0.70/0.99
% 0.70/0.99 % From the command line: assign(max_seconds, 300).
% 0.70/0.99
% 0.70/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.70/0.99
% 0.70/0.99 % Formulas that are not ordinary clauses:
% 0.70/0.99 1 (all X all T (organization(X,T) -> (exists I inertia(X,I,T)))) # label(mp5) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.99 2 (all X all Y -(greater(X,Y) & X = Y)) # label(mp6_1) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.99 3 (all X all Y -(greater(X,Y) & greater(Y,X))) # label(mp6_2) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.99 4 (all X all T (organization(X,T) -> (exists C class(X,C,T)))) # label(mp9) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.99 5 (all X all T1 all T2 all C1 all C2 (organization(X,T1) & organization(X,T2) & reorganization_free(X,T1,T2) & class(X,C1,T1) & class(X,C2,T2) -> C1 = C2)) # label(mp10) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.99 6 (all X all Y all C all S1 all S2 all I1 all I2 all T1 all T2 (organization(X,T1) & organization(Y,T2) & class(X,C,T1) & class(Y,C,T2) & size(X,S1,T1) & size(Y,S2,T2) & inertia(X,I1,T1) & inertia(Y,I2,T2) & greater(S2,S1) -> greater(I2,I1))) # label(a5_FOL) # label(hypothesis) # label(non_clause). [assumption].
% 0.70/0.99 7 (all X all I1 all I2 all T1 all T2 (organization(X,T1) & organization(X,T2) & reorganization_free(X,T1,T2) & inertia(X,I1,T1) & inertia(X,I2,T2) & greater(T2,T1) -> greater(I2,I1))) # label(t2_FOL) # label(hypothesis) # label(non_clause). [assumption].
% 0.70/0.99 8 -(all X all S1 all S2 all T1 all T2 (organization(X,T1) & organization(X,T2) & reorganization_free(X,T1,T2) & size(X,S1,T1) & size(X,S2,T2) & greater(T2,T1) -> -greater(S1,S2))) # label(t11_FOL) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.70/0.99
% 0.70/0.99 ============================== end of process non-clausal formulas ===
% 0.70/0.99
% 0.70/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.70/0.99
% 0.70/0.99 ============================== PREDICATE ELIMINATION =================
% 0.70/0.99 9 -organization(A,B) | -organization(A,C) | -reorganization_free(A,B,C) | -class(A,D,B) | -class(A,E,C) | E = D # label(mp10) # label(axiom). [clausify(5)].
% 0.70/0.99 10 reorganization_free(c1,c4,c5) # label(t11_FOL) # label(negated_conjecture). [clausify(8)].
% 0.70/1.00 Derived: -organization(c1,c4) | -organization(c1,c5) | -class(c1,A,c4) | -class(c1,B,c5) | B = A. [resolve(9,c,10,a)].
% 0.70/1.00 11 -organization(A,B) | -organization(A,C) | -reorganization_free(A,B,C) | -inertia(A,D,B) | -inertia(A,E,C) | -greater(C,B) | greater(E,D) # label(t2_FOL) # label(hypothesis). [clausify(7)].
% 0.70/1.00 Derived: -organization(c1,c4) | -organization(c1,c5) | -inertia(c1,A,c4) | -inertia(c1,B,c5) | -greater(c5,c4) | greater(B,A). [resolve(11,c,10,a)].
% 0.70/1.00
% 0.70/1.00 ============================== end predicate elimination =============
% 0.70/1.00
% 0.70/1.00 Auto_denials:
% 0.70/1.00 % copying label mp6_1 to answer in negative clause
% 0.70/1.00 % copying label mp6_2 to answer in negative clause
% 0.70/1.00 % assign(max_proofs, 2). % (Horn set with more than one neg. clause)
% 0.70/1.00
% 0.70/1.00 Term ordering decisions:
% 0.70/1.00 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. f1=1. f2=1.
% 0.70/1.00
% 0.70/1.00 ============================== end of process initial clauses ========
% 0.70/1.00
% 0.70/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.70/1.00
% 0.70/1.00 ============================== end of clauses for search =============
% 0.70/1.00
% 0.70/1.00 ============================== SEARCH ================================
% 0.70/1.00
% 0.70/1.00 % Starting search at 0.01 seconds.
% 0.70/1.00
% 0.70/1.00 ============================== PROOF =================================
% 0.70/1.00 % SZS status Theorem
% 0.70/1.00 % SZS output start Refutation
% 0.70/1.00
% 0.70/1.00 % Proof 1 at 0.01 (+ 0.00) seconds: mp6_2.
% 0.70/1.00 % Length of proof is 33.
% 0.70/1.00 % Level of proof is 7.
% 0.70/1.00 % Maximum clause weight is 36.000.
% 0.70/1.00 % Given clauses 28.
% 0.70/1.00
% 0.70/1.00 1 (all X all T (organization(X,T) -> (exists I inertia(X,I,T)))) # label(mp5) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.00 3 (all X all Y -(greater(X,Y) & greater(Y,X))) # label(mp6_2) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.00 4 (all X all T (organization(X,T) -> (exists C class(X,C,T)))) # label(mp9) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.00 5 (all X all T1 all T2 all C1 all C2 (organization(X,T1) & organization(X,T2) & reorganization_free(X,T1,T2) & class(X,C1,T1) & class(X,C2,T2) -> C1 = C2)) # label(mp10) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.00 6 (all X all Y all C all S1 all S2 all I1 all I2 all T1 all T2 (organization(X,T1) & organization(Y,T2) & class(X,C,T1) & class(Y,C,T2) & size(X,S1,T1) & size(Y,S2,T2) & inertia(X,I1,T1) & inertia(Y,I2,T2) & greater(S2,S1) -> greater(I2,I1))) # label(a5_FOL) # label(hypothesis) # label(non_clause). [assumption].
% 0.70/1.00 7 (all X all I1 all I2 all T1 all T2 (organization(X,T1) & organization(X,T2) & reorganization_free(X,T1,T2) & inertia(X,I1,T1) & inertia(X,I2,T2) & greater(T2,T1) -> greater(I2,I1))) # label(t2_FOL) # label(hypothesis) # label(non_clause). [assumption].
% 0.70/1.00 8 -(all X all S1 all S2 all T1 all T2 (organization(X,T1) & organization(X,T2) & reorganization_free(X,T1,T2) & size(X,S1,T1) & size(X,S2,T2) & greater(T2,T1) -> -greater(S1,S2))) # label(t11_FOL) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.70/1.00 9 -organization(A,B) | -organization(A,C) | -reorganization_free(A,B,C) | -class(A,D,B) | -class(A,E,C) | E = D # label(mp10) # label(axiom). [clausify(5)].
% 0.70/1.00 10 reorganization_free(c1,c4,c5) # label(t11_FOL) # label(negated_conjecture). [clausify(8)].
% 0.70/1.00 11 -organization(A,B) | -organization(A,C) | -reorganization_free(A,B,C) | -inertia(A,D,B) | -inertia(A,E,C) | -greater(C,B) | greater(E,D) # label(t2_FOL) # label(hypothesis). [clausify(7)].
% 0.70/1.00 12 organization(c1,c4) # label(t11_FOL) # label(negated_conjecture). [clausify(8)].
% 0.70/1.00 13 organization(c1,c5) # label(t11_FOL) # label(negated_conjecture). [clausify(8)].
% 0.70/1.00 14 greater(c5,c4) # label(t11_FOL) # label(negated_conjecture). [clausify(8)].
% 0.70/1.00 15 greater(c2,c3) # label(t11_FOL) # label(negated_conjecture). [clausify(8)].
% 0.70/1.00 16 size(c1,c2,c4) # label(t11_FOL) # label(negated_conjecture). [clausify(8)].
% 0.70/1.00 17 size(c1,c3,c5) # label(t11_FOL) # label(negated_conjecture). [clausify(8)].
% 0.70/1.00 19 -greater(A,B) | -greater(B,A) # label(mp6_2) # label(axiom) # answer(mp6_2). [clausify(3)].
% 0.70/1.00 20 -organization(A,B) | inertia(A,f1(A,B),B) # label(mp5) # label(axiom). [clausify(1)].
% 0.70/1.00 21 -organization(A,B) | class(A,f2(A,B),B) # label(mp9) # label(axiom). [clausify(4)].
% 0.70/1.00 22 -organization(A,B) | -organization(C,D) | -class(A,E,B) | -class(C,E,D) | -size(A,F,B) | -size(C,V6,D) | -inertia(A,V7,B) | -inertia(C,V8,D) | -greater(V6,F) | greater(V8,V7) # label(a5_FOL) # label(hypothesis). [clausify(6)].
% 0.70/1.00 23 -organization(c1,c4) | -organization(c1,c5) | -class(c1,A,c4) | -class(c1,B,c5) | B = A. [resolve(9,c,10,a)].
% 0.70/1.00 24 -class(c1,A,c4) | -class(c1,B,c5) | B = A. [copy(23),unit_del(a,12),unit_del(b,13)].
% 0.70/1.00 25 -organization(c1,c4) | -organization(c1,c5) | -inertia(c1,A,c4) | -inertia(c1,B,c5) | -greater(c5,c4) | greater(B,A). [resolve(11,c,10,a)].
% 0.70/1.00 26 -inertia(c1,A,c4) | -inertia(c1,B,c5) | greater(B,A). [copy(25),unit_del(a,12),unit_del(b,13),unit_del(e,14)].
% 0.70/1.00 32 inertia(c1,f1(c1,c5),c5). [hyper(20,a,13,a)].
% 0.70/1.00 33 inertia(c1,f1(c1,c4),c4). [hyper(20,a,12,a)].
% 0.70/1.00 34 class(c1,f2(c1,c5),c5). [hyper(21,a,13,a)].
% 0.70/1.00 35 class(c1,f2(c1,c4),c4). [hyper(21,a,12,a)].
% 0.70/1.00 37 greater(f1(c1,c5),f1(c1,c4)). [hyper(26,a,33,a,b,32,a)].
% 0.70/1.00 40 f2(c1,c5) = f2(c1,c4). [hyper(24,a,35,a,b,34,a)].
% 0.70/1.00 42 class(c1,f2(c1,c4),c5). [back_rewrite(34),rewrite([40(4)])].
% 0.70/1.00 43 greater(f1(c1,c4),f1(c1,c5)). [hyper(22,a,13,a,b,12,a,c,42,a,d,35,a,e,17,a,f,16,a,g,32,a,h,33,a,i,15,a)].
% 0.70/1.00 44 $F # answer(mp6_2). [ur(19,b,37,a),unit_del(a,43)].
% 0.70/1.00
% 0.70/1.00 % SZS output end Refutation
% 0.70/1.00 ============================== end of proof ==========================
% 0.70/1.00 % Redundant proof: 45 $F # answer(mp6_2). [ur(19,a,37,a),unit_del(a,43)].
% 0.70/1.00
% 0.70/1.00 % Disable descendants (x means already disabled):
% 0.70/1.00 19 30 31
% 0.70/1.00
% 0.70/1.00 ============================== STATISTICS ============================
% 0.70/1.00
% 0.70/1.00 Given=31. Generated=52. Kept=31. proofs=1.
% 0.70/1.00 Usable=27. Sos=0. Demods=1. Limbo=0, Disabled=20. Hints=0.
% 0.70/1.00 Megabytes=0.08.
% 0.70/1.00 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.70/1.00
% 0.70/1.00 ============================== end of statistics =====================
% 0.70/1.00
% 0.70/1.00 ============================== end of search =========================
% 0.70/1.00
% 0.70/1.00 SEARCH FAILED
% 0.70/1.00
% 0.70/1.00 Exiting with 1 proof.
% 0.70/1.00
% 0.70/1.00 Process 19265 exit (sos_empty) Thu Jun 9 10:12:33 2022
% 0.70/1.00 Prover9 interrupted
%------------------------------------------------------------------------------