TSTP Solution File: REL049-1 by CiME---2.01
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CiME---2.01
% Problem : REL049-1 : TPTP v6.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_cime %s
% Computer : n063.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:31:36 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 : REL049-1 : TPTP v6.0.0. Released v4.0.0.
% % Command : tptp2X_and_run_cime %s
% % Computer : n063.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 03:20:53 CDT 2014
% % CPUTime : 1.11
% Processing problem /tmp/CiME_24351_n063.star.cs.uiowa.edu
% #verbose 1;
% let F = signature " join : AC; sk3,sk2,sk1,zero,top,one : constant; converse : 1; composition : 2; meet : 2; complement : 1;";
% let X = vars "A B C";
% let Axioms = equations F X "
% composition(composition(A,B),C) = composition(A,composition(B,C));
% A = complement(complement(A) join complement(B)) join complement(complement(A) join B);
% meet(A,B) = complement(complement(A) join complement(B));
% composition(A,one) = A;
% composition(A join B,C) = composition(A,C) join composition(B,C);
% converse(converse(A)) = A;
% converse(A join B) = converse(A) join converse(B);
% converse(composition(A,B)) = composition(converse(B),converse(A));
% composition(converse(A),complement(composition(A,B))) join complement(B) = complement(B);
% top = A join complement(A);
% zero = meet(A,complement(A));
% sk1 join sk2 = sk2;
% sk3 join sk2 = sk2;
% ";
%
% let s1 = status F "
% sk3 lr_lex;
% sk2 lr_lex;
% sk1 lr_lex;
% zero lr_lex;
% top lr_lex;
% converse lr_lex;
% one lr_lex;
% meet lr_lex;
% complement lr_lex;
% composition mul;
% join mul;
% ";
%
% let p1 = precedence F "
% meet > composition > complement > converse > join > one > top > zero > sk1 > sk2 > sk3";
%
% let s2 = status F "
% sk3 mul;
% sk2 mul;
% sk1 mul;
% zero mul;
% top mul;
% converse mul;
% one mul;
% composition mul;
% meet mul;
% complement mul;
% join mul;
% ";
%
% let p2 = precedence F "
% meet > composition > complement > converse > join > one = top = zero = sk1 = sk2 = sk3";
%
% let o_auto = AUTO Axioms;
%
% let o = LEX o_auto (LEX (ACRPO s1 p1) (ACRPO s2 p2));
%
% let Conjectures = equations F X " (sk1 join sk3) join sk2 = sk2;"
% ;
% (*
% 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 = { composition(composition(A,B),C) =
% composition(A,composition(B,C)),
% A =
% complement(complement(A) join complement(B)) join
% complement(complement(A) join B),
% meet(A,B) =
% complement(complement(A) join complement(B)),
% composition(A,one) = A,
% composition(A join B,C) =
% composition(A,C) join composition(B,C),
% converse(converse(A)) = A,
% converse(A join B) =
% converse(A) join converse(B),
% converse(composition(A,B)) =
% composition(converse(B),converse(A)),
% composition(converse(A),complement(composition(A,B))) join
% complement(B) = complement(B),
% top = complement(A) join A,
% zero = meet(A,complement(A)),
% sk2 join sk1 = sk2,
% sk3 join sk2 = sk2 } (13 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 = { sk3 join sk2 join sk1 = sk2 }
% (1 equation(s))
% time is now on
%
% Initializing completion ...
% New rule produced : [1] converse(converse(A)) -> A
% Current number of equations to process: 0
% Current number of ordered equations: 13
% Current number of rules: 1
% New rule produced : [2] sk2 join sk1 -> sk2
% The conjecture has been reduced.
% Conjecture is now:
% sk3 join sk2 = sk2
%
% Current number of equations to process: 0
% Current number of ordered equations: 12
% Current number of rules: 2
% New rule produced : [3] sk3 join sk2 -> sk2
% The conjecture has been reduced.
% Conjecture is now:
% Trivial
%
% Current number of equations to process: 0
% Current number of ordered equations: 11
% Current number of rules: 3
% The current conjecture is true and the solution is the identity
% % SZS output start Refutation
%
% The following 2 rules have been used:
% [2]
% sk2 join sk1 -> sk2; trace = in the starting set
% [3] sk3 join sk2 -> sk2; 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
%------------------------------------------------------------------------------