TSTP Solution File: GRP557-1 by CiME---2.01
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CiME---2.01
% Problem : GRP557-1 : TPTP v6.0.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_cime %s
% Computer : n116.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:23:28 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 : GRP557-1 : TPTP v6.0.0. Released v2.6.0.
% % Command : tptp2X_and_run_cime %s
% % Computer : n116.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 19:29:48 CDT 2014
% % CPUTime : 1.12
% Processing problem /tmp/CiME_12034_n116.star.cs.uiowa.edu
% #verbose 1;
% let F = signature " b1,a1 : constant; multiply : 2; inverse : 1; divide : 2;";
% let X = vars "A B C";
% let Axioms = equations F X "
% divide(A,inverse(divide(divide(B,C),divide(A,C)))) = B;
% multiply(A,B) = divide(A,inverse(B));
% ";
%
% let s1 = status F "
% b1 lr_lex;
% a1 lr_lex;
% multiply lr_lex;
% inverse lr_lex;
% divide lr_lex;
% ";
%
% let p1 = precedence F "
% multiply > divide > inverse > a1 > b1";
%
% let s2 = status F "
% b1 mul;
% a1 mul;
% multiply mul;
% inverse mul;
% divide mul;
% ";
%
% let p2 = precedence F "
% multiply > divide > inverse > a1 = b1";
%
% let o_auto = AUTO Axioms;
%
% let o = LEX o_auto (LEX (ACRPO s1 p1) (ACRPO s2 p2));
%
% let Conjectures = equations F X " multiply(inverse(a1),a1) = multiply(inverse(b1),b1);"
% ;
% (*
% 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 = { divide(A,inverse(divide(divide(B,C),divide(A,C))))
% = B,
% multiply(A,B) = divide(A,inverse(B)) }
% (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(inverse(a1),a1) =
% multiply(inverse(b1),b1) } (1 equation(s))
% time is now on
%
% Initializing completion ...
% New rule produced : [1] multiply(A,B) -> divide(A,inverse(B))
% The conjecture has been reduced.
% Conjecture is now:
% divide(inverse(a1),inverse(a1)) = divide(inverse(b1),inverse(b1))
%
% Current number of equations to process: 0
% Current number of ordered equations: 1
% Current number of rules: 1
% New rule produced :
% [2] divide(A,inverse(divide(divide(B,C),divide(A,C)))) -> B
% Current number of equations to process: 0
% Current number of ordered equations: 0
% Current number of rules: 2
% New rule produced :
% [3]
% divide(A,inverse(divide(B,divide(A,inverse(divide(divide(B,C),divide(V_3,C)))))))
% -> V_3
% Current number of equations to process: 0
% Current number of ordered equations: 1
% Current number of rules: 3
% New rule produced :
% [4]
% divide(A,inverse(divide(divide(B,inverse(divide(divide(C,V_3),divide(A,V_3)))),C)))
% -> B
% Current number of equations to process: 0
% Current number of ordered equations: 0
% Current number of rules: 4
% New rule produced : [5] divide(A,inverse(divide(B,B))) -> A
% Current number of equations to process: 5
% Current number of ordered equations: 0
% Current number of rules: 5
% New rule produced : [6] divide(A,inverse(inverse(divide(B,B)))) -> A
% Current number of equations to process: 12
% Current number of ordered equations: 0
% Current number of rules: 6
% New rule produced : [7] divide(A,inverse(divide(B,A))) -> B
% Current number of equations to process: 12
% Current number of ordered equations: 0
% Current number of rules: 7
% New rule produced :
% [8] divide(A,inverse(inverse(inverse(inverse(divide(B,B)))))) -> A
% Current number of equations to process: 15
% Current number of ordered equations: 0
% Current number of rules: 8
% New rule produced : [9] divide(inverse(divide(A,B)),inverse(A)) -> B
% Current number of equations to process: 19
% Current number of ordered equations: 0
% Current number of rules: 9
% New rule produced :
% [10] divide(A,inverse(inverse(inverse(divide(B,B))))) -> A
% Current number of equations to process: 21
% Current number of ordered equations: 0
% Current number of rules: 10
% New rule produced :
% [11] divide(divide(A,B),inverse(divide(C,divide(C,B)))) -> A
% Current number of equations to process: 24
% Current number of ordered equations: 0
% Current number of rules: 11
% New rule produced : [12] divide(inverse(divide(A,A)),inverse(B)) -> B
% Current number of equations to process: 29
% Current number of ordered equations: 0
% Current number of rules: 12
% New rule produced :
% [13] divide(inverse(inverse(divide(A,A))),inverse(B)) -> B
% Current number of equations to process: 28
% Current number of ordered equations: 0
% Current number of rules: 13
% New rule produced :
% [14] divide(A,inverse(divide(divide(B,C),B))) -> divide(A,C)
% Current number of equations to process: 28
% Current number of ordered equations: 0
% Current number of rules: 14
% New rule produced :
% [15] divide(A,inverse(divide(B,divide(A,inverse(divide(B,C)))))) -> C
% Current number of equations to process: 27
% Current number of ordered equations: 0
% Current number of rules: 15
% New rule produced :
% [16] divide(A,inverse(divide(divide(B,inverse(divide(C,A))),C))) -> B
% Current number of equations to process: 26
% Current number of ordered equations: 0
% Current number of rules: 16
% New rule produced :
% [17] divide(inverse(divide(divide(A,B),divide(C,B))),inverse(A)) -> C
% Current number of equations to process: 21
% Current number of ordered equations: 0
% Current number of rules: 17
% New rule produced :
% [18] divide(inverse(A),inverse(inverse(divide(B,A)))) -> inverse(B)
% Current number of equations to process: 28
% Current number of ordered equations: 0
% Current number of rules: 18
% New rule produced :
% [19] divide(A,inverse(inverse(inverse(inverse(inverse(divide(B,B))))))) -> A
% Current number of equations to process: 27
% Current number of ordered equations: 0
% Current number of rules: 19
% New rule produced :
% [20] divide(inverse(inverse(inverse(inverse(divide(A,A))))),inverse(B)) -> B
% Current number of equations to process: 26
% Current number of ordered equations: 0
% Current number of rules: 20
% New rule produced :
% [21]
% inverse(divide(divide(A,C),divide(B,C))) -> divide(inverse(A),inverse(B))
% Rule [2] divide(A,inverse(divide(divide(B,C),divide(A,C)))) -> B collapsed.
% Rule
% [3]
% divide(A,inverse(divide(B,divide(A,inverse(divide(divide(B,C),divide(V_3,C)))))))
% -> V_3 collapsed.
% Rule
% [4]
% divide(A,inverse(divide(divide(B,inverse(divide(divide(C,V_3),divide(A,V_3)))),C)))
% -> B collapsed.
% Rule [17] divide(inverse(divide(divide(A,B),divide(C,B))),inverse(A)) -> C
% collapsed.
% Current number of equations to process: 29
% Current number of ordered equations: 0
% Current number of rules: 17
% New rule produced : [22] divide(A,divide(inverse(B),inverse(A))) -> B
% Current number of equations to process: 28
% Current number of ordered equations: 0
% Current number of rules: 18
% New rule produced : [23] inverse(divide(divide(A,A),B)) -> B
% Current number of equations to process: 29
% Current number of ordered equations: 0
% Current number of rules: 19
% New rule produced :
% [24] inverse(divide(B,B)) <-> divide(inverse(A),inverse(A))
% Current number of equations to process: 28
% Current number of ordered equations: 1
% Current number of rules: 20
% Rule [24] inverse(divide(B,B)) <-> divide(inverse(A),inverse(A)) is composed into
% [24] inverse(divide(B,B)) <-> inverse(divide(b1,b1))
% New rule produced :
% [25] divide(inverse(A),inverse(A)) <-> inverse(divide(B,B))
% The conjecture has been reduced.
% Conjecture is now:
% Trivial
%
% Current number of equations to process: 28
% Current number of ordered equations: 0
% Current number of rules: 21
% The current conjecture is true and the solution is the identity
% % SZS output start Refutation
%
% The following 7 rules have been used:
% [1]
% multiply(A,B) -> divide(A,inverse(B)); trace = in the starting set
% [2] divide(A,inverse(divide(divide(B,C),divide(A,C)))) -> B; trace = in the starting set
% [3] divide(A,inverse(divide(B,divide(A,inverse(divide(divide(B,C),divide(V_3,C)))))))
% -> V_3; trace = Self cp of 2
% [5] divide(A,inverse(divide(B,B))) -> A; trace = Cp of 3 and 2
% [7] divide(A,inverse(divide(B,A))) -> B; trace = Cp of 5 and 2
% [9] divide(inverse(divide(A,B)),inverse(A)) -> B; trace = Self cp of 7
% [25] divide(inverse(A),inverse(A)) <-> inverse(divide(B,B)); trace = Cp of 9 and 5
% % 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
%------------------------------------------------------------------------------