%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : NUM021-1 : TPTP v8.1.0. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n029.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:19 EDT 2022
% Result : Unsatisfiable 0.68s 1.09s
% Output : Refutation 0.68s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM021-1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.07/0.13 % Command : bliksem %s
% 0.14/0.34 % Computer : n029.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 20:13:27 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.68/1.08 *** allocated 10000 integers for termspace/termends
% 0.68/1.08 *** allocated 10000 integers for clauses
% 0.68/1.08 *** allocated 10000 integers for justifications
% 0.68/1.08 Bliksem 1.12
% 0.68/1.08
% 0.68/1.08
% 0.68/1.08 Automatic Strategy Selection
% 0.68/1.08
% 0.68/1.08 Clauses:
% 0.68/1.08 [
% 0.68/1.08 [ equalish( add( X, n0 ), X ) ],
% 0.68/1.08 [ equalish( add( X, successor( Y ) ), successor( add( X, Y ) ) ) ],
% 0.68/1.08 [ equalish( multiply( X, n0 ), n0 ) ],
% 0.68/1.08 [ equalish( multiply( X, successor( Y ) ), add( multiply( X, Y ), X ) )
% 0.68/1.08 ],
% 0.68/1.08 [ ~( equalish( successor( X ), successor( Y ) ) ), equalish( X, Y ) ]
% 0.68/1.08 ,
% 0.68/1.08 [ ~( equalish( X, Y ) ), equalish( successor( X ), successor( Y ) ) ]
% 0.68/1.08 ,
% 0.68/1.08 [ ~( less( X, Y ) ), ~( less( Z, X ) ), less( Z, Y ) ],
% 0.68/1.08 [ ~( equalish( add( successor( X ), Y ), Z ) ), less( Y, Z ) ],
% 0.68/1.08 [ ~( less( X, Y ) ), equalish( add( successor(
% 0.68/1.08 'predecessor_of_1st_minus_2nd'( Y, X ) ), X ), Y ) ],
% 0.68/1.08 [ ~( divides( X, Y ) ), less( X, Y ), equalish( X, Y ) ],
% 0.68/1.08 [ ~( less( X, Y ) ), divides( X, Y ) ],
% 0.68/1.08 [ ~( equalish( X, Y ) ), divides( X, Y ) ],
% 0.68/1.08 [ equalish( X, X ) ],
% 0.68/1.08 [ ~( equalish( X, Y ) ), equalish( Y, X ) ],
% 0.68/1.08 [ ~( equalish( X, Y ) ), ~( equalish( Y, Z ) ), equalish( X, Z ) ],
% 0.68/1.08 [ less( b, c ) ],
% 0.68/1.08 [ ~( less( b, a ) ) ],
% 0.68/1.08 [ divides( c, a ) ],
% 0.68/1.08 [ ~( equalish( successor( X ), n0 ) ) ]
% 0.68/1.08 ] .
% 0.68/1.08
% 0.68/1.08
% 0.68/1.08 percentage equality = 0.000000, percentage horn = 0.947368
% 0.68/1.08 This is a near-Horn, non-equality problem
% 0.68/1.08
% 0.68/1.08
% 0.68/1.08 Options Used:
% 0.68/1.08
% 0.68/1.08 useres = 1
% 0.68/1.08 useparamod = 0
% 0.68/1.08 useeqrefl = 0
% 0.68/1.08 useeqfact = 0
% 0.68/1.08 usefactor = 1
% 0.68/1.08 usesimpsplitting = 0
% 0.68/1.08 usesimpdemod = 0
% 0.68/1.08 usesimpres = 4
% 0.68/1.08
% 0.68/1.08 resimpinuse = 1000
% 0.68/1.08 resimpclauses = 20000
% 0.68/1.08 substype = standard
% 0.68/1.08 backwardsubs = 1
% 0.68/1.08 selectoldest = 5
% 0.68/1.08
% 0.68/1.08 litorderings [0] = split
% 0.68/1.08 litorderings [1] = liftord
% 0.68/1.08
% 0.68/1.08 termordering = none
% 0.68/1.08
% 0.68/1.08 litapriori = 1
% 0.68/1.08 termapriori = 0
% 0.68/1.08 litaposteriori = 0
% 0.68/1.08 termaposteriori = 0
% 0.68/1.08 demodaposteriori = 0
% 0.68/1.08 ordereqreflfact = 0
% 0.68/1.08
% 0.68/1.08 litselect = negative
% 0.68/1.08
% 0.68/1.08 maxweight = 30000
% 0.68/1.08 maxdepth = 30000
% 0.68/1.08 maxlength = 115
% 0.68/1.08 maxnrvars = 195
% 0.68/1.08 excuselevel = 0
% 0.68/1.08 increasemaxweight = 0
% 0.68/1.08
% 0.68/1.08 maxselected = 10000000
% 0.68/1.09 maxnrclauses = 10000000
% 0.68/1.09
% 0.68/1.09 showgenerated = 0
% 0.68/1.09 showkept = 0
% 0.68/1.09 showselected = 0
% 0.68/1.09 showdeleted = 0
% 0.68/1.09 showresimp = 1
% 0.68/1.09 showstatus = 2000
% 0.68/1.09
% 0.68/1.09 prologoutput = 1
% 0.68/1.09 nrgoals = 5000000
% 0.68/1.09 totalproof = 1
% 0.68/1.09
% 0.68/1.09 Symbols occurring in the translation:
% 0.68/1.09
% 0.68/1.09 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.68/1.09 . [1, 2] (w:1, o:25, a:1, s:1, b:0),
% 0.68/1.09 ! [4, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.68/1.09 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.68/1.09 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.68/1.09 n0 [40, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.68/1.09 add [41, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.68/1.09 equalish [42, 2] (w:1, o:52, a:1, s:1, b:0),
% 0.68/1.09 successor [44, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.68/1.09 multiply [45, 2] (w:1, o:54, a:1, s:1, b:0),
% 0.68/1.09 less [46, 2] (w:1, o:53, a:1, s:1, b:0),
% 0.68/1.09 'predecessor_of_1st_minus_2nd' [48, 2] (w:1, o:55, a:1, s:1, b:0),
% 0.68/1.09 divides [49, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.68/1.09 b [53, 0] (w:1, o:17, a:1, s:1, b:0),
% 0.68/1.09 c [54, 0] (w:1, o:18, a:1, s:1, b:0),
% 0.68/1.09 a [55, 0] (w:1, o:16, a:1, s:1, b:0).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 Starting Search:
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 Bliksems!, er is een bewijs:
% 0.68/1.09 % SZS status Unsatisfiable
% 0.68/1.09 % SZS output start Refutation
% 0.68/1.09
% 0.68/1.09 clause( 6, [ ~( less( X, Y ) ), less( Z, Y ), ~( less( Z, X ) ) ] )
% 0.68/1.09 .
% 0.68/1.09 clause( 7, [ less( Y, Z ), ~( equalish( add( successor( X ), Y ), Z ) ) ]
% 0.68/1.09 )
% 0.68/1.09 .
% 0.68/1.09 clause( 8, [ equalish( add( successor( 'predecessor_of_1st_minus_2nd'( Y, X
% 0.68/1.09 ) ), X ), Y ), ~( less( X, Y ) ) ] )
% 0.68/1.09 .
% 0.68/1.09 clause( 9, [ less( X, Y ), equalish( X, Y ), ~( divides( X, Y ) ) ] )
% 0.68/1.09 .
% 0.68/1.09 clause( 14, [ ~( equalish( X, Y ) ), equalish( X, Z ), ~( equalish( Y, Z )
% 0.68/1.09 ) ] )
% 0.68/1.09 .
% 0.68/1.09 clause( 15, [ less( b, c ) ] )
% 0.68/1.09 .
% 0.68/1.09 clause( 16, [ ~( less( b, a ) ) ] )
% 0.68/1.09 .
% 0.68/1.09 clause( 17, [ divides( c, a ) ] )
% 0.68/1.09 .
% 0.68/1.09 clause( 41, [ less( b, X ), ~( less( c, X ) ) ] )
% 0.68/1.09 .
% 0.68/1.09 clause( 55, [ equalish( add( successor( 'predecessor_of_1st_minus_2nd'( c,
% 0.68/1.09 b ) ), b ), c ) ] )
% 0.68/1.09 .
% 0.68/1.09 clause( 61, [ equalish( c, a ), less( c, a ) ] )
% 0.68/1.09 .
% 0.68/1.09 clause( 63, [ equalish( c, a ) ] )
% 0.68/1.09 .
% 0.68/1.09 clause( 69, [ equalish( X, a ), ~( equalish( X, c ) ) ] )
% 0.68/1.09 .
% 0.68/1.09 clause( 153, [ equalish( add( successor( 'predecessor_of_1st_minus_2nd'( c
% 0.68/1.09 , b ) ), b ), a ) ] )
% 0.68/1.09 .
% 0.68/1.09 clause( 162, [] )
% 0.68/1.09 .
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 % SZS output end Refutation
% 0.68/1.09 found a proof!
% 0.68/1.09
% 0.68/1.09 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.68/1.09
% 0.68/1.09 initialclauses(
% 0.68/1.09 [ clause( 164, [ equalish( add( X, n0 ), X ) ] )
% 0.68/1.09 , clause( 165, [ equalish( add( X, successor( Y ) ), successor( add( X, Y )
% 0.68/1.09 ) ) ] )
% 0.68/1.09 , clause( 166, [ equalish( multiply( X, n0 ), n0 ) ] )
% 0.68/1.09 , clause( 167, [ equalish( multiply( X, successor( Y ) ), add( multiply( X
% 0.68/1.09 , Y ), X ) ) ] )
% 0.68/1.09 , clause( 168, [ ~( equalish( successor( X ), successor( Y ) ) ), equalish(
% 0.68/1.09 X, Y ) ] )
% 0.68/1.09 , clause( 169, [ ~( equalish( X, Y ) ), equalish( successor( X ), successor(
% 0.68/1.09 Y ) ) ] )
% 0.68/1.09 , clause( 170, [ ~( less( X, Y ) ), ~( less( Z, X ) ), less( Z, Y ) ] )
% 0.68/1.09 , clause( 171, [ ~( equalish( add( successor( X ), Y ), Z ) ), less( Y, Z )
% 0.68/1.09 ] )
% 0.68/1.09 , clause( 172, [ ~( less( X, Y ) ), equalish( add( successor(
% 0.68/1.09 'predecessor_of_1st_minus_2nd'( Y, X ) ), X ), Y ) ] )
% 0.68/1.09 , clause( 173, [ ~( divides( X, Y ) ), less( X, Y ), equalish( X, Y ) ] )
% 0.68/1.09 , clause( 174, [ ~( less( X, Y ) ), divides( X, Y ) ] )
% 0.68/1.09 , clause( 175, [ ~( equalish( X, Y ) ), divides( X, Y ) ] )
% 0.68/1.09 , clause( 176, [ equalish( X, X ) ] )
% 0.68/1.09 , clause( 177, [ ~( equalish( X, Y ) ), equalish( Y, X ) ] )
% 0.68/1.09 , clause( 178, [ ~( equalish( X, Y ) ), ~( equalish( Y, Z ) ), equalish( X
% 0.68/1.09 , Z ) ] )
% 0.68/1.09 , clause( 179, [ less( b, c ) ] )
% 0.68/1.09 , clause( 180, [ ~( less( b, a ) ) ] )
% 0.68/1.09 , clause( 181, [ divides( c, a ) ] )
% 0.68/1.09 , clause( 182, [ ~( equalish( successor( X ), n0 ) ) ] )
% 0.68/1.09 ] ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 subsumption(
% 0.68/1.09 clause( 6, [ ~( less( X, Y ) ), less( Z, Y ), ~( less( Z, X ) ) ] )
% 0.68/1.09 , clause( 170, [ ~( less( X, Y ) ), ~( less( Z, X ) ), less( Z, Y ) ] )
% 0.68/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.68/1.09 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 subsumption(
% 0.68/1.09 clause( 7, [ less( Y, Z ), ~( equalish( add( successor( X ), Y ), Z ) ) ]
% 0.68/1.09 )
% 0.68/1.09 , clause( 171, [ ~( equalish( add( successor( X ), Y ), Z ) ), less( Y, Z )
% 0.68/1.09 ] )
% 0.68/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.68/1.09 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 subsumption(
% 0.68/1.09 clause( 8, [ equalish( add( successor( 'predecessor_of_1st_minus_2nd'( Y, X
% 0.68/1.09 ) ), X ), Y ), ~( less( X, Y ) ) ] )
% 0.68/1.09 , clause( 172, [ ~( less( X, Y ) ), equalish( add( successor(
% 0.68/1.09 'predecessor_of_1st_minus_2nd'( Y, X ) ), X ), Y ) ] )
% 0.68/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.68/1.09 ), ==>( 1, 0 )] ) ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 subsumption(
% 0.68/1.09 clause( 9, [ less( X, Y ), equalish( X, Y ), ~( divides( X, Y ) ) ] )
% 0.68/1.09 , clause( 173, [ ~( divides( X, Y ) ), less( X, Y ), equalish( X, Y ) ] )
% 0.68/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 2
% 0.68/1.09 ), ==>( 1, 0 ), ==>( 2, 1 )] ) ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 subsumption(
% 0.68/1.09 clause( 14, [ ~( equalish( X, Y ) ), equalish( X, Z ), ~( equalish( Y, Z )
% 0.68/1.09 ) ] )
% 0.68/1.09 , clause( 178, [ ~( equalish( X, Y ) ), ~( equalish( Y, Z ) ), equalish( X
% 0.68/1.09 , Z ) ] )
% 0.68/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.68/1.09 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 subsumption(
% 0.68/1.09 clause( 15, [ less( b, c ) ] )
% 0.68/1.09 , clause( 179, [ less( b, c ) ] )
% 0.68/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 subsumption(
% 0.68/1.09 clause( 16, [ ~( less( b, a ) ) ] )
% 0.68/1.09 , clause( 180, [ ~( less( b, a ) ) ] )
% 0.68/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 subsumption(
% 0.68/1.09 clause( 17, [ divides( c, a ) ] )
% 0.68/1.09 , clause( 181, [ divides( c, a ) ] )
% 0.68/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 resolution(
% 0.68/1.09 clause( 196, [ ~( less( c, X ) ), less( b, X ) ] )
% 0.68/1.09 , clause( 6, [ ~( less( X, Y ) ), less( Z, Y ), ~( less( Z, X ) ) ] )
% 0.68/1.09 , 2, clause( 15, [ less( b, c ) ] )
% 0.68/1.09 , 0, substitution( 0, [ :=( X, c ), :=( Y, X ), :=( Z, b )] ),
% 0.68/1.09 substitution( 1, [] )).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 subsumption(
% 0.68/1.09 clause( 41, [ less( b, X ), ~( less( c, X ) ) ] )
% 0.68/1.09 , clause( 196, [ ~( less( c, X ) ), less( b, X ) ] )
% 0.68/1.09 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.68/1.09 0 )] ) ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 resolution(
% 0.68/1.09 clause( 197, [ equalish( add( successor( 'predecessor_of_1st_minus_2nd'( c
% 0.68/1.09 , b ) ), b ), c ) ] )
% 0.68/1.09 , clause( 8, [ equalish( add( successor( 'predecessor_of_1st_minus_2nd'( Y
% 0.68/1.09 , X ) ), X ), Y ), ~( less( X, Y ) ) ] )
% 0.68/1.09 , 1, clause( 15, [ less( b, c ) ] )
% 0.68/1.09 , 0, substitution( 0, [ :=( X, b ), :=( Y, c )] ), substitution( 1, [] )
% 0.68/1.09 ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 subsumption(
% 0.68/1.09 clause( 55, [ equalish( add( successor( 'predecessor_of_1st_minus_2nd'( c,
% 0.68/1.09 b ) ), b ), c ) ] )
% 0.68/1.09 , clause( 197, [ equalish( add( successor( 'predecessor_of_1st_minus_2nd'(
% 0.68/1.09 c, b ) ), b ), c ) ] )
% 0.68/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 resolution(
% 0.68/1.09 clause( 198, [ less( c, a ), equalish( c, a ) ] )
% 0.68/1.09 , clause( 9, [ less( X, Y ), equalish( X, Y ), ~( divides( X, Y ) ) ] )
% 0.68/1.09 , 2, clause( 17, [ divides( c, a ) ] )
% 0.68/1.09 , 0, substitution( 0, [ :=( X, c ), :=( Y, a )] ), substitution( 1, [] )
% 0.68/1.09 ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 subsumption(
% 0.68/1.09 clause( 61, [ equalish( c, a ), less( c, a ) ] )
% 0.68/1.09 , clause( 198, [ less( c, a ), equalish( c, a ) ] )
% 0.68/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] )
% 0.68/1.09 ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 resolution(
% 0.68/1.09 clause( 199, [ less( b, a ), equalish( c, a ) ] )
% 0.68/1.09 , clause( 41, [ less( b, X ), ~( less( c, X ) ) ] )
% 0.68/1.09 , 1, clause( 61, [ equalish( c, a ), less( c, a ) ] )
% 0.68/1.09 , 1, substitution( 0, [ :=( X, a )] ), substitution( 1, [] )).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 resolution(
% 0.68/1.09 clause( 200, [ equalish( c, a ) ] )
% 0.68/1.09 , clause( 16, [ ~( less( b, a ) ) ] )
% 0.68/1.09 , 0, clause( 199, [ less( b, a ), equalish( c, a ) ] )
% 0.68/1.09 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 subsumption(
% 0.68/1.09 clause( 63, [ equalish( c, a ) ] )
% 0.68/1.09 , clause( 200, [ equalish( c, a ) ] )
% 0.68/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 resolution(
% 0.68/1.09 clause( 202, [ ~( equalish( X, c ) ), equalish( X, a ) ] )
% 0.68/1.09 , clause( 14, [ ~( equalish( X, Y ) ), equalish( X, Z ), ~( equalish( Y, Z
% 0.68/1.09 ) ) ] )
% 0.68/1.09 , 2, clause( 63, [ equalish( c, a ) ] )
% 0.68/1.09 , 0, substitution( 0, [ :=( X, X ), :=( Y, c ), :=( Z, a )] ),
% 0.68/1.09 substitution( 1, [] )).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 subsumption(
% 0.68/1.09 clause( 69, [ equalish( X, a ), ~( equalish( X, c ) ) ] )
% 0.68/1.09 , clause( 202, [ ~( equalish( X, c ) ), equalish( X, a ) ] )
% 0.68/1.09 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.68/1.09 0 )] ) ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 resolution(
% 0.68/1.09 clause( 203, [ equalish( add( successor( 'predecessor_of_1st_minus_2nd'( c
% 0.68/1.09 , b ) ), b ), a ) ] )
% 0.68/1.09 , clause( 69, [ equalish( X, a ), ~( equalish( X, c ) ) ] )
% 0.68/1.09 , 1, clause( 55, [ equalish( add( successor( 'predecessor_of_1st_minus_2nd'(
% 0.68/1.09 c, b ) ), b ), c ) ] )
% 0.68/1.09 , 0, substitution( 0, [ :=( X, add( successor(
% 0.68/1.09 'predecessor_of_1st_minus_2nd'( c, b ) ), b ) )] ), substitution( 1, [] )
% 0.68/1.09 ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 subsumption(
% 0.68/1.09 clause( 153, [ equalish( add( successor( 'predecessor_of_1st_minus_2nd'( c
% 0.68/1.09 , b ) ), b ), a ) ] )
% 0.68/1.09 , clause( 203, [ equalish( add( successor( 'predecessor_of_1st_minus_2nd'(
% 0.68/1.09 c, b ) ), b ), a ) ] )
% 0.68/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 resolution(
% 0.68/1.09 clause( 204, [ less( b, a ) ] )
% 0.68/1.09 , clause( 7, [ less( Y, Z ), ~( equalish( add( successor( X ), Y ), Z ) ) ]
% 0.68/1.09 )
% 0.68/1.09 , 1, clause( 153, [ equalish( add( successor(
% 0.68/1.09 'predecessor_of_1st_minus_2nd'( c, b ) ), b ), a ) ] )
% 0.68/1.09 , 0, substitution( 0, [ :=( X, 'predecessor_of_1st_minus_2nd'( c, b ) ),
% 0.68/1.09 :=( Y, b ), :=( Z, a )] ), substitution( 1, [] )).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 resolution(
% 0.68/1.09 clause( 205, [] )
% 0.68/1.09 , clause( 16, [ ~( less( b, a ) ) ] )
% 0.68/1.09 , 0, clause( 204, [ less( b, a ) ] )
% 0.68/1.09 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 subsumption(
% 0.68/1.09 clause( 162, [] )
% 0.68/1.09 , clause( 205, [] )
% 0.68/1.09 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 end.
% 0.68/1.09
% 0.68/1.09 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.68/1.09
% 0.68/1.09 Memory use:
% 0.68/1.09
% 0.68/1.09 space for terms: 1791
% 0.68/1.09 space for clauses: 11523
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 clauses generated: 254
% 0.68/1.09 clauses kept: 163
% 0.68/1.09 clauses selected: 92
% 0.68/1.09 clauses deleted: 0
% 0.68/1.09 clauses inuse deleted: 0
% 0.68/1.09
% 0.68/1.09 subsentry: 190
% 0.68/1.09 literals s-matched: 140
% 0.68/1.09 literals matched: 140
% 0.68/1.09 full subsumption: 4
% 0.68/1.09
% 0.68/1.09 checksum: -766055472
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 Bliksem ended
%------------------------------------------------------------------------------