%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWV008-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n004.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:08 EDT 2022
% Result : Unsatisfiable 0.74s 1.11s
% Output : Refutation 0.74s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV008-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : bliksem %s
% 0.14/0.34 % Computer : n004.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % DateTime : Tue Jun 14 21:31:09 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.74/1.11 *** allocated 10000 integers for termspace/termends
% 0.74/1.11 *** allocated 10000 integers for clauses
% 0.74/1.11 *** allocated 10000 integers for justifications
% 0.74/1.11 Bliksem 1.12
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11 Automatic Strategy Selection
% 0.74/1.11
% 0.74/1.11 Clauses:
% 0.74/1.11 [
% 0.74/1.11 [ =( predecessor( successor( X ) ), X ) ],
% 0.74/1.11 [ =( successor( predecessor( X ) ), X ) ],
% 0.74/1.11 [ =( X, Y ), ~( =( predecessor( X ), predecessor( Y ) ) ) ],
% 0.74/1.11 [ =( X, Y ), ~( =( successor( X ), successor( Y ) ) ) ],
% 0.74/1.11 [ 'less_than'( predecessor( X ), X ) ],
% 0.74/1.11 [ 'less_than'( X, successor( X ) ) ],
% 0.74/1.11 [ 'less_than'( X, Y ), ~( 'less_than'( X, Z ) ), ~( 'less_than'( Z, Y )
% 0.74/1.11 ) ],
% 0.74/1.11 [ 'less_than'( X, Y ), 'less_than'( Y, X ), =( X, Y ) ],
% 0.74/1.11 [ ~( 'less_than'( X, X ) ) ],
% 0.74/1.11 [ ~( 'less_than'( X, Y ) ), ~( 'less_than'( Y, X ) ) ],
% 0.74/1.11 [ 'less_than'( X, Y ), ~( =( Z, X ) ), ~( 'less_than'( Z, Y ) ) ],
% 0.74/1.11 [ 'less_than'( X, Y ), ~( =( Z, Y ) ), ~( 'less_than'( X, Z ) ) ],
% 0.74/1.11 [ ~( 'less_than'( n, l ) ) ],
% 0.74/1.11 [ 'less_than'( one, l ) ],
% 0.74/1.11 [ 'less_than'( a( l ), a( predecessor( l ) ) ) ],
% 0.74/1.11 [ 'less_than'( X, n ), 'less_than'( n, X ), ~( 'less_than'( one, n ) ),
% 0.74/1.11 ~( 'less_than'( a( X ), a( predecessor( n ) ) ) ) ],
% 0.74/1.11 [ ~( 'less_than'( one, X ) ), ~( 'less_than'( X, n ) ), ~( 'less_than'(
% 0.74/1.11 a( X ), a( predecessor( X ) ) ) ) ]
% 0.74/1.11 ] .
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11 percentage equality = 0.272727, percentage horn = 0.882353
% 0.74/1.11 This is a problem with some equality
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11 Options Used:
% 0.74/1.11
% 0.74/1.11 useres = 1
% 0.74/1.11 useparamod = 1
% 0.74/1.11 useeqrefl = 1
% 0.74/1.11 useeqfact = 1
% 0.74/1.11 usefactor = 1
% 0.74/1.11 usesimpsplitting = 0
% 0.74/1.11 usesimpdemod = 5
% 0.74/1.11 usesimpres = 3
% 0.74/1.11
% 0.74/1.11 resimpinuse = 1000
% 0.74/1.11 resimpclauses = 20000
% 0.74/1.11 substype = eqrewr
% 0.74/1.11 backwardsubs = 1
% 0.74/1.11 selectoldest = 5
% 0.74/1.11
% 0.74/1.11 litorderings [0] = split
% 0.74/1.11 litorderings [1] = extend the termordering, first sorting on arguments
% 0.74/1.11
% 0.74/1.11 termordering = kbo
% 0.74/1.11
% 0.74/1.11 litapriori = 0
% 0.74/1.11 termapriori = 1
% 0.74/1.11 litaposteriori = 0
% 0.74/1.11 termaposteriori = 0
% 0.74/1.11 demodaposteriori = 0
% 0.74/1.11 ordereqreflfact = 0
% 0.74/1.11
% 0.74/1.11 litselect = negord
% 0.74/1.11
% 0.74/1.11 maxweight = 15
% 0.74/1.11 maxdepth = 30000
% 0.74/1.11 maxlength = 115
% 0.74/1.11 maxnrvars = 195
% 0.74/1.11 excuselevel = 1
% 0.74/1.11 increasemaxweight = 1
% 0.74/1.11
% 0.74/1.11 maxselected = 10000000
% 0.74/1.11 maxnrclauses = 10000000
% 0.74/1.11
% 0.74/1.11 showgenerated = 0
% 0.74/1.11 showkept = 0
% 0.74/1.11 showselected = 0
% 0.74/1.11 showdeleted = 0
% 0.74/1.11 showresimp = 1
% 0.74/1.11 showstatus = 2000
% 0.74/1.11
% 0.74/1.11 prologoutput = 1
% 0.74/1.11 nrgoals = 5000000
% 0.74/1.11 totalproof = 1
% 0.74/1.11
% 0.74/1.11 Symbols occurring in the translation:
% 0.74/1.11
% 0.74/1.11 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.74/1.11 . [1, 2] (w:1, o:23, a:1, s:1, b:0),
% 0.74/1.11 ! [4, 1] (w:0, o:15, a:1, s:1, b:0),
% 0.74/1.11 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.74/1.11 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.74/1.11 successor [40, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.74/1.11 predecessor [41, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.74/1.11 'less_than' [43, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.74/1.11 n [45, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.74/1.11 l [46, 0] (w:1, o:14, a:1, s:1, b:0),
% 0.74/1.11 one [47, 0] (w:1, o:7, a:1, s:1, b:0),
% 0.74/1.11 a [48, 1] (w:1, o:22, a:1, s:1, b:0).
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11 Starting Search:
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11 Bliksems!, er is een bewijs:
% 0.74/1.11 % SZS status Unsatisfiable
% 0.74/1.11 % SZS output start Refutation
% 0.74/1.11
% 0.74/1.11 clause( 7, [ 'less_than'( X, Y ), 'less_than'( Y, X ), =( X, Y ) ] )
% 0.74/1.11 .
% 0.74/1.11 clause( 8, [ ~( 'less_than'( X, X ) ) ] )
% 0.74/1.11 .
% 0.74/1.11 clause( 12, [ ~( 'less_than'( n, l ) ) ] )
% 0.74/1.11 .
% 0.74/1.11 clause( 13, [ 'less_than'( one, l ) ] )
% 0.74/1.11 .
% 0.74/1.11 clause( 14, [ 'less_than'( a( l ), a( predecessor( l ) ) ) ] )
% 0.74/1.11 .
% 0.74/1.11 clause( 15, [ 'less_than'( X, n ), 'less_than'( n, X ), ~( 'less_than'( one
% 0.74/1.11 , n ) ), ~( 'less_than'( a( X ), a( predecessor( n ) ) ) ) ] )
% 0.74/1.11 .
% 0.74/1.11 clause( 16, [ ~( 'less_than'( one, X ) ), ~( 'less_than'( X, n ) ), ~(
% 0.74/1.11 'less_than'( a( X ), a( predecessor( X ) ) ) ) ] )
% 0.74/1.11 .
% 0.74/1.11 clause( 17, [ ~( 'less_than'( one, n ) ), ~( 'less_than'( a( n ), a(
% 0.74/1.11 predecessor( n ) ) ) ) ] )
% 0.74/1.11 .
% 0.74/1.11 clause( 428, [ ~( 'less_than'( l, n ) ) ] )
% 0.74/1.11 .
% 0.74/1.11 clause( 451, [ =( l, n ) ] )
% 0.74/1.11 .
% 0.74/1.11 clause( 465, [ 'less_than'( a( n ), a( predecessor( n ) ) ) ] )
% 0.74/1.11 .
% 0.74/1.11 clause( 467, [ 'less_than'( one, n ) ] )
% 0.74/1.11 .
% 0.74/1.11 clause( 478, [] )
% 0.74/1.11 .
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11 % SZS output end Refutation
% 0.74/1.11 found a proof!
% 0.74/1.11
% 0.74/1.11 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.74/1.11
% 0.74/1.11 initialclauses(
% 0.74/1.11 [ clause( 480, [ =( predecessor( successor( X ) ), X ) ] )
% 0.74/1.11 , clause( 481, [ =( successor( predecessor( X ) ), X ) ] )
% 0.74/1.11 , clause( 482, [ =( X, Y ), ~( =( predecessor( X ), predecessor( Y ) ) ) ]
% 0.74/1.11 )
% 0.74/1.11 , clause( 483, [ =( X, Y ), ~( =( successor( X ), successor( Y ) ) ) ] )
% 0.74/1.11 , clause( 484, [ 'less_than'( predecessor( X ), X ) ] )
% 0.74/1.11 , clause( 485, [ 'less_than'( X, successor( X ) ) ] )
% 0.74/1.11 , clause( 486, [ 'less_than'( X, Y ), ~( 'less_than'( X, Z ) ), ~(
% 0.74/1.11 'less_than'( Z, Y ) ) ] )
% 0.74/1.11 , clause( 487, [ 'less_than'( X, Y ), 'less_than'( Y, X ), =( X, Y ) ] )
% 0.74/1.11 , clause( 488, [ ~( 'less_than'( X, X ) ) ] )
% 0.74/1.11 , clause( 489, [ ~( 'less_than'( X, Y ) ), ~( 'less_than'( Y, X ) ) ] )
% 0.74/1.11 , clause( 490, [ 'less_than'( X, Y ), ~( =( Z, X ) ), ~( 'less_than'( Z, Y
% 0.74/1.11 ) ) ] )
% 0.74/1.11 , clause( 491, [ 'less_than'( X, Y ), ~( =( Z, Y ) ), ~( 'less_than'( X, Z
% 0.74/1.11 ) ) ] )
% 0.74/1.11 , clause( 492, [ ~( 'less_than'( n, l ) ) ] )
% 0.74/1.11 , clause( 493, [ 'less_than'( one, l ) ] )
% 0.74/1.11 , clause( 494, [ 'less_than'( a( l ), a( predecessor( l ) ) ) ] )
% 0.74/1.11 , clause( 495, [ 'less_than'( X, n ), 'less_than'( n, X ), ~( 'less_than'(
% 0.74/1.11 one, n ) ), ~( 'less_than'( a( X ), a( predecessor( n ) ) ) ) ] )
% 0.74/1.11 , clause( 496, [ ~( 'less_than'( one, X ) ), ~( 'less_than'( X, n ) ), ~(
% 0.74/1.11 'less_than'( a( X ), a( predecessor( X ) ) ) ) ] )
% 0.74/1.11 ] ).
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11 subsumption(
% 0.74/1.11 clause( 7, [ 'less_than'( X, Y ), 'less_than'( Y, X ), =( X, Y ) ] )
% 0.74/1.11 , clause( 487, [ 'less_than'( X, Y ), 'less_than'( Y, X ), =( X, Y ) ] )
% 0.74/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.11 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11 subsumption(
% 0.74/1.11 clause( 8, [ ~( 'less_than'( X, X ) ) ] )
% 0.74/1.11 , clause( 488, [ ~( 'less_than'( X, X ) ) ] )
% 0.74/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11 subsumption(
% 0.74/1.11 clause( 12, [ ~( 'less_than'( n, l ) ) ] )
% 0.74/1.11 , clause( 492, [ ~( 'less_than'( n, l ) ) ] )
% 0.74/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11 subsumption(
% 0.74/1.11 clause( 13, [ 'less_than'( one, l ) ] )
% 0.74/1.11 , clause( 493, [ 'less_than'( one, l ) ] )
% 0.74/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11 subsumption(
% 0.74/1.11 clause( 14, [ 'less_than'( a( l ), a( predecessor( l ) ) ) ] )
% 0.74/1.11 , clause( 494, [ 'less_than'( a( l ), a( predecessor( l ) ) ) ] )
% 0.74/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11 subsumption(
% 0.74/1.11 clause( 15, [ 'less_than'( X, n ), 'less_than'( n, X ), ~( 'less_than'( one
% 0.74/1.11 , n ) ), ~( 'less_than'( a( X ), a( predecessor( n ) ) ) ) ] )
% 0.74/1.11 , clause( 495, [ 'less_than'( X, n ), 'less_than'( n, X ), ~( 'less_than'(
% 0.74/1.11 one, n ) ), ~( 'less_than'( a( X ), a( predecessor( n ) ) ) ) ] )
% 0.74/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.74/1.11 1 ), ==>( 2, 2 ), ==>( 3, 3 )] ) ).
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11 subsumption(
% 0.74/1.11 clause( 16, [ ~( 'less_than'( one, X ) ), ~( 'less_than'( X, n ) ), ~(
% 0.74/1.11 'less_than'( a( X ), a( predecessor( X ) ) ) ) ] )
% 0.74/1.11 , clause( 496, [ ~( 'less_than'( one, X ) ), ~( 'less_than'( X, n ) ), ~(
% 0.74/1.11 'less_than'( a( X ), a( predecessor( X ) ) ) ) ] )
% 0.74/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.74/1.11 1 ), ==>( 2, 2 )] ) ).
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11 factor(
% 0.74/1.11 clause( 556, [ 'less_than'( n, n ), ~( 'less_than'( one, n ) ), ~(
% 0.74/1.11 'less_than'( a( n ), a( predecessor( n ) ) ) ) ] )
% 0.74/1.11 , clause( 15, [ 'less_than'( X, n ), 'less_than'( n, X ), ~( 'less_than'(
% 0.74/1.11 one, n ) ), ~( 'less_than'( a( X ), a( predecessor( n ) ) ) ) ] )
% 0.74/1.11 , 0, 1, substitution( 0, [ :=( X, n )] )).
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11 resolution(
% 0.74/1.11 clause( 557, [ ~( 'less_than'( one, n ) ), ~( 'less_than'( a( n ), a(
% 0.74/1.11 predecessor( n ) ) ) ) ] )
% 0.74/1.11 , clause( 8, [ ~( 'less_than'( X, X ) ) ] )
% 0.74/1.11 , 0, clause( 556, [ 'less_than'( n, n ), ~( 'less_than'( one, n ) ), ~(
% 0.74/1.11 'less_than'( a( n ), a( predecessor( n ) ) ) ) ] )
% 0.74/1.11 , 0, substitution( 0, [ :=( X, n )] ), substitution( 1, [] )).
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11 subsumption(
% 0.74/1.11 clause( 17, [ ~( 'less_than'( one, n ) ), ~( 'less_than'( a( n ), a(
% 0.74/1.11 predecessor( n ) ) ) ) ] )
% 0.74/1.11 , clause( 557, [ ~( 'less_than'( one, n ) ), ~( 'less_than'( a( n ), a(
% 0.74/1.11 predecessor( n ) ) ) ) ] )
% 0.74/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] )
% 0.74/1.11 ).
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11 resolution(
% 0.74/1.11 clause( 558, [ ~( 'less_than'( one, l ) ), ~( 'less_than'( l, n ) ) ] )
% 0.74/1.11 , clause( 16, [ ~( 'less_than'( one, X ) ), ~( 'less_than'( X, n ) ), ~(
% 0.74/1.11 'less_than'( a( X ), a( predecessor( X ) ) ) ) ] )
% 0.74/1.11 , 2, clause( 14, [ 'less_than'( a( l ), a( predecessor( l ) ) ) ] )
% 0.74/1.11 , 0, substitution( 0, [ :=( X, l )] ), substitution( 1, [] )).
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11 resolution(
% 0.74/1.11 clause( 559, [ ~( 'less_than'( l, n ) ) ] )
% 0.74/1.11 , clause( 558, [ ~( 'less_than'( one, l ) ), ~( 'less_than'( l, n ) ) ] )
% 0.74/1.11 , 0, clause( 13, [ 'less_than'( one, l ) ] )
% 0.74/1.11 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11 subsumption(
% 0.74/1.11 clause( 428, [ ~( 'less_than'( l, n ) ) ] )
% 0.74/1.11 , clause( 559, [ ~( 'less_than'( l, n ) ) ] )
% 0.74/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11 resolution(
% 0.74/1.11 clause( 560, [ 'less_than'( n, l ), =( l, n ) ] )
% 0.74/1.11 , clause( 428, [ ~( 'less_than'( l, n ) ) ] )
% 0.74/1.11 , 0, clause( 7, [ 'less_than'( X, Y ), 'less_than'( Y, X ), =( X, Y ) ] )
% 0.74/1.11 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, l ), :=( Y, n )] )
% 0.74/1.11 ).
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11 resolution(
% 0.74/1.11 clause( 562, [ =( l, n ) ] )
% 0.74/1.11 , clause( 12, [ ~( 'less_than'( n, l ) ) ] )
% 0.74/1.11 , 0, clause( 560, [ 'less_than'( n, l ), =( l, n ) ] )
% 0.74/1.11 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11 subsumption(
% 0.74/1.11 clause( 451, [ =( l, n ) ] )
% 0.74/1.11 , clause( 562, [ =( l, n ) ] )
% 0.74/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11 paramod(
% 0.74/1.11 clause( 566, [ 'less_than'( a( l ), a( predecessor( n ) ) ) ] )
% 0.74/1.11 , clause( 451, [ =( l, n ) ] )
% 0.74/1.11 , 0, clause( 14, [ 'less_than'( a( l ), a( predecessor( l ) ) ) ] )
% 0.74/1.11 , 0, 5, substitution( 0, [] ), substitution( 1, [] )).
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11 paramod(
% 0.74/1.11 clause( 567, [ 'less_than'( a( n ), a( predecessor( n ) ) ) ] )
% 0.74/1.11 , clause( 451, [ =( l, n ) ] )
% 0.74/1.11 , 0, clause( 566, [ 'less_than'( a( l ), a( predecessor( n ) ) ) ] )
% 0.74/1.11 , 0, 2, substitution( 0, [] ), substitution( 1, [] )).
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11 subsumption(
% 0.74/1.11 clause( 465, [ 'less_than'( a( n ), a( predecessor( n ) ) ) ] )
% 0.74/1.11 , clause( 567, [ 'less_than'( a( n ), a( predecessor( n ) ) ) ] )
% 0.74/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11 paramod(
% 0.74/1.11 clause( 569, [ 'less_than'( one, n ) ] )
% 0.74/1.11 , clause( 451, [ =( l, n ) ] )
% 0.74/1.11 , 0, clause( 13, [ 'less_than'( one, l ) ] )
% 0.74/1.11 , 0, 2, substitution( 0, [] ), substitution( 1, [] )).
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11 subsumption(
% 0.74/1.11 clause( 467, [ 'less_than'( one, n ) ] )
% 0.74/1.11 , clause( 569, [ 'less_than'( one, n ) ] )
% 0.74/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11 resolution(
% 0.74/1.11 clause( 570, [ ~( 'less_than'( a( n ), a( predecessor( n ) ) ) ) ] )
% 0.74/1.11 , clause( 17, [ ~( 'less_than'( one, n ) ), ~( 'less_than'( a( n ), a(
% 0.74/1.11 predecessor( n ) ) ) ) ] )
% 0.74/1.11 , 0, clause( 467, [ 'less_than'( one, n ) ] )
% 0.74/1.11 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11 resolution(
% 0.74/1.11 clause( 571, [] )
% 0.74/1.11 , clause( 570, [ ~( 'less_than'( a( n ), a( predecessor( n ) ) ) ) ] )
% 0.74/1.11 , 0, clause( 465, [ 'less_than'( a( n ), a( predecessor( n ) ) ) ] )
% 0.74/1.11 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11 subsumption(
% 0.74/1.11 clause( 478, [] )
% 0.74/1.11 , clause( 571, [] )
% 0.74/1.11 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11 end.
% 0.74/1.11
% 0.74/1.11 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.74/1.11
% 0.74/1.11 Memory use:
% 0.74/1.11
% 0.74/1.11 space for terms: 6041
% 0.74/1.11 space for clauses: 22746
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11 clauses generated: 1658
% 0.74/1.11 clauses kept: 479
% 0.74/1.11 clauses selected: 50
% 0.74/1.11 clauses deleted: 1
% 0.74/1.11 clauses inuse deleted: 0
% 0.74/1.11
% 0.74/1.11 subsentry: 9794
% 0.74/1.11 literals s-matched: 7874
% 0.74/1.11 literals matched: 7874
% 0.74/1.11 full subsumption: 5860
% 0.74/1.11
% 0.74/1.11 checksum: -880753436
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11 Bliksem ended
%------------------------------------------------------------------------------