TSTP Solution File: MGT003+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT003+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:46 EDT 2022
% Result : Theorem 0.73s 1.00s
% Output : Refutation 0.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT003+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n026.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 09:43:03 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.73/1.00 ============================== Prover9 ===============================
% 0.73/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.73/1.00 Process 28288 was started by sandbox2 on n026.cluster.edu,
% 0.73/1.00 Thu Jun 9 09:43:03 2022
% 0.73/1.00 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_28133_n026.cluster.edu".
% 0.73/1.00 ============================== end of head ===========================
% 0.73/1.00
% 0.73/1.00 ============================== INPUT =================================
% 0.73/1.00
% 0.73/1.00 % Reading from file /tmp/Prover9_28133_n026.cluster.edu
% 0.73/1.00
% 0.73/1.00 set(prolog_style_variables).
% 0.73/1.00 set(auto2).
% 0.73/1.00 % set(auto2) -> set(auto).
% 0.73/1.00 % set(auto) -> set(auto_inference).
% 0.73/1.00 % set(auto) -> set(auto_setup).
% 0.73/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.73/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.73/1.00 % set(auto) -> set(auto_limits).
% 0.73/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.73/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.73/1.00 % set(auto) -> set(auto_denials).
% 0.73/1.00 % set(auto) -> set(auto_process).
% 0.73/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.73/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.73/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.73/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.73/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.73/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.73/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.73/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.73/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.73/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.73/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.73/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.73/1.00 % set(auto2) -> assign(stats, some).
% 0.73/1.00 % set(auto2) -> clear(echo_input).
% 0.73/1.00 % set(auto2) -> set(quiet).
% 0.73/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.73/1.00 % set(auto2) -> clear(print_given).
% 0.73/1.00 assign(lrs_ticks,-1).
% 0.73/1.00 assign(sos_limit,10000).
% 0.73/1.00 assign(order,kbo).
% 0.73/1.00 set(lex_order_vars).
% 0.73/1.00 clear(print_given).
% 0.73/1.00
% 0.73/1.00 % formulas(sos). % not echoed (5 formulas)
% 0.73/1.00
% 0.73/1.00 ============================== end of input ==========================
% 0.73/1.00
% 0.73/1.00 % From the command line: assign(max_seconds, 300).
% 0.73/1.00
% 0.73/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.73/1.00
% 0.73/1.00 % Formulas that are not ordinary clauses:
% 0.73/1.00 1 (all X all T1 all T2 (reorganization_free(X,T1,T2) -> reorganization_free(X,T1,T1) & reorganization_free(X,T2,T2))) # label(mp4) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.00 2 (all X all T (organization(X,T) -> (exists I inertia(X,I,T)))) # label(mp5) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.00 3 (all X all Y all T1 all T2 all I1 all I2 all P1 all P2 (organization(X,T1) & organization(Y,T2) & reorganization_free(X,T1,T1) & reorganization_free(Y,T2,T2) & inertia(X,I1,T1) & inertia(Y,I2,T2) & survival_chance(X,P1,T1) & survival_chance(Y,P2,T2) & greater(I2,I1) -> greater(P2,P1))) # label(t1_FOL) # label(hypothesis) # label(non_clause). [assumption].
% 0.73/1.00 4 (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.73/1.00 5 -(all X all P1 all P2 all T1 all T2 (organization(X,T1) & organization(X,T2) & reorganization_free(X,T1,T2) & survival_chance(X,P1,T1) & survival_chance(X,P2,T2) & greater(T2,T1) -> greater(P2,P1))) # label(t3_FOL) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.73/1.00
% 0.73/1.00 ============================== end of process non-clausal formulas ===
% 0.73/1.00
% 0.73/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.73/1.00
% 0.73/1.00 ============================== PREDICATE ELIMINATION =================
% 0.73/1.00
% 0.73/1.00 ============================== end predicate elimination =============
% 0.73/1.00
% 0.73/1.00 Auto_denials:
% 0.73/1.00 % copying label t3_FOL to answer in negative clause
% 0.73/1.00
% 0.73/1.00 Term ordering decisions:
% 0.73/1.00 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. f1=1.
% 0.73/1.00
% 0.73/1.00 ============================== end of process initial clauses ========
% 0.73/1.00
% 0.73/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.73/1.00
% 0.73/1.00 ============================== end of clauses for search =============
% 0.73/1.00
% 0.73/1.00 ============================== SEARCH ================================
% 0.73/1.00
% 0.73/1.00 % Starting search at 0.01 seconds.
% 0.73/1.00
% 0.73/1.00 ============================== PROOF =================================
% 0.73/1.00 % SZS status Theorem
% 0.73/1.00 % SZS output start Refutation
% 0.73/1.00
% 0.73/1.00 % Proof 1 at 0.01 (+ 0.00) seconds: t3_FOL.
% 0.73/1.00 % Length of proof is 24.
% 0.73/1.00 % Level of proof is 4.
% 0.73/1.00 % Maximum clause weight is 36.000.
% 0.73/1.00 % Given clauses 20.
% 0.73/1.00
% 0.73/1.00 1 (all X all T1 all T2 (reorganization_free(X,T1,T2) -> reorganization_free(X,T1,T1) & reorganization_free(X,T2,T2))) # label(mp4) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.00 2 (all X all T (organization(X,T) -> (exists I inertia(X,I,T)))) # label(mp5) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.00 3 (all X all Y all T1 all T2 all I1 all I2 all P1 all P2 (organization(X,T1) & organization(Y,T2) & reorganization_free(X,T1,T1) & reorganization_free(Y,T2,T2) & inertia(X,I1,T1) & inertia(Y,I2,T2) & survival_chance(X,P1,T1) & survival_chance(Y,P2,T2) & greater(I2,I1) -> greater(P2,P1))) # label(t1_FOL) # label(hypothesis) # label(non_clause). [assumption].
% 0.73/1.00 4 (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.73/1.00 5 -(all X all P1 all P2 all T1 all T2 (organization(X,T1) & organization(X,T2) & reorganization_free(X,T1,T2) & survival_chance(X,P1,T1) & survival_chance(X,P2,T2) & greater(T2,T1) -> greater(P2,P1))) # label(t3_FOL) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.73/1.00 6 organization(c1,c4) # label(t3_FOL) # label(negated_conjecture). [clausify(5)].
% 0.73/1.00 7 organization(c1,c5) # label(t3_FOL) # label(negated_conjecture). [clausify(5)].
% 0.73/1.00 8 greater(c5,c4) # label(t3_FOL) # label(negated_conjecture). [clausify(5)].
% 0.73/1.00 9 reorganization_free(c1,c4,c5) # label(t3_FOL) # label(negated_conjecture). [clausify(5)].
% 0.73/1.00 10 survival_chance(c1,c2,c4) # label(t3_FOL) # label(negated_conjecture). [clausify(5)].
% 0.73/1.00 11 survival_chance(c1,c3,c5) # label(t3_FOL) # label(negated_conjecture). [clausify(5)].
% 0.73/1.00 12 -greater(c3,c2) # label(t3_FOL) # label(negated_conjecture) # answer(t3_FOL). [clausify(5)].
% 0.73/1.00 13 -reorganization_free(A,B,C) | reorganization_free(A,B,B) # label(mp4) # label(axiom). [clausify(1)].
% 0.73/1.00 14 -reorganization_free(A,B,C) | reorganization_free(A,C,C) # label(mp4) # label(axiom). [clausify(1)].
% 0.73/1.00 15 -organization(A,B) | inertia(A,f1(A,B),B) # label(mp5) # label(axiom). [clausify(2)].
% 0.73/1.00 16 -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(4)].
% 0.73/1.00 17 -organization(A,B) | -organization(C,D) | -reorganization_free(A,B,B) | -reorganization_free(C,D,D) | -inertia(A,E,B) | -inertia(C,F,D) | -survival_chance(A,V6,B) | -survival_chance(C,V7,D) | -greater(F,E) | greater(V7,V6) # label(t1_FOL) # label(hypothesis). [clausify(3)].
% 0.73/1.00 18 reorganization_free(c1,c4,c4). [ur(13,a,9,a)].
% 0.73/1.00 19 reorganization_free(c1,c5,c5). [ur(14,a,9,a)].
% 0.73/1.00 20 inertia(c1,f1(c1,c5),c5). [ur(15,a,7,a)].
% 0.73/1.00 21 inertia(c1,f1(c1,c4),c4). [ur(15,a,6,a)].
% 0.73/1.00 46 greater(f1(c1,c5),f1(c1,c4)). [ur(16,a,6,a,b,7,a,c,9,a,d,21,a,e,20,a,f,8,a)].
% 0.73/1.00 47 -greater(f1(c1,c5),f1(c1,c4)) # answer(t3_FOL). [ur(17,a,6,a,b,7,a,c,18,a,d,19,a,e,21,a,f,20,a,g,10,a,h,11,a,j,12,a)].
% 0.73/1.00 48 $F # answer(t3_FOL). [resolve(47,a,46,a)].
% 0.73/1.00
% 0.73/1.00 % SZS output end Refutation
% 0.73/1.00 ============================== end of proof ==========================
% 0.73/1.00
% 0.73/1.00 ============================== STATISTICS ============================
% 0.73/1.00
% 0.73/1.00 Given=20. Generated=46. Kept=42. proofs=1.
% 0.73/1.00 Usable=18. Sos=16. Demods=0. Limbo=1, Disabled=18. Hints=0.
% 0.73/1.00 Megabytes=0.09.
% 0.73/1.00 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.73/1.00
% 0.73/1.00 ============================== end of statistics =====================
% 0.73/1.00
% 0.73/1.00 ============================== end of search =========================
% 0.73/1.00
% 0.73/1.00 THEOREM PROVED
% 0.73/1.00 % SZS status Theorem
% 0.73/1.00
% 0.73/1.00 Exiting with 1 proof.
% 0.73/1.00
% 0.73/1.00 Process 28288 exit (max_proofs) Thu Jun 9 09:43:03 2022
% 0.73/1.00 Prover9 interrupted
%------------------------------------------------------------------------------