TSTP Solution File: COM010-2 by CiME---2.01
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CiME---2.01
% Problem : COM010-2 : TPTP v6.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_cime %s
% Computer : n142.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:20:11 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 : COM010-2 : TPTP v6.0.0. Released v3.2.0.
% % Command : tptp2X_and_run_cime %s
% % Computer : n142.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:18:53 CDT 2014
% % CPUTime : 1.11
% Processing problem /tmp/CiME_45957_n142.star.cs.uiowa.edu
% #verbose 1;
% let F = signature " v_G,t_a,v_F : constant; c_UNITY_Omk__program : 2; c_Pair : 4; tc_set : 1; tc_prod : 2; c_UNITY_OAllowedActs : 2; c_UNITY_OActs : 2; c_UNITY_OInit : 2;";
% let X = vars "V_y T_a";
% let Axioms = equations F X "
% c_UNITY_OInit(v_F,t_a) = c_UNITY_OInit(v_G,t_a);
% c_UNITY_OActs(v_F,t_a) = c_UNITY_OActs(v_G,t_a);
% c_UNITY_OAllowedActs(v_F,t_a) = c_UNITY_OAllowedActs(v_G,t_a);
% c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(V_y,T_a),c_Pair(c_UNITY_OActs(V_y,T_a),c_UNITY_OAllowedActs(V_y,T_a),tc_set(tc_set(tc_prod(T_a,T_a))),tc_set(tc_set(tc_prod(T_a,T_a)))),tc_set(T_a),tc_prod(tc_set(tc_set(tc_prod(T_a,T_a))),tc_set(tc_set(tc_prod(T_a,T_a))))),T_a) = V_y;
% ";
%
% let s1 = status F "
% c_UNITY_Omk__program lr_lex;
% c_Pair lr_lex;
% tc_set lr_lex;
% tc_prod lr_lex;
% c_UNITY_OAllowedActs lr_lex;
% c_UNITY_OActs lr_lex;
% v_G lr_lex;
% c_UNITY_OInit lr_lex;
% t_a lr_lex;
% v_F lr_lex;
% ";
%
% let p1 = precedence F "
% c_Pair > c_UNITY_OInit > c_UNITY_OActs > c_UNITY_OAllowedActs > tc_prod > c_UNITY_Omk__program > tc_set > v_F > t_a > v_G";
%
% let s2 = status F "
% c_UNITY_Omk__program mul;
% c_Pair mul;
% tc_set mul;
% tc_prod mul;
% c_UNITY_OAllowedActs mul;
% c_UNITY_OActs mul;
% v_G mul;
% c_UNITY_OInit mul;
% t_a mul;
% v_F mul;
% ";
%
% let p2 = precedence F "
% c_Pair > c_UNITY_OInit > c_UNITY_OActs > c_UNITY_OAllowedActs > tc_prod > c_UNITY_Omk__program > tc_set > v_F = t_a = v_G";
%
% let o_auto = AUTO Axioms;
%
% let o = LEX o_auto (LEX (ACRPO s1 p1) (ACRPO s2 p2));
%
% let Conjectures = equations F X " v_F = v_G;"
% ;
% (*
% 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 = { c_UNITY_OInit(v_F,t_a) = c_UNITY_OInit(v_G,t_a),
% c_UNITY_OActs(v_F,t_a) = c_UNITY_OActs(v_G,t_a),
% c_UNITY_OAllowedActs(v_F,t_a) =
% c_UNITY_OAllowedActs(v_G,t_a),
% c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(V_y,T_a),
% c_Pair(c_UNITY_OActs(V_y,T_a),
% c_UNITY_OAllowedActs(V_y,T_a),
% tc_set(tc_set(tc_prod(T_a,T_a))),
% tc_set(tc_set(tc_prod(T_a,T_a)))),
% tc_set(T_a),tc_prod(
% tc_set(
% tc_set(
% tc_prod(T_a,T_a))),
% tc_set(
% tc_set(
% tc_prod(T_a,T_a))))),T_a)
% = V_y } (4 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 = { v_F = v_G } (1 equation(s))
% time is now on
%
% Initializing completion ...
% New rule produced :
% [1] c_UNITY_OAllowedActs(v_F,t_a) -> c_UNITY_OAllowedActs(v_G,t_a)
% Current number of equations to process: 0
% Current number of ordered equations: 3
% Current number of rules: 1
% New rule produced : [2] c_UNITY_OActs(v_F,t_a) -> c_UNITY_OActs(v_G,t_a)
% Current number of equations to process: 0
% Current number of ordered equations: 2
% Current number of rules: 2
% New rule produced : [3] c_UNITY_OInit(v_F,t_a) -> c_UNITY_OInit(v_G,t_a)
% Current number of equations to process: 0
% Current number of ordered equations: 1
% Current number of rules: 3
% New rule produced :
% [4]
% c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(V_y,T_a),c_Pair(c_UNITY_OActs(V_y,T_a),
% c_UNITY_OAllowedActs(V_y,T_a),
% tc_set(tc_set(tc_prod(T_a,T_a))),
% tc_set(tc_set(tc_prod(T_a,T_a)))),
% tc_set(T_a),tc_prod(tc_set(tc_set(tc_prod(T_a,T_a))),
% tc_set(tc_set(tc_prod(T_a,T_a))))),T_a) ->
% V_y
% Current number of equations to process: 0
% Current number of ordered equations: 0
% Current number of rules: 4
% New rule produced : [5] v_F -> v_G
% Rule [1] c_UNITY_OAllowedActs(v_F,t_a) -> c_UNITY_OAllowedActs(v_G,t_a)
% collapsed.
% Rule [2] c_UNITY_OActs(v_F,t_a) -> c_UNITY_OActs(v_G,t_a) collapsed.
% Rule [3] c_UNITY_OInit(v_F,t_a) -> c_UNITY_OInit(v_G,t_a) collapsed.
% 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: 2
% The current conjecture is true and the solution is the identity
% % SZS output start Refutation
%
% The following 3 rules have been used:
% [1]
% c_UNITY_OAllowedActs(v_F,t_a) -> c_UNITY_OAllowedActs(v_G,t_a); trace = in the starting set
% [4] c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(V_y,T_a),c_Pair(c_UNITY_OActs(V_y,T_a),
% c_UNITY_OAllowedActs(V_y,T_a),
% tc_set(tc_set(
% tc_prod(T_a,T_a))),
% tc_set(tc_set(
% tc_prod(T_a,T_a)))),
% tc_set(T_a),tc_prod(tc_set(tc_set(tc_prod(T_a,T_a))),
% tc_set(tc_set(tc_prod(T_a,T_a))))),T_a)
% -> V_y; trace = in the starting set
% [5] v_F -> v_G; trace = Cp of 4 and 1
% % 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
%------------------------------------------------------------------------------