TSTP Solution File: SYN337-10 by CiME---2.01
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CiME---2.01
% Problem : SYN337-10 : TPTP v7.3.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_cime %s
% Computer : n191.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 32218.5MB
% OS : Linux 3.10.0-862.11.6.el7.x86_64
% CPULimit : 300s
% DateTime : Wed Feb 27 15:20:56 EST 2019
% Result : Satisfiable 1.17s
% Output : Assurance 0s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SYN337-10 : TPTP v7.3.0. Released v7.3.0.
% 0.00/0.04 % Command : tptp2X_and_run_cime %s
% 0.04/0.25 % Computer : n191.star.cs.uiowa.edu
% 0.04/0.25 % Model : x86_64 x86_64
% 0.04/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.04/0.25 % Memory : 32218.5MB
% 0.04/0.25 % OS : Linux 3.10.0-862.11.6.el7.x86_64
% 0.04/0.25 % CPULimit : 300
% 0.04/0.25 % DateTime : Tue Feb 26 10:06:11 CST 2019
% 0.04/0.25 % CPUTime:
% 1.17/1.41 Processing problem /tmp/CiME_42035_n191.star.cs.uiowa.edu
% 1.17/1.41 #verbose 1;
% 1.17/1.41 let F = signature " b2,a2,b,true,a : constant; z : 1; f : 2; ifeq : 4;";
% 1.17/1.41 let X = vars "A B C Y";
% 1.17/1.41 let Axioms = equations F X "
% 1.17/1.41 ifeq(A,A,B,C) = B;
% 1.17/1.41 f(a,Y) = true;
% 1.17/1.41 f(z(Y),a) = true;
% 1.17/1.41 f(z(Y),Y) = true;
% 1.17/1.41 ifeq(f(b,Y),true,a2,b2) = b2;
% 1.17/1.41 ifeq(f(b,z(Y)),true,a2,b2) = b2;
% 1.17/1.41 ";
% 1.17/1.41
% 1.17/1.41 let s1 = status F "
% 1.17/1.41 b2 lr_lex;
% 1.17/1.41 a2 lr_lex;
% 1.17/1.41 b lr_lex;
% 1.17/1.41 z lr_lex;
% 1.17/1.41 true lr_lex;
% 1.17/1.41 f lr_lex;
% 1.17/1.41 a lr_lex;
% 1.17/1.41 ifeq lr_lex;
% 1.17/1.41 ";
% 1.17/1.41
% 1.17/1.41 let p1 = precedence F "
% 1.17/1.41 ifeq > f > z > a > true > b > a2 > b2";
% 1.17/1.41
% 1.17/1.41 let s2 = status F "
% 1.17/1.41 b2 mul;
% 1.17/1.41 a2 mul;
% 1.17/1.41 b mul;
% 1.17/1.41 z mul;
% 1.17/1.41 true mul;
% 1.17/1.41 f mul;
% 1.17/1.41 a mul;
% 1.17/1.41 ifeq mul;
% 1.17/1.41 ";
% 1.17/1.41
% 1.17/1.41 let p2 = precedence F "
% 1.17/1.41 ifeq > f > z > a = true = b = a2 = b2";
% 1.17/1.41
% 1.17/1.41 let o_auto = AUTO Axioms;
% 1.17/1.41
% 1.17/1.41 let o = LEX o_auto (LEX (ACRPO s1 p1) (ACRPO s2 p2));
% 1.17/1.41
% 1.17/1.41 let Conjectures = equations F X " a2 = b2;"
% 1.17/1.41 ;
% 1.17/1.41 (*
% 1.17/1.41 let Red_Axioms = normalize_equations Defining_rules Axioms;
% 1.17/1.41
% 1.17/1.41 let Red_Conjectures = normalize_equations Defining_rules Conjectures;
% 1.17/1.41 *)
% 1.17/1.41 #time on;
% 1.17/1.41
% 1.17/1.41 let res = prove_conj_by_ordered_completion o Axioms Conjectures;
% 1.17/1.41
% 1.17/1.41 #time off;
% 1.17/1.41
% 1.17/1.41
% 1.17/1.41 let status = if res then "unsatisfiable" else "satisfiable";
% 1.17/1.41 #quit;
% 1.17/1.41 Verbose level is now 1
% 1.17/1.41
% 1.17/1.41 F : signature = <signature>
% 1.17/1.41 X : variable_set = <variable set>
% 1.17/1.41
% 1.17/1.41 Axioms : (F,X) equations = { ifeq(A,A,B,C) = B,
% 1.17/1.41 f(a,Y) = true,
% 1.17/1.41 f(z(Y),a) = true,
% 1.17/1.41 f(z(Y),Y) = true,
% 1.17/1.41 ifeq(f(b,Y),true,a2,b2) = b2,
% 1.17/1.41 ifeq(f(b,z(Y)),true,a2,b2) = b2 }
% 1.17/1.41 (6 equation(s))
% 1.17/1.41 s1 : F status = <status>
% 1.17/1.41 p1 : F precedence = <precedence>
% 1.17/1.41 s2 : F status = <status>
% 1.17/1.41 p2 : F precedence = <precedence>
% 1.17/1.41 o_auto : F term_ordering = <term ordering>
% 1.17/1.41 o : F term_ordering = <term ordering>
% 1.17/1.41 Conjectures : (F,X) equations = { a2 = b2 } (1 equation(s))
% 1.17/1.41 time is now on
% 1.17/1.41
% 1.17/1.41 Initializing completion ...
% 1.17/1.41 New rule produced : [1] f(a,Y) -> true
% 1.17/1.41 Current number of equations to process: 0
% 1.17/1.41 Current number of ordered equations: 5
% 1.17/1.41 Current number of rules: 1
% 1.17/1.41 New rule produced : [2] f(z(Y),a) -> true
% 1.17/1.41 Current number of equations to process: 0
% 1.17/1.41 Current number of ordered equations: 4
% 1.17/1.41 Current number of rules: 2
% 1.17/1.41 New rule produced : [3] f(z(Y),Y) -> true
% 1.17/1.41 Current number of equations to process: 0
% 1.17/1.41 Current number of ordered equations: 3
% 1.17/1.41 Current number of rules: 3
% 1.17/1.41 New rule produced : [4] ifeq(A,A,B,C) -> B
% 1.17/1.41 Current number of equations to process: 0
% 1.17/1.41 Current number of ordered equations: 2
% 1.17/1.41 Current number of rules: 4
% 1.17/1.41 New rule produced : [5] ifeq(f(b,Y),true,a2,b2) -> b2
% 1.17/1.41 Current number of equations to process: 0
% 1.17/1.41 Current number of ordered equations: 0
% 1.17/1.41 Current number of rules: 5
% 1.17/1.41 Warning: some conjectures remain
% 1.17/1.41
% 1.17/1.41 Execution time: 0.000000 sec
% 1.17/1.41 res : bool = false
% 1.17/1.41 time is now off
% 1.17/1.41
% 1.17/1.41 status : string = "satisfiable"
% 1.17/1.41 % SZS status Satisfiable
% 1.17/1.41 CiME interrupted
%------------------------------------------------------------------------------