TSTP Solution File: MSC017+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MSC017+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n016.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:56:41 EDT 2022
% Result : Theorem 0.44s 0.98s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MSC017+1 : TPTP v8.1.0. Released v4.0.0.
% 0.13/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n016.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Fri Jul 1 16:28:12 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.44/0.98 ============================== Prover9 ===============================
% 0.44/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.44/0.98 Process 1658 was started by sandbox on n016.cluster.edu,
% 0.44/0.98 Fri Jul 1 16:28:13 2022
% 0.44/0.98 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_1505_n016.cluster.edu".
% 0.44/0.98 ============================== end of head ===========================
% 0.44/0.98
% 0.44/0.98 ============================== INPUT =================================
% 0.44/0.98
% 0.44/0.98 % Reading from file /tmp/Prover9_1505_n016.cluster.edu
% 0.44/0.98
% 0.44/0.98 set(prolog_style_variables).
% 0.44/0.98 set(auto2).
% 0.44/0.98 % set(auto2) -> set(auto).
% 0.44/0.98 % set(auto) -> set(auto_inference).
% 0.44/0.98 % set(auto) -> set(auto_setup).
% 0.44/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.44/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/0.98 % set(auto) -> set(auto_limits).
% 0.44/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/0.98 % set(auto) -> set(auto_denials).
% 0.44/0.98 % set(auto) -> set(auto_process).
% 0.44/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.44/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.44/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.44/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.44/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.44/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.44/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.44/0.98 % set(auto2) -> assign(stats, some).
% 0.44/0.98 % set(auto2) -> clear(echo_input).
% 0.44/0.98 % set(auto2) -> set(quiet).
% 0.44/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.44/0.98 % set(auto2) -> clear(print_given).
% 0.44/0.98 assign(lrs_ticks,-1).
% 0.44/0.98 assign(sos_limit,10000).
% 0.44/0.98 assign(order,kbo).
% 0.44/0.98 set(lex_order_vars).
% 0.44/0.98 clear(print_given).
% 0.44/0.98
% 0.44/0.98 % formulas(sos). % not echoed (7 formulas)
% 0.44/0.98
% 0.44/0.98 ============================== end of input ==========================
% 0.44/0.98
% 0.44/0.98 % From the command line: assign(max_seconds, 300).
% 0.44/0.98
% 0.44/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/0.98
% 0.44/0.98 % Formulas that are not ordinary clauses:
% 0.44/0.98 1 (all D (dive(D) -> nitrogen(D) = padi(depth(D),time(D)))) # label(dive_nitrogen) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.98 2 (all D (dive(D) -> (greater(depth(D),depth_limit) | greater(time(D),time_limit) <-> greater(nitrogen(D),nitrogen_limit)))) # label(depth_and_time_and_nitrogen) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.98 3 (all D (dive(D) -> (greater(nitrogen(D),nitrogen_limit) <-> outcome(D,dci)))) # label(too_much_nitrogen) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.98 4 (all D (dive(D) -> (all O (outcome(D,O) & bad(O) -> O = dci)))) # label(dci_is_the_only_bad_outcome) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.98 5 (all D (dive(D) -> -greater(depth(D),depth_limit) & -greater(time(D),time_limit))) # label(no_deep_long) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.98 6 -(all D (dive(D) -> (all O (outcome(D,O) -> -bad(O))))) # label(no_bad) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.44/0.98
% 0.44/0.98 ============================== end of process non-clausal formulas ===
% 0.44/0.98
% 0.44/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/0.98
% 0.44/0.98 ============================== PREDICATE ELIMINATION =================
% 0.44/0.98 7 -dive(A) | -outcome(A,B) | -bad(B) | B = dci # label(dci_is_the_only_bad_outcome) # label(axiom). [clausify(4)].
% 0.44/0.98 8 bad(dci) # label(bad_dci) # label(axiom). [assumption].
% 0.44/0.98 9 bad(c2) # label(no_bad) # label(negated_conjecture). [clausify(6)].
% 0.44/0.98 Derived: -dive(A) | -outcome(A,dci) | dci = dci. [resolve(7,c,8,a)].
% 0.44/0.98 Derived: -dive(A) | -outcome(A,c2) | c2 = dci. [resolve(7,c,9,a)].
% 0.44/0.98 10 -dive(A) | -greater(depth(A),depth_limit) # label(no_deep_long) # label(axiom). [clausify(5)].
% 0.44/0.98 11 dive(c1) # label(no_bad) # label(negated_conjecture). [clausify(6)].
% 0.44/0.98 Derived: -greater(depth(c1),depth_limit). [resolve(10,a,11,a)].
% 0.44/0.98 12 -dive(A) | -greater(time(A),time_limit) # label(no_deep_long) # label(axiom). [clausify(5)].
% 0.44/0.98 Derived: -greater(time(c1),time_limit). [resolve(12,a,11,a)].
% 0.44/0.98 13 -dive(A) | -greater(nitrogen(A),nitrogen_limit) | outcome(A,dci) # label(too_much_nitrogen) # label(axiom). [clausify(3)].
% 0.44/0.98 Derived: -greater(nitrogen(c1),nitrogen_limit) | outcome(c1,dci). [resolve(13,a,11,a)].
% 0.44/0.98 14 -dive(A) | greater(nitrogen(A),nitrogen_limit) | -outcome(A,dci) # label(too_much_nitrogen) # label(axiom). [clausify(3)].
% 0.44/0.98 Derived: greater(nitrogen(c1),nitrogen_limit) | -outcome(c1,dci). [resolve(14,a,11,a)].
% 0.44/0.98 15 -dive(A) | padi(depth(A),time(A)) = nitrogen(A) # label(dive_nitrogen) # label(axiom). [clausify(1)].
% 0.44/0.98 Derived: padi(depth(c1),time(c1)) = nitrogen(c1). [resolve(15,a,11,a)].
% 0.44/0.98 16 -dive(A) | -greater(depth(A),depth_limit) | greater(nitrogen(A),nitrogen_limit) # label(depth_and_time_and_nitrogen) # label(axiom). [clausify(2)].
% 0.44/0.98 17 -dive(A) | -greater(time(A),time_limit) | greater(nitrogen(A),nitrogen_limit) # label(depth_and_time_and_nitrogen) # label(axiom). [clausify(2)].
% 0.44/0.98 18 -dive(A) | greater(depth(A),depth_limit) | greater(time(A),time_limit) | -greater(nitrogen(A),nitrogen_limit) # label(depth_and_time_and_nitrogen) # label(axiom). [clausify(2)].
% 0.44/0.98 Derived: greater(depth(c1),depth_limit) | greater(time(c1),time_limit) | -greater(nitrogen(c1),nitrogen_limit). [resolve(18,a,11,a)].
% 0.44/0.98 19 -dive(A) | -outcome(A,dci) | dci = dci. [resolve(7,c,8,a)].
% 0.44/0.98 Derived: -outcome(c1,dci) | dci = dci. [resolve(19,a,11,a)].
% 0.44/0.98 20 -dive(A) | -outcome(A,c2) | c2 = dci. [resolve(7,c,9,a)].
% 0.44/0.98 Derived: -outcome(c1,c2) | c2 = dci. [resolve(20,a,11,a)].
% 0.44/0.98
% 0.44/0.98 ============================== end predicate elimination =============
% 0.44/0.98
% 0.44/0.98 Auto_denials: (non-Horn, no changes).
% 0.44/0.98
% 0.44/0.98 Term ordering decisions:
% 0.44/0.98 Function symbol KB weights: dci=1. nitrogen_limit=1. depth_limit=1. time_limit=1. c1=1. c2=1. padi=1. nitrogen=1. depth=1. time=1.
% 0.44/0.98
% 0.44/0.98 ============================== PROOF =================================
% 0.44/0.98 % SZS status Theorem
% 0.44/0.98 % SZS output start Refutation
% 0.44/0.98
% 0.44/0.98 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.44/0.98 % Length of proof is 23.
% 0.44/0.98 % Level of proof is 5.
% 0.44/0.98 % Maximum clause weight is 7.000.
% 0.44/0.98 % Given clauses 0.
% 0.44/0.98
% 0.44/0.98 2 (all D (dive(D) -> (greater(depth(D),depth_limit) | greater(time(D),time_limit) <-> greater(nitrogen(D),nitrogen_limit)))) # label(depth_and_time_and_nitrogen) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.98 3 (all D (dive(D) -> (greater(nitrogen(D),nitrogen_limit) <-> outcome(D,dci)))) # label(too_much_nitrogen) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.98 4 (all D (dive(D) -> (all O (outcome(D,O) & bad(O) -> O = dci)))) # label(dci_is_the_only_bad_outcome) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.98 5 (all D (dive(D) -> -greater(depth(D),depth_limit) & -greater(time(D),time_limit))) # label(no_deep_long) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.98 6 -(all D (dive(D) -> (all O (outcome(D,O) -> -bad(O))))) # label(no_bad) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.44/0.98 7 -dive(A) | -outcome(A,B) | -bad(B) | B = dci # label(dci_is_the_only_bad_outcome) # label(axiom). [clausify(4)].
% 0.44/0.98 9 bad(c2) # label(no_bad) # label(negated_conjecture). [clausify(6)].
% 0.44/0.98 10 -dive(A) | -greater(depth(A),depth_limit) # label(no_deep_long) # label(axiom). [clausify(5)].
% 0.44/0.98 11 dive(c1) # label(no_bad) # label(negated_conjecture). [clausify(6)].
% 0.44/0.98 12 -dive(A) | -greater(time(A),time_limit) # label(no_deep_long) # label(axiom). [clausify(5)].
% 0.44/0.98 14 -dive(A) | greater(nitrogen(A),nitrogen_limit) | -outcome(A,dci) # label(too_much_nitrogen) # label(axiom). [clausify(3)].
% 0.44/0.98 18 -dive(A) | greater(depth(A),depth_limit) | greater(time(A),time_limit) | -greater(nitrogen(A),nitrogen_limit) # label(depth_and_time_and_nitrogen) # label(axiom). [clausify(2)].
% 0.44/0.98 20 -dive(A) | -outcome(A,c2) | c2 = dci. [resolve(7,c,9,a)].
% 0.44/0.98 21 outcome(c1,c2) # label(no_bad) # label(negated_conjecture). [clausify(6)].
% 0.44/0.98 22 -greater(depth(c1),depth_limit). [resolve(10,a,11,a)].
% 0.44/0.98 23 -greater(time(c1),time_limit). [resolve(12,a,11,a)].
% 0.44/0.98 25 greater(nitrogen(c1),nitrogen_limit) | -outcome(c1,dci). [resolve(14,a,11,a)].
% 0.44/0.98 27 greater(depth(c1),depth_limit) | greater(time(c1),time_limit) | -greater(nitrogen(c1),nitrogen_limit). [resolve(18,a,11,a)].
% 0.44/0.98 28 -greater(nitrogen(c1),nitrogen_limit). [copy(27),unit_del(a,22),unit_del(b,23)].
% 0.44/0.98 29 -outcome(c1,c2) | c2 = dci. [resolve(20,a,11,a)].
% 0.44/0.98 30 c2 = dci. [copy(29),unit_del(a,21)].
% 0.44/0.98 31 -outcome(c1,dci). [back_unit_del(25),unit_del(a,28)].
% 0.44/0.98 32 $F. [back_rewrite(21),rewrite([30(2)]),unit_del(a,31)].
% 0.44/0.98
% 0.44/0.98 % SZS output end Refutation
% 0.44/0.98 ============================== end of proof ==========================
% 0.44/0.98
% 0.44/0.98 ============================== STATISTICS ============================
% 0.44/0.98
% 0.44/0.98 Given=0. Generated=11. Kept=9. proofs=1.
% 0.44/0.98 Usable=0. Sos=4. Demods=2. Limbo=2, Disabled=26. Hints=0.
% 0.44/0.98 Megabytes=0.04.
% 0.44/0.98 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.44/0.98
% 0.44/0.98 ============================== end of statistics =====================
% 0.44/0.98
% 0.44/0.98 ============================== end of search =========================
% 0.44/0.98
% 0.44/0.98 THEOREM PROVED
% 0.44/0.98 % SZS status Theorem
% 0.44/0.98
% 0.44/0.98 Exiting with 1 proof.
% 0.44/0.98
% 0.44/0.98 Process 1658 exit (max_proofs) Fri Jul 1 16:28:13 2022
% 0.44/0.98 Prover9 interrupted
%------------------------------------------------------------------------------