TSTP Solution File: HWC004-1 by CiME---2.01
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CiME---2.01
% Problem : HWC004-1 : TPTP v7.3.0. Released v2.5.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 12:50:32 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 : HWC004-1 : TPTP v7.3.0. Released v2.5.0.
% 0.00/0.04 % Command : tptp2X_and_run_cime %s
% 0.03/0.24 % Computer : n191.star.cs.uiowa.edu
% 0.03/0.24 % Model : x86_64 x86_64
% 0.03/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.24 % Memory : 32218.5MB
% 0.03/0.24 % OS : Linux 3.10.0-862.11.6.el7.x86_64
% 0.03/0.24 % CPULimit : 300
% 0.03/0.24 % DateTime : Thu Feb 21 01:17:00 CST 2019
% 0.03/0.24 % CPUTime :
% 1.17/1.43 Processing problem /tmp/CiME_20976_n191.star.cs.uiowa.edu
% 1.17/1.43 #verbose 1;
% 1.17/1.43 let F = signature " n1,n0 : constant; not : 1; or : 2; and : 2;n0_and_n1_or_not__1, n0_and_n1_or_not__2 : 0;";
% 1.17/1.43 let X = vars "";
% 1.17/1.43 let Axioms = equations F X "
% 1.17/1.43 and(n0,n0) = n0;
% 1.17/1.43 and(n0,n1) = n0;
% 1.17/1.43 and(n1,n0) = n0;
% 1.17/1.43 and(n1,n1) = n1;
% 1.17/1.43 or(n0,n0) = n0;
% 1.17/1.43 or(n0,n1) = n1;
% 1.17/1.43 or(n1,n0) = n1;
% 1.17/1.43 or(n1,n1) = n1;
% 1.17/1.43 not(n0) = n1;
% 1.17/1.43 not(n1) = n0;
% 1.17/1.43 ";
% 1.17/1.43
% 1.17/1.43 let s1 = status F "
% 1.17/1.43 not lr_lex;
% 1.17/1.43 or lr_lex;
% 1.17/1.43 n1 lr_lex;
% 1.17/1.43 and lr_lex;
% 1.17/1.43 n0 lr_lex;
% 1.17/1.43 ";
% 1.17/1.43
% 1.17/1.43 let p1 = precedence F "
% 1.17/1.43 and > or > not > n0 > n1 > n0_and_n1_or_not__1 > n0_and_n1_or_not__2";
% 1.17/1.43
% 1.17/1.43 let s2 = status F "
% 1.17/1.43 not mul;
% 1.17/1.43 or mul;
% 1.17/1.43 n1 mul;
% 1.17/1.43 and mul;
% 1.17/1.43 n0 mul;
% 1.17/1.43 ";
% 1.17/1.43
% 1.17/1.43 let p2 = precedence F "
% 1.17/1.43 and > or > not > n0 = n1 > n0_and_n1_or_not__1 > n0_and_n1_or_not__2";
% 1.17/1.43
% 1.17/1.43 let o_auto = AUTO Axioms;
% 1.17/1.43
% 1.17/1.43 let o = LEX o_auto (LEX (ACRPO s1 p1) (ACRPO s2 p2));
% 1.17/1.43
% 1.17/1.43 let Conjectures = equations F X "n0_and_n1_or_not__1 = n0_and_n1_or_not__2"
% 1.17/1.43 ;
% 1.17/1.43 (*
% 1.17/1.43 let Red_Axioms = normalize_equations Defining_rules Axioms;
% 1.17/1.43
% 1.17/1.43 let Red_Conjectures = normalize_equations Defining_rules Conjectures;
% 1.17/1.43 *)
% 1.17/1.43 #time on;
% 1.17/1.43
% 1.17/1.43 let res = prove_conj_by_ordered_completion o Axioms Conjectures;
% 1.17/1.43
% 1.17/1.43 #time off;
% 1.17/1.43
% 1.17/1.43
% 1.17/1.43 let status = if res then "unsatisfiable" else "satisfiable";
% 1.17/1.43 #quit;
% 1.17/1.43 Verbose level is now 1
% 1.17/1.43
% 1.17/1.43 F : signature = <signature>
% 1.17/1.43 X : variable_set = <variable set>
% 1.17/1.43
% 1.17/1.43 Axioms : (F,X) equations = { and(n0,n0) = n0,
% 1.17/1.43 and(n0,n1) = n0,
% 1.17/1.43 and(n1,n0) = n0,
% 1.17/1.43 and(n1,n1) = n1,
% 1.17/1.43 or(n0,n0) = n0,
% 1.17/1.43 or(n0,n1) = n1,
% 1.17/1.43 or(n1,n0) = n1,
% 1.17/1.43 or(n1,n1) = n1,
% 1.17/1.43 not(n0) = n1,
% 1.17/1.43 not(n1) = n0 } (10 equation(s))
% 1.17/1.43 s1 : F status = <status>
% 1.17/1.43 p1 : F precedence = <precedence>
% 1.17/1.43 s2 : F status = <status>
% 1.17/1.43 p2 : F precedence = <precedence>
% 1.17/1.43 o_auto : F term_ordering = <term ordering>
% 1.17/1.43 o : F term_ordering = <term ordering>
% 1.17/1.43 Conjectures : (F,X) equations = { n0_and_n1_or_not__1 = n0_and_n1_or_not__2 }
% 1.17/1.43 (1 equation(s))
% 1.17/1.43 time is now on
% 1.17/1.43
% 1.17/1.43 Initializing completion ...
% 1.17/1.43 New rule produced : [1] not(n0) -> n1
% 1.17/1.43 Current number of equations to process: 0
% 1.17/1.43 Current number of ordered equations: 9
% 1.17/1.43 Current number of rules: 1
% 1.17/1.43 New rule produced : [2] not(n1) -> n0
% 1.17/1.43 Current number of equations to process: 0
% 1.17/1.43 Current number of ordered equations: 8
% 1.17/1.43 Current number of rules: 2
% 1.17/1.43 New rule produced : [3] or(n0,n0) -> n0
% 1.17/1.43 Current number of equations to process: 0
% 1.17/1.43 Current number of ordered equations: 7
% 1.17/1.43 Current number of rules: 3
% 1.17/1.43 New rule produced : [4] or(n0,n1) -> n1
% 1.17/1.43 Current number of equations to process: 0
% 1.17/1.43 Current number of ordered equations: 6
% 1.17/1.43 Current number of rules: 4
% 1.17/1.43 New rule produced : [5] or(n1,n0) -> n1
% 1.17/1.43 Current number of equations to process: 0
% 1.17/1.43 Current number of ordered equations: 5
% 1.17/1.43 Current number of rules: 5
% 1.17/1.43 New rule produced : [6] or(n1,n1) -> n1
% 1.17/1.43 Current number of equations to process: 0
% 1.17/1.43 Current number of ordered equations: 4
% 1.17/1.43 Current number of rules: 6
% 1.17/1.43 New rule produced : [7] and(n0,n0) -> n0
% 1.17/1.43 Current number of equations to process: 0
% 1.17/1.43 Current number of ordered equations: 3
% 1.17/1.43 Current number of rules: 7
% 1.17/1.43 New rule produced : [8] and(n0,n1) -> n0
% 1.17/1.43 Current number of equations to process: 0
% 1.17/1.43 Current number of ordered equations: 2
% 1.17/1.43 Current number of rules: 8
% 1.17/1.43 New rule produced : [9] and(n1,n0) -> n0
% 1.17/1.43 Current number of equations to process: 0
% 1.17/1.43 Current number of ordered equations: 1
% 1.17/1.43 Current number of rules: 9
% 1.17/1.43 New rule produced : [10] and(n1,n1) -> n1
% 1.17/1.43 Current number of equations to process: 0
% 1.17/1.43 Current number of ordered equations: 0
% 1.17/1.43 Current number of rules: 10
% 1.17/1.43 Warning: some conjectures remain
% 1.17/1.43
% 1.17/1.43 Execution time: 0.000000 sec
% 1.17/1.43 res : bool = false
% 1.17/1.43 time is now off
% 1.17/1.43
% 1.17/1.43 status : string = "satisfiable"
% 1.17/1.43 % SZS status Satisfiable
% 1.17/1.43 CiME interrupted
%------------------------------------------------------------------------------