%------------------------------------------------------------------------------
% File : CiME---2.01
% Problem : GRP195-1 : TPTP v6.0.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_cime %s
% Computer : n123.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:22:37 EDT 2014
% Result : Unsatisfiable 1.14s
% Output : Refutation 1.14s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : GRP195-1 : TPTP v6.0.0. Released v2.2.0.
% % Command : tptp2X_and_run_cime %s
% % Computer : n123.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 : Fri Jun 6 07:22:28 CDT 2014
% % CPUTime : 1.14
% Processing problem /tmp/CiME_19794_n123.star.cs.uiowa.edu
% #verbose 1;
% let F = signature " b,a : constant; multiply : 2;";
% let X = vars "X Y Z";
% let Axioms = equations F X "
% multiply(multiply(X,Y),Z) = multiply(X,multiply(Y,Z));
% multiply(X,multiply(Y,Y)) = multiply(Y,multiply(Y,X));
% ";
%
% let s1 = status F "
% b lr_lex;
% a lr_lex;
% multiply lr_lex;
% ";
%
% let p1 = precedence F "
% multiply > a > b";
%
% let s2 = status F "
% b mul;
% a mul;
% multiply mul;
% ";
%
% let p2 = precedence F "
% multiply > a = b";
%
% let o_auto = AUTO Axioms;
%
% let o = LEX o_auto (LEX (ACRPO s1 p1) (ACRPO s2 p2));
%
% let Conjectures = equations F X " multiply(a,multiply(b,multiply(a,multiply(b,multiply(a,multiply(b,multiply(a,b))))))) = multiply(a,multiply(a,multiply(a,multiply(a,multiply(b,multiply(b,multiply(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 = { multiply(multiply(X,Y),Z) =
% multiply(X,multiply(Y,Z)),
% multiply(X,multiply(Y,Y)) =
% multiply(Y,multiply(Y,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 = { multiply(a,multiply(b,multiply(a,multiply(b,
% multiply(a,
% multiply(b,
% multiply(a,b)))))))
% =
% multiply(a,multiply(a,multiply(a,multiply(a,
% multiply(b,
% multiply(b,
% multiply(b,b))))))) }
% (1 equation(s))
% time is now on
%
% Initializing completion ...
% New rule produced :
% [1] multiply(X,multiply(Y,Y)) <-> multiply(Y,multiply(Y,X))
% Current number of equations to process: 0
% Current number of ordered equations: 2
% Current number of rules: 1
% New rule produced :
% [2] multiply(Y,multiply(Y,X)) <-> multiply(X,multiply(Y,Y))
% Current number of equations to process: 0
% Current number of ordered equations: 1
% 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: 0
% Current number of rules: 3
% New rule produced :
% [4]
% multiply(X,multiply(Y,multiply(Y,X))) <->
% multiply(Y,multiply(Y,multiply(X,X)))
% Current number of equations to process: 6
% Current number of ordered equations: 1
% Current number of rules: 4
% New rule produced :
% [5]
% multiply(Y,multiply(Y,multiply(X,X))) <->
% multiply(X,multiply(Y,multiply(Y,X)))
% Current number of equations to process: 6
% Current number of ordered equations: 0
% Current number of rules: 5
% New rule produced :
% [6]
% multiply(X,multiply(X,multiply(Y,Z))) <->
% multiply(Y,multiply(Z,multiply(X,X)))
% Current number of equations to process: 19
% Current number of ordered equations: 3
% Current number of rules: 6
% New rule produced :
% [7]
% multiply(X,multiply(X,multiply(Y,Z))) <->
% multiply(Y,multiply(X,multiply(X,Z)))
% Rule
% [5]
% multiply(Y,multiply(Y,multiply(X,X))) <->
% multiply(X,multiply(Y,multiply(Y,X))) collapsed.
% The conjecture has been reduced.
% Conjecture is now:
% multiply(a,multiply(b,multiply(a,multiply(b,multiply(a,multiply(b,multiply(a,b))))))) =
% multiply(b,multiply(b,multiply(b,multiply(b,multiply(a,multiply(a,multiply(a,a)))))))
%
% Current number of equations to process: 19
% Current number of ordered equations: 2
% Current number of rules: 6
% New rule produced :
% [8]
% multiply(Y,multiply(Z,multiply(X,X))) <->
% multiply(X,multiply(X,multiply(Y,Z)))
% Current number of equations to process: 28
% Current number of ordered equations: 1
% Current number of rules: 7
% New rule produced :
% [9]
% multiply(Y,multiply(X,multiply(X,Z))) <->
% multiply(X,multiply(X,multiply(Y,Z)))
% Rule
% [4]
% multiply(X,multiply(Y,multiply(Y,X))) <->
% multiply(Y,multiply(Y,multiply(X,X))) collapsed.
% Current number of equations to process: 28
% Current number of ordered equations: 0
% Current number of rules: 7
% New rule produced :
% [10]
% multiply(X,multiply(Y,multiply(Y,X))) <->
% multiply(Y,multiply(X,multiply(X,Y)))
% Current number of equations to process: 57
% Current number of ordered equations: 0
% Current number of rules: 8
% New rule produced :
% [11]
% multiply(X,multiply(Y,multiply(Y,multiply(Y,Y)))) <->
% multiply(Y,multiply(Y,multiply(Y,multiply(Y,X))))
% Current number of equations to process: 74
% Current number of ordered equations: 1
% Current number of rules: 9
% New rule produced :
% [12]
% multiply(Y,multiply(Y,multiply(Y,multiply(Y,X)))) <->
% multiply(X,multiply(Y,multiply(Y,multiply(Y,Y))))
% Current number of equations to process: 77
% Current number of ordered equations: 0
% Current number of rules: 10
% New rule produced :
% [13]
% multiply(X,multiply(Y,multiply(Z,multiply(Y,Z)))) <->
% multiply(Y,multiply(Z,multiply(Y,multiply(Z,X))))
% Rule
% [11]
% multiply(X,multiply(Y,multiply(Y,multiply(Y,Y)))) <->
% multiply(Y,multiply(Y,multiply(Y,multiply(Y,X)))) collapsed.
% Current number of equations to process: 100
% Current number of ordered equations: 1
% Current number of rules: 10
% New rule produced :
% [14]
% multiply(Y,multiply(Z,multiply(Y,multiply(Z,X)))) <->
% multiply(X,multiply(Y,multiply(Z,multiply(Y,Z))))
% Rule
% [12]
% multiply(Y,multiply(Y,multiply(Y,multiply(Y,X)))) <->
% multiply(X,multiply(Y,multiply(Y,multiply(Y,Y)))) collapsed.
% The conjecture has been reduced.
% Conjecture is now:
% Trivial
%
% Current number of equations to process: 105
% Current number of ordered equations: 0
% Current number of rules: 10
% The current conjecture is true and the solution is the identity
% % SZS output start Refutation
%
% The following 4 rules have been used:
% [1]
% multiply(X,multiply(Y,Y)) <-> multiply(Y,multiply(Y,X)); trace = in the starting set
% [3] multiply(multiply(X,Y),Z) -> multiply(X,multiply(Y,Z)); trace = in the starting set
% [7] multiply(X,multiply(X,multiply(Y,Z))) <->
% multiply(Y,multiply(X,multiply(X,Z))); trace = Cp of 3 and 1
% [14] multiply(Y,multiply(Z,multiply(Y,multiply(Z,X)))) <->
% multiply(X,multiply(Y,multiply(Z,multiply(Y,Z)))); trace = Cp of 3 and 1
% % SZS output end Refutation
% All conjectures have been proven
%
% Execution time: 0.040000 sec
% res : bool = true
% time is now off
%
% status : string = "unsatisfiable"
% % SZS status Unsatisfiable
% CiME interrupted
%
% EOF
%------------------------------------------------------------------------------