TSTP Solution File: GRP399-1 by CiME---2.01
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CiME---2.01
% Problem : GRP399-1 : TPTP v6.0.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_cime %s
% Computer : n055.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:51 EDT 2014
% Result : Timeout 300.03s
% Output : None
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : GRP399-1 : TPTP v6.0.0. Released v2.5.0.
% % Command : tptp2X_and_run_cime %s
% % Computer : n055.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 12:26:53 CDT 2014
% % CPUTime : 300.03
% Processing problem /tmp/CiME_52998_n055.star.cs.uiowa.edu
% #verbose 1;
% let F = signature " least_upper_bound,greatest_lower_bound : AC; identity : constant; inverse : 1; multiply : 2;identity_multiply_inverse_greatest_lower_bound_least_upper_bound__1, identity_multiply_inverse_greatest_lower_bound_least_upper_bound__2 : 0;";
% 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);
% ";
%
% let s1 = status F "
% 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 > identity_multiply_inverse_greatest_lower_bound_least_upper_bound__1 > identity_multiply_inverse_greatest_lower_bound_least_upper_bound__2";
%
% let s2 = status F "
% 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 > identity_multiply_inverse_greatest_lower_bound_least_upper_bound__1 > identity_multiply_inverse_greatest_lower_bound_least_upper_bound__2";
%
% let o_auto = AUTO Axioms;
%
% let o = LEX o_auto (LEX (ACRPO s1 p1) (ACRPO s2 p2));
%
% let Conjectures = equations F X "identity_multiply_inverse_greatest_lower_bound_least_upper_bound__1 = identity_multiply_inverse_greatest_lower_bound_least_upper_bound__2"
% ;
% (*
% 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) }
% (11 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 = { identity_multiply_inverse_greatest_lower_bound_least_upper_bound__1
% =
% identity_multiply_inverse_greatest_lower_bound_least_upper_bound__2 }
% (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: 10
% 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: 9
% 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: 8
% Current number of rules: 3
% New rule produced : [4] multiply(inverse(X),X) -> identity
% Current number of equations to process: 0
% Current number of ordered equations: 7
% Current number of rules: 4
% New rule produced : [5] (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: 5
% New rule produced : [6] (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: 6
% New rule produced :
% [7] 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: 7
% New rule produced :
% [8]
% 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: 8
% New rule produced :
% [9]
% 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: 9
% New rule produced :
% [10]
% 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: 10
% New rule produced :
% [11]
% 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: 11
% New rule produced : [12] multiply(inverse(Y),multiply(Y,X)) -> X
% Current number of equations to process: 46
% Current number of ordered equations: 0
% Current number of rules: 12
% New rule produced : [13] multiply(inverse(identity),X) -> X
% Current number of equations to process: 51
% Current number of ordered equations: 0
% Current number of rules: 13
% New rule produced : [14] multiply(inverse(inverse(X)),identity) -> X
% Current number of equations to process: 51
% Current number of ordered equations: 0
% Current number of rules: 14
% New rule produced : [15] multiply(inverse(inverse(X)),Y) -> multiply(X,Y)
% Rule [14] multiply(inverse(inverse(X)),identity) -> X collapsed.
% Current number of equations to process: 51
% Current number of ordered equations: 0
% Current number of rules: 14
% New rule produced : [16] multiply(X,identity) -> X
% Current number of equations to process: 50
% Current number of ordered equations: 0
% Current number of rules: 15
% New rule produced : [17] multiply(X,inverse(X)) -> identity
% Current number of equations to process: 53
% Current number of ordered equations: 0
% Current number of rules: 16
% New rule produced : [18] inverse(identity) -> identity
% Rule [13] multiply(inverse(identity),X) -> X collapsed.
% Current number of equations to process: 54
% Current number of ordered equations: 0
% Current number of rules: 16
% New rule produced : [19] inverse(inverse(X)) -> X
% Rule [15] multiply(inverse(inverse(X)),Y) -> multiply(X,Y) collapsed.
% Current number of equations to process: 54
% Current number of ordered equations: 0
% Current number of rules: 16
% New rule produced : [20] multiply(Y,multiply(inverse(Y),X)) -> X
% Current number of equations to process: 54
% Current number of ordered equations: 0
% Current number of rules: 17
% New rule produced :
% [21] multiply(X,multiply(Y,inverse(multiply(X,Y)))) -> identity
% Current number of equations to process: 58
% Current number of ordered equations: 0
% Current number of rules: 18
% New rule produced : [22] multiply(Y,inverse(multiply(X,Y))) -> inverse(X)
% Rule [21] multiply(X,multiply(Y,inverse(multiply(X,Y)))) -> identity
% collapsed.
% Current number of equations to process: 58
% Current number of ordered equations: 0
% Current number of rules: 18
% New rule produced :
% [23] inverse(multiply(Y,X)) -> multiply(inverse(X),inverse(Y))
% Rule [22] multiply(Y,inverse(multiply(X,Y))) -> inverse(X) collapsed.
% Current number of equations to process: 60
% Current number of ordered equations: 0
% Current number of rules: 18
% New rule produced :
% [24]
% ((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: 58
% Current number of ordered equations: 1
% Current number of rules: 19
% New rule produced :
% [25]
% ((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: 58
% Current number of ordered equations: 0
% Current number of rules: 20
% New rule produced :
% [26]
% 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: 220
% Current number of ordered equations: 0
% Current number of rules: 21
% New rule produced :
% [27]
% inverse(identity least_upper_bound multiply(inverse(X),Y)) ->
% multiply(inverse(X least_upper_bound Y),X)
% Current number of equations to process: 224
% Current number of ordered equations: 0
% Current number of rules: 22
% New rule produced :
% [28]
% inverse(multiply(X,Y) least_upper_bound X) ->
% multiply(inverse(identity least_upper_bound Y),inverse(X))
% Current number of equations to process: 230
% Current number of ordered equations: 0
% Current number of rules: 23
% New rule produced :
% [29]
% inverse(identity least_upper_bound multiply(X,Y)) <->
% multiply(inverse(inverse(X) least_upper_bound Y),inverse(X))
% Current number of equations to process: 229
% Current number of ordered equations: 1
% Current number of rules: 24
% New rule produced :
% [30]
% multiply(inverse(inverse(X) least_upper_bound Y),inverse(X)) <->
% inverse(identity least_upper_bound multiply(X,Y))
% Current number of equations to process: 229
% Current number of ordered equations: 0
% Current number of rules: 25
% New rule produced :
% [31]
% inverse(identity least_upper_bound inverse(X)) ->
% multiply(inverse(identity least_upper_bound X),X)
% Current number of equations to process: 235
% Current number of ordered equations: 0
% Current number of rules: 26
% New rule produced :
% [32]
% inverse(inverse(X) least_upper_bound Y) <->
% multiply(inverse(identity least_upper_bound multiply(X,Y)),X)
% Rule
% [31]
% inverse(identity least_upper_bound inverse(X)) ->
% multiply(inverse(identity least_upper_bound X),X) collapsed.
% Current number of equations to process: 243
% Current number of ordered equations: 1
% Current number of rules: 26
% New rule produced :
% [33]
% multiply(inverse(identity least_upper_bound multiply(X,Y)),X) <->
% inverse(inverse(X) least_upper_bound Y)
% Current number of equations to process: 243
% Current number of ordered equations: 0
% Current number of rules: 27
% New rule produced :
% [34]
% 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: 293
% Current number of ordered equations: 0
% Current number of rules: 28
% New rule produced :
% [35]
% inverse(identity greatest_lower_bound multiply(inverse(X),Y)) ->
% multiply(inverse(X greatest_lower_bound Y),X)
% Current number of equations to process: 299
% Current number of ordered equations: 0
% Current number of rules: 29
% New rule produced :
% [36]
% inverse(multiply(X,Y) greatest_lower_bound X) ->
% multiply(inverse(identity greatest_lower_bound Y),inverse(X))
% Current number of equations to process: 305
% Current number of ordered equations: 0
% Current number of rules: 30
% New rule produced :
% [37]
% inverse(identity greatest_lower_bound multiply(X,Y)) <->
% multiply(inverse(inverse(X) greatest_lower_bound Y),inverse(X))
% Current number of equations to process: 304
% Current number of ordered equations: 1
% Current number of rules: 31
% New rule produced :
% [38]
% multiply(inverse(inverse(X) greatest_lower_bound Y),inverse(X)) <->
% inverse(identity greatest_lower_bound multiply(X,Y))
% Current number of equations to process: 304
% Current number of ordered equations: 0
% Current number of rules: 32
% New rule produced :
% [39]
% inverse(identity greatest_lower_bound inverse(X)) ->
% multiply(inverse(identity greatest_lower_bound X),X)
% Current number of equations to process: 315
% Current number of ordered equations: 0
% Current number of rules: 33
% New rule produced :
% [40]
% inverse(inverse(X) greatest_lower_bound Y) <->
% multiply(inverse(identity greatest_lower_bound multiply(X,Y)),X)
% Rule
% [39]
% inverse(identity greatest_lower_bound inverse(X)) ->
% multiply(inverse(identity greatest_lower_bound X),X) collapsed.
% Current number of equations to process: 333
% Current number of ordered equations: 1
% Current number of rules: 33
% New rule produced :
% [41]
% multiply(inverse(identity greatest_lower_bound multiply(X,Y)),X) <->
% inverse(inverse(X) greatest_lower_bound Y)
% Current number of equations to process: 333
% Current number of ordered equations: 0
% Current number of rules: 34
% New rule produced :
% [42]
% 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: 409
% Current number of ordered equations: 0
% Current number of rules: 35
% New rule produced :
% [43]
% inverse(multiply(X,Y) least_upper_bound Y) ->
% multiply(inverse(Y),inverse(identity least_upper_bound X))
% Current number of equations to process: 419
% Current number of ordered equations: 0
% Current number of rules: 36
% New rule produced :
% [44]
% inverse(identity least_upper_bound multiply(X,inverse(Y))) ->
% multiply(Y,inverse(X least_upper_bound Y))
% Current number of equations to process: 424
% Current number of ordered equations: 0
% Current number of rules: 37
% New rule produced :
% [45]
% inverse(identity least_upper_bound multiply(X,Y)) <->
% multiply(inverse(Y),inverse(inverse(Y) least_upper_bound X))
% Current number of equations to process: 423
% Current number of ordered equations: 1
% Current number of rules: 38
% New rule produced :
% [46]
% multiply(inverse(Y),inverse(inverse(Y) least_upper_bound X)) <->
% inverse(identity least_upper_bound multiply(X,Y))
% Current number of equations to process: 423
% Current number of ordered equations: 0
% Current number of rules: 39
% New rule produced :
% [47]
% multiply(inverse(identity least_upper_bound X),X) ->
% multiply(X,inverse(identity least_upper_bound X))
% Current number of equations to process: 444
% Current number of ordered equations: 0
% Current number of rules: 40
% New rule produced :
% [48]
% multiply(inverse(identity least_upper_bound X),inverse(X)) ->
% multiply(inverse(X),inverse(identity least_upper_bound X))
% Current number of equations to process: 448
% Current number of ordered equations: 0
% Current number of rules: 41
% New rule produced :
% [49]
% multiply(X,inverse(inverse(Y) least_upper_bound X)) <->
% multiply(inverse(inverse(X) least_upper_bound Y),Y)
% Current number of equations to process: 469
% Current number of ordered equations: 1
% Current number of rules: 42
% New rule produced :
% [50]
% multiply(inverse(inverse(X) least_upper_bound Y),Y) <->
% multiply(X,inverse(inverse(Y) least_upper_bound X))
% Current number of equations to process: 469
% Current number of ordered equations: 0
% Current number of rules: 43
% New rule produced :
% [51]
% inverse(inverse(X) least_upper_bound inverse(Y)) ->
% multiply(X,multiply(inverse(X least_upper_bound Y),Y))
% Current number of equations to process: 489
% Current number of ordered equations: 0
% Current number of rules: 44
% New rule produced :
% [52]
% inverse(inverse(X) least_upper_bound Y) <->
% multiply(X,inverse(identity least_upper_bound multiply(Y,X)))
% Current number of equations to process: 499
% Current number of ordered equations: 1
% Current number of rules: 45
% New rule produced :
% [53]
% multiply(X,inverse(identity least_upper_bound multiply(Y,X))) <->
% inverse(inverse(X) least_upper_bound Y)
% Current number of equations to process: 499
% Current number of ordered equations: 0
% Current number of rules: 46
% New rule produced :
% [54]
% 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: 743
% Current number of ordered equations: 0
% Current number of rules: 47
% New rule produced :
% [55]
% inverse(multiply(X,Y) greatest_lower_bound Y) ->
% multiply(inverse(Y),inverse(identity greatest_lower_bound X))
% Current number of equations to process: 753
% Current number of ordered equations: 0
% Current number of rules: 48
% New rule produced :
% [56]
% inverse(identity greatest_lower_bound multiply(X,inverse(Y))) ->
% multiply(Y,inverse(X greatest_lower_bound Y))
% Current number of equations to process: 758
% Current number of ordered equations: 0
% Current number of rules: 49
% New rule produced :
% [57]
% inverse(identity greatest_lower_bound multiply(X,Y)) <->
% multiply(inverse(Y),inverse(inverse(Y) greatest_lower_bound X))
% Current number of equations to process: 757
% Current number of ordered equations: 1
% Current number of rules: 50
% New rule produced :
% [58]
% multiply(inverse(Y),inverse(inverse(Y) greatest_lower_bound X)) <->
% inverse(identity greatest_lower_bound multiply(X,Y))
% Current number of equations to process: 757
% Current number of ordered equations: 0
% Current number of rules: 51
% New rule produced :
% [59]
% multiply(inverse(identity greatest_lower_bound X),X) ->
% multiply(X,inverse(identity greatest_lower_bound X))
% Current number of equations to process: 792
% Current number of ordered equations: 0
% Current number of rules: 52
% New rule produced :
% [60]
% multiply(inverse(identity greatest_lower_bound X),inverse(X)) ->
% multiply(inverse(X),inverse(identity greatest_lower_bound X))
% Current number of equations to process: 798
% Current number of ordered equations: 0
% Current number of rules: 53
% New rule produced :
% [61]
% multiply(X,inverse(inverse(Y) greatest_lower_bound X)) <->
% multiply(inverse(inverse(X) greatest_lower_bound Y),Y)
% Current number of equations to process: 836
% Current number of ordered equations: 1
% Current number of rules: 54
% New rule produced :
% [62]
% multiply(inverse(inverse(X) greatest_lower_bound Y),Y) <->
% multiply(X,inverse(inverse(Y) greatest_lower_bound X))
% Current number of equations to process: 836
% Current number of ordered equations: 0
% Current number of rules: 55
% New rule produced :
% [63]
% inverse(inverse(X) greatest_lower_bound inverse(Y)) ->
% multiply(X,multiply(inverse(X greatest_lower_bound Y),Y))
% Current number of equations to process: 863
% Current number of ordered equations: 0
% Current number of rules: 56
% New rule produced :
% [64]
% inverse(inverse(X) greatest_lower_bound Y) <->
% multiply(X,inverse(identity greatest_lower_bound multiply(Y,X)))
% Current number of equations to process: 882
% Current number of ordered equations: 1
% Current number of rules: 57
% New rule produced :
% [65]
% multiply(X,inverse(identity greatest_lower_bound multiply(Y,X))) <->
% inverse(inverse(X) greatest_lower_bound Y)
% Current number of equations to process: 882
% Current number of ordered equations: 0
% Current number of rules: 58
% New rule produced :
% [66]
% inverse(multiply(inverse(X),Y) least_upper_bound Z) <->
% multiply(inverse(multiply(X,Z) least_upper_bound Y),X)
% Rule
% [27]
% inverse(identity least_upper_bound multiply(inverse(X),Y)) ->
% multiply(inverse(X least_upper_bound Y),X) collapsed.
% Current number of equations to process: 1198
% Current number of ordered equations: 1
% Current number of rules: 58
% New rule produced :
% [67]
% 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: 1198
% Current number of ordered equations: 0
% Current number of rules: 59
% New rule produced :
% [68]
% inverse(identity least_upper_bound X) least_upper_bound multiply(X,inverse(
% identity least_upper_bound X))
% -> identity
% Current number of equations to process: 1324
% Current number of ordered equations: 0
% Current number of rules: 60
% New rule produced :
% [69]
% identity least_upper_bound inverse(identity least_upper_bound X) -> identity
% Current number of equations to process: 1329
% Current number of ordered equations: 0
% Current number of rules: 61
% New rule produced :
% [70]
% identity greatest_lower_bound inverse(identity least_upper_bound X) ->
% inverse(identity least_upper_bound X)
% Current number of equations to process: 1356
% Current number of ordered equations: 0
% Current number of rules: 62
% New rule produced :
% [71]
% identity least_upper_bound multiply(X,inverse(identity least_upper_bound X))
% -> identity
% Current number of equations to process: 1355
% Current number of ordered equations: 0
% Current number of rules: 63
% New rule produced :
% [72]
% (inverse(identity least_upper_bound X) greatest_lower_bound Y) least_upper_bound identity
% -> identity
% Current number of equations to process: 1354
% Current number of ordered equations: 0
% Current number of rules: 64
% New rule produced :
% [73]
% (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: 1353
% Current number of ordered equations: 0
% Current number of rules: 65
% New rule produced :
% [74]
% (multiply(X,inverse(identity least_upper_bound X)) greatest_lower_bound Y) least_upper_bound identity
% -> identity
% Current number of equations to process: 1361
% Current number of ordered equations: 0
% Current number of rules: 66
% New rule produced :
% [75]
% 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: 1359
% Current number of ordered equations: 0
% Current number of rules: 67
% New rule produced :
% [76]
% multiply(X,inverse(identity least_upper_bound Y)) least_upper_bound X -> X
% Current number of equations to process: 1407
% Current number of ordered equations: 0
% Current number of rules: 68
% New rule produced :
% [77]
% multiply(inverse(identity least_upper_bound Y),X) least_upper_bound X -> X
% Current number of equations to process: 1406
% Current number of ordered equations: 0
% Current number of rules: 69
% New rule produced :
% [78]
% identity least_upper_bound multiply(X,inverse(X least_upper_bound Y)) ->
% identity
% Rule
% [71]
% identity least_upper_bound multiply(X,inverse(identity least_upper_bound X))
% -> identity collapsed.
% Current number of equations to process: 1427
% Current number of ordered equations: 0
% Current number of rules: 69
% New rule produced :
% [79]
% identity least_upper_bound multiply(inverse(X least_upper_bound Y),X) ->
% identity
% Current number of equations to process: 1434
% Current number of ordered equations: 0
% Current number of rules: 70
% New rule produced :
% [80]
% (multiply(X,inverse(X least_upper_bound Y)) greatest_lower_bound Z) least_upper_bound identity
% -> identity
% Rule
% [74]
% (multiply(X,inverse(identity least_upper_bound X)) greatest_lower_bound Y) least_upper_bound identity
% -> identity collapsed.
% Current number of equations to process: 1529
% Current number of ordered equations: 0
% Current number of rules: 70
% New rule produced :
% [81]
% (multiply(inverse(X least_upper_bound Y),X) greatest_lower_bound Z) least_upper_bound identity
% -> identity
% Current number of equations to process: 1528
% Current number of ordered equations: 0
% Current number of rules: 71
% New rule produced :
% [82]
% 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: 1578
% Current number of ordered equations: 0
% Current number of rules: 72
% New rule produced :
% [83]
% 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: 1577
% Current number of ordered equations: 0
% Current number of rules: 73
% New rule produced :
% [84]
% identity greatest_lower_bound multiply(X,inverse(X least_upper_bound Y)) ->
% multiply(X,inverse(X least_upper_bound Y))
% Rule
% [75]
% 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: 1576
% Current number of ordered equations: 0
% Current number of rules: 73
% New rule produced :
% [85] inverse(inverse(X) least_upper_bound Y) least_upper_bound X -> X
% Current number of equations to process: 1641
% Current number of ordered equations: 0
% Current number of rules: 74
% New rule produced :
% [86]
% inverse(identity least_upper_bound X) least_upper_bound X ->
% identity least_upper_bound X
% Current number of equations to process: 1650
% Current number of ordered equations: 0
% Current number of rules: 75
% New rule produced :
% [87]
% (multiply(X,inverse(identity least_upper_bound Y)) greatest_lower_bound Z) least_upper_bound X
% -> X
% Current number of equations to process: 1892
% Current number of ordered equations: 0
% Current number of rules: 76
% New rule produced :
% [88]
% multiply(X,multiply(Y,inverse(identity least_upper_bound Y))) least_upper_bound X
% -> X
% Current number of equations to process: 1891
% Current number of ordered equations: 0
% Current number of rules: 77
% New rule produced :
% [89]
% multiply(X,multiply(Y,inverse(Y least_upper_bound Z))) least_upper_bound X ->
% X
% Rule
% [88]
% multiply(X,multiply(Y,inverse(identity least_upper_bound Y))) least_upper_bound X
% -> X collapsed.
% Current number of equations to process: 1890
% Current number of ordered equations: 0
% Current number of rules: 77
% New rule produced :
% [90]
% multiply(X,multiply(inverse(Y least_upper_bound Z),Y)) least_upper_bound X ->
% X
% Current number of equations to process: 1888
% Current number of ordered equations: 0
% Current number of rules: 78
% New rule produced :
% [91]
% (multiply(inverse(identity least_upper_bound Y),X) greatest_lower_bound Z) least_upper_bound X
% -> X
% Current number of equations to process: 1886
% Current number of ordered equations: 0
% Current number of rules: 79
% New rule produced :
% [92]
% multiply(X,multiply(inverse(identity least_upper_bound X),Y)) least_upper_bound Y
% -> Y
% Current number of equations to process: 1885
% Current number of ordered equations: 0
% Current number of rules: 80
% New rule produced :
% [93]
% multiply(X,multiply(inverse(X least_upper_bound Y),Z)) least_upper_bound Z ->
% Z
% Rule
% [92]
% multiply(X,multiply(inverse(identity least_upper_bound X),Y)) least_upper_bound Y
% -> Y collapsed.
% Current number of equations to process: 1884
% Current number of ordered equations: 0
% Current number of rules: 80
% New rule produced :
% [94]
% multiply(inverse(X least_upper_bound Y),multiply(X,Z)) least_upper_bound Z ->
% Z
% Current number of equations to process: 1883
% Current number of ordered equations: 0
% Current number of rules: 81
% New rule produced :
% [95]
% identity greatest_lower_bound multiply(inverse(X least_upper_bound Y),X) ->
% multiply(inverse(X least_upper_bound Y),X)
% Current number of equations to process: 2080
% Current number of ordered equations: 0
% Current number of rules: 82
% New rule produced :
% [96]
% inverse(X least_upper_bound Y) least_upper_bound inverse(X) -> inverse(X)
% Current number of equations to process: 2387
% Current number of ordered equations: 0
% Current number of rules: 83
% New rule produced :
% [97]
% identity least_upper_bound inverse(X) least_upper_bound X ->
% inverse(X) least_upper_bound X
% Current number of equations to process: 2723
% Current number of ordered equations: 0
% Current number of rules: 84
% New rule produced :
% [98]
% inverse(inverse(X greatest_lower_bound Y) least_upper_bound Z) least_upper_bound X
% -> X
% Current number of equations to process: 2721
% Current number of ordered equations: 1
% Current number of rules: 85
% New rule produced :
% [99]
% (inverse(inverse(X) least_upper_bound Y) greatest_lower_bound Z) least_upper_bound X
% -> X
% Current number of equations to process: 2721
% Current number of ordered equations: 0
% Current number of rules: 86
% New rule produced :
% [100]
% inverse(inverse(X) least_upper_bound Y) greatest_lower_bound X ->
% inverse(inverse(X) least_upper_bound Y)
% Current number of equations to process: 2720
% Current number of ordered equations: 0
% Current number of rules: 87
% New rule produced :
% [101]
% 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: 2718
% Current number of ordered equations: 0
% Current number of rules: 88
% New rule produced :
% [102]
% 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: 3515
% Current number of ordered equations: 0
% Current number of rules: 89
% New rule produced :
% [103]
% inverse(X greatest_lower_bound Y) least_upper_bound inverse(X) ->
% inverse(X greatest_lower_bound Y)
% Current number of equations to process: 3690
% Current number of ordered equations: 0
% Current number of rules: 90
% New rule produced :
% [104]
% inverse(X least_upper_bound Y) greatest_lower_bound inverse(X) ->
% inverse(X least_upper_bound Y)
% Current number of equations to process: 3689
% Current number of ordered equations: 0
% Current number of rules: 91
% New rule produced :
% [105]
% (inverse(X) least_upper_bound X) greatest_lower_bound identity -> identity
% Current number of equations to process: 4020
% Current number of ordered equations: 0
% Current number of rules: 92
% New rule produced :
% [106]
% (inverse(X) least_upper_bound X least_upper_bound Y) greatest_lower_bound identity
% -> identity
% Current number of equations to process: 4019
% Current number of ordered equations: 0
% Current number of rules: 93
% New rule produced :
% [107]
% (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: 4031
% Current number of ordered equations: 0
% Current number of rules: 94
% New rule produced :
% [108]
% identity least_upper_bound inverse(inverse(X) least_upper_bound X least_upper_bound Y)
% -> identity
% Current number of equations to process: 4391
% Current number of ordered equations: 0
% Current number of rules: 95
% New rule produced :
% [109]
% (inverse(X least_upper_bound Y) greatest_lower_bound Z) least_upper_bound
% inverse(X) -> inverse(X)
% Current number of equations to process: 4407
% Current number of ordered equations: 0
% Current number of rules: 96
% New rule produced :
% [110]
% (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: 4406
% Current number of ordered equations: 0
% Current number of rules: 97
% New rule produced :
% [111]
% identity least_upper_bound multiply(inverse(identity least_upper_bound
% multiply(X,X)),X) -> identity
% Current number of equations to process: 3964
% Current number of ordered equations: 0
% Current number of rules: 98
% New rule produced :
% [112]
% 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: 3966
% Current number of ordered equations: 0
% Current number of rules: 99
% New rule produced :
% [113]
% (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: 3965
% Current number of ordered equations: 0
% Current number of rules: 100
% New rule produced :
% [114]
% (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: 3964
% Current number of ordered equations: 0
% Current number of rules: 101
% New rule produced :
% [115]
% (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: 3962
% Current number of ordered equations: 1
% Current number of rules: 102
% New rule produced :
% [116]
% 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: 3962
% Current number of ordered equations: 0
% Current number of rules: 103
% New rule produced :
% [117]
% (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: 3961
% Current number of ordered equations: 0
% Current number of rules: 104
% New rule produced :
% [118]
% inverse(identity least_upper_bound Cputime limit exceeded (core dumped)
%
% EOF
%------------------------------------------------------------------------------