TSTP Solution File: GRP147-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : GRP147-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n013.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 : Sat Jul 16 07:35:34 EDT 2022
% Result : Unsatisfiable 0.84s 1.22s
% Output : Refutation 0.84s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GRP147-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.10/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n013.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % DateTime : Mon Jun 13 16:33:59 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.84/1.22 *** allocated 10000 integers for termspace/termends
% 0.84/1.22 *** allocated 10000 integers for clauses
% 0.84/1.22 *** allocated 10000 integers for justifications
% 0.84/1.22 Bliksem 1.12
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 Automatic Strategy Selection
% 0.84/1.22
% 0.84/1.22 Clauses:
% 0.84/1.22 [
% 0.84/1.22 [ =( multiply( identity, X ), X ) ],
% 0.84/1.22 [ =( multiply( inverse( X ), X ), identity ) ],
% 0.84/1.22 [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply( Y, Z ) ) )
% 0.84/1.22 ],
% 0.84/1.22 [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y, X ) ) ]
% 0.84/1.22 ,
% 0.84/1.22 [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X ) ) ],
% 0.84/1.22 [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.84/1.22 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ],
% 0.84/1.22 [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.84/1.22 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ],
% 0.84/1.22 [ =( 'least_upper_bound'( X, X ), X ) ],
% 0.84/1.22 [ =( 'greatest_lower_bound'( X, X ), X ) ],
% 0.84/1.22 [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) ), X ) ]
% 0.84/1.22 ,
% 0.84/1.22 [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) ), X ) ]
% 0.84/1.22 ,
% 0.84/1.22 [ =( multiply( X, 'least_upper_bound'( Y, Z ) ), 'least_upper_bound'(
% 0.84/1.22 multiply( X, Y ), multiply( X, Z ) ) ) ],
% 0.84/1.22 [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.84/1.22 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ],
% 0.84/1.22 [ =( multiply( 'least_upper_bound'( X, Y ), Z ), 'least_upper_bound'(
% 0.84/1.22 multiply( X, Z ), multiply( Y, Z ) ) ) ],
% 0.84/1.22 [ =( multiply( 'greatest_lower_bound'( X, Y ), Z ),
% 0.84/1.22 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ],
% 0.84/1.22 [ =( 'greatest_lower_bound'( a, c ), a ) ],
% 0.84/1.22 [ =( 'greatest_lower_bound'( b, c ), b ) ],
% 0.84/1.22 [ ~( =( 'greatest_lower_bound'( 'least_upper_bound'( a, b ), c ),
% 0.84/1.22 'least_upper_bound'( a, b ) ) ) ]
% 0.84/1.22 ] .
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 percentage equality = 1.000000, percentage horn = 1.000000
% 0.84/1.22 This is a pure equality problem
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 Options Used:
% 0.84/1.22
% 0.84/1.22 useres = 1
% 0.84/1.22 useparamod = 1
% 0.84/1.22 useeqrefl = 1
% 0.84/1.22 useeqfact = 1
% 0.84/1.22 usefactor = 1
% 0.84/1.22 usesimpsplitting = 0
% 0.84/1.22 usesimpdemod = 5
% 0.84/1.22 usesimpres = 3
% 0.84/1.22
% 0.84/1.22 resimpinuse = 1000
% 0.84/1.22 resimpclauses = 20000
% 0.84/1.22 substype = eqrewr
% 0.84/1.22 backwardsubs = 1
% 0.84/1.22 selectoldest = 5
% 0.84/1.22
% 0.84/1.22 litorderings [0] = split
% 0.84/1.22 litorderings [1] = extend the termordering, first sorting on arguments
% 0.84/1.22
% 0.84/1.22 termordering = kbo
% 0.84/1.22
% 0.84/1.22 litapriori = 0
% 0.84/1.22 termapriori = 1
% 0.84/1.22 litaposteriori = 0
% 0.84/1.22 termaposteriori = 0
% 0.84/1.22 demodaposteriori = 0
% 0.84/1.22 ordereqreflfact = 0
% 0.84/1.22
% 0.84/1.22 litselect = negord
% 0.84/1.22
% 0.84/1.22 maxweight = 15
% 0.84/1.22 maxdepth = 30000
% 0.84/1.22 maxlength = 115
% 0.84/1.22 maxnrvars = 195
% 0.84/1.22 excuselevel = 1
% 0.84/1.22 increasemaxweight = 1
% 0.84/1.22
% 0.84/1.22 maxselected = 10000000
% 0.84/1.22 maxnrclauses = 10000000
% 0.84/1.22
% 0.84/1.22 showgenerated = 0
% 0.84/1.22 showkept = 0
% 0.84/1.22 showselected = 0
% 0.84/1.22 showdeleted = 0
% 0.84/1.22 showresimp = 1
% 0.84/1.22 showstatus = 2000
% 0.84/1.22
% 0.84/1.22 prologoutput = 1
% 0.84/1.22 nrgoals = 5000000
% 0.84/1.22 totalproof = 1
% 0.84/1.22
% 0.84/1.22 Symbols occurring in the translation:
% 0.84/1.22
% 0.84/1.22 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.84/1.22 . [1, 2] (w:1, o:22, a:1, s:1, b:0),
% 0.84/1.22 ! [4, 1] (w:0, o:16, a:1, s:1, b:0),
% 0.84/1.22 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.84/1.22 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.84/1.22 identity [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.84/1.22 multiply [41, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.84/1.22 inverse [42, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.84/1.22 'greatest_lower_bound' [45, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.84/1.22 'least_upper_bound' [46, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.84/1.22 a [47, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.84/1.22 c [48, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.84/1.22 b [49, 0] (w:1, o:14, a:1, s:1, b:0).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 Starting Search:
% 0.84/1.22
% 0.84/1.22 Resimplifying inuse:
% 0.84/1.22 Done
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 Bliksems!, er is een bewijs:
% 0.84/1.22 % SZS status Unsatisfiable
% 0.84/1.22 % SZS output start Refutation
% 0.84/1.22
% 0.84/1.22 clause( 3, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y,
% 0.84/1.22 X ) ) ] )
% 0.84/1.22 .
% 0.84/1.22 clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X ) )
% 0.84/1.22 ] )
% 0.84/1.22 .
% 0.84/1.22 clause( 6, [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.84/1.22 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.84/1.22 .
% 0.84/1.22 clause( 9, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) ), X
% 0.84/1.22 ) ] )
% 0.84/1.22 .
% 0.84/1.22 clause( 10, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) ),
% 0.84/1.22 X ) ] )
% 0.84/1.22 .
% 0.84/1.22 clause( 15, [ =( 'greatest_lower_bound'( a, c ), a ) ] )
% 0.84/1.22 .
% 0.84/1.22 clause( 16, [ =( 'greatest_lower_bound'( b, c ), b ) ] )
% 0.84/1.22 .
% 0.84/1.22 clause( 17, [ ~( =( 'greatest_lower_bound'( 'least_upper_bound'( a, b ), c
% 0.84/1.22 ), 'least_upper_bound'( a, b ) ) ) ] )
% 0.84/1.22 .
% 0.84/1.22 clause( 18, [ =( 'greatest_lower_bound'( c, a ), a ) ] )
% 0.84/1.22 .
% 0.84/1.22 clause( 19, [ =( 'greatest_lower_bound'( c, b ), b ) ] )
% 0.84/1.22 .
% 0.84/1.22 clause( 23, [ =( 'greatest_lower_bound'( 'least_upper_bound'( X, Y ), X ),
% 0.84/1.22 X ) ] )
% 0.84/1.22 .
% 0.84/1.22 clause( 44, [ =( 'least_upper_bound'( c, b ), c ) ] )
% 0.84/1.22 .
% 0.84/1.22 clause( 45, [ =( 'least_upper_bound'( c, a ), c ) ] )
% 0.84/1.22 .
% 0.84/1.22 clause( 48, [ =( 'least_upper_bound'( b, c ), c ) ] )
% 0.84/1.22 .
% 0.84/1.22 clause( 49, [ =( 'least_upper_bound'( a, c ), c ) ] )
% 0.84/1.22 .
% 0.84/1.22 clause( 60, [ =( 'least_upper_bound'( 'least_upper_bound'( X, a ), c ),
% 0.84/1.22 'least_upper_bound'( X, c ) ) ] )
% 0.84/1.22 .
% 0.84/1.22 clause( 93, [ =( 'greatest_lower_bound'( 'least_upper_bound'( X, c ),
% 0.84/1.22 'least_upper_bound'( X, a ) ), 'least_upper_bound'( X, a ) ) ] )
% 0.84/1.22 .
% 0.84/1.22 clause( 141, [ ~( =( 'greatest_lower_bound'( c, 'least_upper_bound'( a, b )
% 0.84/1.22 ), 'least_upper_bound'( a, b ) ) ) ] )
% 0.84/1.22 .
% 0.84/1.22 clause( 227, [ ~( =( 'greatest_lower_bound'( c, 'least_upper_bound'( b, a )
% 0.84/1.22 ), 'least_upper_bound'( b, a ) ) ) ] )
% 0.84/1.22 .
% 0.84/1.22 clause( 1843, [] )
% 0.84/1.22 .
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 % SZS output end Refutation
% 0.84/1.22 found a proof!
% 0.84/1.22
% 0.84/1.22 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.84/1.22
% 0.84/1.22 initialclauses(
% 0.84/1.22 [ clause( 1845, [ =( multiply( identity, X ), X ) ] )
% 0.84/1.22 , clause( 1846, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.84/1.22 , clause( 1847, [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply(
% 0.84/1.22 Y, Z ) ) ) ] )
% 0.84/1.22 , clause( 1848, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'(
% 0.84/1.22 Y, X ) ) ] )
% 0.84/1.22 , clause( 1849, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X
% 0.84/1.22 ) ) ] )
% 0.84/1.22 , clause( 1850, [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y,
% 0.84/1.22 Z ) ), 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.84/1.22 , clause( 1851, [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) )
% 0.84/1.22 , 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.84/1.22 , clause( 1852, [ =( 'least_upper_bound'( X, X ), X ) ] )
% 0.84/1.22 , clause( 1853, [ =( 'greatest_lower_bound'( X, X ), X ) ] )
% 0.84/1.22 , clause( 1854, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y )
% 0.84/1.22 ), X ) ] )
% 0.84/1.22 , clause( 1855, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y )
% 0.84/1.22 ), X ) ] )
% 0.84/1.22 , clause( 1856, [ =( multiply( X, 'least_upper_bound'( Y, Z ) ),
% 0.84/1.22 'least_upper_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.84/1.22 , clause( 1857, [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.84/1.22 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.84/1.22 , clause( 1858, [ =( multiply( 'least_upper_bound'( X, Y ), Z ),
% 0.84/1.22 'least_upper_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.84/1.22 , clause( 1859, [ =( multiply( 'greatest_lower_bound'( X, Y ), Z ),
% 0.84/1.22 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.84/1.22 , clause( 1860, [ =( 'greatest_lower_bound'( a, c ), a ) ] )
% 0.84/1.22 , clause( 1861, [ =( 'greatest_lower_bound'( b, c ), b ) ] )
% 0.84/1.22 , clause( 1862, [ ~( =( 'greatest_lower_bound'( 'least_upper_bound'( a, b )
% 0.84/1.22 , c ), 'least_upper_bound'( a, b ) ) ) ] )
% 0.84/1.22 ] ).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 subsumption(
% 0.84/1.22 clause( 3, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y,
% 0.84/1.22 X ) ) ] )
% 0.84/1.22 , clause( 1848, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'(
% 0.84/1.22 Y, X ) ) ] )
% 0.84/1.22 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.84/1.22 )] ) ).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 subsumption(
% 0.84/1.22 clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X ) )
% 0.84/1.22 ] )
% 0.84/1.22 , clause( 1849, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X
% 0.84/1.22 ) ) ] )
% 0.84/1.22 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.84/1.22 )] ) ).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 subsumption(
% 0.84/1.22 clause( 6, [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.84/1.22 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.84/1.22 , clause( 1851, [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) )
% 0.84/1.22 , 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.84/1.22 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.84/1.22 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 subsumption(
% 0.84/1.22 clause( 9, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) ), X
% 0.84/1.22 ) ] )
% 0.84/1.22 , clause( 1854, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y )
% 0.84/1.22 ), X ) ] )
% 0.84/1.22 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.84/1.22 )] ) ).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 subsumption(
% 0.84/1.22 clause( 10, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) ),
% 0.84/1.22 X ) ] )
% 0.84/1.22 , clause( 1855, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y )
% 0.84/1.22 ), X ) ] )
% 0.84/1.22 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.84/1.22 )] ) ).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 subsumption(
% 0.84/1.22 clause( 15, [ =( 'greatest_lower_bound'( a, c ), a ) ] )
% 0.84/1.22 , clause( 1860, [ =( 'greatest_lower_bound'( a, c ), a ) ] )
% 0.84/1.22 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 subsumption(
% 0.84/1.22 clause( 16, [ =( 'greatest_lower_bound'( b, c ), b ) ] )
% 0.84/1.22 , clause( 1861, [ =( 'greatest_lower_bound'( b, c ), b ) ] )
% 0.84/1.22 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 subsumption(
% 0.84/1.22 clause( 17, [ ~( =( 'greatest_lower_bound'( 'least_upper_bound'( a, b ), c
% 0.84/1.22 ), 'least_upper_bound'( a, b ) ) ) ] )
% 0.84/1.22 , clause( 1862, [ ~( =( 'greatest_lower_bound'( 'least_upper_bound'( a, b )
% 0.84/1.22 , c ), 'least_upper_bound'( a, b ) ) ) ] )
% 0.84/1.22 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 eqswap(
% 0.84/1.22 clause( 1936, [ =( a, 'greatest_lower_bound'( a, c ) ) ] )
% 0.84/1.22 , clause( 15, [ =( 'greatest_lower_bound'( a, c ), a ) ] )
% 0.84/1.22 , 0, substitution( 0, [] )).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 paramod(
% 0.84/1.22 clause( 1937, [ =( a, 'greatest_lower_bound'( c, a ) ) ] )
% 0.84/1.22 , clause( 3, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y
% 0.84/1.22 , X ) ) ] )
% 0.84/1.22 , 0, clause( 1936, [ =( a, 'greatest_lower_bound'( a, c ) ) ] )
% 0.84/1.22 , 0, 2, substitution( 0, [ :=( X, a ), :=( Y, c )] ), substitution( 1, [] )
% 0.84/1.22 ).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 eqswap(
% 0.84/1.22 clause( 1940, [ =( 'greatest_lower_bound'( c, a ), a ) ] )
% 0.84/1.22 , clause( 1937, [ =( a, 'greatest_lower_bound'( c, a ) ) ] )
% 0.84/1.22 , 0, substitution( 0, [] )).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 subsumption(
% 0.84/1.22 clause( 18, [ =( 'greatest_lower_bound'( c, a ), a ) ] )
% 0.84/1.22 , clause( 1940, [ =( 'greatest_lower_bound'( c, a ), a ) ] )
% 0.84/1.22 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 eqswap(
% 0.84/1.22 clause( 1941, [ =( b, 'greatest_lower_bound'( b, c ) ) ] )
% 0.84/1.22 , clause( 16, [ =( 'greatest_lower_bound'( b, c ), b ) ] )
% 0.84/1.22 , 0, substitution( 0, [] )).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 paramod(
% 0.84/1.22 clause( 1942, [ =( b, 'greatest_lower_bound'( c, b ) ) ] )
% 0.84/1.22 , clause( 3, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y
% 0.84/1.22 , X ) ) ] )
% 0.84/1.22 , 0, clause( 1941, [ =( b, 'greatest_lower_bound'( b, c ) ) ] )
% 0.84/1.22 , 0, 2, substitution( 0, [ :=( X, b ), :=( Y, c )] ), substitution( 1, [] )
% 0.84/1.22 ).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 eqswap(
% 0.84/1.22 clause( 1945, [ =( 'greatest_lower_bound'( c, b ), b ) ] )
% 0.84/1.22 , clause( 1942, [ =( b, 'greatest_lower_bound'( c, b ) ) ] )
% 0.84/1.22 , 0, substitution( 0, [] )).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 subsumption(
% 0.84/1.22 clause( 19, [ =( 'greatest_lower_bound'( c, b ), b ) ] )
% 0.84/1.22 , clause( 1945, [ =( 'greatest_lower_bound'( c, b ), b ) ] )
% 0.84/1.22 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 eqswap(
% 0.84/1.22 clause( 1946, [ =( X, 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y
% 0.84/1.22 ) ) ) ] )
% 0.84/1.22 , clause( 10, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) )
% 0.84/1.22 , X ) ] )
% 0.84/1.22 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 paramod(
% 0.84/1.22 clause( 1947, [ =( X, 'greatest_lower_bound'( 'least_upper_bound'( X, Y ),
% 0.84/1.22 X ) ) ] )
% 0.84/1.22 , clause( 3, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y
% 0.84/1.22 , X ) ) ] )
% 0.84/1.22 , 0, clause( 1946, [ =( X, 'greatest_lower_bound'( X, 'least_upper_bound'(
% 0.84/1.22 X, Y ) ) ) ] )
% 0.84/1.22 , 0, 2, substitution( 0, [ :=( X, X ), :=( Y, 'least_upper_bound'( X, Y ) )] )
% 0.84/1.22 , substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 eqswap(
% 0.84/1.22 clause( 1950, [ =( 'greatest_lower_bound'( 'least_upper_bound'( X, Y ), X )
% 0.84/1.22 , X ) ] )
% 0.84/1.22 , clause( 1947, [ =( X, 'greatest_lower_bound'( 'least_upper_bound'( X, Y )
% 0.84/1.22 , X ) ) ] )
% 0.84/1.22 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 subsumption(
% 0.84/1.22 clause( 23, [ =( 'greatest_lower_bound'( 'least_upper_bound'( X, Y ), X ),
% 0.84/1.22 X ) ] )
% 0.84/1.22 , clause( 1950, [ =( 'greatest_lower_bound'( 'least_upper_bound'( X, Y ), X
% 0.84/1.22 ), X ) ] )
% 0.84/1.22 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.84/1.22 )] ) ).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 eqswap(
% 0.84/1.22 clause( 1952, [ =( X, 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y
% 0.84/1.22 ) ) ) ] )
% 0.84/1.22 , clause( 9, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) )
% 0.84/1.22 , X ) ] )
% 0.84/1.22 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 paramod(
% 0.84/1.22 clause( 1953, [ =( c, 'least_upper_bound'( c, b ) ) ] )
% 0.84/1.22 , clause( 19, [ =( 'greatest_lower_bound'( c, b ), b ) ] )
% 0.84/1.22 , 0, clause( 1952, [ =( X, 'least_upper_bound'( X, 'greatest_lower_bound'(
% 0.84/1.22 X, Y ) ) ) ] )
% 0.84/1.22 , 0, 4, substitution( 0, [] ), substitution( 1, [ :=( X, c ), :=( Y, b )] )
% 0.84/1.22 ).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 eqswap(
% 0.84/1.22 clause( 1954, [ =( 'least_upper_bound'( c, b ), c ) ] )
% 0.84/1.22 , clause( 1953, [ =( c, 'least_upper_bound'( c, b ) ) ] )
% 0.84/1.22 , 0, substitution( 0, [] )).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 subsumption(
% 0.84/1.22 clause( 44, [ =( 'least_upper_bound'( c, b ), c ) ] )
% 0.84/1.22 , clause( 1954, [ =( 'least_upper_bound'( c, b ), c ) ] )
% 0.84/1.22 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 eqswap(
% 0.84/1.22 clause( 1956, [ =( X, 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y
% 0.84/1.22 ) ) ) ] )
% 0.84/1.22 , clause( 9, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) )
% 0.84/1.22 , X ) ] )
% 0.84/1.22 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 paramod(
% 0.84/1.22 clause( 1957, [ =( c, 'least_upper_bound'( c, a ) ) ] )
% 0.84/1.22 , clause( 18, [ =( 'greatest_lower_bound'( c, a ), a ) ] )
% 0.84/1.22 , 0, clause( 1956, [ =( X, 'least_upper_bound'( X, 'greatest_lower_bound'(
% 0.84/1.22 X, Y ) ) ) ] )
% 0.84/1.22 , 0, 4, substitution( 0, [] ), substitution( 1, [ :=( X, c ), :=( Y, a )] )
% 0.84/1.22 ).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 eqswap(
% 0.84/1.22 clause( 1958, [ =( 'least_upper_bound'( c, a ), c ) ] )
% 0.84/1.22 , clause( 1957, [ =( c, 'least_upper_bound'( c, a ) ) ] )
% 0.84/1.22 , 0, substitution( 0, [] )).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 subsumption(
% 0.84/1.22 clause( 45, [ =( 'least_upper_bound'( c, a ), c ) ] )
% 0.84/1.22 , clause( 1958, [ =( 'least_upper_bound'( c, a ), c ) ] )
% 0.84/1.22 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 eqswap(
% 0.84/1.22 clause( 1959, [ =( c, 'least_upper_bound'( c, b ) ) ] )
% 0.84/1.22 , clause( 44, [ =( 'least_upper_bound'( c, b ), c ) ] )
% 0.84/1.22 , 0, substitution( 0, [] )).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 paramod(
% 0.84/1.22 clause( 1960, [ =( c, 'least_upper_bound'( b, c ) ) ] )
% 0.84/1.22 , clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X )
% 0.84/1.22 ) ] )
% 0.84/1.22 , 0, clause( 1959, [ =( c, 'least_upper_bound'( c, b ) ) ] )
% 0.84/1.22 , 0, 2, substitution( 0, [ :=( X, c ), :=( Y, b )] ), substitution( 1, [] )
% 0.84/1.22 ).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 eqswap(
% 0.84/1.22 clause( 1963, [ =( 'least_upper_bound'( b, c ), c ) ] )
% 0.84/1.22 , clause( 1960, [ =( c, 'least_upper_bound'( b, c ) ) ] )
% 0.84/1.22 , 0, substitution( 0, [] )).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 subsumption(
% 0.84/1.22 clause( 48, [ =( 'least_upper_bound'( b, c ), c ) ] )
% 0.84/1.22 , clause( 1963, [ =( 'least_upper_bound'( b, c ), c ) ] )
% 0.84/1.22 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 eqswap(
% 0.84/1.22 clause( 1964, [ =( c, 'least_upper_bound'( c, a ) ) ] )
% 0.84/1.22 , clause( 45, [ =( 'least_upper_bound'( c, a ), c ) ] )
% 0.84/1.22 , 0, substitution( 0, [] )).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 paramod(
% 0.84/1.22 clause( 1965, [ =( c, 'least_upper_bound'( a, c ) ) ] )
% 0.84/1.22 , clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X )
% 0.84/1.22 ) ] )
% 0.84/1.22 , 0, clause( 1964, [ =( c, 'least_upper_bound'( c, a ) ) ] )
% 0.84/1.22 , 0, 2, substitution( 0, [ :=( X, c ), :=( Y, a )] ), substitution( 1, [] )
% 0.84/1.22 ).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 eqswap(
% 0.84/1.22 clause( 1968, [ =( 'least_upper_bound'( a, c ), c ) ] )
% 0.84/1.22 , clause( 1965, [ =( c, 'least_upper_bound'( a, c ) ) ] )
% 0.84/1.22 , 0, substitution( 0, [] )).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 subsumption(
% 0.84/1.22 clause( 49, [ =( 'least_upper_bound'( a, c ), c ) ] )
% 0.84/1.22 , clause( 1968, [ =( 'least_upper_bound'( a, c ), c ) ] )
% 0.84/1.22 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 eqswap(
% 0.84/1.22 clause( 1970, [ =( 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ),
% 0.84/1.22 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ) ) ] )
% 0.84/1.22 , clause( 6, [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.84/1.22 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.84/1.22 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 paramod(
% 0.84/1.22 clause( 1972, [ =( 'least_upper_bound'( 'least_upper_bound'( X, a ), c ),
% 0.84/1.22 'least_upper_bound'( X, c ) ) ] )
% 0.84/1.22 , clause( 49, [ =( 'least_upper_bound'( a, c ), c ) ] )
% 0.84/1.22 , 0, clause( 1970, [ =( 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z
% 0.84/1.22 ), 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ) ) ] )
% 0.84/1.22 , 0, 8, substitution( 0, [] ), substitution( 1, [ :=( X, X ), :=( Y, a ),
% 0.84/1.22 :=( Z, c )] )).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 subsumption(
% 0.84/1.22 clause( 60, [ =( 'least_upper_bound'( 'least_upper_bound'( X, a ), c ),
% 0.84/1.22 'least_upper_bound'( X, c ) ) ] )
% 0.84/1.22 , clause( 1972, [ =( 'least_upper_bound'( 'least_upper_bound'( X, a ), c )
% 0.84/1.22 , 'least_upper_bound'( X, c ) ) ] )
% 0.84/1.22 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 eqswap(
% 0.84/1.22 clause( 1976, [ =( X, 'greatest_lower_bound'( 'least_upper_bound'( X, Y ),
% 0.84/1.22 X ) ) ] )
% 0.84/1.22 , clause( 23, [ =( 'greatest_lower_bound'( 'least_upper_bound'( X, Y ), X )
% 0.84/1.22 , X ) ] )
% 0.84/1.22 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 paramod(
% 0.84/1.22 clause( 1977, [ =( 'least_upper_bound'( X, a ), 'greatest_lower_bound'(
% 0.84/1.22 'least_upper_bound'( X, c ), 'least_upper_bound'( X, a ) ) ) ] )
% 0.84/1.22 , clause( 60, [ =( 'least_upper_bound'( 'least_upper_bound'( X, a ), c ),
% 0.84/1.22 'least_upper_bound'( X, c ) ) ] )
% 0.84/1.22 , 0, clause( 1976, [ =( X, 'greatest_lower_bound'( 'least_upper_bound'( X,
% 0.84/1.22 Y ), X ) ) ] )
% 0.84/1.22 , 0, 5, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X,
% 0.84/1.22 'least_upper_bound'( X, a ) ), :=( Y, c )] )).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 eqswap(
% 0.84/1.22 clause( 1978, [ =( 'greatest_lower_bound'( 'least_upper_bound'( X, c ),
% 0.84/1.22 'least_upper_bound'( X, a ) ), 'least_upper_bound'( X, a ) ) ] )
% 0.84/1.22 , clause( 1977, [ =( 'least_upper_bound'( X, a ), 'greatest_lower_bound'(
% 0.84/1.22 'least_upper_bound'( X, c ), 'least_upper_bound'( X, a ) ) ) ] )
% 0.84/1.22 , 0, substitution( 0, [ :=( X, X )] )).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 subsumption(
% 0.84/1.22 clause( 93, [ =( 'greatest_lower_bound'( 'least_upper_bound'( X, c ),
% 0.84/1.22 'least_upper_bound'( X, a ) ), 'least_upper_bound'( X, a ) ) ] )
% 0.84/1.22 , clause( 1978, [ =( 'greatest_lower_bound'( 'least_upper_bound'( X, c ),
% 0.84/1.22 'least_upper_bound'( X, a ) ), 'least_upper_bound'( X, a ) ) ] )
% 0.84/1.22 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 eqswap(
% 0.84/1.22 clause( 1979, [ ~( =( 'least_upper_bound'( a, b ), 'greatest_lower_bound'(
% 0.84/1.22 'least_upper_bound'( a, b ), c ) ) ) ] )
% 0.84/1.22 , clause( 17, [ ~( =( 'greatest_lower_bound'( 'least_upper_bound'( a, b ),
% 0.84/1.22 c ), 'least_upper_bound'( a, b ) ) ) ] )
% 0.84/1.22 , 0, substitution( 0, [] )).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 paramod(
% 0.84/1.22 clause( 1980, [ ~( =( 'least_upper_bound'( a, b ), 'greatest_lower_bound'(
% 0.84/1.22 c, 'least_upper_bound'( a, b ) ) ) ) ] )
% 0.84/1.22 , clause( 3, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y
% 0.84/1.22 , X ) ) ] )
% 0.84/1.22 , 0, clause( 1979, [ ~( =( 'least_upper_bound'( a, b ),
% 0.84/1.22 'greatest_lower_bound'( 'least_upper_bound'( a, b ), c ) ) ) ] )
% 0.84/1.22 , 0, 5, substitution( 0, [ :=( X, 'least_upper_bound'( a, b ) ), :=( Y, c )] )
% 0.84/1.22 , substitution( 1, [] )).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 eqswap(
% 0.84/1.22 clause( 1983, [ ~( =( 'greatest_lower_bound'( c, 'least_upper_bound'( a, b
% 0.84/1.22 ) ), 'least_upper_bound'( a, b ) ) ) ] )
% 0.84/1.22 , clause( 1980, [ ~( =( 'least_upper_bound'( a, b ), 'greatest_lower_bound'(
% 0.84/1.22 c, 'least_upper_bound'( a, b ) ) ) ) ] )
% 0.84/1.22 , 0, substitution( 0, [] )).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 subsumption(
% 0.84/1.22 clause( 141, [ ~( =( 'greatest_lower_bound'( c, 'least_upper_bound'( a, b )
% 0.84/1.22 ), 'least_upper_bound'( a, b ) ) ) ] )
% 0.84/1.22 , clause( 1983, [ ~( =( 'greatest_lower_bound'( c, 'least_upper_bound'( a,
% 0.84/1.22 b ) ), 'least_upper_bound'( a, b ) ) ) ] )
% 0.84/1.22 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 eqswap(
% 0.84/1.22 clause( 1984, [ ~( =( 'least_upper_bound'( a, b ), 'greatest_lower_bound'(
% 0.84/1.22 c, 'least_upper_bound'( a, b ) ) ) ) ] )
% 0.84/1.22 , clause( 141, [ ~( =( 'greatest_lower_bound'( c, 'least_upper_bound'( a, b
% 0.84/1.22 ) ), 'least_upper_bound'( a, b ) ) ) ] )
% 0.84/1.22 , 0, substitution( 0, [] )).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 paramod(
% 0.84/1.22 clause( 1986, [ ~( =( 'least_upper_bound'( a, b ), 'greatest_lower_bound'(
% 0.84/1.22 c, 'least_upper_bound'( b, a ) ) ) ) ] )
% 0.84/1.22 , clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X )
% 0.84/1.22 ) ] )
% 0.84/1.22 , 0, clause( 1984, [ ~( =( 'least_upper_bound'( a, b ),
% 0.84/1.22 'greatest_lower_bound'( c, 'least_upper_bound'( a, b ) ) ) ) ] )
% 0.84/1.22 , 0, 7, substitution( 0, [ :=( X, a ), :=( Y, b )] ), substitution( 1, [] )
% 0.84/1.22 ).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 paramod(
% 0.84/1.22 clause( 1987, [ ~( =( 'least_upper_bound'( b, a ), 'greatest_lower_bound'(
% 0.84/1.22 c, 'least_upper_bound'( b, a ) ) ) ) ] )
% 0.84/1.22 , clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X )
% 0.84/1.22 ) ] )
% 0.84/1.22 , 0, clause( 1986, [ ~( =( 'least_upper_bound'( a, b ),
% 0.84/1.22 'greatest_lower_bound'( c, 'least_upper_bound'( b, a ) ) ) ) ] )
% 0.84/1.22 , 0, 2, substitution( 0, [ :=( X, a ), :=( Y, b )] ), substitution( 1, [] )
% 0.84/1.22 ).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 eqswap(
% 0.84/1.22 clause( 1990, [ ~( =( 'greatest_lower_bound'( c, 'least_upper_bound'( b, a
% 0.84/1.22 ) ), 'least_upper_bound'( b, a ) ) ) ] )
% 0.84/1.22 , clause( 1987, [ ~( =( 'least_upper_bound'( b, a ), 'greatest_lower_bound'(
% 0.84/1.22 c, 'least_upper_bound'( b, a ) ) ) ) ] )
% 0.84/1.22 , 0, substitution( 0, [] )).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 subsumption(
% 0.84/1.22 clause( 227, [ ~( =( 'greatest_lower_bound'( c, 'least_upper_bound'( b, a )
% 0.84/1.22 ), 'least_upper_bound'( b, a ) ) ) ] )
% 0.84/1.22 , clause( 1990, [ ~( =( 'greatest_lower_bound'( c, 'least_upper_bound'( b,
% 0.84/1.22 a ) ), 'least_upper_bound'( b, a ) ) ) ] )
% 0.84/1.22 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 eqswap(
% 0.84/1.22 clause( 1994, [ =( 'least_upper_bound'( X, a ), 'greatest_lower_bound'(
% 0.84/1.22 'least_upper_bound'( X, c ), 'least_upper_bound'( X, a ) ) ) ] )
% 0.84/1.22 , clause( 93, [ =( 'greatest_lower_bound'( 'least_upper_bound'( X, c ),
% 0.84/1.22 'least_upper_bound'( X, a ) ), 'least_upper_bound'( X, a ) ) ] )
% 0.84/1.22 , 0, substitution( 0, [ :=( X, X )] )).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 eqswap(
% 0.84/1.22 clause( 1995, [ ~( =( 'least_upper_bound'( b, a ), 'greatest_lower_bound'(
% 0.84/1.22 c, 'least_upper_bound'( b, a ) ) ) ) ] )
% 0.84/1.22 , clause( 227, [ ~( =( 'greatest_lower_bound'( c, 'least_upper_bound'( b, a
% 0.84/1.22 ) ), 'least_upper_bound'( b, a ) ) ) ] )
% 0.84/1.22 , 0, substitution( 0, [] )).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 paramod(
% 0.84/1.22 clause( 1996, [ =( 'least_upper_bound'( b, a ), 'greatest_lower_bound'( c,
% 0.84/1.22 'least_upper_bound'( b, a ) ) ) ] )
% 0.84/1.22 , clause( 48, [ =( 'least_upper_bound'( b, c ), c ) ] )
% 0.84/1.22 , 0, clause( 1994, [ =( 'least_upper_bound'( X, a ), 'greatest_lower_bound'(
% 0.84/1.22 'least_upper_bound'( X, c ), 'least_upper_bound'( X, a ) ) ) ] )
% 0.84/1.22 , 0, 5, substitution( 0, [] ), substitution( 1, [ :=( X, b )] )).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 resolution(
% 0.84/1.22 clause( 1997, [] )
% 0.84/1.22 , clause( 1995, [ ~( =( 'least_upper_bound'( b, a ), 'greatest_lower_bound'(
% 0.84/1.22 c, 'least_upper_bound'( b, a ) ) ) ) ] )
% 0.84/1.22 , 0, clause( 1996, [ =( 'least_upper_bound'( b, a ), 'greatest_lower_bound'(
% 0.84/1.22 c, 'least_upper_bound'( b, a ) ) ) ] )
% 0.84/1.22 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 subsumption(
% 0.84/1.22 clause( 1843, [] )
% 0.84/1.22 , clause( 1997, [] )
% 0.84/1.22 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 end.
% 0.84/1.22
% 0.84/1.22 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.84/1.22
% 0.84/1.22 Memory use:
% 0.84/1.22
% 0.84/1.22 space for terms: 24066
% 0.84/1.22 space for clauses: 198628
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 clauses generated: 25564
% 0.84/1.22 clauses kept: 1844
% 0.84/1.22 clauses selected: 243
% 0.84/1.22 clauses deleted: 14
% 0.84/1.22 clauses inuse deleted: 6
% 0.84/1.22
% 0.84/1.22 subsentry: 4285
% 0.84/1.22 literals s-matched: 3895
% 0.84/1.22 literals matched: 3895
% 0.84/1.22 full subsumption: 0
% 0.84/1.22
% 0.84/1.22 checksum: 910775652
% 0.84/1.22
% 0.84/1.22
% 0.84/1.22 Bliksem ended
%------------------------------------------------------------------------------