%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : NUM022-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n007.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 : Mon Jul 18 06:19:20 EDT 2022
% Result : Unsatisfiable 0.71s 1.10s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM022-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : bliksem %s
% 0.14/0.34 % Computer : n007.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 Jul 5 23:52:43 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.71/1.10 *** allocated 10000 integers for termspace/termends
% 0.71/1.10 *** allocated 10000 integers for clauses
% 0.71/1.10 *** allocated 10000 integers for justifications
% 0.71/1.10 Bliksem 1.12
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Automatic Strategy Selection
% 0.71/1.10
% 0.71/1.10 Clauses:
% 0.71/1.10 [
% 0.71/1.10 [ ~( less( X, Y ) ), ~( less( Z, X ) ), less( Z, Y ) ],
% 0.71/1.10 [ ~( equalish( add( successor( X ), Y ), Z ) ), less( Y, Z ) ],
% 0.71/1.10 [ ~( less( X, Y ) ), equalish( add( successor(
% 0.71/1.10 'predecessor_of_1st_minus_2nd'( Y, X ) ), X ), Y ) ],
% 0.71/1.10 [ ~( divides( X, Y ) ), less( X, Y ), equalish( X, Y ) ],
% 0.71/1.10 [ ~( less( X, Y ) ), divides( X, Y ) ],
% 0.71/1.10 [ ~( equalish( X, Y ) ), divides( X, Y ) ],
% 0.71/1.10 [ ~( equalish( X, Y ) ), ~( equalish( Z, X ) ), equalish( Z, Y ) ],
% 0.71/1.10 [ less( a, b ) ],
% 0.71/1.10 [ divides( b, d ) ],
% 0.71/1.10 [ ~( less( a, d ) ) ]
% 0.71/1.10 ] .
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 percentage equality = 0.000000, percentage horn = 0.900000
% 0.71/1.10 This is a near-Horn, non-equality problem
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Options Used:
% 0.71/1.10
% 0.71/1.10 useres = 1
% 0.71/1.10 useparamod = 0
% 0.71/1.10 useeqrefl = 0
% 0.71/1.10 useeqfact = 0
% 0.71/1.10 usefactor = 1
% 0.71/1.10 usesimpsplitting = 0
% 0.71/1.10 usesimpdemod = 0
% 0.71/1.10 usesimpres = 4
% 0.71/1.10
% 0.71/1.10 resimpinuse = 1000
% 0.71/1.10 resimpclauses = 20000
% 0.71/1.10 substype = standard
% 0.71/1.10 backwardsubs = 1
% 0.71/1.10 selectoldest = 5
% 0.71/1.10
% 0.71/1.10 litorderings [0] = split
% 0.71/1.10 litorderings [1] = liftord
% 0.71/1.10
% 0.71/1.10 termordering = none
% 0.71/1.10
% 0.71/1.10 litapriori = 1
% 0.71/1.10 termapriori = 0
% 0.71/1.10 litaposteriori = 0
% 0.71/1.10 termaposteriori = 0
% 0.71/1.10 demodaposteriori = 0
% 0.71/1.10 ordereqreflfact = 0
% 0.71/1.10
% 0.71/1.10 litselect = negative
% 0.71/1.10
% 0.71/1.10 maxweight = 30000
% 0.71/1.10 maxdepth = 30000
% 0.71/1.10 maxlength = 115
% 0.71/1.10 maxnrvars = 195
% 0.71/1.10 excuselevel = 0
% 0.71/1.10 increasemaxweight = 0
% 0.71/1.10
% 0.71/1.10 maxselected = 10000000
% 0.71/1.10 maxnrclauses = 10000000
% 0.71/1.10
% 0.71/1.10 showgenerated = 0
% 0.71/1.10 showkept = 0
% 0.71/1.10 showselected = 0
% 0.71/1.10 showdeleted = 0
% 0.71/1.10 showresimp = 1
% 0.71/1.10 showstatus = 2000
% 0.71/1.10
% 0.71/1.10 prologoutput = 1
% 0.71/1.10 nrgoals = 5000000
% 0.71/1.10 totalproof = 1
% 0.71/1.10
% 0.71/1.10 Symbols occurring in the translation:
% 0.71/1.10
% 0.71/1.10 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.71/1.10 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.71/1.10 ! [4, 1] (w:1, o:15, a:1, s:1, b:0),
% 0.71/1.10 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.10 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.10 less [41, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.71/1.10 successor [43, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.71/1.10 add [44, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.71/1.10 equalish [45, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.71/1.10 'predecessor_of_1st_minus_2nd' [46, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.71/1.10 divides [47, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.71/1.10 a [48, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.71/1.10 b [49, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.71/1.10 d [50, 0] (w:1, o:14, a:1, s:1, b:0).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Starting Search:
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Bliksems!, er is een bewijs:
% 0.71/1.10 % SZS status Unsatisfiable
% 0.71/1.10 % SZS output start Refutation
% 0.71/1.10
% 0.71/1.10 clause( 0, [ ~( less( X, Y ) ), less( Z, Y ), ~( less( Z, X ) ) ] )
% 0.71/1.10 .
% 0.71/1.10 clause( 1, [ less( Y, Z ), ~( equalish( add( successor( X ), Y ), Z ) ) ]
% 0.71/1.10 )
% 0.71/1.10 .
% 0.71/1.10 clause( 2, [ equalish( add( successor( 'predecessor_of_1st_minus_2nd'( Y, X
% 0.71/1.10 ) ), X ), Y ), ~( less( X, Y ) ) ] )
% 0.71/1.10 .
% 0.71/1.10 clause( 3, [ less( X, Y ), equalish( X, Y ), ~( divides( X, Y ) ) ] )
% 0.71/1.10 .
% 0.71/1.10 clause( 6, [ ~( equalish( X, Y ) ), equalish( Z, Y ), ~( equalish( Z, X ) )
% 0.71/1.10 ] )
% 0.71/1.10 .
% 0.71/1.10 clause( 7, [ less( a, b ) ] )
% 0.71/1.10 .
% 0.71/1.10 clause( 8, [ divides( b, d ) ] )
% 0.71/1.10 .
% 0.71/1.10 clause( 9, [ ~( less( a, d ) ) ] )
% 0.71/1.10 .
% 0.71/1.10 clause( 11, [ less( a, X ), ~( less( b, X ) ) ] )
% 0.71/1.10 .
% 0.71/1.10 clause( 12, [ less( b, d ), equalish( b, d ) ] )
% 0.71/1.10 .
% 0.71/1.10 clause( 14, [ equalish( add( successor( 'predecessor_of_1st_minus_2nd'( b,
% 0.71/1.10 a ) ), a ), b ) ] )
% 0.71/1.10 .
% 0.71/1.10 clause( 15, [ equalish( add( successor( 'predecessor_of_1st_minus_2nd'( b,
% 0.71/1.10 a ) ), a ), X ), ~( equalish( b, X ) ) ] )
% 0.71/1.10 .
% 0.71/1.10 clause( 17, [ less( b, d ), equalish( add( successor(
% 0.71/1.10 'predecessor_of_1st_minus_2nd'( b, a ) ), a ), d ) ] )
% 0.71/1.10 .
% 0.71/1.10 clause( 19, [ less( a, d ) ] )
% 0.71/1.10 .
% 0.71/1.10 clause( 21, [] )
% 0.71/1.10 .
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 % SZS output end Refutation
% 0.71/1.10 found a proof!
% 0.71/1.10
% 0.71/1.10 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.71/1.10
% 0.71/1.10 initialclauses(
% 0.71/1.10 [ clause( 23, [ ~( less( X, Y ) ), ~( less( Z, X ) ), less( Z, Y ) ] )
% 0.71/1.10 , clause( 24, [ ~( equalish( add( successor( X ), Y ), Z ) ), less( Y, Z )
% 0.71/1.10 ] )
% 0.71/1.10 , clause( 25, [ ~( less( X, Y ) ), equalish( add( successor(
% 0.71/1.10 'predecessor_of_1st_minus_2nd'( Y, X ) ), X ), Y ) ] )
% 0.71/1.10 , clause( 26, [ ~( divides( X, Y ) ), less( X, Y ), equalish( X, Y ) ] )
% 0.71/1.10 , clause( 27, [ ~( less( X, Y ) ), divides( X, Y ) ] )
% 0.71/1.10 , clause( 28, [ ~( equalish( X, Y ) ), divides( X, Y ) ] )
% 0.71/1.10 , clause( 29, [ ~( equalish( X, Y ) ), ~( equalish( Z, X ) ), equalish( Z,
% 0.71/1.10 Y ) ] )
% 0.71/1.10 , clause( 30, [ less( a, b ) ] )
% 0.71/1.10 , clause( 31, [ divides( b, d ) ] )
% 0.71/1.10 , clause( 32, [ ~( less( a, d ) ) ] )
% 0.71/1.10 ] ).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 subsumption(
% 0.71/1.10 clause( 0, [ ~( less( X, Y ) ), less( Z, Y ), ~( less( Z, X ) ) ] )
% 0.71/1.10 , clause( 23, [ ~( less( X, Y ) ), ~( less( Z, X ) ), less( Z, Y ) ] )
% 0.71/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.10 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 subsumption(
% 0.71/1.10 clause( 1, [ less( Y, Z ), ~( equalish( add( successor( X ), Y ), Z ) ) ]
% 0.71/1.10 )
% 0.71/1.10 , clause( 24, [ ~( equalish( add( successor( X ), Y ), Z ) ), less( Y, Z )
% 0.71/1.10 ] )
% 0.71/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.10 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 subsumption(
% 0.71/1.10 clause( 2, [ equalish( add( successor( 'predecessor_of_1st_minus_2nd'( Y, X
% 0.71/1.10 ) ), X ), Y ), ~( less( X, Y ) ) ] )
% 0.71/1.10 , clause( 25, [ ~( less( X, Y ) ), equalish( add( successor(
% 0.71/1.10 'predecessor_of_1st_minus_2nd'( Y, X ) ), X ), Y ) ] )
% 0.71/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.71/1.10 ), ==>( 1, 0 )] ) ).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 subsumption(
% 0.71/1.10 clause( 3, [ less( X, Y ), equalish( X, Y ), ~( divides( X, Y ) ) ] )
% 0.71/1.10 , clause( 26, [ ~( divides( X, Y ) ), less( X, Y ), equalish( X, Y ) ] )
% 0.71/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 2
% 0.71/1.10 ), ==>( 1, 0 ), ==>( 2, 1 )] ) ).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 subsumption(
% 0.71/1.10 clause( 6, [ ~( equalish( X, Y ) ), equalish( Z, Y ), ~( equalish( Z, X ) )
% 0.71/1.10 ] )
% 0.71/1.10 , clause( 29, [ ~( equalish( X, Y ) ), ~( equalish( Z, X ) ), equalish( Z,
% 0.71/1.10 Y ) ] )
% 0.71/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.10 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 subsumption(
% 0.71/1.10 clause( 7, [ less( a, b ) ] )
% 0.71/1.10 , clause( 30, [ less( a, b ) ] )
% 0.71/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 subsumption(
% 0.71/1.10 clause( 8, [ divides( b, d ) ] )
% 0.71/1.10 , clause( 31, [ divides( b, d ) ] )
% 0.71/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 subsumption(
% 0.71/1.10 clause( 9, [ ~( less( a, d ) ) ] )
% 0.71/1.10 , clause( 32, [ ~( less( a, d ) ) ] )
% 0.71/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 resolution(
% 0.71/1.10 clause( 46, [ ~( less( b, X ) ), less( a, X ) ] )
% 0.71/1.10 , clause( 0, [ ~( less( X, Y ) ), less( Z, Y ), ~( less( Z, X ) ) ] )
% 0.71/1.10 , 2, clause( 7, [ less( a, b ) ] )
% 0.71/1.10 , 0, substitution( 0, [ :=( X, b ), :=( Y, X ), :=( Z, a )] ),
% 0.71/1.10 substitution( 1, [] )).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 subsumption(
% 0.71/1.10 clause( 11, [ less( a, X ), ~( less( b, X ) ) ] )
% 0.71/1.10 , clause( 46, [ ~( less( b, X ) ), less( a, X ) ] )
% 0.71/1.10 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.71/1.10 0 )] ) ).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 resolution(
% 0.71/1.10 clause( 47, [ less( b, d ), equalish( b, d ) ] )
% 0.71/1.10 , clause( 3, [ less( X, Y ), equalish( X, Y ), ~( divides( X, Y ) ) ] )
% 0.71/1.10 , 2, clause( 8, [ divides( b, d ) ] )
% 0.71/1.10 , 0, substitution( 0, [ :=( X, b ), :=( Y, d )] ), substitution( 1, [] )
% 0.71/1.10 ).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 subsumption(
% 0.71/1.10 clause( 12, [ less( b, d ), equalish( b, d ) ] )
% 0.71/1.10 , clause( 47, [ less( b, d ), equalish( b, d ) ] )
% 0.71/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] )
% 0.71/1.10 ).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 resolution(
% 0.71/1.10 clause( 48, [ equalish( add( successor( 'predecessor_of_1st_minus_2nd'( b,
% 0.71/1.10 a ) ), a ), b ) ] )
% 0.71/1.10 , clause( 2, [ equalish( add( successor( 'predecessor_of_1st_minus_2nd'( Y
% 0.71/1.10 , X ) ), X ), Y ), ~( less( X, Y ) ) ] )
% 0.71/1.10 , 1, clause( 7, [ less( a, b ) ] )
% 0.71/1.10 , 0, substitution( 0, [ :=( X, a ), :=( Y, b )] ), substitution( 1, [] )
% 0.71/1.10 ).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 subsumption(
% 0.71/1.10 clause( 14, [ equalish( add( successor( 'predecessor_of_1st_minus_2nd'( b,
% 0.71/1.10 a ) ), a ), b ) ] )
% 0.71/1.10 , clause( 48, [ equalish( add( successor( 'predecessor_of_1st_minus_2nd'( b
% 0.71/1.10 , a ) ), a ), b ) ] )
% 0.71/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 resolution(
% 0.71/1.10 clause( 50, [ ~( equalish( b, X ) ), equalish( add( successor(
% 0.71/1.10 'predecessor_of_1st_minus_2nd'( b, a ) ), a ), X ) ] )
% 0.71/1.10 , clause( 6, [ ~( equalish( X, Y ) ), equalish( Z, Y ), ~( equalish( Z, X )
% 0.71/1.10 ) ] )
% 0.71/1.10 , 2, clause( 14, [ equalish( add( successor( 'predecessor_of_1st_minus_2nd'(
% 0.71/1.10 b, a ) ), a ), b ) ] )
% 0.71/1.10 , 0, substitution( 0, [ :=( X, b ), :=( Y, X ), :=( Z, add( successor(
% 0.71/1.10 'predecessor_of_1st_minus_2nd'( b, a ) ), a ) )] ), substitution( 1, [] )
% 0.71/1.10 ).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 subsumption(
% 0.71/1.10 clause( 15, [ equalish( add( successor( 'predecessor_of_1st_minus_2nd'( b,
% 0.71/1.10 a ) ), a ), X ), ~( equalish( b, X ) ) ] )
% 0.71/1.10 , clause( 50, [ ~( equalish( b, X ) ), equalish( add( successor(
% 0.71/1.10 'predecessor_of_1st_minus_2nd'( b, a ) ), a ), X ) ] )
% 0.71/1.10 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.71/1.10 0 )] ) ).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 resolution(
% 0.71/1.10 clause( 51, [ equalish( add( successor( 'predecessor_of_1st_minus_2nd'( b,
% 0.71/1.10 a ) ), a ), d ), less( b, d ) ] )
% 0.71/1.10 , clause( 15, [ equalish( add( successor( 'predecessor_of_1st_minus_2nd'( b
% 0.71/1.10 , a ) ), a ), X ), ~( equalish( b, X ) ) ] )
% 0.71/1.10 , 1, clause( 12, [ less( b, d ), equalish( b, d ) ] )
% 0.71/1.10 , 1, substitution( 0, [ :=( X, d )] ), substitution( 1, [] )).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 subsumption(
% 0.71/1.10 clause( 17, [ less( b, d ), equalish( add( successor(
% 0.71/1.10 'predecessor_of_1st_minus_2nd'( b, a ) ), a ), d ) ] )
% 0.71/1.10 , clause( 51, [ equalish( add( successor( 'predecessor_of_1st_minus_2nd'( b
% 0.71/1.10 , a ) ), a ), d ), less( b, d ) ] )
% 0.71/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] )
% 0.71/1.10 ).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 resolution(
% 0.71/1.10 clause( 52, [ less( a, d ), less( b, d ) ] )
% 0.71/1.10 , clause( 1, [ less( Y, Z ), ~( equalish( add( successor( X ), Y ), Z ) ) ]
% 0.71/1.10 )
% 0.71/1.10 , 1, clause( 17, [ less( b, d ), equalish( add( successor(
% 0.71/1.10 'predecessor_of_1st_minus_2nd'( b, a ) ), a ), d ) ] )
% 0.71/1.10 , 1, substitution( 0, [ :=( X, 'predecessor_of_1st_minus_2nd'( b, a ) ),
% 0.71/1.10 :=( Y, a ), :=( Z, d )] ), substitution( 1, [] )).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 resolution(
% 0.71/1.10 clause( 53, [ less( a, d ), less( a, d ) ] )
% 0.71/1.10 , clause( 11, [ less( a, X ), ~( less( b, X ) ) ] )
% 0.71/1.10 , 1, clause( 52, [ less( a, d ), less( b, d ) ] )
% 0.71/1.10 , 1, substitution( 0, [ :=( X, d )] ), substitution( 1, [] )).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 factor(
% 0.71/1.10 clause( 54, [ less( a, d ) ] )
% 0.71/1.10 , clause( 53, [ less( a, d ), less( a, d ) ] )
% 0.71/1.10 , 0, 1, substitution( 0, [] )).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 subsumption(
% 0.71/1.10 clause( 19, [ less( a, d ) ] )
% 0.71/1.10 , clause( 54, [ less( a, d ) ] )
% 0.71/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 resolution(
% 0.71/1.10 clause( 55, [] )
% 0.71/1.10 , clause( 9, [ ~( less( a, d ) ) ] )
% 0.71/1.10 , 0, clause( 19, [ less( a, d ) ] )
% 0.71/1.10 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 subsumption(
% 0.71/1.10 clause( 21, [] )
% 0.71/1.10 , clause( 55, [] )
% 0.71/1.10 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 end.
% 0.71/1.10
% 0.71/1.10 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.71/1.10
% 0.71/1.10 Memory use:
% 0.71/1.10
% 0.71/1.10 space for terms: 395
% 0.71/1.10 space for clauses: 1291
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 clauses generated: 28
% 0.71/1.10 clauses kept: 22
% 0.71/1.10 clauses selected: 18
% 0.71/1.10 clauses deleted: 1
% 0.71/1.10 clauses inuse deleted: 0
% 0.71/1.10
% 0.71/1.10 subsentry: 13
% 0.71/1.10 literals s-matched: 5
% 0.71/1.10 literals matched: 5
% 0.71/1.10 full subsumption: 0
% 0.71/1.10
% 0.71/1.10 checksum: 87951217
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Bliksem ended
%------------------------------------------------------------------------------