TSTP Solution File: GRP173-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : GRP173-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n016.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:47 EDT 2022
% Result : Unsatisfiable 0.70s 1.13s
% Output : Refutation 0.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP173-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n016.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % DateTime : Mon Jun 13 19:34:59 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.70/1.13 *** allocated 10000 integers for termspace/termends
% 0.70/1.13 *** allocated 10000 integers for clauses
% 0.70/1.13 *** allocated 10000 integers for justifications
% 0.70/1.13 Bliksem 1.12
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 Automatic Strategy Selection
% 0.70/1.13
% 0.70/1.13 Clauses:
% 0.70/1.13 [
% 0.70/1.13 [ =( multiply( identity, X ), X ) ],
% 0.70/1.13 [ =( multiply( inverse( X ), X ), identity ) ],
% 0.70/1.13 [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply( Y, Z ) ) )
% 0.70/1.13 ],
% 0.70/1.13 [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y, X ) ) ]
% 0.70/1.13 ,
% 0.70/1.13 [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X ) ) ],
% 0.70/1.13 [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.70/1.13 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ],
% 0.70/1.13 [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.70/1.13 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ],
% 0.70/1.13 [ =( 'least_upper_bound'( X, X ), X ) ],
% 0.70/1.13 [ =( 'greatest_lower_bound'( X, X ), X ) ],
% 0.70/1.13 [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) ), X ) ]
% 0.70/1.13 ,
% 0.70/1.13 [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) ), X ) ]
% 0.70/1.13 ,
% 0.70/1.13 [ =( multiply( X, 'least_upper_bound'( Y, Z ) ), 'least_upper_bound'(
% 0.70/1.13 multiply( X, Y ), multiply( X, Z ) ) ) ],
% 0.70/1.13 [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.70/1.13 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ],
% 0.70/1.13 [ =( multiply( 'least_upper_bound'( X, Y ), Z ), 'least_upper_bound'(
% 0.70/1.13 multiply( X, Z ), multiply( Y, Z ) ) ) ],
% 0.70/1.13 [ =( multiply( 'greatest_lower_bound'( X, Y ), Z ),
% 0.70/1.13 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ],
% 0.70/1.13 [ =( 'least_upper_bound'( identity, a ), identity ) ],
% 0.70/1.13 [ =( 'least_upper_bound'( identity, inverse( a ) ), identity ) ],
% 0.70/1.13 [ ~( =( identity, a ) ) ]
% 0.70/1.13 ] .
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 percentage equality = 1.000000, percentage horn = 1.000000
% 0.70/1.13 This is a pure equality problem
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 Options Used:
% 0.70/1.13
% 0.70/1.13 useres = 1
% 0.70/1.13 useparamod = 1
% 0.70/1.13 useeqrefl = 1
% 0.70/1.13 useeqfact = 1
% 0.70/1.13 usefactor = 1
% 0.70/1.13 usesimpsplitting = 0
% 0.70/1.13 usesimpdemod = 5
% 0.70/1.13 usesimpres = 3
% 0.70/1.13
% 0.70/1.13 resimpinuse = 1000
% 0.70/1.13 resimpclauses = 20000
% 0.70/1.13 substype = eqrewr
% 0.70/1.13 backwardsubs = 1
% 0.70/1.13 selectoldest = 5
% 0.70/1.13
% 0.70/1.13 litorderings [0] = split
% 0.70/1.13 litorderings [1] = extend the termordering, first sorting on arguments
% 0.70/1.13
% 0.70/1.13 termordering = kbo
% 0.70/1.13
% 0.70/1.13 litapriori = 0
% 0.70/1.13 termapriori = 1
% 0.70/1.13 litaposteriori = 0
% 0.70/1.13 termaposteriori = 0
% 0.70/1.13 demodaposteriori = 0
% 0.70/1.13 ordereqreflfact = 0
% 0.70/1.13
% 0.70/1.13 litselect = negord
% 0.70/1.13
% 0.70/1.13 maxweight = 15
% 0.70/1.13 maxdepth = 30000
% 0.70/1.13 maxlength = 115
% 0.70/1.13 maxnrvars = 195
% 0.70/1.13 excuselevel = 1
% 0.70/1.13 increasemaxweight = 1
% 0.70/1.13
% 0.70/1.13 maxselected = 10000000
% 0.70/1.13 maxnrclauses = 10000000
% 0.70/1.13
% 0.70/1.13 showgenerated = 0
% 0.70/1.13 showkept = 0
% 0.70/1.13 showselected = 0
% 0.70/1.13 showdeleted = 0
% 0.70/1.13 showresimp = 1
% 0.70/1.13 showstatus = 2000
% 0.70/1.13
% 0.70/1.13 prologoutput = 1
% 0.70/1.13 nrgoals = 5000000
% 0.70/1.13 totalproof = 1
% 0.70/1.13
% 0.70/1.13 Symbols occurring in the translation:
% 0.70/1.13
% 0.70/1.13 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.70/1.13 . [1, 2] (w:1, o:20, a:1, s:1, b:0),
% 0.70/1.13 ! [4, 1] (w:0, o:14, a:1, s:1, b:0),
% 0.70/1.13 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.70/1.13 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.70/1.13 identity [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.70/1.13 multiply [41, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.70/1.13 inverse [42, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.70/1.13 'greatest_lower_bound' [45, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.70/1.13 'least_upper_bound' [46, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.70/1.13 a [47, 0] (w:1, o:13, a:1, s:1, b:0).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 Starting Search:
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 Bliksems!, er is een bewijs:
% 0.70/1.13 % SZS status Unsatisfiable
% 0.70/1.13 % SZS output start Refutation
% 0.70/1.13
% 0.70/1.13 clause( 0, [ =( multiply( identity, X ), X ) ] )
% 0.70/1.13 .
% 0.70/1.13 clause( 1, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.70/1.13 .
% 0.70/1.13 clause( 2, [ =( multiply( X, multiply( Y, Z ) ), multiply( multiply( X, Y )
% 0.70/1.13 , Z ) ) ] )
% 0.70/1.13 .
% 0.70/1.13 clause( 3, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y,
% 0.70/1.13 X ) ) ] )
% 0.70/1.13 .
% 0.70/1.13 clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X ) )
% 0.70/1.13 ] )
% 0.70/1.13 .
% 0.70/1.13 clause( 10, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) ),
% 0.70/1.13 X ) ] )
% 0.70/1.13 .
% 0.70/1.13 clause( 12, [ =( 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z )
% 0.70/1.13 ), multiply( X, 'greatest_lower_bound'( Y, Z ) ) ) ] )
% 0.70/1.13 .
% 0.70/1.13 clause( 14, [ =( 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z )
% 0.70/1.13 ), multiply( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.70/1.13 .
% 0.70/1.13 clause( 15, [ =( 'least_upper_bound'( identity, a ), identity ) ] )
% 0.70/1.13 .
% 0.70/1.13 clause( 16, [ =( 'least_upper_bound'( identity, inverse( a ) ), identity )
% 0.70/1.13 ] )
% 0.70/1.13 .
% 0.70/1.13 clause( 17, [ ~( =( a, identity ) ) ] )
% 0.70/1.13 .
% 0.70/1.13 clause( 18, [ =( 'least_upper_bound'( inverse( a ), identity ), identity )
% 0.70/1.13 ] )
% 0.70/1.13 .
% 0.70/1.13 clause( 19, [ =( 'least_upper_bound'( a, identity ), identity ) ] )
% 0.70/1.13 .
% 0.70/1.13 clause( 20, [ =( multiply( multiply( inverse( multiply( X, Y ) ), X ), Y )
% 0.70/1.13 , identity ) ] )
% 0.70/1.13 .
% 0.70/1.13 clause( 21, [ =( multiply( multiply( Y, inverse( X ) ), X ), multiply( Y,
% 0.70/1.13 identity ) ) ] )
% 0.70/1.13 .
% 0.70/1.13 clause( 22, [ =( multiply( multiply( Y, identity ), X ), multiply( Y, X ) )
% 0.70/1.13 ] )
% 0.70/1.13 .
% 0.70/1.13 clause( 24, [ =( 'greatest_lower_bound'( inverse( a ), identity ), inverse(
% 0.70/1.13 a ) ) ] )
% 0.70/1.13 .
% 0.70/1.13 clause( 25, [ =( 'greatest_lower_bound'( a, identity ), a ) ] )
% 0.70/1.13 .
% 0.70/1.13 clause( 122, [ =( multiply( 'greatest_lower_bound'( X, Z ), Y ), multiply(
% 0.70/1.13 'greatest_lower_bound'( Z, X ), Y ) ) ] )
% 0.70/1.13 .
% 0.70/1.13 clause( 156, [ =( multiply( inverse( inverse( X ) ), identity ), X ) ] )
% 0.70/1.13 .
% 0.70/1.13 clause( 161, [ =( multiply( inverse( inverse( X ) ), Y ), multiply( X, Y )
% 0.70/1.13 ) ] )
% 0.70/1.13 .
% 0.70/1.13 clause( 339, [ =( multiply( X, identity ), X ) ] )
% 0.70/1.13 .
% 0.70/1.13 clause( 346, [ =( multiply( X, inverse( X ) ), identity ) ] )
% 0.70/1.13 .
% 0.70/1.13 clause( 347, [ =( inverse( inverse( X ) ), X ) ] )
% 0.70/1.13 .
% 0.70/1.13 clause( 350, [ =( multiply( multiply( Y, X ), inverse( X ) ), Y ) ] )
% 0.70/1.13 .
% 0.70/1.13 clause( 359, [ =( multiply( X, 'greatest_lower_bound'( Y, inverse( X ) ) )
% 0.70/1.13 , 'greatest_lower_bound'( multiply( X, Y ), identity ) ) ] )
% 0.70/1.13 .
% 0.70/1.13 clause( 362, [ =( multiply( inverse( multiply( X, Y ) ), X ), inverse( Y )
% 0.70/1.13 ) ] )
% 0.70/1.13 .
% 0.70/1.13 clause( 368, [ =( multiply( Y, inverse( multiply( X, Y ) ) ), inverse( X )
% 0.70/1.13 ) ] )
% 0.70/1.13 .
% 0.70/1.13 clause( 580, [ =( inverse( 'greatest_lower_bound'( Y, X ) ), inverse(
% 0.70/1.13 'greatest_lower_bound'( X, Y ) ) ) ] )
% 0.70/1.13 .
% 0.70/1.13 clause( 597, [ =( multiply( inverse( 'greatest_lower_bound'( Y, X ) ),
% 0.70/1.13 'greatest_lower_bound'( X, Y ) ), identity ) ] )
% 0.70/1.13 .
% 0.70/1.13 clause( 609, [] )
% 0.70/1.13 .
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 % SZS output end Refutation
% 0.70/1.13 found a proof!
% 0.70/1.13
% 0.70/1.13 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.70/1.13
% 0.70/1.13 initialclauses(
% 0.70/1.13 [ clause( 611, [ =( multiply( identity, X ), X ) ] )
% 0.70/1.13 , clause( 612, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.70/1.13 , clause( 613, [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply(
% 0.70/1.13 Y, Z ) ) ) ] )
% 0.70/1.13 , clause( 614, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'(
% 0.70/1.13 Y, X ) ) ] )
% 0.70/1.13 , clause( 615, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X
% 0.70/1.13 ) ) ] )
% 0.70/1.13 , clause( 616, [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z
% 0.70/1.13 ) ), 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.70/1.13 , clause( 617, [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.70/1.13 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.70/1.13 , clause( 618, [ =( 'least_upper_bound'( X, X ), X ) ] )
% 0.70/1.13 , clause( 619, [ =( 'greatest_lower_bound'( X, X ), X ) ] )
% 0.70/1.13 , clause( 620, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y )
% 0.70/1.13 ), X ) ] )
% 0.70/1.13 , clause( 621, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y )
% 0.70/1.13 ), X ) ] )
% 0.70/1.13 , clause( 622, [ =( multiply( X, 'least_upper_bound'( Y, Z ) ),
% 0.70/1.13 'least_upper_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.70/1.13 , clause( 623, [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.70/1.13 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.70/1.13 , clause( 624, [ =( multiply( 'least_upper_bound'( X, Y ), Z ),
% 0.70/1.13 'least_upper_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.70/1.13 , clause( 625, [ =( multiply( 'greatest_lower_bound'( X, Y ), Z ),
% 0.70/1.13 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.70/1.13 , clause( 626, [ =( 'least_upper_bound'( identity, a ), identity ) ] )
% 0.70/1.13 , clause( 627, [ =( 'least_upper_bound'( identity, inverse( a ) ), identity
% 0.70/1.13 ) ] )
% 0.70/1.13 , clause( 628, [ ~( =( identity, a ) ) ] )
% 0.70/1.13 ] ).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 subsumption(
% 0.70/1.13 clause( 0, [ =( multiply( identity, X ), X ) ] )
% 0.70/1.13 , clause( 611, [ =( multiply( identity, X ), X ) ] )
% 0.70/1.13 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 subsumption(
% 0.70/1.13 clause( 1, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.70/1.13 , clause( 612, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.70/1.13 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 eqswap(
% 0.70/1.13 clause( 634, [ =( multiply( X, multiply( Y, Z ) ), multiply( multiply( X, Y
% 0.70/1.13 ), Z ) ) ] )
% 0.70/1.13 , clause( 613, [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply(
% 0.70/1.13 Y, Z ) ) ) ] )
% 0.70/1.13 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 subsumption(
% 0.70/1.13 clause( 2, [ =( multiply( X, multiply( Y, Z ) ), multiply( multiply( X, Y )
% 0.70/1.13 , Z ) ) ] )
% 0.70/1.13 , clause( 634, [ =( multiply( X, multiply( Y, Z ) ), multiply( multiply( X
% 0.70/1.13 , Y ), Z ) ) ] )
% 0.70/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.70/1.13 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 subsumption(
% 0.70/1.13 clause( 3, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y,
% 0.70/1.13 X ) ) ] )
% 0.70/1.13 , clause( 614, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'(
% 0.70/1.13 Y, X ) ) ] )
% 0.70/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.70/1.13 )] ) ).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 subsumption(
% 0.70/1.13 clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X ) )
% 0.70/1.13 ] )
% 0.70/1.13 , clause( 615, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X
% 0.70/1.13 ) ) ] )
% 0.70/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.70/1.13 )] ) ).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 subsumption(
% 0.70/1.13 clause( 10, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) ),
% 0.70/1.13 X ) ] )
% 0.70/1.13 , clause( 621, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y )
% 0.70/1.13 ), X ) ] )
% 0.70/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.70/1.13 )] ) ).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 eqswap(
% 0.70/1.13 clause( 660, [ =( 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z
% 0.70/1.13 ) ), multiply( X, 'greatest_lower_bound'( Y, Z ) ) ) ] )
% 0.70/1.13 , clause( 623, [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.70/1.13 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.70/1.13 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 subsumption(
% 0.70/1.13 clause( 12, [ =( 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z )
% 0.70/1.13 ), multiply( X, 'greatest_lower_bound'( Y, Z ) ) ) ] )
% 0.70/1.13 , clause( 660, [ =( 'greatest_lower_bound'( multiply( X, Y ), multiply( X,
% 0.70/1.13 Z ) ), multiply( X, 'greatest_lower_bound'( Y, Z ) ) ) ] )
% 0.70/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.70/1.13 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 eqswap(
% 0.70/1.13 clause( 673, [ =( 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z
% 0.70/1.13 ) ), multiply( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.70/1.13 , clause( 625, [ =( multiply( 'greatest_lower_bound'( X, Y ), Z ),
% 0.70/1.13 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.70/1.13 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 subsumption(
% 0.70/1.13 clause( 14, [ =( 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z )
% 0.70/1.13 ), multiply( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.70/1.13 , clause( 673, [ =( 'greatest_lower_bound'( multiply( X, Z ), multiply( Y,
% 0.70/1.13 Z ) ), multiply( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.70/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.70/1.13 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 subsumption(
% 0.70/1.13 clause( 15, [ =( 'least_upper_bound'( identity, a ), identity ) ] )
% 0.70/1.13 , clause( 626, [ =( 'least_upper_bound'( identity, a ), identity ) ] )
% 0.70/1.13 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 subsumption(
% 0.70/1.13 clause( 16, [ =( 'least_upper_bound'( identity, inverse( a ) ), identity )
% 0.70/1.13 ] )
% 0.70/1.13 , clause( 627, [ =( 'least_upper_bound'( identity, inverse( a ) ), identity
% 0.70/1.13 ) ] )
% 0.70/1.13 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 eqswap(
% 0.70/1.13 clause( 718, [ ~( =( a, identity ) ) ] )
% 0.70/1.13 , clause( 628, [ ~( =( identity, a ) ) ] )
% 0.70/1.13 , 0, substitution( 0, [] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 subsumption(
% 0.70/1.13 clause( 17, [ ~( =( a, identity ) ) ] )
% 0.70/1.13 , clause( 718, [ ~( =( a, identity ) ) ] )
% 0.70/1.13 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 eqswap(
% 0.70/1.13 clause( 719, [ =( identity, 'least_upper_bound'( identity, inverse( a ) ) )
% 0.70/1.13 ] )
% 0.70/1.13 , clause( 16, [ =( 'least_upper_bound'( identity, inverse( a ) ), identity
% 0.70/1.13 ) ] )
% 0.70/1.13 , 0, substitution( 0, [] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 paramod(
% 0.70/1.13 clause( 720, [ =( identity, 'least_upper_bound'( inverse( a ), identity ) )
% 0.70/1.13 ] )
% 0.70/1.13 , clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X )
% 0.70/1.13 ) ] )
% 0.70/1.13 , 0, clause( 719, [ =( identity, 'least_upper_bound'( identity, inverse( a
% 0.70/1.13 ) ) ) ] )
% 0.70/1.13 , 0, 2, substitution( 0, [ :=( X, identity ), :=( Y, inverse( a ) )] ),
% 0.70/1.13 substitution( 1, [] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 eqswap(
% 0.70/1.13 clause( 723, [ =( 'least_upper_bound'( inverse( a ), identity ), identity )
% 0.70/1.13 ] )
% 0.70/1.13 , clause( 720, [ =( identity, 'least_upper_bound'( inverse( a ), identity )
% 0.70/1.13 ) ] )
% 0.70/1.13 , 0, substitution( 0, [] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 subsumption(
% 0.70/1.13 clause( 18, [ =( 'least_upper_bound'( inverse( a ), identity ), identity )
% 0.70/1.13 ] )
% 0.70/1.13 , clause( 723, [ =( 'least_upper_bound'( inverse( a ), identity ), identity
% 0.70/1.13 ) ] )
% 0.70/1.13 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 eqswap(
% 0.70/1.13 clause( 724, [ =( identity, 'least_upper_bound'( identity, a ) ) ] )
% 0.70/1.13 , clause( 15, [ =( 'least_upper_bound'( identity, a ), identity ) ] )
% 0.70/1.13 , 0, substitution( 0, [] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 paramod(
% 0.70/1.13 clause( 725, [ =( identity, 'least_upper_bound'( a, identity ) ) ] )
% 0.70/1.13 , clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X )
% 0.70/1.13 ) ] )
% 0.70/1.13 , 0, clause( 724, [ =( identity, 'least_upper_bound'( identity, a ) ) ] )
% 0.70/1.13 , 0, 2, substitution( 0, [ :=( X, identity ), :=( Y, a )] ), substitution(
% 0.70/1.13 1, [] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 eqswap(
% 0.70/1.13 clause( 728, [ =( 'least_upper_bound'( a, identity ), identity ) ] )
% 0.70/1.13 , clause( 725, [ =( identity, 'least_upper_bound'( a, identity ) ) ] )
% 0.70/1.13 , 0, substitution( 0, [] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 subsumption(
% 0.70/1.13 clause( 19, [ =( 'least_upper_bound'( a, identity ), identity ) ] )
% 0.70/1.13 , clause( 728, [ =( 'least_upper_bound'( a, identity ), identity ) ] )
% 0.70/1.13 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 eqswap(
% 0.70/1.13 clause( 729, [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply( Y
% 0.70/1.13 , Z ) ) ) ] )
% 0.70/1.13 , clause( 2, [ =( multiply( X, multiply( Y, Z ) ), multiply( multiply( X, Y
% 0.70/1.13 ), Z ) ) ] )
% 0.70/1.13 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 paramod(
% 0.70/1.13 clause( 732, [ =( multiply( multiply( inverse( multiply( X, Y ) ), X ), Y )
% 0.70/1.13 , identity ) ] )
% 0.70/1.13 , clause( 1, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.70/1.13 , 0, clause( 729, [ =( multiply( multiply( X, Y ), Z ), multiply( X,
% 0.70/1.13 multiply( Y, Z ) ) ) ] )
% 0.70/1.13 , 0, 9, substitution( 0, [ :=( X, multiply( X, Y ) )] ), substitution( 1, [
% 0.70/1.13 :=( X, inverse( multiply( X, Y ) ) ), :=( Y, X ), :=( Z, Y )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 subsumption(
% 0.70/1.13 clause( 20, [ =( multiply( multiply( inverse( multiply( X, Y ) ), X ), Y )
% 0.70/1.13 , identity ) ] )
% 0.70/1.13 , clause( 732, [ =( multiply( multiply( inverse( multiply( X, Y ) ), X ), Y
% 0.70/1.13 ), identity ) ] )
% 0.70/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.70/1.13 )] ) ).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 eqswap(
% 0.70/1.13 clause( 738, [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply( Y
% 0.70/1.13 , Z ) ) ) ] )
% 0.70/1.13 , clause( 2, [ =( multiply( X, multiply( Y, Z ) ), multiply( multiply( X, Y
% 0.70/1.13 ), Z ) ) ] )
% 0.70/1.13 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 paramod(
% 0.70/1.13 clause( 743, [ =( multiply( multiply( X, inverse( Y ) ), Y ), multiply( X,
% 0.70/1.13 identity ) ) ] )
% 0.70/1.13 , clause( 1, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.70/1.13 , 0, clause( 738, [ =( multiply( multiply( X, Y ), Z ), multiply( X,
% 0.70/1.13 multiply( Y, Z ) ) ) ] )
% 0.70/1.13 , 0, 9, substitution( 0, [ :=( X, Y )] ), substitution( 1, [ :=( X, X ),
% 0.70/1.13 :=( Y, inverse( Y ) ), :=( Z, Y )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 subsumption(
% 0.70/1.13 clause( 21, [ =( multiply( multiply( Y, inverse( X ) ), X ), multiply( Y,
% 0.70/1.13 identity ) ) ] )
% 0.70/1.13 , clause( 743, [ =( multiply( multiply( X, inverse( Y ) ), Y ), multiply( X
% 0.70/1.13 , identity ) ) ] )
% 0.70/1.13 , substitution( 0, [ :=( X, Y ), :=( Y, X )] ), permutation( 0, [ ==>( 0, 0
% 0.70/1.13 )] ) ).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 eqswap(
% 0.70/1.13 clause( 748, [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply( Y
% 0.70/1.13 , Z ) ) ) ] )
% 0.70/1.13 , clause( 2, [ =( multiply( X, multiply( Y, Z ) ), multiply( multiply( X, Y
% 0.70/1.13 ), Z ) ) ] )
% 0.70/1.13 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 paramod(
% 0.70/1.13 clause( 753, [ =( multiply( multiply( X, identity ), Y ), multiply( X, Y )
% 0.70/1.13 ) ] )
% 0.70/1.13 , clause( 0, [ =( multiply( identity, X ), X ) ] )
% 0.70/1.13 , 0, clause( 748, [ =( multiply( multiply( X, Y ), Z ), multiply( X,
% 0.70/1.13 multiply( Y, Z ) ) ) ] )
% 0.70/1.13 , 0, 8, substitution( 0, [ :=( X, Y )] ), substitution( 1, [ :=( X, X ),
% 0.70/1.13 :=( Y, identity ), :=( Z, Y )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 subsumption(
% 0.70/1.13 clause( 22, [ =( multiply( multiply( Y, identity ), X ), multiply( Y, X ) )
% 0.70/1.13 ] )
% 0.70/1.13 , clause( 753, [ =( multiply( multiply( X, identity ), Y ), multiply( X, Y
% 0.70/1.13 ) ) ] )
% 0.70/1.13 , substitution( 0, [ :=( X, Y ), :=( Y, X )] ), permutation( 0, [ ==>( 0, 0
% 0.70/1.13 )] ) ).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 eqswap(
% 0.70/1.13 clause( 759, [ =( X, 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y )
% 0.70/1.13 ) ) ] )
% 0.70/1.13 , clause( 10, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) )
% 0.70/1.13 , X ) ] )
% 0.70/1.13 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 paramod(
% 0.70/1.13 clause( 760, [ =( inverse( a ), 'greatest_lower_bound'( inverse( a ),
% 0.70/1.13 identity ) ) ] )
% 0.70/1.13 , clause( 18, [ =( 'least_upper_bound'( inverse( a ), identity ), identity
% 0.70/1.13 ) ] )
% 0.70/1.13 , 0, clause( 759, [ =( X, 'greatest_lower_bound'( X, 'least_upper_bound'( X
% 0.70/1.13 , Y ) ) ) ] )
% 0.70/1.13 , 0, 6, substitution( 0, [] ), substitution( 1, [ :=( X, inverse( a ) ),
% 0.70/1.13 :=( Y, identity )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 eqswap(
% 0.70/1.13 clause( 761, [ =( 'greatest_lower_bound'( inverse( a ), identity ), inverse(
% 0.70/1.13 a ) ) ] )
% 0.70/1.13 , clause( 760, [ =( inverse( a ), 'greatest_lower_bound'( inverse( a ),
% 0.70/1.13 identity ) ) ] )
% 0.70/1.13 , 0, substitution( 0, [] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 subsumption(
% 0.70/1.13 clause( 24, [ =( 'greatest_lower_bound'( inverse( a ), identity ), inverse(
% 0.70/1.13 a ) ) ] )
% 0.70/1.13 , clause( 761, [ =( 'greatest_lower_bound'( inverse( a ), identity ),
% 0.70/1.13 inverse( a ) ) ] )
% 0.70/1.13 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 eqswap(
% 0.70/1.13 clause( 763, [ =( X, 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y )
% 0.70/1.13 ) ) ] )
% 0.70/1.13 , clause( 10, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) )
% 0.70/1.13 , X ) ] )
% 0.70/1.13 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 paramod(
% 0.70/1.13 clause( 764, [ =( a, 'greatest_lower_bound'( a, identity ) ) ] )
% 0.70/1.13 , clause( 19, [ =( 'least_upper_bound'( a, identity ), identity ) ] )
% 0.70/1.13 , 0, clause( 763, [ =( X, 'greatest_lower_bound'( X, 'least_upper_bound'( X
% 0.70/1.13 , Y ) ) ) ] )
% 0.70/1.13 , 0, 4, substitution( 0, [] ), substitution( 1, [ :=( X, a ), :=( Y,
% 0.70/1.13 identity )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 eqswap(
% 0.70/1.13 clause( 765, [ =( 'greatest_lower_bound'( a, identity ), a ) ] )
% 0.70/1.13 , clause( 764, [ =( a, 'greatest_lower_bound'( a, identity ) ) ] )
% 0.70/1.13 , 0, substitution( 0, [] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 subsumption(
% 0.70/1.13 clause( 25, [ =( 'greatest_lower_bound'( a, identity ), a ) ] )
% 0.70/1.13 , clause( 765, [ =( 'greatest_lower_bound'( a, identity ), a ) ] )
% 0.70/1.13 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 eqswap(
% 0.70/1.13 clause( 766, [ =( multiply( 'greatest_lower_bound'( X, Z ), Y ),
% 0.70/1.13 'greatest_lower_bound'( multiply( X, Y ), multiply( Z, Y ) ) ) ] )
% 0.70/1.13 , clause( 14, [ =( 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z
% 0.70/1.13 ) ), multiply( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.70/1.13 , 0, substitution( 0, [ :=( X, X ), :=( Y, Z ), :=( Z, Y )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 paramod(
% 0.70/1.13 clause( 768, [ =( multiply( 'greatest_lower_bound'( Y, X ), Z ),
% 0.70/1.13 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.70/1.13 , clause( 3, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y
% 0.70/1.13 , X ) ) ] )
% 0.70/1.13 , 0, clause( 766, [ =( multiply( 'greatest_lower_bound'( X, Z ), Y ),
% 0.70/1.13 'greatest_lower_bound'( multiply( X, Y ), multiply( Z, Y ) ) ) ] )
% 0.70/1.13 , 0, 2, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [
% 0.70/1.13 :=( X, X ), :=( Y, Z ), :=( Z, Y )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 paramod(
% 0.70/1.13 clause( 770, [ =( multiply( 'greatest_lower_bound'( X, Y ), Z ), multiply(
% 0.70/1.13 'greatest_lower_bound'( Y, X ), Z ) ) ] )
% 0.70/1.13 , clause( 14, [ =( 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z
% 0.70/1.13 ) ), multiply( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.70/1.13 , 0, clause( 768, [ =( multiply( 'greatest_lower_bound'( Y, X ), Z ),
% 0.70/1.13 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.70/1.13 , 0, 6, substitution( 0, [ :=( X, Y ), :=( Y, X ), :=( Z, Z )] ),
% 0.70/1.13 substitution( 1, [ :=( X, Y ), :=( Y, X ), :=( Z, Z )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 subsumption(
% 0.70/1.13 clause( 122, [ =( multiply( 'greatest_lower_bound'( X, Z ), Y ), multiply(
% 0.70/1.13 'greatest_lower_bound'( Z, X ), Y ) ) ] )
% 0.70/1.13 , clause( 770, [ =( multiply( 'greatest_lower_bound'( X, Y ), Z ), multiply(
% 0.70/1.13 'greatest_lower_bound'( Y, X ), Z ) ) ] )
% 0.70/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Z ), :=( Z, Y )] ),
% 0.70/1.13 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 eqswap(
% 0.70/1.13 clause( 772, [ =( multiply( X, identity ), multiply( multiply( X, inverse(
% 0.70/1.13 Y ) ), Y ) ) ] )
% 0.70/1.13 , clause( 21, [ =( multiply( multiply( Y, inverse( X ) ), X ), multiply( Y
% 0.70/1.13 , identity ) ) ] )
% 0.70/1.13 , 0, substitution( 0, [ :=( X, Y ), :=( Y, X )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 paramod(
% 0.70/1.13 clause( 775, [ =( multiply( inverse( inverse( X ) ), identity ), multiply(
% 0.70/1.13 identity, X ) ) ] )
% 0.70/1.13 , clause( 1, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.70/1.13 , 0, clause( 772, [ =( multiply( X, identity ), multiply( multiply( X,
% 0.70/1.13 inverse( Y ) ), Y ) ) ] )
% 0.70/1.13 , 0, 7, substitution( 0, [ :=( X, inverse( X ) )] ), substitution( 1, [
% 0.70/1.13 :=( X, inverse( inverse( X ) ) ), :=( Y, X )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 paramod(
% 0.70/1.13 clause( 776, [ =( multiply( inverse( inverse( X ) ), identity ), X ) ] )
% 0.70/1.13 , clause( 0, [ =( multiply( identity, X ), X ) ] )
% 0.70/1.13 , 0, clause( 775, [ =( multiply( inverse( inverse( X ) ), identity ),
% 0.70/1.13 multiply( identity, X ) ) ] )
% 0.70/1.13 , 0, 6, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X )] )
% 0.70/1.13 ).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 subsumption(
% 0.70/1.13 clause( 156, [ =( multiply( inverse( inverse( X ) ), identity ), X ) ] )
% 0.70/1.13 , clause( 776, [ =( multiply( inverse( inverse( X ) ), identity ), X ) ] )
% 0.70/1.13 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 eqswap(
% 0.70/1.13 clause( 779, [ =( multiply( X, Y ), multiply( multiply( X, identity ), Y )
% 0.70/1.13 ) ] )
% 0.70/1.13 , clause( 22, [ =( multiply( multiply( Y, identity ), X ), multiply( Y, X )
% 0.70/1.13 ) ] )
% 0.70/1.13 , 0, substitution( 0, [ :=( X, Y ), :=( Y, X )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 paramod(
% 0.70/1.13 clause( 782, [ =( multiply( inverse( inverse( X ) ), Y ), multiply( X, Y )
% 0.70/1.13 ) ] )
% 0.70/1.13 , clause( 156, [ =( multiply( inverse( inverse( X ) ), identity ), X ) ] )
% 0.70/1.13 , 0, clause( 779, [ =( multiply( X, Y ), multiply( multiply( X, identity )
% 0.70/1.13 , Y ) ) ] )
% 0.70/1.13 , 0, 7, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, inverse(
% 0.70/1.13 inverse( X ) ) ), :=( Y, Y )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 subsumption(
% 0.70/1.13 clause( 161, [ =( multiply( inverse( inverse( X ) ), Y ), multiply( X, Y )
% 0.70/1.13 ) ] )
% 0.70/1.13 , clause( 782, [ =( multiply( inverse( inverse( X ) ), Y ), multiply( X, Y
% 0.70/1.13 ) ) ] )
% 0.70/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.70/1.13 )] ) ).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 eqswap(
% 0.70/1.13 clause( 788, [ =( multiply( X, Y ), multiply( inverse( inverse( X ) ), Y )
% 0.70/1.13 ) ] )
% 0.70/1.13 , clause( 161, [ =( multiply( inverse( inverse( X ) ), Y ), multiply( X, Y
% 0.70/1.13 ) ) ] )
% 0.70/1.13 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 paramod(
% 0.70/1.13 clause( 791, [ =( multiply( X, identity ), X ) ] )
% 0.70/1.13 , clause( 156, [ =( multiply( inverse( inverse( X ) ), identity ), X ) ] )
% 0.70/1.13 , 0, clause( 788, [ =( multiply( X, Y ), multiply( inverse( inverse( X ) )
% 0.70/1.13 , Y ) ) ] )
% 0.70/1.13 , 0, 4, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X ),
% 0.70/1.13 :=( Y, identity )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 subsumption(
% 0.70/1.13 clause( 339, [ =( multiply( X, identity ), X ) ] )
% 0.70/1.13 , clause( 791, [ =( multiply( X, identity ), X ) ] )
% 0.70/1.13 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 eqswap(
% 0.70/1.13 clause( 796, [ =( multiply( X, Y ), multiply( inverse( inverse( X ) ), Y )
% 0.70/1.13 ) ] )
% 0.70/1.13 , clause( 161, [ =( multiply( inverse( inverse( X ) ), Y ), multiply( X, Y
% 0.70/1.13 ) ) ] )
% 0.70/1.13 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 paramod(
% 0.70/1.13 clause( 799, [ =( multiply( X, inverse( X ) ), identity ) ] )
% 0.70/1.13 , clause( 1, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.70/1.13 , 0, clause( 796, [ =( multiply( X, Y ), multiply( inverse( inverse( X ) )
% 0.70/1.13 , Y ) ) ] )
% 0.70/1.13 , 0, 5, substitution( 0, [ :=( X, inverse( X ) )] ), substitution( 1, [
% 0.70/1.13 :=( X, X ), :=( Y, inverse( X ) )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 subsumption(
% 0.70/1.13 clause( 346, [ =( multiply( X, inverse( X ) ), identity ) ] )
% 0.70/1.13 , clause( 799, [ =( multiply( X, inverse( X ) ), identity ) ] )
% 0.70/1.13 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 eqswap(
% 0.70/1.13 clause( 802, [ =( X, multiply( X, identity ) ) ] )
% 0.70/1.13 , clause( 339, [ =( multiply( X, identity ), X ) ] )
% 0.70/1.13 , 0, substitution( 0, [ :=( X, X )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 paramod(
% 0.70/1.13 clause( 805, [ =( inverse( inverse( X ) ), multiply( X, identity ) ) ] )
% 0.70/1.13 , clause( 161, [ =( multiply( inverse( inverse( X ) ), Y ), multiply( X, Y
% 0.70/1.13 ) ) ] )
% 0.70/1.13 , 0, clause( 802, [ =( X, multiply( X, identity ) ) ] )
% 0.70/1.13 , 0, 4, substitution( 0, [ :=( X, X ), :=( Y, identity )] ), substitution(
% 0.70/1.13 1, [ :=( X, inverse( inverse( X ) ) )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 paramod(
% 0.70/1.13 clause( 806, [ =( inverse( inverse( X ) ), X ) ] )
% 0.70/1.13 , clause( 339, [ =( multiply( X, identity ), X ) ] )
% 0.70/1.13 , 0, clause( 805, [ =( inverse( inverse( X ) ), multiply( X, identity ) ) ]
% 0.70/1.13 )
% 0.70/1.13 , 0, 4, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X )] )
% 0.70/1.13 ).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 subsumption(
% 0.70/1.13 clause( 347, [ =( inverse( inverse( X ) ), X ) ] )
% 0.70/1.13 , clause( 806, [ =( inverse( inverse( X ) ), X ) ] )
% 0.70/1.13 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 eqswap(
% 0.70/1.13 clause( 809, [ =( multiply( X, identity ), multiply( multiply( X, inverse(
% 0.70/1.13 Y ) ), Y ) ) ] )
% 0.70/1.13 , clause( 21, [ =( multiply( multiply( Y, inverse( X ) ), X ), multiply( Y
% 0.70/1.13 , identity ) ) ] )
% 0.70/1.13 , 0, substitution( 0, [ :=( X, Y ), :=( Y, X )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 paramod(
% 0.70/1.13 clause( 811, [ =( multiply( X, identity ), multiply( multiply( X, Y ),
% 0.70/1.13 inverse( Y ) ) ) ] )
% 0.70/1.13 , clause( 347, [ =( inverse( inverse( X ) ), X ) ] )
% 0.70/1.13 , 0, clause( 809, [ =( multiply( X, identity ), multiply( multiply( X,
% 0.70/1.13 inverse( Y ) ), Y ) ) ] )
% 0.70/1.13 , 0, 7, substitution( 0, [ :=( X, Y )] ), substitution( 1, [ :=( X, X ),
% 0.70/1.13 :=( Y, inverse( Y ) )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 paramod(
% 0.70/1.13 clause( 812, [ =( X, multiply( multiply( X, Y ), inverse( Y ) ) ) ] )
% 0.70/1.13 , clause( 339, [ =( multiply( X, identity ), X ) ] )
% 0.70/1.13 , 0, clause( 811, [ =( multiply( X, identity ), multiply( multiply( X, Y )
% 0.70/1.13 , inverse( Y ) ) ) ] )
% 0.70/1.13 , 0, 1, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X ),
% 0.70/1.13 :=( Y, Y )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 eqswap(
% 0.70/1.13 clause( 813, [ =( multiply( multiply( X, Y ), inverse( Y ) ), X ) ] )
% 0.70/1.13 , clause( 812, [ =( X, multiply( multiply( X, Y ), inverse( Y ) ) ) ] )
% 0.70/1.13 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 subsumption(
% 0.70/1.13 clause( 350, [ =( multiply( multiply( Y, X ), inverse( X ) ), Y ) ] )
% 0.70/1.13 , clause( 813, [ =( multiply( multiply( X, Y ), inverse( Y ) ), X ) ] )
% 0.70/1.13 , substitution( 0, [ :=( X, Y ), :=( Y, X )] ), permutation( 0, [ ==>( 0, 0
% 0.70/1.13 )] ) ).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 eqswap(
% 0.70/1.13 clause( 815, [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.70/1.13 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.70/1.13 , clause( 12, [ =( 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z
% 0.70/1.13 ) ), multiply( X, 'greatest_lower_bound'( Y, Z ) ) ) ] )
% 0.70/1.13 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 paramod(
% 0.70/1.13 clause( 817, [ =( multiply( X, 'greatest_lower_bound'( Y, inverse( X ) ) )
% 0.70/1.13 , 'greatest_lower_bound'( multiply( X, Y ), identity ) ) ] )
% 0.70/1.13 , clause( 346, [ =( multiply( X, inverse( X ) ), identity ) ] )
% 0.70/1.13 , 0, clause( 815, [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.70/1.13 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.70/1.13 , 0, 11, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X ),
% 0.70/1.13 :=( Y, Y ), :=( Z, inverse( X ) )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 subsumption(
% 0.70/1.13 clause( 359, [ =( multiply( X, 'greatest_lower_bound'( Y, inverse( X ) ) )
% 0.70/1.13 , 'greatest_lower_bound'( multiply( X, Y ), identity ) ) ] )
% 0.70/1.13 , clause( 817, [ =( multiply( X, 'greatest_lower_bound'( Y, inverse( X ) )
% 0.70/1.13 ), 'greatest_lower_bound'( multiply( X, Y ), identity ) ) ] )
% 0.70/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.70/1.13 )] ) ).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 eqswap(
% 0.70/1.13 clause( 821, [ =( X, multiply( multiply( X, Y ), inverse( Y ) ) ) ] )
% 0.70/1.13 , clause( 350, [ =( multiply( multiply( Y, X ), inverse( X ) ), Y ) ] )
% 0.70/1.13 , 0, substitution( 0, [ :=( X, Y ), :=( Y, X )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 paramod(
% 0.70/1.13 clause( 826, [ =( multiply( inverse( multiply( X, Y ) ), X ), multiply(
% 0.70/1.13 identity, inverse( Y ) ) ) ] )
% 0.70/1.13 , clause( 20, [ =( multiply( multiply( inverse( multiply( X, Y ) ), X ), Y
% 0.70/1.13 ), identity ) ] )
% 0.70/1.13 , 0, clause( 821, [ =( X, multiply( multiply( X, Y ), inverse( Y ) ) ) ] )
% 0.70/1.13 , 0, 8, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [
% 0.70/1.13 :=( X, multiply( inverse( multiply( X, Y ) ), X ) ), :=( Y, Y )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 paramod(
% 0.70/1.13 clause( 827, [ =( multiply( inverse( multiply( X, Y ) ), X ), inverse( Y )
% 0.70/1.13 ) ] )
% 0.70/1.13 , clause( 0, [ =( multiply( identity, X ), X ) ] )
% 0.70/1.13 , 0, clause( 826, [ =( multiply( inverse( multiply( X, Y ) ), X ), multiply(
% 0.70/1.13 identity, inverse( Y ) ) ) ] )
% 0.70/1.13 , 0, 7, substitution( 0, [ :=( X, inverse( Y ) )] ), substitution( 1, [
% 0.70/1.13 :=( X, X ), :=( Y, Y )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 subsumption(
% 0.70/1.13 clause( 362, [ =( multiply( inverse( multiply( X, Y ) ), X ), inverse( Y )
% 0.70/1.13 ) ] )
% 0.70/1.13 , clause( 827, [ =( multiply( inverse( multiply( X, Y ) ), X ), inverse( Y
% 0.70/1.13 ) ) ] )
% 0.70/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.70/1.13 )] ) ).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 eqswap(
% 0.70/1.13 clause( 829, [ =( inverse( Y ), multiply( inverse( multiply( X, Y ) ), X )
% 0.70/1.13 ) ] )
% 0.70/1.13 , clause( 362, [ =( multiply( inverse( multiply( X, Y ) ), X ), inverse( Y
% 0.70/1.13 ) ) ] )
% 0.70/1.13 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 paramod(
% 0.70/1.13 clause( 833, [ =( inverse( X ), multiply( inverse( inverse( Y ) ), inverse(
% 0.70/1.13 multiply( X, Y ) ) ) ) ] )
% 0.70/1.13 , clause( 362, [ =( multiply( inverse( multiply( X, Y ) ), X ), inverse( Y
% 0.70/1.13 ) ) ] )
% 0.70/1.13 , 0, clause( 829, [ =( inverse( Y ), multiply( inverse( multiply( X, Y ) )
% 0.70/1.13 , X ) ) ] )
% 0.70/1.13 , 0, 5, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [
% 0.70/1.13 :=( X, inverse( multiply( X, Y ) ) ), :=( Y, X )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 paramod(
% 0.70/1.13 clause( 834, [ =( inverse( X ), multiply( Y, inverse( multiply( X, Y ) ) )
% 0.70/1.13 ) ] )
% 0.70/1.13 , clause( 161, [ =( multiply( inverse( inverse( X ) ), Y ), multiply( X, Y
% 0.70/1.13 ) ) ] )
% 0.70/1.13 , 0, clause( 833, [ =( inverse( X ), multiply( inverse( inverse( Y ) ),
% 0.70/1.13 inverse( multiply( X, Y ) ) ) ) ] )
% 0.70/1.13 , 0, 3, substitution( 0, [ :=( X, Y ), :=( Y, inverse( multiply( X, Y ) ) )] )
% 0.70/1.13 , substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 eqswap(
% 0.70/1.13 clause( 835, [ =( multiply( Y, inverse( multiply( X, Y ) ) ), inverse( X )
% 0.70/1.13 ) ] )
% 0.70/1.13 , clause( 834, [ =( inverse( X ), multiply( Y, inverse( multiply( X, Y ) )
% 0.70/1.13 ) ) ] )
% 0.70/1.13 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 subsumption(
% 0.70/1.13 clause( 368, [ =( multiply( Y, inverse( multiply( X, Y ) ) ), inverse( X )
% 0.70/1.13 ) ] )
% 0.70/1.13 , clause( 835, [ =( multiply( Y, inverse( multiply( X, Y ) ) ), inverse( X
% 0.70/1.13 ) ) ] )
% 0.70/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.70/1.13 )] ) ).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 eqswap(
% 0.70/1.13 clause( 836, [ =( inverse( Y ), multiply( X, inverse( multiply( Y, X ) ) )
% 0.70/1.13 ) ] )
% 0.70/1.13 , clause( 368, [ =( multiply( Y, inverse( multiply( X, Y ) ) ), inverse( X
% 0.70/1.13 ) ) ] )
% 0.70/1.13 , 0, substitution( 0, [ :=( X, Y ), :=( Y, X )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 paramod(
% 0.70/1.13 clause( 839, [ =( inverse( 'greatest_lower_bound'( X, Y ) ), multiply( Z,
% 0.70/1.13 inverse( multiply( 'greatest_lower_bound'( Y, X ), Z ) ) ) ) ] )
% 0.70/1.13 , clause( 122, [ =( multiply( 'greatest_lower_bound'( X, Z ), Y ), multiply(
% 0.70/1.13 'greatest_lower_bound'( Z, X ), Y ) ) ] )
% 0.70/1.13 , 0, clause( 836, [ =( inverse( Y ), multiply( X, inverse( multiply( Y, X )
% 0.70/1.13 ) ) ) ] )
% 0.70/1.13 , 0, 8, substitution( 0, [ :=( X, X ), :=( Y, Z ), :=( Z, Y )] ),
% 0.70/1.13 substitution( 1, [ :=( X, Z ), :=( Y, 'greatest_lower_bound'( X, Y ) )] )
% 0.70/1.13 ).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 paramod(
% 0.70/1.13 clause( 842, [ =( inverse( 'greatest_lower_bound'( X, Y ) ), inverse(
% 0.70/1.13 'greatest_lower_bound'( Y, X ) ) ) ] )
% 0.70/1.13 , clause( 368, [ =( multiply( Y, inverse( multiply( X, Y ) ) ), inverse( X
% 0.70/1.13 ) ) ] )
% 0.70/1.13 , 0, clause( 839, [ =( inverse( 'greatest_lower_bound'( X, Y ) ), multiply(
% 0.70/1.13 Z, inverse( multiply( 'greatest_lower_bound'( Y, X ), Z ) ) ) ) ] )
% 0.70/1.13 , 0, 5, substitution( 0, [ :=( X, 'greatest_lower_bound'( Y, X ) ), :=( Y,
% 0.70/1.13 Z )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 subsumption(
% 0.70/1.13 clause( 580, [ =( inverse( 'greatest_lower_bound'( Y, X ) ), inverse(
% 0.70/1.13 'greatest_lower_bound'( X, Y ) ) ) ] )
% 0.70/1.13 , clause( 842, [ =( inverse( 'greatest_lower_bound'( X, Y ) ), inverse(
% 0.70/1.13 'greatest_lower_bound'( Y, X ) ) ) ] )
% 0.70/1.13 , substitution( 0, [ :=( X, Y ), :=( Y, X )] ), permutation( 0, [ ==>( 0, 0
% 0.70/1.13 )] ) ).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 eqswap(
% 0.70/1.13 clause( 843, [ =( identity, multiply( inverse( X ), X ) ) ] )
% 0.70/1.13 , clause( 1, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.70/1.13 , 0, substitution( 0, [ :=( X, X )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 paramod(
% 0.70/1.13 clause( 844, [ =( identity, multiply( inverse( 'greatest_lower_bound'( Y, X
% 0.70/1.13 ) ), 'greatest_lower_bound'( X, Y ) ) ) ] )
% 0.70/1.13 , clause( 580, [ =( inverse( 'greatest_lower_bound'( Y, X ) ), inverse(
% 0.70/1.13 'greatest_lower_bound'( X, Y ) ) ) ] )
% 0.70/1.13 , 0, clause( 843, [ =( identity, multiply( inverse( X ), X ) ) ] )
% 0.70/1.13 , 0, 3, substitution( 0, [ :=( X, Y ), :=( Y, X )] ), substitution( 1, [
% 0.70/1.13 :=( X, 'greatest_lower_bound'( X, Y ) )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 eqswap(
% 0.70/1.13 clause( 847, [ =( multiply( inverse( 'greatest_lower_bound'( X, Y ) ),
% 0.70/1.13 'greatest_lower_bound'( Y, X ) ), identity ) ] )
% 0.70/1.13 , clause( 844, [ =( identity, multiply( inverse( 'greatest_lower_bound'( Y
% 0.70/1.13 , X ) ), 'greatest_lower_bound'( X, Y ) ) ) ] )
% 0.70/1.13 , 0, substitution( 0, [ :=( X, Y ), :=( Y, X )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 subsumption(
% 0.70/1.13 clause( 597, [ =( multiply( inverse( 'greatest_lower_bound'( Y, X ) ),
% 0.70/1.13 'greatest_lower_bound'( X, Y ) ), identity ) ] )
% 0.70/1.13 , clause( 847, [ =( multiply( inverse( 'greatest_lower_bound'( X, Y ) ),
% 0.70/1.13 'greatest_lower_bound'( Y, X ) ), identity ) ] )
% 0.70/1.13 , substitution( 0, [ :=( X, Y ), :=( Y, X )] ), permutation( 0, [ ==>( 0, 0
% 0.70/1.13 )] ) ).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 eqswap(
% 0.70/1.13 clause( 849, [ =( identity, multiply( inverse( 'greatest_lower_bound'( X, Y
% 0.70/1.13 ) ), 'greatest_lower_bound'( Y, X ) ) ) ] )
% 0.70/1.13 , clause( 597, [ =( multiply( inverse( 'greatest_lower_bound'( Y, X ) ),
% 0.70/1.13 'greatest_lower_bound'( X, Y ) ), identity ) ] )
% 0.70/1.13 , 0, substitution( 0, [ :=( X, Y ), :=( Y, X )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 eqswap(
% 0.70/1.13 clause( 854, [ ~( =( identity, a ) ) ] )
% 0.70/1.13 , clause( 17, [ ~( =( a, identity ) ) ] )
% 0.70/1.13 , 0, substitution( 0, [] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 paramod(
% 0.70/1.13 clause( 855, [ =( identity, multiply( inverse( inverse( a ) ),
% 0.70/1.13 'greatest_lower_bound'( identity, inverse( a ) ) ) ) ] )
% 0.70/1.13 , clause( 24, [ =( 'greatest_lower_bound'( inverse( a ), identity ),
% 0.70/1.13 inverse( a ) ) ] )
% 0.70/1.13 , 0, clause( 849, [ =( identity, multiply( inverse( 'greatest_lower_bound'(
% 0.70/1.13 X, Y ) ), 'greatest_lower_bound'( Y, X ) ) ) ] )
% 0.70/1.13 , 0, 4, substitution( 0, [] ), substitution( 1, [ :=( X, inverse( a ) ),
% 0.70/1.13 :=( Y, identity )] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 paramod(
% 0.70/1.13 clause( 857, [ =( identity, multiply( a, 'greatest_lower_bound'( identity,
% 0.70/1.13 inverse( a ) ) ) ) ] )
% 0.70/1.13 , clause( 161, [ =( multiply( inverse( inverse( X ) ), Y ), multiply( X, Y
% 0.70/1.13 ) ) ] )
% 0.70/1.13 , 0, clause( 855, [ =( identity, multiply( inverse( inverse( a ) ),
% 0.70/1.13 'greatest_lower_bound'( identity, inverse( a ) ) ) ) ] )
% 0.70/1.13 , 0, 2, substitution( 0, [ :=( X, a ), :=( Y, 'greatest_lower_bound'(
% 0.70/1.13 identity, inverse( a ) ) )] ), substitution( 1, [] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 paramod(
% 0.70/1.13 clause( 858, [ =( identity, 'greatest_lower_bound'( multiply( a, identity )
% 0.70/1.13 , identity ) ) ] )
% 0.70/1.13 , clause( 359, [ =( multiply( X, 'greatest_lower_bound'( Y, inverse( X ) )
% 0.70/1.13 ), 'greatest_lower_bound'( multiply( X, Y ), identity ) ) ] )
% 0.70/1.13 , 0, clause( 857, [ =( identity, multiply( a, 'greatest_lower_bound'(
% 0.70/1.13 identity, inverse( a ) ) ) ) ] )
% 0.70/1.13 , 0, 2, substitution( 0, [ :=( X, a ), :=( Y, identity )] ), substitution(
% 0.70/1.13 1, [] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 paramod(
% 0.70/1.13 clause( 859, [ =( identity, 'greatest_lower_bound'( a, identity ) ) ] )
% 0.70/1.13 , clause( 339, [ =( multiply( X, identity ), X ) ] )
% 0.70/1.13 , 0, clause( 858, [ =( identity, 'greatest_lower_bound'( multiply( a,
% 0.70/1.13 identity ), identity ) ) ] )
% 0.70/1.13 , 0, 3, substitution( 0, [ :=( X, a )] ), substitution( 1, [] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 paramod(
% 0.70/1.13 clause( 860, [ =( identity, a ) ] )
% 0.70/1.13 , clause( 25, [ =( 'greatest_lower_bound'( a, identity ), a ) ] )
% 0.70/1.13 , 0, clause( 859, [ =( identity, 'greatest_lower_bound'( a, identity ) ) ]
% 0.70/1.13 )
% 0.70/1.13 , 0, 2, substitution( 0, [] ), substitution( 1, [] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 resolution(
% 0.70/1.13 clause( 861, [] )
% 0.70/1.13 , clause( 854, [ ~( =( identity, a ) ) ] )
% 0.70/1.13 , 0, clause( 860, [ =( identity, a ) ] )
% 0.70/1.13 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 subsumption(
% 0.70/1.13 clause( 609, [] )
% 0.70/1.13 , clause( 861, [] )
% 0.70/1.13 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 end.
% 0.70/1.13
% 0.70/1.13 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.70/1.13
% 0.70/1.13 Memory use:
% 0.70/1.13
% 0.70/1.13 space for terms: 8012
% 0.70/1.14 space for clauses: 66258
% 0.70/1.14
% 0.70/1.14
% 0.70/1.14 clauses generated: 7779
% 0.70/1.14 clauses kept: 610
% 0.70/1.14 clauses selected: 123
% 0.70/1.14 clauses deleted: 4
% 0.70/1.14 clauses inuse deleted: 0
% 0.70/1.14
% 0.70/1.14 subsentry: 2215
% 0.70/1.14 literals s-matched: 1657
% 0.70/1.14 literals matched: 1637
% 0.70/1.14 full subsumption: 0
% 0.70/1.14
% 0.70/1.14 checksum: -868505280
% 0.70/1.14
% 0.70/1.14
% 0.70/1.14 Bliksem ended
%------------------------------------------------------------------------------