TSTP Solution File: SET766+4 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SET766+4 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n013.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Jul 27 13:14:13 EDT 2022
% Result : Theorem 2.00s 2.21s
% Output : Refutation 2.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 8 ( 6 unt; 0 nHn; 8 RR)
% Number of literals : 12 ( 0 equ; 5 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-3 aty)
% Number of variables : 7 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(53,axiom,
( ~ e_quivalence(A,B)
| ~ member(C,B)
| apply(A,C,C) ),
file('SET766+4.p',unknown),
[] ).
cnf(91,axiom,
( member(A,e_quivalence_class(B,C,D))
| ~ member(A,C)
| ~ apply(D,B,A) ),
file('SET766+4.p',unknown),
[] ).
cnf(101,axiom,
~ member(dollar_c1,e_quivalence_class(dollar_c1,dollar_c3,dollar_c2)),
file('SET766+4.p',unknown),
[] ).
cnf(143,axiom,
e_quivalence(dollar_c2,dollar_c3),
file('SET766+4.p',unknown),
[] ).
cnf(144,axiom,
member(dollar_c1,dollar_c3),
file('SET766+4.p',unknown),
[] ).
cnf(167,plain,
apply(dollar_c2,dollar_c1,dollar_c1),
inference(hyper,[status(thm)],[144,53,143]),
[iquote('hyper,144,53,143')] ).
cnf(207,plain,
member(dollar_c1,e_quivalence_class(dollar_c1,dollar_c3,dollar_c2)),
inference(hyper,[status(thm)],[167,91,144]),
[iquote('hyper,167,91,144')] ).
cnf(208,plain,
$false,
inference(binary,[status(thm)],[207,101]),
[iquote('binary,207.1,101.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET766+4 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n013.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Jul 27 10:32:45 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.00/2.19 ----- Otter 3.3f, August 2004 -----
% 2.00/2.19 The process was started by sandbox on n013.cluster.edu,
% 2.00/2.19 Wed Jul 27 10:32:45 2022
% 2.00/2.19 The command was "./otter". The process ID is 24912.
% 2.00/2.19
% 2.00/2.19 set(prolog_style_variables).
% 2.00/2.19 set(auto).
% 2.00/2.19 dependent: set(auto1).
% 2.00/2.19 dependent: set(process_input).
% 2.00/2.19 dependent: clear(print_kept).
% 2.00/2.19 dependent: clear(print_new_demod).
% 2.00/2.19 dependent: clear(print_back_demod).
% 2.00/2.19 dependent: clear(print_back_sub).
% 2.00/2.19 dependent: set(control_memory).
% 2.00/2.19 dependent: assign(max_mem, 12000).
% 2.00/2.19 dependent: assign(pick_given_ratio, 4).
% 2.00/2.19 dependent: assign(stats_level, 1).
% 2.00/2.19 dependent: assign(max_seconds, 10800).
% 2.00/2.19 clear(print_given).
% 2.00/2.19
% 2.00/2.19 formula_list(usable).
% 2.00/2.19 all A (A=A).
% 2.00/2.19 all A B (subset(A,B)<-> (all X (member(X,A)->member(X,B)))).
% 2.00/2.19 all A B (e_qual_set(A,B)<->subset(A,B)&subset(B,A)).
% 2.00/2.19 all X A (member(X,power_set(A))<->subset(X,A)).
% 2.00/2.19 all X A B (member(X,intersection(A,B))<->member(X,A)&member(X,B)).
% 2.00/2.19 all X A B (member(X,union(A,B))<->member(X,A)|member(X,B)).
% 2.00/2.19 all X (-member(X,empty_set)).
% 2.00/2.19 all B A E (member(B,difference(E,A))<->member(B,E)& -member(B,A)).
% 2.00/2.19 all X A (member(X,singleton(A))<->X=A).
% 2.00/2.19 all X A B (member(X,unordered_pair(A,B))<->X=A|X=B).
% 2.00/2.19 all X A (member(X,sum(A))<-> (exists Y (member(Y,A)&member(X,Y)))).
% 2.00/2.19 all X A (member(X,product(A))<-> (all Y (member(Y,A)->member(X,Y)))).
% 2.00/2.19 all A B (disjoint(A,B)<-> -(exists X (member(X,A)&member(X,B)))).
% 2.00/2.19 all A E (partition(A,E)<-> (all X (member(X,A)->subset(X,E)))& (all X (member(X,E)-> (exists Y (member(Y,A)&member(X,Y)))))& (all X Y (member(X,A)&member(Y,A)-> ((exists Z (member(Z,X)&member(Z,Y)))->X=Y)))).
% 2.00/2.19 all A R (e_quivalence(R,A)<-> (all X (member(X,A)->apply(R,X,X)))& (all X Y (member(X,A)&member(Y,A)-> (apply(R,X,Y)->apply(R,Y,X))))& (all X Y Z (member(X,A)&member(Y,A)&member(Z,A)-> (apply(R,X,Y)&apply(R,Y,Z)->apply(R,X,Z))))).
% 2.00/2.19 all R E A X (member(X,e_quivalence_class(A,E,R))<->member(X,E)&apply(R,A,X)).
% 2.00/2.19 all R E (pre_order(R,E)<-> (all X (member(X,E)->apply(R,X,X)))& (all X Y Z (member(X,E)&member(Y,E)&member(Z,E)-> (apply(R,X,Y)&apply(R,Y,Z)->apply(R,X,Z))))).
% 2.00/2.19 -(all E R A (e_quivalence(R,E)&member(A,E)->member(A,e_quivalence_class(A,E,R)))).
% 2.00/2.19 end_of_list.
% 2.00/2.19
% 2.00/2.19 -------> usable clausifies to:
% 2.00/2.19
% 2.00/2.19 list(usable).
% 2.00/2.19 0 [] A=A.
% 2.00/2.19 0 [] -subset(A,B)| -member(X,A)|member(X,B).
% 2.00/2.19 0 [] subset(A,B)|member($f1(A,B),A).
% 2.00/2.19 0 [] subset(A,B)| -member($f1(A,B),B).
% 2.00/2.19 0 [] -e_qual_set(A,B)|subset(A,B).
% 2.00/2.19 0 [] -e_qual_set(A,B)|subset(B,A).
% 2.00/2.19 0 [] e_qual_set(A,B)| -subset(A,B)| -subset(B,A).
% 2.00/2.19 0 [] -member(X,power_set(A))|subset(X,A).
% 2.00/2.19 0 [] member(X,power_set(A))| -subset(X,A).
% 2.00/2.19 0 [] -member(X,intersection(A,B))|member(X,A).
% 2.00/2.19 0 [] -member(X,intersection(A,B))|member(X,B).
% 2.00/2.19 0 [] member(X,intersection(A,B))| -member(X,A)| -member(X,B).
% 2.00/2.19 0 [] -member(X,union(A,B))|member(X,A)|member(X,B).
% 2.00/2.19 0 [] member(X,union(A,B))| -member(X,A).
% 2.00/2.19 0 [] member(X,union(A,B))| -member(X,B).
% 2.00/2.19 0 [] -member(X,empty_set).
% 2.00/2.19 0 [] -member(B,difference(E,A))|member(B,E).
% 2.00/2.19 0 [] -member(B,difference(E,A))| -member(B,A).
% 2.00/2.19 0 [] member(B,difference(E,A))| -member(B,E)|member(B,A).
% 2.00/2.19 0 [] -member(X,singleton(A))|X=A.
% 2.00/2.19 0 [] member(X,singleton(A))|X!=A.
% 2.00/2.19 0 [] -member(X,unordered_pair(A,B))|X=A|X=B.
% 2.00/2.19 0 [] member(X,unordered_pair(A,B))|X!=A.
% 2.00/2.19 0 [] member(X,unordered_pair(A,B))|X!=B.
% 2.00/2.19 0 [] -member(X,sum(A))|member($f2(X,A),A).
% 2.00/2.19 0 [] -member(X,sum(A))|member(X,$f2(X,A)).
% 2.00/2.19 0 [] member(X,sum(A))| -member(Y,A)| -member(X,Y).
% 2.00/2.19 0 [] -member(X,product(A))| -member(Y,A)|member(X,Y).
% 2.00/2.19 0 [] member(X,product(A))|member($f3(X,A),A).
% 2.00/2.19 0 [] member(X,product(A))| -member(X,$f3(X,A)).
% 2.00/2.19 0 [] -disjoint(A,B)| -member(X,A)| -member(X,B).
% 2.00/2.19 0 [] disjoint(A,B)|member($f4(A,B),A).
% 2.00/2.19 0 [] disjoint(A,B)|member($f4(A,B),B).
% 2.00/2.19 0 [] -partition(A,E)| -member(X,A)|subset(X,E).
% 2.00/2.19 0 [] -partition(A,E)| -member(X1,E)|member($f5(A,E,X1),A).
% 2.00/2.19 0 [] -partition(A,E)| -member(X1,E)|member(X1,$f5(A,E,X1)).
% 2.00/2.19 0 [] -partition(A,E)| -member(X2,A)| -member(Y,A)| -member(Z,X2)| -member(Z,Y)|X2=Y.
% 2.00/2.19 0 [] partition(A,E)|member($f6(A,E),A)|member($f7(A,E),E)|member($f10(A,E),A).
% 2.00/2.19 0 [] partition(A,E)|member($f6(A,E),A)|member($f7(A,E),E)|member($f9(A,E),A).
% 2.00/2.19 0 [] partition(A,E)|member($f6(A,E),A)|member($f7(A,E),E)|member($f8(A,E),$f10(A,E)).
% 2.00/2.19 0 [] partition(A,E)|member($f6(A,E),A)|member($f7(A,E),E)|member($f8(A,E),$f9(A,E)).
% 2.00/2.20 0 [] partition(A,E)|member($f6(A,E),A)|member($f7(A,E),E)|$f10(A,E)!=$f9(A,E).
% 2.00/2.20 0 [] partition(A,E)|member($f6(A,E),A)| -member(X3,A)| -member($f7(A,E),X3)|member($f10(A,E),A).
% 2.00/2.20 0 [] partition(A,E)|member($f6(A,E),A)| -member(X3,A)| -member($f7(A,E),X3)|member($f9(A,E),A).
% 2.00/2.20 0 [] partition(A,E)|member($f6(A,E),A)| -member(X3,A)| -member($f7(A,E),X3)|member($f8(A,E),$f10(A,E)).
% 2.00/2.20 0 [] partition(A,E)|member($f6(A,E),A)| -member(X3,A)| -member($f7(A,E),X3)|member($f8(A,E),$f9(A,E)).
% 2.00/2.20 0 [] partition(A,E)|member($f6(A,E),A)| -member(X3,A)| -member($f7(A,E),X3)|$f10(A,E)!=$f9(A,E).
% 2.00/2.20 0 [] partition(A,E)| -subset($f6(A,E),E)|member($f7(A,E),E)|member($f10(A,E),A).
% 2.00/2.20 0 [] partition(A,E)| -subset($f6(A,E),E)|member($f7(A,E),E)|member($f9(A,E),A).
% 2.00/2.20 0 [] partition(A,E)| -subset($f6(A,E),E)|member($f7(A,E),E)|member($f8(A,E),$f10(A,E)).
% 2.00/2.20 0 [] partition(A,E)| -subset($f6(A,E),E)|member($f7(A,E),E)|member($f8(A,E),$f9(A,E)).
% 2.00/2.20 0 [] partition(A,E)| -subset($f6(A,E),E)|member($f7(A,E),E)|$f10(A,E)!=$f9(A,E).
% 2.00/2.20 0 [] partition(A,E)| -subset($f6(A,E),E)| -member(X3,A)| -member($f7(A,E),X3)|member($f10(A,E),A).
% 2.00/2.20 0 [] partition(A,E)| -subset($f6(A,E),E)| -member(X3,A)| -member($f7(A,E),X3)|member($f9(A,E),A).
% 2.00/2.20 0 [] partition(A,E)| -subset($f6(A,E),E)| -member(X3,A)| -member($f7(A,E),X3)|member($f8(A,E),$f10(A,E)).
% 2.00/2.20 0 [] partition(A,E)| -subset($f6(A,E),E)| -member(X3,A)| -member($f7(A,E),X3)|member($f8(A,E),$f9(A,E)).
% 2.00/2.20 0 [] partition(A,E)| -subset($f6(A,E),E)| -member(X3,A)| -member($f7(A,E),X3)|$f10(A,E)!=$f9(A,E).
% 2.00/2.20 0 [] -e_quivalence(R,A)| -member(X,A)|apply(R,X,X).
% 2.00/2.20 0 [] -e_quivalence(R,A)| -member(X4,A)| -member(Y,A)| -apply(R,X4,Y)|apply(R,Y,X4).
% 2.00/2.20 0 [] -e_quivalence(R,A)| -member(X5,A)| -member(X6,A)| -member(Z,A)| -apply(R,X5,X6)| -apply(R,X6,Z)|apply(R,X5,Z).
% 2.00/2.20 0 [] e_quivalence(R,A)|member($f11(A,R),A)|member($f13(A,R),A)|member($f16(A,R),A).
% 2.00/2.20 0 [] e_quivalence(R,A)|member($f11(A,R),A)|member($f13(A,R),A)|member($f15(A,R),A).
% 2.00/2.20 0 [] e_quivalence(R,A)|member($f11(A,R),A)|member($f13(A,R),A)|member($f14(A,R),A).
% 2.00/2.20 0 [] e_quivalence(R,A)|member($f11(A,R),A)|member($f13(A,R),A)|apply(R,$f16(A,R),$f15(A,R)).
% 2.00/2.20 0 [] e_quivalence(R,A)|member($f11(A,R),A)|member($f13(A,R),A)|apply(R,$f15(A,R),$f14(A,R)).
% 2.00/2.20 0 [] e_quivalence(R,A)|member($f11(A,R),A)|member($f13(A,R),A)| -apply(R,$f16(A,R),$f14(A,R)).
% 2.00/2.20 0 [] e_quivalence(R,A)|member($f11(A,R),A)|member($f12(A,R),A)|member($f16(A,R),A).
% 2.00/2.20 0 [] e_quivalence(R,A)|member($f11(A,R),A)|member($f12(A,R),A)|member($f15(A,R),A).
% 2.00/2.20 0 [] e_quivalence(R,A)|member($f11(A,R),A)|member($f12(A,R),A)|member($f14(A,R),A).
% 2.00/2.20 0 [] e_quivalence(R,A)|member($f11(A,R),A)|member($f12(A,R),A)|apply(R,$f16(A,R),$f15(A,R)).
% 2.00/2.20 0 [] e_quivalence(R,A)|member($f11(A,R),A)|member($f12(A,R),A)|apply(R,$f15(A,R),$f14(A,R)).
% 2.00/2.20 0 [] e_quivalence(R,A)|member($f11(A,R),A)|member($f12(A,R),A)| -apply(R,$f16(A,R),$f14(A,R)).
% 2.00/2.20 0 [] e_quivalence(R,A)|member($f11(A,R),A)|apply(R,$f13(A,R),$f12(A,R))|member($f16(A,R),A).
% 2.00/2.20 0 [] e_quivalence(R,A)|member($f11(A,R),A)|apply(R,$f13(A,R),$f12(A,R))|member($f15(A,R),A).
% 2.00/2.20 0 [] e_quivalence(R,A)|member($f11(A,R),A)|apply(R,$f13(A,R),$f12(A,R))|member($f14(A,R),A).
% 2.00/2.20 0 [] e_quivalence(R,A)|member($f11(A,R),A)|apply(R,$f13(A,R),$f12(A,R))|apply(R,$f16(A,R),$f15(A,R)).
% 2.00/2.20 0 [] e_quivalence(R,A)|member($f11(A,R),A)|apply(R,$f13(A,R),$f12(A,R))|apply(R,$f15(A,R),$f14(A,R)).
% 2.00/2.20 0 [] e_quivalence(R,A)|member($f11(A,R),A)|apply(R,$f13(A,R),$f12(A,R))| -apply(R,$f16(A,R),$f14(A,R)).
% 2.00/2.20 0 [] e_quivalence(R,A)|member($f11(A,R),A)| -apply(R,$f12(A,R),$f13(A,R))|member($f16(A,R),A).
% 2.00/2.20 0 [] e_quivalence(R,A)|member($f11(A,R),A)| -apply(R,$f12(A,R),$f13(A,R))|member($f15(A,R),A).
% 2.00/2.20 0 [] e_quivalence(R,A)|member($f11(A,R),A)| -apply(R,$f12(A,R),$f13(A,R))|member($f14(A,R),A).
% 2.00/2.20 0 [] e_quivalence(R,A)|member($f11(A,R),A)| -apply(R,$f12(A,R),$f13(A,R))|apply(R,$f16(A,R),$f15(A,R)).
% 2.00/2.20 0 [] e_quivalence(R,A)|member($f11(A,R),A)| -apply(R,$f12(A,R),$f13(A,R))|apply(R,$f15(A,R),$f14(A,R)).
% 2.00/2.20 0 [] e_quivalence(R,A)|member($f11(A,R),A)| -apply(R,$f12(A,R),$f13(A,R))| -apply(R,$f16(A,R),$f14(A,R)).
% 2.00/2.20 0 [] e_quivalence(R,A)| -apply(R,$f11(A,R),$f11(A,R))|member($f13(A,R),A)|member($f16(A,R),A).
% 2.00/2.20 0 [] e_quivalence(R,A)| -apply(R,$f11(A,R),$f11(A,R))|member($f13(A,R),A)|member($f15(A,R),A).
% 2.00/2.20 0 [] e_quivalence(R,A)| -apply(R,$f11(A,R),$f11(A,R))|member($f13(A,R),A)|member($f14(A,R),A).
% 2.00/2.20 0 [] e_quivalence(R,A)| -apply(R,$f11(A,R),$f11(A,R))|member($f13(A,R),A)|apply(R,$f16(A,R),$f15(A,R)).
% 2.00/2.20 0 [] e_quivalence(R,A)| -apply(R,$f11(A,R),$f11(A,R))|member($f13(A,R),A)|apply(R,$f15(A,R),$f14(A,R)).
% 2.00/2.20 0 [] e_quivalence(R,A)| -apply(R,$f11(A,R),$f11(A,R))|member($f13(A,R),A)| -apply(R,$f16(A,R),$f14(A,R)).
% 2.00/2.20 0 [] e_quivalence(R,A)| -apply(R,$f11(A,R),$f11(A,R))|member($f12(A,R),A)|member($f16(A,R),A).
% 2.00/2.20 0 [] e_quivalence(R,A)| -apply(R,$f11(A,R),$f11(A,R))|member($f12(A,R),A)|member($f15(A,R),A).
% 2.00/2.20 0 [] e_quivalence(R,A)| -apply(R,$f11(A,R),$f11(A,R))|member($f12(A,R),A)|member($f14(A,R),A).
% 2.00/2.20 0 [] e_quivalence(R,A)| -apply(R,$f11(A,R),$f11(A,R))|member($f12(A,R),A)|apply(R,$f16(A,R),$f15(A,R)).
% 2.00/2.20 0 [] e_quivalence(R,A)| -apply(R,$f11(A,R),$f11(A,R))|member($f12(A,R),A)|apply(R,$f15(A,R),$f14(A,R)).
% 2.00/2.20 0 [] e_quivalence(R,A)| -apply(R,$f11(A,R),$f11(A,R))|member($f12(A,R),A)| -apply(R,$f16(A,R),$f14(A,R)).
% 2.00/2.20 0 [] e_quivalence(R,A)| -apply(R,$f11(A,R),$f11(A,R))|apply(R,$f13(A,R),$f12(A,R))|member($f16(A,R),A).
% 2.00/2.20 0 [] e_quivalence(R,A)| -apply(R,$f11(A,R),$f11(A,R))|apply(R,$f13(A,R),$f12(A,R))|member($f15(A,R),A).
% 2.00/2.20 0 [] e_quivalence(R,A)| -apply(R,$f11(A,R),$f11(A,R))|apply(R,$f13(A,R),$f12(A,R))|member($f14(A,R),A).
% 2.00/2.20 0 [] e_quivalence(R,A)| -apply(R,$f11(A,R),$f11(A,R))|apply(R,$f13(A,R),$f12(A,R))|apply(R,$f16(A,R),$f15(A,R)).
% 2.00/2.20 0 [] e_quivalence(R,A)| -apply(R,$f11(A,R),$f11(A,R))|apply(R,$f13(A,R),$f12(A,R))|apply(R,$f15(A,R),$f14(A,R)).
% 2.00/2.20 0 [] e_quivalence(R,A)| -apply(R,$f11(A,R),$f11(A,R))|apply(R,$f13(A,R),$f12(A,R))| -apply(R,$f16(A,R),$f14(A,R)).
% 2.00/2.20 0 [] e_quivalence(R,A)| -apply(R,$f11(A,R),$f11(A,R))| -apply(R,$f12(A,R),$f13(A,R))|member($f16(A,R),A).
% 2.00/2.20 0 [] e_quivalence(R,A)| -apply(R,$f11(A,R),$f11(A,R))| -apply(R,$f12(A,R),$f13(A,R))|member($f15(A,R),A).
% 2.00/2.20 0 [] e_quivalence(R,A)| -apply(R,$f11(A,R),$f11(A,R))| -apply(R,$f12(A,R),$f13(A,R))|member($f14(A,R),A).
% 2.00/2.20 0 [] e_quivalence(R,A)| -apply(R,$f11(A,R),$f11(A,R))| -apply(R,$f12(A,R),$f13(A,R))|apply(R,$f16(A,R),$f15(A,R)).
% 2.00/2.20 0 [] e_quivalence(R,A)| -apply(R,$f11(A,R),$f11(A,R))| -apply(R,$f12(A,R),$f13(A,R))|apply(R,$f15(A,R),$f14(A,R)).
% 2.00/2.20 0 [] e_quivalence(R,A)| -apply(R,$f11(A,R),$f11(A,R))| -apply(R,$f12(A,R),$f13(A,R))| -apply(R,$f16(A,R),$f14(A,R)).
% 2.00/2.20 0 [] -member(X,e_quivalence_class(A,E,R))|member(X,E).
% 2.00/2.20 0 [] -member(X,e_quivalence_class(A,E,R))|apply(R,A,X).
% 2.00/2.20 0 [] member(X,e_quivalence_class(A,E,R))| -member(X,E)| -apply(R,A,X).
% 2.00/2.20 0 [] -pre_order(R,E)| -member(X,E)|apply(R,X,X).
% 2.00/2.20 0 [] -pre_order(R,E)| -member(X7,E)| -member(Y,E)| -member(Z,E)| -apply(R,X7,Y)| -apply(R,Y,Z)|apply(R,X7,Z).
% 2.00/2.20 0 [] pre_order(R,E)|member($f17(R,E),E)|member($f20(R,E),E).
% 2.00/2.20 0 [] pre_order(R,E)|member($f17(R,E),E)|member($f19(R,E),E).
% 2.00/2.20 0 [] pre_order(R,E)|member($f17(R,E),E)|member($f18(R,E),E).
% 2.00/2.20 0 [] pre_order(R,E)|member($f17(R,E),E)|apply(R,$f20(R,E),$f19(R,E)).
% 2.00/2.20 0 [] pre_order(R,E)|member($f17(R,E),E)|apply(R,$f19(R,E),$f18(R,E)).
% 2.00/2.20 0 [] pre_order(R,E)|member($f17(R,E),E)| -apply(R,$f20(R,E),$f18(R,E)).
% 2.00/2.20 0 [] pre_order(R,E)| -apply(R,$f17(R,E),$f17(R,E))|member($f20(R,E),E).
% 2.00/2.20 0 [] pre_order(R,E)| -apply(R,$f17(R,E),$f17(R,E))|member($f19(R,E),E).
% 2.00/2.20 0 [] pre_order(R,E)| -apply(R,$f17(R,E),$f17(R,E))|member($f18(R,E),E).
% 2.00/2.20 0 [] pre_order(R,E)| -apply(R,$f17(R,E),$f17(R,E))|apply(R,$f20(R,E),$f19(R,E)).
% 2.00/2.20 0 [] pre_order(R,E)| -apply(R,$f17(R,E),$f17(R,E))|apply(R,$f19(R,E),$f18(R,E)).
% 2.00/2.20 0 [] pre_order(R,E)| -apply(R,$f17(R,E),$f17(R,E))| -apply(R,$f20(R,E),$f18(R,E)).
% 2.00/2.20 0 [] e_quivalence($c2,$c3).
% 2.00/2.20 0 [] member($c1,$c3).
% 2.00/2.20 0 [] -member($c1,e_quivalence_class($c1,$c3,$c2)).
% 2.00/2.20 end_of_list.
% 2.00/2.20
% 2.00/2.20 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 2.00/2.20
% 2.00/2.20 This ia a non-Horn set with equality. The strategy will be
% 2.00/2.20 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.00/2.20 deletion, with positive clauses in sos and nonpositive
% 2.00/2.20 clauses in usable.
% 2.00/2.20
% 2.00/2.20 dependent: set(knuth_bendix).
% 2.00/2.20 dependent: set(anl_eq).
% 2.00/2.20 dependent: set(para_from).
% 2.00/2.20 dependent: set(para_into).
% 2.00/2.20 dependent: clear(para_from_right).
% 2.00/2.20 dependent: clear(para_into_right).
% 2.00/2.20 dependent: set(para_from_vars).
% 2.00/2.20 dependent: set(eq_units_both_ways).
% 2.00/2.20 dependent: set(dynamic_demod_all).
% 2.00/2.20 dependent: set(dynamic_demod).
% 2.00/2.20 dependent: set(order_eq).
% 2.00/2.20 dependent: set(back_demod).
% 2.00/2.20 dependent: set(lrpo).
% 2.00/2.20 dependent: set(hyper_res).
% 2.00/2.20 dependent: set(unit_deletion).
% 2.00/2.20 dependent: set(factor).
% 2.00/2.20
% 2.00/2.20 ------------> process usable:
% 2.00/2.20 ** KEPT (pick-wt=9): 1 [] -subset(A,B)| -member(C,A)|member(C,B).
% 2.00/2.20 ** KEPT (pick-wt=8): 2 [] subset(A,B)| -member($f1(A,B),B).
% 2.00/2.20 ** KEPT (pick-wt=6): 3 [] -e_qual_set(A,B)|subset(A,B).
% 2.00/2.20 ** KEPT (pick-wt=6): 4 [] -e_qual_set(A,B)|subset(B,A).
% 2.00/2.20 ** KEPT (pick-wt=9): 5 [] e_qual_set(A,B)| -subset(A,B)| -subset(B,A).
% 2.00/2.20 ** KEPT (pick-wt=7): 6 [] -member(A,power_set(B))|subset(A,B).
% 2.00/2.20 ** KEPT (pick-wt=7): 7 [] member(A,power_set(B))| -subset(A,B).
% 2.00/2.20 ** KEPT (pick-wt=8): 8 [] -member(A,intersection(B,C))|member(A,B).
% 2.00/2.20 ** KEPT (pick-wt=8): 9 [] -member(A,intersection(B,C))|member(A,C).
% 2.00/2.20 ** KEPT (pick-wt=11): 10 [] member(A,intersection(B,C))| -member(A,B)| -member(A,C).
% 2.00/2.20 ** KEPT (pick-wt=11): 11 [] -member(A,union(B,C))|member(A,B)|member(A,C).
% 2.00/2.20 ** KEPT (pick-wt=8): 12 [] member(A,union(B,C))| -member(A,B).
% 2.00/2.20 ** KEPT (pick-wt=8): 13 [] member(A,union(B,C))| -member(A,C).
% 2.00/2.20 ** KEPT (pick-wt=3): 14 [] -member(A,empty_set).
% 2.00/2.20 ** KEPT (pick-wt=8): 15 [] -member(A,difference(B,C))|member(A,B).
% 2.00/2.20 ** KEPT (pick-wt=8): 16 [] -member(A,difference(B,C))| -member(A,C).
% 2.00/2.20 ** KEPT (pick-wt=11): 17 [] member(A,difference(B,C))| -member(A,B)|member(A,C).
% 2.00/2.20 ** KEPT (pick-wt=7): 18 [] -member(A,singleton(B))|A=B.
% 2.00/2.20 ** KEPT (pick-wt=7): 19 [] member(A,singleton(B))|A!=B.
% 2.00/2.20 ** KEPT (pick-wt=11): 20 [] -member(A,unordered_pair(B,C))|A=B|A=C.
% 2.00/2.20 ** KEPT (pick-wt=8): 21 [] member(A,unordered_pair(B,C))|A!=B.
% 2.00/2.20 ** KEPT (pick-wt=8): 22 [] member(A,unordered_pair(B,C))|A!=C.
% 2.00/2.20 ** KEPT (pick-wt=9): 23 [] -member(A,sum(B))|member($f2(A,B),B).
% 2.00/2.20 ** KEPT (pick-wt=9): 24 [] -member(A,sum(B))|member(A,$f2(A,B)).
% 2.00/2.20 ** KEPT (pick-wt=10): 25 [] member(A,sum(B))| -member(C,B)| -member(A,C).
% 2.00/2.20 ** KEPT (pick-wt=10): 26 [] -member(A,product(B))| -member(C,B)|member(A,C).
% 2.00/2.20 ** KEPT (pick-wt=9): 27 [] member(A,product(B))| -member(A,$f3(A,B)).
% 2.00/2.20 ** KEPT (pick-wt=9): 28 [] -disjoint(A,B)| -member(C,A)| -member(C,B).
% 2.00/2.20 ** KEPT (pick-wt=9): 29 [] -partition(A,B)| -member(C,A)|subset(C,B).
% 2.00/2.20 ** KEPT (pick-wt=12): 30 [] -partition(A,B)| -member(C,B)|member($f5(A,B,C),A).
% 2.00/2.20 ** KEPT (pick-wt=12): 31 [] -partition(A,B)| -member(C,B)|member(C,$f5(A,B,C)).
% 2.00/2.20 ** KEPT (pick-wt=18): 32 [] -partition(A,B)| -member(C,A)| -member(D,A)| -member(E,C)| -member(E,D)|C=D.
% 2.00/2.20 ** KEPT (pick-wt=20): 34 [copy,33,flip.4] partition(A,B)|member($f6(A,B),A)|member($f7(A,B),B)|$f9(A,B)!=$f10(A,B).
% 2.00/2.20 ** KEPT (pick-wt=21): 35 [] partition(A,B)|member($f6(A,B),A)| -member(C,A)| -member($f7(A,B),C)|member($f10(A,B),A).
% 2.00/2.20 ** KEPT (pick-wt=21): 36 [] partition(A,B)|member($f6(A,B),A)| -member(C,A)| -member($f7(A,B),C)|member($f9(A,B),A).
% 2.00/2.20 ** KEPT (pick-wt=23): 37 [] partition(A,B)|member($f6(A,B),A)| -member(C,A)| -member($f7(A,B),C)|member($f8(A,B),$f10(A,B)).
% 2.00/2.20 ** KEPT (pick-wt=23): 38 [] partition(A,B)|member($f6(A,B),A)| -member(C,A)| -member($f7(A,B),C)|member($f8(A,B),$f9(A,B)).
% 2.00/2.20 ** KEPT (pick-wt=23): 40 [copy,39,flip.5] partition(A,B)|member($f6(A,B),A)| -member(C,A)| -member($f7(A,B),C)|$f9(A,B)!=$f10(A,B).
% 2.00/2.20 ** KEPT (pick-wt=18): 41 [] partition(A,B)| -subset($f6(A,B),B)|member($f7(A,B),B)|member($f10(A,B),A).
% 2.00/2.20 ** KEPT (pick-wt=18): 42 [] partition(A,B)| -subset($f6(A,B),B)|member($f7(A,B),B)|member($f9(A,B),A).
% 2.00/2.20 ** KEPT (pick-wt=20): 43 [] partition(A,B)| -subset($f6(A,B),B)|member($f7(A,B),B)|member($f8(A,B),$f10(A,B)).
% 2.00/2.20 ** KEPT (pick-wt=20): 44 [] partition(A,B)| -subset($f6(A,B),B)|member($f7(A,B),B)|member($f8(A,B),$f9(A,B)).
% 2.00/2.20 ** KEPT (pick-wt=20): 46 [copy,45,flip.4] partition(A,B)| -subset($f6(A,B),B)|member($f7(A,B),B)|$f9(A,B)!=$f10(A,B).
% 2.00/2.20 ** KEPT (pick-wt=21): 47 [] partition(A,B)| -subset($f6(A,B),B)| -member(C,A)| -member($f7(A,B),C)|member($f10(A,B),A).
% 2.00/2.20 ** KEPT (pick-wt=21): 48 [] partition(A,B)| -subset($f6(A,B),B)| -member(C,A)| -member($f7(A,B),C)|member($f9(A,B),A).
% 2.00/2.20 ** KEPT (pick-wt=23): 49 [] partition(A,B)| -subset($f6(A,B),B)| -member(C,A)| -member($f7(A,B),C)|member($f8(A,B),$f10(A,B)).
% 2.00/2.20 ** KEPT (pick-wt=23): 50 [] partition(A,B)| -subset($f6(A,B),B)| -member(C,A)| -member($f7(A,B),C)|member($f8(A,B),$f9(A,B)).
% 2.00/2.20 ** KEPT (pick-wt=23): 52 [copy,51,flip.5] partition(A,B)| -subset($f6(A,B),B)| -member(C,A)| -member($f7(A,B),C)|$f9(A,B)!=$f10(A,B).
% 2.00/2.20 ** KEPT (pick-wt=10): 53 [] -e_quivalence(A,B)| -member(C,B)|apply(A,C,C).
% 2.00/2.20 ** KEPT (pick-wt=17): 54 [] -e_quivalence(A,B)| -member(C,B)| -member(D,B)| -apply(A,C,D)|apply(A,D,C).
% 2.00/2.20 ** KEPT (pick-wt=24): 55 [] -e_quivalence(A,B)| -member(C,B)| -member(D,B)| -member(E,B)| -apply(A,C,D)| -apply(A,D,E)|apply(A,C,E).
% 2.00/2.20 ** KEPT (pick-wt=21): 56 [] e_quivalence(A,B)|member($f11(B,A),B)|member($f13(B,A),B)| -apply(A,$f16(B,A),$f14(B,A)).
% 2.00/2.20 ** KEPT (pick-wt=21): 57 [] e_quivalence(A,B)|member($f11(B,A),B)|member($f12(B,A),B)| -apply(A,$f16(B,A),$f14(B,A)).
% 2.00/2.20 ** KEPT (pick-wt=24): 58 [] e_quivalence(A,B)|member($f11(B,A),B)|apply(A,$f13(B,A),$f12(B,A))| -apply(A,$f16(B,A),$f14(B,A)).
% 2.00/2.20 ** KEPT (pick-wt=21): 59 [] e_quivalence(A,B)|member($f11(B,A),B)| -apply(A,$f12(B,A),$f13(B,A))|member($f16(B,A),B).
% 2.00/2.20 ** KEPT (pick-wt=21): 60 [] e_quivalence(A,B)|member($f11(B,A),B)| -apply(A,$f12(B,A),$f13(B,A))|member($f15(B,A),B).
% 2.00/2.20 ** KEPT (pick-wt=21): 61 [] e_quivalence(A,B)|member($f11(B,A),B)| -apply(A,$f12(B,A),$f13(B,A))|member($f14(B,A),B).
% 2.00/2.20 ** KEPT (pick-wt=24): 62 [] e_quivalence(A,B)|member($f11(B,A),B)| -apply(A,$f12(B,A),$f13(B,A))|apply(A,$f16(B,A),$f15(B,A)).
% 2.00/2.20 ** KEPT (pick-wt=24): 63 [] e_quivalence(A,B)|member($f11(B,A),B)| -apply(A,$f12(B,A),$f13(B,A))|apply(A,$f15(B,A),$f14(B,A)).
% 2.00/2.20 ** KEPT (pick-wt=24): 64 [] e_quivalence(A,B)|member($f11(B,A),B)| -apply(A,$f12(B,A),$f13(B,A))| -apply(A,$f16(B,A),$f14(B,A)).
% 2.00/2.20 ** KEPT (pick-wt=21): 65 [] e_quivalence(A,B)| -apply(A,$f11(B,A),$f11(B,A))|member($f13(B,A),B)|member($f16(B,A),B).
% 2.00/2.20 ** KEPT (pick-wt=21): 66 [] e_quivalence(A,B)| -apply(A,$f11(B,A),$f11(B,A))|member($f13(B,A),B)|member($f15(B,A),B).
% 2.00/2.20 ** KEPT (pick-wt=21): 67 [] e_quivalence(A,B)| -apply(A,$f11(B,A),$f11(B,A))|member($f13(B,A),B)|member($f14(B,A),B).
% 2.00/2.20 ** KEPT (pick-wt=24): 68 [] e_quivalence(A,B)| -apply(A,$f11(B,A),$f11(B,A))|member($f13(B,A),B)|apply(A,$f16(B,A),$f15(B,A)).
% 2.00/2.20 ** KEPT (pick-wt=24): 69 [] e_quivalence(A,B)| -apply(A,$f11(B,A),$f11(B,A))|member($f13(B,A),B)|apply(A,$f15(B,A),$f14(B,A)).
% 2.00/2.20 ** KEPT (pick-wt=24): 70 [] e_quivalence(A,B)| -apply(A,$f11(B,A),$f11(B,A))|member($f13(B,A),B)| -apply(A,$f16(B,A),$f14(B,A)).
% 2.00/2.20 ** KEPT (pick-wt=21): 71 [] e_quivalence(A,B)| -apply(A,$f11(B,A),$f11(B,A))|member($f12(B,A),B)|member($f16(B,A),B).
% 2.00/2.20 ** KEPT (pick-wt=21): 72 [] e_quivalence(A,B)| -apply(A,$f11(B,A),$f11(B,A))|member($f12(B,A),B)|member($f15(B,A),B).
% 2.00/2.20 ** KEPT (pick-wt=21): 73 [] e_quivalence(A,B)| -apply(A,$f11(B,A),$f11(B,A))|member($f12(B,A),B)|member($f14(B,A),B).
% 2.00/2.20 ** KEPT (pick-wt=24): 74 [] e_quivalence(A,B)| -apply(A,$f11(B,A),$f11(B,A))|member($f12(B,A),B)|apply(A,$f16(B,A),$f15(B,A)).
% 2.00/2.20 ** KEPT (pick-wt=24): 75 [] e_quivalence(A,B)| -apply(A,$f11(B,A),$f11(B,A))|member($f12(B,A),B)|apply(A,$f15(B,A),$f14(B,A)).
% 2.00/2.20 ** KEPT (pick-wt=24): 76 [] e_quivalence(A,B)| -apply(A,$f11(B,A),$f11(B,A))|member($f12(B,A),B)| -apply(A,$f16(B,A),$f14(B,A)).
% 2.00/2.20 ** KEPT (pick-wt=24): 77 [] e_quivalence(A,B)| -apply(A,$f11(B,A),$f11(B,A))|apply(A,$f13(B,A),$f12(B,A))|member($f16(B,A),B).
% 2.00/2.20 ** KEPT (pick-wt=24): 78 [] e_quivalence(A,B)| -apply(A,$f11(B,A),$f11(B,A))|apply(A,$f13(B,A),$f12(B,A))|member($f15(B,A),B).
% 2.00/2.20 ** KEPT (pick-wt=24): 79 [] e_quivalence(A,B)| -apply(A,$f11(B,A),$f11(B,A))|apply(A,$f13(B,A),$f12(B,A))|member($f14(B,A),B).
% 2.00/2.20 ** KEPT (pick-wt=27): 80 [] e_quivalence(A,B)| -apply(A,$f11(B,A),$f11(B,A))|apply(A,$f13(B,A),$f12(B,A))|apply(A,$f16(B,A),$f15(B,A)).
% 2.00/2.20 ** KEPT (pick-wt=27): 81 [] e_quivalence(A,B)| -apply(A,$f11(B,A),$f11(B,A))|apply(A,$f13(B,A),$f12(B,A))|apply(A,$f15(B,A),$f14(B,A)).
% 2.00/2.20 ** KEPT (pick-wt=27): 82 [] e_quivalence(A,B)| -apply(A,$f11(B,A),$f11(B,A))|apply(A,$f13(B,A),$f12(B,A))| -apply(A,$f16(B,A),$f14(B,A)).
% 2.00/2.20 ** KEPT (pick-wt=24): 83 [] e_quivalence(A,B)| -apply(A,$f11(B,A),$f11(B,A))| -apply(A,$f12(B,A),$f13(B,A))|member($f16(B,A),B).
% 2.00/2.20 ** KEPT (pick-wt=24): 84 [] e_quivalence(A,B)| -apply(A,$f11(B,A),$f11(B,A))| -apply(A,$f12(B,A),$f13(B,A))|member($f15(B,A),B).
% 2.00/2.20 ** KEPT (pick-wt=24): 85 [] e_quivalence(A,B)| -apply(A,$f11(B,A),$f11(B,A))| -apply(A,$f12(B,A),$f13(B,A))|member($f14(B,A),B).
% 2.00/2.20 ** KEPT (pick-wt=27): 86 [] e_quivalence(A,B)| -apply(A,$f11(B,A),$f11(B,A))| -apply(A,$f12(B,A),$f13(B,A))|apply(A,$f16(B,A),$f15(B,A)).
% 2.00/2.20 ** KEPT (pick-wt=27): 87 [] e_quivalence(A,B)| -apply(A,$f11(B,A),$f11(B,A))| -apply(A,$f12(B,A),$f13(B,A))|apply(A,$f15(B,A),$f14(B,A)).
% 2.00/2.20 ** KEPT (pick-wt=27): 88 [] e_quivalence(A,B)| -apply(A,$f11(B,A),$f11(B,A))| -apply(A,$f12(B,A),$f13(B,A))| -apply(A,$f16(B,A),$f14(B,A)).
% 2.00/2.20 ** KEPT (pick-wt=9): 89 [] -member(A,e_quivalence_class(B,C,D))|member(A,C).
% 2.00/2.20 ** KEPT (pick-wt=10): 90 [] -member(A,e_quivalence_class(B,C,D))|apply(D,B,A).
% 2.00/2.20 ** KEPT (pick-wt=13): 91 [] member(A,e_quivalence_class(B,C,D))| -member(A,C)| -apply(D,B,A).
% 2.00/2.20 ** KEPT (pick-wt=10): 92 [] -pre_order(A,B)| -member(C,B)|apply(A,C,C).
% 2.00/2.20 ** KEPT (pick-wt=24): 93 [] -pre_order(A,B)| -member(C,B)| -member(D,B)| -member(E,B)| -apply(A,C,D)| -apply(A,D,E)|apply(A,C,E).
% 2.00/2.20 ** KEPT (pick-wt=16): 94 [] pre_order(A,B)|member($f17(A,B),B)| -apply(A,$f20(A,B),$f18(A,B)).
% 2.00/2.20 ** KEPT (pick-wt=16): 95 [] pre_order(A,B)| -apply(A,$f17(A,B),$f17(A,B))|member($f20(A,B),B).
% 2.00/2.20 ** KEPT (pick-wt=16): 96 [] pre_order(A,B)| -apply(A,$f17(A,B),$f17(A,B))|member($f19(A,B),B).
% 2.00/2.20 ** KEPT (pick-wt=16): 97 [] pre_order(A,B)| -apply(A,$f17(A,B),$f17(A,B))|member($f18(A,B),B).
% 2.00/2.20 ** KEPT (pick-wt=19): 98 [] pre_order(A,B)| -apply(A,$f17(A,B),$f17(A,B))|apply(A,$f20(A,B),$f19(A,B)).
% 2.00/2.20 ** KEPT (pick-wt=19): 99 [] pre_order(A,B)| -apply(A,$f17(A,B),$f17(A,B))|apply(A,$f19(A,B),$f18(A,B)).
% 2.00/2.20 ** KEPT (pick-wt=19): 100 [] pre_order(A,B)| -apply(A,$f17(A,B),$f17(A,B))| -apply(A,$f20(A,B),$f18(A,B)).
% 2.00/2.20 ** KEPT (pick-wt=6): 101 [] -member($c1,e_quivalence_class($c1,$c3,$c2)).
% 2.00/2.20
% 2.00/2.20 ------------> process sos:
% 2.00/2.20 ** KEPT (pick-wt=3): 114 [] A=A.
% 2.00/2.20 ** KEPT (pick-wt=8): 115 [] subset(A,B)|member($f1(A,B),A).
% 2.00/2.20 ** KEPT (pick-wt=9): 116 [] member(A,product(B))|member($f3(A,B),B).
% 2.00/2.20 ** KEPT (pick-wt=8): 117 [] disjoint(A,B)|member($f4(A,B),A).
% 2.00/2.20 ** KEPT (pick-wt=8): 118 [] disjoint(A,B)|member($f4(A,B),B).
% 2.00/2.20 ** KEPT (pick-wt=18): 119 [] partition(A,B)|member($f6(A,B),A)|member($f7(A,B),B)|member($f10(A,B),A).
% 2.00/2.20 ** KEPT (pick-wt=18): 120 [] partition(A,B)|member($f6(A,B),A)|member($f7(A,B),B)|member($f9(A,B),A).
% 2.00/2.20 ** KEPT (pick-wt=20): 121 [] partition(A,B)|member($f6(A,B),A)|member($f7(A,B),B)|member($f8(A,B),$f10(A,B)).
% 2.00/2.20 ** KEPT (pick-wt=20): 122 [] partition(A,B)|member($f6(A,B),A)|member($f7(A,B),B)|member($f8(A,B),$f9(A,B)).
% 2.00/2.20 ** KEPT (pick-wt=18): 123 [] e_quivalence(A,B)|member($f11(B,A),B)|member($f13(B,A),B)|member($f16(B,A),B).
% 2.00/2.20 ** KEPT (pick-wt=18): 124 [] e_quivalence(A,B)|member($f11(B,A),B)|member($f13(B,A),B)|member($f15(B,A),B).
% 2.00/2.20 ** KEPT (pick-wt=18): 125 [] e_quivalence(A,B)|member($f11(B,A),B)|member($f13(B,A),B)|member($f14(B,A),B).
% 2.00/2.20 ** KEPT (pick-wt=21): 126 [] e_quivalence(A,B)|member($f11(B,A),B)|member($f13(B,A),B)|apply(A,$f16(B,A),$f15(B,A)).
% 2.00/2.20 ** KEPT (pick-wt=21): 127 [] e_quivalence(A,B)|member($f11(B,A),B)|member($f13(B,A),B)|apply(A,$f15(B,A),$f14(B,A)).
% 2.00/2.20 ** KEPT (pick-wt=18): 128 [] e_quivalence(A,B)|member($f11(B,A),B)|member($f12(B,A),B)|member($f16(B,A),B).
% 2.00/2.20 ** KEPT (pick-wt=18): 129 [] e_quivalence(A,B)|member($f11(B,A),B)|member($f12(B,A),B)|member($f15(B,A),B).
% 2.00/2.20 ** KEPT (pick-wt=18): 130 [] e_quivalence(A,B)|member($f11(B,A),B)|member($f12(B,A),B)|member($f14(B,A),B).
% 2.00/2.20 ** KEPT (pick-wt=21): 131 [] e_quivalence(A,B)|member($f11(B,A),B)|member($f12(B,A),B)|apply(A,$f16(B,A),$f15(B,A)).
% 2.00/2.20 ** KEPT (pick-wt=21): 132 [] e_quivalence(A,B)|member($f11(B,A),B)|member($f12(B,A),B)|apply(A,$f15(B,A),$f14(B,A)).
% 2.00/2.20 ** KEPT (pick-wt=21): 133 [] e_quivalence(A,B)|member($f11(B,A),B)|apply(A,$f13(B,A),$f12(B,A))|member($f16(B,A),B).
% 2.00/2.20 ** KEPT (pick-wt=21): 134 [] e_quivalence(A,B)|member($f11(B,A),B)|apply(A,$f13(B,A),$f12(B,A))|member($f15(B,A),B).
% 2.00/2.21 ** KEPT (pick-wt=21): 135 [] e_quivalence(A,B)|member($f11(B,A),B)|apply(A,$f13(B,A),$f12(B,A))|member($f14(B,A),B).
% 2.00/2.21 ** KEPT (pick-wt=24): 136 [] e_quivalence(A,B)|member($f11(B,A),B)|apply(A,$f13(B,A),$f12(B,A))|apply(A,$f16(B,A),$f15(B,A)).
% 2.00/2.21 ** KEPT (pick-wt=24): 137 [] e_quivalence(A,B)|member($f11(B,A),B)|apply(A,$f13(B,A),$f12(B,A))|apply(A,$f15(B,A),$f14(B,A)).
% 2.00/2.21 ** KEPT (pick-wt=13): 138 [] pre_order(A,B)|member($f17(A,B),B)|member($f20(A,B),B).
% 2.00/2.21 ** KEPT (pick-wt=13): 139 [] pre_order(A,B)|member($f17(A,B),B)|member($f19(A,B),B).
% 2.00/2.21 ** KEPT (pick-wt=13): 140 [] pre_order(A,B)|member($f17(A,B),B)|member($f18(A,B),B).
% 2.00/2.21 ** KEPT (pick-wt=16): 141 [] pre_order(A,B)|member($f17(A,B),B)|apply(A,$f20(A,B),$f19(A,B)).
% 2.00/2.21 ** KEPT (pick-wt=16): 142 [] pre_order(A,B)|member($f17(A,B),B)|apply(A,$f19(A,B),$f18(A,B)).
% 2.00/2.21 ** KEPT (pick-wt=3): 143 [] e_quivalence($c2,$c3).
% 2.00/2.21 ** KEPT (pick-wt=3): 144 [] member($c1,$c3).
% 2.00/2.21 Following clause subsumed by 114 during input processing: 0 [copy,114,flip.1] A=A.
% 2.00/2.21 114 back subsumes 113.
% 2.00/2.21 114 back subsumes 108.
% 2.00/2.21
% 2.00/2.21 ======= end of input processing =======
% 2.00/2.21
% 2.00/2.21 =========== start of search ===========
% 2.00/2.21
% 2.00/2.21 -------- PROOF --------
% 2.00/2.21
% 2.00/2.21 ----> UNIT CONFLICT at 0.02 sec ----> 208 [binary,207.1,101.1] $F.
% 2.00/2.21
% 2.00/2.21 Length of proof is 2. Level of proof is 2.
% 2.00/2.21
% 2.00/2.21 ---------------- PROOF ----------------
% 2.00/2.21 % SZS status Theorem
% 2.00/2.21 % SZS output start Refutation
% See solution above
% 2.00/2.21 ------------ end of proof -------------
% 2.00/2.21
% 2.00/2.21
% 2.00/2.21 Search stopped by max_proofs option.
% 2.00/2.21
% 2.00/2.21
% 2.00/2.21 Search stopped by max_proofs option.
% 2.00/2.21
% 2.00/2.21 ============ end of search ============
% 2.00/2.21
% 2.00/2.21 -------------- statistics -------------
% 2.00/2.21 clauses given 5
% 2.00/2.21 clauses generated 193
% 2.00/2.21 clauses kept 203
% 2.00/2.21 clauses forward subsumed 112
% 2.00/2.21 clauses back subsumed 2
% 2.00/2.21 Kbytes malloced 1953
% 2.00/2.21
% 2.00/2.21 ----------- times (seconds) -----------
% 2.00/2.21 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 2.00/2.21 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.00/2.21 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.00/2.21
% 2.00/2.21 That finishes the proof of the theorem.
% 2.00/2.21
% 2.00/2.21 Process 24912 finished Wed Jul 27 10:32:47 2022
% 2.00/2.21 Otter interrupted
% 2.00/2.21 PROOF FOUND
%------------------------------------------------------------------------------