TSTP Solution File: ROB026-1 by CiME---2.01
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CiME---2.01
% Problem : ROB026-1 : TPTP v6.0.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_cime %s
% Computer : n057.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.09s
% Output : None
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : ROB026-1 : TPTP v6.0.0. Released v1.2.0.
% % Command : tptp2X_and_run_cime %s
% % Computer : n057.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 16:53:33 CDT 2014
% % CPUTime : 300.09
% Processing problem /tmp/CiME_3242_n057.star.cs.uiowa.edu
% #verbose 1;
% let F = signature " add : AC; b,a,d,c : constant; negate : 1;";
% let X = vars "X Y Z";
% let Axioms = equations F X "
% negate(negate(X add Y) add negate(X add negate(Y))) = X;
% c add d = c;
% ";
%
% let s1 = status F "
% b lr_lex;
% a lr_lex;
% d lr_lex;
% c lr_lex;
% negate lr_lex;
% add mul;
% ";
%
% let p1 = precedence F "
% negate > add > c > d > a > b";
%
% let s2 = status F "
% b mul;
% a mul;
% d mul;
% c mul;
% negate mul;
% add mul;
% ";
%
% let p2 = precedence F "
% negate > add > c = d = a = b";
%
% let o_auto = AUTO Axioms;
%
% let o = LEX o_auto (LEX (ACRPO s1 p1) (ACRPO s2 p2));
%
% let Conjectures = equations F X " negate(a add negate(b)) add negate(negate(a) add negate(b)) = 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 = { negate(negate(negate(Y) add X) add negate(
% X add Y)) = X,
% d add c = c } (2 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(a add negate(b)) add negate(
% negate(b) add
% negate(a)) = b }
% (1 equation(s))
% time is now on
%
% Initializing completion ...
% New rule produced : [1] d add c -> c
% Current number of equations to process: 0
% Current number of ordered equations: 1
% Current number of rules: 1
% New rule produced :
% [2] 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: 2
% New rule produced : [3] negate(negate(d add negate(c)) add negate(c)) -> d
% Current number of equations to process: 11
% Current number of ordered equations: 1
% Current number of rules: 3
% New rule produced : [4] negate(negate(c add negate(d)) add negate(c)) -> c
% Current number of equations to process: 11
% Current number of ordered equations: 0
% Current number of rules: 4
% New rule produced :
% [5] negate(d add negate(d add negate(c) add negate(c))) -> negate(c)
% Current number of equations to process: 20
% Current number of ordered equations: 0
% Current number of rules: 5
% New rule produced :
% [6] negate(c add negate(c add negate(d) add negate(c))) -> negate(c)
% Current number of equations to process: 23
% Current number of ordered equations: 0
% Current number of rules: 6
% New rule produced :
% [7] negate(negate(d add negate(c add X)) add negate(c add X)) -> d
% Current number of equations to process: 25
% Current number of ordered equations: 1
% Current number of rules: 7
% New rule produced :
% [8] negate(negate(c add negate(d add X)) add negate(c add X)) -> c
% Current number of equations to process: 25
% Current number of ordered equations: 0
% Current number of rules: 8
% New rule produced :
% [9] negate(negate(c add negate(d add d)) add negate(c)) -> c
% Current number of equations to process: 31
% Current number of ordered equations: 0
% Current number of rules: 9
% New rule produced :
% [10]
% negate(d add negate(c add negate(d add negate(c)))) ->
% negate(d add negate(c))
% Current number of equations to process: 42
% Current number of ordered equations: 0
% Current number of rules: 10
% New rule produced :
% [11]
% negate(c add negate(c add negate(c add negate(d)))) ->
% negate(c add negate(d))
% Current number of equations to process: 46
% Current number of ordered equations: 0
% Current number of rules: 11
% New rule produced :
% [12]
% negate(d add negate(negate(c) add negate(negate(d add negate(c))))) ->
% negate(c)
% Current number of equations to process: 50
% Current number of ordered equations: 0
% Current number of rules: 12
% New rule produced :
% [13]
% negate(c add negate(negate(c) add negate(negate(c add negate(d))))) ->
% negate(c)
% Current number of equations to process: 54
% Current number of ordered equations: 0
% Current number of rules: 13
% New rule produced :
% [14] negate(c add negate(c add negate(d add d) add negate(c))) -> negate(c)
% Current number of equations to process: 58
% Current number of ordered equations: 0
% Current number of rules: 14
% New rule produced :
% [15] negate(negate(d add negate(c) add X) add negate(c add X)) -> d add X
% Current number of equations to process: 61
% Current number of ordered equations: 1
% Current number of rules: 15
% New rule produced :
% [16] negate(negate(c add negate(d) add X) add negate(c add X)) -> c add X
% Current number of equations to process: 61
% Current number of ordered equations: 0
% Current number of rules: 16
% New rule produced :
% [17] negate(negate(d add d add negate(c)) add negate(c)) -> d add d
% Current number of equations to process: 62
% Current number of ordered equations: 0
% Current number of rules: 17
% New rule produced :
% [18] negate(negate(d add d add negate(c) add negate(c)) add negate(c)) -> d
% Current number of equations to process: 84
% Current number of ordered equations: 0
% Current number of rules: 18
% New rule produced :
% [19] negate(negate(c add c add negate(d) add negate(c)) add negate(c)) -> c
% Current number of equations to process: 88
% Current number of ordered equations: 0
% Current number of rules: 19
% New rule produced :
% [20]
% negate(negate(negate(X add Y) add negate(Y) add X) add X) -> negate(X add Y)
% Current number of equations to process: 92
% Current number of ordered equations: 0
% Current number of rules: 20
% New rule produced :
% [21]
% negate(negate(negate(negate(X) add Y) add X add Y) add Y) ->
% negate(negate(X) add Y)
% Current number of equations to process: 176
% Current number of ordered equations: 0
% Current number of rules: 21
% New rule produced :
% [22]
% negate(d add negate(negate(d add negate(c)) add negate(negate(c)))) ->
% negate(d add negate(c))
% Current number of equations to process: 257
% Current number of ordered equations: 0
% Current number of rules: 22
% New rule produced :
% [23]
% negate(c add negate(negate(c add negate(d)) add negate(negate(c)))) ->
% negate(c add negate(d))
% Current number of equations to process: 266
% Current number of ordered equations: 0
% Current number of rules: 23
% New rule produced :
% [24] negate(negate(c add negate(d add d add X)) add negate(c add X)) -> c
% Current number of equations to process: 277
% Current number of ordered equations: 0
% Current number of rules: 24
% New rule produced :
% [25] negate(negate(c add negate(d add d add d)) add negate(c)) -> c
% Current number of equations to process: 283
% Current number of ordered equations: 0
% Current number of rules: 25
% New rule produced :
% [26]
% negate(negate(d add negate(c)) add negate(c add negate(d add negate(c)))) ->
% d
% Current number of equations to process: 313
% Current number of ordered equations: 0
% Current number of rules: 26
% New rule produced :
% [27]
% negate(c add negate(negate(c) add negate(negate(c add negate(d add d))))) ->
% negate(c)
% Current number of equations to process: 323
% Current number of ordered equations: 0
% Current number of rules: 27
% New rule produced :
% [28]
% negate(d add d add negate(d add d add negate(c) add negate(c))) -> negate(c)
% Current number of equations to process: 335
% Current number of ordered equations: 0
% Current number of rules: 28
% New rule produced :
% [29]
% negate(c add negate(c add negate(d add d add d) add negate(c))) -> negate(c)
% Current number of equations to process: 348
% Current number of ordered equations: 0
% Current number of rules: 29
% New rule produced :
% [30]
% negate(negate(d add negate(negate(d add negate(c) add negate(c)))) add
% negate(c)) -> d
% Current number of equations to process: 360
% Current number of ordered equations: 0
% Current number of rules: 30
% New rule produced :
% [31]
% negate(negate(c add negate(negate(c add negate(d) add negate(c)))) add
% negate(c)) -> c
% Current number of equations to process: 370
% Current number of ordered equations: 0
% Current number of rules: 31
% New rule produced :
% [32]
% negate(c add negate(c add negate(c add negate(d add d)))) ->
% negate(c add negate(d add d))
% Current number of equations to process: 380
% Current number of ordered equations: 0
% Current number of rules: 32
% New rule produced :
% [33]
% negate(negate(d add negate(c) add negate(negate(d add negate(c)))) add
% negate(c)) -> d
% Current number of equations to process: 392
% Current number of ordered equations: 0
% Current number of rules: 33
% New rule produced :
% [34]
% negate(negate(c add negate(c) add negate(negate(c add negate(d)))) add
% negate(c)) -> c
% Current number of equations to process: 402
% Current number of ordered equations: 0
% Current number of rules: 34
% New rule produced :
% [35]
% negate(negate(c add c add negate(d add d) add negate(c)) add negate(c)) -> c
% Current number of equations to process: 412
% Current number of ordered equations: 0
% Current number of rules: 35
% New rule produced :
% [36]
% 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: 419
% Current number of ordered equations: 0
% Current number of rules: 36
% New rule produced :
% [37]
% negate(d add negate(d add negate(c add X) add negate(c add X))) ->
% negate(c add X)
% Current number of equations to process: 629
% Current number of ordered equations: 0
% Current number of rules: 37
% New rule produced :
% [38]
% negate(c add negate(c add negate(d add X) add negate(c add X))) ->
% negate(c add X)
% Current number of equations to process: 642
% Current number of ordered equations: 0
% Current number of rules: 38
% New rule produced :
% [39]
% negate(d add negate(d add d add negate(c) add negate(c) add negate(c))) ->
% negate(c)
% Current number of equations to process: 686
% Current number of ordered equations: 0
% Current number of rules: 39
% New rule produced :
% [40]
% negate(c add negate(c add c add negate(d) add negate(c) add negate(c))) ->
% negate(c)
% Current number of equations to process: 700
% Current number of ordered equations: 0
% Current number of rules: 40
% New rule produced :
% [41]
% 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: 713
% Current number of ordered equations: 0
% Current number of rules: 41
% New rule produced :
% [42]
% negate(negate(d add X) add negate(negate(d add negate(c)) add negate(c) add X))
% -> X
% Current number of equations to process: 957
% Current number of ordered equations: 0
% Current number of rules: 42
% New rule produced :
% [43]
% negate(negate(c add negate(d add negate(c)) add negate(c)) add negate(c)) ->
% c
% Current number of equations to process: 963
% Current number of ordered equations: 0
% Current number of rules: 43
% New rule produced :
% [44]
% negate(negate(c add X) add negate(negate(c add negate(d)) add negate(c) add X))
% -> X
% Current number of equations to process: 1018
% Current number of ordered equations: 0
% Current number of rules: 44
% New rule produced :
% [45]
% negate(negate(d add negate(c add negate(d)) add negate(c)) add negate(c)) ->
% d
% Current number of equations to process: 1024
% Current number of ordered equations: 0
% Current number of rules: 45
% New rule produced :
% [46]
% negate(negate(c add c add negate(c add negate(d))) add negate(c add negate(d)))
% -> c
% Current number of equations to process: 1082
% Current number of ordered equations: 0
% Current number of rules: 46
% New rule produced :
% [47]
% negate(negate(d add d add negate(c) add X) add negate(c add X)) ->
% d add d add X
% Current number of equations to process: 1102
% Current number of ordered equations: 0
% Current number of rules: 47
% New rule produced :
% [48]
% negate(negate(d add d add d add negate(c)) add negate(c)) -> d add d add d
% Current number of equations to process: 1110
% Current number of ordered equations: 0
% Current number of rules: 48
% New rule produced :
% [49]
% negate(negate(c add negate(d add d add d add X)) add negate(c add X)) -> c
% Current number of equations to process: 1169
% Current number of ordered equations: 0
% Current number of rules: 49
% New rule produced :
% [50] negate(negate(c add negate(d add d add d add d)) add negate(c)) -> c
% Current number of equations to process: 1177
% Current number of ordered equations: 0
% Current number of rules: 50
% New rule produced :
% [51]
% negate(d add d add negate(negate(c) add negate(negate(d add d add negate(c)))))
% -> negate(c)
% Current number of equations to process: 1238
% Current number of ordered equations: 0
% Current number of rules: 51
% New rule produced :
% [52]
% negate(c add negate(negate(c) add negate(negate(c add negate(d add d add d)))))
% -> negate(c)
% Current number of equations to process: 1265
% Current number of ordered equations: 0
% Current number of rules: 52
% New rule produced :
% [53]
% negate(c add negate(c add negate(d add negate(c)) add negate(c) add negate(c)))
% -> negate(c)
% Current number of equations to process: 1289
% Current number of ordered equations: 0
% Current number of rules: 53
% New rule produced :
% [54]
% negate(d add negate(d add negate(c add negate(d)) add negate(c) add negate(c)))
% -> negate(c)
% Current number of equations to process: 1313
% Current number of ordered equations: 0
% Current number of rules: 54
% New rule produced :
% [55]
% negate(c add negate(c add negate(d add d add d add d) add negate(c))) ->
% negate(c)
% Current number of equations to process: 1332
% Current number of ordered equations: 0
% Current number of rules: 55
% New rule produced :
% [56]
% negate(negate(d add negate(c add X) add Y) add negate(c add X add Y)) ->
% d add Y
% Current number of equations to process: 1355
% Current number of ordered equations: 1
% Current number of rules: 56
% New rule produced :
% [57]
% negate(negate(c add negate(d add X) add Y) add negate(c add X add Y)) ->
% c add Y
% Current number of equations to process: 1355
% Current number of ordered equations: 0
% Current number of rules: 57
% New rule produced :
% [58]
% negate(negate(d add d add negate(c add X)) add negate(c add X)) -> d add d
% Current number of equations to process: 1365
% Current number of ordered equations: 0
% Current number of rules: 58
% New rule produced :
% [59]
% negate(negate(c add negate(d add d) add X) add negate(c add X)) -> c add X
% Current number of equations to process: 1432
% Current number of ordered equations: 0
% Current number of rules: 59
% New rule produced :
% [60]
% negate(d add negate(c add negate(d add negate(c add X)) add X)) ->
% negate(d add negate(c add X))
% Current number of equations to process: 1558
% Current number of ordered equations: 0
% Current number of rules: 60
% New rule produced :
% [61]
% negate(c add negate(c add negate(c add negate(d add X)) add X)) ->
% negate(c add negate(d add X))
% Current number of equations to process: 1600
% Current number of ordered equations: 0
% Current number of rules: 61
% New rule produced :
% [62]
% negate(negate(c add negate(d add negate(c) add negate(c))) add negate(
% c add
% negate(c))) ->
% c
% Current number of equations to process: 1652
% Current number of ordered equations: 0
% Current number of rules: 62
% New rule produced :
% [63]
% negate(negate(c add negate(d add negate(c add negate(d) add negate(c)))) add
% negate(c)) -> c
% Current number of equations to process: 1671
% Current number of ordered equations: 0
% Current number of rules: 63
% New rule produced :
% [64]
% negate(c add negate(negate(c add negate(d add d)) add negate(negate(c)))) ->
% negate(c add negate(d add d))
% Current number of equations to process: 1691
% Current number of ordered equations: 0
% Current number of rules: 64
% New rule produced :
% [65]
% negate(negate(d add negate(negate(negate(c) add negate(negate(d add negate(c)))))) add
% negate(c)) -> d
% Current number of equations to process: 1718
% Current number of ordered equations: 0
% Current number of rules: 65
% New rule produced :
% [66]
% negate(negate(c add negate(negate(negate(c) add negate(negate(c add negate(d)))))) add
% negate(c)) -> c
% Current number of equations to process: 1738
% Current number of ordered equations: 0
% Current number of rules: 66
% New rule produced :
% [67]
% negate(negate(c add negate(negate(c add negate(d add d) add negate(c)))) add
% negate(c)) -> c
% Current number of equations to process: 1758
% Current number of ordered equations: 0
% Current number of rules: 67
% New rule produced :
% [68]
% negate(d add d add negate(c add negate(d add d add negate(c)))) ->
% negate(d add d add negate(c))
% Current number of equations to process: 1778
% Current number of ordered equations: 0
% Current number of rules: 68
% New rule produced :
% [69]
% negate(negate(negate(X add Y) add negate(Y) add X add X) add negate(X add Y))
% -> X
% Current number of equations to process: 1806
% Current number of ordered equations: 0
% Current number of rules: 69
% New rule produced :
% [70]
% negate(negate(c add negate(c) add negate(negate(c add negate(d add d)))) add
% negate(c)) -> c
% Current number of equations to process: 2050
% Current number of ordered equations: 0
% Current number of rules: 70
% New rule produced :
% [71]
% negate(negate(c add c add negate(d add d add d) add negate(c)) add negate(c))
% -> c
% Current number of equations to process: 2069
% Current number of ordered equations: 0
% Current number of rules: 71
% New rule produced :
% [72]
% negate(d add negate(negate(c add X) add negate(negate(d add negate(c add X)))))
% -> negate(c add X)
% Current number of equations to process: 2087
% Current number of ordered equations: 0
% Current number of rules: 72
% New rule produced :
% [73]
% negate(c add negate(negate(c add X) add negate(negate(c add negate(d add X)))))
% -> negate(c add X)
% Current number of equations to process: 2113
% Current number of ordered equations: 0
% Current number of rules: 73
% New rule produced :
% [74]
% negate(d add negate(d add negate(c add X) add negate(c) add X) add X) ->
% negate(c add X)
% Current number of equations to process: 2190
% Current number of ordered equations: 0
% Current number of rules: 74
% New rule produced :
% [75]
% negate(c add negate(c add negate(c add X) add negate(d) add X) add X) ->
% negate(c add X)
% Current number of equations to process: 2296
% Current number of ordered equations: 0
% Current number of rules: 75
% New rule produced :
% [76]
% negate(d add negate(negate(c) add negate(negate(d add d add negate(c) add
% negate(c))))) -> negate(c)
% Current number of equations to process: 2419
% Current number of ordered equations: 0
% Current number of rules: 76
% New rule produced :
% [77]
% negate(c add negate(negate(c) add negate(negate(c add c add negate(d) add
% negate(c))))) -> negate(c)
% Current number of equations to process: 2444
% Current number of ordered equations: 0
% Current number of rules: 77
% New rule produced :
% [78]
% negate(d add negate(d add negate(c) add negate(negate(d add negate(c) add
% negate(c))))) ->
% negate(c)
% Current number of equations to process: 2475
% Current number of ordered equations: 0
% Current number of rules: 78
% New rule produced :
% [79]
% negate(c add negate(c add negate(c) add negate(negate(c add negate(d) add
% negate(c))))) ->
% negate(c)
% Current number of equations to process: 2500
% Current number of ordered equations: 0
% Current number of rules: 79
% New rule produced :
% [80]
% negate(d add negate(d add negate(c) add negate(c) add negate(negate(d add
% negate(c)))))
% -> negate(c)
% Current number of equations to process: 2533
% Current number of ordered equations: 0
% Current number of rules: 80
% New rule produced :
% [81]
% negate(c add negate(c add negate(c) add negate(c) add negate(negate(c add
% negate(d)))))
% -> negate(c)
% Current number of equations to process: 2558
% Current number of ordered equations: 0
% Current number of rules: 81
% New rule produced :
% [82]
% negate(c add negate(c add c add negate(d add d) add negate(c) add negate(c)))
% -> negate(c)
% Current number of equations to process: 2591
% Current number of ordered equations: 0
% Current number of rules: 82
% New rule produced :
% [83]
% negate(c add negate(c add negate(d add d add X) add negate(c add X))) ->
% negate(c add X)
% Current number of equations to process: 2624
% Current number of ordered equations: 0
% Current number of rules: 83
% New rule produced :
% [84]
% negate(negate(negate(negate(X) add Y) add negate(X add Y) add Z) add
% negate(Y add Z)) -> Z
% Current number of equations to process: 2687
% Current number of ordered equations: 0
% Current number of rules: 84
% New rule produced :
% [85]
% negate(negate(c add negate(d add negate(X)) add negate(d add X)) add
% negate(c)) -> c
% Current number of equations to process: 2896
% Current number of ordered equations: 1
% Current number of rules: 85
% New rule produced :
% [86]
% negate(negate(d add negate(c add negate(X)) add negate(c add X)) add
% negate(c)) -> d
% Current number of equations to process: 2896
% Current number of ordered equations: 0
% Current number of rules: 86
% New rule produced :
% [87]
% negate(negate(c add X) add negate(negate(c add negate(d add d)) add negate(c) add X))
% -> X
% Current number of equations to process: 3655
% Current number of ordered equations: 0
% Current number of rules: 87
% New rule produced :
% [88]
% negate(negate(d add negate(c add negate(d add d)) add negate(c)) add
% negate(c)) -> d
% Current number of equations to process: 3679
% Current number of ordered equations: 0
% Current number of rules: 88
% New rule produced :
% [89]
% negate(negate(d add negate(c)) add negate(d add negate(negate(c add negate(
% d add
% negate(c))))))
% -> d
% Current number of equations to process: 3759
% Current number of ordered equations: 0
% Current number of rules: 89
% New rule produced :
% [90]
% negate(negate(c add negate(d)) add negate(c add negate(negate(c add negate(
% c add
% negate(d))))))
% -> c
% Current number of equations to process: 3791
% Current number of ordered equations: 0
% Current number of rules: 90
% New rule produced :
% [91]
% negate(negate(d add negate(d add negate(c)) add negate(negate(c))) add
% negate(d add negate(c))) -> d
% Current number of equations to process: 3823
% Current number of ordered equations: 0
% Current number of rules: 91
% New rule produced :
% [92]
% negate(negate(c add negate(c add negate(d)) add negate(negate(c))) add
% negate(c add negate(d))) -> c
% Current number of equations to process: 3855
% Current number of ordered equations: 0
% Current number of rules: 92
% New rule produced :
% [93]
% negate(negate(negate(negate(X) add Y) add X add Y add Y) add negate(negate(X) add Y))
% -> Y
% Current number of equations to process: 3887
% Current number of ordered equations: 0
% Current number of rules: 93
% New rule produced :
% [94]
% negate(d add negate(c add negate(d add negate(c)) add negate(d add negate(c))))
% -> negate(d add negate(c))
% Current number of equations to process: 4165
% Current number of ordered equations: 0
% Current number of rules: 94
% New rule produced :
% [95]
% negate(negate(d add d add d add d add negate(c) add negate(c)) add negate(c))
% -> d add d
% Current number of equations to process: 4201
% Current number of ordered equations: 0
% Current number of rules: 95
% New rule produced :
% [96]
% negate(negate(d add d add d add negate(c) add negate(c) add negate(c)) add
% negate(c)) -> d
% Current number of equations to process: 4236
% Current number of ordered equations: 0
% Current number of rules: 96
% New rule produced :
% [97]
% negate(negate(c add c add c add negate(d) add negate(c) add negate(c)) add
% negate(c)) -> c
% Current number of equations to process: 4270
% Current number of ordered equations: 0
% Current number of rules: 97
% New rule produced :
% [98]
% negate(c add negate(c add negate(c add negate(d add d add d)))) ->
% negate(c add negate(d add d add d))
% Current number of equations to process: 4302
% Current number of ordered equations: 0
% Current number of rules: 98
% New rule produced :
% [99]
% negate(negate(c add negate(d add d add d add d add X)) add negate(c add X))
% -> c
% Current number of equations to process: 4343
% Current number of ordered equations: 0
% Current number of rules: 99
% New rule produced :
% [100]
% negate(negate(c add negate(d add d add d add d add d)) add negate(c)) -> c
% Current number of equations to process: 4369
% Current number of ordered equations: 0
% Current number of rules: 100
% New rule produced :
% [101]
% negate(negate(c add negate(d add negate(c add X)) add negate(c add X)) add
% negate(c)) -> c
% Current number of equations to process: 4456
% Current number of ordered equations: 0
% Current number of rules: 101
% New rule produced :
% [102]
% negate(negate(d add negate(c add negate(d add X)) add negate(c add X)) add
% negate(c)) -> d
% Current number of equations to process: 4494
% Current number of ordered equations: 0
% Current number of rules: 102
% New rule produced :
% [103]
% negate(negate(negate(d add negate(c) add negate(c)) add negate(d)) add
% negate(c)) -> negate(d add negate(c) add negate(c))
% Current number of equations to process: 4585
% Current number of ordered equations: 0
% Current number of rules: 103
% New rule produced :
% [104]
% negate(negate(negate(c add negate(d) add negate(c)) add negate(c)) add
% negate(c)) -> negate(c add negate(d) add negate(c))
% Current number of equations to process: 4620
% Current number of ordered equations: 0
% Current number of rules: 104
% New rule produced :
% [105]
% negate(c add negate(negate(c) add negate(negate(c add negate(d add negate(c)) add
% negate(c))))) -> negate(c)
% Current number of equations to process: 4653
% Current number of ordered equations: 0
% Current number of rules: 105
% New rule produced :
% [106]
% negate(d add negate(negate(c) add negate(negate(d add negate(c add negate(d)) add
% negate(c))))) -> negate(c)
% Current number of equations to process: 4701
% Current number of ordered equations: 0
% Current number of rules: 106
% New rule produced :
% [107]
% negate(d add d add d add negate(d add d add d add negate(c) add negate(c)))
% -> negate(c)
% Current number of equations to process: 4738
% Current number of ordered equations: 0
% Current number of rules: 107
% New rule produced :
% [108]
% negate(c add negate(negate(c) add negate(negate(c add negate(d add d add d add d)))))
% -> negate(c)
% Current number of equations to process: 4802
% Current number of ordered equations: 0
% Current number of rules: 108
% New rule produced :
% [109]
% negate(c add negate(c add negate(d add negate(X)) add negate(d add X) add
% negate(c))) -> negate(c)
% Current number of equations to process: 4850
% Current number of ordered equations: 0
% Current number of rules: 109
% New rule produced :
% [110]
% negate(d add negate(d add negate(c add negate(X)) add negate(c add X) add
% negate(c))) -> negate(c)
% Current number of equations to process: 2934
% Current number of ordered equations: 0
% Current number of rules: 110
% New rule produced :
% [111]
% negate(d add negate(d add negate(c add negate(d add d)) add negate(c) add
% negate(c))) -> negate(c)
% Current number of equations to process: 3147
% Current number of ordered equations: 0
% Current number of rules: 111
% New rule produced :
% [112]
% negate(c add negate(c add negate(d add d add d add d add d) add negate(c)))
% -> negate(c)
% Current number of equations to process: 3188
% Current number of ordered equations: 0
% Current number of rules: 112
% New rule produced :
% [113]
% negate(negate(d add negate(d add negate(c) add negate(c)) add X) add
% negate(negate(c) add X)) -> X
% Current number of equations to process: 3239
% Current number of ordered equations: 0
% Current number of rules: 113
% New rule produced :
% [114]
% negate(negate(c add negate(c add negate(d) add negate(c)) add X) add
% negate(negate(c) add X)) -> X
% Current number of equations to process: 3329
% Current number of ordered equations: 0
% Current number of rules: 114
% New rule produced :
% [115]
% negate(d add negate(negate(d add negate(c add X)) add negate(negate(c add X))))
% -> negate(d add negate(c add X))
% Current number of equations to process: 3417
% Current number of ordered equations: 0
% Current number of rules: 115
% New rule produced :
% [116]
% negate(c add negate(negate(c add negate(d add X)) add negate(negate(c add X))))
% -> negate(c add negate(d add X))
% Current number of equations to process: 3462
% Current number of ordered equations: 0
% Current number of rules: 116
% New rule produced :
% [117]
% negate(negate(c add negate(negate(c) add negate(negate(d add negate(c))))) add
% negate(c add negate(c))) -> c
% Current number of equations to process: 3583
% Current number of ordered equations: 0
% Current number of rules: 117
% New rule produced :
% [118]
% negate(negate(c add negate(d add negate(negate(c) add negate(negate(c add
% negate(d)))))) add
% negate(c)) -> c
% Current number of equations to process: 3620
% Current number of ordered equations: 0
% Current number of rules: 118
% New rule produced :
% [119]
% negate(negate(c add negate(d add negate(c add negate(d add d) add negate(c)))) add
% negate(c)) -> c
% Current number of equations to process: 3659
% Current number of ordered equations: 0
% Current number of rules: 119
% New rule produced :
% [120]
% negate(d add negate(c add negate(d add negate(c) add X) add X) add X) ->
% negate(d add negate(c) add X)
% Current number of equations to process: 3698
% Current number of ordered equations: 0
% Current number of rules: 120
% New rule produced :
% [121]
% negate(c add negate(c add negate(c add negate(d) add X) add X) add X) ->
% negate(c add negate(d) add X)
% Current number of equations to process: 3837
% Current number of ordered equations: 0
% Current number of rules: 121
% New rule produced :
% [122]
% negate(d add d add negate(negate(d add d add negate(c)) add negate(negate(c))))
% -> negate(d add d add negate(c))
% Current number of equations to process: 3996
% Current number of ordered equations: 0
% Current number of rules: 122
% New rule produced :
% [123]
% negate(negate(negate(X add Y) add negate(negate(negate(Y) add X)) add X) add
% negate(X add Y)) -> X
% Current number of equations to process: 4049
% Current number of ordered equations: 1
% Current number of rules: 123
% New rule produced :
% [124]
% negate(negate(negate(negate(negate(X add Y) add negate(Y) add X)) add X) add
% negate(X add Y)) -> X
% Current number of equations to process: 4049
% Current number of ordered equations: 0
% Current number of rules: 124
% New rule produced :
% [125]
% negate(negate(d add d add negate(c add X) add negate(c add X)) add negate(
% c add X))
% -> d
% Current number of equations to process: 2512
% Current number of ordered equations: 0
% Current number of rules: 125
% New rule produced :
% [126]
% negate(negate(c add c add negate(d add X) add negate(c add X)) add negate(
% c add X))
% -> c
% Current number of equations to process: 2557
% Current number of ordered equations: 0
% Current number of rules: 126
% New rule produced :
% [127]
% negate(negate(d add d add negate(c)) add negate(c add negate(d add d add
% negate(c)))) ->
% d add d
% Current number of equations to process: 2672
% Current number of ordered equations: 0
% Current number of rules: 127
% New rule produced :
% [128]
% negate(negate(c add negate(d add d add negate(c add negate(d) add negate(c)))) add
% negate(c)) -> c
% Current number of equations to process: 2717
% Current number of ordered equations: 0
% Current number of rules: 128
% New rule produced :
% [129]
% negate(negate(c add negate(c) add negate(negate(c add negate(d add d add d)))) add
% negate(c)) -> c
% Current number of equations to process: 2764
% Current number of ordered equations: 0
% Current number of rules: 129
% New rule produced :
% [130]
% negate(negate(c add negate(negate(negate(c) add negate(negate(c add negate(
% d add d)))))) add
% negate(c)) -> c
% Current number of equations to process: 2811
% Current number of ordered equations: 0
% Current number of rules: 130
% New rule produced :
% [131]
% negate(negate(d add negate(d add negate(d add d add negate(c) add negate(c)))) add
% negate(c)) -> d
% Current number of equations to process: 2858
% Current number of ordered equations: 0
% Current number of rules: 131
% New rule produced :
% [132]
% negate(negate(c add negate(d add d add negate(c) add negate(c))) add
% negate(c add negate(c))) -> c
% Current number of equations to process: 2905
% Current number of ordered equations: 0
% Current number of rules: 132
% New rule produced :
% [133]
% negate(negate(c add negate(negate(c add negate(d add d add d) add negate(c)))) add
% negate(c)) -> c
% Current number of equations to process: 2950
% Current number of ordered equations: 0
% Current number of rules: 133
% New rule produced :
% [134]
% negate(negate(c add negate(d add negate(c)) add negate(c) add X) add
% negate(c add X)) -> c add X
% Current number of equations to process: 2989
% Current number of ordered equations: 0
% Current number of rules: 134
% New rule produced :
% [135]
% negate(negate(c add c add negate(d add negate(c)) add negate(c) add negate(c)) add
% negate(c)) -> c
% Current number of equations to process: 3083
% Current number of ordered equations: 0
% Current number of rules: 135
% New rule produced :
% [136]
% negate(negate(d add negate(c add negate(d)) add negate(c) add X) add
% negate(c add X)) -> d add X
% Current number of equations to process: 3130
% Current number of ordered equations: 0
% Current number of rules: 136
% New rule produced :
% [137]
% negate(negate(d add d add negate(c add negate(d)) add negate(c)) add
% negate(c)) -> d add d
% Current number of equations to process: 3158
% Current number of ordered equations: 0
% Current number of rules: 137
% New rule produced :
% [138]
% negate(negate(d add d add negate(c add negate(d)) add negate(c) add negate(c)) add
% negate(c)) -> d
% Current number of equations to process: 3273
% Current number of ordered equations: 0
% Current number of rules: 138
% New rule produced :
% [139]
% negate(negate(d add d add d add negate(c) add X) add negate(c add X)) ->
% d add d add d add X
% Current number of equations to process: 3320
% Current number of ordered equations: 0
% Current number of rules: 139
% New rule produced :
% [140]
% negate(negate(d add d add d add d add negate(c)) add negate(c)) ->
% d add d add d add d
% Current number of equations to process: 3348
% Current number of ordered equations: 0
% Current number of rules: 140
% New rule produced :
% [141]
% negate(negate(c add c add negate(d add d add d add d) add negate(c)) add
% negate(c)) -> c
% Current number of equations to process: 3459
% Current number of ordered equations: 0
% Current number of rules: 141
% New rule produced :
% [142]
% negate(negate(c add negate(d add d add X) add Y) add negate(c add X add Y))
% -> c add Y
% Current number of equations to process: 3502
% Current number of ordered equations: 0
% Current number of rules: 142
% New rule produced :
% [143]
% negate(negate(c add negate(d add d add d) add X) add negate(c add X)) ->
% c add X
% Current number of equations to process: 3532
% Current number of ordered equations: 0
% Current number of rules: 143
% New rule produced :
% [144]
% negate(negate(c add negate(d add d add negate(c) add negate(c)) add negate(c)) add
% negate(c)) -> c
% Current number of equations to process: 3689
% Current number of ordered equations: 0
% Current number of rules: 144
% New rule produced :
% [145]
% negate(negate(d add negate(c add c add negate(d) add negate(c)) add negate(c)) add
% negate(c)) -> d
% Current number of equations to process: 3736
% Current number of ordered equations: 0
% Current number of rules: 145
% New rule produced :
% [146]
% negate(d add negate(negate(c add X) add negate(negate(d add negate(c) add X))) add X)
% -> negate(c add X)
% Current number of equations to process: 3783
% Current number of ordered equations: 0
% Current number of rules: 146
% New rule produced :
% [147]
% negate(c add negate(negate(c add X) add negate(negate(c add negate(d) add X))) add X)
% -> negate(c add X)
% Current number of equations to process: 3992
% Current number of ordered equations: 0
% Current number of rules: 147
% New rule produced :
% [148]
% negate(d add negate(c add negate(d add d add negate(c) add negate(c)))) ->
% negate(d add d add negate(c) add negate(c))
% Current number of equations to process: 4232
% Current number of ordered equations: 0
% Current number of rules: 148
% New rule produced :
% [149]
% negate(c add negate(c add negate(c add c add negate(d) add negate(c)))) ->
% negate(c add c add negate(d) add negate(c))
% Current number of equations to process: 4283
% Current number of ordered equations: 0
% Current number of rules: 149
% New rule produced :
% [150]
% negate(d add negate(d add negate(c) add negate(negate(negate(c) add negate(
% negate(
% d add
% negate(c)))))))
% -> negate(c)
% Current number of equations to process: 4350
% Current number of ordered equations: 0
% Current number of rules: 150
% New rule produced :
% [151]
% negate(c add negate(c add negate(c) add negate(negate(negate(c) add negate(
% negate(
% c add
% negate(d)))))))
% -> negate(c)
% Current number of equations to process: 4400
% Current number of ordered equations: 0
% Current number of rules: 151
% New rule produced :
% [152]
% negate(c add negate(c add negate(c) add negate(negate(c add negate(d add d) add
% negate(c))))) ->
% negate(c)
% Current number of equations to process: 4466
% Current number of ordered equations: 0
% Current number of rules: 152
% New rule produced :
% [153]
% negate(negate(negate(d add negate(c)) add negate(d add X) add negate(c) add X) add X)
% -> negate(d add X)
% Current number of equations to process: 4532
% Current number of ordered equations: 0
% Current number of rules: 153
% New rule produced :
% [154]
% negate(negate(negate(c add negate(d)) add negate(c add X) add negate(c) add X) add X)
% -> negate(c add X)
% Current number of equations to process: 4698
% Current number of ordered equations: 0
% Current number of rules: 154
% New rule produced :
% [155]
% negate(c add negate(negate(c add X) add negate(negate(c add negate(d add d add X)))))
% -> negate(c add X)
% Current number of equations to process: 4908
% Current number of ordered equations: 0
% Current number of rules: 155
% New rule produced :
% [156]
% negate(d add negate(d add negate(c add negate(d add negate(c))) add negate(c)))
% -> negate(c add negate(d add negate(c)))
% Current number of equations to process: 1591
% Current number of ordered equations: 0
% Current number of rules: 156
% New rule produced :
% [157]
% negate(c add negate(c add negate(c) add negate(c) add negate(negate(c add
% negate(
% d add d)))))
% -> negate(c)
% Current number of equations to process: 1642
% Current number of ordered equations: 0
% Current number of rules: 157
% New rule produced :
% [158]
% negate(c add negate(c add c add negate(d add d add d) add negate(c) add
% negate(c))) -> negate(c)
% Current number of equations to process: 1710
% Current number of ordered equations: 0
% Current number of rules: 158
% New rule produced :
% [159]
% negate(d add negate(negate(c) add negate(negate(d add negate(negate(d add
% negate(c) add
% negate(c)))))))
% -> negate(c)
% Current number of equations to process: 1778
% Current number of ordered equations: 0
% Current number of rules: 159
% New rule produced :
% [160]
% negate(c add negate(negate(c) add negate(negate(c add negate(negate(c add
% negate(d) add
% negate(c)))))))
% -> negate(c)
% Current number of equations to process: 1829
% Current number of ordered equations: 0
% Current number of rules: 160
% New rule produced :
% [161]
% negate(d add negate(negate(c) add negate(negate(d add negate(c) add negate(
% negate(
% d add
% negate(c)))))))
% -> negate(c)
% Current number of equations to process: 1897
% Current number of ordered equations: 0
% Current number of rules: 161
% New rule produced :
% [162]
% negate(c add negate(negate(c) add negate(negate(c add negate(c) add negate(
% negate(
% c add
% negate(d)))))))
% -> negate(c)
% Current number of equations to process: 1948
% Current number of ordered equations: 0
% Current number of rules: 162
% New rule produced :
% [163]
% negate(c add negate(negate(c) add negate(negate(c add c add negate(d add d) add
% negate(c))))) -> negate(c)
% Current number of equations to process: 2016
% Current number of ordered equations: 0
% Current number of rules: 163
% New rule produced :
% [164]
% negate(c add negate(c add negate(d add negate(c add negate(d) add negate(c))) add
% negate(c))) -> negate(c)
% Current number of equations to process: 2080
% Current number of ordered equations: 0
% Current number of rules: 164
% New rule produced :
% [165]
% negate(c add negate(c add negate(d add d add d add X) add negate(c add X)))
% -> negate(c add X)
% Current number of equations to process: 2143
% Current number of ordered equations: 0
% Current number of rules: 165
% New rule produced :
% [166]
% negate(d add d add negate(d add d add negate(c add X) add negate(c add X)))
% -> negate(c add X)
% Current number of equations to process: 2274
% Current number of ordered equations: 0
% Current number of rules: 166
% New rule produced :
% [167]
% negate(c add negate(c add negate(d add d) add negate(c add X) add X) add X)
% -> negate(c add X)
% Current number of equations to process: 2343
% Current number of ordered equations: 0
% Current number of rules: 167
% New rule produced :
% [168]
% negate(negate(d add X) add negate(negate(d add negate(c add Y)) add negate(
% c add Y) add X))
% -> X
% Current number of equations to process: 2576
% Current number of ordered equations: 0
% Current number of rules: 168
% New rule produced :
% [169]
% negate(negate(c add X) add negate(negate(c add negate(d add Y)) add negate(
% c add Y) add X))
% -> X
% Current number of equations to process: 2693
% Current number of ordered equations: 0
% Current number of rules: 169
% New rule produced :
% [170]
% negate(negate(c add negate(d add negate(c))) add negate(c add negate(
% c add negate(
% d add
% negate(c)))))
% -> c
% Current number of equations to process: 2913
% Current number of ordered equations: 0
% Current number of rules: 170
% New rule produced :
% [171]
% negate(negate(c add negate(d add negate(c add negate(c add negate(d))))) add
% negate(c add negate(d))) -> c
% Current number of equations to process: 2958
% Current number of ordered equations: 0
% Current number of rules: 171
% New rule produced :
% [172]
% negate(negate(d add d add X) add negate(negate(d add d add negate(c)) add
% negate(c) add X)) -> X
% Current number of equations to process: 3003
% Current number of ordered equations: 0
% Current number of rules: 172
% New rule produced :
% [173]
% negate(negate(c add negate(d add d add negate(c)) add negate(c)) add
% negate(c)) -> c
% Current number of equations to process: 3009
% Current number of ordered equations: 0
% Current number of rules: 173
% New rule produced :
% [174]
% negate(c add negate(c add negate(d add d add negate(c)) add negate(c) add
% negate(c))) -> negate(c)
% Current number of equations to process: 3135
% Cputime limit exceeded (core dumped)
%
% EOF
%------------------------------------------------------------------------------