TSTP Solution File: SWV262-2 by CiME---2.01
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CiME---2.01
% Problem : SWV262-2 : TPTP v6.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_cime %s
% Computer : n139.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:36:58 EDT 2014
% Result : Unsatisfiable 1.09s
% Output : Refutation 1.09s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : SWV262-2 : TPTP v6.0.0. Released v3.2.0.
% % Command : tptp2X_and_run_cime %s
% % Computer : n139.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 05:57:38 CDT 2014
% % CPUTime : 1.09
% Processing problem /tmp/CiME_59236_n139.star.cs.uiowa.edu
% #verbose 1;
% let F = signature " c_emptyset,tc_Message_Omsg,v_H,v_Y,v_X : constant; c_union : 3; c_Message_Oparts : 1; c_insert : 3;";
% let X = vars "V_G V_H V_y T_a V_a V_B V_C";
% let Axioms = equations F X "
% c_Message_Oparts(c_union(V_G,V_H,tc_Message_Omsg)) = c_union(c_Message_Oparts(V_G),c_Message_Oparts(V_H),tc_Message_Omsg);
% c_union(c_emptyset,V_y,T_a) = V_y;
% c_union(c_insert(V_a,V_B,T_a),V_C,T_a) = c_insert(V_a,c_union(V_B,V_C,T_a),T_a);
% ";
%
% let s1 = status F "
% c_union lr_lex;
% c_emptyset lr_lex;
% c_Message_Oparts lr_lex;
% c_insert lr_lex;
% tc_Message_Omsg lr_lex;
% v_H lr_lex;
% v_Y lr_lex;
% v_X lr_lex;
% ";
%
% let p1 = precedence F "
% c_insert > c_union > c_Message_Oparts > v_X > v_Y > v_H > tc_Message_Omsg > c_emptyset";
%
% let s2 = status F "
% c_union mul;
% c_emptyset mul;
% c_Message_Oparts mul;
% c_insert mul;
% tc_Message_Omsg mul;
% v_H mul;
% v_Y mul;
% v_X mul;
% ";
%
% let p2 = precedence F "
% c_insert > c_union > c_Message_Oparts > v_X = v_Y = v_H = tc_Message_Omsg = c_emptyset";
%
% let o_auto = AUTO Axioms;
%
% let o = LEX o_auto (LEX (ACRPO s1 p1) (ACRPO s2 p2));
%
% let Conjectures = equations F X " c_Message_Oparts(c_insert(v_X,c_insert(v_Y,v_H,tc_Message_Omsg),tc_Message_Omsg)) = c_union(c_union(c_Message_Oparts(c_insert(v_X,c_emptyset,tc_Message_Omsg)),c_Message_Oparts(c_insert(v_Y,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg),c_Message_Oparts(v_H),tc_Message_Omsg);"
% ;
% (*
% 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_Message_Oparts(c_union(V_G,V_H,tc_Message_Omsg))
% =
% c_union(c_Message_Oparts(V_G),c_Message_Oparts(V_H),tc_Message_Omsg),
% c_union(c_emptyset,V_y,T_a) = V_y,
% c_union(c_insert(V_a,V_B,T_a),V_C,T_a) =
% c_insert(V_a,c_union(V_B,V_C,T_a),T_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 = { c_Message_Oparts(c_insert(v_X,c_insert(v_Y,v_H,tc_Message_Omsg),tc_Message_Omsg))
% =
% c_union(c_union(c_Message_Oparts(c_insert(v_X,c_emptyset,tc_Message_Omsg)),
% c_Message_Oparts(c_insert(v_Y,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg),
% c_Message_Oparts(v_H),tc_Message_Omsg) }
% (1 equation(s))
% time is now on
%
% Initializing completion ...
% New rule produced : [1] c_union(c_emptyset,V_y,T_a) -> V_y
% Current number of equations to process: 0
% Current number of ordered equations: 2
% Current number of rules: 1
% New rule produced :
% [2]
% c_union(c_Message_Oparts(V_G),c_Message_Oparts(V_H),tc_Message_Omsg) ->
% c_Message_Oparts(c_union(V_G,V_H,tc_Message_Omsg))
% The conjecture has been reduced.
% Conjecture is now:
% c_Message_Oparts(c_insert(v_X,c_insert(v_Y,v_H,tc_Message_Omsg),tc_Message_Omsg)) =
% c_Message_Oparts(c_union(c_union(c_insert(v_X,c_emptyset,tc_Message_Omsg),
% c_insert(v_Y,c_emptyset,tc_Message_Omsg),tc_Message_Omsg),v_H,tc_Message_Omsg))
%
% Current number of equations to process: 0
% Current number of ordered equations: 1
% Current number of rules: 2
% New rule produced :
% [3]
% c_insert(V_a,c_union(V_B,V_C,T_a),T_a) ->
% c_union(c_insert(V_a,V_B,T_a),V_C,T_a)
% Current number of equations to process: 0
% Current number of ordered equations: 0
% Current number of rules: 3
% New rule produced :
% [4] c_insert(V_G,V_H,V_y) <-> c_union(c_insert(V_G,c_emptyset,V_y),V_H,V_y)
% Rule
% [3]
% c_insert(V_a,c_union(V_B,V_C,T_a),T_a) ->
% c_union(c_insert(V_a,V_B,T_a),V_C,T_a) collapsed.
% The conjecture has been reduced.
% Conjecture is now:
% c_Message_Oparts(c_union(c_insert(v_X,c_emptyset,tc_Message_Omsg),c_union(
% c_insert(v_Y,c_emptyset,tc_Message_Omsg),v_H,tc_Message_Omsg),tc_Message_Omsg)) =
% c_Message_Oparts(c_union(c_union(c_insert(v_X,c_emptyset,tc_Message_Omsg),
% c_insert(v_Y,c_emptyset,tc_Message_Omsg),tc_Message_Omsg),v_H,tc_Message_Omsg))
%
% Current number of equations to process: 1
% Current number of ordered equations: 0
% Current number of rules: 3
% New rule produced :
% [5]
% c_union(c_insert(V_a,V_B,T_a),V_C,T_a) <->
% c_union(c_insert(V_a,c_emptyset,T_a),c_union(V_B,V_C,T_a),T_a)
% Current number of equations to process: 0
% Current number of ordered equations: 1
% Current number of rules: 4
% New rule produced :
% [6]
% c_union(c_insert(V_a,c_emptyset,T_a),c_union(V_B,V_C,T_a),T_a) <->
% c_union(c_insert(V_a,V_B,T_a),V_C,T_a)
% Current number of equations to process: 0
% Current number of ordered equations: 0
% Current number of rules: 5
% New rule produced :
% [7]
% c_union(c_union(c_insert(V_G,c_emptyset,V_H),V_y,V_H),T_a,V_H) ->
% c_union(c_insert(V_G,c_emptyset,V_H),c_union(V_y,T_a,V_H),V_H)
% 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: 6
% The current conjecture is true and the solution is the identity
% % SZS output start Refutation
%
% The following 6 rules have been used:
% [1]
% c_union(c_emptyset,V_y,T_a) -> V_y; trace = in the starting set
% [2] c_union(c_Message_Oparts(V_G),c_Message_Oparts(V_H),tc_Message_Omsg) ->
% c_Message_Oparts(c_union(V_G,V_H,tc_Message_Omsg)); trace = in the starting set
% [3] c_insert(V_a,c_union(V_B,V_C,T_a),T_a) ->
% c_union(c_insert(V_a,V_B,T_a),V_C,T_a); trace = in the starting set
% [4] c_insert(V_G,V_H,V_y) <-> c_union(c_insert(V_G,c_emptyset,V_y),V_H,V_y); trace = Cp of 3 and 1
% [5] c_union(c_insert(V_a,V_B,T_a),V_C,T_a) <->
% c_union(c_insert(V_a,c_emptyset,T_a),c_union(V_B,V_C,T_a),T_a); trace = in the starting set
% [7] c_union(c_union(c_insert(V_G,c_emptyset,V_H),V_y,V_H),T_a,V_H) ->
% c_union(c_insert(V_G,c_emptyset,V_H),c_union(V_y,T_a,V_H),V_H); trace = Cp of 5 and 4
% % 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
%------------------------------------------------------------------------------