TSTP Solution File: SWV019-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWV019-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n017.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 : 0s
% DateTime : Wed Jul 20 16:22:12 EDT 2022
% Result : Unsatisfiable 0.43s 1.07s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWV019-1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.13 % Command : bliksem %s
% 0.12/0.34 % Computer : n017.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 % DateTime : Tue Jun 14 21:47:54 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.43/1.07 *** allocated 10000 integers for termspace/termends
% 0.43/1.07 *** allocated 10000 integers for clauses
% 0.43/1.07 *** allocated 10000 integers for justifications
% 0.43/1.07 Bliksem 1.12
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 Automatic Strategy Selection
% 0.43/1.07
% 0.43/1.07 Clauses:
% 0.43/1.07 [
% 0.43/1.07 [ 'less_than'( X, 'lower_bound' ), 'less_than'( 'upper_bound', X ),
% 0.43/1.07 'in_array_bounds'( array, X ) ],
% 0.43/1.07 [ ~( 'less_than'( successor( X ), successor( Y ) ) ), 'less_than'( X, Y
% 0.43/1.07 ) ],
% 0.43/1.07 [ ~( 'less_than'( X, Y ) ), ~( 'less_than'( Y, Z ) ), 'less_than'( X, Z
% 0.43/1.07 ) ],
% 0.43/1.07 [ 'less_than'( X, successor( X ) ) ],
% 0.43/1.07 [ ~( 'in_array_bounds'( array, 'index_of_maximal' ) ), =(
% 0.43/1.07 'maximal_value', 'array_value_at'( array, 'index_of_maximal' ) ) ],
% 0.43/1.07 [ 'less_than'( 'index_of_maximal', 'an_index' ) ],
% 0.43/1.07 [ ~( 'less_than'( 'an_index', 'lower_bound' ) ) ],
% 0.43/1.07 [ ~( 'less_than'( 'upper_bound', 'an_index' ) ) ],
% 0.43/1.07 [ ~( 'less_than'( 'index_of_maximal', 'lower_bound' ) ) ],
% 0.43/1.07 [ ~( 'in_array_bounds'( array, 'an_index' ) ), 'less_than'( successor(
% 0.43/1.07 'an_index' ), 'lower_bound' ), 'less_than'( successor( 'upper_bound' ),
% 0.43/1.07 successor( 'an_index' ) ), 'less_than'( 'index_of_maximal', 'lower_bound'
% 0.43/1.07 ), ~( 'less_than'( 'index_of_maximal', successor( 'an_index' ) ) ), ~(
% 0.43/1.07 'in_array_bounds'( array, 'index_of_maximal' ) ), ~( =( 'maximal_value',
% 0.43/1.07 'array_value_at'( array, 'index_of_maximal' ) ) ) ]
% 0.43/1.07 ] .
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 percentage equality = 0.090909, percentage horn = 0.800000
% 0.43/1.07 This is a problem with some equality
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 Options Used:
% 0.43/1.07
% 0.43/1.07 useres = 1
% 0.43/1.07 useparamod = 1
% 0.43/1.07 useeqrefl = 1
% 0.43/1.07 useeqfact = 1
% 0.43/1.07 usefactor = 1
% 0.43/1.07 usesimpsplitting = 0
% 0.43/1.07 usesimpdemod = 5
% 0.43/1.07 usesimpres = 3
% 0.43/1.07
% 0.43/1.07 resimpinuse = 1000
% 0.43/1.07 resimpclauses = 20000
% 0.43/1.07 substype = eqrewr
% 0.43/1.07 backwardsubs = 1
% 0.43/1.07 selectoldest = 5
% 0.43/1.07
% 0.43/1.07 litorderings [0] = split
% 0.43/1.07 litorderings [1] = extend the termordering, first sorting on arguments
% 0.43/1.07
% 0.43/1.07 termordering = kbo
% 0.43/1.07
% 0.43/1.07 litapriori = 0
% 0.43/1.07 termapriori = 1
% 0.43/1.07 litaposteriori = 0
% 0.43/1.07 termaposteriori = 0
% 0.43/1.07 demodaposteriori = 0
% 0.43/1.07 ordereqreflfact = 0
% 0.43/1.07
% 0.43/1.07 litselect = negord
% 0.43/1.07
% 0.43/1.07 maxweight = 15
% 0.43/1.07 maxdepth = 30000
% 0.43/1.07 maxlength = 115
% 0.43/1.07 maxnrvars = 195
% 0.43/1.07 excuselevel = 1
% 0.43/1.07 increasemaxweight = 1
% 0.43/1.07
% 0.43/1.07 maxselected = 10000000
% 0.43/1.07 maxnrclauses = 10000000
% 0.43/1.07
% 0.43/1.07 showgenerated = 0
% 0.43/1.07 showkept = 0
% 0.43/1.07 showselected = 0
% 0.43/1.07 showdeleted = 0
% 0.43/1.07 showresimp = 1
% 0.43/1.07 showstatus = 2000
% 0.43/1.07
% 0.43/1.07 prologoutput = 1
% 0.43/1.07 nrgoals = 5000000
% 0.43/1.07 totalproof = 1
% 0.43/1.07
% 0.43/1.07 Symbols occurring in the translation:
% 0.43/1.07
% 0.43/1.07 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.43/1.07 . [1, 2] (w:1, o:25, a:1, s:1, b:0),
% 0.43/1.07 ! [4, 1] (w:0, o:19, a:1, s:1, b:0),
% 0.43/1.07 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.43/1.07 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.43/1.07 'lower_bound' [40, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.43/1.07 'less_than' [41, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.43/1.07 'upper_bound' [42, 0] (w:1, o:11, a:1, s:1, b:0),
% 0.43/1.07 array [43, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.43/1.07 'in_array_bounds' [44, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.43/1.07 successor [46, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.43/1.07 'index_of_maximal' [49, 0] (w:1, o:16, a:1, s:1, b:0),
% 0.43/1.07 'maximal_value' [50, 0] (w:1, o:17, a:1, s:1, b:0),
% 0.43/1.07 'array_value_at' [51, 2] (w:1, o:52, a:1, s:1, b:0),
% 0.43/1.07 'an_index' [52, 0] (w:1, o:18, a:1, s:1, b:0).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 Starting Search:
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 Bliksems!, er is een bewijs:
% 0.43/1.07 % SZS status Unsatisfiable
% 0.43/1.07 % SZS output start Refutation
% 0.43/1.07
% 0.43/1.07 clause( 0, [ 'less_than'( X, 'lower_bound' ), 'less_than'( 'upper_bound', X
% 0.43/1.07 ), 'in_array_bounds'( array, X ) ] )
% 0.43/1.07 .
% 0.43/1.07 clause( 1, [ ~( 'less_than'( successor( X ), successor( Y ) ) ),
% 0.43/1.07 'less_than'( X, Y ) ] )
% 0.43/1.07 .
% 0.43/1.07 clause( 2, [ ~( 'less_than'( X, Y ) ), ~( 'less_than'( Y, Z ) ),
% 0.43/1.07 'less_than'( X, Z ) ] )
% 0.43/1.07 .
% 0.43/1.07 clause( 3, [ 'less_than'( X, successor( X ) ) ] )
% 0.43/1.07 .
% 0.43/1.07 clause( 4, [ ~( 'in_array_bounds'( array, 'index_of_maximal' ) ), =(
% 0.43/1.07 'array_value_at'( array, 'index_of_maximal' ), 'maximal_value' ) ] )
% 0.43/1.07 .
% 0.43/1.07 clause( 5, [ 'less_than'( 'index_of_maximal', 'an_index' ) ] )
% 0.43/1.07 .
% 0.43/1.07 clause( 6, [ ~( 'less_than'( 'an_index', 'lower_bound' ) ) ] )
% 0.43/1.07 .
% 0.43/1.07 clause( 7, [ ~( 'less_than'( 'upper_bound', 'an_index' ) ) ] )
% 0.43/1.07 .
% 0.43/1.07 clause( 8, [ ~( 'less_than'( 'index_of_maximal', 'lower_bound' ) ) ] )
% 0.43/1.07 .
% 0.43/1.07 clause( 9, [ ~( 'in_array_bounds'( array, 'an_index' ) ), 'less_than'(
% 0.43/1.07 successor( 'an_index' ), 'lower_bound' ), 'less_than'( successor(
% 0.43/1.07 'upper_bound' ), successor( 'an_index' ) ), ~( 'less_than'(
% 0.43/1.07 'index_of_maximal', successor( 'an_index' ) ) ), ~( 'in_array_bounds'(
% 0.43/1.07 array, 'index_of_maximal' ) ) ] )
% 0.43/1.07 .
% 0.43/1.07 clause( 10, [ 'in_array_bounds'( array, 'an_index' ) ] )
% 0.43/1.07 .
% 0.43/1.07 clause( 11, [ 'less_than'( 'upper_bound', 'index_of_maximal' ),
% 0.43/1.07 'in_array_bounds'( array, 'index_of_maximal' ) ] )
% 0.43/1.07 .
% 0.43/1.07 clause( 14, [ ~( 'less_than'( successor( 'upper_bound' ), successor(
% 0.43/1.07 'an_index' ) ) ) ] )
% 0.43/1.07 .
% 0.43/1.07 clause( 30, [ ~( 'less_than'( 'an_index', X ) ), 'less_than'(
% 0.43/1.07 'index_of_maximal', X ) ] )
% 0.43/1.07 .
% 0.43/1.07 clause( 31, [ ~( 'less_than'( X, 'index_of_maximal' ) ), 'less_than'( X,
% 0.43/1.07 'an_index' ) ] )
% 0.43/1.07 .
% 0.43/1.07 clause( 34, [ ~( 'less_than'( 'index_of_maximal', X ) ), ~( 'less_than'( X
% 0.43/1.07 , 'lower_bound' ) ) ] )
% 0.43/1.07 .
% 0.43/1.07 clause( 49, [ 'less_than'( 'index_of_maximal', successor( 'an_index' ) ) ]
% 0.43/1.07 )
% 0.43/1.07 .
% 0.43/1.07 clause( 57, [ 'in_array_bounds'( array, 'index_of_maximal' ) ] )
% 0.43/1.07 .
% 0.43/1.07 clause( 60, [] )
% 0.43/1.07 .
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 % SZS output end Refutation
% 0.43/1.07 found a proof!
% 0.43/1.07
% 0.43/1.07 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.43/1.07
% 0.43/1.07 initialclauses(
% 0.43/1.07 [ clause( 62, [ 'less_than'( X, 'lower_bound' ), 'less_than'( 'upper_bound'
% 0.43/1.07 , X ), 'in_array_bounds'( array, X ) ] )
% 0.43/1.07 , clause( 63, [ ~( 'less_than'( successor( X ), successor( Y ) ) ),
% 0.43/1.07 'less_than'( X, Y ) ] )
% 0.43/1.07 , clause( 64, [ ~( 'less_than'( X, Y ) ), ~( 'less_than'( Y, Z ) ),
% 0.43/1.07 'less_than'( X, Z ) ] )
% 0.43/1.07 , clause( 65, [ 'less_than'( X, successor( X ) ) ] )
% 0.43/1.07 , clause( 66, [ ~( 'in_array_bounds'( array, 'index_of_maximal' ) ), =(
% 0.43/1.07 'maximal_value', 'array_value_at'( array, 'index_of_maximal' ) ) ] )
% 0.43/1.07 , clause( 67, [ 'less_than'( 'index_of_maximal', 'an_index' ) ] )
% 0.43/1.07 , clause( 68, [ ~( 'less_than'( 'an_index', 'lower_bound' ) ) ] )
% 0.43/1.07 , clause( 69, [ ~( 'less_than'( 'upper_bound', 'an_index' ) ) ] )
% 0.43/1.07 , clause( 70, [ ~( 'less_than'( 'index_of_maximal', 'lower_bound' ) ) ] )
% 0.43/1.07 , clause( 71, [ ~( 'in_array_bounds'( array, 'an_index' ) ), 'less_than'(
% 0.43/1.07 successor( 'an_index' ), 'lower_bound' ), 'less_than'( successor(
% 0.43/1.07 'upper_bound' ), successor( 'an_index' ) ), 'less_than'(
% 0.43/1.07 'index_of_maximal', 'lower_bound' ), ~( 'less_than'( 'index_of_maximal',
% 0.43/1.07 successor( 'an_index' ) ) ), ~( 'in_array_bounds'( array,
% 0.43/1.07 'index_of_maximal' ) ), ~( =( 'maximal_value', 'array_value_at'( array,
% 0.43/1.07 'index_of_maximal' ) ) ) ] )
% 0.43/1.07 ] ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 0, [ 'less_than'( X, 'lower_bound' ), 'less_than'( 'upper_bound', X
% 0.43/1.07 ), 'in_array_bounds'( array, X ) ] )
% 0.43/1.07 , clause( 62, [ 'less_than'( X, 'lower_bound' ), 'less_than'( 'upper_bound'
% 0.43/1.07 , X ), 'in_array_bounds'( array, X ) ] )
% 0.43/1.07 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.43/1.07 1 ), ==>( 2, 2 )] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 1, [ ~( 'less_than'( successor( X ), successor( Y ) ) ),
% 0.43/1.07 'less_than'( X, Y ) ] )
% 0.43/1.07 , clause( 63, [ ~( 'less_than'( successor( X ), successor( Y ) ) ),
% 0.43/1.07 'less_than'( X, Y ) ] )
% 0.43/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.43/1.07 ), ==>( 1, 1 )] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 2, [ ~( 'less_than'( X, Y ) ), ~( 'less_than'( Y, Z ) ),
% 0.43/1.07 'less_than'( X, Z ) ] )
% 0.43/1.07 , clause( 64, [ ~( 'less_than'( X, Y ) ), ~( 'less_than'( Y, Z ) ),
% 0.43/1.07 'less_than'( X, Z ) ] )
% 0.43/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.43/1.07 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 3, [ 'less_than'( X, successor( X ) ) ] )
% 0.43/1.07 , clause( 65, [ 'less_than'( X, successor( X ) ) ] )
% 0.43/1.07 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 eqswap(
% 0.43/1.07 clause( 75, [ =( 'array_value_at'( array, 'index_of_maximal' ),
% 0.43/1.07 'maximal_value' ), ~( 'in_array_bounds'( array, 'index_of_maximal' ) ) ]
% 0.43/1.07 )
% 0.43/1.07 , clause( 66, [ ~( 'in_array_bounds'( array, 'index_of_maximal' ) ), =(
% 0.43/1.07 'maximal_value', 'array_value_at'( array, 'index_of_maximal' ) ) ] )
% 0.43/1.07 , 1, substitution( 0, [] )).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 4, [ ~( 'in_array_bounds'( array, 'index_of_maximal' ) ), =(
% 0.43/1.07 'array_value_at'( array, 'index_of_maximal' ), 'maximal_value' ) ] )
% 0.43/1.07 , clause( 75, [ =( 'array_value_at'( array, 'index_of_maximal' ),
% 0.43/1.07 'maximal_value' ), ~( 'in_array_bounds'( array, 'index_of_maximal' ) ) ]
% 0.43/1.07 )
% 0.43/1.07 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] )
% 0.43/1.07 ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 5, [ 'less_than'( 'index_of_maximal', 'an_index' ) ] )
% 0.43/1.07 , clause( 67, [ 'less_than'( 'index_of_maximal', 'an_index' ) ] )
% 0.43/1.07 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 6, [ ~( 'less_than'( 'an_index', 'lower_bound' ) ) ] )
% 0.43/1.07 , clause( 68, [ ~( 'less_than'( 'an_index', 'lower_bound' ) ) ] )
% 0.43/1.07 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 7, [ ~( 'less_than'( 'upper_bound', 'an_index' ) ) ] )
% 0.43/1.07 , clause( 69, [ ~( 'less_than'( 'upper_bound', 'an_index' ) ) ] )
% 0.43/1.07 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 8, [ ~( 'less_than'( 'index_of_maximal', 'lower_bound' ) ) ] )
% 0.43/1.07 , clause( 70, [ ~( 'less_than'( 'index_of_maximal', 'lower_bound' ) ) ] )
% 0.43/1.07 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 paramod(
% 0.43/1.07 clause( 101, [ ~( =( 'maximal_value', 'maximal_value' ) ), ~(
% 0.43/1.07 'in_array_bounds'( array, 'index_of_maximal' ) ), ~( 'in_array_bounds'(
% 0.43/1.07 array, 'an_index' ) ), 'less_than'( successor( 'an_index' ),
% 0.43/1.07 'lower_bound' ), 'less_than'( successor( 'upper_bound' ), successor(
% 0.43/1.07 'an_index' ) ), 'less_than'( 'index_of_maximal', 'lower_bound' ), ~(
% 0.43/1.07 'less_than'( 'index_of_maximal', successor( 'an_index' ) ) ), ~(
% 0.43/1.07 'in_array_bounds'( array, 'index_of_maximal' ) ) ] )
% 0.43/1.07 , clause( 4, [ ~( 'in_array_bounds'( array, 'index_of_maximal' ) ), =(
% 0.43/1.07 'array_value_at'( array, 'index_of_maximal' ), 'maximal_value' ) ] )
% 0.43/1.07 , 1, clause( 71, [ ~( 'in_array_bounds'( array, 'an_index' ) ), 'less_than'(
% 0.43/1.07 successor( 'an_index' ), 'lower_bound' ), 'less_than'( successor(
% 0.43/1.07 'upper_bound' ), successor( 'an_index' ) ), 'less_than'(
% 0.43/1.07 'index_of_maximal', 'lower_bound' ), ~( 'less_than'( 'index_of_maximal',
% 0.43/1.07 successor( 'an_index' ) ) ), ~( 'in_array_bounds'( array,
% 0.43/1.07 'index_of_maximal' ) ), ~( =( 'maximal_value', 'array_value_at'( array,
% 0.43/1.07 'index_of_maximal' ) ) ) ] )
% 0.43/1.07 , 6, 3, substitution( 0, [] ), substitution( 1, [] )).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 factor(
% 0.43/1.07 clause( 102, [ ~( =( 'maximal_value', 'maximal_value' ) ), ~(
% 0.43/1.07 'in_array_bounds'( array, 'index_of_maximal' ) ), ~( 'in_array_bounds'(
% 0.43/1.07 array, 'an_index' ) ), 'less_than'( successor( 'an_index' ),
% 0.43/1.07 'lower_bound' ), 'less_than'( successor( 'upper_bound' ), successor(
% 0.43/1.07 'an_index' ) ), 'less_than'( 'index_of_maximal', 'lower_bound' ), ~(
% 0.43/1.07 'less_than'( 'index_of_maximal', successor( 'an_index' ) ) ) ] )
% 0.43/1.07 , clause( 101, [ ~( =( 'maximal_value', 'maximal_value' ) ), ~(
% 0.43/1.07 'in_array_bounds'( array, 'index_of_maximal' ) ), ~( 'in_array_bounds'(
% 0.43/1.07 array, 'an_index' ) ), 'less_than'( successor( 'an_index' ),
% 0.43/1.07 'lower_bound' ), 'less_than'( successor( 'upper_bound' ), successor(
% 0.43/1.07 'an_index' ) ), 'less_than'( 'index_of_maximal', 'lower_bound' ), ~(
% 0.43/1.07 'less_than'( 'index_of_maximal', successor( 'an_index' ) ) ), ~(
% 0.43/1.07 'in_array_bounds'( array, 'index_of_maximal' ) ) ] )
% 0.43/1.07 , 1, 7, substitution( 0, [] )).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 eqrefl(
% 0.43/1.07 clause( 103, [ ~( 'in_array_bounds'( array, 'index_of_maximal' ) ), ~(
% 0.43/1.07 'in_array_bounds'( array, 'an_index' ) ), 'less_than'( successor(
% 0.43/1.07 'an_index' ), 'lower_bound' ), 'less_than'( successor( 'upper_bound' ),
% 0.43/1.07 successor( 'an_index' ) ), 'less_than'( 'index_of_maximal', 'lower_bound'
% 0.43/1.07 ), ~( 'less_than'( 'index_of_maximal', successor( 'an_index' ) ) ) ] )
% 0.43/1.07 , clause( 102, [ ~( =( 'maximal_value', 'maximal_value' ) ), ~(
% 0.43/1.07 'in_array_bounds'( array, 'index_of_maximal' ) ), ~( 'in_array_bounds'(
% 0.43/1.07 array, 'an_index' ) ), 'less_than'( successor( 'an_index' ),
% 0.43/1.07 'lower_bound' ), 'less_than'( successor( 'upper_bound' ), successor(
% 0.43/1.07 'an_index' ) ), 'less_than'( 'index_of_maximal', 'lower_bound' ), ~(
% 0.43/1.07 'less_than'( 'index_of_maximal', successor( 'an_index' ) ) ) ] )
% 0.43/1.07 , 0, substitution( 0, [] )).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 resolution(
% 0.43/1.07 clause( 104, [ ~( 'in_array_bounds'( array, 'index_of_maximal' ) ), ~(
% 0.43/1.07 'in_array_bounds'( array, 'an_index' ) ), 'less_than'( successor(
% 0.43/1.07 'an_index' ), 'lower_bound' ), 'less_than'( successor( 'upper_bound' ),
% 0.43/1.07 successor( 'an_index' ) ), ~( 'less_than'( 'index_of_maximal', successor(
% 0.43/1.07 'an_index' ) ) ) ] )
% 0.43/1.07 , clause( 8, [ ~( 'less_than'( 'index_of_maximal', 'lower_bound' ) ) ] )
% 0.43/1.07 , 0, clause( 103, [ ~( 'in_array_bounds'( array, 'index_of_maximal' ) ),
% 0.43/1.07 ~( 'in_array_bounds'( array, 'an_index' ) ), 'less_than'( successor(
% 0.43/1.07 'an_index' ), 'lower_bound' ), 'less_than'( successor( 'upper_bound' ),
% 0.43/1.07 successor( 'an_index' ) ), 'less_than'( 'index_of_maximal', 'lower_bound'
% 0.43/1.07 ), ~( 'less_than'( 'index_of_maximal', successor( 'an_index' ) ) ) ] )
% 0.43/1.07 , 4, substitution( 0, [] ), substitution( 1, [] )).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 9, [ ~( 'in_array_bounds'( array, 'an_index' ) ), 'less_than'(
% 0.43/1.07 successor( 'an_index' ), 'lower_bound' ), 'less_than'( successor(
% 0.43/1.07 'upper_bound' ), successor( 'an_index' ) ), ~( 'less_than'(
% 0.43/1.07 'index_of_maximal', successor( 'an_index' ) ) ), ~( 'in_array_bounds'(
% 0.43/1.07 array, 'index_of_maximal' ) ) ] )
% 0.43/1.07 , clause( 104, [ ~( 'in_array_bounds'( array, 'index_of_maximal' ) ), ~(
% 0.43/1.07 'in_array_bounds'( array, 'an_index' ) ), 'less_than'( successor(
% 0.43/1.07 'an_index' ), 'lower_bound' ), 'less_than'( successor( 'upper_bound' ),
% 0.43/1.07 successor( 'an_index' ) ), ~( 'less_than'( 'index_of_maximal', successor(
% 0.43/1.07 'an_index' ) ) ) ] )
% 0.43/1.07 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 4 ), ==>( 1, 0 ), ==>( 2
% 0.43/1.07 , 1 ), ==>( 3, 2 ), ==>( 4, 3 )] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 resolution(
% 0.43/1.07 clause( 105, [ 'less_than'( 'upper_bound', 'an_index' ), 'in_array_bounds'(
% 0.43/1.07 array, 'an_index' ) ] )
% 0.43/1.07 , clause( 6, [ ~( 'less_than'( 'an_index', 'lower_bound' ) ) ] )
% 0.43/1.07 , 0, clause( 0, [ 'less_than'( X, 'lower_bound' ), 'less_than'(
% 0.43/1.07 'upper_bound', X ), 'in_array_bounds'( array, X ) ] )
% 0.43/1.07 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, 'an_index' )] )).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 resolution(
% 0.43/1.07 clause( 106, [ 'in_array_bounds'( array, 'an_index' ) ] )
% 0.43/1.07 , clause( 7, [ ~( 'less_than'( 'upper_bound', 'an_index' ) ) ] )
% 0.43/1.07 , 0, clause( 105, [ 'less_than'( 'upper_bound', 'an_index' ),
% 0.43/1.07 'in_array_bounds'( array, 'an_index' ) ] )
% 0.43/1.07 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 10, [ 'in_array_bounds'( array, 'an_index' ) ] )
% 0.43/1.07 , clause( 106, [ 'in_array_bounds'( array, 'an_index' ) ] )
% 0.43/1.07 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 resolution(
% 0.43/1.07 clause( 107, [ 'less_than'( 'upper_bound', 'index_of_maximal' ),
% 0.43/1.07 'in_array_bounds'( array, 'index_of_maximal' ) ] )
% 0.43/1.07 , clause( 8, [ ~( 'less_than'( 'index_of_maximal', 'lower_bound' ) ) ] )
% 0.43/1.07 , 0, clause( 0, [ 'less_than'( X, 'lower_bound' ), 'less_than'(
% 0.43/1.07 'upper_bound', X ), 'in_array_bounds'( array, X ) ] )
% 0.43/1.07 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, 'index_of_maximal' )] )
% 0.43/1.07 ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 11, [ 'less_than'( 'upper_bound', 'index_of_maximal' ),
% 0.43/1.07 'in_array_bounds'( array, 'index_of_maximal' ) ] )
% 0.43/1.07 , clause( 107, [ 'less_than'( 'upper_bound', 'index_of_maximal' ),
% 0.43/1.07 'in_array_bounds'( array, 'index_of_maximal' ) ] )
% 0.43/1.07 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] )
% 0.43/1.07 ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 resolution(
% 0.43/1.07 clause( 108, [ ~( 'less_than'( successor( 'upper_bound' ), successor(
% 0.43/1.07 'an_index' ) ) ) ] )
% 0.43/1.07 , clause( 7, [ ~( 'less_than'( 'upper_bound', 'an_index' ) ) ] )
% 0.43/1.07 , 0, clause( 1, [ ~( 'less_than'( successor( X ), successor( Y ) ) ),
% 0.43/1.07 'less_than'( X, Y ) ] )
% 0.43/1.07 , 1, substitution( 0, [] ), substitution( 1, [ :=( X, 'upper_bound' ), :=(
% 0.43/1.07 Y, 'an_index' )] )).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 14, [ ~( 'less_than'( successor( 'upper_bound' ), successor(
% 0.43/1.07 'an_index' ) ) ) ] )
% 0.43/1.07 , clause( 108, [ ~( 'less_than'( successor( 'upper_bound' ), successor(
% 0.43/1.07 'an_index' ) ) ) ] )
% 0.43/1.07 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 resolution(
% 0.43/1.07 clause( 109, [ ~( 'less_than'( 'an_index', X ) ), 'less_than'(
% 0.43/1.07 'index_of_maximal', X ) ] )
% 0.43/1.07 , clause( 2, [ ~( 'less_than'( X, Y ) ), ~( 'less_than'( Y, Z ) ),
% 0.43/1.07 'less_than'( X, Z ) ] )
% 0.43/1.07 , 0, clause( 5, [ 'less_than'( 'index_of_maximal', 'an_index' ) ] )
% 0.43/1.07 , 0, substitution( 0, [ :=( X, 'index_of_maximal' ), :=( Y, 'an_index' ),
% 0.43/1.07 :=( Z, X )] ), substitution( 1, [] )).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 30, [ ~( 'less_than'( 'an_index', X ) ), 'less_than'(
% 0.43/1.07 'index_of_maximal', X ) ] )
% 0.43/1.07 , clause( 109, [ ~( 'less_than'( 'an_index', X ) ), 'less_than'(
% 0.43/1.07 'index_of_maximal', X ) ] )
% 0.43/1.07 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.43/1.07 1 )] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 resolution(
% 0.43/1.07 clause( 112, [ ~( 'less_than'( X, 'index_of_maximal' ) ), 'less_than'( X,
% 0.43/1.07 'an_index' ) ] )
% 0.43/1.07 , clause( 2, [ ~( 'less_than'( X, Y ) ), ~( 'less_than'( Y, Z ) ),
% 0.43/1.07 'less_than'( X, Z ) ] )
% 0.43/1.07 , 1, clause( 5, [ 'less_than'( 'index_of_maximal', 'an_index' ) ] )
% 0.43/1.07 , 0, substitution( 0, [ :=( X, X ), :=( Y, 'index_of_maximal' ), :=( Z,
% 0.43/1.07 'an_index' )] ), substitution( 1, [] )).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 31, [ ~( 'less_than'( X, 'index_of_maximal' ) ), 'less_than'( X,
% 0.43/1.07 'an_index' ) ] )
% 0.43/1.07 , clause( 112, [ ~( 'less_than'( X, 'index_of_maximal' ) ), 'less_than'( X
% 0.43/1.07 , 'an_index' ) ] )
% 0.43/1.07 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.43/1.07 1 )] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 resolution(
% 0.43/1.07 clause( 113, [ ~( 'less_than'( 'index_of_maximal', X ) ), ~( 'less_than'( X
% 0.43/1.07 , 'lower_bound' ) ) ] )
% 0.43/1.07 , clause( 8, [ ~( 'less_than'( 'index_of_maximal', 'lower_bound' ) ) ] )
% 0.43/1.07 , 0, clause( 2, [ ~( 'less_than'( X, Y ) ), ~( 'less_than'( Y, Z ) ),
% 0.43/1.07 'less_than'( X, Z ) ] )
% 0.43/1.07 , 2, substitution( 0, [] ), substitution( 1, [ :=( X, 'index_of_maximal' )
% 0.43/1.07 , :=( Y, X ), :=( Z, 'lower_bound' )] )).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 34, [ ~( 'less_than'( 'index_of_maximal', X ) ), ~( 'less_than'( X
% 0.43/1.07 , 'lower_bound' ) ) ] )
% 0.43/1.07 , clause( 113, [ ~( 'less_than'( 'index_of_maximal', X ) ), ~( 'less_than'(
% 0.43/1.07 X, 'lower_bound' ) ) ] )
% 0.43/1.07 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.43/1.07 1 )] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 resolution(
% 0.43/1.07 clause( 114, [ 'less_than'( 'index_of_maximal', successor( 'an_index' ) ) ]
% 0.43/1.07 )
% 0.43/1.07 , clause( 30, [ ~( 'less_than'( 'an_index', X ) ), 'less_than'(
% 0.43/1.07 'index_of_maximal', X ) ] )
% 0.43/1.07 , 0, clause( 3, [ 'less_than'( X, successor( X ) ) ] )
% 0.43/1.07 , 0, substitution( 0, [ :=( X, successor( 'an_index' ) )] ), substitution(
% 0.43/1.07 1, [ :=( X, 'an_index' )] )).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 49, [ 'less_than'( 'index_of_maximal', successor( 'an_index' ) ) ]
% 0.43/1.07 )
% 0.43/1.07 , clause( 114, [ 'less_than'( 'index_of_maximal', successor( 'an_index' ) )
% 0.43/1.07 ] )
% 0.43/1.07 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 resolution(
% 0.43/1.07 clause( 115, [ 'less_than'( 'upper_bound', 'an_index' ), 'in_array_bounds'(
% 0.43/1.07 array, 'index_of_maximal' ) ] )
% 0.43/1.07 , clause( 31, [ ~( 'less_than'( X, 'index_of_maximal' ) ), 'less_than'( X,
% 0.43/1.07 'an_index' ) ] )
% 0.43/1.07 , 0, clause( 11, [ 'less_than'( 'upper_bound', 'index_of_maximal' ),
% 0.43/1.07 'in_array_bounds'( array, 'index_of_maximal' ) ] )
% 0.43/1.07 , 0, substitution( 0, [ :=( X, 'upper_bound' )] ), substitution( 1, [] )
% 0.43/1.07 ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 resolution(
% 0.43/1.07 clause( 116, [ 'in_array_bounds'( array, 'index_of_maximal' ) ] )
% 0.43/1.07 , clause( 7, [ ~( 'less_than'( 'upper_bound', 'an_index' ) ) ] )
% 0.43/1.07 , 0, clause( 115, [ 'less_than'( 'upper_bound', 'an_index' ),
% 0.43/1.07 'in_array_bounds'( array, 'index_of_maximal' ) ] )
% 0.43/1.07 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 57, [ 'in_array_bounds'( array, 'index_of_maximal' ) ] )
% 0.43/1.07 , clause( 116, [ 'in_array_bounds'( array, 'index_of_maximal' ) ] )
% 0.43/1.07 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 resolution(
% 0.43/1.07 clause( 117, [ 'less_than'( successor( 'an_index' ), 'lower_bound' ),
% 0.43/1.07 'less_than'( successor( 'upper_bound' ), successor( 'an_index' ) ), ~(
% 0.43/1.07 'less_than'( 'index_of_maximal', successor( 'an_index' ) ) ), ~(
% 0.43/1.07 'in_array_bounds'( array, 'index_of_maximal' ) ) ] )
% 0.43/1.07 , clause( 9, [ ~( 'in_array_bounds'( array, 'an_index' ) ), 'less_than'(
% 0.43/1.07 successor( 'an_index' ), 'lower_bound' ), 'less_than'( successor(
% 0.43/1.07 'upper_bound' ), successor( 'an_index' ) ), ~( 'less_than'(
% 0.43/1.07 'index_of_maximal', successor( 'an_index' ) ) ), ~( 'in_array_bounds'(
% 0.43/1.07 array, 'index_of_maximal' ) ) ] )
% 0.43/1.07 , 0, clause( 10, [ 'in_array_bounds'( array, 'an_index' ) ] )
% 0.43/1.07 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 resolution(
% 0.43/1.07 clause( 118, [ ~( 'less_than'( 'index_of_maximal', successor( 'an_index' )
% 0.43/1.07 ) ), 'less_than'( successor( 'upper_bound' ), successor( 'an_index' ) )
% 0.43/1.07 , ~( 'less_than'( 'index_of_maximal', successor( 'an_index' ) ) ), ~(
% 0.43/1.07 'in_array_bounds'( array, 'index_of_maximal' ) ) ] )
% 0.43/1.07 , clause( 34, [ ~( 'less_than'( 'index_of_maximal', X ) ), ~( 'less_than'(
% 0.43/1.07 X, 'lower_bound' ) ) ] )
% 0.43/1.07 , 1, clause( 117, [ 'less_than'( successor( 'an_index' ), 'lower_bound' ),
% 0.43/1.07 'less_than'( successor( 'upper_bound' ), successor( 'an_index' ) ), ~(
% 0.43/1.07 'less_than'( 'index_of_maximal', successor( 'an_index' ) ) ), ~(
% 0.43/1.07 'in_array_bounds'( array, 'index_of_maximal' ) ) ] )
% 0.43/1.07 , 0, substitution( 0, [ :=( X, successor( 'an_index' ) )] ), substitution(
% 0.43/1.07 1, [] )).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 factor(
% 0.43/1.07 clause( 119, [ ~( 'less_than'( 'index_of_maximal', successor( 'an_index' )
% 0.43/1.07 ) ), 'less_than'( successor( 'upper_bound' ), successor( 'an_index' ) )
% 0.43/1.07 , ~( 'in_array_bounds'( array, 'index_of_maximal' ) ) ] )
% 0.43/1.07 , clause( 118, [ ~( 'less_than'( 'index_of_maximal', successor( 'an_index'
% 0.43/1.07 ) ) ), 'less_than'( successor( 'upper_bound' ), successor( 'an_index' )
% 0.43/1.07 ), ~( 'less_than'( 'index_of_maximal', successor( 'an_index' ) ) ), ~(
% 0.43/1.07 'in_array_bounds'( array, 'index_of_maximal' ) ) ] )
% 0.43/1.07 , 0, 2, substitution( 0, [] )).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 resolution(
% 0.43/1.07 clause( 120, [ ~( 'less_than'( 'index_of_maximal', successor( 'an_index' )
% 0.43/1.07 ) ), ~( 'in_array_bounds'( array, 'index_of_maximal' ) ) ] )
% 0.43/1.07 , clause( 14, [ ~( 'less_than'( successor( 'upper_bound' ), successor(
% 0.43/1.07 'an_index' ) ) ) ] )
% 0.43/1.07 , 0, clause( 119, [ ~( 'less_than'( 'index_of_maximal', successor(
% 0.43/1.07 'an_index' ) ) ), 'less_than'( successor( 'upper_bound' ), successor(
% 0.43/1.07 'an_index' ) ), ~( 'in_array_bounds'( array, 'index_of_maximal' ) ) ] )
% 0.43/1.07 , 1, substitution( 0, [] ), substitution( 1, [] )).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 resolution(
% 0.43/1.07 clause( 121, [ ~( 'in_array_bounds'( array, 'index_of_maximal' ) ) ] )
% 0.43/1.07 , clause( 120, [ ~( 'less_than'( 'index_of_maximal', successor( 'an_index'
% 0.43/1.07 ) ) ), ~( 'in_array_bounds'( array, 'index_of_maximal' ) ) ] )
% 0.43/1.07 , 0, clause( 49, [ 'less_than'( 'index_of_maximal', successor( 'an_index' )
% 0.43/1.07 ) ] )
% 0.43/1.07 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 resolution(
% 0.43/1.07 clause( 122, [] )
% 0.43/1.07 , clause( 121, [ ~( 'in_array_bounds'( array, 'index_of_maximal' ) ) ] )
% 0.43/1.07 , 0, clause( 57, [ 'in_array_bounds'( array, 'index_of_maximal' ) ] )
% 0.43/1.07 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 60, [] )
% 0.43/1.07 , clause( 122, [] )
% 0.43/1.07 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 end.
% 0.43/1.07
% 0.43/1.07 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.43/1.07
% 0.43/1.07 Memory use:
% 0.43/1.07
% 0.43/1.07 space for terms: 812
% 0.43/1.07 space for clauses: 3102
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 clauses generated: 89
% 0.43/1.07 clauses kept: 61
% 0.43/1.07 clauses selected: 20
% 0.43/1.07 clauses deleted: 1
% 0.43/1.07 clauses inuse deleted: 0
% 0.43/1.07
% 0.43/1.07 subsentry: 219
% 0.43/1.07 literals s-matched: 111
% 0.43/1.07 literals matched: 111
% 0.43/1.07 full subsumption: 39
% 0.43/1.07
% 0.43/1.07 checksum: 2081764859
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 Bliksem ended
%------------------------------------------------------------------------------