TSTP Solution File: LCL905-1 by CiME---2.01
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CiME---2.01
% Problem : LCL905-1 : TPTP v6.4.0. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_cime %s
% Computer : n025.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 16091.75MB
% OS : Linux 3.10.0-327.10.1.el7.x86_64
% CPULimit : 300s
% DateTime : Mon Mar 28 10:06:32 EDT 2016
% Result : Satisfiable 1.16s
% 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.03 % Problem : LCL905-1 : TPTP v6.4.0. Released v6.4.0.
% 0.00/0.03 % Command : tptp2X_and_run_cime %s
% 0.02/0.23 % Computer : n025.star.cs.uiowa.edu
% 0.02/0.23 % Model : x86_64 x86_64
% 0.02/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.23 % Memory : 16091.75MB
% 0.02/0.23 % OS : Linux 3.10.0-327.10.1.el7.x86_64
% 0.02/0.23 % CPULimit : 300
% 0.02/0.23 % DateTime : Fri Mar 25 13:16:28 CDT 2016
% 0.02/0.23 % CPUTime :
% 1.10/1.35 Processing problem /tmp/CiME_44103_n025.star.cs.uiowa.edu
% 1.10/1.35 #verbose 1;
% 1.10/1.35 let F = signature " falsehood,truth : constant; and_star : 2; xor : 2; not : 1;not_truth_xor_falsehood_and_star__1, not_truth_xor_falsehood_and_star__2 : 0;";
% 1.10/1.35 let X = vars "X Y";
% 1.10/1.35 let Axioms = equations F X "
% 1.10/1.35 not(X) = xor(X,truth);
% 1.10/1.35 xor(X,falsehood) = X;
% 1.10/1.35 xor(X,X) = falsehood;
% 1.10/1.35 and_star(X,truth) = X;
% 1.10/1.35 and_star(X,falsehood) = falsehood;
% 1.10/1.35 and_star(xor(truth,X),X) = falsehood;
% 1.10/1.35 xor(X,xor(truth,Y)) = xor(xor(X,truth),Y);
% 1.10/1.35 and_star(xor(and_star(xor(truth,X),Y),truth),Y) = and_star(xor(and_star(xor(truth,Y),X),truth),X);
% 1.10/1.35 not(X) = xor(X,truth);
% 1.10/1.35 xor(X,falsehood) = X;
% 1.10/1.35 xor(X,X) = falsehood;
% 1.10/1.35 and_star(X,truth) = X;
% 1.10/1.35 and_star(X,falsehood) = falsehood;
% 1.10/1.35 and_star(xor(truth,X),X) = falsehood;
% 1.10/1.35 xor(X,xor(truth,Y)) = xor(xor(X,truth),Y);
% 1.10/1.35 and_star(xor(and_star(xor(truth,X),Y),truth),Y) = and_star(xor(and_star(xor(truth,Y),X),truth),X);
% 1.10/1.35 ";
% 1.10/1.35
% 1.10/1.35 let s1 = status F "
% 1.10/1.35 and_star lr_lex;
% 1.10/1.35 falsehood lr_lex;
% 1.10/1.35 xor lr_lex;
% 1.10/1.35 truth lr_lex;
% 1.10/1.35 not lr_lex;
% 1.10/1.35 ";
% 1.10/1.35
% 1.10/1.35 let p1 = precedence F "
% 1.10/1.35 xor > and_star > not > truth > falsehood > not_truth_xor_falsehood_and_star__1 > not_truth_xor_falsehood_and_star__2";
% 1.10/1.35
% 1.10/1.35 let s2 = status F "
% 1.10/1.35 and_star mul;
% 1.10/1.35 falsehood mul;
% 1.10/1.35 xor mul;
% 1.10/1.35 truth mul;
% 1.10/1.35 not mul;
% 1.10/1.35 ";
% 1.10/1.35
% 1.10/1.35 let p2 = precedence F "
% 1.10/1.35 xor > and_star > not > truth = falsehood > not_truth_xor_falsehood_and_star__1 > not_truth_xor_falsehood_and_star__2";
% 1.10/1.35
% 1.10/1.35 let o_auto = AUTO Axioms;
% 1.10/1.35
% 1.10/1.35 let o = LEX o_auto (LEX (ACRPO s1 p1) (ACRPO s2 p2));
% 1.10/1.35
% 1.10/1.35 let Conjectures = equations F X "not_truth_xor_falsehood_and_star__1 = not_truth_xor_falsehood_and_star__2"
% 1.10/1.35 ;
% 1.10/1.35 (*
% 1.10/1.35 let Red_Axioms = normalize_equations Defining_rules Axioms;
% 1.10/1.35
% 1.10/1.35 let Red_Conjectures = normalize_equations Defining_rules Conjectures;
% 1.10/1.35 *)
% 1.10/1.35 #time on;
% 1.10/1.35
% 1.10/1.35 let res = prove_conj_by_ordered_completion o Axioms Conjectures;
% 1.10/1.35
% 1.10/1.35 #time off;
% 1.10/1.35
% 1.10/1.35
% 1.10/1.35 let status = if res then "unsatisfiable" else "satisfiable";
% 1.10/1.35 #quit;
% 1.10/1.35 Verbose level is now 1
% 1.10/1.35
% 1.10/1.35 F : signature = <signature>
% 1.10/1.35 X : variable_set = <variable set>
% 1.10/1.35
% 1.10/1.35 Axioms : (F,X) equations = { not(X) = xor(X,truth),
% 1.10/1.35 xor(X,falsehood) = X,
% 1.10/1.35 xor(X,X) = falsehood,
% 1.10/1.35 and_star(X,truth) = X,
% 1.10/1.35 and_star(X,falsehood) = falsehood,
% 1.10/1.35 and_star(xor(truth,X),X) = falsehood,
% 1.10/1.35 xor(X,xor(truth,Y)) = xor(xor(X,truth),Y),
% 1.10/1.35 and_star(xor(and_star(xor(truth,X),Y),truth),Y)
% 1.10/1.35 =
% 1.10/1.35 and_star(xor(and_star(xor(truth,Y),X),truth),X),
% 1.10/1.35 not(X) = xor(X,truth),
% 1.10/1.35 xor(X,falsehood) = X,
% 1.10/1.35 xor(X,X) = falsehood,
% 1.10/1.35 and_star(X,truth) = X,
% 1.10/1.35 and_star(X,falsehood) = falsehood,
% 1.10/1.35 and_star(xor(truth,X),X) = falsehood,
% 1.10/1.35 xor(X,xor(truth,Y)) = xor(xor(X,truth),Y),
% 1.10/1.35 and_star(xor(and_star(xor(truth,X),Y),truth),Y)
% 1.10/1.35 =
% 1.10/1.35 and_star(xor(and_star(xor(truth,Y),X),truth),X) }
% 1.10/1.35 (16 equation(s))
% 1.10/1.35 s1 : F status = <status>
% 1.10/1.35 p1 : F precedence = <precedence>
% 1.10/1.35 s2 : F status = <status>
% 1.10/1.35 p2 : F precedence = <precedence>
% 1.10/1.35 o_auto : F term_ordering = <term ordering>
% 1.10/1.35 o : F term_ordering = <term ordering>
% 1.10/1.35 Conjectures : (F,X) equations = { not_truth_xor_falsehood_and_star__1 =
% 1.10/1.35 not_truth_xor_falsehood_and_star__2 }
% 1.10/1.35 (1 equation(s))
% 1.10/1.35 time is now on
% 1.10/1.35
% 1.10/1.35 Initializing completion ...
% 1.10/1.35 New rule produced : [1] and_star(X,truth) -> X
% 1.10/1.35 Current number of equations to process: 0
% 1.10/1.35 Current number of ordered equations: 8
% 1.10/1.35 Current number of rules: 1
% 1.10/1.35 New rule produced : [2] and_star(X,falsehood) -> falsehood
% 1.10/1.35 Current number of equations to process: 0
% 1.10/1.35 Current number of ordered equations: 7
% 1.10/1.35 Current number of rules: 2
% 1.10/1.35 New rule produced : [3] xor(X,X) -> falsehood
% 1.10/1.35 Current number of equations to process: 0
% 1.10/1.35 Current number of ordered equations: 6
% 1.10/1.35 Current number of rules: 3
% 1.10/1.36 New rule produced : [4] xor(X,falsehood) -> X
% 1.10/1.36 Current number of equations to process: 0
% 1.10/1.36 Current number of ordered equations: 5
% 1.10/1.36 Current number of rules: 4
% 1.10/1.36 New rule produced : [5] xor(X,truth) -> not(X)
% 1.10/1.36 Current number of equations to process: 3
% 1.10/1.36 Current number of ordered equations: 1
% 1.10/1.36 Current number of rules: 5
% 1.10/1.36 New rule produced : [6] and_star(xor(truth,X),X) -> falsehood
% 1.10/1.36 Current number of equations to process: 0
% 1.10/1.36 Current number of ordered equations: 3
% 1.10/1.36 Current number of rules: 6
% 1.10/1.36 New rule produced : [7] xor(not(X),Y) -> xor(X,xor(truth,Y))
% 1.10/1.36 Current number of equations to process: 0
% 1.10/1.36 Current number of ordered equations: 2
% 1.10/1.36 Current number of rules: 7
% 1.10/1.36 New rule produced :
% 1.10/1.36 [8]
% 1.10/1.36 and_star(not(and_star(xor(truth,X),Y)),Y) <->
% 1.10/1.36 and_star(not(and_star(xor(truth,Y),X)),X)
% 1.10/1.36 Current number of equations to process: 0
% 1.10/1.36 Current number of ordered equations: 3
% 1.10/1.36 Current number of rules: 8
% 1.10/1.36 New rule produced : [9] not(truth) -> falsehood
% 1.10/1.36 Current number of equations to process: 1
% 1.10/1.36 Current number of ordered equations: 1
% 1.10/1.36 Current number of rules: 9
% 1.10/1.36 New rule produced : [10] not(not(X)) -> X
% 1.10/1.36 Current number of equations to process: 0
% 1.10/1.36 Current number of ordered equations: 1
% 1.10/1.36 Current number of rules: 10
% 1.10/1.36 New rule produced : [11] xor(X,xor(truth,not(X))) -> falsehood
% 1.10/1.36 Current number of equations to process: 0
% 1.10/1.36 Current number of ordered equations: 0
% 1.10/1.36 Current number of rules: 11
% 1.10/1.36 New rule produced :
% 1.10/1.36 [12] not(xor(truth,X)) -> and_star(not(and_star(falsehood,X)),X)
% 1.10/1.36 Current number of equations to process: 0
% 1.10/1.36 Current number of ordered equations: 0
% 1.10/1.36 Current number of rules: 12
% 1.10/1.36 New rule produced : [13] and_star(not(and_star(truth,X)),X) -> falsehood
% 1.10/1.36 Current number of equations to process: 0
% 1.10/1.36 Current number of ordered equations: 0
% 1.10/1.36 Current number of rules: 13
% 1.10/1.36 New rule produced : [14] xor(truth,xor(truth,X)) -> xor(falsehood,X)
% 1.10/1.36 Current number of equations to process: 0
% 1.10/1.36 Current number of ordered equations: 0
% 1.10/1.36 Current number of rules: 14
% 1.10/1.36 New rule produced : [15] xor(X,xor(falsehood,Y)) -> xor(X,Y)
% 1.10/1.36 Current number of equations to process: 0
% 1.10/1.36 Current number of ordered equations: 0
% 1.10/1.36 Current number of rules: 15
% 1.10/1.36 New rule produced : [16] not(falsehood) -> truth
% 1.10/1.36 Current number of equations to process: 0
% 1.10/1.36 Current number of ordered equations: 0
% 1.10/1.36 Current number of rules: 16
% 1.10/1.36 Rule [7] xor(not(X),Y) -> xor(X,xor(truth,Y)) is composed into [7]
% 1.10/1.36 xor(not(X),Y)
% 1.10/1.36 ->
% 1.10/1.36 xor(X,
% 1.10/1.36 not(and_star(
% 1.10/1.36 not(
% 1.10/1.36 and_star(falsehood,Y)),Y)))
% 1.10/1.36 New rule produced :
% 1.10/1.36 [17] xor(truth,X) -> not(and_star(not(and_star(falsehood,X)),X))
% 1.10/1.36 Rule [6] and_star(xor(truth,X),X) -> falsehood collapsed.
% 1.10/1.36 Rule
% 1.10/1.36 [8]
% 1.10/1.36 and_star(not(and_star(xor(truth,X),Y)),Y) <->
% 1.10/1.36 and_star(not(and_star(xor(truth,Y),X)),X) collapsed.
% 1.10/1.36 Rule [11] xor(X,xor(truth,not(X))) -> falsehood collapsed.
% 1.10/1.36 Rule [12] not(xor(truth,X)) -> and_star(not(and_star(falsehood,X)),X)
% 1.10/1.36 collapsed.
% 1.10/1.36 Rule [14] xor(truth,xor(truth,X)) -> xor(falsehood,X) collapsed.
% 1.10/1.36 Current number of equations to process: 6
% 1.10/1.36 Current number of ordered equations: 0
% 1.10/1.36 Current number of rules: 12
% 1.10/1.36 New rule produced :
% 1.10/1.36 [18] and_star(not(and_star(not(and_star(falsehood,X)),X)),X) -> falsehood
% 1.10/1.36 Current number of equations to process: 4
% 1.10/1.36 Current number of ordered equations: 2
% 1.10/1.36 Current number of rules: 13
% 1.10/1.36 New rule produced :
% 1.10/1.36 [19]
% 1.10/1.36 and_star(not(and_star(not(and_star(not(and_star(falsehood,X)),X)),Y)),Y) <->
% 1.10/1.36 and_star(not(and_star(not(and_star(not(and_star(falsehood,Y)),Y)),X)),X)
% 1.10/1.36 Current number of equations to process: 1
% 1.10/1.36 Current number of ordered equations: 7
% 1.10/1.36 Current number of rules: 14
% 1.10/1.36 New rule produced : [20] xor(xor(falsehood,X),X) -> falsehood
% 1.10/1.36 Current number of equations to process: 1
% 1.10/1.36 Current number of ordered equations: 6
% 1.10/1.36 Current number of rules: 15
% 1.10/1.36 New rule produced :
% 1.10/1.36 [21]
% 1.10/1.36 xor(X,not(and_star(not(and_star(falsehood,not(X))),not(X)))) -> falsehood
% 1.10/1.37 Current number of equations to process: 1
% 1.10/1.37 Current number of ordered equations: 5
% 1.10/1.37 Current number of rules: 16
% 1.10/1.37 New rule produced :
% 1.10/1.37 [22]
% 1.10/1.37 xor(and_star(not(and_star(falsehood,X)),X),not(and_star(not(and_star(falsehood,
% 1.10/1.37 not(and_star(
% 1.10/1.37 not(and_star(falsehood,Y)),Y)))),
% 1.10/1.37 not(and_star(not(and_star(falsehood,Y)),Y)))))
% 1.10/1.37 -> xor(and_star(not(and_star(falsehood,X)),X),Y)
% 1.10/1.37 Current number of equations to process: 1
% 1.10/1.37 Current number of ordered equations: 3
% 1.10/1.37 Current number of rules: 17
% 1.10/1.37 New rule produced :
% 1.10/1.37 [23]
% 1.10/1.37 xor(falsehood,not(and_star(not(and_star(falsehood,X)),X))) ->
% 1.10/1.37 not(and_star(not(and_star(falsehood,X)),X))
% 1.10/1.37 Current number of equations to process: 1
% 1.10/1.37 Current number of ordered equations: 2
% 1.10/1.37 Current number of rules: 18
% 1.10/1.37 New rule produced :
% 1.10/1.37 [24]
% 1.10/1.37 not(and_star(not(and_star(falsehood,xor(falsehood,X))),xor(falsehood,X))) ->
% 1.10/1.37 not(and_star(not(and_star(falsehood,X)),X))
% 1.10/1.37 Current number of equations to process: 1
% 1.10/1.37 Current number of ordered equations: 0
% 1.10/1.37 Current number of rules: 19
% 1.10/1.37 New rule produced :
% 1.10/1.37 [25] xor(and_star(not(and_star(falsehood,X)),X),X) -> falsehood
% 1.10/1.37 Current number of equations to process: 3
% 1.10/1.37 Current number of ordered equations: 0
% 1.10/1.37 Current number of rules: 20
% 1.10/1.37 New rule produced :
% 1.10/1.37 [26]
% 1.10/1.37 and_star(not(and_star(not(and_star(falsehood,X)),X)),xor(falsehood,X)) ->
% 1.10/1.37 falsehood
% 1.10/1.37 Current number of equations to process: 5
% 1.10/1.37 Current number of ordered equations: 0
% 1.10/1.37 Current number of rules: 21
% 1.10/1.37 New rule produced :
% 1.10/1.37 [27]
% 1.10/1.37 and_star(not(and_star(falsehood,xor(falsehood,X))),xor(falsehood,X)) ->
% 1.10/1.37 and_star(not(and_star(falsehood,X)),X)
% 1.10/1.37 Rule
% 1.10/1.37 [24]
% 1.10/1.37 not(and_star(not(and_star(falsehood,xor(falsehood,X))),xor(falsehood,X))) ->
% 1.10/1.37 not(and_star(not(and_star(falsehood,X)),X)) collapsed.
% 1.10/1.37 Current number of equations to process: 4
% 1.10/1.37 Current number of ordered equations: 0
% 1.10/1.37 Current number of rules: 21
% 1.10/1.37 New rule produced :
% 1.10/1.37 [28] and_star(truth,xor(falsehood,X)) -> and_star(truth,X)
% 1.10/1.37 Current number of equations to process: 5
% 1.10/1.37 Current number of ordered equations: 0
% 1.10/1.37 Current number of rules: 22
% 1.10/1.37 New rule produced :
% 1.10/1.37 [29] and_star(not(and_star(truth,X)),xor(falsehood,X)) -> falsehood
% 1.10/1.37 Current number of equations to process: 6
% 1.10/1.37 Current number of ordered equations: 0
% 1.10/1.37 Current number of rules: 23
% 1.10/1.37 New rule produced :
% 1.10/1.37 [30]
% 1.10/1.37 xor(falsehood,X) ->
% 1.10/1.37 not(and_star(not(and_star(falsehood,not(and_star(not(and_star(falsehood,X)),X)))),
% 1.10/1.37 not(and_star(not(and_star(falsehood,X)),X))))
% 1.10/1.37 Rule [15] xor(X,xor(falsehood,Y)) -> xor(X,Y) collapsed.
% 1.10/1.37 Rule [20] xor(xor(falsehood,X),X) -> falsehood collapsed.
% 1.10/1.37 Rule
% 1.10/1.37 [23]
% 1.10/1.37 xor(falsehood,not(and_star(not(and_star(falsehood,X)),X))) ->
% 1.10/1.37 not(and_star(not(and_star(falsehood,X)),X)) collapsed.
% 1.10/1.37 Rule
% 1.10/1.37 [26]
% 1.10/1.37 and_star(not(and_star(not(and_star(falsehood,X)),X)),xor(falsehood,X)) ->
% 1.10/1.37 falsehood collapsed.
% 1.10/1.37 Rule
% 1.10/1.37 [27]
% 1.10/1.37 and_star(not(and_star(falsehood,xor(falsehood,X))),xor(falsehood,X)) ->
% 1.10/1.37 and_star(not(and_star(falsehood,X)),X) collapsed.
% 1.10/1.37 Rule [28] and_star(truth,xor(falsehood,X)) -> and_star(truth,X) collapsed.
% 1.10/1.37 Rule [29] and_star(not(and_star(truth,X)),xor(falsehood,X)) -> falsehood
% 1.10/1.37 collapsed.
% 1.10/1.37 Current number of equations to process: 10
% 1.10/1.37 Current number of ordered equations: 0
% 1.10/1.37 Current number of rules: 17
% 1.10/1.37 New rule produced :
% 1.10/1.37 [31]
% 1.10/1.37 xor(X,not(and_star(not(and_star(falsehood,not(and_star(not(and_star(falsehood,X)),X)))),
% 1.10/1.37 not(and_star(not(and_star(falsehood,X)),X))))) -> falsehood
% 1.10/1.37 Current number of equations to process: 9
% 1.10/1.37 Current number of ordered equations: 0
% 1.10/1.37 Current number of rules: 18
% 1.10/1.37 New rule produced :
% 1.10/1.37 [32]
% 1.10/1.37 and_star(not(and_star(not(and_star(not(and_star(falsehood,X)),X)),Y)),Y) <->
% 1.10/1.37 and_star(not(and_star(not(and_star(not(and_star(falsehood,Y)),Y)),not(
% 1.10/1.37 and_star(
% 1.10/1.37 not(
% 1.10/1.37 and_star(falsehood,
% 1.10/1.37 not(
% 1.10/1.37 and_star(
% 1.10/1.37 not(
% 1.10/1.38 and_star(falsehood,X)),X)))),
% 1.10/1.38 not(
% 1.10/1.38 and_star(
% 1.10/1.38 not(
% 1.10/1.38 and_star(falsehood,X)),X)))))),
% 1.10/1.38 not(and_star(not(and_star(falsehood,not(and_star(not(and_star(falsehood,X)),X)))),
% 1.10/1.38 not(and_star(not(and_star(falsehood,X)),X)))))
% 1.10/1.38 Current number of equations to process: 9
% 1.10/1.38 Current number of ordered equations: 1
% 1.10/1.38 Current number of rules: 19
% 1.10/1.38 New rule produced :
% 1.10/1.38 [33]
% 1.10/1.38 and_star(not(and_star(not(and_star(not(and_star(falsehood,Y)),Y)),not(
% 1.10/1.38 and_star(
% 1.10/1.38 not(
% 1.10/1.38 and_star(falsehood,
% 1.10/1.38 not(
% 1.10/1.38 and_star(
% 1.10/1.38 not(
% 1.10/1.38 and_star(falsehood,X)),X)))),
% 1.10/1.38 not(
% 1.10/1.38 and_star(
% 1.10/1.38 not(
% 1.10/1.38 and_star(falsehood,X)),X)))))),
% 1.10/1.38 not(and_star(not(and_star(falsehood,not(and_star(not(and_star(falsehood,X)),X)))),
% 1.10/1.38 not(and_star(not(and_star(falsehood,X)),X))))) <->
% 1.10/1.38 and_star(not(and_star(not(and_star(not(and_star(falsehood,X)),X)),Y)),Y)
% 1.10/1.38 Current number of equations to process: 9
% 1.10/1.38 Current number of ordered equations: 0
% 1.10/1.38 Current number of rules: 20
% 1.10/1.38 New rule produced :
% 1.10/1.38 [34]
% 1.10/1.38 xor(X,not(and_star(not(and_star(falsehood,not(and_star(not(and_star(falsehood,Y)),Y)))),
% 1.10/1.38 not(and_star(not(and_star(falsehood,Y)),Y))))) -> xor(X,Y)
% 1.10/1.38 Rule
% 1.10/1.38 [22]
% 1.10/1.38 xor(and_star(not(and_star(falsehood,X)),X),not(and_star(not(and_star(falsehood,
% 1.10/1.38 not(and_star(
% 1.10/1.38 not(and_star(falsehood,Y)),Y)))),
% 1.10/1.38 not(and_star(not(and_star(falsehood,Y)),Y)))))
% 1.10/1.38 -> xor(and_star(not(and_star(falsehood,X)),X),Y) collapsed.
% 1.10/1.38 Rule
% 1.10/1.38 [31]
% 1.10/1.38 xor(X,not(and_star(not(and_star(falsehood,not(and_star(not(and_star(falsehood,X)),X)))),
% 1.10/1.38 not(and_star(not(and_star(falsehood,X)),X))))) -> falsehood
% 1.10/1.38 collapsed.
% 1.10/1.38 Current number of equations to process: 11
% 1.10/1.38 Current number of ordered equations: 0
% 1.10/1.38 Current number of rules: 19
% 1.10/1.38 New rule produced :
% 1.10/1.38 [35]
% 1.10/1.38 and_star(truth,not(and_star(not(and_star(falsehood,not(and_star(not(and_star(falsehood,X)),X)))),
% 1.10/1.38 not(and_star(not(and_star(falsehood,X)),X))))) ->
% 1.10/1.38 and_star(truth,X)
% 1.10/1.38 Current number of equations to process: 11
% 1.10/1.38 Current number of ordered equations: 0
% 1.10/1.38 Current number of rules: 20
% 1.10/1.38 New rule produced :
% 1.10/1.38 [36]
% 1.10/1.38 and_star(not(and_star(truth,X)),not(and_star(not(and_star(falsehood,not(
% 1.10/1.38 and_star(
% 1.10/1.38 not(
% 1.10/1.38 and_star(falsehood,X)),X)))),
% 1.10/1.38 not(and_star(not(and_star(falsehood,X)),X)))))
% 1.10/1.38 -> falsehood
% 1.10/1.38 Current number of equations to process: 10
% 1.10/1.38 Current number of ordered equations: 0
% 1.10/1.38 Current number of rules: 21
% 1.10/1.38 New rule produced :
% 1.10/1.38 [37]
% 1.10/1.38 xor(and_star(not(and_star(falsehood,not(and_star(not(and_star(falsehood,
% 1.10/1.38 not(and_star(not(
% 1.10/1.38 and_star(falsehood,X)),X)))),
% 1.10/1.38 not(and_star(not(and_star(falsehood,X)),X)))))),
% 1.16/1.40 not(and_star(not(and_star(falsehood,not(and_star(not(and_star(falsehood,X)),X)))),
% 1.16/1.40 not(and_star(not(and_star(falsehood,X)),X))))),not(and_star(not(
% 1.16/1.40 and_star(falsehood,Y)),Y)))
% 1.16/1.40 ->
% 1.16/1.40 xor(and_star(not(and_star(falsehood,X)),X),not(and_star(not(and_star(falsehood,Y)),Y)))
% 1.16/1.40 Current number of equations to process: 10
% 1.16/1.40 Current number of ordered equations: 0
% 1.16/1.40 Current number of rules: 22
% 1.16/1.40 New rule produced :
% 1.16/1.40 [38]
% 1.16/1.40 and_star(not(and_star(not(and_star(falsehood,X)),X)),not(and_star(not(
% 1.16/1.40 and_star(falsehood,
% 1.16/1.40 not(
% 1.16/1.40 and_star(
% 1.16/1.40 not(
% 1.16/1.40 and_star(falsehood,X)),X)))),
% 1.16/1.40 not(and_star(
% 1.16/1.40 not(and_star(falsehood,X)),X)))))
% 1.16/1.40 -> falsehood
% 1.16/1.40 Current number of equations to process: 10
% 1.16/1.40 Current number of ordered equations: 0
% 1.16/1.40 Current number of rules: 23
% 1.16/1.40 New rule produced :
% 1.16/1.40 [39]
% 1.16/1.40 xor(and_star(not(and_star(falsehood,not(and_star(not(and_star(falsehood,
% 1.16/1.40 not(and_star(not(
% 1.16/1.40 and_star(falsehood,X)),X)))),
% 1.16/1.40 not(and_star(not(and_star(falsehood,X)),X)))))),
% 1.16/1.40 not(and_star(not(and_star(falsehood,not(and_star(not(and_star(falsehood,X)),X)))),
% 1.16/1.40 not(and_star(not(and_star(falsehood,X)),X))))),X) -> falsehood
% 1.16/1.40 Current number of equations to process: 9
% 1.16/1.40 Current number of ordered equations: 0
% 1.16/1.40 Current number of rules: 24
% 1.16/1.40 New rule produced :
% 1.16/1.40 [40]
% 1.16/1.40 and_star(not(and_star(falsehood,not(and_star(not(and_star(falsehood,not(
% 1.16/1.40 and_star(
% 1.16/1.40 not(
% 1.16/1.40 and_star(falsehood,X)),X)))),
% 1.16/1.40 not(and_star(not(and_star(falsehood,X)),X)))))),
% 1.16/1.40 not(and_star(not(and_star(falsehood,not(and_star(not(and_star(falsehood,X)),X)))),
% 1.16/1.40 not(and_star(not(and_star(falsehood,X)),X))))) ->
% 1.16/1.40 and_star(not(and_star(falsehood,X)),X)
% 1.16/1.40 Rule
% 1.16/1.40 [37]
% 1.16/1.40 xor(and_star(not(and_star(falsehood,not(and_star(not(and_star(falsehood,
% 1.16/1.40 not(and_star(not(
% 1.16/1.40 and_star(falsehood,X)),X)))),
% 1.16/1.40 not(and_star(not(and_star(falsehood,X)),X)))))),
% 1.16/1.40 not(and_star(not(and_star(falsehood,not(and_star(not(and_star(falsehood,X)),X)))),
% 1.16/1.40 not(and_star(not(and_star(falsehood,X)),X))))),not(and_star(not(
% 1.16/1.40 and_star(falsehood,Y)),Y)))
% 1.16/1.40 ->
% 1.16/1.40 xor(and_star(not(and_star(falsehood,X)),X),not(and_star(not(and_star(falsehood,Y)),Y)))
% 1.16/1.40 collapsed.
% 1.16/1.40 Rule
% 1.16/1.40 [39]
% 1.16/1.40 xor(and_star(not(and_star(falsehood,not(and_star(not(and_star(falsehood,
% 1.16/1.40 not(and_star(not(
% 1.16/1.40 and_star(falsehood,X)),X)))),
% 1.16/1.40 not(and_star(not(and_star(falsehood,X)),X)))))),
% 1.16/1.40 not(and_star(not(and_star(falsehood,not(and_star(not(and_star(falsehood,X)),X)))),
% 1.16/1.40 not(and_star(not(and_star(falsehood,X)),X))))),X) -> falsehood
% 1.16/1.40 collapsed.
% 1.16/1.40 Current number of equations to process: 9
% 1.16/1.40 Current number of ordered equations: 0
% 1.16/1.40 Current number of rules: 23
% 1.16/1.40 Rule [32]
% 1.16/1.40 and_star(not(and_star(not(and_star(not(and_star(falsehood,X)),X)),Y)),Y)
% 1.16/1.40 <->
% 1.16/1.40 and_star(not(and_star(not(and_star(not(and_star(falsehood,Y)),Y)),
% 1.16/1.40 not(and_star(not(and_star(falsehood,not(and_star(not(
% 1.16/1.40 and_star(falsehood,X)),X)))),
% 1.16/1.41 not(and_star(not(and_star(falsehood,X)),X)))))),
% 1.16/1.41 not(and_star(not(and_star(falsehood,not(and_star(not(and_star(falsehood,X)),X)))),
% 1.16/1.41 not(and_star(not(and_star(falsehood,X)),X))))) is composed into
% 1.16/1.41 [32]
% 1.16/1.41 and_star(not(and_star(not(and_star(not(and_star(falsehood,X)),X)),Y)),Y) <->
% 1.16/1.41 and_star(not(and_star(not(and_star(not(and_star(falsehood,Y)),Y)),X)),X)
% 1.16/1.41 New rule produced :
% 1.16/1.41 [41]
% 1.16/1.41 and_star(not(and_star(not(and_star(not(and_star(falsehood,X)),X)),not(
% 1.16/1.41 and_star(
% 1.16/1.41 not(
% 1.16/1.41 and_star(falsehood,
% 1.16/1.41 not(
% 1.16/1.41 and_star(
% 1.16/1.41 not(
% 1.16/1.41 and_star(falsehood,Y)),Y)))),
% 1.16/1.41 not(
% 1.16/1.41 and_star(
% 1.16/1.41 not(
% 1.16/1.41 and_star(falsehood,Y)),Y)))))),
% 1.16/1.41 not(and_star(not(and_star(falsehood,not(and_star(not(and_star(falsehood,Y)),Y)))),
% 1.16/1.41 not(and_star(not(and_star(falsehood,Y)),Y))))) ->
% 1.16/1.41 and_star(not(and_star(not(and_star(not(and_star(falsehood,X)),X)),Y)),Y)
% 1.16/1.41 Rule
% 1.16/1.41 [33]
% 1.16/1.41 and_star(not(and_star(not(and_star(not(and_star(falsehood,Y)),Y)),not(
% 1.16/1.41 and_star(
% 1.16/1.41 not(
% 1.16/1.41 and_star(falsehood,
% 1.16/1.41 not(
% 1.16/1.41 and_star(
% 1.16/1.41 not(
% 1.16/1.41 and_star(falsehood,X)),X)))),
% 1.16/1.41 not(
% 1.16/1.41 and_star(
% 1.16/1.41 not(
% 1.16/1.41 and_star(falsehood,X)),X)))))),
% 1.16/1.41 not(and_star(not(and_star(falsehood,not(and_star(not(and_star(falsehood,X)),X)))),
% 1.16/1.41 not(and_star(not(and_star(falsehood,X)),X))))) <->
% 1.16/1.41 and_star(not(and_star(not(and_star(not(and_star(falsehood,X)),X)),Y)),Y)
% 1.16/1.41 collapsed.
% 1.16/1.41 Current number of equations to process: 6
% 1.16/1.41 Current number of ordered equations: 0
% 1.16/1.41 Current number of rules: 23
% 1.16/1.41 Warning: some conjectures remain
% 1.16/1.41
% 1.16/1.41 Execution time: 0.060000 sec
% 1.16/1.41 res : bool = false
% 1.16/1.41 time is now off
% 1.16/1.41
% 1.16/1.41 status : string = "satisfiable"
% 1.16/1.41 % SZS status Satisfiable
% 1.16/1.41 CiME interrupted
%------------------------------------------------------------------------------