TSTP Solution File: MGT017+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT017+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n024.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:51 EDT 2022
% Result : Theorem 0.71s 1.00s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : MGT017+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.31 % Computer : n024.cluster.edu
% 0.12/0.31 % Model : x86_64 x86_64
% 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31 % Memory : 8042.1875MB
% 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31 % CPULimit : 300
% 0.12/0.31 % WCLimit : 600
% 0.12/0.31 % DateTime : Thu Jun 9 08:19:49 EDT 2022
% 0.12/0.31 % CPUTime :
% 0.71/1.00 ============================== Prover9 ===============================
% 0.71/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.71/1.00 Process 32767 was started by sandbox2 on n024.cluster.edu,
% 0.71/1.00 Thu Jun 9 08:19:50 2022
% 0.71/1.00 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_32614_n024.cluster.edu".
% 0.71/1.00 ============================== end of head ===========================
% 0.71/1.00
% 0.71/1.00 ============================== INPUT =================================
% 0.71/1.00
% 0.71/1.00 % Reading from file /tmp/Prover9_32614_n024.cluster.edu
% 0.71/1.00
% 0.71/1.00 set(prolog_style_variables).
% 0.71/1.00 set(auto2).
% 0.71/1.00 % set(auto2) -> set(auto).
% 0.71/1.00 % set(auto) -> set(auto_inference).
% 0.71/1.00 % set(auto) -> set(auto_setup).
% 0.71/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.71/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.71/1.00 % set(auto) -> set(auto_limits).
% 0.71/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.71/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.71/1.00 % set(auto) -> set(auto_denials).
% 0.71/1.00 % set(auto) -> set(auto_process).
% 0.71/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.71/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.71/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.71/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.71/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.71/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.71/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.71/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.71/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.71/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.71/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.71/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.71/1.00 % set(auto2) -> assign(stats, some).
% 0.71/1.00 % set(auto2) -> clear(echo_input).
% 0.71/1.00 % set(auto2) -> set(quiet).
% 0.71/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.71/1.00 % set(auto2) -> clear(print_given).
% 0.71/1.00 assign(lrs_ticks,-1).
% 0.71/1.00 assign(sos_limit,10000).
% 0.71/1.00 assign(order,kbo).
% 0.71/1.00 set(lex_order_vars).
% 0.71/1.00 clear(print_given).
% 0.71/1.00
% 0.71/1.00 % formulas(sos). % not echoed (4 formulas)
% 0.71/1.00
% 0.71/1.00 ============================== end of input ==========================
% 0.71/1.00
% 0.71/1.00 % From the command line: assign(max_seconds, 300).
% 0.71/1.00
% 0.71/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.71/1.00
% 0.71/1.00 % Formulas that are not ordinary clauses:
% 0.71/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.71/1.00 2 (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.71/1.00 3 (all X all Y all Rt all C all I1 all I2 all Ta all Tb all Tc (organization(X,Ta) & organization(Y,Ta) & organization(Y,Tc) & class(X,C,Ta) & class(Y,C,Ta) & reorganization(X,Ta,Tb) & reorganization(Y,Ta,Tc) & reorganization_type(X,Rt,Ta) & reorganization_type(Y,Rt,Ta) & inertia(X,I1,Ta) & inertia(Y,I2,Ta) & greater(I2,I1) -> greater(Tc,Tb))) # label(a13_FOL) # label(hypothesis) # label(non_clause). [assumption].
% 0.71/1.00 4 -(all X all Y all Rt all C all S1 all S2 all Ta all Tb all Tc (organization(X,Ta) & organization(Y,Ta) & organization(Y,Tc) & class(X,C,Ta) & class(Y,C,Ta) & reorganization(X,Ta,Tb) & reorganization(Y,Ta,Tc) & reorganization_type(X,Rt,Ta) & reorganization_type(Y,Rt,Ta) & size(X,S1,Ta) & size(Y,S2,Ta) & greater(S2,S1) -> greater(Tc,Tb))) # label(t17_FOL) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.71/1.00
% 0.71/1.00 ============================== end of process non-clausal formulas ===
% 0.71/1.00
% 0.71/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.71/1.00
% 0.71/1.00 ============================== PREDICATE ELIMINATION =================
% 0.71/1.00
% 0.71/1.00 ============================== end predicate elimination =============
% 0.71/1.00
% 0.71/1.00 Auto_denials:
% 0.71/1.00 % copying label t17_FOL to answer in negative clause
% 0.71/1.00
% 0.71/1.00 Term ordering decisions:
% 0.71/1.00 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. f1=1.
% 0.71/1.00
% 0.71/1.00 ============================== end of process initial clauses ========
% 0.71/1.00
% 0.71/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.71/1.00
% 0.71/1.00 ============================== end of clauses for search =============
% 0.71/1.00
% 0.71/1.00 ============================== SEARCH ================================
% 0.71/1.00
% 0.71/1.00 % Starting search at 0.01 seconds.
% 0.71/1.00
% 0.71/1.00 ============================== PROOF =================================
% 0.71/1.00 % SZS status Theorem
% 0.71/1.00 % SZS output start Refutation
% 0.71/1.00
% 0.71/1.00 % Proof 1 at 0.02 (+ 0.00) seconds: t17_FOL.
% 0.71/1.00 % Length of proof is 25.
% 0.71/1.00 % Level of proof is 4.
% 0.71/1.00 % Maximum clause weight is 47.000.
% 0.71/1.00 % Given clauses 23.
% 0.71/1.00
% 0.71/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.71/1.00 2 (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.71/1.00 3 (all X all Y all Rt all C all I1 all I2 all Ta all Tb all Tc (organization(X,Ta) & organization(Y,Ta) & organization(Y,Tc) & class(X,C,Ta) & class(Y,C,Ta) & reorganization(X,Ta,Tb) & reorganization(Y,Ta,Tc) & reorganization_type(X,Rt,Ta) & reorganization_type(Y,Rt,Ta) & inertia(X,I1,Ta) & inertia(Y,I2,Ta) & greater(I2,I1) -> greater(Tc,Tb))) # label(a13_FOL) # label(hypothesis) # label(non_clause). [assumption].
% 0.71/1.00 4 -(all X all Y all Rt all C all S1 all S2 all Ta all Tb all Tc (organization(X,Ta) & organization(Y,Ta) & organization(Y,Tc) & class(X,C,Ta) & class(Y,C,Ta) & reorganization(X,Ta,Tb) & reorganization(Y,Ta,Tc) & reorganization_type(X,Rt,Ta) & reorganization_type(Y,Rt,Ta) & size(X,S1,Ta) & size(Y,S2,Ta) & greater(S2,S1) -> greater(Tc,Tb))) # label(t17_FOL) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.71/1.00 5 organization(c1,c7) # label(t17_FOL) # label(negated_conjecture). [clausify(4)].
% 0.71/1.00 6 organization(c2,c7) # label(t17_FOL) # label(negated_conjecture). [clausify(4)].
% 0.71/1.00 7 organization(c2,c9) # label(t17_FOL) # label(negated_conjecture). [clausify(4)].
% 0.71/1.00 8 greater(c6,c5) # label(t17_FOL) # label(negated_conjecture). [clausify(4)].
% 0.71/1.00 9 class(c1,c4,c7) # label(t17_FOL) # label(negated_conjecture). [clausify(4)].
% 0.71/1.00 10 class(c2,c4,c7) # label(t17_FOL) # label(negated_conjecture). [clausify(4)].
% 0.71/1.00 11 reorganization(c1,c7,c8) # label(t17_FOL) # label(negated_conjecture). [clausify(4)].
% 0.71/1.00 12 reorganization(c2,c7,c9) # label(t17_FOL) # label(negated_conjecture). [clausify(4)].
% 0.71/1.00 13 reorganization_type(c1,c3,c7) # label(t17_FOL) # label(negated_conjecture). [clausify(4)].
% 0.71/1.00 14 reorganization_type(c2,c3,c7) # label(t17_FOL) # label(negated_conjecture). [clausify(4)].
% 0.71/1.00 15 size(c1,c5,c7) # label(t17_FOL) # label(negated_conjecture). [clausify(4)].
% 0.71/1.00 16 size(c2,c6,c7) # label(t17_FOL) # label(negated_conjecture). [clausify(4)].
% 0.71/1.00 17 -greater(c9,c8) # label(t17_FOL) # label(negated_conjecture) # answer(t17_FOL). [clausify(4)].
% 0.71/1.00 18 -organization(A,B) | inertia(A,f1(A,B),B) # label(mp5) # label(axiom). [clausify(1)].
% 0.71/1.00 19 -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(2)].
% 0.71/1.00 20 -organization(A,B) | -organization(C,B) | -organization(C,D) | -class(A,E,B) | -class(C,E,B) | -reorganization(A,B,F) | -reorganization(C,B,D) | -reorganization_type(A,V6,B) | -reorganization_type(C,V6,B) | -inertia(A,V7,B) | -inertia(C,V8,B) | -greater(V8,V7) | greater(D,F) # label(a13_FOL) # label(hypothesis). [clausify(3)].
% 0.71/1.00 22 inertia(c2,f1(c2,c7),c7). [ur(18,a,6,a)].
% 0.71/1.00 23 inertia(c1,f1(c1,c7),c7). [ur(18,a,5,a)].
% 0.71/1.00 64 greater(f1(c2,c7),f1(c1,c7)). [ur(19,a,5,a,b,6,a,c,9,a,d,10,a,e,15,a,f,16,a,g,23,a,h,22,a,i,8,a)].
% 0.71/1.00 65 -greater(f1(c2,c7),f1(c1,c7)) # answer(t17_FOL). [ur(20,a,5,a,b,6,a,c,7,a,d,9,a,e,10,a,f,11,a,g,12,a,h,13,a,i,14,a,j,23,a,k,22,a,m,17,a)].
% 0.71/1.00 66 $F # answer(t17_FOL). [resolve(65,a,64,a)].
% 0.71/1.00
% 0.71/1.00 % SZS output end Refutation
% 0.71/1.00 ============================== end of proof ==========================
% 0.71/1.00
% 0.71/1.00 ============================== STATISTICS ============================
% 0.71/1.00
% 0.71/1.00 Given=23. Generated=62. Kept=61. proofs=1.
% 0.71/1.00 Usable=20. Sos=35. Demods=0. Limbo=1, Disabled=20. Hints=0.
% 0.71/1.00 Megabytes=0.14.
% 0.71/1.00 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.71/1.00
% 0.71/1.00 ============================== end of statistics =====================
% 0.71/1.00
% 0.71/1.00 ============================== end of search =========================
% 0.71/1.00
% 0.71/1.00 THEOREM PROVED
% 0.71/1.00 % SZS status Theorem
% 0.71/1.00
% 0.71/1.00 Exiting with 1 proof.
% 0.71/1.00
% 0.71/1.00 Process 32767 exit (max_proofs) Thu Jun 9 08:19:50 2022
% 0.71/1.00 Prover9 interrupted
%------------------------------------------------------------------------------