TSTP Solution File: ROB022-1 by CiME---2.01
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CiME---2.01
% Problem : ROB022-1 : TPTP v6.0.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_cime %s
% Computer : n159.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:01 EDT 2014
% Result : Unsatisfiable 5.64s
% Output : Refutation 5.64s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : ROB022-1 : TPTP v6.0.0. Released v1.0.0.
% % Command : tptp2X_and_run_cime %s
% % Computer : n159.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:41:23 CDT 2014
% % CPUTime : 5.64
% Processing problem /tmp/CiME_27749_n159.star.cs.uiowa.edu
% #verbose 1;
% let F = signature " add : AC; b,a,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 negate(c) = c;
% ";
%
% let s1 = status F "
% b lr_lex;
% a lr_lex;
% c lr_lex;
% negate lr_lex;
% add mul;
% ";
%
% let p1 = precedence F "
% negate > add > c > a > b";
%
% let s2 = status F "
% b mul;
% a mul;
% c mul;
% negate mul;
% add mul;
% ";
%
% let p2 = precedence F "
% negate > add > c = 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,
% c add negate(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] c add negate(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(c add c) add negate(c)) -> c
% Current number of equations to process: 14
% Current number of ordered equations: 0
% Current number of rules: 3
% New rule produced : [4] negate(c add negate(c add c)) -> negate(c)
% Current number of equations to process: 18
% Current number of ordered equations: 0
% Current number of rules: 4
% New rule produced :
% [5] negate(negate(c add negate(negate(c))) add negate(c)) -> c
% Current number of equations to process: 20
% Current number of ordered equations: 0
% Current number of rules: 5
% New rule produced : [6] negate(negate(c add c add c) add negate(c)) -> c
% Current number of equations to process: 19
% Current number of ordered equations: 0
% Current number of rules: 6
% New rule produced :
% [7] negate(c add negate(c add negate(negate(c)))) -> negate(c)
% Current number of equations to process: 23
% Current number of ordered equations: 0
% Current number of rules: 7
% New rule produced :
% [8] negate(negate(negate(c) add negate(c)) add negate(c)) -> negate(c)
% Current number of equations to process: 22
% Current number of ordered equations: 0
% Current number of rules: 8
% New rule produced : [9] negate(c add negate(c add c add c)) -> negate(c)
% Current number of equations to process: 26
% Current number of ordered equations: 0
% Current number of rules: 9
% New rule produced : [10] negate(c add c) -> negate(c)
% Rule [3] negate(negate(c add c) add negate(c)) -> c collapsed.
% Rule [4] negate(c add negate(c add c)) -> negate(c) collapsed.
% Current number of equations to process: 37
% Current number of ordered equations: 0
% Current number of rules: 8
% New rule produced : [11] negate(negate(c) add negate(c)) -> c
% Rule [8] negate(negate(negate(c) add negate(c)) add negate(c)) -> negate(c)
% collapsed.
% Current number of equations to process: 36
% Current number of ordered equations: 0
% Current number of rules: 8
% New rule produced :
% [12] negate(c add negate(negate(c) add negate(negate(c)))) -> negate(c)
% Current number of equations to process: 38
% Current number of ordered equations: 0
% Current number of rules: 9
% New rule produced :
% [13] negate(negate(c add c add negate(negate(c))) add negate(c)) -> c
% Current number of equations to process: 39
% Current number of ordered equations: 0
% Current number of rules: 10
% New rule produced :
% [14] negate(c add negate(c add c add negate(negate(c)))) -> negate(c)
% Current number of equations to process: 43
% Current number of ordered equations: 0
% Current number of rules: 11
% New rule produced :
% [15] negate(negate(c add c add c add c) add negate(c)) -> c
% Current number of equations to process: 45
% Current number of ordered equations: 0
% Current number of rules: 12
% New rule produced :
% [16] negate(c add negate(c add c add c add c)) -> negate(c)
% Current number of equations to process: 49
% Current number of ordered equations: 0
% Current number of rules: 13
% New rule produced :
% [17] negate(negate(c add c add X) add negate(c add X)) -> c add X
% Current number of equations to process: 50
% Current number of ordered equations: 0
% Current number of rules: 14
% New rule produced : [18] c add c -> c
% Rule [6] negate(negate(c add c add c) add negate(c)) -> c collapsed.
% Rule [9] negate(c add negate(c add c add c)) -> negate(c) collapsed.
% Rule [10] negate(c add c) -> negate(c) collapsed.
% Rule [13] negate(negate(c add c add negate(negate(c))) add negate(c)) -> c
% collapsed.
% Rule [14] negate(c add negate(c add c add negate(negate(c)))) -> negate(c)
% collapsed.
% Rule [15] negate(negate(c add c add c add c) add negate(c)) -> c collapsed.
% Rule [16] negate(c add negate(c add c add c add c)) -> negate(c) collapsed.
% Rule [17] negate(negate(c add c add X) add negate(c add X)) -> c add X
% collapsed.
% Current number of equations to process: 58
% Current number of ordered equations: 0
% Current number of rules: 7
% New rule produced :
% [19] negate(negate(c add X) add negate(c add X)) -> c add X
% Current number of equations to process: 59
% Current number of ordered equations: 0
% Current number of rules: 8
% New rule produced : [20] c add negate(c add negate(negate(c))) -> c
% Rule [7] negate(c add negate(c add negate(negate(c)))) -> negate(c)
% collapsed.
% Current number of equations to process: 62
% Current number of ordered equations: 0
% Current number of rules: 8
% New rule produced : [21] c add negate(negate(c) add negate(negate(c))) -> c
% Rule [12] negate(c add negate(negate(c) add negate(negate(c)))) -> negate(c)
% collapsed.
% Current number of equations to process: 62
% Current number of ordered equations: 0
% Current number of rules: 8
% New rule produced :
% [22] negate(negate(c add negate(c add X)) add negate(c add X)) -> c
% Current number of equations to process: 76
% Current number of ordered equations: 0
% Current number of rules: 9
% New rule produced :
% [23]
% negate(negate(negate(c) add negate(c) add negate(c)) add negate(c)) ->
% negate(c)
% Current number of equations to process: 79
% Current number of ordered equations: 0
% Current number of rules: 10
% New rule produced :
% [24] negate(negate(c add negate(negate(c) add X)) add negate(c add X)) -> c
% Current number of equations to process: 83
% Current number of ordered equations: 0
% Current number of rules: 11
% New rule produced :
% [25]
% negate(negate(c add negate(negate(c add negate(negate(c))))) add negate(c))
% -> c
% Current number of equations to process: 92
% Current number of ordered equations: 0
% Current number of rules: 12
% New rule produced :
% [26]
% negate(c add negate(c add negate(negate(c add negate(negate(c)))))) ->
% negate(c)
% Current number of equations to process: 96
% Current number of ordered equations: 0
% Current number of rules: 13
% New rule produced :
% [27] c add negate(c add negate(negate(c add negate(negate(c))))) -> c
% Rule
% [26]
% negate(c add negate(c add negate(negate(c add negate(negate(c)))))) ->
% negate(c) collapsed.
% Current number of equations to process: 98
% Current number of ordered equations: 0
% Current number of rules: 13
% New rule produced :
% [28] negate(negate(c add X) add negate(negate(c) add negate(c) add X)) -> X
% Current number of equations to process: 104
% Current number of ordered equations: 0
% Current number of rules: 14
% New rule produced :
% [29]
% negate(negate(negate(X add Y) add negate(Y) add X) add X) -> negate(X add Y)
% Current number of equations to process: 112
% Current number of ordered equations: 0
% Current number of rules: 15
% New rule produced : [30] c add negate(negate(c)) -> c
% Rule [5] negate(negate(c add negate(negate(c))) add negate(c)) -> c
% collapsed.
% Rule [20] c add negate(c add negate(negate(c))) -> c collapsed.
% Rule
% [25]
% negate(negate(c add negate(negate(c add negate(negate(c))))) add negate(c))
% -> c collapsed.
% Rule [27] c add negate(c add negate(negate(c add negate(negate(c))))) -> c
% collapsed.
% Current number of equations to process: 129
% Current number of ordered equations: 0
% Current number of rules: 12
% New rule produced :
% [31] c add negate(c add negate(c add X) add negate(X)) -> c add X
% Current number of equations to process: 147
% Current number of ordered equations: 0
% Current number of rules: 13
% New rule produced :
% [32] negate(c add negate(c add negate(negate(negate(c))))) -> negate(c)
% Current number of equations to process: 183
% Current number of ordered equations: 0
% Current number of rules: 14
% New rule produced :
% [33] negate(negate(c add negate(negate(negate(c)))) add negate(c)) -> c
% Current number of equations to process: 182
% Current number of ordered equations: 0
% Current number of rules: 15
% New rule produced :
% [34]
% negate(negate(negate(c) add negate(negate(c))) add negate(c)) ->
% negate(negate(c))
% Current number of equations to process: 181
% Current number of ordered equations: 0
% Current number of rules: 16
% New rule produced :
% [35] c add negate(c add negate(negate(negate(c) add negate(negate(c))))) -> c
% Current number of equations to process: 211
% Current number of ordered equations: 0
% Current number of rules: 17
% New rule produced : [36] c add negate(c add negate(negate(negate(c)))) -> c
% Rule [32] negate(c add negate(c add negate(negate(negate(c))))) -> negate(c)
% collapsed.
% Current number of equations to process: 232
% Current number of ordered equations: 0
% Current number of rules: 17
% New rule produced : [37] negate(c add negate(negate(negate(c)))) -> negate(c)
% Rule [33] negate(negate(c add negate(negate(negate(c)))) add negate(c)) -> c
% collapsed.
% Rule [36] c add negate(c add negate(negate(negate(c)))) -> c collapsed.
% Current number of equations to process: 235
% Current number of ordered equations: 0
% Current number of rules: 16
% New rule produced : [38] c add negate(negate(negate(c))) -> c
% Rule [37] negate(c add negate(negate(negate(c)))) -> negate(c) collapsed.
% Current number of equations to process: 270
% Current number of ordered equations: 0
% Current number of rules: 16
% New rule produced :
% [39] c add negate(c add negate(negate(negate(negate(c))))) -> c
% Current number of equations to process: 284
% Current number of ordered equations: 0
% Current number of rules: 17
% New rule produced :
% [40]
% negate(negate(c add negate(negate(negate(negate(c))))) add negate(c)) -> c
% Current number of equations to process: 308
% Current number of ordered equations: 0
% Current number of rules: 18
% New rule produced :
% [41]
% negate(negate(negate(c) add negate(negate(negate(c)))) add negate(c)) ->
% negate(negate(negate(c)))
% Current number of equations to process: 315
% Current number of ordered equations: 0
% Current number of rules: 19
% New rule produced :
% [42]
% c add negate(c add negate(negate(negate(negate(negate(c)))))) ->
% c add negate(negate(negate(negate(c))))
% Current number of equations to process: 322
% Current number of ordered equations: 1
% Current number of rules: 20
% New rule produced :
% [43]
% c add negate(c add negate(negate(c add negate(negate(negate(negate(c)))))))
% -> c
% Current number of equations to process: 322
% Current number of ordered equations: 0
% Current number of rules: 21
% New rule produced :
% [44]
% negate(negate(c add X) add negate(negate(c add X) add negate(c))) ->
% negate(c)
% Current number of equations to process: 370
% Current number of ordered equations: 0
% Current number of rules: 22
% New rule produced :
% [45]
% negate(negate(negate(negate(X) add Y) add X add Y) add Y) ->
% negate(negate(X) add Y)
% Current number of equations to process: 374
% Current number of ordered equations: 0
% Current number of rules: 23
% New rule produced :
% [46]
% negate(c add negate(negate(negate(c) add negate(negate(c))))) -> negate(c)
% Rule
% [35] c add negate(c add negate(negate(negate(c) add negate(negate(c))))) -> c
% collapsed.
% Current number of equations to process: 405
% Current number of ordered equations: 0
% Current number of rules: 23
% New rule produced :
% [47] c add negate(c add negate(c add negate(X)) add X) -> c add negate(X)
% Current number of equations to process: 419
% Current number of ordered equations: 0
% Current number of rules: 24
% New rule produced :
% [48] negate(c add negate(negate(negate(negate(c))))) -> negate(c)
% Rule [39] c add negate(c add negate(negate(negate(negate(c))))) -> c
% collapsed.
% Rule
% [40]
% negate(negate(c add negate(negate(negate(negate(c))))) add negate(c)) -> c
% collapsed.
% Rule
% [43]
% c add negate(c add negate(negate(c add negate(negate(negate(negate(c)))))))
% -> c collapsed.
% Current number of equations to process: 473
% Current number of ordered equations: 0
% Current number of rules: 22
% New rule produced :
% [49] c add negate(negate(negate(c) add negate(negate(c)))) -> c
% Rule
% [46]
% negate(c add negate(negate(negate(c) add negate(negate(c))))) -> negate(c)
% collapsed.
% Current number of equations to process: 491
% Current number of ordered equations: 0
% Current number of rules: 22
% New rule produced :
% [50] c add negate(c add negate(negate(c) add negate(negate(negate(c))))) -> c
% Current number of equations to process: 545
% Current number of ordered equations: 0
% Current number of rules: 23
% New rule produced :
% [51] c add negate(c add negate(negate(c) add negate(c) add negate(c))) -> c
% Current number of equations to process: 552
% Current number of ordered equations: 0
% Current number of rules: 24
% Rule [42]
% c add negate(c add negate(negate(negate(negate(negate(c)))))) ->
% c add negate(negate(negate(negate(c)))) is composed into [42]
% c add negate(
% c add
% negate(
% negate(
% negate(
% negate(
% negate(c))))))
% -> c
% New rule produced : [52] c add negate(negate(negate(negate(c)))) -> c
% Rule [48] negate(c add negate(negate(negate(negate(c))))) -> negate(c)
% collapsed.
% Current number of equations to process: 576
% Current number of ordered equations: 0
% Current number of rules: 24
% New rule produced :
% [53] c add negate(negate(c) add negate(negate(negate(c)))) -> c
% Rule
% [50] c add negate(c add negate(negate(c) add negate(negate(negate(c))))) -> c
% collapsed.
% Current number of equations to process: 644
% Current number of ordered equations: 0
% Current number of rules: 24
% New rule produced :
% [54]
% c add negate(c add negate(negate(negate(negate(c) add negate(negate(c))))))
% -> c
% Current number of equations to process: 642
% Current number of ordered equations: 0
% Current number of rules: 25
% New rule produced :
% [55] c add negate(negate(c) add negate(c) add negate(c)) -> c
% Rule
% [51] c add negate(c add negate(negate(c) add negate(c) add negate(c))) -> c
% collapsed.
% Current number of equations to process: 680
% Current number of ordered equations: 0
% Current number of rules: 25
% New rule produced :
% [56]
% negate(negate(c add negate(negate(negate(negate(negate(c)))))) add negate(c))
% -> c
% Current number of equations to process: 736
% Current number of ordered equations: 0
% Current number of rules: 26
% New rule produced :
% [57]
% c add negate(c add negate(negate(negate(c) add negate(negate(negate(c))))))
% -> c
% Current number of equations to process: 738
% Current number of ordered equations: 0
% Current number of rules: 27
% New rule produced :
% [58]
% negate(negate(c add negate(negate(negate(c)) add X)) add negate(c add X)) ->
% c
% Current number of equations to process: 838
% Current number of ordered equations: 0
% Current number of rules: 28
% New rule produced :
% [59]
% negate(negate(negate(c) add negate(c) add negate(negate(c))) add negate(c))
% -> negate(negate(c))
% Current number of equations to process: 884
% Current number of ordered equations: 0
% Current number of rules: 29
% New rule produced :
% [60] c add negate(c add negate(c add X) add negate(c add X)) -> c add X
% Current number of equations to process: 899
% Current number of ordered equations: 0
% Current number of rules: 30
% New rule produced :
% [61]
% c add negate(c add negate(X) add negate(X)) ->
% c add negate(c add negate(X)) add X
% Rule [60] c add negate(c add negate(c add X) add negate(c add X)) -> c add X
% collapsed.
% Current number of equations to process: 909
% Current number of ordered equations: 0
% Current number of rules: 30
% New rule produced : [62] c add negate(c add negate(c add X)) add X -> c add X
% Current number of equations to process: 908
% Current number of ordered equations: 0
% Current number of rules: 31
% New rule produced :
% [63] c add negate(negate(c) add negate(c) add negate(negate(c))) -> c
% Current number of equations to process: 911
% Current number of ordered equations: 0
% Current number of rules: 32
% New rule produced : [64] c add negate(negate(negate(negate(negate(c))))) -> c
% Rule [42] c add negate(c add negate(negate(negate(negate(negate(c)))))) -> c
% collapsed.
% Rule
% [56]
% negate(negate(c add negate(negate(negate(negate(negate(c)))))) add negate(c))
% -> c collapsed.
% Current number of equations to process: 923
% Current number of ordered equations: 0
% Current number of rules: 31
% New rule produced :
% [65] c add negate(c add negate(c add X)) add negate(c add X) -> c
% Current number of equations to process: 962
% Current number of ordered equations: 0
% Current number of rules: 32
% New rule produced :
% [66] c add negate(negate(negate(negate(c) add negate(negate(c))))) -> c
% Rule
% [54]
% c add negate(c add negate(negate(negate(negate(c) add negate(negate(c))))))
% -> c collapsed.
% Current number of equations to process: 974
% Current number of ordered equations: 0
% Current number of rules: 32
% New rule produced :
% [67] c add negate(negate(negate(c) add negate(negate(negate(c))))) -> c
% Rule
% [57]
% c add negate(c add negate(negate(negate(c) add negate(negate(negate(c))))))
% -> c collapsed.
% Current number of equations to process: 975
% Current number of ordered equations: 0
% Current number of rules: 32
% New rule produced :
% [68]
% c add negate(X) add negate(X) add negate(X) -> c add negate(X) add negate(X)
% Current number of equations to process: 1142
% Current number of ordered equations: 0
% Current number of rules: 33
% New rule produced :
% [69]
% c add negate(c add negate(negate(negate(negate(negate(negate(c))))))) -> c
% Current number of equations to process: 1206
% Current number of ordered equations: 0
% Current number of rules: 34
% New rule produced : [70] c add negate(c add negate(X)) add negate(X) -> c
% Rule [65] c add negate(c add negate(c add X)) add negate(c add X) -> c
% collapsed.
% Current number of equations to process: 1211
% Current number of ordered equations: 0
% Current number of rules: 34
% New rule produced : [71] c add X add X add X -> c add X add X
% Rule
% [68]
% c add negate(X) add negate(X) add negate(X) -> c add negate(X) add negate(X)
% collapsed.
% Current number of equations to process: 1311
% Current number of ordered equations: 0
% Current number of rules: 34
% New rule produced :
% [72] c add negate(negate(negate(negate(negate(negate(c)))))) -> c
% Rule
% [69]
% c add negate(c add negate(negate(negate(negate(negate(negate(c))))))) -> c
% collapsed.
% Current number of equations to process: 1349
% Current number of ordered equations: 0
% Current number of rules: 34
% New rule produced : [73] c add negate(c add X) add X -> c
% Rule [70] c add negate(c add negate(X)) add negate(X) -> c collapsed.
% Current number of equations to process: 1359
% Current number of ordered equations: 0
% Current number of rules: 34
% New rule produced : [74] c add negate(c add negate(c add X)) -> c add X
% Rule [62] c add negate(c add negate(c add X)) add X -> c add X collapsed.
% Current number of equations to process: 1592
% Current number of ordered equations: 0
% Current number of rules: 34
% New rule produced : [75] c add X add X -> c add X
% Rule
% [61]
% c add negate(c add negate(X) add negate(X)) ->
% c add negate(c add negate(X)) add X collapsed.
% Rule [71] c add X add X add X -> c add X add X collapsed.
% Current number of equations to process: 1592
% Current number of ordered equations: 0
% Current number of rules: 33
% New rule produced : [76] c add negate(X) -> c
% Rule [1] c add negate(c) -> c collapsed.
% Rule [21] c add negate(negate(c) add negate(negate(c))) -> c collapsed.
% Rule [22] negate(negate(c add negate(c add X)) add negate(c add X)) -> c
% collapsed.
% Rule
% [24] negate(negate(c add negate(negate(c) add X)) add negate(c add X)) -> c
% collapsed.
% Rule [30] c add negate(negate(c)) -> c collapsed.
% Rule [31] c add negate(c add negate(c add X) add negate(X)) -> c add X
% collapsed.
% Rule [38] c add negate(negate(negate(c))) -> c collapsed.
% Rule
% [47] c add negate(c add negate(c add negate(X)) add X) -> c add negate(X)
% collapsed.
% Rule [49] c add negate(negate(negate(c) add negate(negate(c)))) -> c
% collapsed.
% Rule [52] c add negate(negate(negate(negate(c)))) -> c collapsed.
% Rule [53] c add negate(negate(c) add negate(negate(negate(c)))) -> c
% collapsed.
% Rule [55] c add negate(negate(c) add negate(c) add negate(c)) -> c collapsed.
% Rule
% [58]
% negate(negate(c add negate(negate(negate(c)) add X)) add negate(c add X)) ->
% c collapsed.
% Rule [63] c add negate(negate(c) add negate(c) add negate(negate(c))) -> c
% collapsed.
% Rule [64] c add negate(negate(negate(negate(negate(c))))) -> c collapsed.
% Rule [66] c add negate(negate(negate(negate(c) add negate(negate(c))))) -> c
% collapsed.
% Rule [67] c add negate(negate(negate(c) add negate(negate(negate(c))))) -> c
% collapsed.
% Rule [72] c add negate(negate(negate(negate(negate(negate(c)))))) -> c
% collapsed.
% Rule [73] c add negate(c add X) add X -> c collapsed.
% Rule [74] c add negate(c add negate(c add X)) -> c add X collapsed.
% Current number of equations to process: 1637
% Current number of ordered equations: 0
% Current number of rules: 14
% New rule produced : [77] c add X -> c
% Rule [18] c add c -> c collapsed.
% Rule [19] negate(negate(c add X) add negate(c add X)) -> c add X collapsed.
% Rule
% [28] negate(negate(c add X) add negate(negate(c) add negate(c) add X)) -> X
% collapsed.
% Rule
% [44]
% negate(negate(c add X) add negate(negate(c add X) add negate(c))) ->
% negate(c) collapsed.
% Rule [75] c add X add X -> c add X collapsed.
% Rule [76] c add negate(X) -> c collapsed.
% Current number of equations to process: 1637
% Current number of ordered equations: 0
% Current number of rules: 9
% New rule produced : [78] negate(negate(negate(c) add X) add negate(c)) -> X
% Rule
% [23]
% negate(negate(negate(c) add negate(c) add negate(c)) add negate(c)) ->
% negate(c) collapsed.
% Rule
% [34]
% negate(negate(negate(c) add negate(negate(c))) add negate(c)) ->
% negate(negate(c)) collapsed.
% Rule
% [41]
% negate(negate(negate(c) add negate(negate(negate(c)))) add negate(c)) ->
% negate(negate(negate(c))) collapsed.
% Rule
% [59]
% negate(negate(negate(c) add negate(c) add negate(negate(c))) add negate(c))
% -> negate(negate(c)) collapsed.
% Current number of equations to process: 1640
% Current number of ordered equations: 0
% Current number of rules: 6
% New rule produced : [79] negate(c) add negate(c) -> negate(c)
% Rule [11] negate(negate(c) add negate(c)) -> c collapsed.
% Current number of equations to process: 1640
% Current number of ordered equations: 0
% Current number of rules: 6
% New rule produced : [80] negate(negate(c)) -> c
% Current number of equations to process: 1639
% Current number of ordered equations: 0
% Current number of rules: 7
% New rule produced : [81] negate(negate(negate(c) add X) add X) -> negate(c)
% Current number of equations to process: 1640
% Current number of ordered equations: 0
% Current number of rules: 8
% New rule produced : [82] negate(negate(negate(c) add X)) add X -> X
% Current number of equations to process: 1642
% Current number of ordered equations: 0
% Current number of rules: 9
% New rule produced :
% [83] negate(negate(c) add X) add negate(X) -> negate(negate(c) add X)
% Current number of equations to process: 1641
% Current number of ordered equations: 0
% Current number of rules: 10
% New rule produced : [84] X add X -> X
% Rule [79] negate(c) add negate(c) -> negate(c) collapsed.
% Current number of equations to process: 1643
% Current number of ordered equations: 0
% Current number of rules: 10
% New rule produced : [85] negate(negate(c) add negate(X)) -> X
% Rule [78] negate(negate(negate(c) add X) add negate(c)) -> X collapsed.
% Current number of equations to process: 1650
% Current number of ordered equations: 0
% Current number of rules: 10
% New rule produced : [86] negate(c) add X -> X
% Rule [81] negate(negate(negate(c) add X) add X) -> negate(c) collapsed.
% Rule [82] negate(negate(negate(c) add X)) add X -> X collapsed.
% Rule [83] negate(negate(c) add X) add negate(X) -> negate(negate(c) add X)
% collapsed.
% Rule [85] negate(negate(c) add negate(X)) -> X collapsed.
% Current number of equations to process: 1652
% Current number of ordered equations: 0
% Current number of rules: 7
% New rule produced : [87] negate(negate(X)) -> X
% Rule [80] negate(negate(c)) -> c collapsed.
% Current number of equations to process: 1651
% Current number of ordered equations: 0
% Current number of rules: 7
% New rule produced : [88] negate(negate(X) add X) -> negate(c)
% Current number of equations to process: 1649
% Current number of ordered equations: 0
% Current number of rules: 8
% New rule produced : [89] negate(negate(X add Y) add Y) add X -> X
% Current number of equations to process: 1668
% Current number of ordered equations: 0
% Current number of rules: 9
% New rule produced : [90] negate(X) add X -> c
% Rule [88] negate(negate(X) add X) -> negate(c) collapsed.
% Current number of equations to process: 1673
% Current number of ordered equations: 0
% Current number of rules: 9
% New rule produced :
% [91] negate(negate(Y) add X) add negate(X add Y) -> negate(X)
% Rule [2] negate(negate(negate(Y) add X) add negate(X add Y)) -> X collapsed.
% The conjecture has been reduced.
% Conjecture is now:
% Trivial
%
% Current number of equations to process: 1693
% Current number of ordered equations: 0
% Current number of rules: 9
% The current conjecture is true and the solution is the identity
% % SZS output start Refutation
%
% The following 22 rules have been used:
% [1]
% c add negate(c) -> c; trace = in the starting set
% [2] negate(negate(negate(Y) add X) add negate(X add Y)) -> X; trace = in the starting set
% [3] negate(negate(c add c) add negate(c)) -> c; trace = Cp of 2 and 1
% [10] negate(c add c) -> negate(c); trace = Cp of 3 and 2
% [17] negate(negate(c add c add X) add negate(c add X)) -> c add X; trace = Cp of 2 and 1
% [18] c add c -> c; trace = Cp of 17 and 10
% [19] negate(negate(c add X) add negate(c add X)) -> c add X; trace = Cp of 18 and 2
% [22] negate(negate(c add negate(c add X)) add negate(c add X)) -> c; trace = Cp of 18 and 2
% [29] negate(negate(negate(X add Y) add negate(Y) add X) add X) ->
% negate(X add Y); trace = Self cp of 2
% [31] c add negate(c add negate(c add X) add negate(X)) -> c add X; trace = Cp of 29 and 19
% [45] negate(negate(negate(negate(X) add Y) add X add Y) add Y) ->
% negate(negate(X) add Y); trace = Self cp of 2
% [47] c add negate(c add negate(c add negate(X)) add X) -> c add negate(X); trace = Cp of 45 and 19
% [60] c add negate(c add negate(c add X) add negate(c add X)) -> c add X; trace = Cp of 31 and 18
% [61] c add negate(c add negate(X) add negate(X)) ->
% c add negate(c add negate(X)) add X; trace = Cp of 60 and 47
% [65] c add negate(c add negate(c add X)) add negate(c add X) -> c; trace = Cp of 61 and 22
% [70] c add negate(c add negate(X)) add negate(X) -> c; trace = Cp of 65 and 47
% [73] c add negate(c add X) add X -> c; trace = Cp of 70 and 31
% [77] c add X -> c; trace = Self cp of 73
% [78] negate(negate(negate(c) add X) add negate(c)) -> X; trace = Cp of 77 and 2
% [81] negate(negate(negate(c) add X) add X) -> negate(c); trace = Cp of 78 and 2
% [87] negate(negate(X)) -> X; trace = Cp of 81 and 2
% [91] negate(negate(Y) add X) add negate(X add Y) -> negate(X); trace = Cp of 87 and 2
% % SZS output end Refutation
% All conjectures have been proven
%
% Execution time: 4.520000 sec
% res : bool = true
% time is now off
%
% status : string = "unsatisfiable"
% % SZS status Unsatisfiable
% CiME interrupted
%
% EOF
%------------------------------------------------------------------------------