TSTP Solution File: ROB023-1 by CiME---2.01
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CiME---2.01
% Problem : ROB023-1 : TPTP v6.0.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_cime %s
% Computer : n121.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 1.65s
% Output : Refutation 1.65s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : ROB023-1 : TPTP v6.0.0. Released v1.0.0.
% % Command : tptp2X_and_run_cime %s
% % Computer : n121.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:44:18 CDT 2014
% % CPUTime : 1.65
% Processing problem /tmp/CiME_27931_n121.star.cs.uiowa.edu
% #verbose 1;
% let F = signature " add : AC; b,a : 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;
% X add X = X;
% ";
%
% let s1 = status F "
% b lr_lex;
% a lr_lex;
% negate lr_lex;
% add mul;
% ";
%
% let p1 = precedence F "
% negate > add > a > b";
%
% let s2 = status F "
% b mul;
% a mul;
% negate mul;
% add mul;
% ";
%
% let p2 = precedence F "
% negate > add > 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,
% X add X = X } (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] X add X -> X
% 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(negate(X) add X) add negate(X)) -> X
% Current number of equations to process: 10
% Current number of ordered equations: 0
% Current number of rules: 3
% New rule produced : [4] negate(negate(negate(X) add X) add X) -> negate(X)
% Current number of equations to process: 16
% Current number of ordered equations: 0
% Current number of rules: 4
% New rule produced :
% [5] negate(negate(negate(X) add X) add negate(negate(X))) -> negate(X)
% Current number of equations to process: 25
% Current number of ordered equations: 0
% Current number of rules: 5
% New rule produced :
% [6] negate(negate(negate(X add Y) add X) add negate(X add Y)) -> X
% Current number of equations to process: 34
% Current number of ordered equations: 0
% Current number of rules: 6
% New rule produced :
% [7] negate(negate(negate(X add Y) add X) add X) -> negate(X add Y)
% Current number of equations to process: 35
% Current number of ordered equations: 0
% Current number of rules: 7
% New rule produced :
% [8] negate(negate(negate(negate(negate(X) add X)) add X) add negate(X)) -> X
% Current number of equations to process: 54
% Current number of ordered equations: 0
% Current number of rules: 8
% New rule produced :
% [9]
% negate(negate(negate(negate(negate(X) add X)) add negate(X)) add X) ->
% negate(X)
% Current number of equations to process: 67
% Current number of ordered equations: 0
% Current number of rules: 9
% New rule produced :
% [10] negate(negate(negate(X) add X add Y) add negate(X add Y)) -> X add Y
% Current number of equations to process: 87
% Current number of ordered equations: 0
% Current number of rules: 10
% New rule produced : [11] negate(negate(negate(X) add X)) -> negate(X) add X
% Rule
% [8] negate(negate(negate(negate(negate(X) add X)) add X) add negate(X)) -> X
% collapsed.
% Rule
% [9]
% negate(negate(negate(negate(negate(X) add X)) add negate(X)) add X) ->
% negate(X) collapsed.
% Current number of equations to process: 93
% Current number of ordered equations: 0
% Current number of rules: 9
% New rule produced :
% [12] negate(negate(negate(X) add X add Y)) -> negate(X) add X add Y
% Current number of equations to process: 92
% Current number of ordered equations: 0
% Current number of rules: 10
% New rule produced :
% [13]
% negate(negate(negate(negate(X)) add negate(X) add X) add negate(X)) ->
% negate(negate(X))
% Current number of equations to process: 128
% Current number of ordered equations: 0
% Current number of rules: 11
% New rule produced :
% [14]
% negate(negate(negate(X)) add negate(X) add X) ->
% negate(negate(negate(X)) add negate(X))
% Rule
% [13]
% negate(negate(negate(negate(X)) add negate(X) add X) add negate(X)) ->
% negate(negate(X)) collapsed.
% Current number of equations to process: 129
% Current number of ordered equations: 0
% Current number of rules: 11
% New rule produced :
% [15] negate(negate(X)) add negate(X) add X -> negate(negate(X)) add negate(X)
% Rule
% [14]
% negate(negate(negate(X)) add negate(X) add X) ->
% negate(negate(negate(X)) add negate(X)) collapsed.
% Current number of equations to process: 137
% Current number of ordered equations: 0
% Current number of rules: 11
% New rule produced : [16] negate(negate(X)) add X -> negate(negate(X))
% Rule
% [15] negate(negate(X)) add negate(X) add X -> negate(negate(X)) add negate(X)
% collapsed.
% Current number of equations to process: 235
% Current number of ordered equations: 0
% Current number of rules: 11
% New rule produced : [17] negate(negate(X) add X) add negate(X) -> negate(X)
% Rule [3] negate(negate(negate(X) add X) add negate(X)) -> X collapsed.
% Current number of equations to process: 312
% Current number of ordered equations: 0
% Current number of rules: 11
% New rule produced : [18] negate(negate(X)) -> X
% Rule [5] negate(negate(negate(X) add X) add negate(negate(X))) -> negate(X)
% collapsed.
% Rule [11] negate(negate(negate(X) add X)) -> negate(X) add X collapsed.
% Rule [12] negate(negate(negate(X) add X add Y)) -> negate(X) add X add Y
% collapsed.
% Rule [16] negate(negate(X)) add X -> negate(negate(X)) collapsed.
% Current number of equations to process: 311
% Current number of ordered equations: 0
% Current number of rules: 8
% New rule produced : [19] negate(negate(X) add X) add X -> X
% Rule [4] negate(negate(negate(X) add X) add X) -> negate(X) collapsed.
% Current number of equations to process: 314
% Current number of ordered equations: 0
% Current number of rules: 8
% New rule produced : [20] negate(negate(X add Y) add X) add X -> X add Y
% Rule [7] negate(negate(negate(X add Y) add X) add X) -> negate(X add Y)
% collapsed.
% Current number of equations to process: 338
% Current number of ordered equations: 0
% Current number of rules: 8
% New rule produced : [21] negate(negate(Y) add Y) add X -> X
% Rule [17] negate(negate(X) add X) add negate(X) -> negate(X) collapsed.
% Rule [19] negate(negate(X) add X) add X -> X collapsed.
% Current number of equations to process: 354
% Current number of ordered equations: 0
% Current number of rules: 7
% New rule produced :
% [22] 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: 376
% Current number of ordered equations: 0
% Current number of rules: 7
% The current conjecture is true and the solution is the identity
% % SZS output start Refutation
%
% The following 4 rules have been used:
% [1]
% X add X -> X; trace = in the starting set
% [2] negate(negate(negate(Y) add X) add negate(X add Y)) -> X; trace = in the starting set
% [18] negate(negate(X)) -> X; trace = Cp of 2 and 1
% [22] negate(negate(Y) add X) add negate(X add Y) -> negate(X); trace = Cp of 18 and 2
% % SZS output end Refutation
% All conjectures have been proven
%
% Execution time: 0.540000 sec
% res : bool = true
% time is now off
%
% status : string = "unsatisfiable"
% % SZS status Unsatisfiable
% CiME interrupted
%
% EOF
%------------------------------------------------------------------------------