TSTP Solution File: GRP451-1 by CiME---2.01
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CiME---2.01
% Problem : GRP451-1 : TPTP v6.0.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_cime %s
% Computer : n138.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:12 EDT 2014
% Result : Unsatisfiable 1.11s
% Output : Refutation 1.11s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : GRP451-1 : TPTP v6.0.0. Released v2.6.0.
% % Command : tptp2X_and_run_cime %s
% % Computer : n138.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 13:45:43 CDT 2014
% % CPUTime : 1.11
% Processing problem /tmp/CiME_33634_n138.star.cs.uiowa.edu
% #verbose 1;
% let F = signature " b1,a1 : constant; inverse : 1; multiply : 2; divide : 2;";
% let X = vars "A B C";
% let Axioms = equations F X "
% divide(divide(divide(A,A),divide(A,divide(B,divide(divide(divide(A,A),A),C)))),C) = B;
% multiply(A,B) = divide(A,divide(divide(C,C),B));
% inverse(A) = divide(divide(B,B),A);
% ";
%
% let s1 = status F "
% b1 lr_lex;
% a1 lr_lex;
% inverse lr_lex;
% multiply lr_lex;
% divide lr_lex;
% ";
%
% let p1 = precedence F "
% multiply > inverse > divide > a1 > b1";
%
% let s2 = status F "
% b1 mul;
% a1 mul;
% inverse mul;
% multiply mul;
% divide mul;
% ";
%
% let p2 = precedence F "
% multiply > inverse > divide > 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(divide(divide(A,A),divide(A,divide(B,
% divide(
% divide(
% divide(A,A),A),C)))),C)
% = B,
% multiply(A,B) = divide(A,divide(divide(C,C),B)),
% inverse(A) = divide(divide(B,B),A) }
% (3 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] inverse(A) <-> divide(divide(B,B),A)
% The conjecture has been reduced.
% Conjecture is now:
% multiply(divide(divide(b1,b1),a1),a1) = multiply(divide(divide(b1,b1),b1),b1)
%
% Current number of equations to process: 1
% Current number of ordered equations: 3
% Current number of rules: 1
% New rule produced : [2] divide(divide(B,B),A) <-> divide(divide(b1,b1),A)
% Current number of equations to process: 0
% Current number of ordered equations: 4
% Current number of rules: 2
% New rule produced : [3] divide(divide(b1,b1),A) <-> divide(divide(B,B),A)
% Current number of equations to process: 0
% Current number of ordered equations: 3
% Current number of rules: 3
% New rule produced : [4] multiply(A,B) <-> divide(A,divide(divide(C,C),B))
% The conjecture has been reduced.
% Conjecture is now:
% divide(divide(divide(b1,b1),a1),divide(divide(b1,b1),a1)) = divide(divide(
% divide(b1,b1),b1),
% divide(divide(b1,b1),b1))
%
% Current number of equations to process: 2
% Current number of ordered equations: 1
% Current number of rules: 4
% New rule produced :
% [5]
% divide(divide(divide(A,A),divide(A,divide(B,divide(divide(divide(A,A),A),C)))),C)
% -> B
% Current number of equations to process: 2
% Current number of ordered equations: 0
% Current number of rules: 5
% New rule produced :
% [6] divide(divide(divide(b1,b1),divide(A,A)),B) -> divide(divide(b1,b1),B)
% Current number of equations to process: 1
% Current number of ordered equations: 0
% Current number of rules: 6
% New rule produced :
% [7] divide(divide(divide(A,A),divide(b1,b1)),B) -> divide(divide(b1,b1),B)
% Current number of equations to process: 0
% Current number of ordered equations: 0
% Current number of rules: 7
% New rule produced : [8] divide(A,A) <-> divide(b1,b1)
% Rule [2] divide(divide(B,B),A) <-> divide(divide(b1,b1),A) collapsed.
% The conjecture has been reduced.
% Conjecture is now:
% Trivial
%
% Current number of equations to process: 4
% 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 5 rules have been used:
% [1]
% inverse(A) <-> divide(divide(B,B),A); trace = in the starting set
% [2] divide(divide(B,B),A) <-> divide(divide(b1,b1),A); trace = in the starting set
% [4] multiply(A,B) <-> divide(A,divide(divide(C,C),B)); trace = in the starting set
% [5] divide(divide(divide(A,A),divide(A,divide(B,divide(divide(divide(A,A),A),C)))),C)
% -> B; trace = in the starting set
% [8] divide(A,A) <-> divide(b1,b1); trace = Cp of 5 and 2
% % SZS output end Refutation
% All conjectures have been proven
%
% Execution time: 0.000000 sec
% res : bool = true
% time is now off
%
% status : string = "unsatisfiable"
% % SZS status Unsatisfiable
% CiME interrupted
%
% EOF
%------------------------------------------------------------------------------