TSTP Solution File: GRP181-1 by CiME---2.01
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CiME---2.01
% Problem : GRP181-1 : TPTP v6.0.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_cime %s
% Computer : n078.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 32286.75MB
% OS : Linux 2.6.32-431.11.2.el6.x86_64
% CPULimit : 300s
% DateTime : Tue Jun 10 00:22:33 EDT 2014
% Result : Timeout 300.08s
% Output : None
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : GRP181-1 : TPTP v6.0.0. Bugfixed v1.2.1.
% % Command : tptp2X_and_run_cime %s
% % Computer : n078.star.cs.uiowa.edu
% % Model : x86_64 x86_64
% % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% % Memory : 32286.75MB
% % OS : Linux 2.6.32-431.11.2.el6.x86_64
% % CPULimit : 300
% % DateTime : Fri Jun 6 06:32:58 CDT 2014
% % CPUTime : 300.08
% Processing problem /tmp/CiME_37071_n078.star.cs.uiowa.edu
% #verbose 1;
% let F = signature " least_upper_bound,greatest_lower_bound : AC; b,c,a,identity : constant; inverse : 1; multiply : 2;";
% let X = vars "X Y Z";
% let Axioms = equations F X "
% multiply(multiply(X,Y),Z) = multiply(X,multiply(Y,Z));
% multiply(identity,X) = X;
% multiply(inverse(X),X) = identity;
% X least_upper_bound X = X;
% X greatest_lower_bound X = X;
% X least_upper_bound (X greatest_lower_bound Y) = X;
% X greatest_lower_bound (X least_upper_bound Y) = X;
% multiply(X,Y least_upper_bound Z) = multiply(X,Y) least_upper_bound multiply(X,Z);
% multiply(X,Y greatest_lower_bound Z) = multiply(X,Y) greatest_lower_bound multiply(X,Z);
% multiply(Y least_upper_bound Z,X) = multiply(Y,X) least_upper_bound multiply(Z,X);
% multiply(Y greatest_lower_bound Z,X) = multiply(Y,X) greatest_lower_bound multiply(Z,X);
% a greatest_lower_bound c = b greatest_lower_bound c;
% a least_upper_bound c = b least_upper_bound c;
% ";
%
% let s1 = status F "
% b lr_lex;
% c lr_lex;
% a lr_lex;
% inverse lr_lex;
% identity lr_lex;
% least_upper_bound mul;
% greatest_lower_bound mul;
% multiply mul;
% ";
%
% let p1 = precedence F "
% inverse > multiply > greatest_lower_bound > least_upper_bound > identity > a > c > b";
%
% let s2 = status F "
% b mul;
% c mul;
% a mul;
% least_upper_bound mul;
% greatest_lower_bound mul;
% inverse mul;
% multiply mul;
% identity mul;
% ";
%
% let p2 = precedence F "
% inverse > multiply > greatest_lower_bound > least_upper_bound > identity = a = c = b";
%
% let o_auto = AUTO Axioms;
%
% let o = LEX o_auto (LEX (ACRPO s1 p1) (ACRPO s2 p2));
%
% let Conjectures = equations F X " a = b;"
% ;
% (*
% let Red_Axioms = normalize_equations Defining_rules Axioms;
%
% let Red_Conjectures = normalize_equations Defining_rules Conjectures;
% *)
% #time on;
%
% let res = prove_conj_by_ordered_completion o Axioms Conjectures;
%
% #time off;
%
%
% let status = if res then "unsatisfiable" else "satisfiable";
% #quit;
% Verbose level is now 1
%
% F : signature = <signature>
% X : variable_set = <variable set>
%
% Axioms : (F,X) equations = { multiply(multiply(X,Y),Z) =
% multiply(X,multiply(Y,Z)),
% multiply(identity,X) = X,
% multiply(inverse(X),X) = identity,
% X least_upper_bound X = X,
% X greatest_lower_bound X = X,
% (X greatest_lower_bound Y) least_upper_bound X =
% X,
% (X least_upper_bound Y) greatest_lower_bound X =
% X,
% multiply(X,Y least_upper_bound Z) =
% multiply(X,Y) least_upper_bound multiply(X,Z),
% multiply(X,Y greatest_lower_bound Z) =
% multiply(X,Y) greatest_lower_bound multiply(X,Z),
% multiply(Y least_upper_bound Z,X) =
% multiply(Y,X) least_upper_bound multiply(Z,X),
% multiply(Y greatest_lower_bound Z,X) =
% multiply(Y,X) greatest_lower_bound multiply(Z,X),
% c greatest_lower_bound a =
% b greatest_lower_bound c,
% c least_upper_bound a = b least_upper_bound c }
% (13 equation(s))
% s1 : F status = <status>
% p1 : F precedence = <precedence>
% s2 : F status = <status>
% p2 : F precedence = <precedence>
% o_auto : F term_ordering = <term ordering>
% o : F term_ordering = <term ordering>
% Conjectures : (F,X) equations = { a = b } (1 equation(s))
% time is now on
%
% Initializing completion ...
% New rule produced : [1] X least_upper_bound X -> X
% Current number of equations to process: 0
% Current number of ordered equations: 12
% Current number of rules: 1
% New rule produced : [2] X greatest_lower_bound X -> X
% Current number of equations to process: 0
% Current number of ordered equations: 11
% Current number of rules: 2
% New rule produced : [3] multiply(identity,X) -> X
% Current number of equations to process: 0
% Current number of ordered equations: 10
% Current number of rules: 3
% New rule produced : [4] c least_upper_bound a -> b least_upper_bound c
% Current number of equations to process: 0
% Current number of ordered equations: 9
% Current number of rules: 4
% New rule produced : [5] c greatest_lower_bound a -> b greatest_lower_bound c
% Current number of equations to process: 0
% Current number of ordered equations: 8
% Current number of rules: 5
% New rule produced : [6] multiply(inverse(X),X) -> identity
% Current number of equations to process: 0
% Current number of ordered equations: 7
% Current number of rules: 6
% New rule produced : [7] (X greatest_lower_bound Y) least_upper_bound X -> X
% Current number of equations to process: 0
% Current number of ordered equations: 6
% Current number of rules: 7
% New rule produced : [8] (X least_upper_bound Y) greatest_lower_bound X -> X
% Current number of equations to process: 0
% Current number of ordered equations: 5
% Current number of rules: 8
% New rule produced :
% [9] multiply(multiply(X,Y),Z) -> multiply(X,multiply(Y,Z))
% Current number of equations to process: 0
% Current number of ordered equations: 4
% Current number of rules: 9
% New rule produced :
% [10]
% multiply(X,Y least_upper_bound Z) ->
% multiply(X,Y) least_upper_bound multiply(X,Z)
% Current number of equations to process: 0
% Current number of ordered equations: 3
% Current number of rules: 10
% New rule produced :
% [11]
% multiply(X,Y greatest_lower_bound Z) ->
% multiply(X,Y) greatest_lower_bound multiply(X,Z)
% Current number of equations to process: 0
% Current number of ordered equations: 2
% Current number of rules: 11
% New rule produced :
% [12]
% multiply(Y least_upper_bound Z,X) ->
% multiply(Y,X) least_upper_bound multiply(Z,X)
% Current number of equations to process: 0
% Current number of ordered equations: 1
% Current number of rules: 12
% New rule produced :
% [13]
% multiply(Y greatest_lower_bound Z,X) ->
% multiply(Y,X) greatest_lower_bound multiply(Z,X)
% Current number of equations to process: 0
% Current number of ordered equations: 0
% Current number of rules: 13
% New rule produced : [14] (b greatest_lower_bound c) least_upper_bound a -> a
% Current number of equations to process: 69
% Current number of ordered equations: 0
% Current number of rules: 14
% New rule produced : [15] (b least_upper_bound c) greatest_lower_bound a -> a
% Current number of equations to process: 68
% Current number of ordered equations: 0
% Current number of rules: 15
% New rule produced : [16] multiply(inverse(Y),multiply(Y,X)) -> X
% Current number of equations to process: 68
% Current number of ordered equations: 0
% Current number of rules: 16
% New rule produced :
% [17]
% (b greatest_lower_bound c greatest_lower_bound X) least_upper_bound a -> a
% Current number of equations to process: 67
% Current number of ordered equations: 0
% Current number of rules: 17
% New rule produced :
% [18] (b least_upper_bound c least_upper_bound X) greatest_lower_bound a -> a
% Current number of equations to process: 66
% Current number of ordered equations: 0
% Current number of rules: 18
% New rule produced :
% [19]
% (a greatest_lower_bound X) least_upper_bound b least_upper_bound c ->
% b least_upper_bound c
% Current number of equations to process: 65
% Current number of ordered equations: 0
% Current number of rules: 19
% New rule produced :
% [20]
% (a least_upper_bound X) greatest_lower_bound b greatest_lower_bound c ->
% b greatest_lower_bound c
% Current number of equations to process: 62
% Current number of ordered equations: 0
% Current number of rules: 20
% New rule produced : [21] multiply(inverse(identity),X) -> X
% Current number of equations to process: 103
% Current number of ordered equations: 0
% Current number of rules: 21
% New rule produced : [22] multiply(inverse(inverse(X)),identity) -> X
% Current number of equations to process: 103
% Current number of ordered equations: 0
% Current number of rules: 22
% New rule produced : [23] multiply(inverse(inverse(X)),Y) -> multiply(X,Y)
% Rule [22] multiply(inverse(inverse(X)),identity) -> X collapsed.
% Current number of equations to process: 103
% Current number of ordered equations: 0
% Current number of rules: 22
% New rule produced : [24] multiply(X,identity) -> X
% Current number of equations to process: 102
% Current number of ordered equations: 0
% Current number of rules: 23
% New rule produced : [25] multiply(X,inverse(X)) -> identity
% Current number of equations to process: 201
% Current number of ordered equations: 0
% Current number of rules: 24
% New rule produced : [26] multiply(Y,multiply(inverse(Y),X)) -> X
% Current number of equations to process: 201
% Current number of ordered equations: 0
% Current number of rules: 25
% New rule produced : [27] inverse(identity) -> identity
% Rule [21] multiply(inverse(identity),X) -> X collapsed.
% Current number of equations to process: 201
% Current number of ordered equations: 0
% Current number of rules: 25
% New rule produced : [28] inverse(inverse(X)) -> X
% Rule [23] multiply(inverse(inverse(X)),Y) -> multiply(X,Y) collapsed.
% Current number of equations to process: 201
% Current number of ordered equations: 0
% Current number of rules: 25
% New rule produced :
% [29] multiply(X,multiply(Y,inverse(multiply(X,Y)))) -> identity
% Current number of equations to process: 206
% Current number of ordered equations: 0
% Current number of rules: 26
% New rule produced : [30] multiply(Y,inverse(multiply(X,Y))) -> inverse(X)
% Rule [29] multiply(X,multiply(Y,inverse(multiply(X,Y)))) -> identity
% collapsed.
% Current number of equations to process: 212
% Current number of ordered equations: 0
% Current number of rules: 26
% New rule produced : [31] multiply(inverse(multiply(X,Y)),X) -> inverse(Y)
% Current number of equations to process: 212
% Current number of ordered equations: 0
% Current number of rules: 27
% New rule produced :
% [32] inverse(multiply(Y,X)) -> multiply(inverse(X),inverse(Y))
% Rule [30] multiply(Y,inverse(multiply(X,Y))) -> inverse(X) collapsed.
% Rule [31] multiply(inverse(multiply(X,Y)),X) -> inverse(Y) collapsed.
% Current number of equations to process: 219
% Current number of ordered equations: 0
% Current number of rules: 26
% New rule produced :
% [33]
% (b greatest_lower_bound c greatest_lower_bound X) least_upper_bound (a greatest_lower_bound X)
% -> a greatest_lower_bound X
% Current number of equations to process: 219
% Current number of ordered equations: 0
% Current number of rules: 27
% New rule produced :
% [34]
% (b greatest_lower_bound c) least_upper_bound (b greatest_lower_bound a) ->
% b greatest_lower_bound a
% Current number of equations to process: 262
% Current number of ordered equations: 0
% Current number of rules: 28
% New rule produced :
% [35]
% (b least_upper_bound c least_upper_bound X) greatest_lower_bound (a least_upper_bound X)
% -> a least_upper_bound X
% Current number of equations to process: 282
% Current number of ordered equations: 0
% Current number of rules: 29
% New rule produced :
% [36]
% (b least_upper_bound c) greatest_lower_bound (b least_upper_bound a) ->
% b least_upper_bound a
% Current number of equations to process: 325
% Current number of ordered equations: 0
% Current number of rules: 30
% New rule produced :
% [37]
% multiply(X,c) least_upper_bound multiply(X,a) ->
% multiply(X,b) least_upper_bound multiply(X,c)
% Current number of equations to process: 346
% Current number of ordered equations: 0
% Current number of rules: 31
% New rule produced :
% [38]
% identity least_upper_bound multiply(inverse(c),a) ->
% identity least_upper_bound multiply(inverse(c),b)
% Current number of equations to process: 363
% Current number of ordered equations: 0
% Current number of rules: 32
% New rule produced :
% [39]
% multiply(X,c) greatest_lower_bound multiply(X,a) ->
% multiply(X,b) greatest_lower_bound multiply(X,c)
% Current number of equations to process: 387
% Current number of ordered equations: 0
% Current number of rules: 33
% New rule produced :
% [40]
% identity greatest_lower_bound multiply(inverse(c),a) ->
% identity greatest_lower_bound multiply(inverse(c),b)
% Current number of equations to process: 404
% Current number of ordered equations: 0
% Current number of rules: 34
% New rule produced :
% [41]
% multiply(c,X) least_upper_bound multiply(a,X) ->
% multiply(b,X) least_upper_bound multiply(c,X)
% Current number of equations to process: 428
% Current number of ordered equations: 0
% Current number of rules: 35
% New rule produced :
% [42]
% identity least_upper_bound multiply(a,inverse(c)) ->
% identity least_upper_bound multiply(b,inverse(c))
% Current number of equations to process: 452
% Current number of ordered equations: 0
% Current number of rules: 36
% New rule produced :
% [43]
% multiply(c,X) greatest_lower_bound multiply(a,X) ->
% multiply(b,X) greatest_lower_bound multiply(c,X)
% Current number of equations to process: 475
% Current number of ordered equations: 0
% Current number of rules: 37
% New rule produced :
% [44]
% identity greatest_lower_bound multiply(a,inverse(c)) ->
% identity greatest_lower_bound multiply(b,inverse(c))
% Current number of equations to process: 499
% Current number of ordered equations: 0
% Current number of rules: 38
% New rule produced :
% [45]
% (b greatest_lower_bound c greatest_lower_bound X) least_upper_bound (b greatest_lower_bound a)
% -> b greatest_lower_bound a
% Current number of equations to process: 519
% Current number of ordered equations: 0
% Current number of rules: 39
% New rule produced :
% [46]
% ((b greatest_lower_bound a) least_upper_bound X) greatest_lower_bound b greatest_lower_bound c
% -> b greatest_lower_bound c
% Current number of equations to process: 532
% Current number of ordered equations: 0
% Current number of rules: 40
% New rule produced :
% [47]
% ((b least_upper_bound a) greatest_lower_bound X) least_upper_bound b least_upper_bound c
% -> b least_upper_bound c
% Current number of equations to process: 571
% Current number of ordered equations: 0
% Current number of rules: 41
% New rule produced :
% [48]
% (b least_upper_bound c least_upper_bound X) greatest_lower_bound (b least_upper_bound a)
% -> b least_upper_bound a
% Current number of equations to process: 612
% Current number of ordered equations: 0
% Current number of rules: 42
% New rule produced :
% [49]
% ((X least_upper_bound Y) greatest_lower_bound Z) least_upper_bound (X greatest_lower_bound Z)
% -> (X least_upper_bound Y) greatest_lower_bound Z
% Current number of equations to process: 619
% Current number of ordered equations: 1
% Current number of rules: 43
% New rule produced :
% [50]
% ((X greatest_lower_bound Y) least_upper_bound Z) greatest_lower_bound
% (X least_upper_bound Z) -> (X greatest_lower_bound Y) least_upper_bound Z
% Current number of equations to process: 663
% Current number of ordered equations: 0
% Current number of rules: 44
% New rule produced :
% [51]
% ((b greatest_lower_bound c) least_upper_bound X) greatest_lower_bound
% (a least_upper_bound X) -> (b greatest_lower_bound c) least_upper_bound X
% Current number of equations to process: 1533
% Current number of ordered equations: 0
% Current number of rules: 45
% New rule produced :
% [52]
% ((b least_upper_bound c) greatest_lower_bound X) least_upper_bound (a greatest_lower_bound X)
% -> (b least_upper_bound c) greatest_lower_bound X
% Current number of equations to process: 1592
% Current number of ordered equations: 0
% Current number of rules: 46
% New rule produced :
% [53]
% ((a greatest_lower_bound X) least_upper_bound c) greatest_lower_bound
% (b least_upper_bound c) -> (a greatest_lower_bound X) least_upper_bound c
% Current number of equations to process: 1650
% Current number of ordered equations: 1
% Current number of rules: 47
% New rule produced :
% [54]
% ((a greatest_lower_bound X) least_upper_bound b) greatest_lower_bound
% (b least_upper_bound c) -> (a greatest_lower_bound X) least_upper_bound b
% Current number of equations to process: 1650
% Current number of ordered equations: 0
% Current number of rules: 48
% New rule produced :
% [55]
% ((a least_upper_bound X) greatest_lower_bound b) least_upper_bound (b greatest_lower_bound c)
% -> (a least_upper_bound X) greatest_lower_bound b
% Current number of equations to process: 1728
% Current number of ordered equations: 1
% Current number of rules: 49
% New rule produced :
% [56]
% ((a least_upper_bound X) greatest_lower_bound c) least_upper_bound (b greatest_lower_bound c)
% -> (a least_upper_bound X) greatest_lower_bound c
% Current number of equations to process: 1728
% Current number of ordered equations: 0
% Current number of rules: 50
% New rule produced :
% [57]
% inverse(multiply(X,Y) least_upper_bound multiply(X,Z)) ->
% multiply(inverse(Y least_upper_bound Z),inverse(X))
% Current number of equations to process: 1809
% Current number of ordered equations: 0
% Current number of rules: 51
% New rule produced :
% [58]
% inverse(identity least_upper_bound multiply(inverse(X),Y)) ->
% multiply(inverse(X least_upper_bound Y),X)
% Current number of equations to process: 1810
% Current number of ordered equations: 0
% Current number of rules: 52
% New rule produced :
% [59]
% inverse(multiply(X,Y) least_upper_bound X) ->
% multiply(inverse(identity least_upper_bound Y),inverse(X))
% Current number of equations to process: 1819
% Current number of ordered equations: 0
% Current number of rules: 53
% New rule produced :
% [60]
% multiply(inverse(inverse(X) least_upper_bound Y),inverse(X)) <->
% inverse(identity least_upper_bound multiply(X,Y))
% Current number of equations to process: 1818
% Current number of ordered equations: 1
% Current number of rules: 54
% New rule produced :
% [61]
% inverse(identity least_upper_bound multiply(X,Y)) <->
% multiply(inverse(inverse(X) least_upper_bound Y),inverse(X))
% Current number of equations to process: 1818
% Current number of ordered equations: 0
% Current number of rules: 55
% New rule produced :
% [62]
% inverse(identity least_upper_bound inverse(X)) ->
% multiply(inverse(identity least_upper_bound X),X)
% Current number of equations to process: 1824
% Current number of ordered equations: 0
% Current number of rules: 56
% New rule produced :
% [63]
% multiply(inverse(identity least_upper_bound multiply(X,Y)),X) <->
% inverse(inverse(X) least_upper_bound Y)
% Current number of equations to process: 1832
% Current number of ordered equations: 1
% Current number of rules: 57
% New rule produced :
% [64]
% inverse(inverse(X) least_upper_bound Y) <->
% multiply(inverse(identity least_upper_bound multiply(X,Y)),X)
% Rule
% [62]
% inverse(identity least_upper_bound inverse(X)) ->
% multiply(inverse(identity least_upper_bound X),X) collapsed.
% Current number of equations to process: 1832
% Current number of ordered equations: 0
% Current number of rules: 57
% New rule produced :
% [65]
% inverse(multiply(X,Y) greatest_lower_bound multiply(X,Z)) ->
% multiply(inverse(Y greatest_lower_bound Z),inverse(X))
% Current number of equations to process: 1888
% Current number of ordered equations: 0
% Current number of rules: 58
% New rule produced :
% [66]
% inverse(identity greatest_lower_bound multiply(inverse(X),Y)) ->
% multiply(inverse(X greatest_lower_bound Y),X)
% Current number of equations to process: 1888
% Current number of ordered equations: 0
% Current number of rules: 59
% New rule produced :
% [67]
% inverse(multiply(X,Y) greatest_lower_bound X) ->
% multiply(inverse(identity greatest_lower_bound Y),inverse(X))
% Current number of equations to process: 1897
% Current number of ordered equations: 0
% Current number of rules: 60
% New rule produced :
% [68]
% inverse(identity greatest_lower_bound multiply(X,Y)) <->
% multiply(inverse(inverse(X) greatest_lower_bound Y),inverse(X))
% Current number of equations to process: 1896
% Current number of ordered equations: 1
% Current number of rules: 61
% New rule produced :
% [69]
% multiply(inverse(inverse(X) greatest_lower_bound Y),inverse(X)) <->
% inverse(identity greatest_lower_bound multiply(X,Y))
% Current number of equations to process: 1896
% Current number of ordered equations: 0
% Current number of rules: 62
% New rule produced :
% [70]
% inverse(identity greatest_lower_bound inverse(X)) ->
% multiply(inverse(identity greatest_lower_bound X),X)
% Current number of equations to process: 1908
% Current number of ordered equations: 0
% Current number of rules: 63
% New rule produced :
% [71]
% inverse(inverse(X) greatest_lower_bound Y) <->
% multiply(inverse(identity greatest_lower_bound multiply(X,Y)),X)
% Rule
% [70]
% inverse(identity greatest_lower_bound inverse(X)) ->
% multiply(inverse(identity greatest_lower_bound X),X) collapsed.
% Current number of equations to process: 1923
% Current number of ordered equations: 1
% Current number of rules: 63
% New rule produced :
% [72]
% multiply(inverse(identity greatest_lower_bound multiply(X,Y)),X) <->
% inverse(inverse(X) greatest_lower_bound Y)
% Current number of equations to process: 1923
% Current number of ordered equations: 0
% Current number of rules: 64
% New rule produced :
% [73]
% inverse(multiply(X,Y) least_upper_bound multiply(Z,Y)) ->
% multiply(inverse(Y),inverse(X least_upper_bound Z))
% Current number of equations to process: 2008
% Current number of ordered equations: 0
% Current number of rules: 65
% New rule produced :
% [74]
% inverse(multiply(X,Y) least_upper_bound Y) ->
% multiply(inverse(Y),inverse(identity least_upper_bound X))
% Current number of equations to process: 2013
% Current number of ordered equations: 0
% Current number of rules: 66
% New rule produced :
% [75]
% inverse(identity least_upper_bound multiply(X,inverse(Y))) ->
% multiply(Y,inverse(X least_upper_bound Y))
% Current number of equations to process: 2021
% Current number of ordered equations: 0
% Current number of rules: 67
% New rule produced :
% [76]
% inverse(identity least_upper_bound multiply(X,Y)) <->
% multiply(inverse(Y),inverse(inverse(Y) least_upper_bound X))
% Current number of equations to process: 2020
% Current number of ordered equations: 1
% Current number of rules: 68
% New rule produced :
% [77]
% multiply(inverse(Y),inverse(inverse(Y) least_upper_bound X)) <->
% inverse(identity least_upper_bound multiply(X,Y))
% Current number of equations to process: 2020
% Current number of ordered equations: 0
% Current number of rules: 69
% New rule produced :
% [78]
% multiply(inverse(identity least_upper_bound X),X) ->
% multiply(X,inverse(identity least_upper_bound X))
% Current number of equations to process: 2041
% Current number of ordered equations: 0
% Current number of rules: 70
% New rule produced :
% [79]
% multiply(inverse(identity least_upper_bound X),inverse(X)) ->
% multiply(inverse(X),inverse(identity least_upper_bound X))
% Current number of equations to process: 2047
% Current number of ordered equations: 0
% Current number of rules: 71
% New rule produced :
% [80]
% multiply(inverse(inverse(X) least_upper_bound Y),Y) <->
% multiply(X,inverse(inverse(Y) least_upper_bound X))
% Current number of equations to process: 2069
% Current number of ordered equations: 1
% Current number of rules: 72
% New rule produced :
% [81]
% multiply(X,inverse(inverse(Y) least_upper_bound X)) <->
% multiply(inverse(inverse(X) least_upper_bound Y),Y)
% Current number of equations to process: 2069
% Current number of ordered equations: 0
% Current number of rules: 73
% New rule produced :
% [82]
% inverse(inverse(X) least_upper_bound inverse(Y)) ->
% multiply(X,multiply(inverse(X least_upper_bound Y),Y))
% Current number of equations to process: 2088
% Current number of ordered equations: 0
% Current number of rules: 74
% New rule produced :
% [83]
% inverse(inverse(X) least_upper_bound Y) <->
% multiply(X,inverse(identity least_upper_bound multiply(Y,X)))
% Current number of equations to process: 2105
% Current number of ordered equations: 1
% Current number of rules: 75
% New rule produced :
% [84]
% multiply(X,inverse(identity least_upper_bound multiply(Y,X))) <->
% inverse(inverse(X) least_upper_bound Y)
% Current number of equations to process: 2105
% Current number of ordered equations: 0
% Current number of rules: 76
% New rule produced :
% [85]
% inverse(multiply(X,Y) greatest_lower_bound multiply(Z,Y)) ->
% multiply(inverse(Y),inverse(X greatest_lower_bound Z))
% Current number of equations to process: 2367
% Current number of ordered equations: 0
% Current number of rules: 77
% New rule produced :
% [86]
% inverse(multiply(X,Y) greatest_lower_bound Y) ->
% multiply(inverse(Y),inverse(identity greatest_lower_bound X))
% Current number of equations to process: 2372
% Current number of ordered equations: 0
% Current number of rules: 78
% New rule produced :
% [87]
% inverse(identity greatest_lower_bound multiply(X,inverse(Y))) ->
% multiply(Y,inverse(X greatest_lower_bound Y))
% Current number of equations to process: 2380
% Current number of ordered equations: 0
% Current number of rules: 79
% New rule produced :
% [88]
% inverse(identity greatest_lower_bound multiply(X,Y)) <->
% multiply(inverse(Y),inverse(inverse(Y) greatest_lower_bound X))
% Current number of equations to process: 2379
% Current number of ordered equations: 1
% Current number of rules: 80
% New rule produced :
% [89]
% multiply(inverse(Y),inverse(inverse(Y) greatest_lower_bound X)) <->
% inverse(identity greatest_lower_bound multiply(X,Y))
% Current number of equations to process: 2379
% Current number of ordered equations: 0
% Current number of rules: 81
% New rule produced :
% [90]
% multiply(inverse(identity greatest_lower_bound X),X) ->
% multiply(X,inverse(identity greatest_lower_bound X))
% Current number of equations to process: 2414
% Current number of ordered equations: 0
% Current number of rules: 82
% New rule produced :
% [91]
% multiply(inverse(identity greatest_lower_bound X),inverse(X)) ->
% multiply(inverse(X),inverse(identity greatest_lower_bound X))
% Current number of equations to process: 2422
% Current number of ordered equations: 0
% Current number of rules: 83
% New rule produced :
% [92]
% multiply(inverse(inverse(X) greatest_lower_bound Y),Y) <->
% multiply(X,inverse(inverse(Y) greatest_lower_bound X))
% Current number of equations to process: 2461
% Current number of ordered equations: 1
% Current number of rules: 84
% New rule produced :
% [93]
% multiply(X,inverse(inverse(Y) greatest_lower_bound X)) <->
% multiply(inverse(inverse(X) greatest_lower_bound Y),Y)
% Current number of equations to process: 2461
% Current number of ordered equations: 0
% Current number of rules: 85
% New rule produced :
% [94]
% inverse(inverse(X) greatest_lower_bound inverse(Y)) ->
% multiply(X,multiply(inverse(X greatest_lower_bound Y),Y))
% Current number of equations to process: 2487
% Current number of ordered equations: 0
% Current number of rules: 86
% New rule produced :
% [95]
% inverse(inverse(X) greatest_lower_bound Y) <->
% multiply(X,inverse(identity greatest_lower_bound multiply(Y,X)))
% Current number of equations to process: 2513
% Current number of ordered equations: 1
% Current number of rules: 87
% New rule produced :
% [96]
% multiply(X,inverse(identity greatest_lower_bound multiply(Y,X))) <->
% inverse(inverse(X) greatest_lower_bound Y)
% Current number of equations to process: 2513
% Current number of ordered equations: 0
% Current number of rules: 88
% New rule produced :
% [97]
% ((c least_upper_bound X) greatest_lower_bound a) least_upper_bound (b greatest_lower_bound c)
% -> (c least_upper_bound X) greatest_lower_bound a
% Current number of equations to process: 2848
% Current number of ordered equations: 1
% Current number of rules: 89
% New rule produced :
% [98]
% ((b greatest_lower_bound X) least_upper_bound a) greatest_lower_bound
% (b least_upper_bound c) -> (b greatest_lower_bound X) least_upper_bound a
% Current number of equations to process: 2888
% Current number of ordered equations: 2
% Current number of rules: 90
% New rule produced :
% [99]
% ((c greatest_lower_bound X) least_upper_bound a) greatest_lower_bound
% (b least_upper_bound c) -> (c greatest_lower_bound X) least_upper_bound a
% Current number of equations to process: 2888
% Current number of ordered equations: 1
% Current number of rules: 91
% New rule produced :
% [100]
% ((b least_upper_bound X) greatest_lower_bound a) least_upper_bound (b greatest_lower_bound c)
% -> (b least_upper_bound X) greatest_lower_bound a
% Current number of equations to process: 2968
% Current number of ordered equations: 0
% Current number of rules: 92
% New rule produced :
% [101]
% multiply(inverse(multiply(X,Z) least_upper_bound Y),X) <->
% inverse(multiply(inverse(X),Y) least_upper_bound Z)
% Current number of equations to process: 3005
% Current number of ordered equations: 1
% Current number of rules: 93
% New rule produced :
% [102]
% inverse(multiply(inverse(X),Y) least_upper_bound Z) <->
% multiply(inverse(multiply(X,Z) least_upper_bound Y),X)
% Rule
% [58]
% inverse(identity least_upper_bound multiply(inverse(X),Y)) ->
% multiply(inverse(X least_upper_bound Y),X) collapsed.
% Current number of equations to process: 3005
% Current number of ordered equations: 0
% Current number of rules: 93
% New rule produced :
% [103]
% inverse(identity least_upper_bound X) least_upper_bound multiply(X,inverse(
% identity least_upper_bound X))
% -> identity
% Current number of equations to process: 3148
% Current number of ordered equations: 0
% Current number of rules: 94
% New rule produced :
% [104]
% identity least_upper_bound inverse(identity least_upper_bound X) -> identity
% Current number of equations to process: 3156
% Current number of ordered equations: 0
% Current number of rules: 95
% New rule produced :
% [105]
% identity greatest_lower_bound inverse(identity least_upper_bound X) ->
% inverse(identity least_upper_bound X)
% Current number of equations to process: 3181
% Current number of ordered equations: 0
% Current number of rules: 96
% New rule produced :
% [106]
% identity least_upper_bound multiply(X,inverse(identity least_upper_bound X))
% -> identity
% Current number of equations to process: 3180
% Current number of ordered equations: 0
% Current number of rules: 97
% New rule produced :
% [107]
% (inverse(identity least_upper_bound X) greatest_lower_bound Y) least_upper_bound identity
% -> identity
% Current number of equations to process: 3179
% Current number of ordered equations: 0
% Current number of rules: 98
% New rule produced :
% [108]
% (identity least_upper_bound X) greatest_lower_bound inverse(identity least_upper_bound Y)
% -> inverse(identity least_upper_bound Y)
% Current number of equations to process: 3178
% Current number of ordered equations: 0
% Current number of rules: 99
% New rule produced :
% [109]
% (multiply(X,inverse(identity least_upper_bound X)) greatest_lower_bound Y) least_upper_bound identity
% -> identity
% Current number of equations to process: 3186
% Current number of ordered equations: 0
% Current number of rules: 100
% New rule produced :
% [110]
% identity greatest_lower_bound multiply(X,inverse(identity least_upper_bound X))
% -> multiply(X,inverse(identity least_upper_bound X))
% Current number of equations to process: 3188
% Current number of ordered equations: 0
% Current number of rules: 101
% New rule produced :
% [111]
% multiply(X,inverse(identity least_upper_bound Y)) least_upper_bound X -> X
% Current number of equations to process: 3244
% Current number of ordered equations: 0
% Current number of rules: 102
% New rule produced :
% [112]
% multiply(inverse(identity least_upper_bound Y),X) least_upper_bound X -> X
% Current number of equations to process: 3243
% Current number of ordered equations: 0
% Current number of rules: 103
% New rule produced :
% [113]
% identity least_upper_bound multiply(inverse(b least_upper_bound c),c) ->
% identity
% Current number of equations to process: 3242
% Current number of ordered equations: 0
% Current number of rules: 104
% New rule produced :
% [114]
% identity least_upper_bound multiply(X,inverse(X least_upper_bound Y)) ->
% identity
% Rule
% [106]
% identity least_upper_bound multiply(X,inverse(identity least_upper_bound X))
% -> identity collapsed.
% Current number of equations to process: 3263
% Current number of ordered equations: 0
% Current number of rules: 104
% New rule produced :
% [115]
% identity least_upper_bound multiply(inverse(X least_upper_bound Y),X) ->
% identity
% Rule
% [113]
% identity least_upper_bound multiply(inverse(b least_upper_bound c),c) ->
% identity collapsed.
% Current number of equations to process: 3269
% Current number of ordered equations: 0
% Current number of rules: 104
% New rule produced :
% [116]
% (multiply(inverse(b least_upper_bound c),c) greatest_lower_bound X) least_upper_bound identity
% -> identity
% Current number of equations to process: 3380
% Current number of ordered equations: 0
% Current number of rules: 105
% New rule produced :
% [117]
% (multiply(X,inverse(X least_upper_bound Y)) greatest_lower_bound Z) least_upper_bound identity
% -> identity
% Rule
% [109]
% (multiply(X,inverse(identity least_upper_bound X)) greatest_lower_bound Y) least_upper_bound identity
% -> identity collapsed.
% Current number of equations to process: 3379
% Current number of ordered equations: 0
% Current number of rules: 105
% New rule produced :
% [118]
% (multiply(inverse(X least_upper_bound Y),X) greatest_lower_bound Z) least_upper_bound identity
% -> identity
% Rule
% [116]
% (multiply(inverse(b least_upper_bound c),c) greatest_lower_bound X) least_upper_bound identity
% -> identity collapsed.
% Current number of equations to process: 3378
% Current number of ordered equations: 0
% Current number of rules: 105
% New rule produced :
% [119]
% multiply(X,inverse(identity least_upper_bound Y)) greatest_lower_bound X ->
% multiply(X,inverse(identity least_upper_bound Y))
% Current number of equations to process: 3433
% Current number of ordered equations: 0
% Current number of rules: 106
% New rule produced :
% [120]
% multiply(inverse(identity least_upper_bound X),Y) greatest_lower_bound Y ->
% multiply(inverse(identity least_upper_bound X),Y)
% Current number of equations to process: 3432
% Current number of ordered equations: 0
% Current number of rules: 107
% New rule produced :
% [121]
% identity greatest_lower_bound multiply(inverse(b least_upper_bound c),c) ->
% multiply(inverse(b least_upper_bound c),c)
% Current number of equations to process: 3431
% Current number of ordered equations: 0
% Current number of rules: 108
% New rule produced :
% [122]
% identity greatest_lower_bound multiply(X,inverse(X least_upper_bound Y)) ->
% multiply(X,inverse(X least_upper_bound Y))
% Rule
% [110]
% identity greatest_lower_bound multiply(X,inverse(identity least_upper_bound X))
% -> multiply(X,inverse(identity least_upper_bound X)) collapsed.
% Current number of equations to process: 3430
% Current number of ordered equations: 0
% Current number of rules: 108
% New rule produced :
% [123] inverse(inverse(X) least_upper_bound Y) least_upper_bound X -> X
% Current number of equations to process: 3520
% Current number of ordered equations: 0
% Current number of rules: 109
% New rule produced :
% [124]
% inverse(identity least_upper_bound X) least_upper_bound X ->
% identity least_upper_bound X
% Current number of equations to process: 3529
% Current number of ordered equations: 0
% Current number of rules: 110
% New rule produced :
% [125]
% identity least_upper_bound multiply(a,inverse(b least_upper_bound c)) ->
% identity
% Current number of equations to process: 3667
% Current number of ordered equations: 0
% Current number of rules: 111
% New rule produced :
% [126]
% identity least_upper_bound multiply(inverse(b least_upper_bound c),a) ->
% identity
% Current number of equations to process: 3755
% Current number of ordered equations: 0
% Current number of rules: 112
% New rule produced :
% [127]
% (multiply(X,inverse(identity least_upper_bound Y)) greatest_lower_bound Z) least_upper_bound X
% -> X
% Current number of equations to process: 3839
% Current number of ordered equations: 0
% Current number of rules: 113
% New rule produced :
% [128]
% multiply(X,multiply(inverse(b least_upper_bound c),c)) least_upper_bound X ->
% X
% Current number of equations to process: 3838
% Current number of ordered equations: 0
% Current number of rules: 114
% New rule produced :
% [129]
% multiply(X,multiply(Y,inverse(identity least_upper_bound Y))) least_upper_bound X
% -> X
% Current number of equations to process: 3836
% Current number of ordered equations: 0
% Current number of rules: 115
% New rule produced :
% [130]
% multiply(X,multiply(Y,inverse(Y least_upper_bound Z))) least_upper_bound X ->
% X
% Rule
% [129]
% multiply(X,multiply(Y,inverse(identity least_upper_bound Y))) least_upper_bound X
% -> X collapsed.
% Current number of equations to process: 3835
% Current number of ordered equations: 0
% Current number of rules: 115
% New rule produced :
% [131]
% multiply(X,multiply(inverse(Y least_upper_bound Z),Y)) least_upper_bound X ->
% X
% Rule
% [128]
% multiply(X,multiply(inverse(b least_upper_bound c),c)) least_upper_bound X ->
% X collapsed.
% Current number of equations to process: 3833
% Current number of ordered equations: 0
% Current number of rules: 115
% New rule produced :
% [132]
% (multiply(inverse(identity least_upper_bound Y),X) greatest_lower_bound Z) least_upper_bound X
% -> X
% Current number of equations to process: 3831
% Current number of ordered equations: 0
% Current number of rules: 116
% New rule produced :
% [133]
% multiply(inverse(b least_upper_bound c),multiply(c,X)) least_upper_bound X ->
% X
% Current number of equations to process: 3830
% Current number of ordered equations: 0
% Current number of rules: 117
% New rule produced :
% [134]
% multiply(X,multiply(inverse(identity least_upper_bound X),Y)) least_upper_bound Y
% -> Y
% Current number of equations to process: 3828
% Current number of ordered equations: 0
% Current number of rules: 118
% New rule produced :
% [135]
% multiply(X,multiply(inverse(X least_upper_bound Y),Z)) least_upper_bound Z ->
% Z
% Rule
% [134]
% multiply(X,multiply(inverse(identity least_upper_bound X),Y)) least_upper_bound Y
% -> Y collapsed.
% Current number of equations to process: 3827
% Current number of ordered equations: 0
% Current number of rules: 118
% New rule produced :
% [136]
% multiply(inverse(X least_upper_bound Y),multiply(X,Z)) least_upper_bound Z ->
% Z
% Rule
% [133]
% multiply(inverse(b least_upper_bound c),multiply(c,X)) least_upper_bound X ->
% X collapsed.
% Current number of equations to process: 3826
% Current number of ordered equations: 0
% Current number of rules: 118
% New rule produced :
% [137]
% identity least_upper_bound multiply(a,inverse(b least_upper_bound c least_upper_bound X))
% -> identity
% Current number of equations to process: 3825
% Current number of ordered equations: 0
% Current number of rules: 119
% New rule produced :
% [138]
% identity least_upper_bound multiply(inverse(b least_upper_bound c least_upper_bound X),a)
% -> identity
% Current number of equations to process: 3822
% Current number of ordered equations: 0
% Current number of rules: 120
% New rule produced :
% [139]
% (multiply(a,inverse(b least_upper_bound c)) greatest_lower_bound X) least_upper_bound identity
% -> identity
% Current number of equations to process: 3881
% Current number of ordered equations: 0
% Current number of rules: 121
% New rule produced :
% [140]
% (multiply(inverse(b least_upper_bound c),a) greatest_lower_bound X) least_upper_bound identity
% -> identity
% Current number of equations to process: 4012
% Current number of ordered equations: 0
% Current number of rules: 122
% New rule produced :
% [141]
% identity greatest_lower_bound multiply(inverse(X least_upper_bound Y),X) ->
% multiply(inverse(X least_upper_bound Y),X)
% Rule
% [121]
% identity greatest_lower_bound multiply(inverse(b least_upper_bound c),c) ->
% multiply(inverse(b least_upper_bound c),c) collapsed.
% Current number of equations to process: 4071
% Current number of ordered equations: 0
% Current number of rules: 122
% New rule produced :
% [142]
% (c greatest_lower_bound multiply(b,inverse(identity least_upper_bound X))) least_upper_bound a
% -> a
% Current number of equations to process: 4111
% Current number of ordered equations: 1
% Current number of rules: 123
% New rule produced :
% [143]
% (b greatest_lower_bound multiply(c,inverse(identity least_upper_bound X))) least_upper_bound a
% -> a
% Current number of equations to process: 4111
% Current number of ordered equations: 0
% Current number of rules: 124
% New rule produced :
% [144]
% (c greatest_lower_bound multiply(inverse(identity least_upper_bound X),b)) least_upper_bound a
% -> a
% Current number of equations to process: 4254
% Current number of ordered equations: 1
% Current number of rules: 125
% New rule produced :
% [145]
% (b greatest_lower_bound multiply(inverse(identity least_upper_bound X),c)) least_upper_bound a
% -> a
% Current number of equations to process: 4254
% Current number of ordered equations: 0
% Current number of rules: 126
% New rule produced :
% [146]
% identity greatest_lower_bound multiply(a,inverse(b least_upper_bound c)) ->
% multiply(a,inverse(b least_upper_bound c))
% Current number of equations to process: 4458
% Current number of ordered equations: 0
% Current number of rules: 127
% New rule produced :
% [147]
% inverse(X least_upper_bound Y) least_upper_bound inverse(X) -> inverse(X)
% Current number of equations to process: 4513
% Current number of ordered equations: 0
% Current number of rules: 128
% New rule produced :
% [148]
% identity least_upper_bound inverse(X) least_upper_bound X ->
% inverse(X) least_upper_bound X
% Current number of equations to process: 1950
% Current number of ordered equations: 0
% Current number of rules: 129
% New rule produced :
% [149]
% (inverse(inverse(X) least_upper_bound Y) greatest_lower_bound Z) least_upper_bound X
% -> X
% Current number of equations to process: 1951
% Current number of ordered equations: 1
% Current number of rules: 130
% New rule produced :
% [150]
% inverse(inverse(X greatest_lower_bound Y) least_upper_bound Z) least_upper_bound X
% -> X
% Current number of equations to process: 1951
% Current number of ordered equations: 0
% Current number of rules: 131
% New rule produced :
% [151]
% inverse(inverse(X) least_upper_bound Y) greatest_lower_bound X ->
% inverse(inverse(X) least_upper_bound Y)
% Current number of equations to process: 1950
% Current number of ordered equations: 0
% Current number of rules: 132
% New rule produced :
% [152]
% a least_upper_bound inverse(inverse(b greatest_lower_bound c) least_upper_bound X)
% -> a
% Current number of equations to process: 1949
% Current number of ordered equations: 0
% Current number of rules: 133
% New rule produced :
% [153]
% inverse((X greatest_lower_bound Y) least_upper_bound identity) least_upper_bound X
% -> identity least_upper_bound X
% Current number of equations to process: 1947
% Current number of ordered equations: 0
% Current number of rules: 134
% New rule produced :
% [154]
% a least_upper_bound inverse((b greatest_lower_bound c) least_upper_bound identity)
% -> a least_upper_bound identity
% Current number of equations to process: 1946
% Current number of ordered equations: 0
% Current number of rules: 135
% New rule produced :
% [155]
% b least_upper_bound c least_upper_bound inverse(inverse(a) least_upper_bound X)
% -> b least_upper_bound c
% Current number of equations to process: 2038
% Current number of ordered equations: 0
% Current number of rules: 136
% New rule produced :
% [156]
% b least_upper_bound c least_upper_bound inverse(a least_upper_bound identity)
% -> b least_upper_bound c least_upper_bound identity
% Current number of equations to process: 2037
% Current number of ordered equations: 0
% Current number of rules: 137
% New rule produced :
% [157]
% multiply(X,multiply(a,inverse(b least_upper_bound c))) least_upper_bound X ->
% X
% Current number of equations to process: 2036
% Current number of ordered equations: 0
% Current number of rules: 138
% New rule produced :
% [158]
% multiply(a,multiply(inverse(b least_upper_bound c),X)) least_upper_bound X ->
% X
% Current number of equations to process: 2035
% Current number of ordered equations: 0
% Current number of rules: 139
% New rule produced :
% [159]
% multiply(X,multiply(inverse(b least_upper_bound c),a)) least_upper_bound X ->
% X
% Current number of equations to process: 2034
% Current number of ordered equations: 0
% Current number of rules: 140
% New rule produced :
% [160]
% multiply(inverse(b least_upper_bound c),multiply(a,X)) least_upper_bound X ->
% X
% Current number of equations to process: 2033
% Current number of ordered equations: 0
% Current number of rules: 141
% New rule produced :
% [161]
% inverse(X) least_upper_bound multiply(X,inverse(identity least_upper_bound X))
% -> identity least_upper_bound inverse(X)
% Current number of equations to process: 3305
% Current number of ordered equations: 0
% Current number of rules: 142
% New rule produced :
% [162]
% identity greatest_lower_bound multiply(inverse(b least_upper_bound c),a) ->
% multiply(inverse(b least_upper_bound c),a)
% Current number of equations to process: 3303
% Current number of ordered equations: 0
% Current number of rules: 143
% New rule produced :
% [163]
% (c greatest_lower_bound inverse(inverse(b) least_upper_bound X)) least_upper_bound a
% -> a
% Current number of equations to process: 3512
% Current number of ordered equations: 0
% Current number of rules: 144
% New rule produced :
% [164]
% (b greatest_lower_bound inverse(inverse(c) least_upper_bound X)) least_upper_bound a
% -> a
% Current number of equations to process: 3587
% Current number of ordered equations: 0
% Current number of rules: 145
% New rule produced :
% [165]
% inverse(b least_upper_bound c) least_upper_bound inverse(a) -> inverse(a)
% Current number of equations to process: 3866
% Current number of ordered equations: 0
% Current number of rules: 146
% New rule produced :
% [166]
% inverse(X greatest_lower_bound Y) least_upper_bound inverse(X) ->
% inverse(X greatest_lower_bound Y)
% Current number of equations to process: 3913
% Current number of ordered equations: 0
% Current number of rules: 147
% New rule produced :
% [167]
% inverse(X least_upper_bound Y) greatest_lower_bound inverse(X) ->
% inverse(X least_upper_bound Y)
% Current number of equations to process: 3912
% Current number of ordered equations: 0
% Current number of rules: 148
% New rule produced :
% [168]
% inverse(b greatest_lower_bound c) least_upper_bound inverse(a) ->
% inverse(b greatest_lower_bound c)
% Current number of equations to process: 3911
% Current number of ordered equations: 0
% Current number of rules: 149
% New rule produced :
% [169]
% (inverse(X) least_upper_bound X) greatest_lower_bound identity -> identity
% Current number of equations to process: 4415
% Current number of ordered equations: 0
% Current number of rules: 150
% New rule produced :
% [170]
% (inverse(X) least_upper_bound X least_upper_bound Y) greatest_lower_bound identity
% -> identity
% Current number of equations to process: 4414
% Current number of ordered equations: 0
% Current number of rules: 151
% New rule produced :
% [171]
% (identity least_upper_bound X) greatest_lower_bound (inverse(X) least_upper_bound X)
% -> identity least_upper_bound X
% Current number of equations to process: 4514
% Current number of ordered equations: 0
% Current number of rules: 152
% New rule produced :
% [172]
% identity least_upper_bound inverse(inverse(X) least_upper_bound X least_upper_bound Y)
% -> identity
% Current number of equations to process: 4981
% Current number of ordered equations: 0
% Current number of rules: 153
% New rule produced :
% [173]
% inverse(b least_upper_bound c least_upper_bound X) least_upper_bound
% inverse(a) -> inverse(a)
% Current number of equations to process: 4992
% Current number of ordered equations: 0
% Current number of rules: 154
% New rule produced :
% [174]
% (inverse(X least_upper_bound Y) greatest_lower_bound Z) least_upper_bound
% inverse(X) -> inverse(X)
% Current number of equations to process: 4991
% Current number of ordered equations: 0
% Current number of rules: 155
% New rule produced :
% [175]
% (identity greatest_lower_bound Y) least_upper_bound inverse(X) least_upper_bound X
% -> inverse(X) least_upper_bound X
% Current number of equations to process: 4990
% Current number of ordered equations: 0
% Current number of rules: 156
% New rule produced :
% [176]
% identity least_upper_bound multiply(inverse(identity least_upper_bound
% multiply(X,X)),X) -> identity
% Current number of equations to process: 1847
% Current number of ordered equations: 0
% Current number of rules: 157
% New rule produced :
% [177]
% a greatest_lower_bound inverse(inverse(c) least_upper_bound X) ->
% b greatest_lower_bound inverse(inverse(c) least_upper_bound X)
% Current number of equations to process: 1846
% Current number of ordered equations: 0
% Current number of rules: 158
% New rule produced :
% [178]
% inverse(X least_upper_bound Y) least_upper_bound inverse(X greatest_lower_bound Z)
% -> inverse(X greatest_lower_bound Z)
% Current number of equations to process: 2866
% Current number of ordered equations: 0
% Current number of rules: 159
% New rule produced :
% [179]
% (inverse(X) least_upper_bound Y) greatest_lower_bound inverse(X least_upper_bound Z)
% -> inverse(X least_upper_bound Z)
% Current number of equations to process: 2865
% Current number of ordered equations: 0
% Current number of rules: 160
% New rule produced :
% [180]
% inverse(a least_upper_bound X) least_upper_bound inverse(b greatest_lower_bound c)
% -> inverse(b greatest_lower_bound c)
% Current number of equations to process: 2864
% Current number of ordered equations: 0
% Current number of rules: 161
% New rule produced :
% [181]
% inverse(b least_upper_bound c) least_upper_bound inverse(a greatest_lower_bound X)
% -> inverse(a greatest_lower_bound X)
% Current number of equations to process: 2863
% Current number of ordered equations: 0
% Current number of rules: 162
% New rule produced :
% [182]
% inverse(b greatest_lower_bound c) least_upper_bound inverse(b greatest_lower_bound a)
% -> inverse(b greatest_lower_bound c)
% Current number of equations to process: 2862
% Current number of ordered equations: 0
% Current number of rules: 163
% New rule produced :
% [183]
% (inverse(X) least_upper_bound X) greatest_lower_bound inverse(identity least_upper_bound Y)
% -> inverse(identity least_upper_bound Y)
% Current number of equations to process: 2861
% Current number of ordered equations: 0
% Current number of rules: 164
% New rule produced :
% [184]
% b least_upper_bound c least_upper_bound identity least_upper_bound inverse(a)
% -> b least_upper_bound c least_upper_bound inverse(a)
% Current number of equations to process: 2860
% Current number of ordered equations: 0
% Current number of rules: 165
% New rule produced :
% [185]
% (identity greatest_lower_bound X) least_upper_bound inverse(identity greatest_lower_bound X)
% -> identity least_upper_bound inverse(identity greatest_lower_bound X)
% Current number of equations to process: 2858
% Current number of ordered equations: 1
% Current number of rules: 166
% New rule produced :
% [186]
% identity least_upper_bound inverse(X greatest_lower_bound Y) least_upper_bound X
% -> inverse(X greatest_lower_bound Y) least_upper_bound X
% Current number of equations to process: 2858
% Current number of ordered equations: 0
% Current number of rules: 167
% New rule produced :
% [187]
% (identity least_upper_bound inverse(X)) greatest_lower_bound (inverse(X) least_upper_bound X)
% -> identity least_upper_bound inverse(X)
% Current number of equations to process: 2857
% Current number of ordered equations: 0
% Current number of rules: 168
% New rule produced :
% [188]
% a least_upper_bound identity least_upper_bound inverse(b greatest_lower_bound c)
% -> a least_upper_bound inverse(b greatest_lower_bound c)
% Current number of equations to process: 2856
% Current number of ordered equations: 0
% Current number of rules: 169
% New rule produced :
% [189]
% inverse(identity least_upper_bound Y) least_upper_bound inverse(X) least_upper_bound X
% -> inverse(X) least_upper_bound X
% Current number of equations to process: 2855
% Current number of ordered equations: 0
% Current number of rules: 170
% New rule produced :
% [190]
% inverse(b least_upper_bound c) greatest_lower_bound inverse(a) ->
% inverse(b least_upper_bound c)
% Current number of equations to process: 3197
% Current number of ordered equations: 0
% Current number of rules: 171
% New rule produced :
% [191]
% inverse(inverse(X) greatest_lower_bound Y) least_upper_bound X ->
% inverse(inverse(X) greatest_lower_bound Y)
% Current number of equations to process: 3339
% Current number of ordered equations: 0
% Current number of rules: 172
% New rule produced :
% [192]
% (inverse(b least_upper_bound c) greatest_lower_bound X) least_upper_bound
% inverse(a) -> inverse(a)
% Current number of equations to process: 3338
% Current number of ordered equations: 0
% Current number of rules: 173
% New rule produced :
% [193]
% inverse(X greatest_lower_bound Y) greatest_lower_bound inverse(X) ->
% inverse(X)
% Current number of equations to process: 3377
% Current number of ordered equations: 0
% Current number of rules: 174
% Rule [185]
% (identity greatest_lower_bound X) least_upper_bound inverse(identity greatest_lower_bound X)
% -> identity least_upper_bound inverse(identity greatest_lower_bound X) is composed into
% [185]
% (identity greatest_lower_bound X) least_upper_bound inverse(identity greatest_lower_bound X)
% -> inverse(identity greatest_lower_bound X)
% New rule produced :
% [194]
% identity least_upper_bound inverse(identity greatest_lower_bound X) ->
% inverse(identity greatest_lower_bound X)
% Current number of equations to process: 3396
% Current number of ordered equations: 0
% Current number of rules: 175
% New rule produced :
% [195]
% (inverse(X greatest_lower_bound Y) least_upper_bound Z) greatest_lower_bound
% inverse(X) -> inverse(X)
% Current number of equations to process: 3459
% Current number of ordered equations: 0
% Current number of rules: 176
% New rule produced :
% [196]
% inverse(b greatest_lower_bound c) greatest_lower_bound inverse(a) ->
% inverse(a)
% Current number of equations to process: 3791
% Current number of ordered equations: 0
% Current number of rules: 177
% New rule produced :
% [197]
% inverse(b greatest_lower_bound c greatest_lower_bound X) greatest_lower_bound
% inverse(a) -> inverse(a)
% Current number of equations to process: 3888
% Current number of ordered equations: 0
% Current number of rules: 178
% New rule produced :
% [198]
% identity greatest_lower_bound inverse(inverse(identity least_upper_bound X) greatest_lower_bound Y)
% -> identity
% Current number of equations to process: 4042
% Current number of ordered equations: 0
% Current number of rules: 179
% New rule produced :
% [199]
% (inverse(b greatest_lower_bound c) least_upper_bound X) greatest_lower_bound
% inverse(a) -> inverse(a)
% Current number of equations to process: 4339
% Current number of ordered equations: 0
% Current number of rules: 180Cputime limit exceeded (core dumped)
%
% EOF
%------------------------------------------------------------------------------