TSTP Solution File: SET103-7 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : SET103-7 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n007.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:13:07 EDT 2022

% Result   : Unknown 6.65s 6.81s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SET103-7 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.03/0.13  % Command  : otter-tptp-script %s
% 0.13/0.34  % Computer : n007.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Wed Jul 27 10:38:16 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 3.18/3.35  ----- Otter 3.3f, August 2004 -----
% 3.18/3.35  The process was started by sandbox2 on n007.cluster.edu,
% 3.18/3.35  Wed Jul 27 10:38:16 2022
% 3.18/3.35  The command was "./otter".  The process ID is 7999.
% 3.18/3.35  
% 3.18/3.35  set(prolog_style_variables).
% 3.18/3.35  set(auto).
% 3.18/3.35     dependent: set(auto1).
% 3.18/3.35     dependent: set(process_input).
% 3.18/3.35     dependent: clear(print_kept).
% 3.18/3.35     dependent: clear(print_new_demod).
% 3.18/3.35     dependent: clear(print_back_demod).
% 3.18/3.35     dependent: clear(print_back_sub).
% 3.18/3.35     dependent: set(control_memory).
% 3.18/3.35     dependent: assign(max_mem, 12000).
% 3.18/3.35     dependent: assign(pick_given_ratio, 4).
% 3.18/3.35     dependent: assign(stats_level, 1).
% 3.18/3.35     dependent: assign(max_seconds, 10800).
% 3.18/3.35  clear(print_given).
% 3.18/3.35  
% 3.18/3.35  list(usable).
% 3.18/3.35  0 [] A=A.
% 3.18/3.35  0 [] -subclass(X,Y)| -member(U,X)|member(U,Y).
% 3.18/3.35  0 [] member(not_subclass_element(X,Y),X)|subclass(X,Y).
% 3.18/3.35  0 [] -member(not_subclass_element(X,Y),Y)|subclass(X,Y).
% 3.18/3.35  0 [] subclass(X,universal_class).
% 3.18/3.35  0 [] X!=Y|subclass(X,Y).
% 3.18/3.35  0 [] X!=Y|subclass(Y,X).
% 3.18/3.35  0 [] -subclass(X,Y)| -subclass(Y,X)|X=Y.
% 3.18/3.35  0 [] -member(U,unordered_pair(X,Y))|U=X|U=Y.
% 3.18/3.35  0 [] -member(X,universal_class)|member(X,unordered_pair(X,Y)).
% 3.18/3.35  0 [] -member(Y,universal_class)|member(Y,unordered_pair(X,Y)).
% 3.18/3.35  0 [] member(unordered_pair(X,Y),universal_class).
% 3.18/3.35  0 [] unordered_pair(X,X)=singleton(X).
% 3.18/3.35  0 [] unordered_pair(singleton(X),unordered_pair(X,singleton(Y)))=ordered_pair(X,Y).
% 3.18/3.35  0 [] -member(ordered_pair(U,V),cross_product(X,Y))|member(U,X).
% 3.18/3.35  0 [] -member(ordered_pair(U,V),cross_product(X,Y))|member(V,Y).
% 3.18/3.35  0 [] -member(U,X)| -member(V,Y)|member(ordered_pair(U,V),cross_product(X,Y)).
% 3.18/3.35  0 [] -member(Z,cross_product(X,Y))|ordered_pair(first(Z),second(Z))=Z.
% 3.18/3.35  0 [] subclass(element_relation,cross_product(universal_class,universal_class)).
% 3.18/3.35  0 [] -member(ordered_pair(X,Y),element_relation)|member(X,Y).
% 3.18/3.35  0 [] -member(ordered_pair(X,Y),cross_product(universal_class,universal_class))| -member(X,Y)|member(ordered_pair(X,Y),element_relation).
% 3.18/3.35  0 [] -member(Z,intersection(X,Y))|member(Z,X).
% 3.18/3.35  0 [] -member(Z,intersection(X,Y))|member(Z,Y).
% 3.18/3.35  0 [] -member(Z,X)| -member(Z,Y)|member(Z,intersection(X,Y)).
% 3.18/3.35  0 [] -member(Z,complement(X))| -member(Z,X).
% 3.18/3.35  0 [] -member(Z,universal_class)|member(Z,complement(X))|member(Z,X).
% 3.18/3.35  0 [] complement(intersection(complement(X),complement(Y)))=union(X,Y).
% 3.18/3.35  0 [] intersection(complement(intersection(X,Y)),complement(intersection(complement(X),complement(Y))))=symmetric_difference(X,Y).
% 3.18/3.35  0 [] intersection(Xr,cross_product(X,Y))=restrict(Xr,X,Y).
% 3.18/3.35  0 [] intersection(cross_product(X,Y),Xr)=restrict(Xr,X,Y).
% 3.18/3.35  0 [] restrict(X,singleton(Z),universal_class)!=null_class| -member(Z,domain_of(X)).
% 3.18/3.35  0 [] -member(Z,universal_class)|restrict(X,singleton(Z),universal_class)=null_class|member(Z,domain_of(X)).
% 3.18/3.35  0 [] subclass(rotate(X),cross_product(cross_product(universal_class,universal_class),universal_class)).
% 3.18/3.35  0 [] -member(ordered_pair(ordered_pair(U,V),W),rotate(X))|member(ordered_pair(ordered_pair(V,W),U),X).
% 3.18/3.35  0 [] -member(ordered_pair(ordered_pair(V,W),U),X)| -member(ordered_pair(ordered_pair(U,V),W),cross_product(cross_product(universal_class,universal_class),universal_class))|member(ordered_pair(ordered_pair(U,V),W),rotate(X)).
% 3.18/3.35  0 [] subclass(flip(X),cross_product(cross_product(universal_class,universal_class),universal_class)).
% 3.18/3.35  0 [] -member(ordered_pair(ordered_pair(U,V),W),flip(X))|member(ordered_pair(ordered_pair(V,U),W),X).
% 3.18/3.35  0 [] -member(ordered_pair(ordered_pair(V,U),W),X)| -member(ordered_pair(ordered_pair(U,V),W),cross_product(cross_product(universal_class,universal_class),universal_class))|member(ordered_pair(ordered_pair(U,V),W),flip(X)).
% 3.18/3.35  0 [] domain_of(flip(cross_product(Y,universal_class)))=inverse(Y).
% 3.18/3.35  0 [] domain_of(inverse(Z))=range_of(Z).
% 3.18/3.35  0 [] first(not_subclass_element(restrict(Z,X,singleton(Y)),null_class))=domain(Z,X,Y).
% 3.18/3.35  0 [] second(not_subclass_element(restrict(Z,singleton(X),Y),null_class))=range(Z,X,Y).
% 3.18/3.35  0 [] range_of(restrict(Xr,X,universal_class))=image(Xr,X).
% 3.18/3.35  0 [] union(X,singleton(X))=successor(X).
% 3.18/3.35  0 [] subclass(successor_relation,cross_product(universal_class,universal_class)).
% 3.18/3.35  0 [] -member(ordered_pair(X,Y),successor_relation)|successor(X)=Y.
% 3.18/3.35  0 [] successor(X)!=Y| -member(ordered_pair(X,Y),cross_product(universal_class,universal_class))|member(ordered_pair(X,Y),successor_relation).
% 3.18/3.35  0 [] -inductive(X)|member(null_class,X).
% 3.18/3.35  0 [] -inductive(X)|subclass(image(successor_relation,X),X).
% 3.18/3.35  0 [] -member(null_class,X)| -subclass(image(successor_relation,X),X)|inductive(X).
% 3.18/3.35  0 [] inductive(omega).
% 3.18/3.35  0 [] -inductive(Y)|subclass(omega,Y).
% 3.18/3.35  0 [] member(omega,universal_class).
% 3.18/3.35  0 [] domain_of(restrict(element_relation,universal_class,X))=sum_class(X).
% 3.18/3.35  0 [] -member(X,universal_class)|member(sum_class(X),universal_class).
% 3.18/3.35  0 [] complement(image(element_relation,complement(X)))=power_class(X).
% 3.18/3.35  0 [] -member(U,universal_class)|member(power_class(U),universal_class).
% 3.18/3.35  0 [] subclass(compose(Yr,Xr),cross_product(universal_class,universal_class)).
% 3.18/3.35  0 [] -member(ordered_pair(Y,Z),compose(Yr,Xr))|member(Z,image(Yr,image(Xr,singleton(Y)))).
% 3.18/3.35  0 [] -member(Z,image(Yr,image(Xr,singleton(Y))))| -member(ordered_pair(Y,Z),cross_product(universal_class,universal_class))|member(ordered_pair(Y,Z),compose(Yr,Xr)).
% 3.18/3.35  0 [] -single_valued_class(X)|subclass(compose(X,inverse(X)),identity_relation).
% 3.18/3.35  0 [] -subclass(compose(X,inverse(X)),identity_relation)|single_valued_class(X).
% 3.18/3.35  0 [] -function(Xf)|subclass(Xf,cross_product(universal_class,universal_class)).
% 3.18/3.35  0 [] -function(Xf)|subclass(compose(Xf,inverse(Xf)),identity_relation).
% 3.18/3.35  0 [] -subclass(Xf,cross_product(universal_class,universal_class))| -subclass(compose(Xf,inverse(Xf)),identity_relation)|function(Xf).
% 3.18/3.35  0 [] -function(Xf)| -member(X,universal_class)|member(image(Xf,X),universal_class).
% 3.18/3.35  0 [] X=null_class|member(regular(X),X).
% 3.18/3.35  0 [] X=null_class|intersection(X,regular(X))=null_class.
% 3.18/3.35  0 [] sum_class(image(Xf,singleton(Y)))=apply(Xf,Y).
% 3.18/3.35  0 [] function(choice).
% 3.18/3.35  0 [] -member(Y,universal_class)|Y=null_class|member(apply(choice,Y),Y).
% 3.18/3.35  0 [] -one_to_one(Xf)|function(Xf).
% 3.18/3.35  0 [] -one_to_one(Xf)|function(inverse(Xf)).
% 3.18/3.35  0 [] -function(inverse(Xf))| -function(Xf)|one_to_one(Xf).
% 3.18/3.35  0 [] intersection(cross_product(universal_class,universal_class),intersection(cross_product(universal_class,universal_class),complement(compose(complement(element_relation),inverse(element_relation)))))=subset_relation.
% 3.18/3.35  0 [] intersection(inverse(subset_relation),subset_relation)=identity_relation.
% 3.18/3.35  0 [] complement(domain_of(intersection(Xr,identity_relation)))=diagonalise(Xr).
% 3.18/3.35  0 [] intersection(domain_of(X),diagonalise(compose(inverse(element_relation),X)))=cantor(X).
% 3.18/3.35  0 [] -operation(Xf)|function(Xf).
% 3.18/3.35  0 [] -operation(Xf)|cross_product(domain_of(domain_of(Xf)),domain_of(domain_of(Xf)))=domain_of(Xf).
% 3.18/3.35  0 [] -operation(Xf)|subclass(range_of(Xf),domain_of(domain_of(Xf))).
% 3.18/3.35  0 [] -function(Xf)|cross_product(domain_of(domain_of(Xf)),domain_of(domain_of(Xf)))!=domain_of(Xf)| -subclass(range_of(Xf),domain_of(domain_of(Xf)))|operation(Xf).
% 3.18/3.35  0 [] -compatible(Xh,Xf1,Xf2)|function(Xh).
% 3.18/3.35  0 [] -compatible(Xh,Xf1,Xf2)|domain_of(domain_of(Xf1))=domain_of(Xh).
% 3.18/3.35  0 [] -compatible(Xh,Xf1,Xf2)|subclass(range_of(Xh),domain_of(domain_of(Xf2))).
% 3.18/3.35  0 [] -function(Xh)|domain_of(domain_of(Xf1))!=domain_of(Xh)| -subclass(range_of(Xh),domain_of(domain_of(Xf2)))|compatible(Xh,Xf1,Xf2).
% 3.18/3.35  0 [] -homomorphism(Xh,Xf1,Xf2)|operation(Xf1).
% 3.18/3.35  0 [] -homomorphism(Xh,Xf1,Xf2)|operation(Xf2).
% 3.18/3.35  0 [] -homomorphism(Xh,Xf1,Xf2)|compatible(Xh,Xf1,Xf2).
% 3.18/3.35  0 [] -homomorphism(Xh,Xf1,Xf2)| -member(ordered_pair(X,Y),domain_of(Xf1))|apply(Xf2,ordered_pair(apply(Xh,X),apply(Xh,Y)))=apply(Xh,apply(Xf1,ordered_pair(X,Y))).
% 3.18/3.35  0 [] -operation(Xf1)| -operation(Xf2)| -compatible(Xh,Xf1,Xf2)|member(ordered_pair(not_homomorphism1(Xh,Xf1,Xf2),not_homomorphism2(Xh,Xf1,Xf2)),domain_of(Xf1))|homomorphism(Xh,Xf1,Xf2).
% 3.18/3.35  0 [] -operation(Xf1)| -operation(Xf2)| -compatible(Xh,Xf1,Xf2)|apply(Xf2,ordered_pair(apply(Xh,not_homomorphism1(Xh,Xf1,Xf2)),apply(Xh,not_homomorphism2(Xh,Xf1,Xf2))))!=apply(Xh,apply(Xf1,ordered_pair(not_homomorphism1(Xh,Xf1,Xf2),not_homomorphism2(Xh,Xf1,Xf2))))|homomorphism(Xh,Xf1,Xf2).
% 3.18/3.35  0 [] -member(ordered_pair(X,Y),cross_product(U,V))|member(X,unordered_pair(X,Y)).
% 3.18/3.35  0 [] -member(ordered_pair(X,Y),cross_product(U,V))|member(Y,unordered_pair(X,Y)).
% 3.18/3.35  0 [] -member(ordered_pair(U,V),cross_product(X,Y))|member(U,universal_class).
% 3.18/3.35  0 [] -member(ordered_pair(U,V),cross_product(X,Y))|member(V,universal_class).
% 3.18/3.36  0 [] subclass(X,X).
% 3.18/3.36  0 [] -subclass(X,Y)| -subclass(Y,Z)|subclass(X,Z).
% 3.18/3.36  0 [] X=Y|member(not_subclass_element(X,Y),X)|member(not_subclass_element(Y,X),Y).
% 3.18/3.36  0 [] -member(not_subclass_element(X,Y),Y)|X=Y|member(not_subclass_element(Y,X),Y).
% 3.18/3.36  0 [] -member(not_subclass_element(Y,X),X)|X=Y|member(not_subclass_element(X,Y),X).
% 3.18/3.36  0 [] -member(not_subclass_element(X,Y),Y)| -member(not_subclass_element(Y,X),X)|X=Y.
% 3.18/3.36  0 [] -member(Y,intersection(complement(X),X)).
% 3.18/3.36  0 [] -member(Z,null_class).
% 3.18/3.36  0 [] subclass(null_class,X).
% 3.18/3.36  0 [] -subclass(X,null_class)|X=null_class.
% 3.18/3.36  0 [] Z=null_class|member(not_subclass_element(Z,null_class),Z).
% 3.18/3.36  0 [] member(null_class,universal_class).
% 3.18/3.36  0 [] unordered_pair(X,Y)=unordered_pair(Y,X).
% 3.18/3.36  0 [] subclass(singleton(X),unordered_pair(X,Y)).
% 3.18/3.36  0 [] subclass(singleton(Y),unordered_pair(X,Y)).
% 3.18/3.36  0 [] member(Y,universal_class)|unordered_pair(X,Y)=singleton(X).
% 3.18/3.36  0 [] member(X,universal_class)|unordered_pair(X,Y)=singleton(Y).
% 3.18/3.36  0 [] unordered_pair(X,Y)=null_class|member(X,universal_class)|member(Y,universal_class).
% 3.18/3.36  0 [] unordered_pair(X,Y)!=unordered_pair(X,Z)| -member(ordered_pair(Y,Z),cross_product(universal_class,universal_class))|Y=Z.
% 3.18/3.36  0 [] unordered_pair(X,Z)!=unordered_pair(Y,Z)| -member(ordered_pair(X,Y),cross_product(universal_class,universal_class))|X=Y.
% 3.18/3.36  0 [] -member(X,universal_class)|unordered_pair(X,Y)!=null_class.
% 3.18/3.36  0 [] -member(Y,universal_class)|unordered_pair(X,Y)!=null_class.
% 3.18/3.36  0 [] -member(ordered_pair(X,Y),cross_product(U,V))|unordered_pair(X,Y)!=null_class.
% 3.18/3.36  0 [] -member(X,Z)| -member(Y,Z)|subclass(unordered_pair(X,Y),Z).
% 3.18/3.36  0 [] member(singleton(X),universal_class).
% 3.18/3.36  0 [] member(singleton(Y),unordered_pair(X,singleton(Y))).
% 3.18/3.36  0 [] -member(X,universal_class)|member(X,singleton(X)).
% 3.18/3.36  0 [] -member(X,universal_class)|singleton(X)!=null_class.
% 3.18/3.36  0 [] member(null_class,singleton(null_class)).
% 3.18/3.36  0 [] -member(Y,singleton(X))|Y=X.
% 3.18/3.36  0 [] member(X,universal_class)|singleton(X)=null_class.
% 3.18/3.36  0 [] singleton(X)!=singleton(Y)| -member(X,universal_class)|X=Y.
% 3.18/3.36  0 [] singleton(X)!=singleton(Y)| -member(Y,universal_class)|X=Y.
% 3.18/3.36  0 [] unordered_pair(Y,Z)!=singleton(X)| -member(X,universal_class)|X=Y|X=Z.
% 3.18/3.36  0 [] -member(Y,universal_class)|member(member_of(singleton(Y)),universal_class).
% 3.18/3.36  0 [] -member(Y,universal_class)|singleton(member_of(singleton(Y)))=singleton(Y).
% 3.18/3.36  0 [] member(member_of(X),universal_class)|member_of(X)=X.
% 3.18/3.36  0 [] singleton(member_of(X))=X|member_of(X)=X.
% 3.18/3.36  0 [] -member(U,universal_class)|member_of(singleton(U))=U.
% 3.18/3.36  0 [] member(member_of1(X),universal_class)|member_of(X)=X.
% 3.18/3.36  0 [] singleton(member_of1(X))=X|member_of(X)=X.
% 3.18/3.36  0 [] singleton(member_of(X))!=X|member(X,universal_class).
% 3.18/3.36  0 [] singleton(member_of(X))!=X| -member(Y,X)|member_of(X)=Y.
% 3.18/3.36  0 [] -member(X,Y)|subclass(singleton(X),Y).
% 3.18/3.36  0 [] -subclass(X,singleton(Y))|X=null_class|singleton(Y)=X.
% 3.18/3.36  0 [] member(not_subclass_element(intersection(complement(singleton(not_subclass_element(X,null_class))),X),null_class),intersection(complement(singleton(not_subclass_element(X,null_class))),X))|singleton(not_subclass_element(X,null_class))=X|X=null_class.
% 3.18/3.36  0 [] member(not_subclass_element(intersection(complement(singleton(not_subclass_element(X,null_class))),X),null_class),X)|singleton(not_subclass_element(X,null_class))=X|X=null_class.
% 3.18/3.36  0 [] not_subclass_element(intersection(complement(singleton(not_subclass_element(X,null_class))),X),null_class)!=not_subclass_element(X,null_class)|singleton(not_subclass_element(X,null_class))=X|X=null_class.
% 3.18/3.36  0 [] unordered_pair(X,Y)=union(singleton(X),singleton(Y)).
% 3.18/3.36  0 [] member(ordered_pair(X,Y),universal_class).
% 3.18/3.36  0 [] member(singleton(X),ordered_pair(X,Y)).
% 3.18/3.36  0 [] member(unordered_pair(X,singleton(Y)),ordered_pair(X,Y)).
% 3.18/3.36  0 [] unordered_pair(singleton(x),unordered_pair(x,null_class))!=ordered_pair(x,y).
% 3.18/3.36  0 [] -member(y,universal_class).
% 3.18/3.36  end_of_list.
% 3.18/3.36  
% 3.18/3.36  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 3.18/3.36  
% 3.18/3.36  This ia a non-Horn set with equality.  The strategy will be
% 3.18/3.36  Knuth-Bendix, ordered hyper_res, factoring, and unit
% 3.18/3.36  deletion, with positive clauses in sos and nonpositive
% 3.18/3.36  clauses in usable.
% 3.18/3.36  
% 3.18/3.36     dependent: set(knuth_bendix).
% 3.18/3.36     dependent: set(anl_eq).
% 3.18/3.36     dependent: set(para_from).
% 3.18/3.36     dependent: set(para_into).
% 3.18/3.36     dependent: clear(para_from_right).
% 3.18/3.36     dependent: clear(para_into_right).
% 3.18/3.36     dependent: set(para_from_vars).
% 3.18/3.36     dependent: set(eq_units_both_ways).
% 3.18/3.36     dependent: set(dynamic_demod_all).
% 3.18/3.36     dependent: set(dynamic_demod).
% 3.18/3.36     dependent: set(order_eq).
% 3.18/3.36     dependent: set(back_demod).
% 3.18/3.36     dependent: set(lrpo).
% 3.18/3.36     dependent: set(hyper_res).
% 3.18/3.36     dependent: set(unit_deletion).
% 3.18/3.36     dependent: set(factor).
% 3.18/3.36  
% 3.18/3.36  ------------> process usable:
% 3.18/3.36  ** KEPT (pick-wt=9): 1 [] -subclass(A,B)| -member(C,A)|member(C,B).
% 3.18/3.36  ** KEPT (pick-wt=8): 2 [] -member(not_subclass_element(A,B),B)|subclass(A,B).
% 3.18/3.36  ** KEPT (pick-wt=6): 3 [] A!=B|subclass(A,B).
% 3.18/3.36  ** KEPT (pick-wt=6): 4 [] A!=B|subclass(B,A).
% 3.18/3.36  ** KEPT (pick-wt=9): 5 [] -subclass(A,B)| -subclass(B,A)|A=B.
% 3.18/3.36  ** KEPT (pick-wt=11): 6 [] -member(A,unordered_pair(B,C))|A=B|A=C.
% 3.18/3.36  ** KEPT (pick-wt=8): 7 [] -member(A,universal_class)|member(A,unordered_pair(A,B)).
% 3.18/3.36  ** KEPT (pick-wt=8): 8 [] -member(A,universal_class)|member(A,unordered_pair(B,A)).
% 3.18/3.36  ** KEPT (pick-wt=10): 9 [] -member(ordered_pair(A,B),cross_product(C,D))|member(A,C).
% 3.18/3.36  ** KEPT (pick-wt=10): 10 [] -member(ordered_pair(A,B),cross_product(C,D))|member(B,D).
% 3.18/3.36  ** KEPT (pick-wt=13): 11 [] -member(A,B)| -member(C,D)|member(ordered_pair(A,C),cross_product(B,D)).
% 3.18/3.36  ** KEPT (pick-wt=12): 12 [] -member(A,cross_product(B,C))|ordered_pair(first(A),second(A))=A.
% 3.18/3.36  ** KEPT (pick-wt=8): 13 [] -member(ordered_pair(A,B),element_relation)|member(A,B).
% 3.18/3.36  ** KEPT (pick-wt=15): 14 [] -member(ordered_pair(A,B),cross_product(universal_class,universal_class))| -member(A,B)|member(ordered_pair(A,B),element_relation).
% 3.18/3.36  ** KEPT (pick-wt=8): 15 [] -member(A,intersection(B,C))|member(A,B).
% 3.18/3.36  ** KEPT (pick-wt=8): 16 [] -member(A,intersection(B,C))|member(A,C).
% 3.18/3.36  ** KEPT (pick-wt=11): 17 [] -member(A,B)| -member(A,C)|member(A,intersection(B,C)).
% 3.18/3.36  ** KEPT (pick-wt=7): 18 [] -member(A,complement(B))| -member(A,B).
% 3.18/3.36  ** KEPT (pick-wt=10): 19 [] -member(A,universal_class)|member(A,complement(B))|member(A,B).
% 3.18/3.36  ** KEPT (pick-wt=11): 20 [] restrict(A,singleton(B),universal_class)!=null_class| -member(B,domain_of(A)).
% 3.18/3.36  ** KEPT (pick-wt=14): 21 [] -member(A,universal_class)|restrict(B,singleton(A),universal_class)=null_class|member(A,domain_of(B)).
% 3.18/3.36  ** KEPT (pick-wt=15): 22 [] -member(ordered_pair(ordered_pair(A,B),C),rotate(D))|member(ordered_pair(ordered_pair(B,C),A),D).
% 3.18/3.36  ** KEPT (pick-wt=26): 23 [] -member(ordered_pair(ordered_pair(A,B),C),D)| -member(ordered_pair(ordered_pair(C,A),B),cross_product(cross_product(universal_class,universal_class),universal_class))|member(ordered_pair(ordered_pair(C,A),B),rotate(D)).
% 3.18/3.36  ** KEPT (pick-wt=15): 24 [] -member(ordered_pair(ordered_pair(A,B),C),flip(D))|member(ordered_pair(ordered_pair(B,A),C),D).
% 3.18/3.36  ** KEPT (pick-wt=26): 25 [] -member(ordered_pair(ordered_pair(A,B),C),D)| -member(ordered_pair(ordered_pair(B,A),C),cross_product(cross_product(universal_class,universal_class),universal_class))|member(ordered_pair(ordered_pair(B,A),C),flip(D)).
% 3.18/3.36  ** KEPT (pick-wt=9): 26 [] -member(ordered_pair(A,B),successor_relation)|successor(A)=B.
% 3.18/3.36  ** KEPT (pick-wt=16): 27 [] successor(A)!=B| -member(ordered_pair(A,B),cross_product(universal_class,universal_class))|member(ordered_pair(A,B),successor_relation).
% 3.18/3.36  ** KEPT (pick-wt=5): 28 [] -inductive(A)|member(null_class,A).
% 3.18/3.36  ** KEPT (pick-wt=7): 29 [] -inductive(A)|subclass(image(successor_relation,A),A).
% 3.18/3.36  ** KEPT (pick-wt=10): 30 [] -member(null_class,A)| -subclass(image(successor_relation,A),A)|inductive(A).
% 3.18/3.36  ** KEPT (pick-wt=5): 31 [] -inductive(A)|subclass(omega,A).
% 3.18/3.36  ** KEPT (pick-wt=7): 32 [] -member(A,universal_class)|member(sum_class(A),universal_class).
% 3.18/3.36  ** KEPT (pick-wt=7): 33 [] -member(A,universal_class)|member(power_class(A),universal_class).
% 3.18/3.36  ** KEPT (pick-wt=15): 34 [] -member(ordered_pair(A,B),compose(C,D))|member(B,image(C,image(D,singleton(A)))).
% 3.18/3.36  ** KEPT (pick-wt=22): 35 [] -member(A,image(B,image(C,singleton(D))))| -member(ordered_pair(D,A),cross_product(universal_class,universal_class))|member(ordered_pair(D,A),compose(B,C)).
% 3.18/3.36  ** KEPT (pick-wt=8): 36 [] -single_valued_class(A)|subclass(compose(A,inverse(A)),identity_relation).
% 3.18/3.36  ** KEPT (pick-wt=8): 37 [] -subclass(compose(A,inverse(A)),identity_relation)|single_valued_class(A).
% 3.18/3.36  ** KEPT (pick-wt=7): 38 [] -function(A)|subclass(A,cross_product(universal_class,universal_class)).
% 3.18/3.36  ** KEPT (pick-wt=8): 39 [] -function(A)|subclass(compose(A,inverse(A)),identity_relation).
% 3.18/3.36  ** KEPT (pick-wt=13): 40 [] -subclass(A,cross_product(universal_class,universal_class))| -subclass(compose(A,inverse(A)),identity_relation)|function(A).
% 3.18/3.36  ** KEPT (pick-wt=10): 41 [] -function(A)| -member(B,universal_class)|member(image(A,B),universal_class).
% 3.18/3.36  ** KEPT (pick-wt=11): 42 [] -member(A,universal_class)|A=null_class|member(apply(choice,A),A).
% 3.18/3.36  ** KEPT (pick-wt=4): 43 [] -one_to_one(A)|function(A).
% 3.18/3.36  ** KEPT (pick-wt=5): 44 [] -one_to_one(A)|function(inverse(A)).
% 3.18/3.36  ** KEPT (pick-wt=7): 45 [] -function(inverse(A))| -function(A)|one_to_one(A).
% 3.18/3.36  ** KEPT (pick-wt=4): 46 [] -operation(A)|function(A).
% 3.18/3.36  ** KEPT (pick-wt=12): 47 [] -operation(A)|cross_product(domain_of(domain_of(A)),domain_of(domain_of(A)))=domain_of(A).
% 3.18/3.36  ** KEPT (pick-wt=8): 48 [] -operation(A)|subclass(range_of(A),domain_of(domain_of(A))).
% 3.18/3.36  ** KEPT (pick-wt=20): 49 [] -function(A)|cross_product(domain_of(domain_of(A)),domain_of(domain_of(A)))!=domain_of(A)| -subclass(range_of(A),domain_of(domain_of(A)))|operation(A).
% 3.18/3.36  ** KEPT (pick-wt=6): 50 [] -compatible(A,B,C)|function(A).
% 3.18/3.36  ** KEPT (pick-wt=10): 51 [] -compatible(A,B,C)|domain_of(domain_of(B))=domain_of(A).
% 3.18/3.36  ** KEPT (pick-wt=10): 52 [] -compatible(A,B,C)|subclass(range_of(A),domain_of(domain_of(C))).
% 3.18/3.36  ** KEPT (pick-wt=18): 53 [] -function(A)|domain_of(domain_of(B))!=domain_of(A)| -subclass(range_of(A),domain_of(domain_of(C)))|compatible(A,B,C).
% 3.18/3.36  ** KEPT (pick-wt=6): 54 [] -homomorphism(A,B,C)|operation(B).
% 3.18/3.36  ** KEPT (pick-wt=6): 55 [] -homomorphism(A,B,C)|operation(C).
% 3.18/3.36  ** KEPT (pick-wt=8): 56 [] -homomorphism(A,B,C)|compatible(A,B,C).
% 3.18/3.36  ** KEPT (pick-wt=27): 57 [] -homomorphism(A,B,C)| -member(ordered_pair(D,E),domain_of(B))|apply(C,ordered_pair(apply(A,D),apply(A,E)))=apply(A,apply(B,ordered_pair(D,E))).
% 3.18/3.36  ** KEPT (pick-wt=24): 58 [] -operation(A)| -operation(B)| -compatible(C,A,B)|member(ordered_pair(not_homomorphism1(C,A,B),not_homomorphism2(C,A,B)),domain_of(A))|homomorphism(C,A,B).
% 3.18/3.36  ** KEPT (pick-wt=41): 59 [] -operation(A)| -operation(B)| -compatible(C,A,B)|apply(B,ordered_pair(apply(C,not_homomorphism1(C,A,B)),apply(C,not_homomorphism2(C,A,B))))!=apply(C,apply(A,ordered_pair(not_homomorphism1(C,A,B),not_homomorphism2(C,A,B))))|homomorphism(C,A,B).
% 3.18/3.36  ** KEPT (pick-wt=12): 60 [] -member(ordered_pair(A,B),cross_product(C,D))|member(A,unordered_pair(A,B)).
% 3.18/3.36  ** KEPT (pick-wt=12): 61 [] -member(ordered_pair(A,B),cross_product(C,D))|member(B,unordered_pair(A,B)).
% 3.18/3.36  ** KEPT (pick-wt=10): 62 [] -member(ordered_pair(A,B),cross_product(C,D))|member(A,universal_class).
% 3.18/3.36  ** KEPT (pick-wt=10): 63 [] -member(ordered_pair(A,B),cross_product(C,D))|member(B,universal_class).
% 3.18/3.36  ** KEPT (pick-wt=9): 64 [] -subclass(A,B)| -subclass(B,C)|subclass(A,C).
% 3.18/3.36  ** KEPT (pick-wt=13): 65 [] -member(not_subclass_element(A,B),B)|A=B|member(not_subclass_element(B,A),B).
% 3.18/3.36  ** KEPT (pick-wt=13): 66 [] -member(not_subclass_element(A,B),B)|B=A|member(not_subclass_element(B,A),B).
% 3.18/3.36  ** KEPT (pick-wt=13): 67 [] -member(not_subclass_element(A,B),B)| -member(not_subclass_element(B,A),A)|A=B.
% 3.18/3.36  ** KEPT (pick-wt=6): 68 [] -member(A,intersection(complement(B),B)).
% 3.18/3.36  ** KEPT (pick-wt=3): 69 [] -member(A,null_class).
% 3.18/3.36  ** KEPT (pick-wt=6): 70 [] -subclass(A,null_class)|A=null_class.
% 3.18/3.36  ** KEPT (pick-wt=17): 71 [] unordered_pair(A,B)!=unordered_pair(A,C)| -member(ordered_pair(B,C),cross_product(universal_class,universal_class))|B=C.
% 3.18/3.36  ** KEPT (pick-wt=17): 72 [] unordered_pair(A,B)!=unordered_pair(C,B)| -member(ordered_pair(A,C),cross_product(universal_class,universal_class))|A=C.
% 3.18/3.36  ** KEPT (pick-wt=8): 73 [] -member(A,universal_class)|unordered_pair(A,B)!=null_class.
% 3.18/3.36  ** KEPT (pick-wt=8): 74 [] -member(A,universal_class)|unordered_pair(B,A)!=null_class.
% 3.18/3.36  ** KEPT (pick-wt=12): 75 [] -member(ordered_pair(A,B),cross_product(C,D))|unordered_pair(A,B)!=null_class.
% 3.18/3.36  ** KEPT (pick-wt=11): 76 [] -member(A,B)| -member(C,B)|subclass(unordered_pair(A,C),B).
% 3.18/3.36  ** KEPT (pick-wt=7): 77 [] -member(A,universal_class)|member(A,singleton(A)).
% 3.18/3.36  ** KEPT (pick-wt=7): 78 [] -member(A,universal_class)|singleton(A)!=null_class.
% 3.18/3.36  ** KEPT (pick-wt=7): 79 [] -member(A,singleton(B))|A=B.
% 3.18/3.36  ** KEPT (pick-wt=11): 80 [] singleton(A)!=singleton(B)| -member(A,universal_class)|A=B.
% 3.18/3.36  ** KEPT (pick-wt=11): 81 [] singleton(A)!=singleton(B)| -member(B,universal_class)|A=B.
% 3.18/3.36  ** KEPT (pick-wt=15): 82 [] unordered_pair(A,B)!=singleton(C)| -member(C,universal_class)|C=A|C=B.
% 3.18/3.36  ** KEPT (pick-wt=8): 83 [] -member(A,universal_class)|member(member_of(singleton(A)),universal_class).
% 3.18/3.36  ** KEPT (pick-wt=10): 84 [] -member(A,universal_class)|singleton(member_of(singleton(A)))=singleton(A).
% 3.18/3.36  ** KEPT (pick-wt=8): 85 [] -member(A,universal_class)|member_of(singleton(A))=A.
% 3.18/3.36  ** KEPT (pick-wt=8): 86 [] singleton(member_of(A))!=A|member(A,universal_class).
% 3.18/3.36  ** KEPT (pick-wt=12): 87 [] singleton(member_of(A))!=A| -member(B,A)|member_of(A)=B.
% 3.18/3.36  ** KEPT (pick-wt=7): 88 [] -member(A,B)|subclass(singleton(A),B).
% 3.18/3.36  ** KEPT (pick-wt=11): 89 [] -subclass(A,singleton(B))|A=null_class|singleton(B)=A.
% 3.18/3.36  ** KEPT (pick-wt=22): 90 [] not_subclass_element(intersection(complement(singleton(not_subclass_element(A,null_class))),A),null_class)!=not_subclass_element(A,null_class)|singleton(not_subclass_element(A,null_class))=A|A=null_class.
% 3.18/3.36  ** KEPT (pick-wt=10): 91 [] unordered_pair(singleton(x),unordered_pair(x,null_class))!=ordered_pair(x,y).
% 3.18/3.36  ** KEPT (pick-wt=3): 92 [] -member(y,universal_class).
% 3.18/3.36  
% 3.18/3.36  ------------> process sos:
% 3.18/3.36  ** KEPT (pick-wt=3): 104 [] A=A.
% 3.18/3.36  ** KEPT (pick-wt=8): 105 [] member(not_subclass_element(A,B),A)|subclass(A,B).
% 3.18/3.36  ** KEPT (pick-wt=3): 106 [] subclass(A,universal_class).
% 3.18/3.36  ** KEPT (pick-wt=5): 107 [] member(unordered_pair(A,B),universal_class).
% 3.18/3.36  ** KEPT (pick-wt=6): 109 [copy,108,flip.1] singleton(A)=unordered_pair(A,A).
% 3.18/3.36  ---> New Demodulator: 110 [new_demod,109] singleton(A)=unordered_pair(A,A).
% 3.18/3.36  ** KEPT (pick-wt=13): 112 [copy,111,demod,110,110] unordered_pair(unordered_pair(A,A),unordered_pair(A,unordered_pair(B,B)))=ordered_pair(A,B).
% 3.18/3.36  ---> New Demodulator: 113 [new_demod,112] unordered_pair(unordered_pair(A,A),unordered_pair(A,unordered_pair(B,B)))=ordered_pair(A,B).
% 3.18/3.36  ** KEPT (pick-wt=5): 114 [] subclass(element_relation,cross_product(universal_class,universal_class)).
% 3.18/3.36  ** KEPT (pick-wt=10): 115 [] complement(intersection(complement(A),complement(B)))=union(A,B).
% 3.18/3.36  ---> New Demodulator: 116 [new_demod,115] complement(intersection(complement(A),complement(B)))=union(A,B).
% 3.18/3.36  ** KEPT (pick-wt=12): 118 [copy,117,demod,116] intersection(complement(intersection(A,B)),union(A,B))=symmetric_difference(A,B).
% 3.18/3.36  ---> New Demodulator: 119 [new_demod,118] intersection(complement(intersection(A,B)),union(A,B))=symmetric_difference(A,B).
% 3.18/3.36  ** KEPT (pick-wt=10): 120 [] intersection(A,cross_product(B,C))=restrict(A,B,C).
% 3.18/3.36  ---> New Demodulator: 121 [new_demod,120] intersection(A,cross_product(B,C))=restrict(A,B,C).
% 3.18/3.36  ** KEPT (pick-wt=10): 122 [] intersection(cross_product(A,B),C)=restrict(C,A,B).
% 3.18/3.36  ---> New Demodulator: 123 [new_demod,122] intersection(cross_product(A,B),C)=restrict(C,A,B).
% 3.18/3.36  ** KEPT (pick-wt=8): 124 [] subclass(rotate(A),cross_product(cross_product(universal_class,universal_class),universal_class)).
% 3.18/3.36  ** KEPT (pick-wt=8): 125 [] subclass(flip(A),cross_product(cross_product(universal_class,universal_class),universal_class)).
% 3.18/3.36  ** KEPT (pick-wt=8): 127 [copy,126,flip.1] inverse(A)=domain_of(flip(cross_product(A,universal_class))).
% 3.18/3.36  ---> New Demodulator: 128 [new_demod,127] inverse(A)=domain_of(flip(cross_product(A,universal_class))).
% 3.18/3.36  ** KEPT (pick-wt=9): 130 [copy,129,demod,128,flip.1] range_of(A)=domain_of(domain_of(flip(cross_product(A,universal_class)))).
% 3.18/3.36  ---> New Demodulator: 131 [new_demod,130] range_of(A)=domain_of(domain_of(flip(cross_product(A,universal_class)))).
% 3.18/3.36  ** KEPT (pick-wt=14): 133 [copy,132,demod,110] first(not_subclass_element(restrict(A,B,unordered_pair(C,C)),null_class))=domain(A,B,C).
% 3.18/3.36  ---> New Demodulator: 134 [new_demod,133] first(not_subclass_element(restrict(A,B,unordered_pair(C,C)),null_class))=domain(A,B,C).
% 3.18/3.36  ** KEPT (pick-wt=14): 136 [copy,135,demod,110] second(not_subclass_element(restrict(A,unordered_pair(B,B),C),null_class))=range(A,B,C).
% 3.18/3.36  ---> New Demodulator: 137 [new_demod,136] second(not_subclass_element(restrict(A,unordered_pair(B,B),C),null_class))=range(A,B,C).
% 3.18/3.36  ** KEPT (pick-wt=13): 139 [copy,138,demod,131] domain_of(domain_of(flip(cross_product(restrict(A,B,universal_class),universal_class))))=image(A,B).
% 3.18/3.36  ---> New Demodulator: 140 [new_demod,139] domain_of(domain_of(flip(cross_product(restrict(A,B,universal_class),universal_class))))=image(A,B).
% 3.18/3.36  ** KEPT (pick-wt=8): 142 [copy,141,demod,110,flip.1] successor(A)=union(A,unordered_pair(A,A)).
% 3.18/3.36  ---> New Demodulator: 143 [new_demod,142] successor(A)=union(A,unordered_pair(A,A)).
% 3.18/3.36  ** KEPT (pick-wt=5): 144 [] subclass(successor_relation,cross_product(universal_class,universal_class)).
% 3.18/3.36  ** KEPT (pick-wt=2): 145 [] inductive(omega).
% 3.18/3.36  ** KEPT (pick-wt=3): 146 [] member(omega,universal_class).
% 3.18/3.36  ** KEPT (pick-wt=8): 148 [copy,147,flip.1] sum_class(A)=domain_of(restrict(element_relation,universal_class,A)).
% 3.18/3.36  ---> New Demodulator: 149 [new_demod,148] sum_class(A)=domain_of(restrict(element_relation,universal_class,A)).
% 3.18/3.36  ** KEPT (pick-wt=8): 151 [copy,150,flip.1] power_class(A)=complement(image(element_relation,complement(A))).
% 3.18/3.36  ---> New Demodulator: 152 [new_demod,151] power_class(A)=complement(image(element_relation,complement(A))).
% 3.18/3.36  ** KEPT (pick-wt=7): 153 [] subclass(compose(A,B),cross_product(universal_class,universal_class)).
% 3.18/3.36  ** KEPT (pick-wt=7): 154 [] A=null_class|member(regular(A),A).
% 3.18/3.36  ** KEPT (pick-wt=9): 155 [] A=null_class|intersection(A,regular(A))=null_class.
% 3.18/3.36  ** KEPT (pick-wt=13): 157 [copy,156,demod,110,149] domain_of(restrict(element_relation,universal_class,image(A,unordered_pair(B,B))))=apply(A,B).
% 3.18/3.36  ---> New Demodulator: 158 [new_demod,157] domain_of(restrict(element_relation,universal_class,image(A,unordered_pair(B,B))))=apply(A,B).
% 3.18/3.36  ** KEPT (pick-wt=2): 159 [] function(choice).
% 3.18/3.36  ** KEPT (pick-wt=17): 161 [copy,160,demod,128,123,123] restrict(restrict(complement(compose(complement(element_relation),domain_of(flip(cross_product(element_relation,universal_class))))),universal_class,universal_class),universal_class,universal_class)=subset_relation.
% 3.18/3.36  ---> New Demodulator: 162 [new_demod,161] restrict(restrict(complement(compose(complement(element_relation),domain_of(flip(cross_product(element_relation,universal_class))))),universal_class,universal_class),universal_class,universal_class)=subset_relation.
% 3.18/3.36  ** KEPT (pick-wt=9): 164 [copy,163,demod,128] intersection(domain_of(flip(cross_product(subset_relation,universal_class))),subset_relation)=identity_relation.
% 3.18/3.36  ---> New Demodulator: 165 [new_demod,164] intersection(domain_of(flip(cross_product(subset_relation,universal_class))),subset_relation)=identity_relation.
% 3.18/3.36  ** KEPT (pick-wt=8): 166 [] complement(domain_of(intersection(A,identity_relation)))=diagonalise(A).
% 3.18/3.36  ---> New Demodulator: 167 [new_demod,166] complement(domain_of(intersection(A,identity_relation)))=diagonalise(A).
% 3.18/3.36  ** KEPT (pick-wt=14): 169 [copy,168,demod,128] intersection(domain_of(A),diagonalise(compose(domain_of(flip(cross_product(element_relation,universal_class))),A)))=cantor(A).
% 3.18/3.36  ---> New Demodulator: 170 [new_demod,169] intersection(domain_of(A),diagonalise(compose(domain_of(flip(cross_product(element_relation,universal_class))),A)))=cantor(A).
% 3.18/3.36  ** KEPT (pick-wt=3): 171 [] subclass(A,A).
% 3.18/3.36  ** KEPT (pick-wt=13): 172 [] A=B|member(not_subclass_element(A,B),A)|member(not_subclass_element(B,A),B).
% 3.18/3.36  ** KEPT (pick-wt=3): 173 [] subclass(null_class,A).
% 3.18/3.36  ** KEPT (pick-wt=8): 174 [] A=null_class|member(not_subclass_element(A,null_class),A).
% 3.18/3.36  ** KEPT (pick-wt=3): 175 [] member(null_class,universal_class).
% 3.18/3.36  ** KEPT (pick-wt=7): 176 [] unordered_pair(A,B)=unordered_pair(B,A).
% 3.18/3.36  ** KEPT (pick-wt=7): 178 [copy,177,demod,110] subclass(unordered_pair(A,A),unordered_pair(A,B)).
% 3.18/3.36  ** KEPT (pick-wt=7): 180 [copy,179,demod,110] subclass(unordered_pair(A,A),unordered_pair(B,A)).
% 3.18/3.36  ** KEPT (pick-wt=10): 182 [copy,181,demod,110] member(A,universal_class)|unordered_pair(B,A)=unordered_pair(B,B).
% 3.18/3.36  ** KEPT (pick-wt=10): 184 [copy,183,demod,110] member(A,universal_class)|unordered_pair(A,B)=unordered_pair(B,B).
% 3.18/3.36  ** KEPT (pick-wt=11): 185 [] unordered_pair(A,B)=null_class|member(A,universal_class)|member(B,universal_class).
% 3.18/3.36    Following clause subsumed by 107 during input processing: 0 [demod,110] member(unordered_pair(A,A),universal_class).
% 3.18/3.36  ** KEPT (pick-wt=9): 187 [copy,186,demod,110,110] member(unordered_pair(A,A),unordered_pair(B,unordered_pair(A,A))).
% 3.18/3.36  ** KEPT (pick-wt=5): 189 [copy,188,demod,110] member(null_class,unordered_pair(null_class,null_class)).
% 3.18/3.36  ** KEPT (pick-wt=8): 191 [copy,190,demod,110] member(A,universal_class)|unordered_pair(A,A)=null_class.
% 3.18/3.36  ** KEPT (pick-wt=8): 192 [] member(member_of(A),universal_class)|member_of(A)=A.
% 3.18/3.36  ** KEPT (pick-wt=11): 194 [copy,193,demod,110] unordered_pair(member_of(A),member_of(A))=A|member_of(A)=A.
% 3.18/3.36  ** KEPT (pick-wt=8): 195 [] member(member_of1(A),universal_class)|member_of(A)=A.
% 3.18/3.36  ** KEPT (pick-wt=11): 197 [copy,196,demod,110] unordered_pair(member_of1(A),member_of1(A))=A|member_of(A)=A.
% 3.18/3.36  ** KEPT (pick-wt=35): 199 [copy,198,demod,110,110,110] member(not_subclass_element(intersection(complement(unordered_pair(not_subclass_element(A,null_class),not_subclass_element(A,null_class))),A),null_class),intersection(complement(unordered_pair(not_subclass_element(A,null_class),not_subclass_element(A,null_class))),A))|unordered_pair(not_subclass_element(A,null_class),not_subclass_element(A,null_class))=A|A=null_class.
% 3.18/3.36  ** KEPT (pick-wt=26): 201 [copy,200,demod,110,110] member(not_subclass_element(intersection(complement(unordered_pair(not_subclass_element(A,null_class),not_subclass_element(A,null_class))),A),null_class),A)|unordered_pair(not_subclass_element(A,null_class),not_subclass_element(A,null_class))=A|A=null_class.
% 3.18/3.36  ** KEPT (pick-wt=11): 203 [copy,202,demod,110,110] unordered_pair(A,B)=union(unordered_pair(A,A),unordered_pair(B,B)).
% 3.18/3.36  ** KEPT (pick-wt=5): 204 [] member(ordered_pair(A,B),universal_class).
% 3.18/3.36  ** KEPT (pick-wt=7): 206 [copy,205,demod,110] member(unordered_pair(A,A),ordered_pair(A,B)).
% 3.18/3.36  ** KEPT (pick-wt=9): 208 [copy,207,demod,110] member(unordered_pair(A,unordered_pair(B,B)),ordered_pair(A,B)).
% 3.18/3.36    Following clause subsumed by 104 during input processing: 0 [copy,104,flip.1] A=A.
% 3.18/3.36  104 back subsumes 101.
% 3.18/3.36  104 back subsumes 93.
% 3.18/3.36  >>>> Starting back demodulation with 110.
% 3.18/3.36      >> back demodulating 103 with 110.
% 3.18/3.36      >> back demodulating 91 with 110.
% 3.18/3.36      >> back demodulating 90 with 110.
% 3.18/3.36      >> back demodulating 89 with 110.
% 3.18/3.36      >> back demodulating 88 with 110.
% 3.18/3.36      >> back demodulating 87 with 110.
% 3.18/3.36      >> back demodulating 86 with 110.
% 3.18/3.36      >> back demodulating 85 with 110.
% 3.18/3.36      >> back demodulating 84 with 110.
% 3.18/3.36      >> back demodulating 83 with 110.
% 3.18/3.36      >> back demodulating 82 with 110.
% 3.18/3.36      >> back demodulating 81 with 110.
% 3.18/3.36      >> back demodulating 80 with 110.
% 3.18/3.36      >> back demodulating 79 with 110.
% 3.18/3.36      >> back demodulating 78 with 110.
% 3.18/3.36      >> back demodulating 77 with 110.
% 3.18/3.36      >> back demodulating 35 with 110.
% 3.18/3.36      >> back demodulating 34 with 110.
% 3.18/3.36      >> back demodulating 21 with 110.
% 3.18/3.36      >> back demodulating 20 with 110.
% 3.18/3.36  >>>> Starting back demodulation with 113.
% 3.18/3.36  >>>> Starting back demodulation with 116.
% 3.18/3.36  >>>> Starting back demodulation with 119.
% 3.18/3.36  >>>> Starting back demodulation with 121.
% 3.18/3.36  >>>> Starting back demodulation with 123.
% 3.18/3.36  >>>> Starting back demodulation with 128.
% 3.18/3.36      >> back demodulating 45 with 128.
% 3.18/3.36      >> back demodulating 44 with 128.
% 3.18/3.36      >> back demodulating 40 with 128.
% 3.18/3.36      >> back demodulating 39 with 128.
% 3.18/3.36      >> back demodulating 37 with 128.
% 3.18/3.36      >> back demodulating 36 with 128.
% 3.18/3.36  >>>> Starting back demodulation with 131.
% 3.18/3.36      >> back demodulating 53 with 131.
% 3.18/3.36      >> back demodulating 52 with 131.
% 3.18/3.36      >> back demodulating 49 with 131.
% 3.18/3.36      >> back demodulating 48 with 131.
% 3.18/3.36  >>>> Starting back demodulation with 134.
% 3.18/3.36  >>>> Starting back demodulation with 137.
% 3.18/3.36  >>>> Starting back demodulation with 140.
% 3.18/3.36  >>>> Starting back demodulation with 143.
% 3.18/3.36      >> back demodulating 27 with 143.
% 3.18/3.36      >> back demodulating 26 with 143.
% 6.65/6.80  >>>> Starting back demodulation with 149.
% 6.65/6.80      >> back demodulating 32 with 149.
% 6.65/6.80  >>>> Starting back demodulation with 152.
% 6.65/6.80      >> back demodulating 33 with 152.
% 6.65/6.80  >>>> Starting back demodulation with 158.
% 6.65/6.80  >>>> Starting back demodulation with 162.
% 6.65/6.80  >>>> Starting back demodulation with 165.
% 6.65/6.80  >>>> Starting back demodulation with 167.
% 6.65/6.80  >>>> Starting back demodulation with 170.
% 6.65/6.80    Following clause subsumed by 176 during input processing: 0 [copy,176,flip.1] unordered_pair(A,B)=unordered_pair(B,A).
% 6.65/6.80  ** KEPT (pick-wt=11): 239 [copy,203,flip.1] union(unordered_pair(A,A),unordered_pair(B,B))=unordered_pair(A,B).
% 6.65/6.80    Following clause subsumed by 203 during input processing: 0 [copy,239,flip.1] unordered_pair(A,B)=union(unordered_pair(A,A),unordered_pair(B,B)).
% 6.65/6.80  
% 6.65/6.80  ======= end of input processing =======
% 6.65/6.80  
% 6.65/6.80  =========== start of search ===========
% 6.65/6.80  
% 6.65/6.80  
% 6.65/6.80  Resetting weight limit to 7.
% 6.65/6.80  
% 6.65/6.80  
% 6.65/6.80  Resetting weight limit to 7.
% 6.65/6.80  
% 6.65/6.80  sos_size=506
% 6.65/6.80  
% 6.65/6.80  Search stopped because sos empty.
% 6.65/6.80  
% 6.65/6.80  
% 6.65/6.80  Search stopped because sos empty.
% 6.65/6.80  
% 6.65/6.80  ============ end of search ============
% 6.65/6.80  
% 6.65/6.80  -------------- statistics -------------
% 6.65/6.80  clauses given               1210
% 6.65/6.80  clauses generated         590519
% 6.65/6.80  clauses kept                1381
% 6.65/6.80  clauses forward subsumed   12401
% 6.65/6.80  clauses back subsumed         43
% 6.65/6.80  Kbytes malloced             9765
% 6.65/6.80  
% 6.65/6.80  ----------- times (seconds) -----------
% 6.65/6.80  user CPU time          3.45          (0 hr, 0 min, 3 sec)
% 6.65/6.80  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 6.65/6.80  wall-clock time        6             (0 hr, 0 min, 6 sec)
% 6.65/6.80  
% 6.65/6.80  Process 7999 finished Wed Jul 27 10:38:22 2022
% 6.65/6.80  Otter interrupted
% 6.65/6.80  PROOF NOT FOUND
%------------------------------------------------------------------------------