TSTP Solution File: BOO072-1 by CiME---2.01
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CiME---2.01
% Problem : BOO072-1 : TPTP v6.0.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_cime %s
% Computer : n150.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:19:21 EDT 2014
% Result : Unsatisfiable 1.42s
% Output : Refutation 1.42s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----WARNING: CiME---2.01 format not known, defaulting to TPTP
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : BOO072-1 : TPTP v6.0.0. Released v2.6.0.
% % Command : tptp2X_and_run_cime %s
% % Computer : n150.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 : Thu Jun 5 22:33:28 CDT 2014
% % CPUTime : 1.42
% Processing problem /tmp/CiME_2719_n150.star.cs.uiowa.edu
% #verbose 1;
% let F = signature " a,b : constant; inverse : 1; add : 2;";
% let X = vars "A B C D";
% let Axioms = equations F X "
% inverse(add(inverse(add(inverse(add(A,B)),C)),inverse(add(A,inverse(add(inverse(C),inverse(add(C,D)))))))) = C;
% ";
%
% let s1 = status F "
% a lr_lex;
% b lr_lex;
% inverse lr_lex;
% add lr_lex;
% ";
%
% let p1 = precedence F "
% add > inverse > b > a";
%
% let s2 = status F "
% a mul;
% b mul;
% inverse mul;
% add mul;
% ";
%
% let p2 = precedence F "
% add > inverse > b = a";
%
% let o_auto = AUTO Axioms;
%
% let o = LEX o_auto (LEX (ACRPO s1 p1) (ACRPO s2 p2));
%
% let Conjectures = equations F X " add(b,a) = add(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 = { inverse(add(inverse(add(inverse(add(A,B)),C)),
% inverse(add(A,inverse(add(inverse(C),
% inverse(add(C,D))))))))
% = C } (1 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 = { add(b,a) = add(a,b) } (1 equation(s))
% time is now on
%
% Initializing completion ...
% New rule produced :
% [1]
% inverse(add(inverse(add(inverse(add(A,B)),C)),inverse(add(A,inverse(add(
% inverse(C),
% inverse(
% add(C,D))))))))
% -> C
% Current number of equations to process: 0
% Current number of ordered equations: 0
% Current number of rules: 1
% New rule produced :
% [2]
% inverse(add(inverse(add(inverse(add(inverse(add(inverse(add(inverse(inverse(A)),B)),A)),C)),
% inverse(A))),A)) -> inverse(A)
% Current number of equations to process: 4
% Current number of ordered equations: 0
% Current number of rules: 2
% New rule produced :
% [3] inverse(add(inverse(add(A,inverse(A))),A)) -> inverse(A)
% Current number of equations to process: 11
% Current number of ordered equations: 0
% Current number of rules: 3
% New rule produced :
% [4]
% inverse(add(inverse(A),inverse(add(A,inverse(add(inverse(A),inverse(add(A,B))))))))
% -> A
% Current number of equations to process: 19
% Current number of ordered equations: 0
% Current number of rules: 4
% New rule produced : [5] inverse(add(inverse(A),inverse(add(A,A)))) -> A
% Current number of equations to process: 21
% Current number of ordered equations: 0
% Current number of rules: 5
% New rule produced :
% [6]
% inverse(add(inverse(inverse(A)),inverse(add(inverse(A),inverse(add(inverse(
% inverse(A)),A))))))
% -> inverse(A)
% Current number of equations to process: 20
% Current number of ordered equations: 0
% Current number of rules: 6
% New rule produced :
% [7] inverse(add(inverse(add(inverse(add(A,B)),C)),inverse(add(A,C)))) -> C
% Current number of equations to process: 26
% Current number of ordered equations: 0
% Current number of rules: 7
% New rule produced :
% [8]
% inverse(add(inverse(add(inverse(add(inverse(add(inverse(A),A)),B)),inverse(A))),A))
% -> inverse(A)
% Current number of equations to process: 43
% Current number of ordered equations: 1
% Current number of rules: 8
% New rule produced :
% [9]
% inverse(add(inverse(add(add(inverse(add(inverse(inverse(A)),B)),A),inverse(A))),A))
% -> inverse(A)
% Current number of equations to process: 43
% Current number of ordered equations: 0
% Current number of rules: 9
% New rule produced :
% [10]
% inverse(add(A,inverse(add(inverse(add(B,C)),inverse(add(B,A)))))) ->
% inverse(add(B,A))
% Current number of equations to process: 57
% Current number of ordered equations: 0
% Current number of rules: 10
% New rule produced :
% [11]
% inverse(add(inverse(add(A,B)),inverse(add(inverse(add(inverse(add(C,D)),A)),B))))
% -> B
% Current number of equations to process: 56
% Current number of ordered equations: 0
% Current number of rules: 11
% New rule produced :
% [12] inverse(add(inverse(add(A,B)),inverse(add(inverse(A),B)))) -> B
% Current number of equations to process: 75
% Current number of ordered equations: 0
% Current number of rules: 12
% New rule produced :
% [13]
% inverse(add(inverse(add(inverse(A),B)),inverse(add(inverse(add(A,inverse(A))),B))))
% -> B
% Current number of equations to process: 75
% Current number of ordered equations: 1
% Current number of rules: 13
% New rule produced :
% [14]
% inverse(add(inverse(add(inverse(add(inverse(add(A,inverse(A))),B)),A)),
% inverse(A))) -> A
% Current number of equations to process: 75
% Current number of ordered equations: 0
% Current number of rules: 14
% New rule produced :
% [15]
% inverse(add(inverse(add(inverse(add(inverse(A),B)),inverse(add(A,A)))),A)) ->
% inverse(add(A,A))
% Current number of equations to process: 75
% Current number of ordered equations: 0
% Current number of rules: 15
% New rule produced : [16] inverse(add(inverse(inverse(A)),A)) -> inverse(A)
% Rule
% [6]
% inverse(add(inverse(inverse(A)),inverse(add(inverse(A),inverse(add(inverse(
% inverse(A)),A))))))
% -> inverse(A) collapsed.
% Current number of equations to process: 83
% Current number of ordered equations: 0
% Current number of rules: 15
% New rule produced :
% [17] inverse(add(inverse(add(add(inverse(A),A),inverse(A))),A)) -> inverse(A)
% Current number of equations to process: 88
% Current number of ordered equations: 0
% Current number of rules: 16
% New rule produced :
% [18]
% inverse(add(inverse(A),inverse(add(inverse(add(inverse(add(inverse(A),A)),B)),A))))
% -> A
% Current number of equations to process: 92
% Current number of ordered equations: 0
% Current number of rules: 17
% New rule produced :
% [19]
% inverse(add(inverse(A),inverse(add(add(inverse(add(inverse(inverse(A)),B)),A),A))))
% -> A
% Current number of equations to process: 110
% Current number of ordered equations: 0
% Current number of rules: 18
% New rule produced :
% [20] inverse(add(A,inverse(inverse(add(A,B))))) -> inverse(add(A,B))
% Current number of equations to process: 132
% Current number of ordered equations: 0
% Current number of rules: 19
% New rule produced :
% [21]
% inverse(add(A,inverse(add(B,inverse(add(inverse(B),A)))))) ->
% inverse(add(inverse(B),A))
% Current number of equations to process: 133
% Current number of ordered equations: 0
% Current number of rules: 20
% New rule produced :
% [22] inverse(add(inverse(add(inverse(add(A,B)),C)),inverse(add(B,C)))) -> C
% Current number of equations to process: 136
% Current number of ordered equations: 0
% Current number of rules: 21
% New rule produced :
% [23]
% inverse(add(inverse(add(A,A)),inverse(add(inverse(add(inverse(A),B)),A)))) ->
% A
% Current number of equations to process: 135
% Current number of ordered equations: 0
% Current number of rules: 22
% New rule produced :
% [24]
% inverse(add(A,inverse(add(inverse(add(B,C)),inverse(add(C,A)))))) ->
% inverse(add(C,A))
% Current number of equations to process: 145
% Current number of ordered equations: 0
% Current number of rules: 23
% New rule produced :
% [25]
% inverse(add(inverse(A),inverse(add(A,inverse(add(inverse(A),inverse(add(B,A))))))))
% -> A
% Current number of equations to process: 144
% Current number of ordered equations: 0
% Current number of rules: 24
% New rule produced :
% [26]
% inverse(add(A,inverse(add(inverse(add(inverse(add(A,inverse(A))),B)),
% inverse(A))))) -> inverse(A)
% Current number of equations to process: 143
% Current number of ordered equations: 0
% Current number of rules: 25
% New rule produced :
% [27]
% inverse(add(inverse(add(inverse(add(A,inverse(add(inverse(B),B)))),inverse(B))),B))
% -> inverse(B)
% Current number of equations to process: 142
% Current number of ordered equations: 0
% Current number of rules: 26
% New rule produced :
% [28]
% inverse(add(inverse(add(add(inverse(add(A,inverse(inverse(B)))),B),inverse(B))),B))
% -> inverse(B)
% Current number of equations to process: 141
% Current number of ordered equations: 0
% Current number of rules: 27
% New rule produced :
% [29] inverse(add(inverse(add(A,B)),inverse(add(inverse(add(C,A)),B)))) -> B
% Rule
% [11]
% inverse(add(inverse(add(A,B)),inverse(add(inverse(add(inverse(add(C,D)),A)),B))))
% -> B collapsed.
% Rule
% [13]
% inverse(add(inverse(add(inverse(A),B)),inverse(add(inverse(add(A,inverse(A))),B))))
% -> B collapsed.
% Current number of equations to process: 149
% Current number of ordered equations: 0
% Current number of rules: 26
% New rule produced :
% [30] inverse(add(inverse(add(add(A,inverse(A)),A)),inverse(A))) -> A
% Current number of equations to process: 162
% Current number of ordered equations: 0
% Current number of rules: 27
% New rule produced :
% [31] inverse(add(inverse(add(A,inverse(add(A,A)))),A)) -> inverse(add(A,A))
% Current number of equations to process: 170
% Current number of ordered equations: 0
% Current number of rules: 28
% New rule produced :
% [32]
% inverse(add(inverse(A),inverse(add(inverse(inverse(add(A,inverse(A)))),A))))
% -> A
% Current number of equations to process: 173
% Current number of ordered equations: 0
% Current number of rules: 29
% New rule produced :
% [33]
% inverse(add(A,inverse(add(inverse(inverse(A)),inverse(add(A,A)))))) ->
% inverse(add(A,A))
% Current number of equations to process: 188
% Current number of ordered equations: 0
% Current number of rules: 30
% New rule produced :
% [34]
% inverse(add(inverse(add(add(A,B),inverse(add(inverse(A),B)))),B)) ->
% inverse(add(inverse(A),B))
% Current number of equations to process: 187
% Current number of ordered equations: 0
% Current number of rules: 31
% New rule produced :
% [35]
% inverse(add(inverse(add(add(inverse(A),inverse(add(A,A))),B)),inverse(
% add(A,B)))) ->
% B
% Current number of equations to process: 186
% Current number of ordered equations: 0
% Current number of rules: 32
% New rule produced :
% [36]
% inverse(add(A,inverse(add(B,inverse(add(inverse(add(C,B)),A)))))) ->
% inverse(add(inverse(add(C,B)),A))
% Current number of equations to process: 185
% Current number of ordered equations: 0
% Current number of rules: 33
% New rule produced :
% [37]
% inverse(add(inverse(add(add(inverse(add(A,B)),C),inverse(add(A,C)))),C)) ->
% inverse(add(A,C))
% Current number of equations to process: 184
% Current number of ordered equations: 0
% Current number of rules: 34
% New rule produced :
% [38]
% inverse(add(inverse(add(add(inverse(add(A,inverse(A))),A),B)),inverse(
% add(inverse(A),B))))
% -> B
% Current number of equations to process: 183
% Current number of ordered equations: 0
% Current number of rules: 35
% New rule produced :
% [39]
% inverse(add(inverse(add(inverse(A),B)),inverse(add(inverse(add(inverse(
% add(A,B)),C)),B))))
% -> B
% Current number of equations to process: 182
% Current number of ordered equations: 0
% Current number of rules: 36
% New rule produced :
% [40]
% inverse(add(A,inverse(add(inverse(inverse(add(B,A))),inverse(add(inverse(B),A))))))
% -> inverse(add(inverse(B),A))
% Current number of equations to process: 181
% Current number of ordered equations: 0
% Current number of rules: 37
% New rule produced :
% [41] inverse(add(inverse(add(inverse(A),A)),inverse(A))) -> A
% Current number of equations to process: 192
% Current number of ordered equations: 0
% Current number of rules: 38
% New rule produced :
% [42]
% inverse(add(inverse(add(inverse(add(A,inverse(add(B,inverse(B))))),B)),
% inverse(B))) -> B
% Current number of equations to process: 210
% Current number of ordered equations: 0
% Current number of rules: 39
% New rule produced :
% [43]
% inverse(add(inverse(add(add(inverse(add(inverse(add(A,inverse(A))),B)),A),
% inverse(A))),A)) -> inverse(A)
% Current number of equations to process: 209
% Current number of ordered equations: 0
% Current number of rules: 40
% New rule produced :
% [44] inverse(add(inverse(A),add(inverse(A),inverse(add(A,A))))) -> A
% Current number of equations to process: 249
% Current number of ordered equations: 0
% Current number of rules: 41
% New rule produced :
% [45]
% inverse(add(inverse(inverse(A)),add(inverse(inverse(A)),A))) -> inverse(A)
% Current number of equations to process: 276
% Current number of ordered equations: 0
% Current number of rules: 42
% New rule produced :
% [46]
% inverse(add(inverse(A),inverse(add(inverse(inverse(inverse(A))),A)))) -> A
% Current number of equations to process: 275
% Current number of ordered equations: 0
% Current number of rules: 43
% New rule produced :
% [47]
% inverse(add(inverse(inverse(A)),add(inverse(add(A,inverse(A))),A))) ->
% inverse(A)
% Current number of equations to process: 274
% Current number of ordered equations: 0
% Current number of rules: 44
% New rule produced :
% [48]
% inverse(add(inverse(add(inverse(add(inverse(inverse(A)),B)),A)),inverse(A)))
% -> A
% Current number of equations to process: 273
% Current number of ordered equations: 0
% Current number of rules: 45
% New rule produced :
% [49]
% inverse(add(A,inverse(add(inverse(add(inverse(inverse(A)),B)),inverse(A)))))
% -> inverse(A)
% Current number of equations to process: 272
% Current number of ordered equations: 0
% Current number of rules: 46
% New rule produced :
% [50]
% inverse(add(inverse(A),add(inverse(add(B,A)),inverse(add(inverse(B),A))))) ->
% A
% Current number of equations to process: 271
% Current number of ordered equations: 0
% Current number of rules: 47
% New rule produced :
% [51]
% inverse(add(inverse(add(add(inverse(inverse(A)),A),B)),inverse(add(inverse(A),B))))
% -> B
% Current number of equations to process: 270
% Current number of ordered equations: 0
% Current number of rules: 48
% New rule produced :
% [52]
% inverse(add(inverse(add(inverse(add(A,inverse(B))),inverse(add(B,B)))),B)) ->
% inverse(add(B,B))
% Current number of equations to process: 269
% Current number of ordered equations: 0
% Current number of rules: 49
% New rule produced :
% [53] inverse(add(inverse(A),inverse(add(add(inverse(A),A),A)))) -> A
% Current number of equations to process: 284
% Current number of ordered equations: 0
% Current number of rules: 50
% New rule produced :
% [54]
% inverse(add(inverse(add(add(add(inverse(A),A),inverse(A)),A)),inverse(A))) ->
% A
% Current number of equations to process: 303
% Current number of ordered equations: 0
% Current number of rules: 51
% New rule produced :
% [55]
% inverse(add(inverse(inverse(A)),add(inverse(add(add(inverse(A),A),inverse(A))),A)))
% -> inverse(A)
% Current number of equations to process: 302
% Current number of ordered equations: 0
% Current number of rules: 52
% New rule produced :
% [56]
% inverse(add(inverse(A),add(inverse(add(inverse(add(B,C)),A)),inverse(
% add(B,A))))) ->
% A
% Current number of equations to process: 301
% Current number of ordered equations: 0
% Current number of rules: 53
% New rule produced :
% [57]
% inverse(add(inverse(A),inverse(add(inverse(inverse(add(add(inverse(A),A),
% inverse(A)))),A)))) -> A
% Current number of equations to process: 300
% Current number of ordered equations: 0
% Current number of rules: 54
% New rule produced :
% [58]
% inverse(add(inverse(add(add(inverse(inverse(A)),A),inverse(A))),add(inverse(
% inverse(A)),A)))
% -> inverse(A)
% Current number of equations to process: 299
% Current number of ordered equations: 0
% Current number of rules: 55
% New rule produced :
% [59]
% inverse(add(inverse(A),inverse(add(inverse(add(B,inverse(add(inverse(A),A)))),A))))
% -> A
% Current number of equations to process: 324
% Current number of ordered equations: 0
% Current number of rules: 56
% New rule produced :
% [60]
% inverse(add(inverse(A),inverse(add(add(inverse(add(B,inverse(inverse(A)))),A),A))))
% -> A
% Current number of equations to process: 358
% Current number of ordered equations: 0
% Current number of rules: 57
% New rule produced : [61] inverse(add(inverse(A),inverse(A))) -> A
% Current number of equations to process: 368
% Current number of ordered equations: 0
% Current number of rules: 58
% New rule produced :
% [62] inverse(add(inverse(add(inverse(add(A,B)),C)),inverse(C))) -> C
% Rule
% [14]
% inverse(add(inverse(add(inverse(add(inverse(add(A,inverse(A))),B)),A)),
% inverse(A))) -> A collapsed.
% Rule
% [42]
% inverse(add(inverse(add(inverse(add(A,inverse(add(B,inverse(B))))),B)),
% inverse(B))) -> B collapsed.
% Rule
% [48]
% inverse(add(inverse(add(inverse(add(inverse(inverse(A)),B)),A)),inverse(A)))
% -> A collapsed.
% Current number of equations to process: 370
% Current number of ordered equations: 0
% Current number of rules: 56
% New rule produced :
% [63]
% inverse(add(inverse(add(A,inverse(A))),inverse(inverse(A)))) -> inverse(A)
% Current number of equations to process: 372
% Current number of ordered equations: 0
% Current number of rules: 57
% New rule produced :
% [64] inverse(add(A,inverse(inverse(add(B,A))))) -> inverse(add(B,A))
% Current number of equations to process: 379
% Current number of ordered equations: 0
% Current number of rules: 58
% New rule produced : [65] inverse(add(inverse(add(A,B)),inverse(B))) -> B
% Rule [30] inverse(add(inverse(add(add(A,inverse(A)),A)),inverse(A))) -> A
% collapsed.
% Rule [41] inverse(add(inverse(add(inverse(A),A)),inverse(A))) -> A collapsed.
% Rule
% [54]
% inverse(add(inverse(add(add(add(inverse(A),A),inverse(A)),A)),inverse(A))) ->
% A collapsed.
% Rule [62] inverse(add(inverse(add(inverse(add(A,B)),C)),inverse(C))) -> C
% collapsed.
% Rule
% [63]
% inverse(add(inverse(add(A,inverse(A))),inverse(inverse(A)))) -> inverse(A)
% collapsed.
% Current number of equations to process: 382
% Current number of ordered equations: 0
% Current number of rules: 54
% New rule produced : [66] add(A,A) -> A
% Rule [5] inverse(add(inverse(A),inverse(add(A,A)))) -> A collapsed.
% Rule
% [15]
% inverse(add(inverse(add(inverse(add(inverse(A),B)),inverse(add(A,A)))),A)) ->
% inverse(add(A,A)) collapsed.
% Rule
% [23]
% inverse(add(inverse(add(A,A)),inverse(add(inverse(add(inverse(A),B)),A)))) ->
% A collapsed.
% Rule
% [31] inverse(add(inverse(add(A,inverse(add(A,A)))),A)) -> inverse(add(A,A))
% collapsed.
% Rule
% [33]
% inverse(add(A,inverse(add(inverse(inverse(A)),inverse(add(A,A)))))) ->
% inverse(add(A,A)) collapsed.
% Rule
% [35]
% inverse(add(inverse(add(add(inverse(A),inverse(add(A,A))),B)),inverse(
% add(A,B)))) ->
% B collapsed.
% Rule [44] inverse(add(inverse(A),add(inverse(A),inverse(add(A,A))))) -> A
% collapsed.
% Rule
% [52]
% inverse(add(inverse(add(inverse(add(A,inverse(B))),inverse(add(B,B)))),B)) ->
% inverse(add(B,B)) collapsed.
% Rule [61] inverse(add(inverse(A),inverse(A))) -> A collapsed.
% Current number of equations to process: 395
% Current number of ordered equations: 0
% Current number of rules: 46
% New rule produced : [67] inverse(inverse(A)) -> A
% Rule
% [2]
% inverse(add(inverse(add(inverse(add(inverse(add(inverse(add(inverse(inverse(A)),B)),A)),C)),
% inverse(A))),A)) -> inverse(A) collapsed.
% Rule
% [9]
% inverse(add(inverse(add(add(inverse(add(inverse(inverse(A)),B)),A),inverse(A))),A))
% -> inverse(A) collapsed.
% Rule [16] inverse(add(inverse(inverse(A)),A)) -> inverse(A) collapsed.
% Rule
% [19]
% inverse(add(inverse(A),inverse(add(add(inverse(add(inverse(inverse(A)),B)),A),A))))
% -> A collapsed.
% Rule [20] inverse(add(A,inverse(inverse(add(A,B))))) -> inverse(add(A,B))
% collapsed.
% Rule
% [28]
% inverse(add(inverse(add(add(inverse(add(A,inverse(inverse(B)))),B),inverse(B))),B))
% -> inverse(B) collapsed.
% Rule
% [32]
% inverse(add(inverse(A),inverse(add(inverse(inverse(add(A,inverse(A)))),A))))
% -> A collapsed.
% Rule
% [40]
% inverse(add(A,inverse(add(inverse(inverse(add(B,A))),inverse(add(inverse(B),A))))))
% -> inverse(add(inverse(B),A)) collapsed.
% Rule
% [45]
% inverse(add(inverse(inverse(A)),add(inverse(inverse(A)),A))) -> inverse(A)
% collapsed.
% Rule
% [46]
% inverse(add(inverse(A),inverse(add(inverse(inverse(inverse(A))),A)))) -> A
% collapsed.
% Rule
% [47]
% inverse(add(inverse(inverse(A)),add(inverse(add(A,inverse(A))),A))) ->
% inverse(A) collapsed.
% Rule
% [49]
% inverse(add(A,inverse(add(inverse(add(inverse(inverse(A)),B)),inverse(A)))))
% -> inverse(A) collapsed.
% Rule
% [51]
% inverse(add(inverse(add(add(inverse(inverse(A)),A),B)),inverse(add(inverse(A),B))))
% -> B collapsed.
% Rule
% [55]
% inverse(add(inverse(inverse(A)),add(inverse(add(add(inverse(A),A),inverse(A))),A)))
% -> inverse(A) collapsed.
% Rule
% [57]
% inverse(add(inverse(A),inverse(add(inverse(inverse(add(add(inverse(A),A),
% inverse(A)))),A)))) -> A
% collapsed.
% Rule
% [58]
% inverse(add(inverse(add(add(inverse(inverse(A)),A),inverse(A))),add(inverse(
% inverse(A)),A)))
% -> inverse(A) collapsed.
% Rule
% [60]
% inverse(add(inverse(A),inverse(add(add(inverse(add(B,inverse(inverse(A)))),A),A))))
% -> A collapsed.
% Rule [64] inverse(add(A,inverse(inverse(add(B,A))))) -> inverse(add(B,A))
% collapsed.
% Current number of equations to process: 408
% Current number of ordered equations: 0
% Current number of rules: 29
% New rule produced : [68] inverse(add(A,add(A,B))) -> inverse(add(A,B))
% Current number of equations to process: 407
% Current number of ordered equations: 0
% Current number of rules: 30
% New rule produced : [69] inverse(add(A,add(B,A))) -> inverse(add(B,A))
% Current number of equations to process: 406
% Current number of ordered equations: 0
% Current number of rules: 31
% New rule produced :
% [70] inverse(add(inverse(A),inverse(add(inverse(A),A)))) -> A
% Current number of equations to process: 405
% Current number of ordered equations: 0
% Current number of rules: 32
% New rule produced :
% [71] inverse(add(A,inverse(add(A,inverse(A))))) -> inverse(A)
% Current number of equations to process: 404
% Current number of ordered equations: 0
% Current number of rules: 33
% New rule produced :
% [72] inverse(add(inverse(A),inverse(add(add(A,inverse(A)),A)))) -> A
% Current number of equations to process: 402
% Current number of ordered equations: 0
% Current number of rules: 34
% New rule produced :
% [73] inverse(add(inverse(add(inverse(A),B)),inverse(add(A,B)))) -> B
% Current number of equations to process: 401
% Current number of ordered equations: 0
% Current number of rules: 35
% New rule produced :
% [74] inverse(add(A,inverse(add(inverse(add(A,B)),inverse(A))))) -> inverse(A)
% Current number of equations to process: 400
% Current number of ordered equations: 0
% Current number of rules: 36
% New rule produced :
% [75] inverse(add(inverse(A),inverse(add(inverse(add(inverse(A),B)),A)))) -> A
% Current number of equations to process: 399
% Current number of ordered equations: 0
% Current number of rules: 37
% New rule produced :
% [76]
% inverse(add(inverse(add(inverse(add(inverse(A),B)),inverse(A))),A)) ->
% inverse(A)
% Current number of equations to process: 398
% Current number of ordered equations: 0
% Current number of rules: 38
% New rule produced :
% [77]
% inverse(add(inverse(add(inverse(add(A,inverse(B))),inverse(B))),B)) ->
% inverse(B)
% Current number of equations to process: 397
% Current number of ordered equations: 0
% Current number of rules: 39
% New rule produced :
% [78] inverse(add(inverse(A),inverse(add(add(inverse(add(A,B)),A),A)))) -> A
% Current number of equations to process: 396
% Current number of ordered equations: 0
% Current number of rules: 40
% New rule produced :
% [79] inverse(add(inverse(A),inverse(add(add(inverse(add(B,A)),A),A)))) -> A
% Current number of equations to process: 395
% Current number of ordered equations: 0
% Current number of rules: 41
% New rule produced :
% [80]
% inverse(add(inverse(add(add(inverse(add(A,B)),A),inverse(A))),A)) ->
% inverse(A)
% Current number of equations to process: 394
% Current number of ordered equations: 0
% Current number of rules: 42
% New rule produced :
% [81]
% inverse(add(inverse(add(add(inverse(add(A,B)),B),inverse(B))),B)) ->
% inverse(B)
% Current number of equations to process: 393
% Current number of ordered equations: 0
% Current number of rules: 43
% New rule produced :
% [82]
% inverse(add(inverse(A),inverse(add(add(add(inverse(A),A),inverse(A)),A)))) ->
% A
% Current number of equations to process: 391
% Current number of ordered equations: 0
% Current number of rules: 44
% New rule produced :
% [83]
% inverse(add(A,inverse(add(add(B,A),inverse(add(inverse(B),A)))))) ->
% inverse(add(inverse(B),A))
% Current number of equations to process: 390
% Current number of ordered equations: 0
% Current number of rules: 45
% New rule produced :
% [84] inverse(add(A,inverse(add(add(A,inverse(A)),inverse(A))))) -> inverse(A)
% Current number of equations to process: 397
% Current number of ordered equations: 0
% Current number of rules: 46
% New rule produced :
% [85] inverse(add(inverse(add(inverse(A),B)),inverse(add(add(A,B),B)))) -> B
% Current number of equations to process: 418
% Current number of ordered equations: 0
% Current number of rules: 47
% New rule produced :
% [86]
% inverse(add(A,inverse(add(inverse(A),inverse(add(A,B)))))) ->
% add(inverse(A),inverse(add(A,B)))
% Rule
% [4]
% inverse(add(inverse(A),inverse(add(A,inverse(add(inverse(A),inverse(add(A,B))))))))
% -> A collapsed.
% Current number of equations to process: 422
% Current number of ordered equations: 0
% Current number of rules: 47
% New rule produced : [87] inverse(add(inverse(A),inverse(add(A,B)))) -> A
% Rule
% [1]
% inverse(add(inverse(add(inverse(add(A,B)),C)),inverse(add(A,inverse(add(
% inverse(C),
% inverse(
% add(C,D))))))))
% -> C collapsed.
% Rule
% [25]
% inverse(add(inverse(A),inverse(add(A,inverse(add(inverse(A),inverse(add(B,A))))))))
% -> A collapsed.
% Rule
% [86]
% inverse(add(A,inverse(add(inverse(A),inverse(add(A,B)))))) ->
% add(inverse(A),inverse(add(A,B))) collapsed.
% Current number of equations to process: 422
% Current number of ordered equations: 0
% Current number of rules: 45
% New rule produced : [88] add(inverse(A),inverse(add(A,B))) -> inverse(A)
% Rule [87] inverse(add(inverse(A),inverse(add(A,B)))) -> A collapsed.
% Current number of equations to process: 421
% Current number of ordered equations: 0
% Current number of rules: 45
% New rule produced :
% [89] inverse(add(A,inverse(add(A,inverse(add(B,A)))))) -> inverse(add(B,A))
% Current number of equations to process: 424
% Current number of ordered equations: 0
% Current number of rules: 46
% New rule produced : [90] inverse(add(A,B)) <-> inverse(add(B,A))
% Rule [3] inverse(add(inverse(add(A,inverse(A))),A)) -> inverse(A) collapsed.
% Rule
% [7] inverse(add(inverse(add(inverse(add(A,B)),C)),inverse(add(A,C)))) -> C
% collapsed.
% Rule
% [8]
% inverse(add(inverse(add(inverse(add(inverse(add(inverse(A),A)),B)),inverse(A))),A))
% -> inverse(A) collapsed.
% Rule
% [17] inverse(add(inverse(add(add(inverse(A),A),inverse(A))),A)) -> inverse(A)
% collapsed.
% Rule
% [18]
% inverse(add(inverse(A),inverse(add(inverse(add(inverse(add(inverse(A),A)),B)),A))))
% -> A collapsed.
% Rule
% [22] inverse(add(inverse(add(inverse(add(A,B)),C)),inverse(add(B,C)))) -> C
% collapsed.
% Rule
% [26]
% inverse(add(A,inverse(add(inverse(add(inverse(add(A,inverse(A))),B)),
% inverse(A))))) -> inverse(A) collapsed.
% Rule
% [27]
% inverse(add(inverse(add(inverse(add(A,inverse(add(inverse(B),B)))),inverse(B))),B))
% -> inverse(B) collapsed.
% Rule
% [34]
% inverse(add(inverse(add(add(A,B),inverse(add(inverse(A),B)))),B)) ->
% inverse(add(inverse(A),B)) collapsed.
% Rule
% [37]
% inverse(add(inverse(add(add(inverse(add(A,B)),C),inverse(add(A,C)))),C)) ->
% inverse(add(A,C)) collapsed.
% Rule
% [38]
% inverse(add(inverse(add(add(inverse(add(A,inverse(A))),A),B)),inverse(
% add(inverse(A),B))))
% -> B collapsed.
% Rule
% [39]
% inverse(add(inverse(add(inverse(A),B)),inverse(add(inverse(add(inverse(
% add(A,B)),C)),B))))
% -> B collapsed.
% Rule
% [43]
% inverse(add(inverse(add(add(inverse(add(inverse(add(A,inverse(A))),B)),A),
% inverse(A))),A)) -> inverse(A) collapsed.
% Rule [53] inverse(add(inverse(A),inverse(add(add(inverse(A),A),A)))) -> A
% collapsed.
% Rule
% [59]
% inverse(add(inverse(A),inverse(add(inverse(add(B,inverse(add(inverse(A),A)))),A))))
% -> A collapsed.
% Rule [65] inverse(add(inverse(add(A,B)),inverse(B))) -> B collapsed.
% Rule [70] inverse(add(inverse(A),inverse(add(inverse(A),A)))) -> A collapsed.
% Rule [72] inverse(add(inverse(A),inverse(add(add(A,inverse(A)),A)))) -> A
% collapsed.
% Rule [73] inverse(add(inverse(add(inverse(A),B)),inverse(add(A,B)))) -> B
% collapsed.
% Rule
% [74] inverse(add(A,inverse(add(inverse(add(A,B)),inverse(A))))) -> inverse(A)
% collapsed.
% Rule
% [75] inverse(add(inverse(A),inverse(add(inverse(add(inverse(A),B)),A)))) -> A
% collapsed.
% Rule
% [76]
% inverse(add(inverse(add(inverse(add(inverse(A),B)),inverse(A))),A)) ->
% inverse(A) collapsed.
% Rule
% [77]
% inverse(add(inverse(add(inverse(add(A,inverse(B))),inverse(B))),B)) ->
% inverse(B) collapsed.
% Rule
% [78] inverse(add(inverse(A),inverse(add(add(inverse(add(A,B)),A),A)))) -> A
% collapsed.
% Rule
% [79] inverse(add(inverse(A),inverse(add(add(inverse(add(B,A)),A),A)))) -> A
% collapsed.
% Rule
% [80]
% inverse(add(inverse(add(add(inverse(add(A,B)),A),inverse(A))),A)) ->
% inverse(A) collapsed.
% Rule
% [81]
% inverse(add(inverse(add(add(inverse(add(A,B)),B),inverse(B))),B)) ->
% inverse(B) collapsed.
% Rule
% [82]
% inverse(add(inverse(A),inverse(add(add(add(inverse(A),A),inverse(A)),A)))) ->
% A collapsed.
% Rule
% [84] inverse(add(A,inverse(add(add(A,inverse(A)),inverse(A))))) -> inverse(A)
% collapsed.
% Rule
% [85] inverse(add(inverse(add(inverse(A),B)),inverse(add(add(A,B),B)))) -> B
% collapsed.
% Current number of equations to process: 455
% Current number of ordered equations: 0
% Current number of rules: 17
% New rule produced : [91] inverse(add(inverse(B),inverse(add(A,B)))) -> B
% Current number of equations to process: 454
% Current number of ordered equations: 0
% Current number of rules: 18
% New rule produced :
% [92]
% inverse(add(A,inverse(add(inverse(A),inverse(add(inverse(A),B)))))) ->
% inverse(A)
% Current number of equations to process: 453
% Current number of ordered equations: 0
% Current number of rules: 19
% New rule produced :
% [93]
% inverse(add(B,inverse(add(inverse(B),inverse(add(A,inverse(B))))))) ->
% inverse(B)
% Current number of equations to process: 452
% Current number of ordered equations: 0
% Current number of rules: 20
% New rule produced :
% [94] inverse(add(inverse(add(A,C)),inverse(add(inverse(add(A,B)),C)))) -> C
% Current number of equations to process: 451
% Current number of ordered equations: 0
% Current number of rules: 21
% New rule produced :
% [95]
% inverse(add(A,inverse(add(inverse(A),add(inverse(add(A,B)),A))))) ->
% inverse(A)
% Current number of equations to process: 450
% Current number of ordered equations: 0
% Current number of rules: 22
% New rule produced :
% [96]
% inverse(add(B,inverse(add(inverse(B),add(inverse(add(A,B)),B))))) ->
% inverse(B)
% Current number of equations to process: 449
% Current number of ordered equations: 0
% Current number of rules: 23
% New rule produced :
% [97]
% inverse(add(A,inverse(add(inverse(A),inverse(add(inverse(add(A,inverse(A))),B))))))
% -> inverse(A)
% Current number of equations to process: 483
% Current number of ordered equations: 0
% Current number of rules: 24
% New rule produced :
% [98]
% inverse(add(B,inverse(add(inverse(B),inverse(add(A,inverse(add(B,inverse(B)))))))))
% -> inverse(B)
% Current number of equations to process: 482
% Current number of ordered equations: 0
% Current number of rules: 25
% New rule produced :
% [99] add(inverse(add(B,A)),inverse(add(inverse(B),A))) -> inverse(A)
% Rule [12] inverse(add(inverse(add(A,B)),inverse(add(inverse(A),B)))) -> B
% collapsed.
% Rule
% [50]
% inverse(add(inverse(A),add(inverse(add(B,A)),inverse(add(inverse(B),A))))) ->
% A collapsed.
% Current number of equations to process: 569
% Current number of ordered equations: 0
% Current number of rules: 24
% New rule produced :
% [100] add(B,inverse(add(A,inverse(add(inverse(A),B))))) -> add(inverse(A),B)
% Rule
% [21]
% inverse(add(A,inverse(add(B,inverse(add(inverse(B),A)))))) ->
% inverse(add(inverse(B),A)) collapsed.
% Current number of equations to process: 568
% Current number of ordered equations: 0
% Current number of rules: 24
% New rule produced : [101] add(A,add(A,B)) -> add(A,B)
% Rule [68] inverse(add(A,add(A,B))) -> inverse(add(A,B)) collapsed.
% Current number of equations to process: 572
% Current number of ordered equations: 0
% Current number of rules: 24
% New rule produced : [102] add(B,add(A,B)) -> add(A,B)
% Rule [69] inverse(add(A,add(B,A))) -> inverse(add(B,A)) collapsed.
% Current number of equations to process: 577
% Current number of ordered equations: 0
% Current number of rules: 24
% New rule produced :
% [103] add(inverse(add(B,A)),inverse(add(inverse(add(C,B)),A))) -> inverse(A)
% Rule
% [29] inverse(add(inverse(add(A,B)),inverse(add(inverse(add(C,A)),B)))) -> B
% collapsed.
% Current number of equations to process: 576
% Current number of ordered equations: 0
% Current number of rules: 24
% New rule produced :
% [104] add(B,inverse(add(inverse(add(A,C)),inverse(add(A,B))))) -> add(A,B)
% Rule
% [10]
% inverse(add(A,inverse(add(inverse(add(B,C)),inverse(add(B,A)))))) ->
% inverse(add(B,A)) collapsed.
% Current number of equations to process: 576
% Current number of ordered equations: 0
% Current number of rules: 24
% New rule produced :
% [105] add(B,inverse(add(inverse(add(C,A)),inverse(add(A,B))))) -> add(A,B)
% Rule
% [24]
% inverse(add(A,inverse(add(inverse(add(B,C)),inverse(add(C,A)))))) ->
% inverse(add(C,A)) collapsed.
% Current number of equations to process: 575
% Current number of ordered equations: 0
% Current number of rules: 24
% New rule produced : [106] add(A,inverse(add(A,inverse(A)))) -> A
% Rule [71] inverse(add(A,inverse(add(A,inverse(A))))) -> inverse(A) collapsed.
% Current number of equations to process: 578
% Current number of ordered equations: 0
% Current number of rules: 24
% New rule produced :
% [107]
% inverse(add(add(A,B),inverse(add(B,inverse(add(A,B)))))) -> inverse(add(A,B))
% Current number of equations to process: 577
% Current number of ordered equations: 0
% Current number of rules: 25
% New rule produced :
% [108]
% inverse(add(add(A,B),inverse(add(A,inverse(add(A,B)))))) -> inverse(add(A,B))
% Current number of equations to process: 576
% Current number of ordered equations: 0
% Current number of rules: 26
% New rule produced :
% [109]
% inverse(add(inverse(A),add(inverse(add(inverse(B),A)),inverse(add(B,A))))) ->
% A
% Current number of equations to process: 574
% Current number of ordered equations: 0
% Current number of rules: 27
% New rule produced :
% [110]
% add(C,inverse(add(B,inverse(add(inverse(add(A,B)),C))))) ->
% add(inverse(add(A,B)),C)
% Rule
% [36]
% inverse(add(A,inverse(add(B,inverse(add(inverse(add(C,B)),A)))))) ->
% inverse(add(inverse(add(C,B)),A)) collapsed.
% Current number of equations to process: 573
% Current number of ordered equations: 0
% Current number of rules: 27
% New rule produced :
% [111]
% add(B,inverse(add(add(A,B),inverse(add(inverse(A),B))))) -> add(inverse(A),B)
% Rule
% [83]
% inverse(add(A,inverse(add(add(B,A),inverse(add(inverse(B),A)))))) ->
% inverse(add(inverse(B),A)) collapsed.
% Current number of equations to process: 577
% Current number of ordered equations: 0
% Current number of rules: 27
% New rule produced : [112] add(A,inverse(add(inverse(A),B))) -> A
% Rule
% [92]
% inverse(add(A,inverse(add(inverse(A),inverse(add(inverse(A),B)))))) ->
% inverse(A) collapsed.
% Rule
% [93]
% inverse(add(B,inverse(add(inverse(B),inverse(add(A,inverse(B))))))) ->
% inverse(B) collapsed.
% Rule
% [95]
% inverse(add(A,inverse(add(inverse(A),add(inverse(add(A,B)),A))))) ->
% inverse(A) collapsed.
% Rule
% [96]
% inverse(add(B,inverse(add(inverse(B),add(inverse(add(A,B)),B))))) ->
% inverse(B) collapsed.
% Rule
% [97]
% inverse(add(A,inverse(add(inverse(A),inverse(add(inverse(add(A,inverse(A))),B))))))
% -> inverse(A) collapsed.
% Rule
% [98]
% inverse(add(B,inverse(add(inverse(B),inverse(add(A,inverse(add(B,inverse(B)))))))))
% -> inverse(B) collapsed.
% Rule
% [100] add(B,inverse(add(A,inverse(add(inverse(A),B))))) -> add(inverse(A),B)
% collapsed.
% Current number of equations to process: 579
% Current number of ordered equations: 0
% Current number of rules: 21
% New rule produced : [113] add(B,inverse(A)) <-> add(inverse(A),B)
% Rule
% [56]
% inverse(add(inverse(A),add(inverse(add(inverse(add(B,C)),A)),inverse(
% add(B,A))))) ->
% A collapsed.
% Rule
% [109]
% inverse(add(inverse(A),add(inverse(add(inverse(B),A)),inverse(add(B,A))))) ->
% A collapsed.
% Current number of equations to process: 579
% Current number of ordered equations: 1
% Current number of rules: 20
% New rule produced : [114] add(inverse(A),B) <-> add(B,inverse(A))
% Current number of equations to process: 579
% Current number of ordered equations: 0
% Current number of rules: 21
% add(A,B) = add(B,A) (birth = 498, lhs_size = 3, rhs_size = 3,trace = Cp of 90 and 67)
% Initializing completion ...
% The current conjecture is true and the solution is the identity
% % SZS output start Refutation
% See solution above
% % SZS output end Refutation
% All conjectures have been proven
%
% Execution time: 0.300000 sec
% res : bool = true
% time is now off
%
% status : string = "unsatisfiable"
% % SZS status Unsatisfiable
% CiME interrupted
%
% EOF
%------------------------------------------------------------------------------