TSTP Solution File: MGT014+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT014+1 : TPTP v8.1.0. Released v2.0.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:22:50 EDT 2022
% Result : Theorem 0.68s 0.98s
% Output : Refutation 0.68s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT014+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n021.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 11:13:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.68/0.98 ============================== Prover9 ===============================
% 0.68/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.68/0.98 Process 30469 was started by sandbox on n021.cluster.edu,
% 0.68/0.98 Thu Jun 9 11:13:08 2022
% 0.68/0.98 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_30316_n021.cluster.edu".
% 0.68/0.98 ============================== end of head ===========================
% 0.68/0.98
% 0.68/0.98 ============================== INPUT =================================
% 0.68/0.98
% 0.68/0.98 % Reading from file /tmp/Prover9_30316_n021.cluster.edu
% 0.68/0.98
% 0.68/0.98 set(prolog_style_variables).
% 0.68/0.98 set(auto2).
% 0.68/0.98 % set(auto2) -> set(auto).
% 0.68/0.98 % set(auto) -> set(auto_inference).
% 0.68/0.98 % set(auto) -> set(auto_setup).
% 0.68/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.68/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.68/0.98 % set(auto) -> set(auto_limits).
% 0.68/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.68/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.68/0.98 % set(auto) -> set(auto_denials).
% 0.68/0.98 % set(auto) -> set(auto_process).
% 0.68/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.68/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.68/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.68/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.68/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.68/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.68/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.68/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.68/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.68/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.68/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.68/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.68/0.98 % set(auto2) -> assign(stats, some).
% 0.68/0.98 % set(auto2) -> clear(echo_input).
% 0.68/0.98 % set(auto2) -> set(quiet).
% 0.68/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.68/0.98 % set(auto2) -> clear(print_given).
% 0.68/0.98 assign(lrs_ticks,-1).
% 0.68/0.98 assign(sos_limit,10000).
% 0.68/0.98 assign(order,kbo).
% 0.68/0.98 set(lex_order_vars).
% 0.68/0.98 clear(print_given).
% 0.68/0.98
% 0.68/0.98 % formulas(sos). % not echoed (9 formulas)
% 0.68/0.98
% 0.68/0.98 ============================== end of input ==========================
% 0.68/0.98
% 0.68/0.98 % From the command line: assign(max_seconds, 300).
% 0.68/0.98
% 0.68/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.68/0.98
% 0.68/0.98 % Formulas that are not ordinary clauses:
% 0.68/0.98 1 (all X all Y -(greater(X,Y) & X = Y)) # label(mp6_1) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.98 2 (all X all Y -(greater(X,Y) & greater(Y,X))) # label(mp6_2) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.98 3 (all X all T (organization(X,T) -> time(T))) # label(mp15) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.98 4 (all T1 all T2 (time(T1) & time(T2) -> greater(T1,T2) | T1 = T2 | greater(T2,T1))) # label(mp16) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.98 5 (all X all T1 all T2 (reorganization_free(X,T1,T2) -> reorganization_free(X,T2,T1))) # label(mp17) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.98 6 (all X all S1 all S2 all T1 all T2 (organization(X,T1) & organization(X,T2) & size(X,S1,T1) & size(X,S2,T2) & T1 = T2 -> S1 = S2)) # label(mp19) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.98 7 (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(hypothesis) # label(non_clause). [assumption].
% 0.68/0.98 8 (all X all C1 all C2 all T1 all T2 (organization(X,T1) & organization(X,T2) & reorganization_free(X,T1,T2) & complexity(X,C1,T1) & complexity(X,C2,T2) & greater(T2,T1) -> -greater(C1,C2))) # label(t12_FOL) # label(hypothesis) # label(non_clause). [assumption].
% 0.68/0.98 9 -(all X all C1 all C2 all S1 all S2 all T1 all T2 (organization(X,T1) & organization(X,T2) & reorganization_free(X,T1,T2) & complexity(X,C1,T1) & complexity(X,C2,T2) & size(X,S1,T1) & size(X,S2,T2) & greater(S2,S1) -> -greater(C1,C2))) # label(t14_FOL) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.68/0.98
% 0.68/0.98 ============================== end of process non-clausal formulas ===
% 0.68/0.98
% 0.68/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.68/0.98
% 0.68/0.98 ============================== PREDICATE ELIMINATION =================
% 0.68/0.98
% 0.68/0.98 ============================== end predicate elimination =============
% 0.68/0.98
% 0.68/0.98 Auto_denials: (non-Horn, no changes).
% 0.68/0.98
% 0.68/0.98 Term ordering decisions:
% 0.68/0.98 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1.
% 0.68/0.98
% 0.68/0.98 ============================== end of process initial clauses ========
% 0.68/0.98
% 0.68/0.98 ============================== CLAUSES FOR SEARCH ====================
% 0.68/0.98
% 0.68/0.98 ============================== end of clauses for search =============
% 0.68/0.98
% 0.68/0.98 ============================== SEARCH ================================
% 0.68/0.98
% 0.68/0.98 % Starting search at 0.01 seconds.
% 0.68/0.98
% 0.68/0.98 ============================== PROOF =================================
% 0.68/0.98 % SZS status Theorem
% 0.68/0.98 % SZS output start Refutation
% 0.68/0.98
% 0.68/0.98 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.68/0.98 % Length of proof is 32.
% 0.68/0.98 % Level of proof is 4.
% 0.68/0.98 % Maximum clause weight is 24.000.
% 0.68/0.98 % Given clauses 33.
% 0.68/0.98
% 0.68/0.98 1 (all X all Y -(greater(X,Y) & X = Y)) # label(mp6_1) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.98 3 (all X all T (organization(X,T) -> time(T))) # label(mp15) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.98 4 (all T1 all T2 (time(T1) & time(T2) -> greater(T1,T2) | T1 = T2 | greater(T2,T1))) # label(mp16) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.98 5 (all X all T1 all T2 (reorganization_free(X,T1,T2) -> reorganization_free(X,T2,T1))) # label(mp17) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.98 6 (all X all S1 all S2 all T1 all T2 (organization(X,T1) & organization(X,T2) & size(X,S1,T1) & size(X,S2,T2) & T1 = T2 -> S1 = S2)) # label(mp19) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.98 7 (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(hypothesis) # label(non_clause). [assumption].
% 0.68/0.98 8 (all X all C1 all C2 all T1 all T2 (organization(X,T1) & organization(X,T2) & reorganization_free(X,T1,T2) & complexity(X,C1,T1) & complexity(X,C2,T2) & greater(T2,T1) -> -greater(C1,C2))) # label(t12_FOL) # label(hypothesis) # label(non_clause). [assumption].
% 0.68/0.98 9 -(all X all C1 all C2 all S1 all S2 all T1 all T2 (organization(X,T1) & organization(X,T2) & reorganization_free(X,T1,T2) & complexity(X,C1,T1) & complexity(X,C2,T2) & size(X,S1,T1) & size(X,S2,T2) & greater(S2,S1) -> -greater(C1,C2))) # label(t14_FOL) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.68/0.98 10 organization(c1,c6) # label(t14_FOL) # label(negated_conjecture). [clausify(9)].
% 0.68/0.98 11 organization(c1,c7) # label(t14_FOL) # label(negated_conjecture). [clausify(9)].
% 0.68/0.98 12 greater(c5,c4) # label(t14_FOL) # label(negated_conjecture). [clausify(9)].
% 0.68/0.98 13 greater(c2,c3) # label(t14_FOL) # label(negated_conjecture). [clausify(9)].
% 0.68/0.98 14 reorganization_free(c1,c6,c7) # label(t14_FOL) # label(negated_conjecture). [clausify(9)].
% 0.68/0.98 15 complexity(c1,c2,c6) # label(t14_FOL) # label(negated_conjecture). [clausify(9)].
% 0.68/0.98 16 complexity(c1,c3,c7) # label(t14_FOL) # label(negated_conjecture). [clausify(9)].
% 0.68/0.98 17 size(c1,c4,c6) # label(t14_FOL) # label(negated_conjecture). [clausify(9)].
% 0.68/0.98 18 size(c1,c5,c7) # label(t14_FOL) # label(negated_conjecture). [clausify(9)].
% 0.68/0.98 19 -greater(A,B) | B != A # label(mp6_1) # label(axiom). [clausify(1)].
% 0.68/0.98 21 -organization(A,B) | -organization(A,C) | -reorganization_free(A,B,C) | -size(A,D,B) | -size(A,E,C) | -greater(C,B) | -greater(D,E) # label(t11_FOL) # label(hypothesis). [clausify(7)].
% 0.68/0.98 22 -organization(A,B) | -organization(A,C) | -reorganization_free(A,B,C) | -complexity(A,D,B) | -complexity(A,E,C) | -greater(C,B) | -greater(D,E) # label(t12_FOL) # label(hypothesis). [clausify(8)].
% 0.68/0.98 23 -organization(A,B) | time(B) # label(mp15) # label(axiom). [clausify(3)].
% 0.68/0.98 24 -reorganization_free(A,B,C) | reorganization_free(A,C,B) # label(mp17) # label(axiom). [clausify(5)].
% 0.68/0.98 25 -time(A) | -time(B) | greater(A,B) | B = A | greater(B,A) # label(mp16) # label(axiom). [clausify(4)].
% 0.68/0.98 26 -organization(A,B) | -organization(A,C) | -size(A,D,B) | -size(A,E,C) | C != B | E = D # label(mp19) # label(axiom). [clausify(6)].
% 0.68/0.98 32 c5 != c4. [resolve(19,a,12,a),flip(a)].
% 0.68/0.98 41 -greater(c7,c6). [ur(22,a,10,a,b,11,a,c,14,a,d,15,a,e,16,a,g,13,a)].
% 0.68/0.98 46 time(c7). [resolve(23,a,11,a)].
% 0.68/0.98 47 time(c6). [resolve(23,a,10,a)].
% 0.68/0.98 48 reorganization_free(c1,c7,c6). [resolve(24,a,14,a)].
% 0.68/0.98 55 c7 != c6. [ur(26,a,10,a,b,11,a,c,17,a,d,18,a,f,32,a)].
% 0.68/0.98 60 -greater(c6,c7). [ur(21,a,11,a,b,10,a,c,48,a,d,18,a,e,17,a,g,12,a)].
% 0.68/0.98 61 $F. [ur(25,b,47,a,c,41,a,d,55,a(flip),e,60,a),unit_del(a,46)].
% 0.68/0.98
% 0.68/0.98 % SZS output end Refutation
% 0.68/0.98 ============================== end of proof ==========================
% 0.68/0.98
% 0.68/0.98 ============================== STATISTICS ============================
% 0.68/0.98
% 0.68/0.98 Given=33. Generated=99. Kept=51. proofs=1.
% 0.68/0.98 Usable=33. Sos=14. Demods=0. Limbo=0, Disabled=21. Hints=0.
% 0.68/0.98 Megabytes=0.09.
% 0.68/0.98 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.68/0.98
% 0.68/0.98 ============================== end of statistics =====================
% 0.68/0.98
% 0.68/0.98 ============================== end of search =========================
% 0.68/0.98
% 0.68/0.98 THEOREM PROVED
% 0.68/0.98 % SZS status Theorem
% 0.68/0.98
% 0.68/0.98 Exiting with 1 proof.
% 0.68/0.98
% 0.68/0.98 Process 30469 exit (max_proofs) Thu Jun 9 11:13:08 2022
% 0.68/0.98 Prover9 interrupted
%------------------------------------------------------------------------------