TSTP Solution File: SWV019-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWV019-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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 : Wed Jul 20 21:10:15 EDT 2022
% Result : Unsatisfiable 0.77s 1.04s
% Output : Refutation 0.77s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWV019-1 : TPTP v8.1.0. Released v2.4.0.
% 0.08/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.36 % Computer : n028.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Tue Jun 14 22:32:39 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.77/1.04 ============================== Prover9 ===============================
% 0.77/1.04 Prover9 (32) version 2009-11A, November 2009.
% 0.77/1.04 Process 26983 was started by sandbox2 on n028.cluster.edu,
% 0.77/1.04 Tue Jun 14 22:32:40 2022
% 0.77/1.04 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_26829_n028.cluster.edu".
% 0.77/1.04 ============================== end of head ===========================
% 0.77/1.04
% 0.77/1.04 ============================== INPUT =================================
% 0.77/1.04
% 0.77/1.04 % Reading from file /tmp/Prover9_26829_n028.cluster.edu
% 0.77/1.04
% 0.77/1.04 set(prolog_style_variables).
% 0.77/1.04 set(auto2).
% 0.77/1.04 % set(auto2) -> set(auto).
% 0.77/1.04 % set(auto) -> set(auto_inference).
% 0.77/1.04 % set(auto) -> set(auto_setup).
% 0.77/1.04 % set(auto_setup) -> set(predicate_elim).
% 0.77/1.04 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.77/1.04 % set(auto) -> set(auto_limits).
% 0.77/1.04 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.77/1.04 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.77/1.04 % set(auto) -> set(auto_denials).
% 0.77/1.04 % set(auto) -> set(auto_process).
% 0.77/1.04 % set(auto2) -> assign(new_constants, 1).
% 0.77/1.04 % set(auto2) -> assign(fold_denial_max, 3).
% 0.77/1.04 % set(auto2) -> assign(max_weight, "200.000").
% 0.77/1.04 % set(auto2) -> assign(max_hours, 1).
% 0.77/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.77/1.04 % set(auto2) -> assign(max_seconds, 0).
% 0.77/1.04 % set(auto2) -> assign(max_minutes, 5).
% 0.77/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.77/1.04 % set(auto2) -> set(sort_initial_sos).
% 0.77/1.04 % set(auto2) -> assign(sos_limit, -1).
% 0.77/1.04 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.77/1.04 % set(auto2) -> assign(max_megs, 400).
% 0.77/1.04 % set(auto2) -> assign(stats, some).
% 0.77/1.04 % set(auto2) -> clear(echo_input).
% 0.77/1.04 % set(auto2) -> set(quiet).
% 0.77/1.04 % set(auto2) -> clear(print_initial_clauses).
% 0.77/1.04 % set(auto2) -> clear(print_given).
% 0.77/1.04 assign(lrs_ticks,-1).
% 0.77/1.04 assign(sos_limit,10000).
% 0.77/1.04 assign(order,kbo).
% 0.77/1.04 set(lex_order_vars).
% 0.77/1.04 clear(print_given).
% 0.77/1.04
% 0.77/1.04 % formulas(sos). % not echoed (10 formulas)
% 0.77/1.04
% 0.77/1.04 ============================== end of input ==========================
% 0.77/1.04
% 0.77/1.04 % From the command line: assign(max_seconds, 300).
% 0.77/1.04
% 0.77/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.77/1.04
% 0.77/1.04 % Formulas that are not ordinary clauses:
% 0.77/1.04
% 0.77/1.04 ============================== end of process non-clausal formulas ===
% 0.77/1.04
% 0.77/1.04 ============================== PROCESS INITIAL CLAUSES ===============
% 0.77/1.04
% 0.77/1.04 ============================== PREDICATE ELIMINATION =================
% 0.77/1.04
% 0.77/1.04 ============================== end predicate elimination =============
% 0.77/1.04
% 0.77/1.04 Auto_denials: (non-Horn, no changes).
% 0.77/1.04
% 0.77/1.04 Term ordering decisions:
% 0.77/1.04
% 0.77/1.04 % Assigning unary symbol successor kb_weight 0 and highest precedence (11).
% 0.77/1.04 Function symbol KB weights: index_of_maximal=1. array=1. an_index=1. lower_bound=1. maximal_value=1. upper_bound=1. array_value_at=1. successor=0.
% 0.77/1.04
% 0.77/1.04 ============================== end of process initial clauses ========
% 0.77/1.04
% 0.77/1.04 ============================== CLAUSES FOR SEARCH ====================
% 0.77/1.04
% 0.77/1.04 ============================== end of clauses for search =============
% 0.77/1.04
% 0.77/1.04 ============================== SEARCH ================================
% 0.77/1.04
% 0.77/1.04 % Starting search at 0.01 seconds.
% 0.77/1.04
% 0.77/1.04 ============================== PROOF =================================
% 0.77/1.04 % SZS status Unsatisfiable
% 0.77/1.04 % SZS output start Refutation
% 0.77/1.04
% 0.77/1.04 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.77/1.04 % Length of proof is 24.
% 0.77/1.04 % Level of proof is 7.
% 0.77/1.04 % Maximum clause weight is 24.000.
% 0.77/1.04 % Given clauses 41.
% 0.77/1.04
% 0.77/1.04 1 less_than(index_of_maximal,an_index) # label(maximal_before_somewhere) # label(axiom). [assumption].
% 0.77/1.04 2 less_than(A,successor(A)) # label(successor_greater) # label(axiom). [assumption].
% 0.77/1.04 3 less_than(A,lower_bound) | less_than(upper_bound,A) | in_array_bounds(array,A) # label(in_bounds) # label(axiom). [assumption].
% 0.77/1.04 4 -less_than(an_index,lower_bound) # label(somewhere_above_lower_bound) # label(axiom). [assumption].
% 0.77/1.04 5 -less_than(upper_bound,an_index) # label(somewhere_below_upper_bound) # label(axiom). [assumption].
% 0.77/1.04 6 -less_than(index_of_maximal,lower_bound) # label(maximal_above_lower_bound) # label(axiom). [assumption].
% 0.77/1.04 7 -less_than(successor(A),successor(B)) | less_than(A,B) # label(predecessor_less) # label(axiom). [assumption].
% 0.77/1.04 8 -in_array_bounds(array,index_of_maximal) | maximal_value = array_value_at(array,index_of_maximal) # label(this_is_maximal) # label(axiom). [assumption].
% 0.77/1.04 9 -in_array_bounds(array,index_of_maximal) | array_value_at(array,index_of_maximal) = maximal_value. [copy(8),flip(b)].
% 0.77/1.04 10 -less_than(A,B) | -less_than(B,C) | less_than(A,C) # label(transitivity_of_less) # label(axiom). [assumption].
% 0.77/1.04 11 -in_array_bounds(array,an_index) | less_than(successor(an_index),lower_bound) | less_than(successor(upper_bound),successor(an_index)) | less_than(index_of_maximal,lower_bound) | -less_than(index_of_maximal,successor(an_index)) | -in_array_bounds(array,index_of_maximal) | maximal_value != array_value_at(array,index_of_maximal) # label(prove_this) # label(negated_conjecture). [assumption].
% 0.77/1.04 12 -in_array_bounds(array,an_index) | less_than(successor(an_index),lower_bound) | less_than(successor(upper_bound),successor(an_index)) | -less_than(index_of_maximal,successor(an_index)) | -in_array_bounds(array,index_of_maximal) | array_value_at(array,index_of_maximal) != maximal_value. [copy(11),flip(g),unit_del(d,6)].
% 0.77/1.04 14 -less_than(successor(upper_bound),successor(an_index)). [ur(7,b,5,a)].
% 0.77/1.04 16 -in_array_bounds(array,an_index) | less_than(successor(an_index),lower_bound) | -less_than(index_of_maximal,successor(an_index)) | -in_array_bounds(array,index_of_maximal) | array_value_at(array,index_of_maximal) != maximal_value. [back_unit_del(12),unit_del(c,14)].
% 0.77/1.04 17 array_value_at(array,index_of_maximal) = maximal_value | less_than(upper_bound,index_of_maximal). [resolve(9,a,3,c),unit_del(b,6)].
% 0.77/1.04 19 -less_than(an_index,A) | less_than(index_of_maximal,A). [resolve(10,a,1,a)].
% 0.77/1.04 22 -less_than(upper_bound,index_of_maximal). [ur(10,b,1,a,c,5,a)].
% 0.77/1.04 25 -less_than(successor(an_index),lower_bound). [ur(10,a,2,a,c,4,a)].
% 0.77/1.04 26 array_value_at(array,index_of_maximal) = maximal_value. [back_unit_del(17),unit_del(b,22)].
% 0.77/1.04 27 -in_array_bounds(array,an_index) | -less_than(index_of_maximal,successor(an_index)) | -in_array_bounds(array,index_of_maximal). [back_unit_del(16),rewrite([26(17)]),xx(e),unit_del(b,25)].
% 0.77/1.04 37 less_than(index_of_maximal,successor(an_index)). [resolve(19,a,2,a)].
% 0.77/1.04 38 -in_array_bounds(array,an_index) | -in_array_bounds(array,index_of_maximal). [back_unit_del(27),unit_del(b,37)].
% 0.77/1.04 102 -in_array_bounds(array,index_of_maximal). [resolve(38,a,3,c),unit_del(b,4),unit_del(c,5)].
% 0.77/1.04 103 $F. [resolve(102,a,3,c),unit_del(a,6),unit_del(b,22)].
% 0.77/1.04
% 0.77/1.04 % SZS output end Refutation
% 0.77/1.04 ============================== end of proof ==========================
% 0.77/1.04
% 0.77/1.04 ============================== STATISTICS ============================
% 0.77/1.04
% 0.77/1.04 Given=41. Generated=212. Kept=100. proofs=1.
% 0.77/1.04 Usable=39. Sos=55. Demods=1. Limbo=0, Disabled=16. Hints=0.
% 0.77/1.04 Megabytes=0.08.
% 0.77/1.04 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.77/1.04
% 0.77/1.04 ============================== end of statistics =====================
% 0.77/1.04
% 0.77/1.04 ============================== end of search =========================
% 0.77/1.04
% 0.77/1.04 THEOREM PROVED
% 0.77/1.04 % SZS status Unsatisfiable
% 0.77/1.04
% 0.77/1.04 Exiting with 1 proof.
% 0.77/1.04
% 0.77/1.04 Process 26983 exit (max_proofs) Tue Jun 14 22:32:40 2022
% 0.77/1.04 Prover9 interrupted
%------------------------------------------------------------------------------