TSTP Solution File: NUM024-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : NUM024-1 : TPTP v8.1.0. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n006.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.75s 1.16s
% Output : Refutation 0.75s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM024-1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.03/0.13 % Command : bliksem %s
% 0.13/0.33 % Computer : n006.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % DateTime : Wed Jul 6 08:16:51 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.75/1.16 *** allocated 10000 integers for termspace/termends
% 0.75/1.16 *** allocated 10000 integers for clauses
% 0.75/1.16 *** allocated 10000 integers for justifications
% 0.75/1.16 Bliksem 1.12
% 0.75/1.16
% 0.75/1.16
% 0.75/1.16 Automatic Strategy Selection
% 0.75/1.16
% 0.75/1.16 Clauses:
% 0.75/1.16 [
% 0.75/1.16 [ equalish( add( X, n0 ), X ) ],
% 0.75/1.16 [ equalish( add( X, successor( Y ) ), successor( add( X, Y ) ) ) ],
% 0.75/1.16 [ equalish( multiply( X, n0 ), n0 ) ],
% 0.75/1.16 [ equalish( multiply( X, successor( Y ) ), add( multiply( X, Y ), X ) )
% 0.75/1.16 ],
% 0.75/1.16 [ ~( equalish( successor( X ), successor( Y ) ) ), equalish( X, Y ) ]
% 0.75/1.16 ,
% 0.75/1.16 [ ~( equalish( X, Y ) ), equalish( successor( X ), successor( Y ) ) ]
% 0.75/1.16 ,
% 0.75/1.16 [ ~( less( X, Y ) ), ~( less( Z, X ) ), less( Z, Y ) ],
% 0.75/1.16 [ ~( equalish( add( successor( X ), Y ), Z ) ), less( Y, Z ) ],
% 0.75/1.16 [ ~( less( X, Y ) ), equalish( add( successor(
% 0.75/1.16 'predecessor_of_1st_minus_2nd'( Y, X ) ), X ), Y ) ],
% 0.75/1.16 [ equalish( X, X ) ],
% 0.75/1.16 [ ~( equalish( X, Y ) ), equalish( Y, X ) ],
% 0.75/1.16 [ ~( equalish( X, Y ) ), ~( equalish( Y, Z ) ), equalish( X, Z ) ],
% 0.75/1.16 [ ~( equalish( add( X, Y ), add( Z, Y ) ) ), equalish( X, Z ) ],
% 0.75/1.16 [ equalish( add( X, Y ), add( Y, X ) ) ],
% 0.75/1.16 [ less( a, a ) ],
% 0.75/1.16 [ ~( equalish( successor( X ), n0 ) ) ]
% 0.75/1.16 ] .
% 0.75/1.16
% 0.75/1.16
% 0.75/1.16 percentage equality = 0.000000, percentage horn = 1.000000
% 0.75/1.16 This is a near-Horn, non-equality problem
% 0.75/1.16
% 0.75/1.16
% 0.75/1.16 Options Used:
% 0.75/1.16
% 0.75/1.16 useres = 1
% 0.75/1.16 useparamod = 0
% 0.75/1.16 useeqrefl = 0
% 0.75/1.16 useeqfact = 0
% 0.75/1.16 usefactor = 1
% 0.75/1.16 usesimpsplitting = 0
% 0.75/1.16 usesimpdemod = 0
% 0.75/1.16 usesimpres = 4
% 0.75/1.16
% 0.75/1.16 resimpinuse = 1000
% 0.75/1.16 resimpclauses = 20000
% 0.75/1.16 substype = standard
% 0.75/1.16 backwardsubs = 1
% 0.75/1.16 selectoldest = 5
% 0.75/1.16
% 0.75/1.16 litorderings [0] = split
% 0.75/1.16 litorderings [1] = liftord
% 0.75/1.16
% 0.75/1.16 termordering = none
% 0.75/1.16
% 0.75/1.16 litapriori = 1
% 0.75/1.16 termapriori = 0
% 0.75/1.16 litaposteriori = 0
% 0.75/1.16 termaposteriori = 0
% 0.75/1.16 demodaposteriori = 0
% 0.75/1.16 ordereqreflfact = 0
% 0.75/1.16
% 0.75/1.16 litselect = negative
% 0.75/1.16
% 0.75/1.16 maxweight = 30000
% 0.75/1.16 maxdepth = 30000
% 0.75/1.16 maxlength = 115
% 0.75/1.16 maxnrvars = 195
% 0.75/1.16 excuselevel = 0
% 0.75/1.16 increasemaxweight = 0
% 0.75/1.16
% 0.75/1.16 maxselected = 10000000
% 0.75/1.16 maxnrclauses = 10000000
% 0.75/1.16
% 0.75/1.16 showgenerated = 0
% 0.75/1.16 showkept = 0
% 0.75/1.16 showselected = 0
% 0.75/1.16 showdeleted = 0
% 0.75/1.16 showresimp = 1
% 0.75/1.16 showstatus = 2000
% 0.75/1.16
% 0.75/1.16 prologoutput = 1
% 0.75/1.16 nrgoals = 5000000
% 0.75/1.16 totalproof = 1
% 0.75/1.16
% 0.75/1.16 Symbols occurring in the translation:
% 0.75/1.16
% 0.75/1.16 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.75/1.16 . [1, 2] (w:1, o:23, a:1, s:1, b:0),
% 0.75/1.16 ! [4, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.75/1.16 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.75/1.16 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.75/1.16 n0 [40, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.75/1.16 add [41, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.75/1.16 equalish [42, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.75/1.16 successor [44, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.75/1.16 multiply [45, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.75/1.16 less [46, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.75/1.16 'predecessor_of_1st_minus_2nd' [48, 2] (w:1, o:52, a:1, s:1, b:0),
% 0.75/1.16 a [52, 0] (w:1, o:16, a:1, s:1, b:0).
% 0.75/1.16
% 0.75/1.16
% 0.75/1.16 Starting Search:
% 0.75/1.16
% 0.75/1.16 Resimplifying inuse:
% 0.75/1.16 Done
% 0.75/1.16
% 0.75/1.16
% 0.75/1.16 Intermediate Status:
% 0.75/1.16 Generated: 2919
% 0.75/1.16 Kept: 2005
% 0.75/1.16 Inuse: 349
% 0.75/1.16 Deleted: 21
% 0.75/1.16 Deletedinuse: 5
% 0.75/1.16
% 0.75/1.16 Resimplifying inuse:
% 0.75/1.16 Done
% 0.75/1.16
% 0.75/1.16 Resimplifying inuse:
% 0.75/1.16 Done
% 0.75/1.16
% 0.75/1.16
% 0.75/1.16 Bliksems!, er is een bewijs:
% 0.75/1.16 % SZS status Unsatisfiable
% 0.75/1.16 % SZS output start Refutation
% 0.75/1.16
% 0.75/1.16 clause( 0, [ equalish( add( X, n0 ), X ) ] )
% 0.75/1.16 .
% 0.75/1.16 clause( 8, [ equalish( add( successor( 'predecessor_of_1st_minus_2nd'( Y, X
% 0.75/1.16 ) ), X ), Y ), ~( less( X, Y ) ) ] )
% 0.75/1.16 .
% 0.75/1.16 clause( 10, [ equalish( Y, X ), ~( equalish( X, Y ) ) ] )
% 0.75/1.16 .
% 0.75/1.16 clause( 11, [ ~( equalish( X, Y ) ), equalish( X, Z ), ~( equalish( Y, Z )
% 0.75/1.16 ) ] )
% 0.75/1.16 .
% 0.75/1.16 clause( 12, [ equalish( X, Z ), ~( equalish( add( X, Y ), add( Z, Y ) ) ) ]
% 0.75/1.16 )
% 0.75/1.16 .
% 0.75/1.16 clause( 13, [ equalish( add( X, Y ), add( Y, X ) ) ] )
% 0.75/1.16 .
% 0.75/1.16 clause( 14, [ less( a, a ) ] )
% 0.75/1.16 .
% 0.75/1.16 clause( 15, [ ~( equalish( successor( X ), n0 ) ) ] )
% 0.75/1.16 .
% 0.75/1.16 clause( 50, [ equalish( add( successor( 'predecessor_of_1st_minus_2nd'( a,
% 0.75/1.16 a ) ), a ), a ) ] )
% 0.75/1.16 .
% 0.75/1.16 clause( 77, [ equalish( X, Y ), ~( equalish( X, add( Y, n0 ) ) ) ] )
% 0.75/1.16 .
% 0.75/1.16 clause( 132, [ equalish( add( n0, X ), X ) ] )
% 0.75/1.16 .
% 0.75/1.16 clause( 136, [ equalish( X, add( n0, X ) ) ] )
% 0.75/1.16 .
% 0.75/1.16 clause( 141, [ equalish( X, add( n0, Y ) ), ~( equalish( X, Y ) ) ] )
% 0.75/1.16 .
% 0.75/1.16 clause( 201, [ equalish( add( successor( 'predecessor_of_1st_minus_2nd'( a
% 0.75/1.16 , a ) ), a ), add( n0, a ) ) ] )
% 0.75/1.16 .
% 0.75/1.16 clause( 3848, [] )
% 0.75/1.16 .
% 0.75/1.16
% 0.75/1.16
% 0.75/1.16 % SZS output end Refutation
% 0.75/1.16 found a proof!
% 0.75/1.16
% 0.75/1.16 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.75/1.16
% 0.75/1.16 initialclauses(
% 0.75/1.16 [ clause( 3850, [ equalish( add( X, n0 ), X ) ] )
% 0.75/1.16 , clause( 3851, [ equalish( add( X, successor( Y ) ), successor( add( X, Y
% 0.75/1.16 ) ) ) ] )
% 0.75/1.16 , clause( 3852, [ equalish( multiply( X, n0 ), n0 ) ] )
% 0.75/1.16 , clause( 3853, [ equalish( multiply( X, successor( Y ) ), add( multiply( X
% 0.75/1.16 , Y ), X ) ) ] )
% 0.75/1.16 , clause( 3854, [ ~( equalish( successor( X ), successor( Y ) ) ), equalish(
% 0.75/1.16 X, Y ) ] )
% 0.75/1.16 , clause( 3855, [ ~( equalish( X, Y ) ), equalish( successor( X ),
% 0.75/1.16 successor( Y ) ) ] )
% 0.75/1.16 , clause( 3856, [ ~( less( X, Y ) ), ~( less( Z, X ) ), less( Z, Y ) ] )
% 0.75/1.16 , clause( 3857, [ ~( equalish( add( successor( X ), Y ), Z ) ), less( Y, Z
% 0.75/1.16 ) ] )
% 0.75/1.16 , clause( 3858, [ ~( less( X, Y ) ), equalish( add( successor(
% 0.75/1.16 'predecessor_of_1st_minus_2nd'( Y, X ) ), X ), Y ) ] )
% 0.75/1.16 , clause( 3859, [ equalish( X, X ) ] )
% 0.75/1.16 , clause( 3860, [ ~( equalish( X, Y ) ), equalish( Y, X ) ] )
% 0.75/1.16 , clause( 3861, [ ~( equalish( X, Y ) ), ~( equalish( Y, Z ) ), equalish( X
% 0.75/1.16 , Z ) ] )
% 0.75/1.16 , clause( 3862, [ ~( equalish( add( X, Y ), add( Z, Y ) ) ), equalish( X, Z
% 0.75/1.16 ) ] )
% 0.75/1.16 , clause( 3863, [ equalish( add( X, Y ), add( Y, X ) ) ] )
% 0.75/1.16 , clause( 3864, [ less( a, a ) ] )
% 0.75/1.16 , clause( 3865, [ ~( equalish( successor( X ), n0 ) ) ] )
% 0.75/1.16 ] ).
% 0.75/1.16
% 0.75/1.16
% 0.75/1.16
% 0.75/1.16 subsumption(
% 0.75/1.16 clause( 0, [ equalish( add( X, n0 ), X ) ] )
% 0.75/1.16 , clause( 3850, [ equalish( add( X, n0 ), X ) ] )
% 0.75/1.16 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.75/1.16
% 0.75/1.16
% 0.75/1.16 subsumption(
% 0.75/1.16 clause( 8, [ equalish( add( successor( 'predecessor_of_1st_minus_2nd'( Y, X
% 0.75/1.16 ) ), X ), Y ), ~( less( X, Y ) ) ] )
% 0.75/1.16 , clause( 3858, [ ~( less( X, Y ) ), equalish( add( successor(
% 0.75/1.16 'predecessor_of_1st_minus_2nd'( Y, X ) ), X ), Y ) ] )
% 0.75/1.16 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.75/1.16 ), ==>( 1, 0 )] ) ).
% 0.75/1.16
% 0.75/1.16
% 0.75/1.16 subsumption(
% 0.75/1.16 clause( 10, [ equalish( Y, X ), ~( equalish( X, Y ) ) ] )
% 0.75/1.16 , clause( 3860, [ ~( equalish( X, Y ) ), equalish( Y, X ) ] )
% 0.75/1.16 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.75/1.16 ), ==>( 1, 0 )] ) ).
% 0.75/1.16
% 0.75/1.16
% 0.75/1.16 subsumption(
% 0.75/1.16 clause( 11, [ ~( equalish( X, Y ) ), equalish( X, Z ), ~( equalish( Y, Z )
% 0.75/1.16 ) ] )
% 0.75/1.16 , clause( 3861, [ ~( equalish( X, Y ) ), ~( equalish( Y, Z ) ), equalish( X
% 0.75/1.16 , Z ) ] )
% 0.75/1.16 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.75/1.16 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.75/1.16
% 0.75/1.16
% 0.75/1.16 subsumption(
% 0.75/1.16 clause( 12, [ equalish( X, Z ), ~( equalish( add( X, Y ), add( Z, Y ) ) ) ]
% 0.75/1.16 )
% 0.75/1.16 , clause( 3862, [ ~( equalish( add( X, Y ), add( Z, Y ) ) ), equalish( X, Z
% 0.75/1.16 ) ] )
% 0.75/1.16 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.75/1.16 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.75/1.16
% 0.75/1.16
% 0.75/1.16 subsumption(
% 0.75/1.16 clause( 13, [ equalish( add( X, Y ), add( Y, X ) ) ] )
% 0.75/1.16 , clause( 3863, [ equalish( add( X, Y ), add( Y, X ) ) ] )
% 0.75/1.16 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.75/1.16 )] ) ).
% 0.75/1.16
% 0.75/1.16
% 0.75/1.16 subsumption(
% 0.75/1.16 clause( 14, [ less( a, a ) ] )
% 0.75/1.16 , clause( 3864, [ less( a, a ) ] )
% 0.75/1.16 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.75/1.16
% 0.75/1.16
% 0.75/1.16 subsumption(
% 0.75/1.16 clause( 15, [ ~( equalish( successor( X ), n0 ) ) ] )
% 0.75/1.16 , clause( 3865, [ ~( equalish( successor( X ), n0 ) ) ] )
% 0.75/1.16 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.75/1.16
% 0.75/1.16
% 0.75/1.16 resolution(
% 0.75/1.16 clause( 3878, [ equalish( add( successor( 'predecessor_of_1st_minus_2nd'( a
% 0.75/1.16 , a ) ), a ), a ) ] )
% 0.75/1.16 , clause( 8, [ equalish( add( successor( 'predecessor_of_1st_minus_2nd'( Y
% 0.75/1.16 , X ) ), X ), Y ), ~( less( X, Y ) ) ] )
% 0.75/1.16 , 1, clause( 14, [ less( a, a ) ] )
% 0.75/1.16 , 0, substitution( 0, [ :=( X, a ), :=( Y, a )] ), substitution( 1, [] )
% 0.75/1.16 ).
% 0.75/1.16
% 0.75/1.16
% 0.75/1.16 subsumption(
% 0.75/1.16 clause( 50, [ equalish( add( successor( 'predecessor_of_1st_minus_2nd'( a,
% 0.75/1.16 a ) ), a ), a ) ] )
% 0.75/1.16 , clause( 3878, [ equalish( add( successor( 'predecessor_of_1st_minus_2nd'(
% 0.75/1.16 a, a ) ), a ), a ) ] )
% 0.75/1.16 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.75/1.16
% 0.75/1.16
% 0.75/1.16 resolution(
% 0.75/1.16 clause( 3880, [ ~( equalish( X, add( Y, n0 ) ) ), equalish( X, Y ) ] )
% 0.75/1.16 , clause( 11, [ ~( equalish( X, Y ) ), equalish( X, Z ), ~( equalish( Y, Z
% 0.75/1.16 ) ) ] )
% 0.75/1.16 , 2, clause( 0, [ equalish( add( X, n0 ), X ) ] )
% 0.75/1.16 , 0, substitution( 0, [ :=( X, X ), :=( Y, add( Y, n0 ) ), :=( Z, Y )] ),
% 0.75/1.16 substitution( 1, [ :=( X, Y )] )).
% 0.75/1.16
% 0.75/1.16
% 0.75/1.16 subsumption(
% 0.75/1.16 clause( 77, [ equalish( X, Y ), ~( equalish( X, add( Y, n0 ) ) ) ] )
% 0.75/1.16 , clause( 3880, [ ~( equalish( X, add( Y, n0 ) ) ), equalish( X, Y ) ] )
% 0.75/1.16 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.75/1.16 ), ==>( 1, 0 )] ) ).
% 0.75/1.16
% 0.75/1.16
% 0.75/1.16 resolution(
% 0.75/1.16 clause( 3881, [ equalish( add( n0, X ), X ) ] )
% 0.75/1.16 , clause( 77, [ equalish( X, Y ), ~( equalish( X, add( Y, n0 ) ) ) ] )
% 0.75/1.16 , 1, clause( 13, [ equalish( add( X, Y ), add( Y, X ) ) ] )
% 0.75/1.16 , 0, substitution( 0, [ :=( X, add( n0, X ) ), :=( Y, X )] ),
% 0.75/1.16 substitution( 1, [ :=( X, n0 ), :=( Y, X )] )).
% 0.75/1.16
% 0.75/1.16
% 0.75/1.16 subsumption(
% 0.75/1.16 clause( 132, [ equalish( add( n0, X ), X ) ] )
% 0.75/1.16 , clause( 3881, [ equalish( add( n0, X ), X ) ] )
% 0.75/1.16 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.75/1.16
% 0.75/1.16
% 0.75/1.16 resolution(
% 0.75/1.16 clause( 3882, [ equalish( X, add( n0, X ) ) ] )
% 0.75/1.16 , clause( 10, [ equalish( Y, X ), ~( equalish( X, Y ) ) ] )
% 0.75/1.16 , 1, clause( 132, [ equalish( add( n0, X ), X ) ] )
% 0.75/1.16 , 0, substitution( 0, [ :=( X, add( n0, X ) ), :=( Y, X )] ),
% 0.75/1.16 substitution( 1, [ :=( X, X )] )).
% 0.75/1.16
% 0.75/1.16
% 0.75/1.16 subsumption(
% 0.75/1.16 clause( 136, [ equalish( X, add( n0, X ) ) ] )
% 0.75/1.16 , clause( 3882, [ equalish( X, add( n0, X ) ) ] )
% 0.75/1.16 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.75/1.16
% 0.75/1.16
% 0.75/1.16 resolution(
% 0.75/1.16 clause( 3884, [ ~( equalish( X, Y ) ), equalish( X, add( n0, Y ) ) ] )
% 0.75/1.16 , clause( 11, [ ~( equalish( X, Y ) ), equalish( X, Z ), ~( equalish( Y, Z
% 0.75/1.16 ) ) ] )
% 0.75/1.16 , 2, clause( 136, [ equalish( X, add( n0, X ) ) ] )
% 0.75/1.16 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, add( n0, Y ) )] ),
% 0.75/1.16 substitution( 1, [ :=( X, Y )] )).
% 0.75/1.16
% 0.75/1.16
% 0.75/1.16 subsumption(
% 0.75/1.16 clause( 141, [ equalish( X, add( n0, Y ) ), ~( equalish( X, Y ) ) ] )
% 0.75/1.16 , clause( 3884, [ ~( equalish( X, Y ) ), equalish( X, add( n0, Y ) ) ] )
% 0.75/1.16 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.75/1.16 ), ==>( 1, 0 )] ) ).
% 0.75/1.16
% 0.75/1.16
% 0.75/1.16 resolution(
% 0.75/1.16 clause( 3885, [ equalish( add( successor( 'predecessor_of_1st_minus_2nd'( a
% 0.75/1.16 , a ) ), a ), add( n0, a ) ) ] )
% 0.75/1.16 , clause( 141, [ equalish( X, add( n0, Y ) ), ~( equalish( X, Y ) ) ] )
% 0.75/1.16 , 1, clause( 50, [ equalish( add( successor( 'predecessor_of_1st_minus_2nd'(
% 0.75/1.16 a, a ) ), a ), a ) ] )
% 0.75/1.16 , 0, substitution( 0, [ :=( X, add( successor(
% 0.75/1.16 'predecessor_of_1st_minus_2nd'( a, a ) ), a ) ), :=( Y, a )] ),
% 0.75/1.16 substitution( 1, [] )).
% 0.75/1.16
% 0.75/1.16
% 0.75/1.16 subsumption(
% 0.75/1.16 clause( 201, [ equalish( add( successor( 'predecessor_of_1st_minus_2nd'( a
% 0.75/1.16 , a ) ), a ), add( n0, a ) ) ] )
% 0.75/1.16 , clause( 3885, [ equalish( add( successor( 'predecessor_of_1st_minus_2nd'(
% 0.75/1.16 a, a ) ), a ), add( n0, a ) ) ] )
% 0.75/1.16 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.75/1.16
% 0.75/1.16
% 0.75/1.16 resolution(
% 0.75/1.16 clause( 3886, [ equalish( successor( 'predecessor_of_1st_minus_2nd'( a, a )
% 0.75/1.16 ), n0 ) ] )
% 0.75/1.16 , clause( 12, [ equalish( X, Z ), ~( equalish( add( X, Y ), add( Z, Y ) ) )
% 0.75/1.16 ] )
% 0.75/1.16 , 1, clause( 201, [ equalish( add( successor(
% 0.75/1.16 'predecessor_of_1st_minus_2nd'( a, a ) ), a ), add( n0, a ) ) ] )
% 0.75/1.16 , 0, substitution( 0, [ :=( X, successor( 'predecessor_of_1st_minus_2nd'( a
% 0.75/1.16 , a ) ) ), :=( Y, a ), :=( Z, n0 )] ), substitution( 1, [] )).
% 0.75/1.16
% 0.75/1.16
% 0.75/1.16 resolution(
% 0.75/1.16 clause( 3887, [] )
% 0.75/1.16 , clause( 15, [ ~( equalish( successor( X ), n0 ) ) ] )
% 0.75/1.16 , 0, clause( 3886, [ equalish( successor( 'predecessor_of_1st_minus_2nd'( a
% 0.75/1.16 , a ) ), n0 ) ] )
% 0.75/1.16 , 0, substitution( 0, [ :=( X, 'predecessor_of_1st_minus_2nd'( a, a ) )] )
% 0.75/1.16 , substitution( 1, [] )).
% 0.75/1.16
% 0.75/1.16
% 0.75/1.16 subsumption(
% 0.75/1.16 clause( 3848, [] )
% 0.75/1.16 , clause( 3887, [] )
% 0.75/1.16 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.75/1.16
% 0.75/1.16
% 0.75/1.16 end.
% 0.75/1.16
% 0.75/1.16 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.75/1.16
% 0.75/1.16 Memory use:
% 0.75/1.16
% 0.75/1.16 space for terms: 47985
% 0.75/1.16 space for clauses: 287362
% 0.75/1.16
% 0.75/1.16
% 0.75/1.16 clauses generated: 5508
% 0.75/1.16 clauses kept: 3849
% 0.75/1.16 clauses selected: 506
% 0.75/1.16 clauses deleted: 46
% 0.75/1.16 clauses inuse deleted: 21
% 0.75/1.16
% 0.75/1.16 subsentry: 3583
% 0.75/1.16 literals s-matched: 2929
% 0.75/1.16 literals matched: 2929
% 0.75/1.16 full subsumption: 10
% 0.75/1.16
% 0.75/1.16 checksum: -1027864432
% 0.75/1.16
% 0.75/1.16
% 0.75/1.16 Bliksem ended
%------------------------------------------------------------------------------