TSTP Solution File: RNG007-4 by CiME---2.01
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CiME---2.01
% Problem : RNG007-4 : TPTP v6.0.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_cime %s
% Computer : n087.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:38 EDT 2014
% Result : Unsatisfiable 1.12s
% Output : Refutation 1.12s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : RNG007-4 : TPTP v6.0.0. Released v1.0.0.
% % Command : tptp2X_and_run_cime %s
% % Computer : n087.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:02:28 CDT 2014
% % CPUTime : 1.12
% Processing problem /tmp/CiME_57123_n087.star.cs.uiowa.edu
% #verbose 1;
% let F = signature " add : AC; a,additive_identity : constant; multiply : 2; additive_inverse : 1;";
% 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;
% 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);
% additive_inverse(additive_identity) = additive_identity;
% additive_inverse(additive_inverse(X)) = X;
% multiply(X,additive_identity) = additive_identity;
% multiply(additive_identity,X) = additive_identity;
% additive_inverse(X add Y) = additive_inverse(X) add additive_inverse(Y);
% multiply(X,additive_inverse(Y)) = additive_inverse(multiply(X,Y));
% multiply(additive_inverse(X),Y) = additive_inverse(multiply(X,Y));
% multiply(X,X) = X;
% ";
%
% let s1 = status F "
% a lr_lex;
% additive_inverse lr_lex;
% additive_identity lr_lex;
% multiply mul;
% add mul;
% ";
%
% let p1 = precedence F "
% multiply > additive_inverse > add > additive_identity > a";
%
% let s2 = status F "
% a mul;
% multiply mul;
% additive_inverse mul;
% add mul;
% additive_identity mul;
% ";
%
% let p2 = precedence F "
% multiply > additive_inverse > add > additive_identity = a";
%
% let o_auto = AUTO Axioms;
%
% let o = LEX o_auto (LEX (ACRPO s1 p1) (ACRPO s2 p2));
%
% let Conjectures = equations F X " a add a = additive_identity;"
% ;
% (*
% 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_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),
% additive_inverse(additive_identity) =
% additive_identity,
% additive_inverse(additive_inverse(X)) = X,
% multiply(X,additive_identity) =
% additive_identity,
% multiply(additive_identity,X) =
% additive_identity,
% additive_inverse(X add Y) =
% additive_inverse(X) add additive_inverse(Y),
% multiply(X,additive_inverse(Y)) =
% additive_inverse(multiply(X,Y)),
% multiply(additive_inverse(X),Y) =
% additive_inverse(multiply(X,Y)),
% multiply(X,X) = X } (13 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 = { a add a = additive_identity }
% (1 equation(s))
% time is now on
%
% Initializing completion ...
% New rule produced :
% [1] additive_inverse(additive_identity) -> additive_identity
% Current number of equations to process: 0
% Current number of ordered equations: 12
% Current number of rules: 1
% New rule produced : [2] additive_inverse(additive_inverse(X)) -> X
% Current number of equations to process: 0
% Current number of ordered equations: 11
% Current number of rules: 2
% New rule produced : [3] additive_identity add X -> X
% Current number of equations to process: 0
% Current number of ordered equations: 10
% Current number of rules: 3
% New rule produced : [4] multiply(X,X) -> X
% Current number of equations to process: 0
% Current number of ordered equations: 9
% Current number of rules: 4
% New rule produced : [5] multiply(X,additive_identity) -> additive_identity
% Current number of equations to process: 0
% Current number of ordered equations: 8
% Current number of rules: 5
% New rule produced : [6] multiply(additive_identity,X) -> additive_identity
% Current number of equations to process: 0
% Current number of ordered equations: 7
% Current number of rules: 6
% New rule produced : [7] additive_inverse(X) add X -> additive_identity
% Current number of equations to process: 0
% Current number of ordered equations: 6
% Current number of rules: 7
% New rule produced :
% [8] multiply(X,additive_inverse(Y)) -> additive_inverse(multiply(X,Y))
% Current number of equations to process: 0
% Current number of ordered equations: 5
% Current number of rules: 8
% New rule produced :
% [9] multiply(additive_inverse(X),Y) -> additive_inverse(multiply(X,Y))
% Current number of equations to process: 0
% Current number of ordered equations: 4
% Current number of rules: 9
% New rule produced :
% [10] additive_inverse(X add Y) -> additive_inverse(X) add additive_inverse(Y)
% Current number of equations to process: 0
% Current number of ordered equations: 3
% Current number of rules: 10
% New rule produced :
% [11] 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: 11
% New rule produced :
% [12] 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: 12
% New rule produced :
% [13] 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: 13
% New rule produced : [14] additive_inverse(X) -> X
% Rule [1] additive_inverse(additive_identity) -> additive_identity collapsed.
% Rule [2] additive_inverse(additive_inverse(X)) -> X collapsed.
% Rule [7] additive_inverse(X) add X -> additive_identity collapsed.
% Rule [8] multiply(X,additive_inverse(Y)) -> additive_inverse(multiply(X,Y))
% collapsed.
% Rule [9] multiply(additive_inverse(X),Y) -> additive_inverse(multiply(X,Y))
% collapsed.
% Rule
% [10] additive_inverse(X add Y) -> additive_inverse(X) add additive_inverse(Y)
% collapsed.
% Current number of equations to process: 1
% Current number of ordered equations: 0
% Current number of rules: 8
% New rule produced : [15] X add X -> additive_identity
% The conjecture has been reduced.
% Conjecture is now:
% Trivial
%
% Current number of equations to process: 0
% 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 1 rules have been used:
% [15]
% X add X -> additive_identity; trace = in the starting set
% % SZS output end Refutation
% All conjectures have been proven
%
% Execution time: 0.010000 sec
% res : bool = true
% time is now off
%
% status : string = "unsatisfiable"
% % SZS status Unsatisfiable
% CiME interrupted
%
% EOF
%------------------------------------------------------------------------------