TSTP Solution File: ROB033-1 by CiME---2.01
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CiME---2.01
% Problem : ROB033-1 : TPTP v6.0.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_cime %s
% Computer : n063.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:32:02 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 : ROB033-1 : TPTP v6.0.0. Released v4.1.0.
% % Command : tptp2X_and_run_cime %s
% % Computer : n063.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 17:17:43 CDT 2014
% % CPUTime : 300.08
% Processing problem /tmp/CiME_60580_n063.star.cs.uiowa.edu
% #verbose 1;
% let F = signature " add : AC; x1,x0 : constant; h : 1; g : 1; negate : 1;";
% let X = vars "X Y Z A";
% let Axioms = equations F X "
% negate(negate(X add Y) add negate(X add negate(Y))) = X;
% g(A) = negate(A add negate(A));
% h(A) = A add (A add (A add g(A)));
% ";
%
% let s1 = status F "
% x1 lr_lex;
% x0 lr_lex;
% h lr_lex;
% g lr_lex;
% negate lr_lex;
% add mul;
% ";
%
% let p1 = precedence F "
% h > negate > g > add > x0 > x1";
%
% let s2 = status F "
% x1 mul;
% x0 mul;
% h mul;
% g mul;
% negate mul;
% add mul;
% ";
%
% let p2 = precedence F "
% h > negate > g > add > x0 = x1";
%
% let o_auto = AUTO Axioms;
%
% let o = LEX o_auto (LEX (ACRPO s1 p1) (ACRPO s2 p2));
%
% let Conjectures = equations F X " negate(x0 add negate(x1)) add negate(negate(x0) add negate(x1)) = x1;"
% ;
% (*
% 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 = { negate(negate(negate(Y) add X) add negate(
% X add Y)) = X,
% g(A) = negate(negate(A) add A),
% h(A) = g(A) add A add A add A } (3 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 = { negate(x0 add negate(x1)) add negate(
% negate(x1) add
% negate(x0)) =
% x1 } (1 equation(s))
% time is now on
%
% Initializing completion ...
% New rule produced : [1] negate(negate(A) add A) -> g(A)
% Current number of equations to process: 0
% Current number of ordered equations: 2
% Current number of rules: 1
% New rule produced : [2] g(A) add A add A add A -> h(A)
% Current number of equations to process: 0
% Current number of ordered equations: 1
% Current number of rules: 2
% New rule produced :
% [3] negate(negate(negate(Y) add X) add negate(X add Y)) -> X
% Current number of equations to process: 0
% Current number of ordered equations: 0
% Current number of rules: 3
% New rule produced :
% [4] negate(g(X) add negate(X) add X) -> g(negate(X) add X)
% Current number of equations to process: 16
% Current number of ordered equations: 0
% Current number of rules: 4
% New rule produced : [5] negate(g(X) add negate(X add X)) -> X
% Current number of equations to process: 29
% Current number of ordered equations: 0
% Current number of rules: 5
% New rule produced : [6] negate(g(X) add negate(negate(negate(X)) add X)) -> X
% Current number of equations to process: 146
% Current number of ordered equations: 0
% Current number of rules: 6
% New rule produced :
% [7] negate(g(X) add negate(negate(X) add negate(X))) -> negate(X)
% Current number of equations to process: 181
% Current number of ordered equations: 0
% Current number of rules: 7
% New rule produced : [8] negate(negate(g(X) add X add X) add X) -> g(X)
% Current number of equations to process: 183
% Current number of ordered equations: 0
% Current number of rules: 8
% New rule produced : [9] negate(g(X) add negate(h(X))) -> X
% Current number of equations to process: 207
% Current number of ordered equations: 0
% Current number of rules: 9
% New rule produced : [10] negate(negate(h(X) add g(X)) add X) -> g(X)
% Current number of equations to process: 217
% Current number of ordered equations: 0
% Current number of rules: 10
% New rule produced :
% [11] negate(negate(g(X) add negate(negate(h(X)))) add X) -> g(X)
% Current number of equations to process: 228
% Current number of ordered equations: 0
% Current number of rules: 11
% New rule produced :
% [12]
% negate(g(negate(X)) add negate(negate(negate(X)) add X)) -> negate(negate(X))
% Current number of equations to process: 239
% Current number of ordered equations: 0
% Current number of rules: 12
% New rule produced :
% [13] negate(g(X) add negate(h(X)) add X) -> g(g(X) add negate(h(X)))
% Current number of equations to process: 257
% Current number of ordered equations: 0
% Current number of rules: 13
% New rule produced :
% [14] negate(negate(negate(h(X)) add negate(g(X))) add X) -> negate(h(X))
% Current number of equations to process: 273
% Current number of ordered equations: 0
% Current number of rules: 14
% New rule produced : [15] negate(g(X) add negate(h(X) add g(X) add X)) -> X
% Current number of equations to process: 285
% Current number of ordered equations: 0
% Current number of rules: 15
% New rule produced :
% [16] negate(negate(g(X) add negate(negate(X add X))) add X) -> g(X)
% Current number of equations to process: 293
% Current number of ordered equations: 0
% Current number of rules: 16
% New rule produced :
% [17] negate(negate(g(X) add negate(negate(X)) add X) add X) -> g(X)
% Current number of equations to process: 311
% Current number of ordered equations: 0
% Current number of rules: 17
% New rule produced :
% [18] negate(g(g(X) add negate(h(X))) add negate(X add X)) -> X
% Current number of equations to process: 339
% Current number of ordered equations: 0
% Current number of rules: 18
% New rule produced :
% [19] negate(g(X) add negate(X add X) add X) -> g(g(X) add negate(X add X))
% Current number of equations to process: 354
% Current number of ordered equations: 0
% Current number of rules: 19
% New rule produced :
% [20]
% negate(negate(negate(X add X) add negate(g(X))) add X) -> negate(X add X)
% Current number of equations to process: 378
% Current number of ordered equations: 0
% Current number of rules: 20
% New rule produced :
% [21] negate(g(negate(X) add X) add negate(g(X) add g(X))) -> g(X)
% Current number of equations to process: 397
% Current number of ordered equations: 0
% Current number of rules: 21
% New rule produced :
% [22] negate(negate(g(X) add negate(X) add negate(X)) add negate(X)) -> g(X)
% Current number of equations to process: 424
% Current number of ordered equations: 0
% Current number of rules: 22
% New rule produced :
% [23] negate(negate(g(X) add Y) add negate(negate(X) add X add Y)) -> Y
% Current number of equations to process: 455
% Current number of ordered equations: 0
% Current number of rules: 23
% New rule produced :
% [24] negate(negate(negate(h(X)) add negate(X) add X) add X) -> negate(h(X))
% Current number of equations to process: 690
% Current number of ordered equations: 0
% Current number of rules: 24
% New rule produced :
% [25] negate(g(g(X) add negate(X add X)) add negate(X add X)) -> X
% Current number of equations to process: 758
% Current number of ordered equations: 0
% Current number of rules: 25
% New rule produced :
% [26] negate(g(X) add negate(negate(negate(h(X) add g(X))) add X)) -> X
% Current number of equations to process: 776
% Current number of ordered equations: 0
% Current number of rules: 26
% New rule produced :
% [27] negate(g(X) add negate(g(X) add negate(negate(h(X))) add X)) -> X
% Current number of equations to process: 790
% Current number of ordered equations: 0
% Current number of rules: 27
% New rule produced :
% [28]
% negate(negate(negate(X add Y) add negate(Y) add X) add X) -> negate(X add Y)
% Current number of equations to process: 804
% Current number of ordered equations: 0
% Current number of rules: 28
% New rule produced :
% [29]
% negate(negate(g(X) add negate(negate(negate(negate(X)) add X))) add X) ->
% g(X)
% Current number of equations to process: 1058
% Current number of ordered equations: 0
% Current number of rules: 29
% New rule produced :
% [30]
% negate(g(X) add negate(g(X) add negate(h(X)) add negate(X))) -> negate(X)
% Current number of equations to process: 1110
% Current number of ordered equations: 0
% Current number of rules: 30
% New rule produced :
% [31] negate(negate(h(X) add g(X) add g(X) add X) add X) -> g(X)
% Current number of equations to process: 1157
% Current number of ordered equations: 0
% Current number of rules: 31
% New rule produced :
% [32] negate(g(g(X) add negate(X add X)) add negate(h(X))) -> g(X) add X
% Current number of equations to process: 1185
% Current number of ordered equations: 0
% Current number of rules: 32
% New rule produced :
% [33]
% negate(negate(negate(negate(X) add Y) add X add Y) add Y) ->
% negate(negate(X) add Y)
% Current number of equations to process: 1208
% Current number of ordered equations: 0
% Current number of rules: 33
% New rule produced :
% [34] negate(g(X) add negate(negate(negate(g(X) add X add X)) add X)) -> X
% Current number of equations to process: 1441
% Current number of ordered equations: 0
% Current number of rules: 34
% New rule produced :
% [35] negate(negate(g(X) add negate(h(X)) add Y) add negate(X add Y)) -> Y
% Current number of equations to process: 1468
% Current number of ordered equations: 0
% Current number of rules: 35
% New rule produced :
% [36]
% negate(g(g(X)) add negate(negate(g(X)) add negate(X) add X)) -> negate(g(X))
% Current number of equations to process: 1755
% Current number of ordered equations: 0
% Current number of rules: 36
% New rule produced :
% [37]
% negate(negate(negate(h(X)) add negate(g(X)) add X) add negate(h(X))) -> X
% Current number of equations to process: 1813
% Current number of ordered equations: 0
% Current number of rules: 37
% New rule produced :
% [38] negate(g(X) add negate(g(X) add negate(negate(X add X)) add X)) -> X
% Current number of equations to process: 1837
% Current number of ordered equations: 0
% Current number of rules: 38
% New rule produced :
% [39] negate(g(X) add negate(g(X) add negate(negate(X)) add X add X)) -> X
% Current number of equations to process: 1867
% Current number of ordered equations: 0
% Current number of rules: 39
% New rule produced :
% [40] negate(g(X) add negate(h(X) add g(X) add negate(negate(X)))) -> X
% Current number of equations to process: 1927
% Current number of ordered equations: 0
% Current number of rules: 40
% New rule produced :
% [41]
% negate(g(X) add negate(g(negate(X)) add negate(h(negate(X))) add X)) -> X
% Current number of equations to process: 1995
% Current number of ordered equations: 0
% Current number of rules: 41
% New rule produced :
% [42] negate(g(h(X)) add negate(X add X add X add X)) -> X add X add X
% Current number of equations to process: 2060
% Current number of ordered equations: 0
% Current number of rules: 42
% New rule produced :
% [43] negate(negate(g(X) add negate(X add X add X)) add negate(h(X))) -> g(X)
% Current number of equations to process: 2093
% Current number of ordered equations: 0
% Current number of rules: 43
% New rule produced :
% [44] negate(g(negate(X) add X) add negate(g(X) add X add X)) -> g(X) add X
% Current number of equations to process: 2123
% Current number of ordered equations: 0
% Current number of rules: 44
% New rule produced :
% [45]
% negate(negate(g(X) add negate(negate(negate(X) add negate(X)))) add negate(X))
% -> g(X)
% Current number of equations to process: 2198
% Current number of ordered equations: 0
% Current number of rules: 45
% New rule produced :
% [46]
% negate(g(X) add negate(g(X) add negate(X add X) add negate(X))) -> negate(X)
% Current number of equations to process: 2271
% Current number of ordered equations: 0
% Current number of rules: 46
% New rule produced :
% [47] h(X) add g(g(X)) add g(X) add g(X) -> h(g(X)) add X add X add X
% Current number of equations to process: 2349
% Current number of ordered equations: 2
% Current number of rules: 47
% New rule produced :
% [48] h(X) add g(g(X) add X) add g(X) add g(X) -> h(g(X) add X)
% Current number of equations to process: 2349
% Current number of ordered equations: 1
% Current number of rules: 48
% New rule produced :
% [49] h(X) add g(X add Y) add Y add Y add Y -> h(X add Y) add g(X)
% Current number of equations to process: 2349
% Current number of ordered equations: 0
% Current number of rules: 49
% New rule produced :
% [50] h(X add Y) add g(X) add g(Y) -> h(X) add h(Y) add g(X add Y)
% Current number of equations to process: 4097
% Current number of ordered equations: 0
% Current number of rules: 50
% New rule produced :
% [51] negate(g(X add Y) add negate(negate(negate(X add Y) add Y) add X)) -> X
% Current number of equations to process: 3670
% Current number of ordered equations: 0
% Current number of rules: 51
% New rule produced :
% [52]
% negate(negate(negate(g(X) add X) add X add X) add negate(h(X))) -> X add X
% Current number of equations to process: 4303
% Current number of ordered equations: 0
% Current number of rules: 52
% New rule produced :
% [53]
% negate(g(negate(X) add X) add negate(negate(g(X) add negate(X)) add X)) -> X
% Current number of equations to process: 4362
% Current number of ordered equations: 0
% Current number of rules: 53
% New rule produced :
% [54] negate(negate(g(X) add negate(X add X) add Y) add negate(X add Y)) -> Y
% Current number of equations to process: 4441
% Current number of ordered equations: 0
% Current number of rules: 54
% New rule produced :
% [55]
% negate(g(g(X) add negate(negate(negate(X)) add X)) add negate(X add X)) -> X
% Current number of equations to process: 2679
% Current number of ordered equations: 0
% Current number of rules: 55
% New rule produced :
% [56]
% negate(g(X) add negate(h(X) add g(X)) add X) ->
% g(negate(h(X) add g(X)) add X)
% Current number of equations to process: 2789
% Current number of ordered equations: 0
% Current number of rules: 56
% New rule produced :
% [57]
% negate(g(X) add negate(negate(negate(g(X) add negate(negate(h(X))))) add X))
% -> X
% Current number of equations to process: 2875
% Current number of ordered equations: 0
% Current number of rules: 57
% New rule produced :
% [58]
% negate(negate(g(negate(X)) add negate(negate(X)) add X) add negate(negate(X)))
% -> g(negate(X))
% Current number of equations to process: 2911
% Current number of ordered equations: 0
% Current number of rules: 58
% New rule produced :
% [59]
% negate(negate(negate(h(X)) add negate(X) add X add X) add negate(h(X))) -> X
% Current number of equations to process: 3002
% Current number of ordered equations: 0
% Current number of rules: 59
% New rule produced :
% [60]
% negate(negate(negate(X add Y) add negate(negate(negate(Y) add X))) add X) ->
% negate(X add Y)
% Current number of equations to process: 3119
% Current number of ordered equations: 0
% Current number of rules: 60
% New rule produced :
% [61]
% negate(g(negate(X) add X) add negate(negate(g(X) add X) add negate(X))) ->
% negate(X)
% Current number of equations to process: 3945
% Current number of ordered equations: 0
% Current number of rules: 61
% New rule produced :
% [62]
% negate(g(X) add negate(negate(negate(X)) add X) add X) ->
% g(g(X) add negate(negate(negate(X)) add X))
% Current number of equations to process: 4042
% Current number of ordered equations: 0
% Current number of rules: 62
% New rule produced :
% [63]
% negate(negate(negate(negate(negate(X)) add X) add negate(g(X))) add X) ->
% negate(negate(negate(X)) add X)
% Current number of equations to process: 4198
% Current number of ordered equations: 0
% Current number of rules: 63
% New rule produced :
% [64]
% negate(g(X) add negate(negate(h(X) add g(X)) add negate(X))) ->
% negate(h(X) add g(X))
% Current number of equations to process: 4322
% Current number of ordered equations: 0
% Current number of rules: 64
% New rule produced :
% [65]
% negate(negate(g(X) add negate(negate(h(X) add g(X) add X))) add X) -> g(X)
% Current number of equations to process: 4426
% Current number of ordered equations: 0
% Current number of rules: 65
% New rule produced :
% [66]
% negate(g(X) add negate(g(X) add negate(X) add negate(X) add negate(X))) ->
% negate(X)
% Current number of equations to process: 4496
% Current number of ordered equations: 0
% Current number of rules: 66
% New rule produced :
% [67]
% negate(negate(g(X) add negate(negate(h(X) add g(X))) add X) add X) -> g(X)
% Current number of equations to process: 4604
% Current number of ordered equations: 0
% Current number of rules: 67
% New rule produced :
% [68]
% negate(negate(g(X) add g(X) add negate(negate(h(X))) add X) add X) -> g(X)
% Current number of equations to process: 4677
% Current number of ordered equations: 0
% Current number of rules: 68
% New rule produced :
% [69]
% negate(negate(h(X) add g(X) add g(X) add negate(negate(X))) add X) -> g(X)
% Current number of equations to process: 4747
% Current number of ordered equations: 0
% Current number of rules: 69
% New rule produced :
% [70]
% negate(negate(negate(negate(X) add Y) add negate(negate(X add Y))) add Y) ->
% negate(negate(X) add Y)
% Current number of equations to process: 4878
% Current number of ordered equations: 0
% Current number of rules: 70
% New rule produced :
% [71]
% negate(negate(negate(g(X)) add X add X add X) add negate(h(X))) ->
% X add X add X
% Current number of equations to process: 3273
% Current number of ordered equations: 0
% Current number of rules: 71
% New rule produced :
% [72]
% negate(g(negate(negate(X) add Y) add negate(X add Y)) add negate(Y add Y)) ->
% Y
% Current number of equations to process: 3338
% Current number of ordered equations: 0
% Current number of rules: 72
% New rule produced :
% [73]
% negate(negate(negate(negate(negate(h(X)) add negate(g(X)))) add X) add
% negate(h(X))) -> X
% Current number of equations to process: 4272
% Current number of ordered equations: 0
% Current number of rules: 73
% New rule produced :
% [74]
% negate(g(X) add negate(negate(negate(g(X) add negate(negate(X add X)))) add X))
% -> X
% Current number of equations to process: 4332
% Current number of ordered equations: 0
% Current number of rules: 74
% New rule produced :
% [75]
% negate(g(X) add negate(negate(negate(g(X) add negate(negate(X)) add X)) add X))
% -> X
% Current number of equations to process: 4414
% Current number of ordered equations: 0
% Current number of rules: 75
% New rule produced :
% [76]
% negate(negate(negate(X add X) add negate(g(X)) add X) add negate(X add X)) ->
% X
% Current number of equations to process: 4540
% Current number of ordered equations: 0
% Current number of rules: 76
% New rule produced :
% [77]
% negate(g(X) add negate(g(X) add negate(negate(negate(negate(X)) add X)) add X))
% -> X
% Current number of equations to process: 4628
% Current number of ordered equations: 0
% Current number of rules: 77
% New rule produced :
% [78] negate(g(X) add negate(h(X) add g(X) add g(X) add X add X)) -> X
% Current number of equations to process: 4758
% Current number of ordered equations: 0
% Current number of rules: 78
% New rule produced :
% [79] negate(g(X) add negate(h(X) add h(X) add g(X) add g(X))) -> X
% Current number of equations to process: 4791
% Current number of ordered equations: 0
% Current number of rules: 79
% New rule produced :
% [80]
% negate(negate(g(g(X)) add negate(h(g(X))) add negate(h(X))) add X) ->
% negate(h(X))
% Current number of equations to process: 4902
% Current number of ordered equations: 0
% Current number of rules: 80
% New rule produced :
% [81]
% negate(g(X) add negate(g(negate(X)) add negate(negate(X) add negate(X)) add X))
% -> X
% Current number of equations to process: 4993
% Current number of ordered equations: 0
% Current number of rules: 81
% New rule produced :
% [82]
% negate(negate(g(X) add negate(X) add X add X) add negate(h(X))) ->
% g(X) add X add X
% Current number of equations to process: 2471
% Current number of ordered equations: 0
% Current number of rules: 82
% New rule produced :
% [83]
% negate(g(negate(X) add X) add g(X) add negate(X) add X) ->
% g(g(X) add negate(X) add X)
% Current number of equations to process: 2637
% Current number of ordered equations: 0
% Current number of rules: 83
% New rule produced :
% [84]
% negate(g(negate(X) add X) add negate(g(X) add negate(negate(X)) add X)) ->
% g(X) add X
% Current number of equations to process: 2939
% Current number of ordered equations: 0
% Current number of rules: 84
% New rule produced :
% [85]
% negate(g(negate(X) add X) add negate(negate(g(X)) add negate(X) add X)) ->
% negate(X) add X
% Current number of equations to process: 3077
% Current number of ordered equations: 0
% Current number of rules: 85
% New rule produced :
% [86]
% negate(g(X) add negate(negate(X) add negate(X)) add negate(X)) ->
% g(g(X) add negate(negate(X) add negate(X)))
% Current number of equations to process: 3218
% Current number of ordered equations: 0
% Current number of rules: 86
% New rule produced :
% [87]
% negate(negate(negate(negate(X) add negate(X)) add negate(g(X))) add negate(X))
% -> negate(negate(X) add negate(X))
% Current number of equations to process: 3394
% Current number of ordered equations: 0
% Current number of rules: 87
% New rule produced :
% [88]
% negate(g(X) add negate(g(X) add X add X) add X) ->
% g(negate(g(X) add X add X) add X)
% Current number of equations to process: 3544
% Current number of ordered equations: 0
% Current number of rules: 88
% New rule produced :
% [89] negate(g(negate(h(X) add g(X)) add X) add negate(g(X) add g(X))) -> g(X)
% Current number of equations to process: 3713
% Current number of ordered equations: 0
% Current number of rules: 89
% New rule produced :
% [90]
% negate(g(X) add negate(g(X) add negate(negate(negate(X)) add X) add negate(X)))
% -> negate(X)
% Current number of equations to process: 3777
% Current number of ordered equations: 0
% Current number of rules: 90
% New rule produced :
% [91]
% negate(negate(g(X) add negate(negate(g(X) add X add X)) add X) add X) -> g(X)
% Current number of equations to process: 3927
% Current number of ordered equations: 0
% Current number of rules: 91
% New rule produced :
% [92]
% negate(negate(g(X) add g(X) add negate(h(X)) add negate(X)) add negate(X)) ->
% g(X)
% Current number of equations to process: 4053
% Current number of ordered equations: 0
% Current number of rules: 92
% New rule produced :
% [93]
% negate(negate(g(X) add g(X) add negate(negate(X add X)) add X) add X) -> g(X)
% Current number of equations to process: 4211
% Current number of ordered equations: 0
% Current number of rules: 93
% New rule produced :
% [94]
% negate(negate(g(X) add g(X) add negate(negate(X)) add X add X) add X) -> g(X)
% Current number of equations to process: 4338
% Current number of ordered equations: 0
% Current number of rules: 94
% New rule produced :
% [95]
% negate(negate(g(negate(h(X))) add g(X) add negate(h(negate(h(X))))) add X) ->
% g(X)
% Current number of equations to process: 4548
% Current number of ordered equations: 0
% Current number of rules: 95
% New rule produced :
% [96]
% negate(negate(g(negate(X)) add g(X) add negate(h(negate(X))) add X) add X) ->
% g(X)
% Current number of equations to process: 4647
% Current number of ordered equations: 0
% Current number of rules: 96
% New rule produced :
% [97]
% negate(negate(negate(X) add Y) add negate(X add Y) add Y) ->
% g(negate(negate(X) add Y) add negate(X add Y))
% Current number of equations to process: 4831
% Current number of ordered equations: 0
% Current number of rules: 97
% New rule produced :
% [98]
% negate(g(negate(X) add X) add negate(g(X) add negate(X) add negate(X))) ->
% g(X) add negate(X)
% Current number of equations to process: 2805
% Current number of ordered equations: 0
% Current number of rules: 98
% New rule produced :
% [99]
% negate(negate(g(X) add negate(negate(negate(X)) add X) add Y) add negate(
% X add Y))
% -> Y
% Current number of equations to process: 2970
% Current number of ordered equations: 0
% Current number of rules: 99
% New rule produced :
% [100]
% negate(g(X) add negate(negate(g(X) add X add X) add negate(X))) ->
% negate(g(X) add X add X)
% Current number of equations to process: 3994
% Current number of ordered equations: 0
% Current number of rules: 100
% New rule produced :
% [101]
% negate(negate(g(X) add Y) add negate(negate(h(X) add g(X)) add X add Y)) -> Y
% Current number of equations to process: 4192
% Current number of ordered equations: 0
% Current number of rules: 101
% New rule produced :
% [102]
% negate(negate(negate(h(X) add g(X)) add negate(h(X)) add X) add X) ->
% negate(h(X))
% Current number of equations to process: 4977
% Current number of ordered equations: 0
% Current number of rules: 102
% New rule produced :
% [103]
% negate(negate(g(negate(X)) add negate(negate(negate(negate(X)) add X))) add
% negate(negate(X))) -> g(negate(X))
% Current number of equations to process: 1471
% Current number of ordered equations: 0
% Current number of rules: 103
% New rule produced :
% [104]
% negate(g(g(X) add negate(h(X) add g(X) add X)) add negate(X add X)) -> X
% Current number of equations to process: 1652
% Current number of ordered equations: 0
% Current number of rules: 104
% New rule produced :
% [105]
% negate(negate(g(g(X) add negate(h(X))) add X add X) add X) ->
% g(g(X) add negate(h(X)))
% Current number of equations to process: 1757
% Current number of ordered equations: 0
% Current number of rules: 105
% New rule produced :
% [106]
% negate(g(X) add negate(g(negate(X) add X) add g(X) add g(X))) ->
% g(negate(X) add X)
% Current number of equations to process: 1908
% Current number of ordered equations: 0
% Current number of rules: 106
% New rule produced :
% [107]
% negate(negate(negate(X) adCputime limit exceeded (core dumped)
%
% EOF
%------------------------------------------------------------------------------