TSTP Solution File: RNG042-3 by CiME---2.01
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CiME---2.01
% Problem : RNG042-3 : TPTP v6.0.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_cime %s
% Computer : n103.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:50 EDT 2014
% Result : Satisfiable 1.16s
% Output : Assurance 1.16s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : RNG042-3 : TPTP v6.0.0. Released v2.5.0.
% % Command : tptp2X_and_run_cime %s
% % Computer : n103.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 22:30:18 CDT 2014
% % CPUTime : 1.16
% Processing problem /tmp/CiME_6384_n103.star.cs.uiowa.edu
% #verbose 1;
% let F = signature " add : AC; additive_identity : constant; multiply : 2; additive_inverse : 1;additive_identity_add_additive_inverse_multiply__1, additive_identity_add_additive_inverse_multiply__2 : 0;";
% let X = vars "X Y Z";
% let Axioms = equations F X "
% multiply(multiply(X,Y),Z) = multiply(X,multiply(Y,Z));
% additive_identity add X = X;
% X add additive_identity = X;
% additive_inverse(X) add X = additive_identity;
% X add additive_inverse(X) = additive_identity;
% multiply(X,Y add Z) = multiply(X,Y) add multiply(X,Z);
% multiply(X add Y,Z) = multiply(X,Z) add multiply(Y,Z);
% ";
%
% let s1 = status F "
% additive_inverse lr_lex;
% additive_identity lr_lex;
% multiply mul;
% add mul;
% ";
%
% let p1 = precedence F "
% multiply > additive_inverse > add > additive_identity > additive_identity_add_additive_inverse_multiply__1 > additive_identity_add_additive_inverse_multiply__2";
%
% let s2 = status F "
% multiply mul;
% additive_inverse mul;
% add mul;
% additive_identity mul;
% ";
%
% let p2 = precedence F "
% multiply > additive_inverse > add > additive_identity > additive_identity_add_additive_inverse_multiply__1 > additive_identity_add_additive_inverse_multiply__2";
%
% let o_auto = AUTO Axioms;
%
% let o = LEX o_auto (LEX (ACRPO s1 p1) (ACRPO s2 p2));
%
% let Conjectures = equations F X "additive_identity_add_additive_inverse_multiply__1 = additive_identity_add_additive_inverse_multiply__2"
% ;
% (*
% 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 = { multiply(multiply(X,Y),Z) =
% multiply(X,multiply(Y,Z)),
% additive_identity add X = X,
% additive_identity add X = X,
% additive_inverse(X) add X = additive_identity,
% additive_inverse(X) add X = additive_identity,
% multiply(X,Y add Z) =
% multiply(X,Y) add multiply(X,Z),
% multiply(X add Y,Z) =
% multiply(X,Z) add multiply(Y,Z) }
% (7 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 = { additive_identity_add_additive_inverse_multiply__1
% =
% additive_identity_add_additive_inverse_multiply__2 }
% (1 equation(s))
% time is now on
%
% Initializing completion ...
% New rule produced : [1] additive_identity add X -> X
% Current number of equations to process: 0
% Current number of ordered equations: 4
% Current number of rules: 1
% New rule produced : [2] additive_inverse(X) add X -> additive_identity
% Current number of equations to process: 0
% Current number of ordered equations: 3
% Current number of rules: 2
% New rule produced :
% [3] multiply(multiply(X,Y),Z) -> multiply(X,multiply(Y,Z))
% Current number of equations to process: 0
% Current number of ordered equations: 2
% Current number of rules: 3
% New rule produced :
% [4] multiply(X,Y add Z) -> multiply(X,Y) add multiply(X,Z)
% Current number of equations to process: 0
% Current number of ordered equations: 1
% Current number of rules: 4
% New rule produced :
% [5] multiply(X add Y,Z) -> multiply(X,Z) add multiply(Y,Z)
% Current number of equations to process: 0
% Current number of ordered equations: 0
% Current number of rules: 5
% New rule produced : [6] additive_inverse(additive_inverse(X)) -> X
% Current number of equations to process: 16
% Current number of ordered equations: 0
% Current number of rules: 6
% New rule produced :
% [7] additive_inverse(additive_identity) -> additive_identity
% Current number of equations to process: 17
% Current number of ordered equations: 0
% Current number of rules: 7
% New rule produced :
% [8] additive_inverse(X add Y) add Y -> additive_inverse(X)
% Current number of equations to process: 14
% Current number of ordered equations: 0
% Current number of rules: 8
% New rule produced :
% [9] multiply(X,additive_identity) add multiply(X,Y) -> multiply(X,Y)
% Current number of equations to process: 13
% Current number of ordered equations: 0
% Current number of rules: 9
% New rule produced :
% [10] multiply(additive_identity,Y) add multiply(X,Y) -> multiply(X,Y)
% Current number of equations to process: 16
% Current number of ordered equations: 0
% Current number of rules: 10
% New rule produced :
% [11] additive_inverse(X add Y) -> additive_inverse(X) add additive_inverse(Y)
% Rule [8] additive_inverse(X add Y) add Y -> additive_inverse(X) collapsed.
% Current number of equations to process: 30
% Current number of ordered equations: 0
% Current number of rules: 10
% New rule produced : [12] multiply(X,additive_identity) -> additive_identity
% Rule [9] multiply(X,additive_identity) add multiply(X,Y) -> multiply(X,Y)
% collapsed.
% Current number of equations to process: 33
% Current number of ordered equations: 0
% Current number of rules: 10
% New rule produced : [13] multiply(additive_identity,X) -> additive_identity
% Rule [10] multiply(additive_identity,Y) add multiply(X,Y) -> multiply(X,Y)
% collapsed.
% Current number of equations to process: 35
% Current number of ordered equations: 0
% Current number of rules: 10
% New rule produced :
% [14] multiply(X,additive_inverse(Y)) add multiply(X,Y) -> additive_identity
% Current number of equations to process: 33
% Current number of ordered equations: 0
% Current number of rules: 11
% New rule produced :
% [15] multiply(X,additive_inverse(Y)) -> additive_inverse(multiply(X,Y))
% Rule
% [14] multiply(X,additive_inverse(Y)) add multiply(X,Y) -> additive_identity
% collapsed.
% Current number of equations to process: 36
% Current number of ordered equations: 0
% Current number of rules: 11
% New rule produced :
% [16]
% multiply(additive_inverse(multiply(X,Y)),Z) ->
% multiply(X,multiply(additive_inverse(Y),Z))
% Current number of equations to process: 34
% Current number of ordered equations: 0
% Current number of rules: 12
% New rule produced :
% [17] multiply(additive_inverse(Y),X) add multiply(Y,X) -> additive_identity
% Current number of equations to process: 33
% Current number of ordered equations: 0
% Current number of rules: 13
% New rule produced :
% [18] multiply(additive_inverse(X),Y) -> additive_inverse(multiply(X,Y))
% Rule
% [16]
% multiply(additive_inverse(multiply(X,Y)),Z) ->
% multiply(X,multiply(additive_inverse(Y),Z)) collapsed.
% Rule
% [17] multiply(additive_inverse(Y),X) add multiply(Y,X) -> additive_identity
% collapsed.
% Current number of equations to process: 36
% Current number of ordered equations: 0
% Current number of rules: 12
% Warning: some conjectures remain
%
% Execution time: 0.040000 sec
% res : bool = false
% time is now off
%
% status : string = "satisfiable"
% % SZS status Satisfiable
% CiME interrupted
%
% EOF
%------------------------------------------------------------------------------