TSTP Solution File: SWV019-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWV019-1 : TPTP v3.4.2. Released v2.4.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art05.cs.miami.edu
% Model : i686 unknown
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 1000MB
% OS : Linux 2.4.22-21mdk-i686-up-4GB
% CPULimit : 600s
% Result : Unsatisfiable 0.0s
% Output : Assurance 0.0s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
%
% Gandalf c-2.6 r1 starting to prove: /home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/SWV/SWV019-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: neq
% detected subclass: medium
%
% strategies selected:
% (hyper 25 #f 2 13)
% (binary-unit 9 #f 2 13)
% (binary-double 9 #f 2 13)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 2 13)
% (binary-order 25 #f 2 13)
% (binary-posweight-order 101 #f)
% (binary-posweight-lex-big-order 25 #f)
% (binary-posweight-lex-small-order 9 #f)
% (binary-order-sos 50 #t)
% (binary-unit-uniteq 25 #f)
% (binary-weightorder 50 #f)
% (binary-order 50 #f)
% (hyper-order 30 #f)
% (binary 112 #t)
%
%
% SOS clause
% -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) | -equal(maximal_value,array_value_at(array,index_of_maximal)).
% was split for some strategies as:
% -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).
% -equal(maximal_value,array_value_at(array,index_of_maximal)).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(11,40,0,22,0,1)
%
%
% START OF PROOF
% 13 [] in_array_bounds(array,X) | less_than(upper_bound,X) | less_than(X,lower_bound).
% 14 [] -less_than(successor(X),successor(Y)) | less_than(X,Y).
% 15 [] -less_than(Y,Z) | -less_than(X,Y) | less_than(X,Z).
% 16 [] less_than(X,successor(X)).
% 17 [] equal(maximal_value,array_value_at(array,index_of_maximal)) | -in_array_bounds(array,index_of_maximal).
% 18 [] less_than(index_of_maximal,an_index).
% 19 [] -less_than(an_index,lower_bound).
% 20 [] -less_than(upper_bound,an_index).
% 21 [] -less_than(index_of_maximal,lower_bound).
% 22 [] -equal(maximal_value,array_value_at(array,index_of_maximal)) | less_than(successor(upper_bound),successor(an_index)) | -less_than(index_of_maximal,successor(an_index)) | less_than(successor(an_index),lower_bound) | -in_array_bounds(array,index_of_maximal) | -in_array_bounds(array,an_index) | less_than(index_of_maximal,lower_bound).
% 28 [hyper:15,16,18] less_than(index_of_maximal,successor(an_index)).
% 48 [hyper:22,13,13,cut:28,binarycut:17,cut:19,cut:20,cut:21] less_than(successor(upper_bound),successor(an_index)) | less_than(successor(an_index),lower_bound) | less_than(upper_bound,index_of_maximal).
% 75 [hyper:14,48,cut:20] less_than(successor(an_index),lower_bound) | less_than(upper_bound,index_of_maximal).
% 83 [hyper:15,75,16,cut:19] less_than(upper_bound,index_of_maximal).
% 89 [hyper:15,83,18,cut:20] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 13
% clause depth limited to 2
% seconds given: 12
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 19
% derived clauses: 137
% kept clauses: 17
% kept size sum: 130
% kept mid-nuclei: 37
% kept new demods: 1
% forw unit-subs: 29
% forw double-subs: 22
% forw overdouble-subs: 16
% backward subs: 7
% fast unit cutoff: 21
% full unit cutoff: 0
% dbl unit cutoff: 4
% real runtime : 0.1
% process. runtime: 0.1
% specific non-discr-tree subsumption statistics:
% tried: 39
% length fails: 1
% strength fails: 4
% predlist fails: 1
% aux str. fails: 0
% by-lit fails: 6
% full subs tried: 23
% full subs fail: 8
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/SWV/SWV019-1+eq_r.in")
%
%------------------------------------------------------------------------------