TSTP Solution File: MGT003-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT003-1 : TPTP v8.1.0. Released v2.4.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:46 EDT 2022
% Result : Unsatisfiable 0.47s 1.04s
% Output : Refutation 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : MGT003-1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n024.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 9 07:36:34 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.47/1.03 ============================== Prover9 ===============================
% 0.47/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.47/1.03 Process 3619 was started by sandbox2 on n024.cluster.edu,
% 0.47/1.03 Thu Jun 9 07:36:35 2022
% 0.47/1.03 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_3239_n024.cluster.edu".
% 0.47/1.03 ============================== end of head ===========================
% 0.47/1.03
% 0.47/1.03 ============================== INPUT =================================
% 0.47/1.03
% 0.47/1.03 % Reading from file /tmp/Prover9_3239_n024.cluster.edu
% 0.47/1.03
% 0.47/1.03 set(prolog_style_variables).
% 0.47/1.03 set(auto2).
% 0.47/1.03 % set(auto2) -> set(auto).
% 0.47/1.03 % set(auto) -> set(auto_inference).
% 0.47/1.03 % set(auto) -> set(auto_setup).
% 0.47/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.47/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.47/1.03 % set(auto) -> set(auto_limits).
% 0.47/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.47/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.47/1.03 % set(auto) -> set(auto_denials).
% 0.47/1.03 % set(auto) -> set(auto_process).
% 0.47/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.47/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.47/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.47/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.47/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.47/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.47/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.47/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.47/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.47/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.47/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.47/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.47/1.03 % set(auto2) -> assign(stats, some).
% 0.47/1.03 % set(auto2) -> clear(echo_input).
% 0.47/1.03 % set(auto2) -> set(quiet).
% 0.47/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.47/1.03 % set(auto2) -> clear(print_given).
% 0.47/1.03 assign(lrs_ticks,-1).
% 0.47/1.03 assign(sos_limit,10000).
% 0.47/1.03 assign(order,kbo).
% 0.47/1.03 set(lex_order_vars).
% 0.47/1.03 clear(print_given).
% 0.47/1.03
% 0.47/1.03 % formulas(sos). % not echoed (12 formulas)
% 0.47/1.03
% 0.47/1.03 ============================== end of input ==========================
% 0.47/1.03
% 0.47/1.03 % From the command line: assign(max_seconds, 300).
% 0.47/1.03
% 0.47/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.47/1.04
% 0.47/1.04 % Formulas that are not ordinary clauses:
% 0.47/1.04
% 0.47/1.04 ============================== end of process non-clausal formulas ===
% 0.47/1.04
% 0.47/1.04 ============================== PROCESS INITIAL CLAUSES ===============
% 0.47/1.04
% 0.47/1.04 ============================== PREDICATE ELIMINATION =================
% 0.47/1.04
% 0.47/1.04 ============================== end predicate elimination =============
% 0.47/1.04
% 0.47/1.04 Auto_denials:
% 0.47/1.04 % copying label t3_FOL_12 to answer in negative clause
% 0.47/1.04
% 0.47/1.04 Term ordering decisions:
% 0.47/1.04 Function symbol KB weights: sk2=1. sk5=1. sk6=1. sk3=1. sk4=1. sk1=1.
% 0.47/1.04
% 0.47/1.04 ============================== end of process initial clauses ========
% 0.47/1.04
% 0.47/1.04 ============================== CLAUSES FOR SEARCH ====================
% 0.47/1.04
% 0.47/1.04 ============================== end of clauses for search =============
% 0.47/1.04
% 0.47/1.04 ============================== SEARCH ================================
% 0.47/1.04
% 0.47/1.04 % Starting search at 0.01 seconds.
% 0.47/1.04
% 0.47/1.04 ============================== PROOF =================================
% 0.47/1.04 % SZS status Unsatisfiable
% 0.47/1.04 % SZS output start Refutation
% 0.47/1.04
% 0.47/1.04 % Proof 1 at 0.02 (+ 0.00) seconds: t3_FOL_12.
% 0.47/1.04 % Length of proof is 19.
% 0.47/1.04 % Level of proof is 3.
% 0.47/1.04 % Maximum clause weight is 36.000.
% 0.47/1.04 % Given clauses 20.
% 0.47/1.04
% 0.47/1.04 1 organization(sk2,sk5) # label(t3_FOL_6) # label(negated_conjecture). [assumption].
% 0.47/1.04 2 organization(sk2,sk6) # label(t3_FOL_7) # label(negated_conjecture). [assumption].
% 0.47/1.04 3 greater(sk6,sk5) # label(t3_FOL_11) # label(negated_conjecture). [assumption].
% 0.47/1.04 4 reorganization_free(sk2,sk5,sk6) # label(t3_FOL_8) # label(negated_conjecture). [assumption].
% 0.47/1.04 5 survival_chance(sk2,sk3,sk5) # label(t3_FOL_9) # label(negated_conjecture). [assumption].
% 0.47/1.04 6 survival_chance(sk2,sk4,sk6) # label(t3_FOL_10) # label(negated_conjecture). [assumption].
% 0.47/1.04 7 -greater(sk4,sk3) # label(t3_FOL_12) # label(negated_conjecture) # answer(t3_FOL_12). [assumption].
% 0.47/1.04 8 -reorganization_free(A,B,C) | reorganization_free(A,B,B) # label(mp4_1) # label(axiom). [assumption].
% 0.47/1.04 9 -reorganization_free(A,B,C) | reorganization_free(A,C,C) # label(mp4_2) # label(axiom). [assumption].
% 0.47/1.04 10 -organization(A,B) | inertia(A,sk1(B,A),B) # label(mp5_3) # label(axiom). [assumption].
% 0.47/1.04 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_5) # label(hypothesis). [assumption].
% 0.47/1.04 12 -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_4) # label(hypothesis). [assumption].
% 0.47/1.04 13 reorganization_free(sk2,sk5,sk5). [ur(8,a,4,a)].
% 0.47/1.04 14 reorganization_free(sk2,sk6,sk6). [ur(9,a,4,a)].
% 0.47/1.04 15 inertia(sk2,sk1(sk6,sk2),sk6). [ur(10,a,2,a)].
% 0.47/1.04 16 inertia(sk2,sk1(sk5,sk2),sk5). [ur(10,a,1,a)].
% 0.47/1.04 41 greater(sk1(sk6,sk2),sk1(sk5,sk2)). [ur(11,a,1,a,b,2,a,c,4,a,d,16,a,e,15,a,f,3,a)].
% 0.47/1.04 42 -greater(sk1(sk6,sk2),sk1(sk5,sk2)) # answer(t3_FOL_12). [ur(12,a,1,a,b,2,a,c,13,a,d,14,a,e,16,a,f,15,a,g,5,a,h,6,a,j,7,a)].
% 0.47/1.04 43 $F # answer(t3_FOL_12). [resolve(42,a,41,a)].
% 0.47/1.04
% 0.47/1.04 % SZS output end Refutation
% 0.47/1.04 ============================== end of proof ==========================
% 0.47/1.04
% 0.47/1.04 ============================== STATISTICS ============================
% 0.47/1.04
% 0.47/1.04 Given=20. Generated=46. Kept=42. proofs=1.
% 0.47/1.04 Usable=18. Sos=16. Demods=0. Limbo=1, Disabled=18. Hints=0.
% 0.47/1.04 Megabytes=0.08.
% 0.47/1.04 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.47/1.04
% 0.47/1.04 ============================== end of statistics =====================
% 0.47/1.04
% 0.47/1.04 ============================== end of search =========================
% 0.47/1.04
% 0.47/1.04 THEOREM PROVED
% 0.47/1.04 % SZS status Unsatisfiable
% 0.47/1.04
% 0.47/1.04 Exiting with 1 proof.
% 0.47/1.04
% 0.47/1.04 Process 3619 exit (max_proofs) Thu Jun 9 07:36:35 2022
% 0.47/1.04 Prover9 interrupted
%------------------------------------------------------------------------------