TSTP Solution File: ROB005-1 by CiME---2.01
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CiME---2.01
% Problem : ROB005-1 : TPTP v6.0.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_cime %s
% Computer : n137.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:31:59 EDT 2014
% Result : Unsatisfiable 4.62s
% Output : Refutation 4.62s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : ROB005-1 : TPTP v6.0.0. Released v1.0.0.
% % Command : tptp2X_and_run_cime %s
% % Computer : n137.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 15:24:38 CDT 2014
% % CPUTime : 4.62
% Processing problem /tmp/CiME_43525_n137.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 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 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 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 negate(c)) add negate(c)) -> c
% Current number of equations to process: 8
% Current number of ordered equations: 0
% Current number of rules: 3
% New rule produced :
% [4] negate(c add negate(c add negate(c) add negate(c))) -> negate(c)
% Current number of equations to process: 12
% Current number of ordered equations: 0
% Current number of rules: 4
% New rule produced :
% [5] negate(negate(c add negate(c) add negate(c)) add negate(c)) -> c
% Current number of equations to process: 15
% Current number of ordered equations: 0
% Current number of rules: 5
% New rule produced :
% [6] negate(negate(c add negate(c add X)) add negate(c add X)) -> c
% Current number of equations to process: 18
% Current number of ordered equations: 0
% Current number of rules: 6
% New rule produced :
% [7]
% negate(c add negate(c add negate(c add negate(c)))) ->
% negate(c add negate(c))
% Current number of equations to process: 22
% Current number of ordered equations: 0
% Current number of rules: 7
% New rule produced :
% [8]
% negate(c add negate(negate(c) add negate(negate(c add negate(c))))) ->
% negate(c)
% Current number of equations to process: 24
% Current number of ordered equations: 0
% Current number of rules: 8
% New rule produced :
% [9] negate(negate(c add negate(c) add X) add negate(c add X)) -> c add X
% Current number of equations to process: 27
% Current number of ordered equations: 0
% Current number of rules: 9
% New rule produced :
% [10]
% negate(negate(negate(X add Y) add negate(Y) add X) add X) -> negate(X add Y)
% Current number of equations to process: 34
% 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(c) add negate(c))) ->
% negate(c)
% Current number of equations to process: 75
% Current number of ordered equations: 0
% Current number of rules: 11
% New rule produced :
% [12]
% negate(negate(negate(negate(X) add Y) add X add Y) add Y) ->
% negate(negate(X) add Y)
% Current number of equations to process: 82
% Current number of ordered equations: 0
% Current number of rules: 12
% New rule produced :
% [13]
% negate(c add negate(negate(c add negate(c)) add negate(negate(c)))) ->
% negate(c add negate(c))
% Current number of equations to process: 127
% Current number of ordered equations: 0
% Current number of rules: 13
% New rule produced :
% [14]
% negate(negate(c add negate(c) add negate(c) add negate(c)) add negate(c)) ->
% c
% Current number of equations to process: 136
% Current number of ordered equations: 0
% Current number of rules: 14
% New rule produced :
% [15]
% negate(negate(c add negate(negate(c add negate(c) add negate(c)))) add
% negate(c)) -> c
% Current number of equations to process: 143
% Current number of ordered equations: 0
% Current number of rules: 15
% New rule produced :
% [16]
% negate(negate(c add negate(c) add negate(negate(c add negate(c)))) add
% negate(c)) -> c
% Current number of equations to process: 152
% Current number of ordered equations: 0
% Current number of rules: 16
% New rule produced :
% [17]
% negate(negate(c add negate(c add X) add negate(X)) add negate(c add X)) -> c
% Current number of equations to process: 161
% Current number of ordered equations: 0
% Current number of rules: 17
% New rule produced :
% [18]
% 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: 185
% Current number of ordered equations: 0
% Current number of rules: 18
% New rule produced :
% [19] negate(c add negate(c) add negate(c)) -> negate(c add negate(c))
% Rule [4] negate(c add negate(c add negate(c) add negate(c))) -> negate(c)
% collapsed.
% Rule [5] negate(negate(c add negate(c) add negate(c)) add negate(c)) -> c
% collapsed.
% Rule
% [15]
% negate(negate(c add negate(negate(c add negate(c) add negate(c)))) add
% negate(c)) -> c collapsed.
% Current number of equations to process: 214
% Current number of ordered equations: 0
% Current number of rules: 16
% New rule produced : [20] negate(c add negate(c add negate(c))) -> negate(c)
% Rule
% [7]
% negate(c add negate(c add negate(c add negate(c)))) ->
% negate(c add negate(c)) collapsed.
% Current number of equations to process: 213
% Current number of ordered equations: 0
% Current number of rules: 16
% New rule produced :
% [21] negate(negate(c add negate(negate(c add negate(c)))) add negate(c)) -> c
% Current number of equations to process: 212
% Current number of ordered equations: 0
% Current number of rules: 17
% New rule produced :
% [22]
% negate(negate(c add negate(c)) add negate(c add negate(c))) ->
% c add negate(c)
% Current number of equations to process: 307
% Current number of ordered equations: 0
% Current number of rules: 18
% New rule produced :
% [23]
% negate(c add negate(c) add negate(negate(c add negate(c)))) ->
% negate(c add negate(c))
% Rule
% [16]
% negate(negate(c add negate(c) add negate(negate(c add negate(c)))) add
% negate(c)) -> c collapsed.
% Current number of equations to process: 318
% Current number of ordered equations: 0
% Current number of rules: 18
% New rule produced :
% [24]
% negate(negate(c add negate(negate(c) add negate(c))) add negate(c add
% negate(c)))
% -> c
% Current number of equations to process: 354
% Current number of ordered equations: 0
% Current number of rules: 19
% New rule produced :
% [25]
% negate(c add negate(c add negate(c add X) add negate(c add X))) ->
% negate(c add X)
% Current number of equations to process: 368
% Current number of ordered equations: 0
% Current number of rules: 20
% New rule produced :
% [26]
% 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: 382
% Current number of ordered equations: 0
% Current number of rules: 21
% New rule produced :
% [27]
% negate(negate(c add X) add negate(negate(c add negate(c)) add negate(c) add X))
% -> X
% Current number of equations to process: 513
% Current number of ordered equations: 0
% Current number of rules: 22
% New rule produced :
% [28]
% negate(negate(c add negate(c add negate(c)) add negate(c)) add negate(c)) ->
% c
% Current number of equations to process: 518
% Current number of ordered equations: 0
% Current number of rules: 23
% New rule produced :
% [29]
% negate(negate(c add negate(c add negate(X)) add X) add negate(c add negate(X)))
% -> c
% Current number of equations to process: 575
% Current number of ordered equations: 0
% Current number of rules: 24
% New rule produced :
% [30]
% negate(negate(c add negate(c add negate(c)) add X) add negate(negate(c) add X))
% -> X
% Current number of equations to process: 623
% Current number of ordered equations: 0
% Current number of rules: 25
% New rule produced :
% [31]
% negate(c add negate(c add negate(c) add negate(c) add negate(c) add negate(c)))
% -> negate(c)
% Current number of equations to process: 666
% Current number of ordered equations: 0
% Current number of rules: 26
% New rule produced :
% [32]
% negate(negate(c add negate(c) add negate(negate(c))) add negate(c add
% negate(c)))
% -> c add negate(c)
% Current number of equations to process: 686
% Current number of ordered equations: 0
% Current number of rules: 27
% New rule produced :
% [33]
% negate(c add negate(negate(c) add negate(negate(c add negate(negate(c add
% negate(c)))))))
% -> negate(c)
% Current number of equations to process: 708
% Current number of ordered equations: 0
% Current number of rules: 28
% New rule produced :
% [34]
% negate(c add negate(c add negate(c add negate(c)) add negate(c) add negate(c)))
% -> negate(c)
% Current number of equations to process: 729
% Current number of ordered equations: 0
% Current number of rules: 29
% New rule produced :
% [35]
% negate(negate(c add negate(c add X) add Y) add negate(c add X add Y)) ->
% c add Y
% Current number of equations to process: 750
% Current number of ordered equations: 0
% Current number of rules: 30
% New rule produced :
% [36]
% negate(c add negate(c add negate(c add negate(c add X)) add X)) ->
% negate(c add negate(c add X))
% Current number of equations to process: 817
% Current number of ordered equations: 0
% Current number of rules: 31
% New rule produced :
% [37]
% negate(negate(c add negate(negate(negate(c) add negate(negate(c add negate(c)))))) add
% negate(c)) -> c
% Current number of equations to process: 861
% Current number of ordered equations: 0
% Current number of rules: 32
% New rule produced :
% [38]
% 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: 882
% Current number of ordered equations: 0
% Current number of rules: 33
% New rule produced :
% [39]
% negate(negate(c add negate(c add X) add negate(c add X)) add negate(c add X))
% -> c
% Current number of equations to process: 1002
% Current number of ordered equations: 0
% Current number of rules: 34
% New rule produced :
% [40]
% negate(negate(c add negate(c) add negate(c) add negate(c) add negate(c)) add
% negate(c)) -> c
% Current number of equations to process: 1026
% Current number of ordered equations: 0
% Current number of rules: 35
% New rule produced :
% [41]
% negate(negate(c add negate(c)) add negate(negate(c) add negate(c) add
% negate(c))) ->
% negate(c) add negate(c)
% Current number of equations to process: 1045
% Current number of ordered equations: 0
% Current number of rules: 36
% New rule produced : [42] c add negate(c add negate(c)) -> c
% Rule [20] negate(c add negate(c add negate(c))) -> negate(c) collapsed.
% Rule
% [28]
% negate(negate(c add negate(c add negate(c)) add negate(c)) add negate(c)) ->
% c collapsed.
% Rule
% [30]
% negate(negate(c add negate(c add negate(c)) add X) add negate(negate(c) add X))
% -> X collapsed.
% Rule
% [34]
% negate(c add negate(c add negate(c add negate(c)) add negate(c) add negate(c)))
% -> negate(c) collapsed.
% Current number of equations to process: 1070
% Current number of ordered equations: 0
% Current number of rules: 33
% New rule produced : [43] negate(c add negate(c)) add X -> X
% Rule [3] negate(negate(c add negate(c)) add negate(c)) -> c collapsed.
% Rule
% [13]
% negate(c add negate(negate(c add negate(c)) add negate(negate(c)))) ->
% negate(c add negate(c)) collapsed.
% Rule
% [22]
% negate(negate(c add negate(c)) add negate(c add negate(c))) ->
% c add negate(c) collapsed.
% Rule
% [24]
% negate(negate(c add negate(negate(c) add negate(c))) add negate(c add
% negate(c)))
% -> c collapsed.
% Rule
% [27]
% negate(negate(c add X) add negate(negate(c add negate(c)) add negate(c) add X))
% -> X collapsed.
% Rule
% [32]
% negate(negate(c add negate(c) add negate(negate(c))) add negate(c add
% negate(c)))
% -> c add negate(c) collapsed.
% Rule
% [41]
% negate(negate(c add negate(c)) add negate(negate(c) add negate(c) add
% negate(c))) ->
% negate(c) add negate(c) collapsed.
% Rule [42] c add negate(c add negate(c)) -> c collapsed.
% Current number of equations to process: 1084
% Current number of ordered equations: 0
% Current number of rules: 26
% New rule produced : [44] negate(negate(c)) -> c
% Current number of equations to process: 1083
% Current number of ordered equations: 0
% Current number of rules: 27
% New rule produced : [45] negate(negate(c add negate(c))) -> c add negate(c)
% Rule
% [8]
% negate(c add negate(negate(c) add negate(negate(c add negate(c))))) ->
% negate(c) collapsed.
% Rule
% [21] negate(negate(c add negate(negate(c add negate(c)))) add negate(c)) -> c
% collapsed.
% Rule
% [23]
% negate(c add negate(c) add negate(negate(c add negate(c)))) ->
% negate(c add negate(c)) collapsed.
% Rule
% [33]
% negate(c add negate(negate(c) add negate(negate(c add negate(negate(c add
% negate(c)))))))
% -> negate(c) collapsed.
% Rule
% [37]
% negate(negate(c add negate(negate(negate(c) add negate(negate(c add negate(c)))))) add
% negate(c)) -> c collapsed.
% Current number of equations to process: 1082
% Current number of ordered equations: 0
% Current number of rules: 23
% New rule produced :
% [46] negate(negate(c add negate(negate(c) add negate(c)))) -> c
% Current number of equations to process: 1080
% Current number of ordered equations: 0
% Current number of rules: 24
% New rule produced :
% [47]
% negate(negate(negate(c) add negate(c) add negate(c))) ->
% negate(c) add negate(c)
% Current number of equations to process: 1078
% Current number of ordered equations: 0
% Current number of rules: 25
% New rule produced :
% [48]
% negate(negate(negate(negate(X)) add negate(negate(X)))) -> negate(negate(X))
% Current number of equations to process: 1080
% Current number of ordered equations: 0
% Current number of rules: 26
% New rule produced : [49] negate(negate(negate(c) add negate(c))) -> negate(c)
% Current number of equations to process: 1082
% Current number of ordered equations: 0
% Current number of rules: 27
% New rule produced :
% [50] negate(negate(negate(X)) add negate(X)) -> negate(c add negate(c))
% Current number of equations to process: 1081
% Current number of ordered equations: 0
% Current number of rules: 28
% New rule produced : [51] negate(negate(negate(X) add negate(X))) -> negate(X)
% Rule
% [48]
% negate(negate(negate(negate(X)) add negate(negate(X)))) -> negate(negate(X))
% collapsed.
% Rule [49] negate(negate(negate(c) add negate(c))) -> negate(c) collapsed.
% Current number of equations to process: 1084
% Current number of ordered equations: 0
% Current number of rules: 27
% New rule produced :
% [52] negate(negate(negate(negate(X)) add X)) -> negate(negate(X))
% Current number of equations to process: 1084
% Current number of ordered equations: 0
% Current number of rules: 28
% New rule produced :
% [53] negate(negate(c add negate(c) add X) add negate(X)) -> X
% Current number of equations to process: 1083
% Current number of ordered equations: 0
% Current number of rules: 29
% New rule produced : [54] negate(negate(negate(X))) -> negate(X)
% Current number of equations to process: 1083
% Current number of ordered equations: 0
% Current number of rules: 30
% New rule produced :
% [55]
% negate(negate(negate(c) add negate(c)) add negate(c)) ->
% negate(c add negate(c))
% Current number of equations to process: 1082
% Current number of ordered equations: 0
% Current number of rules: 31
% New rule produced : [56] negate(c) add negate(c) -> negate(c)
% Rule
% [11]
% negate(c add negate(c add negate(c) add negate(c) add negate(c))) ->
% negate(c) collapsed.
% Rule
% [14]
% negate(negate(c add negate(c) add negate(c) add negate(c)) add negate(c)) ->
% c collapsed.
% Rule [19] negate(c add negate(c) add negate(c)) -> negate(c add negate(c))
% collapsed.
% Rule
% [31]
% negate(c add negate(c add negate(c) add negate(c) add negate(c) add negate(c)))
% -> negate(c) collapsed.
% Rule
% [40]
% negate(negate(c add negate(c) add negate(c) add negate(c) add negate(c)) add
% negate(c)) -> c collapsed.
% Rule [46] negate(negate(c add negate(negate(c) add negate(c)))) -> c
% collapsed.
% Rule
% [47]
% negate(negate(negate(c) add negate(c) add negate(c))) ->
% negate(c) add negate(c) collapsed.
% Rule
% [55]
% negate(negate(negate(c) add negate(c)) add negate(c)) ->
% negate(c add negate(c)) collapsed.
% Current number of equations to process: 1085
% Current number of ordered equations: 0
% Current number of rules: 24
% New rule produced :
% [57]
% negate(negate(negate(X) add negate(X)) add negate(X)) ->
% negate(c add negate(c))
% Current number of equations to process: 1084
% Current number of ordered equations: 0
% Current number of rules: 25
% New rule produced : [58] negate(c add negate(c)) <-> negate(negate(X) add X)
% Current number of equations to process: 1090
% Current number of ordered equations: 1
% Current number of rules: 26
% New rule produced : [59] negate(negate(X) add X) <-> negate(c add negate(c))
% Rule [50] negate(negate(negate(X)) add negate(X)) -> negate(c add negate(c))
% collapsed.
% Current number of equations to process: 1090
% Current number of ordered equations: 0
% Current number of rules: 26
% New rule produced : [60] negate(negate(X add X)) -> X
% Rule [51] negate(negate(negate(X) add negate(X))) -> negate(X) collapsed.
% Current number of equations to process: 1093
% Current number of ordered equations: 0
% Current number of rules: 26
% New rule produced :
% [61]
% negate(negate(negate(negate(negate(X)) add X) add negate(X))) -> negate(X)
% Current number of equations to process: 1120
% Current number of ordered equations: 0
% Current number of rules: 27
% New rule produced :
% [62]
% negate(negate(negate(negate(X)) add negate(negate(X)) add X)) ->
% negate(negate(X))
% Current number of equations to process: 1119
% Current number of ordered equations: 0
% Current number of rules: 28
% New rule produced :
% [63] negate(negate(negate(negate(X)) add negate(X) add Y) add negate(Y)) -> Y
% Current number of equations to process: 1118
% Current number of ordered equations: 0
% Current number of rules: 29
% New rule produced :
% [64] negate(negate(c add negate(c) add negate(X) add X) add X) -> negate(X)
% Current number of equations to process: 1117
% Current number of ordered equations: 0
% Current number of rules: 30
% New rule produced : [65] negate(negate(X)) -> X
% Rule
% [18]
% negate(negate(negate(X add Y) add negate(negate(negate(Y) add X))) add X) ->
% negate(X add Y) collapsed.
% Rule
% [26]
% negate(negate(negate(negate(X) add Y) add negate(negate(X add Y))) add Y) ->
% negate(negate(X) add Y) collapsed.
% Rule [44] negate(negate(c)) -> c collapsed.
% Rule [45] negate(negate(c add negate(c))) -> c add negate(c) collapsed.
% Rule [52] negate(negate(negate(negate(X)) add X)) -> negate(negate(X))
% collapsed.
% Rule [54] negate(negate(negate(X))) -> negate(X) collapsed.
% Rule [60] negate(negate(X add X)) -> X collapsed.
% Rule
% [61]
% negate(negate(negate(negate(negate(X)) add X) add negate(X))) -> negate(X)
% collapsed.
% Rule
% [62]
% negate(negate(negate(negate(X)) add negate(negate(X)) add X)) ->
% negate(negate(X)) collapsed.
% Rule
% [63] negate(negate(negate(negate(X)) add negate(X) add Y) add negate(Y)) -> Y
% collapsed.
% Current number of equations to process: 1170
% Current number of ordered equations: 0
% Current number of rules: 21
% New rule produced : [66] X add X -> X
% Rule [1] c add c -> c collapsed.
% Rule
% [25]
% negate(c add negate(c add negate(c add X) add negate(c add X))) ->
% negate(c add X) collapsed.
% Rule
% [38]
% negate(negate(negate(X add Y) add negate(Y) add X add X) add negate(X add Y))
% -> X collapsed.
% Rule
% [39]
% negate(negate(c add negate(c add X) add negate(c add X)) add negate(c add X))
% -> c collapsed.
% Rule [56] negate(c) add negate(c) -> negate(c) collapsed.
% Rule
% [57]
% negate(negate(negate(X) add negate(X)) add negate(X)) ->
% negate(c add negate(c)) collapsed.
% Current number of equations to process: 1171
% Current number of ordered equations: 0
% Current number of rules: 16
% New rule produced :
% [67] negate(negate(negate(X) add X add Y) add negate(Y)) -> Y
% Rule [53] negate(negate(c add negate(c) add X) add negate(X)) -> X collapsed.
% Current number of equations to process: 1168
% Current number of ordered equations: 0
% Current number of rules: 16
% New rule produced :
% [68] negate(c add negate(c add negate(c add X))) -> negate(c add X)
% Current number of equations to process: 1167
% Current number of ordered equations: 0
% Current number of rules: 17
% New rule produced : [69] negate(negate(X) add X) add Y -> Y
% Rule [43] negate(c add negate(c)) add X -> X collapsed.
% Current number of equations to process: 1168
% Current number of ordered equations: 0
% Current number of rules: 17
% New rule produced : [70] negate(negate(Y) add Y) <-> negate(negate(X) add X)
% Rule [58] negate(c add negate(c)) <-> negate(negate(X) add X) collapsed.
% Rule [59] negate(negate(X) add X) <-> negate(c add negate(c)) collapsed.
% Current number of equations to process: 1167
% Current number of ordered equations: 0
% Current number of rules: 16
% New rule produced :
% [71] negate(negate(X) add Y) add negate(X add Y) add negate(Y) -> negate(Y)
% Current number of equations to process: 1166
% Current number of ordered equations: 0
% Current number of rules: 17
% New rule produced :
% [72] negate(negate(c add negate(c) add negate(X) add X) add negate(X)) -> X
% Current number of equations to process: 1180
% Current number of ordered equations: 0
% Current number of rules: 18
% New rule produced :
% [73] 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.
% Rule
% [71] negate(negate(X) add Y) add negate(X add Y) add negate(Y) -> negate(Y)
% collapsed.
% The conjecture has been reduced.
% Conjecture is now:
% Trivial
%
% Current number of equations to process: 1214
% Current number of ordered equations: 0
% Current number of rules: 17
% The current conjecture is true and the solution is the identity
% % SZS output start Refutation
%
% The following 11 rules have been used:
% [1]
% c add 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 negate(c)) add negate(c)) -> c; trace = Cp of 2 and 1
% [9] negate(negate(c add negate(c) add X) add negate(c add X)) -> c add X; trace = Cp of 2 and 1
% [18] negate(negate(negate(X add Y) add negate(negate(negate(Y) add X))) add X)
% -> negate(X add Y); trace = Self cp of 2
% [20] negate(c add negate(c add negate(c))) -> negate(c); trace = Cp of 3 and 2
% [42] c add negate(c add negate(c)) -> c; trace = Cp of 20 and 9
% [43] negate(c add negate(c)) add X -> X; trace = Cp of 42 and 2
% [54] negate(negate(negate(X))) -> negate(X); trace = Cp of 43 and 18
% [65] negate(negate(X)) -> X; trace = Cp of 54 and 2
% [73] negate(negate(Y) add X) add negate(X add Y) -> negate(X); trace = Cp of 65 and 2
% % SZS output end Refutation
% All conjectures have been proven
%
% Execution time: 3.510000 sec
% res : bool = true
% time is now off
%
% status : string = "unsatisfiable"
% % SZS status Unsatisfiable
% CiME interrupted
%
% EOF
%------------------------------------------------------------------------------