TSTP Solution File: ROB035-1 by CiME---2.01
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CiME---2.01
% Problem : ROB035-1 : TPTP v6.0.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_cime %s
% Computer : n077.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.05s
% Output : None
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : ROB035-1 : TPTP v6.0.0. Released v4.1.0.
% % Command : tptp2X_and_run_cime %s
% % Computer : n077.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:23:28 CDT 2014
% % CPUTime : 300.05
% Processing problem /tmp/CiME_61848_n077.star.cs.uiowa.edu
% #verbose 1;
% let F = signature " add : AC; h : 1; g : 1; negate : 1;";
% let X = vars "X Y Z A X8 X9";
% 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 "
% h lr_lex;
% g lr_lex;
% negate lr_lex;
% add mul;
% ";
%
% let p1 = precedence F "
% h > negate > g > add";
%
% let s2 = status F "
% h mul;
% g mul;
% negate mul;
% add mul;
% ";
%
% let p2 = precedence F "
% h > negate > g > add";
%
% let o_auto = AUTO Axioms;
%
% let o = LEX o_auto (LEX (ACRPO s1 p1) (ACRPO s2 p2));
%
% let Conjectures = equations F X " negate(X8 add X9) = negate(X9);"
% ;
% (*
% 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(X8 add X9) = negate(X9) }
% (1 equation(s))
% time is now on
%
% Initializing completion ...
% New rule produced : [1] (eq)(X,X) -> (true)
% Current number of equations to process: 0
% Current number of ordered equations: 4
% Current number of rules: 1
% New rule produced : [2] (eq)(negate(X8 add X9),negate(X9)) -> (false)
% Current number of equations to process: 0
% Current number of ordered equations: 3
% Current number of rules: 2
% New rule produced : [3] negate(negate(A) add A) -> g(A)
% Current number of equations to process: 0
% Current number of ordered equations: 2
% Current number of rules: 3
% New rule produced : [4] 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: 4
% New rule produced :
% [5] 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: 5
% New rule produced : [6] (eq)(g(X),negate(X)) -> (false)
% Current number of equations to process: 5
% Current number of ordered equations: 0
% Current number of rules: 6
% New rule produced : [7] (eq)(g(X),negate(negate(X))) -> (false)
% Current number of equations to process: 4
% Current number of ordered equations: 0
% Current number of rules: 7
% New rule produced : [8] (eq)(g(X add Y),negate(X)) -> (false)
% Current number of equations to process: 3
% Current number of ordered equations: 0
% Current number of rules: 8
% New rule produced : [9] (eq)(negate(negate(X) add X add Y),g(X)) -> (false)
% Current number of equations to process: 2
% Current number of ordered equations: 0
% Current number of rules: 9
% New rule produced : [10] (eq)(negate(h(X)),negate(X)) -> (false)
% Current number of equations to process: 131
% Current number of ordered equations: 0
% Current number of rules: 10
% New rule produced : [11] (eq)(negate(h(X)),negate(g(X))) -> (false)
% Current number of equations to process: 130
% Current number of ordered equations: 0
% Current number of rules: 11
% New rule produced : [12] (eq)(negate(h(X)),negate(X add X)) -> (false)
% Current number of equations to process: 129
% Current number of ordered equations: 0
% Current number of rules: 12
% New rule produced : [13] (eq)(negate(h(X) add Y),negate(X)) -> (false)
% Current number of equations to process: 127
% Current number of ordered equations: 1
% Current number of rules: 13
% New rule produced : [14] (eq)(negate(h(X add Y)),negate(X)) -> (false)
% Current number of equations to process: 127
% Current number of ordered equations: 0
% Current number of rules: 14
% New rule produced : [15] (eq)(negate(h(X) add Y),negate(g(X))) -> (false)
% Current number of equations to process: 125
% Current number of ordered equations: 1
% Current number of rules: 15
% New rule produced : [16] (eq)(negate(h(X)),negate(g(X) add X)) -> (false)
% Current number of equations to process: 125
% Current number of ordered equations: 0
% Current number of rules: 16
% New rule produced : [17] (eq)(negate(h(X) add Y),negate(X add Y)) -> (false)
% Current number of equations to process: 122
% Current number of ordered equations: 2
% Current number of rules: 17
% New rule produced : [18] (eq)(negate(h(X) add Y),negate(X add X)) -> (false)
% Current number of equations to process: 122
% Current number of ordered equations: 1
% Current number of rules: 18
% New rule produced : [19] (eq)(negate(h(X add Y)),negate(X add X)) -> (false)
% Current number of equations to process: 122
% Current number of ordered equations: 0
% Current number of rules: 19
% New rule produced :
% [20] (eq)(negate(h(X) add Y),negate(g(X) add Y)) -> (false)
% Current number of equations to process: 119
% Current number of ordered equations: 2
% Current number of rules: 20
% New rule produced :
% [21] (eq)(negate(h(X) add Y),negate(g(X) add X)) -> (false)
% Current number of equations to process: 119
% Current number of ordered equations: 1
% Current number of rules: 21
% New rule produced : [22] (eq)(negate(h(X)),negate(X add X add X)) -> (false)
% Current number of equations to process: 119
% Current number of ordered equations: 0
% Current number of rules: 22
% New rule produced : [23] (eq)(negate(h(X add Y) add Z),negate(X)) -> (false)
% Current number of equations to process: 118
% Current number of ordered equations: 0
% Current number of rules: 23
% New rule produced :
% [24] (eq)(negate(h(X) add Y),negate(X add X add Y)) -> (false)
% Current number of equations to process: 113
% Current number of ordered equations: 4
% Current number of rules: 24
% New rule produced :
% [25] (eq)(negate(h(X) add Y),negate(X add X add X)) -> (false)
% Current number of equations to process: 113
% Current number of ordered equations: 3
% Current number of rules: 25
% New rule produced :
% [26] (eq)(negate(h(X add Y)),negate(X add X add Y)) -> (false)
% Current number of equations to process: 113
% Current number of ordered equations: 2
% Current number of rules: 26
% New rule produced :
% [27] (eq)(negate(h(X add Y)),negate(X add X add X)) -> (false)
% Current number of equations to process: 113
% Current number of ordered equations: 1
% Current number of rules: 27
% New rule produced :
% [28] (eq)(negate(h(X)),negate(g(X) add X add X)) -> (false)
% Current number of equations to process: 113
% Current number of ordered equations: 0
% Current number of rules: 28
% New rule produced :
% [29] (eq)(g(X add Y),negate(negate(X add Y) add Y)) -> (false)
% Current number of equations to process: 112
% Current number of ordered equations: 0
% Current number of rules: 29
% New rule produced :
% [30] (eq)(negate(h(X) add Y add Z),negate(X add Y)) -> (false)
% Current number of equations to process: 109
% Current number of ordered equations: 2
% Current number of rules: 30
% New rule produced :
% [31] (eq)(negate(h(X add Y) add Z),negate(X add Z)) -> (false)
% Current number of equations to process: 109
% Current number of ordered equations: 1
% Current number of rules: 31
% New rule produced :
% [32] (eq)(negate(h(X add Y) add Z),negate(X add X)) -> (false)
% Current number of equations to process: 109
% Current number of ordered equations: 0
% Current number of rules: 32
% New rule produced :
% [33] (eq)(negate(h(X) add Y add Z),negate(g(X) add Y)) -> (false)
% Current number of equations to process: 105
% Current number of ordered equations: 3
% Current number of rules: 33
% New rule produced :
% [34] (eq)(negate(h(X) add Y),negate(g(X) add X add Y)) -> (false)
% Current number of equations to process: 105
% Current number of ordered equations: 2
% Current number of rules: 34
% New rule produced :
% [35] (eq)(negate(h(X) add Y),negate(g(X) add X add X)) -> (false)
% Current number of equations to process: 105
% Current number of ordered equations: 1
% Current number of rules: 35
% New rule produced :
% [36] (eq)(negate(h(X add Y)),negate(g(X add Y) add X)) -> (false)
% Current number of equations to process: 105
% Current number of ordered equations: 0
% Current number of rules: 36
% New rule produced :
% [37] (eq)(negate(h(X) add Y add Z),negate(X add X add Y)) -> (false)
% Current number of equations to process: 100
% Current number of ordered equations: 4
% Current number of rules: 37
% New rule produced :
% [38] (eq)(negate(h(X add Y) add Z),negate(X add X add Z)) -> (false)
% Current number of equations to process: 100
% Current number of ordered equations: 3
% Current number of rules: 38
% New rule produced :
% [39] (eq)(negate(h(X add Y) add Z),negate(X add X add Y)) -> (false)
% Current number of equations to process: 100
% Current number of ordered equations: 2
% Current number of rules: 39
% New rule produced :
% [40] (eq)(negate(h(X add Y) add Z),negate(X add X add X)) -> (false)
% Current number of equations to process: 100
% Current number of ordered equations: 1
% Current number of rules: 40
% New rule produced :
% [41] (eq)(negate(h(X add Y add Z)),negate(X add X add Y)) -> (false)
% Current number of equations to process: 100
% Current number of ordered equations: 0
% Current number of rules: 41
% New rule produced :
% [42] negate(g(X) add negate(X) add X) -> g(negate(X) add X)
% Current number of equations to process: 99
% Current number of ordered equations: 0
% Current number of rules: 42
% New rule produced :
% [43] (eq)(negate(h(X) add Y add Z),negate(g(X) add X add Y)) -> (false)
% Current number of equations to process: 95
% Current number of ordered equations: 3
% Current number of rules: 43
% New rule produced :
% [44] (eq)(negate(h(X add Y) add Z),negate(g(X add Y) add X)) -> (false)
% Current number of equations to process: 95
% Current number of ordered equations: 2
% Current number of rules: 44
% New rule produced :
% [45] (eq)(negate(h(X) add Y),negate(X add X add X add Y)) -> (false)
% Current number of equations to process: 95
% Current number of ordered equations: 1
% Current number of rules: 45
% New rule produced :
% [46] (eq)(negate(h(X add Y)),negate(X add X add X add Y)) -> (false)
% Current number of equations to process: 95
% Current number of ordered equations: 0
% Current number of rules: 46
% New rule produced :
% [47] (eq)(negate(h(X add Y) add Z add A),negate(X add Z)) -> (false)
% Current number of equations to process: 94
% Current number of ordered equations: 0
% Current number of rules: 47
% New rule produced : [48] (eq)(X,negate(negate(X add Y))) -> (false)
% Current number of equations to process: 101
% Current number of ordered equations: 0
% Current number of rules: 48
% New rule produced : [49] negate(g(X) add negate(X add X)) -> X
% Current number of equations to process: 108
% Current number of ordered equations: 0
% Current number of rules: 49
% New rule produced : [50] (eq)(g(negate(X) add X),g(X)) -> (false)
% Current number of equations to process: 224
% Current number of ordered equations: 0
% Current number of rules: 50
% New rule produced : [51] (eq)(g(negate(X) add X),negate(g(X))) -> (false)
% Current number of equations to process: 225
% Current number of ordered equations: 0
% Current number of rules: 51
% New rule produced : [52] (eq)(g(h(X)),negate(X)) -> (false)
% Current number of equations to process: 338
% Current number of ordered equations: 0
% Current number of rules: 52
% New rule produced : [53] (eq)(g(h(X)),negate(g(X))) -> (false)
% Current number of equations to process: 337
% Current number of ordered equations: 0
% Current number of rules: 53
% New rule produced : [54] (eq)(g(h(X)),negate(X add X)) -> (false)
% Current number of equations to process: 336
% Current number of ordered equations: 0
% Current number of rules: 54
% New rule produced : [55] (eq)(g(h(X) add Y),negate(X)) -> (false)
% Current number of equations to process: 334
% Current number of ordered equations: 1
% Current number of rules: 55
% New rule produced : [56] (eq)(g(h(X add Y)),negate(X)) -> (false)
% Current number of equations to process: 334
% Current number of ordered equations: 0
% Current number of rules: 56
% New rule produced : [57] (eq)(g(h(X) add Y),negate(g(X))) -> (false)
% Current number of equations to process: 332
% Current number of ordered equations: 1
% Current number of rules: 57
% New rule produced : [58] (eq)(g(h(X)),negate(g(X) add X)) -> (false)
% Current number of equations to process: 332
% Current number of ordered equations: 0
% Current number of rules: 58
% New rule produced : [59] (eq)(g(h(X) add Y),negate(X add Y)) -> (false)
% Current number of equations to process: 329
% Current number of ordered equations: 2
% Current number of rules: 59
% New rule produced : [60] (eq)(g(h(X) add Y),negate(X add X)) -> (false)
% Current number of equations to process: 329
% Current number of ordered equations: 1
% Current number of rules: 60
% New rule produced : [61] (eq)(g(h(X add Y)),negate(Y add Y)) -> (false)
% Current number of equations to process: 329
% Current number of ordered equations: 0
% Current number of rules: 61
% New rule produced : [62] (eq)(g(h(X) add Y),negate(g(X) add Y)) -> (false)
% Current number of equations to process: 326
% Current number of ordered equations: 2
% Current number of rules: 62
% New rule produced : [63] (eq)(g(h(X) add Y),negate(g(X) add X)) -> (false)
% Current number of equations to process: 326
% Current number of ordered equations: 1
% Current number of rules: 63
% New rule produced : [64] (eq)(g(h(X)),negate(X add X add X)) -> (false)
% Current number of equations to process: 326
% Current number of ordered equations: 0
% Current number of rules: 64
% New rule produced : [65] (eq)(g(negate(X) add X add Y),g(X)) -> (false)
% Current number of equations to process: 325
% Current number of ordered equations: 0
% Current number of rules: 65
% New rule produced : [66] (eq)(g(h(X add Y) add Z),negate(X)) -> (false)
% Current number of equations to process: 324
% Current number of ordered equations: 0
% Current number of rules: 66
% New rule produced : [67] (eq)(negate(h(negate(X)) add X),g(X)) -> (false)
% Current number of equations to process: 495
% Current number of ordered equations: 2
% Current number of rules: 67
% New rule produced : [68] (eq)(negate(h(X) add negate(X)),g(X)) -> (false)
% Current number of equations to process: 495
% Current number of ordered equations: 1
% Current number of rules: 68
% New rule produced : [69] (eq)(negate(h(negate(X) add X)),g(X)) -> (false)
% Current number of equations to process: 495
% Current number of ordered equations: 0
% Current number of rules: 69
% New rule produced : [70] (eq)(g(h(X) add Y),negate(X add X add Y)) -> (false)
% Current number of equations to process: 490
% Current number of ordered equations: 4
% Current number of rules: 70
% New rule produced : [71] (eq)(g(h(X) add Y),negate(X add X add X)) -> (false)
% Current number of equations to process: 490
% Current number of ordered equations: 3
% Current number of rules: 71
% New rule produced : [72] (eq)(g(h(X add Y)),negate(Y add Y add Y)) -> (false)
% Current number of equations to process: 490
% Current number of ordered equations: 2
% Current number of rules: 72
% New rule produced : [73] (eq)(g(h(X add Y)),negate(X add Y add Y)) -> (false)
% Current number of equations to process: 490
% Current number of ordered equations: 1
% Current number of rules: 73
% New rule produced : [74] (eq)(g(h(X)),negate(g(X) add X add X)) -> (false)
% Current number of equations to process: 490
% Current number of ordered equations: 0
% Current number of rules: 74
% New rule produced :
% [75] (eq)(negate(h(X) add negate(g(X))),g(g(X))) -> (false)
% Current number of equations to process: 489
% Current number of ordered equations: 0
% Current number of rules: 75
% New rule produced : [76] (eq)(g(h(X) add Y add Z),negate(X add Z)) -> (false)
% Current number of equations to process: 486
% Current number of ordered equations: 2
% Current number of rules: 76
% New rule produced : [77] (eq)(g(h(X add Y) add Z),negate(Y add Z)) -> (false)
% Current number of equations to process: 486
% Current number of ordered equations: 1
% Current number of rules: 77
% New rule produced : [78] (eq)(g(h(X add Y) add Z),negate(Y add Y)) -> (false)
% Current number of equations to process: 486
% Current number of ordered equations: 0
% Current number of rules: 78
% New rule produced :
% [79] (eq)(negate(h(negate(X)) add X add Y),g(X)) -> (false)
% Current number of equations to process: 480
% Current number of ordered equations: 5
% Current number of rules: 79
% New rule produced :
% [80] (eq)(negate(h(negate(X) add Y) add X),g(X)) -> (false)
% Current number of equations to process: 480
% Current number of ordered equations: 4
% Current number of rules: 80
% New rule produced :
% [81] (eq)(negate(h(X) add negate(X) add Y),g(X)) -> (false)
% Current number of equations to process: 480
% Current number of ordered equations: 3
% Current number of rules: 81
% New rule produced :
% [82] (eq)(negate(h(negate(X) add X) add Y),g(X)) -> (false)
% Current number of equations to process: 480
% Current number of ordered equations: 2
% Current number of rules: 82
% New rule produced :
% [83] (eq)(negate(h(X add Y) add negate(X)),g(X)) -> (false)
% Current number of equations to process: 480
% Current number of ordered equations: 1
% Current number of rules: 83
% New rule produced :
% [84] (eq)(negate(h(negate(X) add X add Y)),g(X)) -> (false)
% Current number of equations to process: 480
% Current number of ordered equations: 0
% Current number of rules: 84
% New rule produced :
% [85] (eq)(g(h(X) add Y add Z),negate(g(X) add Z)) -> (false)
% Current number of equations to process: 476
% Current number of ordered equations: 3
% Current number of rules: 85
% New rule produced :
% [86] (eq)(g(h(X) add Y),negate(g(X) add X add Y)) -> (false)
% Current number of equations to process: 476
% Current number of ordered equations: 2
% Current number of rules: 86
% New rule produced :
% [87] (eq)(g(h(X) add Y),negate(g(X) add X add X)) -> (false)
% Current number of equations to process: 476
% Current number of ordered equations: 1
% Current number of rules: 87
% New rule produced :
% [88] (eq)(g(h(X add Y)),negate(g(X add Y) add Y)) -> (false)
% Current number of equations to process: 476
% Current number of ordered equations: 0
% Current number of rules: 88
% New rule produced : [89] (eq)(negate(h(h(X))),negate(X)) -> (false)
% Current number of equations to process: 487
% Current number of ordered equations: 0
% Current number of rules: 89
% New rule produced : [90] (eq)(negate(h(h(X)) add Y),negate(X)) -> (false)
% Current number of equations to process: 485
% Current number of ordered equations: 1
% Current number of rules: 90
% New rule produced : [91] (eq)(negate(h(h(X) add Y)),negate(X)) -> (false)
% Current number of equations to process: 485
% Current number of ordered equations: 0
% Current number of rules: 91
% New rule produced : [92] (eq)(negate(h(h(X))),negate(g(X))) -> (false)
% Current number of equations to process: 595
% Current number of ordered equations: 0
% Current number of rules: 92
% New rule produced : [93] (eq)(negate(h(h(X))),negate(X add X)) -> (false)
% Current number of equations to process: 594
% Current number of ordered equations: 0
% Current number of rules: 93
% New rule produced : [94] (eq)(negate(h(h(X add Y))),negate(X)) -> (false)
% Current number of equations to process: 592
% Current number of ordered equations: 1
% Current number of rules: 94
% New rule produced : [95] (eq)(negate(h(h(X))),negate(g(X) add X)) -> (false)
% Current number of equations to process: 592
% Current number of ordered equations: 0
% Current number of rules: 95
% New rule produced : [96] (eq)(negate(h(h(X) add Y)),negate(g(X))) -> (false)
% Current number of equations to process: 591
% Current number of ordered equations: 0
% Current number of rules: 96
% New rule produced :
% [97] (eq)(negate(h(h(X add Y))),negate(Y add Y)) -> (false)
% Current number of equations to process: 587
% Current number of ordered equations: 3
% Current number of rules: 97
% New rule produced :
% [98] (eq)(negate(h(h(X) add Y)),negate(X add Y)) -> (false)
% Current number of equations to process: 587
% Current number of ordered equations: 2
% Current number of rules: 98
% New rule produced :
% [99] (eq)(negate(h(h(X) add Y)),negate(X add X)) -> (false)
% Current number of equations to process: 587
% Current number of ordered equations: 1
% Current number of rules: 99
% New rule produced :
% [100] (eq)(negate(h(h(X))),negate(X add X add X)) -> (false)
% Current number of equations to process: 587
% Current number of ordered equations: 0
% Current number of rules: 100
% New rule produced :
% [101] (eq)(negate(h(h(X) add Y)),negate(g(X) add Y)) -> (false)
% Current number of equations to process: 585
% Current number of ordered equations: 1
% Current number of rules: 101
% New rule produced :
% [102] (eq)(negate(h(h(X) add Y)),negate(g(X) add X)) -> (false)
% Current number of equations to process: 585
% Current number of ordered equations: 0
% Current number of rules: 102
% New rule produced : [103] (eq)(negate(h(h(X)) add Y),negate(g(X))) -> (false)
% Current number of equations to process: 587
% Current number of ordered equations: 0
% Current number of rules: 103
% New rule produced : [104] (eq)(g(h(X)),negate(negate(h(X)) add X)) -> (false)
% Current number of equations to process: 590
% Current number of ordered equations: 0
% Current number of rules: 104
% New rule produced :
% [105] (eq)(negate(h(h(X) add Y) add Z),negate(X)) -> (false)
% Current number of equations to process: 703
% Current number of ordered equations: 0
% Current number of rules: 105
% New rule produced :
% [106] (eq)(negate(h(h(X add Y) add Z)),negate(X)) -> (false)
% Current number of equations to process: 697
% Current number of ordered equations: 5
% Current number of rules: 106
% New rule produced :
% [107] (eq)(negate(h(h(X add Y))),negate(Y add Y add Y)) -> (false)
% Current number of equations to process: 697
% Current number of ordered equations: 4
% Current number of rules: 107
% New rule produced :
% [108] (eq)(negate(h(h(X add Y))),negate(X add Y add Y)) -> (false)
% Current number of equations to process: 697
% Current number of ordered equations: 3
% Current number of rules: 108
% New rule produced :
% [109] (eq)(negate(h(h(X) add Y)),negate(X add X add Y)) -> (false)
% Current number of equations to process: 697
% Current number of ordered equations: 2
% Current number of rules: 109
% New rule produced :
% [110] (eq)(negate(h(h(X) add Y)),negate(X add X add X)) -> (false)
% Current number of equations to process: 697
% Current number of ordered equations: 1
% Current number of rules: 110
% New rule produced :
% [111] (eq)(negate(h(h(X))),negate(g(X) add X add X)) -> (false)
% Current number of equations to process: 697
% Current number of ordered equations: 0
% Current number of rules: 111
% New rule produced :
% [112] (eq)(negate(h(h(X)) add Y),negate(X add X)) -> (false)
% Current number of equations to process: 706
% Current number of ordered equations: 0
% Current number of rules: 112
% New rule produced :
% [113] (eq)(negate(h(h(X))),negate(g(X) add g(X))) -> (false)
% Current number of equations to process: 820
% Current number of ordered equations: 0
% Current number of rules: 113
% New rule produced :
% [114] (eq)(negate(h(h(X) add Y)),negate(g(X) add g(X))) -> (false)
% Current number of equations to process: 819
% Current number of ordered equations: 0
% Current number of rules: 114
% New rule produced :
% [115] (eq)(g(h(X)),negate(g(X) add negate(h(X)))) -> (false)
% Current number of equations to process: 829
% Current number of ordered equations: 0
% Current number of rules: 115
% New rule produced :
% [116] (eq)(negate(h(h(X)) add Y),negate(g(X) add X)) -> (false)
% Current number of equations to process: 830
% Current number of ordered equations: 0
% Current number of rules: 116
% New rule produced :
% [117] (eq)(negate(h(h(X add Y)) add Z),negate(X)) -> (false)
% Current number of equations to process: 937
% Current number of ordered equations: 1
% Current number of rules: 117
% New rule produced :
% [118] (eq)(negate(h(h(X)) add Y),negate(X add X add X)) -> (false)
% Current number of equations to process: 937
% Current number of ordered equations: 0
% Current number of rules: 118
% New rule produced :
% [119] (eq)(negate(h(h(X) add Y) add Z),negate(g(X))) -> (false)
% Current number of equations to process: 936
% Current number of ordered equations: 0
% Current number of rules: 119
% New rule produced :
% [120] (eq)(g(h(X)),negate(negate(h(X)) add X add X)) -> (false)
% Current number of equations to process: 1052
% Current number of ordered equations: 0
% Current number of rules: 120
% New rule produced : [121] (eq)(negate(h(h(X))),negate(h(X) add X)) -> (false)
% Current number of equations to process: 1274
% Current number of ordered equations: 0
% Current number of rules: 121
% New rule produced :
% [122] (eq)(negate(h(h(X))),nCputime limit exceeded (core dumped)
%
% EOF
%------------------------------------------------------------------------------