TSTP Solution File: SWV818-1 by CiME---2.01
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CiME---2.01
% Problem : SWV818-1 : TPTP v6.0.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_cime %s
% Computer : n154.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:37:53 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 : SWV818-1 : TPTP v6.0.0. Released v4.1.0.
% % Command : tptp2X_and_run_cime %s
% % Computer : n154.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 : Sat Jun 7 02:10:03 CDT 2014
% % CPUTime : 1.14
% Processing problem /tmp/CiME_10997_n154.star.cs.uiowa.edu
% #verbose 1;
% let F = signature " v_ta,v_t,t_a,v_x,v_s : constant; c_Code__Evaluation_Otracing : 3;";
% let X = vars "V_s V_x T_a";
% let Axioms = equations F X "
% c_Code__Evaluation_Otracing(V_s,V_x,T_a) = V_x;
% c_Code__Evaluation_Otracing(v_s,v_x,t_a) = v_x;
% V_s = v_ta;
% ";
%
% let s1 = status F "
% v_ta lr_lex;
% v_t lr_lex;
% t_a lr_lex;
% v_x lr_lex;
% v_s lr_lex;
% c_Code__Evaluation_Otracing lr_lex;
% ";
%
% let p1 = precedence F "
% c_Code__Evaluation_Otracing > v_s > v_x > t_a > v_t > v_ta";
%
% let s2 = status F "
% v_ta mul;
% v_t mul;
% t_a mul;
% v_x mul;
% v_s mul;
% c_Code__Evaluation_Otracing mul;
% ";
%
% let p2 = precedence F "
% c_Code__Evaluation_Otracing > v_s = v_x = t_a = v_t = v_ta";
%
% let o_auto = AUTO Axioms;
%
% let o = LEX o_auto (LEX (ACRPO s1 p1) (ACRPO s2 p2));
%
% let Conjectures = equations F X " v_s = v_t;"
% ;
% (*
% 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_Code__Evaluation_Otracing(V_s,V_x,T_a) = V_x,
% c_Code__Evaluation_Otracing(v_s,v_x,t_a) = v_x,
% V_s = v_ta } (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 = { v_s = v_t } (1 equation(s))
% time is now on
%
% Initializing completion ...
% New rule produced : [1] V_s <-> v_ta
% The conjecture has been reduced.
% Conjecture is now:
% Trivial
%
% Current number of equations to process: 1
% Current number of ordered equations: 1
% Current number of rules: 1
% The current conjecture is true and the solution is the identity
% % SZS output start Refutation
%
% The following 1 rules have been used:
% [1]
% V_s <-> v_ta; trace = in the starting set
% % 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
%------------------------------------------------------------------------------