TSTP Solution File: GRP172-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : GRP172-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n011.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:46 EDT 2022
% Result : Unsatisfiable 0.72s 1.12s
% Output : Refutation 0.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.07 % Problem : GRP172-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.07 % Command : bliksem %s
% 0.06/0.26 % Computer : n011.cluster.edu
% 0.06/0.26 % Model : x86_64 x86_64
% 0.06/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.26 % Memory : 8042.1875MB
% 0.06/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.26 % CPULimit : 300
% 0.06/0.26 % DateTime : Tue Jun 14 13:39:19 EDT 2022
% 0.06/0.26 % CPUTime :
% 0.72/1.12 *** allocated 10000 integers for termspace/termends
% 0.72/1.12 *** allocated 10000 integers for clauses
% 0.72/1.12 *** allocated 10000 integers for justifications
% 0.72/1.12 Bliksem 1.12
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 Automatic Strategy Selection
% 0.72/1.12
% 0.72/1.12 Clauses:
% 0.72/1.12 [
% 0.72/1.12 [ =( multiply( identity, X ), X ) ],
% 0.72/1.12 [ =( multiply( inverse( X ), X ), identity ) ],
% 0.72/1.12 [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply( Y, Z ) ) )
% 0.72/1.12 ],
% 0.72/1.12 [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y, X ) ) ]
% 0.72/1.12 ,
% 0.72/1.12 [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X ) ) ],
% 0.72/1.12 [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.72/1.12 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ],
% 0.72/1.12 [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.72/1.12 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ],
% 0.72/1.12 [ =( 'least_upper_bound'( X, X ), X ) ],
% 0.72/1.12 [ =( 'greatest_lower_bound'( X, X ), X ) ],
% 0.72/1.12 [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) ), X ) ]
% 0.72/1.12 ,
% 0.72/1.12 [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) ), X ) ]
% 0.72/1.12 ,
% 0.72/1.12 [ =( multiply( X, 'least_upper_bound'( Y, Z ) ), 'least_upper_bound'(
% 0.72/1.12 multiply( X, Y ), multiply( X, Z ) ) ) ],
% 0.72/1.12 [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.72/1.12 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ],
% 0.72/1.12 [ =( multiply( 'least_upper_bound'( X, Y ), Z ), 'least_upper_bound'(
% 0.72/1.12 multiply( X, Z ), multiply( Y, Z ) ) ) ],
% 0.72/1.12 [ =( multiply( 'greatest_lower_bound'( X, Y ), Z ),
% 0.72/1.12 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ],
% 0.72/1.12 [ =( 'greatest_lower_bound'( identity, a ), identity ) ],
% 0.72/1.12 [ =( 'greatest_lower_bound'( identity, b ), identity ) ],
% 0.72/1.12 [ ~( =( 'greatest_lower_bound'( identity, multiply( a, b ) ), identity )
% 0.72/1.12 ) ]
% 0.72/1.12 ] .
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 percentage equality = 1.000000, percentage horn = 1.000000
% 0.72/1.12 This is a pure equality problem
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 Options Used:
% 0.72/1.12
% 0.72/1.12 useres = 1
% 0.72/1.12 useparamod = 1
% 0.72/1.12 useeqrefl = 1
% 0.72/1.12 useeqfact = 1
% 0.72/1.12 usefactor = 1
% 0.72/1.12 usesimpsplitting = 0
% 0.72/1.12 usesimpdemod = 5
% 0.72/1.12 usesimpres = 3
% 0.72/1.12
% 0.72/1.12 resimpinuse = 1000
% 0.72/1.12 resimpclauses = 20000
% 0.72/1.12 substype = eqrewr
% 0.72/1.12 backwardsubs = 1
% 0.72/1.12 selectoldest = 5
% 0.72/1.12
% 0.72/1.12 litorderings [0] = split
% 0.72/1.12 litorderings [1] = extend the termordering, first sorting on arguments
% 0.72/1.12
% 0.72/1.12 termordering = kbo
% 0.72/1.12
% 0.72/1.12 litapriori = 0
% 0.72/1.12 termapriori = 1
% 0.72/1.12 litaposteriori = 0
% 0.72/1.12 termaposteriori = 0
% 0.72/1.12 demodaposteriori = 0
% 0.72/1.12 ordereqreflfact = 0
% 0.72/1.12
% 0.72/1.12 litselect = negord
% 0.72/1.12
% 0.72/1.12 maxweight = 15
% 0.72/1.12 maxdepth = 30000
% 0.72/1.12 maxlength = 115
% 0.72/1.12 maxnrvars = 195
% 0.72/1.12 excuselevel = 1
% 0.72/1.12 increasemaxweight = 1
% 0.72/1.12
% 0.72/1.12 maxselected = 10000000
% 0.72/1.12 maxnrclauses = 10000000
% 0.72/1.12
% 0.72/1.12 showgenerated = 0
% 0.72/1.12 showkept = 0
% 0.72/1.12 showselected = 0
% 0.72/1.12 showdeleted = 0
% 0.72/1.12 showresimp = 1
% 0.72/1.12 showstatus = 2000
% 0.72/1.12
% 0.72/1.12 prologoutput = 1
% 0.72/1.12 nrgoals = 5000000
% 0.72/1.12 totalproof = 1
% 0.72/1.12
% 0.72/1.12 Symbols occurring in the translation:
% 0.72/1.12
% 0.72/1.12 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.72/1.12 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.72/1.12 ! [4, 1] (w:0, o:15, a:1, s:1, b:0),
% 0.72/1.12 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.72/1.12 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.72/1.12 identity [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.72/1.12 multiply [41, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.72/1.12 inverse [42, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.72/1.12 'greatest_lower_bound' [45, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.72/1.12 'least_upper_bound' [46, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.72/1.12 a [47, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.72/1.12 b [48, 0] (w:1, o:14, a:1, s:1, b:0).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 Starting Search:
% 0.72/1.12
% 0.72/1.12 Resimplifying inuse:
% 0.72/1.12 Done
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 Bliksems!, er is een bewijs:
% 0.72/1.12 % SZS status Unsatisfiable
% 0.72/1.12 % SZS output start Refutation
% 0.72/1.12
% 0.72/1.12 clause( 0, [ =( multiply( identity, X ), X ) ] )
% 0.72/1.12 .
% 0.72/1.12 clause( 1, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.72/1.12 .
% 0.72/1.12 clause( 2, [ =( multiply( X, multiply( Y, Z ) ), multiply( multiply( X, Y )
% 0.72/1.12 , Z ) ) ] )
% 0.72/1.12 .
% 0.72/1.12 clause( 3, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y,
% 0.72/1.12 X ) ) ] )
% 0.72/1.12 .
% 0.72/1.12 clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X ) )
% 0.72/1.12 ] )
% 0.72/1.12 .
% 0.72/1.12 clause( 5, [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z ) )
% 0.72/1.12 , 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.72/1.12 .
% 0.72/1.12 clause( 6, [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.72/1.12 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.72/1.12 .
% 0.72/1.12 clause( 9, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) ), X
% 0.72/1.12 ) ] )
% 0.72/1.12 .
% 0.72/1.12 clause( 10, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) ),
% 0.72/1.12 X ) ] )
% 0.72/1.12 .
% 0.72/1.12 clause( 12, [ =( 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z )
% 0.72/1.12 ), multiply( X, 'greatest_lower_bound'( Y, Z ) ) ) ] )
% 0.72/1.12 .
% 0.72/1.12 clause( 15, [ =( 'greatest_lower_bound'( identity, a ), identity ) ] )
% 0.72/1.12 .
% 0.72/1.12 clause( 16, [ =( 'greatest_lower_bound'( identity, b ), identity ) ] )
% 0.72/1.12 .
% 0.72/1.12 clause( 17, [ ~( =( 'greatest_lower_bound'( identity, multiply( a, b ) ),
% 0.72/1.12 identity ) ) ] )
% 0.72/1.12 .
% 0.72/1.12 clause( 18, [ =( 'greatest_lower_bound'( a, identity ), identity ) ] )
% 0.72/1.12 .
% 0.72/1.12 clause( 21, [ =( multiply( multiply( Y, inverse( X ) ), X ), multiply( Y,
% 0.72/1.12 identity ) ) ] )
% 0.72/1.12 .
% 0.72/1.12 clause( 22, [ =( multiply( multiply( Y, identity ), X ), multiply( Y, X ) )
% 0.72/1.12 ] )
% 0.72/1.12 .
% 0.72/1.12 clause( 23, [ =( 'greatest_lower_bound'( 'least_upper_bound'( X, Y ), X ),
% 0.72/1.12 X ) ] )
% 0.72/1.12 .
% 0.72/1.12 clause( 25, [ =( 'greatest_lower_bound'( 'least_upper_bound'( Y, X ), X ),
% 0.72/1.12 X ) ] )
% 0.72/1.12 .
% 0.72/1.12 clause( 43, [ =( 'least_upper_bound'( 'least_upper_bound'( X, Y ), X ),
% 0.72/1.12 'least_upper_bound'( X, Y ) ) ] )
% 0.72/1.12 .
% 0.72/1.12 clause( 45, [ =( 'least_upper_bound'( a, identity ), a ) ] )
% 0.72/1.12 .
% 0.72/1.12 clause( 47, [ =( 'least_upper_bound'( 'greatest_lower_bound'( X, Y ), X ),
% 0.72/1.12 X ) ] )
% 0.72/1.12 .
% 0.72/1.12 clause( 49, [ =( 'least_upper_bound'( identity, a ), a ) ] )
% 0.72/1.12 .
% 0.72/1.12 clause( 60, [ =( 'least_upper_bound'( 'least_upper_bound'( X, identity ), a
% 0.72/1.12 ), 'least_upper_bound'( X, a ) ) ] )
% 0.72/1.12 .
% 0.72/1.12 clause( 76, [ ~( =( 'greatest_lower_bound'( multiply( a, b ), identity ),
% 0.72/1.12 identity ) ) ] )
% 0.72/1.12 .
% 0.72/1.12 clause( 102, [ =( 'least_upper_bound'( 'greatest_lower_bound'( identity, X
% 0.72/1.12 ), a ), a ) ] )
% 0.72/1.12 .
% 0.72/1.12 clause( 108, [ =( 'least_upper_bound'( a, 'greatest_lower_bound'( identity
% 0.72/1.12 , X ) ), a ) ] )
% 0.72/1.12 .
% 0.72/1.12 clause( 114, [ =( 'least_upper_bound'( a, 'greatest_lower_bound'( X,
% 0.72/1.12 identity ) ), a ) ] )
% 0.72/1.12 .
% 0.72/1.12 clause( 116, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( a, X ),
% 0.72/1.12 identity ), 'greatest_lower_bound'( X, identity ) ) ] )
% 0.72/1.12 .
% 0.72/1.12 clause( 153, [ =( multiply( inverse( inverse( X ) ), identity ), X ) ] )
% 0.72/1.12 .
% 0.72/1.12 clause( 158, [ =( multiply( inverse( inverse( X ) ), Y ), multiply( X, Y )
% 0.72/1.12 ) ] )
% 0.72/1.12 .
% 0.72/1.12 clause( 159, [ =( 'greatest_lower_bound'( X, multiply( X, Y ) ), multiply(
% 0.72/1.12 X, 'greatest_lower_bound'( identity, Y ) ) ) ] )
% 0.72/1.12 .
% 0.72/1.12 clause( 417, [ =( multiply( X, identity ), X ) ] )
% 0.72/1.12 .
% 0.72/1.12 clause( 1018, [ =( 'greatest_lower_bound'( X, multiply( X, b ) ), X ) ] )
% 0.72/1.12 .
% 0.72/1.12 clause( 1302, [ =( 'greatest_lower_bound'( multiply( a, b ), identity ),
% 0.72/1.12 identity ) ] )
% 0.72/1.12 .
% 0.72/1.12 clause( 1325, [] )
% 0.72/1.12 .
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 % SZS output end Refutation
% 0.72/1.12 found a proof!
% 0.72/1.12
% 0.72/1.12 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.72/1.12
% 0.72/1.12 initialclauses(
% 0.72/1.12 [ clause( 1327, [ =( multiply( identity, X ), X ) ] )
% 0.72/1.12 , clause( 1328, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.72/1.12 , clause( 1329, [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply(
% 0.72/1.12 Y, Z ) ) ) ] )
% 0.72/1.12 , clause( 1330, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'(
% 0.72/1.12 Y, X ) ) ] )
% 0.72/1.12 , clause( 1331, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X
% 0.72/1.12 ) ) ] )
% 0.72/1.12 , clause( 1332, [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y,
% 0.72/1.12 Z ) ), 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.72/1.12 , clause( 1333, [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) )
% 0.72/1.12 , 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.72/1.12 , clause( 1334, [ =( 'least_upper_bound'( X, X ), X ) ] )
% 0.72/1.12 , clause( 1335, [ =( 'greatest_lower_bound'( X, X ), X ) ] )
% 0.72/1.12 , clause( 1336, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y )
% 0.72/1.12 ), X ) ] )
% 0.72/1.12 , clause( 1337, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y )
% 0.72/1.12 ), X ) ] )
% 0.72/1.12 , clause( 1338, [ =( multiply( X, 'least_upper_bound'( Y, Z ) ),
% 0.72/1.12 'least_upper_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.72/1.12 , clause( 1339, [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.72/1.12 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.72/1.12 , clause( 1340, [ =( multiply( 'least_upper_bound'( X, Y ), Z ),
% 0.72/1.12 'least_upper_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.72/1.12 , clause( 1341, [ =( multiply( 'greatest_lower_bound'( X, Y ), Z ),
% 0.72/1.12 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.72/1.12 , clause( 1342, [ =( 'greatest_lower_bound'( identity, a ), identity ) ] )
% 0.72/1.12 , clause( 1343, [ =( 'greatest_lower_bound'( identity, b ), identity ) ] )
% 0.72/1.12 , clause( 1344, [ ~( =( 'greatest_lower_bound'( identity, multiply( a, b )
% 0.72/1.12 ), identity ) ) ] )
% 0.72/1.12 ] ).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 subsumption(
% 0.72/1.12 clause( 0, [ =( multiply( identity, X ), X ) ] )
% 0.72/1.12 , clause( 1327, [ =( multiply( identity, X ), X ) ] )
% 0.72/1.12 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 subsumption(
% 0.72/1.12 clause( 1, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.72/1.12 , clause( 1328, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.72/1.12 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 eqswap(
% 0.72/1.12 clause( 1350, [ =( multiply( X, multiply( Y, Z ) ), multiply( multiply( X,
% 0.72/1.12 Y ), Z ) ) ] )
% 0.72/1.12 , clause( 1329, [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply(
% 0.72/1.12 Y, Z ) ) ) ] )
% 0.72/1.12 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 subsumption(
% 0.72/1.12 clause( 2, [ =( multiply( X, multiply( Y, Z ) ), multiply( multiply( X, Y )
% 0.72/1.12 , Z ) ) ] )
% 0.72/1.12 , clause( 1350, [ =( multiply( X, multiply( Y, Z ) ), multiply( multiply( X
% 0.72/1.12 , Y ), Z ) ) ] )
% 0.72/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.72/1.12 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 subsumption(
% 0.72/1.12 clause( 3, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y,
% 0.72/1.12 X ) ) ] )
% 0.72/1.12 , clause( 1330, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'(
% 0.72/1.12 Y, X ) ) ] )
% 0.72/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.72/1.12 )] ) ).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 subsumption(
% 0.72/1.12 clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X ) )
% 0.72/1.12 ] )
% 0.72/1.12 , clause( 1331, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X
% 0.72/1.12 ) ) ] )
% 0.72/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.72/1.12 )] ) ).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 subsumption(
% 0.72/1.12 clause( 5, [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z ) )
% 0.72/1.12 , 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.72/1.12 , clause( 1332, [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y,
% 0.72/1.12 Z ) ), 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.72/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.72/1.12 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 subsumption(
% 0.72/1.12 clause( 6, [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.72/1.12 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.72/1.12 , clause( 1333, [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) )
% 0.72/1.12 , 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.72/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.72/1.12 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 subsumption(
% 0.72/1.12 clause( 9, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) ), X
% 0.72/1.12 ) ] )
% 0.72/1.12 , clause( 1336, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y )
% 0.72/1.12 ), X ) ] )
% 0.72/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.72/1.12 )] ) ).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 subsumption(
% 0.72/1.12 clause( 10, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) ),
% 0.72/1.12 X ) ] )
% 0.72/1.12 , clause( 1337, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y )
% 0.72/1.12 ), X ) ] )
% 0.72/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.72/1.12 )] ) ).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 eqswap(
% 0.72/1.12 clause( 1393, [ =( 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z
% 0.72/1.12 ) ), multiply( X, 'greatest_lower_bound'( Y, Z ) ) ) ] )
% 0.72/1.12 , clause( 1339, [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.72/1.12 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.72/1.12 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 subsumption(
% 0.72/1.12 clause( 12, [ =( 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z )
% 0.72/1.12 ), multiply( X, 'greatest_lower_bound'( Y, Z ) ) ) ] )
% 0.72/1.12 , clause( 1393, [ =( 'greatest_lower_bound'( multiply( X, Y ), multiply( X
% 0.72/1.12 , Z ) ), multiply( X, 'greatest_lower_bound'( Y, Z ) ) ) ] )
% 0.72/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.72/1.12 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 subsumption(
% 0.72/1.12 clause( 15, [ =( 'greatest_lower_bound'( identity, a ), identity ) ] )
% 0.72/1.12 , clause( 1342, [ =( 'greatest_lower_bound'( identity, a ), identity ) ] )
% 0.72/1.12 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 subsumption(
% 0.72/1.12 clause( 16, [ =( 'greatest_lower_bound'( identity, b ), identity ) ] )
% 0.72/1.12 , clause( 1343, [ =( 'greatest_lower_bound'( identity, b ), identity ) ] )
% 0.72/1.12 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 subsumption(
% 0.72/1.12 clause( 17, [ ~( =( 'greatest_lower_bound'( identity, multiply( a, b ) ),
% 0.72/1.12 identity ) ) ] )
% 0.72/1.12 , clause( 1344, [ ~( =( 'greatest_lower_bound'( identity, multiply( a, b )
% 0.72/1.12 ), identity ) ) ] )
% 0.72/1.12 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 eqswap(
% 0.72/1.12 clause( 1439, [ =( identity, 'greatest_lower_bound'( identity, a ) ) ] )
% 0.72/1.12 , clause( 15, [ =( 'greatest_lower_bound'( identity, a ), identity ) ] )
% 0.72/1.12 , 0, substitution( 0, [] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 paramod(
% 0.72/1.12 clause( 1440, [ =( identity, 'greatest_lower_bound'( a, identity ) ) ] )
% 0.72/1.12 , clause( 3, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y
% 0.72/1.12 , X ) ) ] )
% 0.72/1.12 , 0, clause( 1439, [ =( identity, 'greatest_lower_bound'( identity, a ) ) ]
% 0.72/1.12 )
% 0.72/1.12 , 0, 2, substitution( 0, [ :=( X, identity ), :=( Y, a )] ), substitution(
% 0.72/1.12 1, [] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 eqswap(
% 0.72/1.12 clause( 1443, [ =( 'greatest_lower_bound'( a, identity ), identity ) ] )
% 0.72/1.12 , clause( 1440, [ =( identity, 'greatest_lower_bound'( a, identity ) ) ] )
% 0.72/1.12 , 0, substitution( 0, [] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 subsumption(
% 0.72/1.12 clause( 18, [ =( 'greatest_lower_bound'( a, identity ), identity ) ] )
% 0.72/1.12 , clause( 1443, [ =( 'greatest_lower_bound'( a, identity ), identity ) ] )
% 0.72/1.12 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 eqswap(
% 0.72/1.12 clause( 1445, [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply(
% 0.72/1.12 Y, Z ) ) ) ] )
% 0.72/1.12 , clause( 2, [ =( multiply( X, multiply( Y, Z ) ), multiply( multiply( X, Y
% 0.72/1.12 ), Z ) ) ] )
% 0.72/1.12 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 paramod(
% 0.72/1.12 clause( 1450, [ =( multiply( multiply( X, inverse( Y ) ), Y ), multiply( X
% 0.72/1.12 , identity ) ) ] )
% 0.72/1.12 , clause( 1, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.72/1.12 , 0, clause( 1445, [ =( multiply( multiply( X, Y ), Z ), multiply( X,
% 0.72/1.12 multiply( Y, Z ) ) ) ] )
% 0.72/1.12 , 0, 9, substitution( 0, [ :=( X, Y )] ), substitution( 1, [ :=( X, X ),
% 0.72/1.12 :=( Y, inverse( Y ) ), :=( Z, Y )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 subsumption(
% 0.72/1.12 clause( 21, [ =( multiply( multiply( Y, inverse( X ) ), X ), multiply( Y,
% 0.72/1.12 identity ) ) ] )
% 0.72/1.12 , clause( 1450, [ =( multiply( multiply( X, inverse( Y ) ), Y ), multiply(
% 0.72/1.12 X, identity ) ) ] )
% 0.72/1.12 , substitution( 0, [ :=( X, Y ), :=( Y, X )] ), permutation( 0, [ ==>( 0, 0
% 0.72/1.12 )] ) ).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 eqswap(
% 0.72/1.12 clause( 1455, [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply(
% 0.72/1.12 Y, Z ) ) ) ] )
% 0.72/1.12 , clause( 2, [ =( multiply( X, multiply( Y, Z ) ), multiply( multiply( X, Y
% 0.72/1.12 ), Z ) ) ] )
% 0.72/1.12 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 paramod(
% 0.72/1.12 clause( 1460, [ =( multiply( multiply( X, identity ), Y ), multiply( X, Y )
% 0.72/1.12 ) ] )
% 0.72/1.12 , clause( 0, [ =( multiply( identity, X ), X ) ] )
% 0.72/1.12 , 0, clause( 1455, [ =( multiply( multiply( X, Y ), Z ), multiply( X,
% 0.72/1.12 multiply( Y, Z ) ) ) ] )
% 0.72/1.12 , 0, 8, substitution( 0, [ :=( X, Y )] ), substitution( 1, [ :=( X, X ),
% 0.72/1.12 :=( Y, identity ), :=( Z, Y )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 subsumption(
% 0.72/1.12 clause( 22, [ =( multiply( multiply( Y, identity ), X ), multiply( Y, X ) )
% 0.72/1.12 ] )
% 0.72/1.12 , clause( 1460, [ =( multiply( multiply( X, identity ), Y ), multiply( X, Y
% 0.72/1.12 ) ) ] )
% 0.72/1.12 , substitution( 0, [ :=( X, Y ), :=( Y, X )] ), permutation( 0, [ ==>( 0, 0
% 0.72/1.12 )] ) ).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 eqswap(
% 0.72/1.12 clause( 1465, [ =( X, 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y
% 0.72/1.12 ) ) ) ] )
% 0.72/1.12 , clause( 10, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) )
% 0.72/1.12 , X ) ] )
% 0.72/1.12 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 paramod(
% 0.72/1.12 clause( 1466, [ =( X, 'greatest_lower_bound'( 'least_upper_bound'( X, Y ),
% 0.72/1.12 X ) ) ] )
% 0.72/1.12 , clause( 3, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y
% 0.72/1.12 , X ) ) ] )
% 0.72/1.12 , 0, clause( 1465, [ =( X, 'greatest_lower_bound'( X, 'least_upper_bound'(
% 0.72/1.12 X, Y ) ) ) ] )
% 0.72/1.12 , 0, 2, substitution( 0, [ :=( X, X ), :=( Y, 'least_upper_bound'( X, Y ) )] )
% 0.72/1.12 , substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 eqswap(
% 0.72/1.12 clause( 1469, [ =( 'greatest_lower_bound'( 'least_upper_bound'( X, Y ), X )
% 0.72/1.12 , X ) ] )
% 0.72/1.12 , clause( 1466, [ =( X, 'greatest_lower_bound'( 'least_upper_bound'( X, Y )
% 0.72/1.12 , X ) ) ] )
% 0.72/1.12 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 subsumption(
% 0.72/1.12 clause( 23, [ =( 'greatest_lower_bound'( 'least_upper_bound'( X, Y ), X ),
% 0.72/1.12 X ) ] )
% 0.72/1.12 , clause( 1469, [ =( 'greatest_lower_bound'( 'least_upper_bound'( X, Y ), X
% 0.72/1.12 ), X ) ] )
% 0.72/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.72/1.12 )] ) ).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 eqswap(
% 0.72/1.12 clause( 1470, [ =( X, 'greatest_lower_bound'( 'least_upper_bound'( X, Y ),
% 0.72/1.12 X ) ) ] )
% 0.72/1.12 , clause( 23, [ =( 'greatest_lower_bound'( 'least_upper_bound'( X, Y ), X )
% 0.72/1.12 , X ) ] )
% 0.72/1.12 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 paramod(
% 0.72/1.12 clause( 1471, [ =( X, 'greatest_lower_bound'( 'least_upper_bound'( Y, X ),
% 0.72/1.12 X ) ) ] )
% 0.72/1.12 , clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X )
% 0.72/1.12 ) ] )
% 0.72/1.12 , 0, clause( 1470, [ =( X, 'greatest_lower_bound'( 'least_upper_bound'( X,
% 0.72/1.12 Y ), X ) ) ] )
% 0.72/1.12 , 0, 3, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [
% 0.72/1.12 :=( X, X ), :=( Y, Y )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 eqswap(
% 0.72/1.12 clause( 1474, [ =( 'greatest_lower_bound'( 'least_upper_bound'( Y, X ), X )
% 0.72/1.12 , X ) ] )
% 0.72/1.12 , clause( 1471, [ =( X, 'greatest_lower_bound'( 'least_upper_bound'( Y, X )
% 0.72/1.12 , X ) ) ] )
% 0.72/1.12 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 subsumption(
% 0.72/1.12 clause( 25, [ =( 'greatest_lower_bound'( 'least_upper_bound'( Y, X ), X ),
% 0.72/1.12 X ) ] )
% 0.72/1.12 , clause( 1474, [ =( 'greatest_lower_bound'( 'least_upper_bound'( Y, X ), X
% 0.72/1.12 ), X ) ] )
% 0.72/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.72/1.12 )] ) ).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 eqswap(
% 0.72/1.12 clause( 1476, [ =( X, 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y
% 0.72/1.12 ) ) ) ] )
% 0.72/1.12 , clause( 9, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) )
% 0.72/1.12 , X ) ] )
% 0.72/1.12 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 paramod(
% 0.72/1.12 clause( 1479, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'(
% 0.72/1.12 'least_upper_bound'( X, Y ), X ) ) ] )
% 0.72/1.12 , clause( 23, [ =( 'greatest_lower_bound'( 'least_upper_bound'( X, Y ), X )
% 0.72/1.12 , X ) ] )
% 0.72/1.12 , 0, clause( 1476, [ =( X, 'least_upper_bound'( X, 'greatest_lower_bound'(
% 0.72/1.12 X, Y ) ) ) ] )
% 0.72/1.12 , 0, 8, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [
% 0.72/1.12 :=( X, 'least_upper_bound'( X, Y ) ), :=( Y, X )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 eqswap(
% 0.72/1.12 clause( 1480, [ =( 'least_upper_bound'( 'least_upper_bound'( X, Y ), X ),
% 0.72/1.12 'least_upper_bound'( X, Y ) ) ] )
% 0.72/1.12 , clause( 1479, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'(
% 0.72/1.12 'least_upper_bound'( X, Y ), X ) ) ] )
% 0.72/1.12 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 subsumption(
% 0.72/1.12 clause( 43, [ =( 'least_upper_bound'( 'least_upper_bound'( X, Y ), X ),
% 0.72/1.12 'least_upper_bound'( X, Y ) ) ] )
% 0.72/1.12 , clause( 1480, [ =( 'least_upper_bound'( 'least_upper_bound'( X, Y ), X )
% 0.72/1.12 , 'least_upper_bound'( X, Y ) ) ] )
% 0.72/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.72/1.12 )] ) ).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 eqswap(
% 0.72/1.12 clause( 1482, [ =( X, 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y
% 0.72/1.12 ) ) ) ] )
% 0.72/1.12 , clause( 9, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) )
% 0.72/1.12 , X ) ] )
% 0.72/1.12 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 paramod(
% 0.72/1.12 clause( 1483, [ =( a, 'least_upper_bound'( a, identity ) ) ] )
% 0.72/1.12 , clause( 18, [ =( 'greatest_lower_bound'( a, identity ), identity ) ] )
% 0.72/1.12 , 0, clause( 1482, [ =( X, 'least_upper_bound'( X, 'greatest_lower_bound'(
% 0.72/1.12 X, Y ) ) ) ] )
% 0.72/1.12 , 0, 4, substitution( 0, [] ), substitution( 1, [ :=( X, a ), :=( Y,
% 0.72/1.12 identity )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 eqswap(
% 0.72/1.12 clause( 1484, [ =( 'least_upper_bound'( a, identity ), a ) ] )
% 0.72/1.12 , clause( 1483, [ =( a, 'least_upper_bound'( a, identity ) ) ] )
% 0.72/1.12 , 0, substitution( 0, [] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 subsumption(
% 0.72/1.12 clause( 45, [ =( 'least_upper_bound'( a, identity ), a ) ] )
% 0.72/1.12 , clause( 1484, [ =( 'least_upper_bound'( a, identity ), a ) ] )
% 0.72/1.12 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 eqswap(
% 0.72/1.12 clause( 1485, [ =( X, 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y
% 0.72/1.12 ) ) ) ] )
% 0.72/1.12 , clause( 9, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) )
% 0.72/1.12 , X ) ] )
% 0.72/1.12 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 paramod(
% 0.72/1.12 clause( 1486, [ =( X, 'least_upper_bound'( 'greatest_lower_bound'( X, Y ),
% 0.72/1.12 X ) ) ] )
% 0.72/1.12 , clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X )
% 0.72/1.12 ) ] )
% 0.72/1.12 , 0, clause( 1485, [ =( X, 'least_upper_bound'( X, 'greatest_lower_bound'(
% 0.72/1.12 X, Y ) ) ) ] )
% 0.72/1.12 , 0, 2, substitution( 0, [ :=( X, X ), :=( Y, 'greatest_lower_bound'( X, Y
% 0.72/1.12 ) )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 eqswap(
% 0.72/1.12 clause( 1489, [ =( 'least_upper_bound'( 'greatest_lower_bound'( X, Y ), X )
% 0.72/1.12 , X ) ] )
% 0.72/1.12 , clause( 1486, [ =( X, 'least_upper_bound'( 'greatest_lower_bound'( X, Y )
% 0.72/1.12 , X ) ) ] )
% 0.72/1.12 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 subsumption(
% 0.72/1.12 clause( 47, [ =( 'least_upper_bound'( 'greatest_lower_bound'( X, Y ), X ),
% 0.72/1.12 X ) ] )
% 0.72/1.12 , clause( 1489, [ =( 'least_upper_bound'( 'greatest_lower_bound'( X, Y ), X
% 0.72/1.12 ), X ) ] )
% 0.72/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.72/1.12 )] ) ).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 eqswap(
% 0.72/1.12 clause( 1490, [ =( a, 'least_upper_bound'( a, identity ) ) ] )
% 0.72/1.12 , clause( 45, [ =( 'least_upper_bound'( a, identity ), a ) ] )
% 0.72/1.12 , 0, substitution( 0, [] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 paramod(
% 0.72/1.12 clause( 1491, [ =( a, 'least_upper_bound'( identity, a ) ) ] )
% 0.72/1.12 , clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X )
% 0.72/1.12 ) ] )
% 0.72/1.12 , 0, clause( 1490, [ =( a, 'least_upper_bound'( a, identity ) ) ] )
% 0.72/1.12 , 0, 2, substitution( 0, [ :=( X, a ), :=( Y, identity )] ), substitution(
% 0.72/1.12 1, [] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 eqswap(
% 0.72/1.12 clause( 1494, [ =( 'least_upper_bound'( identity, a ), a ) ] )
% 0.72/1.12 , clause( 1491, [ =( a, 'least_upper_bound'( identity, a ) ) ] )
% 0.72/1.12 , 0, substitution( 0, [] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 subsumption(
% 0.72/1.12 clause( 49, [ =( 'least_upper_bound'( identity, a ), a ) ] )
% 0.72/1.12 , clause( 1494, [ =( 'least_upper_bound'( identity, a ), a ) ] )
% 0.72/1.12 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 eqswap(
% 0.72/1.12 clause( 1496, [ =( 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ),
% 0.72/1.12 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ) ) ] )
% 0.72/1.12 , clause( 6, [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.72/1.12 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.72/1.12 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 paramod(
% 0.72/1.12 clause( 1498, [ =( 'least_upper_bound'( 'least_upper_bound'( X, identity )
% 0.72/1.12 , a ), 'least_upper_bound'( X, a ) ) ] )
% 0.72/1.12 , clause( 49, [ =( 'least_upper_bound'( identity, a ), a ) ] )
% 0.72/1.12 , 0, clause( 1496, [ =( 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z
% 0.72/1.12 ), 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ) ) ] )
% 0.72/1.12 , 0, 8, substitution( 0, [] ), substitution( 1, [ :=( X, X ), :=( Y,
% 0.72/1.12 identity ), :=( Z, a )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 subsumption(
% 0.72/1.12 clause( 60, [ =( 'least_upper_bound'( 'least_upper_bound'( X, identity ), a
% 0.72/1.12 ), 'least_upper_bound'( X, a ) ) ] )
% 0.72/1.12 , clause( 1498, [ =( 'least_upper_bound'( 'least_upper_bound'( X, identity
% 0.72/1.12 ), a ), 'least_upper_bound'( X, a ) ) ] )
% 0.72/1.12 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 eqswap(
% 0.72/1.12 clause( 1501, [ ~( =( identity, 'greatest_lower_bound'( identity, multiply(
% 0.72/1.12 a, b ) ) ) ) ] )
% 0.72/1.12 , clause( 17, [ ~( =( 'greatest_lower_bound'( identity, multiply( a, b ) )
% 0.72/1.12 , identity ) ) ] )
% 0.72/1.12 , 0, substitution( 0, [] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 paramod(
% 0.72/1.12 clause( 1502, [ ~( =( identity, 'greatest_lower_bound'( multiply( a, b ),
% 0.72/1.12 identity ) ) ) ] )
% 0.72/1.12 , clause( 3, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y
% 0.72/1.12 , X ) ) ] )
% 0.72/1.12 , 0, clause( 1501, [ ~( =( identity, 'greatest_lower_bound'( identity,
% 0.72/1.12 multiply( a, b ) ) ) ) ] )
% 0.72/1.12 , 0, 3, substitution( 0, [ :=( X, identity ), :=( Y, multiply( a, b ) )] )
% 0.72/1.12 , substitution( 1, [] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 eqswap(
% 0.72/1.12 clause( 1505, [ ~( =( 'greatest_lower_bound'( multiply( a, b ), identity )
% 0.72/1.12 , identity ) ) ] )
% 0.72/1.12 , clause( 1502, [ ~( =( identity, 'greatest_lower_bound'( multiply( a, b )
% 0.72/1.12 , identity ) ) ) ] )
% 0.72/1.12 , 0, substitution( 0, [] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 subsumption(
% 0.72/1.12 clause( 76, [ ~( =( 'greatest_lower_bound'( multiply( a, b ), identity ),
% 0.72/1.12 identity ) ) ] )
% 0.72/1.12 , clause( 1505, [ ~( =( 'greatest_lower_bound'( multiply( a, b ), identity
% 0.72/1.12 ), identity ) ) ] )
% 0.72/1.12 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 eqswap(
% 0.72/1.12 clause( 1507, [ =( 'least_upper_bound'( X, a ), 'least_upper_bound'(
% 0.72/1.12 'least_upper_bound'( X, identity ), a ) ) ] )
% 0.72/1.12 , clause( 60, [ =( 'least_upper_bound'( 'least_upper_bound'( X, identity )
% 0.72/1.12 , a ), 'least_upper_bound'( X, a ) ) ] )
% 0.72/1.12 , 0, substitution( 0, [ :=( X, X )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 paramod(
% 0.72/1.12 clause( 1510, [ =( 'least_upper_bound'( 'greatest_lower_bound'( identity, X
% 0.72/1.12 ), a ), 'least_upper_bound'( identity, a ) ) ] )
% 0.72/1.12 , clause( 47, [ =( 'least_upper_bound'( 'greatest_lower_bound'( X, Y ), X )
% 0.72/1.12 , X ) ] )
% 0.72/1.12 , 0, clause( 1507, [ =( 'least_upper_bound'( X, a ), 'least_upper_bound'(
% 0.72/1.12 'least_upper_bound'( X, identity ), a ) ) ] )
% 0.72/1.12 , 0, 7, substitution( 0, [ :=( X, identity ), :=( Y, X )] ), substitution(
% 0.72/1.12 1, [ :=( X, 'greatest_lower_bound'( identity, X ) )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 paramod(
% 0.72/1.12 clause( 1511, [ =( 'least_upper_bound'( 'greatest_lower_bound'( identity, X
% 0.72/1.12 ), a ), a ) ] )
% 0.72/1.12 , clause( 49, [ =( 'least_upper_bound'( identity, a ), a ) ] )
% 0.72/1.12 , 0, clause( 1510, [ =( 'least_upper_bound'( 'greatest_lower_bound'(
% 0.72/1.12 identity, X ), a ), 'least_upper_bound'( identity, a ) ) ] )
% 0.72/1.12 , 0, 6, substitution( 0, [] ), substitution( 1, [ :=( X, X )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 subsumption(
% 0.72/1.12 clause( 102, [ =( 'least_upper_bound'( 'greatest_lower_bound'( identity, X
% 0.72/1.12 ), a ), a ) ] )
% 0.72/1.12 , clause( 1511, [ =( 'least_upper_bound'( 'greatest_lower_bound'( identity
% 0.72/1.12 , X ), a ), a ) ] )
% 0.72/1.12 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 eqswap(
% 0.72/1.12 clause( 1514, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'(
% 0.72/1.12 'least_upper_bound'( X, Y ), X ) ) ] )
% 0.72/1.12 , clause( 43, [ =( 'least_upper_bound'( 'least_upper_bound'( X, Y ), X ),
% 0.72/1.12 'least_upper_bound'( X, Y ) ) ] )
% 0.72/1.12 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 paramod(
% 0.72/1.12 clause( 1516, [ =( 'least_upper_bound'( 'greatest_lower_bound'( identity, X
% 0.72/1.12 ), a ), 'least_upper_bound'( a, 'greatest_lower_bound'( identity, X ) )
% 0.72/1.12 ) ] )
% 0.72/1.12 , clause( 102, [ =( 'least_upper_bound'( 'greatest_lower_bound'( identity,
% 0.72/1.12 X ), a ), a ) ] )
% 0.72/1.12 , 0, clause( 1514, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'(
% 0.72/1.12 'least_upper_bound'( X, Y ), X ) ) ] )
% 0.72/1.12 , 0, 7, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X,
% 0.72/1.12 'greatest_lower_bound'( identity, X ) ), :=( Y, a )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 paramod(
% 0.72/1.12 clause( 1517, [ =( a, 'least_upper_bound'( a, 'greatest_lower_bound'(
% 0.72/1.12 identity, X ) ) ) ] )
% 0.72/1.12 , clause( 102, [ =( 'least_upper_bound'( 'greatest_lower_bound'( identity,
% 0.72/1.12 X ), a ), a ) ] )
% 0.72/1.12 , 0, clause( 1516, [ =( 'least_upper_bound'( 'greatest_lower_bound'(
% 0.72/1.12 identity, X ), a ), 'least_upper_bound'( a, 'greatest_lower_bound'(
% 0.72/1.12 identity, X ) ) ) ] )
% 0.72/1.12 , 0, 1, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X )] )
% 0.72/1.12 ).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 eqswap(
% 0.72/1.12 clause( 1519, [ =( 'least_upper_bound'( a, 'greatest_lower_bound'( identity
% 0.72/1.12 , X ) ), a ) ] )
% 0.72/1.12 , clause( 1517, [ =( a, 'least_upper_bound'( a, 'greatest_lower_bound'(
% 0.72/1.12 identity, X ) ) ) ] )
% 0.72/1.12 , 0, substitution( 0, [ :=( X, X )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 subsumption(
% 0.72/1.12 clause( 108, [ =( 'least_upper_bound'( a, 'greatest_lower_bound'( identity
% 0.72/1.12 , X ) ), a ) ] )
% 0.72/1.12 , clause( 1519, [ =( 'least_upper_bound'( a, 'greatest_lower_bound'(
% 0.72/1.12 identity, X ) ), a ) ] )
% 0.72/1.12 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 eqswap(
% 0.72/1.12 clause( 1521, [ =( a, 'least_upper_bound'( a, 'greatest_lower_bound'(
% 0.72/1.12 identity, X ) ) ) ] )
% 0.72/1.12 , clause( 108, [ =( 'least_upper_bound'( a, 'greatest_lower_bound'(
% 0.72/1.12 identity, X ) ), a ) ] )
% 0.72/1.12 , 0, substitution( 0, [ :=( X, X )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 paramod(
% 0.72/1.12 clause( 1522, [ =( a, 'least_upper_bound'( a, 'greatest_lower_bound'( X,
% 0.72/1.12 identity ) ) ) ] )
% 0.72/1.12 , clause( 3, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y
% 0.72/1.12 , X ) ) ] )
% 0.72/1.12 , 0, clause( 1521, [ =( a, 'least_upper_bound'( a, 'greatest_lower_bound'(
% 0.72/1.12 identity, X ) ) ) ] )
% 0.72/1.12 , 0, 4, substitution( 0, [ :=( X, identity ), :=( Y, X )] ), substitution(
% 0.72/1.12 1, [ :=( X, X )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 eqswap(
% 0.72/1.12 clause( 1525, [ =( 'least_upper_bound'( a, 'greatest_lower_bound'( X,
% 0.72/1.12 identity ) ), a ) ] )
% 0.72/1.12 , clause( 1522, [ =( a, 'least_upper_bound'( a, 'greatest_lower_bound'( X,
% 0.72/1.12 identity ) ) ) ] )
% 0.72/1.12 , 0, substitution( 0, [ :=( X, X )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 subsumption(
% 0.72/1.12 clause( 114, [ =( 'least_upper_bound'( a, 'greatest_lower_bound'( X,
% 0.72/1.12 identity ) ), a ) ] )
% 0.72/1.12 , clause( 1525, [ =( 'least_upper_bound'( a, 'greatest_lower_bound'( X,
% 0.72/1.12 identity ) ), a ) ] )
% 0.72/1.12 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 eqswap(
% 0.72/1.12 clause( 1527, [ =( Y, 'greatest_lower_bound'( 'least_upper_bound'( X, Y ),
% 0.72/1.12 Y ) ) ] )
% 0.72/1.12 , clause( 25, [ =( 'greatest_lower_bound'( 'least_upper_bound'( Y, X ), X )
% 0.72/1.12 , X ) ] )
% 0.72/1.12 , 0, substitution( 0, [ :=( X, Y ), :=( Y, X )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 paramod(
% 0.72/1.12 clause( 1530, [ =( 'greatest_lower_bound'( X, identity ),
% 0.72/1.12 'greatest_lower_bound'( a, 'greatest_lower_bound'( X, identity ) ) ) ] )
% 0.72/1.12 , clause( 114, [ =( 'least_upper_bound'( a, 'greatest_lower_bound'( X,
% 0.72/1.12 identity ) ), a ) ] )
% 0.72/1.12 , 0, clause( 1527, [ =( Y, 'greatest_lower_bound'( 'least_upper_bound'( X,
% 0.72/1.12 Y ), Y ) ) ] )
% 0.72/1.12 , 0, 5, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, a ),
% 0.72/1.12 :=( Y, 'greatest_lower_bound'( X, identity ) )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 paramod(
% 0.72/1.12 clause( 1531, [ =( 'greatest_lower_bound'( X, identity ),
% 0.72/1.12 'greatest_lower_bound'( 'greatest_lower_bound'( a, X ), identity ) ) ] )
% 0.72/1.12 , clause( 5, [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z )
% 0.72/1.12 ), 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.72/1.12 , 0, clause( 1530, [ =( 'greatest_lower_bound'( X, identity ),
% 0.72/1.12 'greatest_lower_bound'( a, 'greatest_lower_bound'( X, identity ) ) ) ] )
% 0.72/1.12 , 0, 4, substitution( 0, [ :=( X, a ), :=( Y, X ), :=( Z, identity )] ),
% 0.72/1.12 substitution( 1, [ :=( X, X )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 eqswap(
% 0.72/1.12 clause( 1532, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( a, X ),
% 0.72/1.12 identity ), 'greatest_lower_bound'( X, identity ) ) ] )
% 0.72/1.12 , clause( 1531, [ =( 'greatest_lower_bound'( X, identity ),
% 0.72/1.12 'greatest_lower_bound'( 'greatest_lower_bound'( a, X ), identity ) ) ] )
% 0.72/1.12 , 0, substitution( 0, [ :=( X, X )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 subsumption(
% 0.72/1.12 clause( 116, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( a, X ),
% 0.72/1.12 identity ), 'greatest_lower_bound'( X, identity ) ) ] )
% 0.72/1.12 , clause( 1532, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( a, X )
% 0.72/1.12 , identity ), 'greatest_lower_bound'( X, identity ) ) ] )
% 0.72/1.12 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 eqswap(
% 0.72/1.12 clause( 1534, [ =( multiply( X, identity ), multiply( multiply( X, inverse(
% 0.72/1.12 Y ) ), Y ) ) ] )
% 0.72/1.12 , clause( 21, [ =( multiply( multiply( Y, inverse( X ) ), X ), multiply( Y
% 0.72/1.12 , identity ) ) ] )
% 0.72/1.12 , 0, substitution( 0, [ :=( X, Y ), :=( Y, X )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 paramod(
% 0.72/1.12 clause( 1537, [ =( multiply( inverse( inverse( X ) ), identity ), multiply(
% 0.72/1.12 identity, X ) ) ] )
% 0.72/1.12 , clause( 1, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.72/1.12 , 0, clause( 1534, [ =( multiply( X, identity ), multiply( multiply( X,
% 0.72/1.12 inverse( Y ) ), Y ) ) ] )
% 0.72/1.12 , 0, 7, substitution( 0, [ :=( X, inverse( X ) )] ), substitution( 1, [
% 0.72/1.12 :=( X, inverse( inverse( X ) ) ), :=( Y, X )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 paramod(
% 0.72/1.12 clause( 1538, [ =( multiply( inverse( inverse( X ) ), identity ), X ) ] )
% 0.72/1.12 , clause( 0, [ =( multiply( identity, X ), X ) ] )
% 0.72/1.12 , 0, clause( 1537, [ =( multiply( inverse( inverse( X ) ), identity ),
% 0.72/1.12 multiply( identity, X ) ) ] )
% 0.72/1.12 , 0, 6, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X )] )
% 0.72/1.12 ).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 subsumption(
% 0.72/1.12 clause( 153, [ =( multiply( inverse( inverse( X ) ), identity ), X ) ] )
% 0.72/1.12 , clause( 1538, [ =( multiply( inverse( inverse( X ) ), identity ), X ) ]
% 0.72/1.12 )
% 0.72/1.12 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 eqswap(
% 0.72/1.12 clause( 1541, [ =( multiply( X, Y ), multiply( multiply( X, identity ), Y )
% 0.72/1.12 ) ] )
% 0.72/1.12 , clause( 22, [ =( multiply( multiply( Y, identity ), X ), multiply( Y, X )
% 0.72/1.12 ) ] )
% 0.72/1.12 , 0, substitution( 0, [ :=( X, Y ), :=( Y, X )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 paramod(
% 0.72/1.12 clause( 1544, [ =( multiply( inverse( inverse( X ) ), Y ), multiply( X, Y )
% 0.72/1.12 ) ] )
% 0.72/1.12 , clause( 153, [ =( multiply( inverse( inverse( X ) ), identity ), X ) ] )
% 0.72/1.12 , 0, clause( 1541, [ =( multiply( X, Y ), multiply( multiply( X, identity )
% 0.72/1.12 , Y ) ) ] )
% 0.72/1.12 , 0, 7, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, inverse(
% 0.72/1.12 inverse( X ) ) ), :=( Y, Y )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 subsumption(
% 0.72/1.12 clause( 158, [ =( multiply( inverse( inverse( X ) ), Y ), multiply( X, Y )
% 0.72/1.12 ) ] )
% 0.72/1.12 , clause( 1544, [ =( multiply( inverse( inverse( X ) ), Y ), multiply( X, Y
% 0.72/1.12 ) ) ] )
% 0.72/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.72/1.12 )] ) ).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 eqswap(
% 0.72/1.12 clause( 1551, [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.72/1.12 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.72/1.12 , clause( 12, [ =( 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z
% 0.72/1.12 ) ), multiply( X, 'greatest_lower_bound'( Y, Z ) ) ) ] )
% 0.72/1.12 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 paramod(
% 0.72/1.12 clause( 1554, [ =( multiply( inverse( inverse( X ) ),
% 0.72/1.12 'greatest_lower_bound'( identity, Y ) ), 'greatest_lower_bound'( X,
% 0.72/1.12 multiply( inverse( inverse( X ) ), Y ) ) ) ] )
% 0.72/1.12 , clause( 153, [ =( multiply( inverse( inverse( X ) ), identity ), X ) ] )
% 0.72/1.12 , 0, clause( 1551, [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.72/1.12 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.72/1.12 , 0, 9, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, inverse(
% 0.72/1.12 inverse( X ) ) ), :=( Y, identity ), :=( Z, Y )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 paramod(
% 0.72/1.12 clause( 1564, [ =( multiply( inverse( inverse( X ) ),
% 0.72/1.12 'greatest_lower_bound'( identity, Y ) ), 'greatest_lower_bound'( X,
% 0.72/1.12 multiply( X, Y ) ) ) ] )
% 0.72/1.12 , clause( 158, [ =( multiply( inverse( inverse( X ) ), Y ), multiply( X, Y
% 0.72/1.12 ) ) ] )
% 0.72/1.12 , 0, clause( 1554, [ =( multiply( inverse( inverse( X ) ),
% 0.72/1.12 'greatest_lower_bound'( identity, Y ) ), 'greatest_lower_bound'( X,
% 0.72/1.12 multiply( inverse( inverse( X ) ), Y ) ) ) ] )
% 0.72/1.12 , 0, 10, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [
% 0.72/1.12 :=( X, X ), :=( Y, Y )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 paramod(
% 0.72/1.12 clause( 1566, [ =( multiply( X, 'greatest_lower_bound'( identity, Y ) ),
% 0.72/1.12 'greatest_lower_bound'( X, multiply( X, Y ) ) ) ] )
% 0.72/1.12 , clause( 158, [ =( multiply( inverse( inverse( X ) ), Y ), multiply( X, Y
% 0.72/1.12 ) ) ] )
% 0.72/1.12 , 0, clause( 1564, [ =( multiply( inverse( inverse( X ) ),
% 0.72/1.12 'greatest_lower_bound'( identity, Y ) ), 'greatest_lower_bound'( X,
% 0.72/1.12 multiply( X, Y ) ) ) ] )
% 0.72/1.12 , 0, 1, substitution( 0, [ :=( X, X ), :=( Y, 'greatest_lower_bound'(
% 0.72/1.12 identity, Y ) )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 eqswap(
% 0.72/1.12 clause( 1567, [ =( 'greatest_lower_bound'( X, multiply( X, Y ) ), multiply(
% 0.72/1.12 X, 'greatest_lower_bound'( identity, Y ) ) ) ] )
% 0.72/1.12 , clause( 1566, [ =( multiply( X, 'greatest_lower_bound'( identity, Y ) ),
% 0.72/1.12 'greatest_lower_bound'( X, multiply( X, Y ) ) ) ] )
% 0.72/1.12 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 subsumption(
% 0.72/1.12 clause( 159, [ =( 'greatest_lower_bound'( X, multiply( X, Y ) ), multiply(
% 0.72/1.12 X, 'greatest_lower_bound'( identity, Y ) ) ) ] )
% 0.72/1.12 , clause( 1567, [ =( 'greatest_lower_bound'( X, multiply( X, Y ) ),
% 0.72/1.12 multiply( X, 'greatest_lower_bound'( identity, Y ) ) ) ] )
% 0.72/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.72/1.12 )] ) ).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 eqswap(
% 0.72/1.12 clause( 1568, [ =( multiply( X, Y ), multiply( inverse( inverse( X ) ), Y )
% 0.72/1.12 ) ] )
% 0.72/1.12 , clause( 158, [ =( multiply( inverse( inverse( X ) ), Y ), multiply( X, Y
% 0.72/1.12 ) ) ] )
% 0.72/1.12 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 paramod(
% 0.72/1.12 clause( 1571, [ =( multiply( X, identity ), X ) ] )
% 0.72/1.12 , clause( 153, [ =( multiply( inverse( inverse( X ) ), identity ), X ) ] )
% 0.72/1.12 , 0, clause( 1568, [ =( multiply( X, Y ), multiply( inverse( inverse( X ) )
% 0.72/1.12 , Y ) ) ] )
% 0.72/1.12 , 0, 4, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X ),
% 0.72/1.12 :=( Y, identity )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 subsumption(
% 0.72/1.12 clause( 417, [ =( multiply( X, identity ), X ) ] )
% 0.72/1.12 , clause( 1571, [ =( multiply( X, identity ), X ) ] )
% 0.72/1.12 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 eqswap(
% 0.72/1.12 clause( 1577, [ =( multiply( X, 'greatest_lower_bound'( identity, Y ) ),
% 0.72/1.12 'greatest_lower_bound'( X, multiply( X, Y ) ) ) ] )
% 0.72/1.12 , clause( 159, [ =( 'greatest_lower_bound'( X, multiply( X, Y ) ), multiply(
% 0.72/1.12 X, 'greatest_lower_bound'( identity, Y ) ) ) ] )
% 0.72/1.12 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 paramod(
% 0.72/1.12 clause( 1579, [ =( multiply( X, identity ), 'greatest_lower_bound'( X,
% 0.72/1.12 multiply( X, b ) ) ) ] )
% 0.72/1.12 , clause( 16, [ =( 'greatest_lower_bound'( identity, b ), identity ) ] )
% 0.72/1.12 , 0, clause( 1577, [ =( multiply( X, 'greatest_lower_bound'( identity, Y )
% 0.72/1.12 ), 'greatest_lower_bound'( X, multiply( X, Y ) ) ) ] )
% 0.72/1.12 , 0, 3, substitution( 0, [] ), substitution( 1, [ :=( X, X ), :=( Y, b )] )
% 0.72/1.12 ).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 paramod(
% 0.72/1.12 clause( 1580, [ =( X, 'greatest_lower_bound'( X, multiply( X, b ) ) ) ] )
% 0.72/1.12 , clause( 417, [ =( multiply( X, identity ), X ) ] )
% 0.72/1.12 , 0, clause( 1579, [ =( multiply( X, identity ), 'greatest_lower_bound'( X
% 0.72/1.12 , multiply( X, b ) ) ) ] )
% 0.72/1.12 , 0, 1, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X )] )
% 0.72/1.12 ).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 eqswap(
% 0.72/1.12 clause( 1581, [ =( 'greatest_lower_bound'( X, multiply( X, b ) ), X ) ] )
% 0.72/1.12 , clause( 1580, [ =( X, 'greatest_lower_bound'( X, multiply( X, b ) ) ) ]
% 0.72/1.12 )
% 0.72/1.12 , 0, substitution( 0, [ :=( X, X )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 subsumption(
% 0.72/1.12 clause( 1018, [ =( 'greatest_lower_bound'( X, multiply( X, b ) ), X ) ] )
% 0.72/1.12 , clause( 1581, [ =( 'greatest_lower_bound'( X, multiply( X, b ) ), X ) ]
% 0.72/1.12 )
% 0.72/1.12 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 eqswap(
% 0.72/1.12 clause( 1583, [ =( 'greatest_lower_bound'( X, identity ),
% 0.72/1.12 'greatest_lower_bound'( 'greatest_lower_bound'( a, X ), identity ) ) ] )
% 0.72/1.12 , clause( 116, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( a, X )
% 0.72/1.12 , identity ), 'greatest_lower_bound'( X, identity ) ) ] )
% 0.72/1.12 , 0, substitution( 0, [ :=( X, X )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 paramod(
% 0.72/1.12 clause( 1585, [ =( 'greatest_lower_bound'( multiply( a, b ), identity ),
% 0.72/1.12 'greatest_lower_bound'( a, identity ) ) ] )
% 0.72/1.12 , clause( 1018, [ =( 'greatest_lower_bound'( X, multiply( X, b ) ), X ) ]
% 0.72/1.12 )
% 0.72/1.12 , 0, clause( 1583, [ =( 'greatest_lower_bound'( X, identity ),
% 0.72/1.12 'greatest_lower_bound'( 'greatest_lower_bound'( a, X ), identity ) ) ] )
% 0.72/1.12 , 0, 7, substitution( 0, [ :=( X, a )] ), substitution( 1, [ :=( X,
% 0.72/1.12 multiply( a, b ) )] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 paramod(
% 0.72/1.12 clause( 1586, [ =( 'greatest_lower_bound'( multiply( a, b ), identity ),
% 0.72/1.12 identity ) ] )
% 0.72/1.12 , clause( 18, [ =( 'greatest_lower_bound'( a, identity ), identity ) ] )
% 0.72/1.12 , 0, clause( 1585, [ =( 'greatest_lower_bound'( multiply( a, b ), identity
% 0.72/1.12 ), 'greatest_lower_bound'( a, identity ) ) ] )
% 0.72/1.12 , 0, 6, substitution( 0, [] ), substitution( 1, [] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 subsumption(
% 0.72/1.12 clause( 1302, [ =( 'greatest_lower_bound'( multiply( a, b ), identity ),
% 0.72/1.12 identity ) ] )
% 0.72/1.12 , clause( 1586, [ =( 'greatest_lower_bound'( multiply( a, b ), identity ),
% 0.72/1.12 identity ) ] )
% 0.72/1.12 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 resolution(
% 0.72/1.12 clause( 1590, [] )
% 0.72/1.12 , clause( 76, [ ~( =( 'greatest_lower_bound'( multiply( a, b ), identity )
% 0.72/1.12 , identity ) ) ] )
% 0.72/1.12 , 0, clause( 1302, [ =( 'greatest_lower_bound'( multiply( a, b ), identity
% 0.72/1.12 ), identity ) ] )
% 0.72/1.12 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 subsumption(
% 0.72/1.12 clause( 1325, [] )
% 0.72/1.12 , clause( 1590, [] )
% 0.72/1.12 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 end.
% 0.72/1.12
% 0.72/1.12 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.72/1.12
% 0.72/1.12 Memory use:
% 0.72/1.12
% 0.72/1.12 space for terms: 16941
% 0.72/1.12 space for clauses: 138915
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 clauses generated: 18949
% 0.72/1.12 clauses kept: 1326
% 0.72/1.12 clauses selected: 191
% 0.72/1.12 clauses deleted: 14
% 0.72/1.12 clauses inuse deleted: 6
% 0.72/1.12
% 0.72/1.12 subsentry: 4418
% 0.72/1.12 literals s-matched: 3811
% 0.72/1.12 literals matched: 3799
% 0.72/1.12 full subsumption: 0
% 0.72/1.12
% 0.72/1.12 checksum: -1342751507
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 Bliksem ended
%------------------------------------------------------------------------------