TSTP Solution File: SEU276+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU276+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n016.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:15:26 EDT 2022
% Result : Unknown 4.55s 4.82s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEU276+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n016.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 08:05:07 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.07/2.29 ----- Otter 3.3f, August 2004 -----
% 2.07/2.29 The process was started by sandbox2 on n016.cluster.edu,
% 2.07/2.29 Wed Jul 27 08:05:07 2022
% 2.07/2.29 The command was "./otter". The process ID is 352.
% 2.07/2.29
% 2.07/2.29 set(prolog_style_variables).
% 2.07/2.29 set(auto).
% 2.07/2.29 dependent: set(auto1).
% 2.07/2.29 dependent: set(process_input).
% 2.07/2.29 dependent: clear(print_kept).
% 2.07/2.29 dependent: clear(print_new_demod).
% 2.07/2.29 dependent: clear(print_back_demod).
% 2.07/2.29 dependent: clear(print_back_sub).
% 2.07/2.29 dependent: set(control_memory).
% 2.07/2.29 dependent: assign(max_mem, 12000).
% 2.07/2.29 dependent: assign(pick_given_ratio, 4).
% 2.07/2.29 dependent: assign(stats_level, 1).
% 2.07/2.29 dependent: assign(max_seconds, 10800).
% 2.07/2.29 clear(print_given).
% 2.07/2.29
% 2.07/2.29 formula_list(usable).
% 2.07/2.29 all A (A=A).
% 2.07/2.29 all A B (in(A,B)-> -in(B,A)).
% 2.07/2.29 all A (empty(A)->function(A)).
% 2.07/2.29 all A (ordinal(A)->epsilon_transitive(A)&epsilon_connected(A)).
% 2.07/2.29 all A (relation(A)&empty(A)&function(A)->relation(A)&function(A)&one_to_one(A)).
% 2.07/2.29 all A (epsilon_transitive(A)&epsilon_connected(A)->ordinal(A)).
% 2.07/2.29 all A (empty(A)->epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 2.07/2.29 all A B (unordered_pair(A,B)=unordered_pair(B,A)).
% 2.07/2.29 all A B (set_union2(A,B)=set_union2(B,A)).
% 2.07/2.29 all A B (set_intersection2(A,B)=set_intersection2(B,A)).
% 2.07/2.29 all A B (A=B<->subset(A,B)&subset(B,A)).
% 2.07/2.29 all A (relation(A)-> (all B (is_reflexive_in(A,B)<-> (all C (in(C,B)->in(ordered_pair(C,C),A)))))).
% 2.07/2.29 all A (relation(A)-> (all B C (C=fiber(A,B)<-> (all D (in(D,C)<->D!=B&in(ordered_pair(D,B),A)))))).
% 2.07/2.29 all A B (subset(A,B)<-> (all C (in(C,A)->in(C,B)))).
% 2.07/2.29 all A (relation(A)-> (all B (is_well_founded_in(A,B)<-> (all C (-(subset(C,B)&C!=empty_set& (all D (-(in(D,C)&disjoint(fiber(A,D),C)))))))))).
% 2.07/2.29 all A (relation(A)-> (all B (is_antisymmetric_in(A,B)<-> (all C D (in(C,B)&in(D,B)&in(ordered_pair(C,D),A)&in(ordered_pair(D,C),A)->C=D))))).
% 2.07/2.29 all A B (ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A))).
% 2.07/2.29 all A (relation(A)-> (all B (well_orders(A,B)<->is_reflexive_in(A,B)&is_transitive_in(A,B)&is_antisymmetric_in(A,B)&is_connected_in(A,B)&is_well_founded_in(A,B)))).
% 2.07/2.29 all A (relation(A)->relation_field(A)=set_union2(relation_dom(A),relation_rng(A))).
% 2.07/2.29 all A (relation(A)-> (all B (is_connected_in(A,B)<-> (all C D (-(in(C,B)&in(D,B)&C!=D& -in(ordered_pair(C,D),A)& -in(ordered_pair(D,C),A))))))).
% 2.07/2.29 all A (relation(A)-> (all B (relation_restriction(A,B)=set_intersection2(A,cartesian_product2(B,B))))).
% 2.07/2.29 all A (relation(A)-> (all B (is_transitive_in(A,B)<-> (all C D E (in(C,B)&in(D,B)&in(E,B)&in(ordered_pair(C,D),A)&in(ordered_pair(D,E),A)->in(ordered_pair(C,E),A)))))).
% 2.07/2.29 $T.
% 2.07/2.29 $T.
% 2.07/2.29 $T.
% 2.07/2.29 $T.
% 2.07/2.29 $T.
% 2.07/2.29 $T.
% 2.07/2.29 $T.
% 2.07/2.29 all A B (relation(A)->relation(relation_restriction(A,B))).
% 2.07/2.29 $T.
% 2.07/2.29 $T.
% 2.07/2.29 $T.
% 2.07/2.29 $T.
% 2.07/2.29 $T.
% 2.07/2.29 $T.
% 2.07/2.29 all A exists B element(B,A).
% 2.07/2.29 empty(empty_set).
% 2.07/2.29 all A B (-empty(ordered_pair(A,B))).
% 2.07/2.29 relation(empty_set).
% 2.07/2.29 relation_empty_yielding(empty_set).
% 2.07/2.29 function(empty_set).
% 2.07/2.29 one_to_one(empty_set).
% 2.07/2.29 empty(empty_set).
% 2.07/2.29 epsilon_transitive(empty_set).
% 2.07/2.29 epsilon_connected(empty_set).
% 2.07/2.29 ordinal(empty_set).
% 2.07/2.29 all A B (-empty(A)-> -empty(set_union2(A,B))).
% 2.07/2.29 all A B (-empty(A)-> -empty(set_union2(B,A))).
% 2.07/2.29 all A B (set_union2(A,A)=A).
% 2.07/2.29 all A B (set_intersection2(A,A)=A).
% 2.07/2.29 exists A (relation(A)&function(A)).
% 2.07/2.29 exists A (epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 2.07/2.29 exists A empty(A).
% 2.07/2.29 exists A (relation(A)&empty(A)&function(A)).
% 2.07/2.29 exists A (relation(A)&function(A)&one_to_one(A)&empty(A)&epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 2.07/2.29 exists A (-empty(A)).
% 2.07/2.29 exists A (relation(A)&function(A)&one_to_one(A)).
% 2.07/2.29 exists A (-empty(A)&epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 2.07/2.29 exists A (relation(A)&relation_empty_yielding(A)&function(A)).
% 2.07/2.29 all A B subset(A,A).
% 2.07/2.29 all A B (disjoint(A,B)->disjoint(B,A)).
% 2.07/2.29 all A B C D (in(ordered_pair(A,B),cartesian_product2(C,D))<->in(A,C)&in(B,D)).
% 2.07/2.29 all A B C (relation(C)-> (in(A,relation_restriction(C,B))<->in(A,C)&in(A,cartesian_product2(B,B)))).
% 2.07/2.29 all A (set_union2(A,empty_set)=A).
% 2.07/2.29 all A B (in(A,B)->element(A,B)).
% 2.07/2.29 all A B (relation(B)->subset(relation_field(relation_restriction(B,A)),relation_field(B))&subset(relation_field(relation_restriction(B,A)),A)).
% 2.07/2.29 -(all A B (relation(B)-> (well_orders(B,A)->relation_field(relation_restriction(B,A))=A&well_ordering(relation_restriction(B,A))))).
% 2.10/2.29 all A (set_intersection2(A,empty_set)=empty_set).
% 2.10/2.29 all A B (element(A,B)->empty(B)|in(A,B)).
% 2.10/2.29 all A B C (relation(C)-> (in(ordered_pair(A,B),C)->in(A,relation_field(C))&in(B,relation_field(C)))).
% 2.10/2.29 all A B (element(A,powerset(B))<->subset(A,B)).
% 2.10/2.29 all A B (-(-disjoint(A,B)& (all C (-(in(C,A)&in(C,B)))))& -((exists C (in(C,A)&in(C,B)))&disjoint(A,B))).
% 2.10/2.29 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 2.10/2.29 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 2.10/2.29 all A (empty(A)->A=empty_set).
% 2.10/2.29 all A B (-(in(A,B)&empty(B))).
% 2.10/2.29 all A B (-(empty(A)&A!=B&empty(B))).
% 2.10/2.29 all A (relation(A)-> (well_orders(A,relation_field(A))<->well_ordering(A))).
% 2.10/2.29 end_of_list.
% 2.10/2.29
% 2.10/2.29 -------> usable clausifies to:
% 2.10/2.29
% 2.10/2.29 list(usable).
% 2.10/2.29 0 [] A=A.
% 2.10/2.29 0 [] -in(A,B)| -in(B,A).
% 2.10/2.29 0 [] -empty(A)|function(A).
% 2.10/2.29 0 [] -ordinal(A)|epsilon_transitive(A).
% 2.10/2.29 0 [] -ordinal(A)|epsilon_connected(A).
% 2.10/2.29 0 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 2.10/2.29 0 [] -epsilon_transitive(A)| -epsilon_connected(A)|ordinal(A).
% 2.10/2.29 0 [] -empty(A)|epsilon_transitive(A).
% 2.10/2.29 0 [] -empty(A)|epsilon_connected(A).
% 2.10/2.29 0 [] -empty(A)|ordinal(A).
% 2.10/2.29 0 [] unordered_pair(A,B)=unordered_pair(B,A).
% 2.10/2.29 0 [] set_union2(A,B)=set_union2(B,A).
% 2.10/2.29 0 [] set_intersection2(A,B)=set_intersection2(B,A).
% 2.10/2.29 0 [] A!=B|subset(A,B).
% 2.10/2.29 0 [] A!=B|subset(B,A).
% 2.10/2.29 0 [] A=B| -subset(A,B)| -subset(B,A).
% 2.10/2.29 0 [] -relation(A)| -is_reflexive_in(A,B)| -in(C,B)|in(ordered_pair(C,C),A).
% 2.10/2.29 0 [] -relation(A)|is_reflexive_in(A,B)|in($f1(A,B),B).
% 2.10/2.29 0 [] -relation(A)|is_reflexive_in(A,B)| -in(ordered_pair($f1(A,B),$f1(A,B)),A).
% 2.10/2.29 0 [] -relation(A)|C!=fiber(A,B)| -in(D,C)|D!=B.
% 2.10/2.29 0 [] -relation(A)|C!=fiber(A,B)| -in(D,C)|in(ordered_pair(D,B),A).
% 2.10/2.29 0 [] -relation(A)|C!=fiber(A,B)|in(D,C)|D=B| -in(ordered_pair(D,B),A).
% 2.10/2.29 0 [] -relation(A)|C=fiber(A,B)|in($f2(A,B,C),C)|$f2(A,B,C)!=B.
% 2.10/2.29 0 [] -relation(A)|C=fiber(A,B)|in($f2(A,B,C),C)|in(ordered_pair($f2(A,B,C),B),A).
% 2.10/2.29 0 [] -relation(A)|C=fiber(A,B)| -in($f2(A,B,C),C)|$f2(A,B,C)=B| -in(ordered_pair($f2(A,B,C),B),A).
% 2.10/2.29 0 [] -subset(A,B)| -in(C,A)|in(C,B).
% 2.10/2.29 0 [] subset(A,B)|in($f3(A,B),A).
% 2.10/2.29 0 [] subset(A,B)| -in($f3(A,B),B).
% 2.10/2.29 0 [] -relation(A)| -is_well_founded_in(A,B)| -subset(C,B)|C=empty_set|in($f4(A,B,C),C).
% 2.10/2.29 0 [] -relation(A)| -is_well_founded_in(A,B)| -subset(C,B)|C=empty_set|disjoint(fiber(A,$f4(A,B,C)),C).
% 2.10/2.29 0 [] -relation(A)|is_well_founded_in(A,B)|subset($f5(A,B),B).
% 2.10/2.29 0 [] -relation(A)|is_well_founded_in(A,B)|$f5(A,B)!=empty_set.
% 2.10/2.29 0 [] -relation(A)|is_well_founded_in(A,B)| -in(D,$f5(A,B))| -disjoint(fiber(A,D),$f5(A,B)).
% 2.10/2.29 0 [] -relation(A)| -is_antisymmetric_in(A,B)| -in(C,B)| -in(D,B)| -in(ordered_pair(C,D),A)| -in(ordered_pair(D,C),A)|C=D.
% 2.10/2.29 0 [] -relation(A)|is_antisymmetric_in(A,B)|in($f7(A,B),B).
% 2.10/2.29 0 [] -relation(A)|is_antisymmetric_in(A,B)|in($f6(A,B),B).
% 2.10/2.29 0 [] -relation(A)|is_antisymmetric_in(A,B)|in(ordered_pair($f7(A,B),$f6(A,B)),A).
% 2.10/2.29 0 [] -relation(A)|is_antisymmetric_in(A,B)|in(ordered_pair($f6(A,B),$f7(A,B)),A).
% 2.10/2.29 0 [] -relation(A)|is_antisymmetric_in(A,B)|$f7(A,B)!=$f6(A,B).
% 2.10/2.29 0 [] ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A)).
% 2.10/2.29 0 [] -relation(A)| -well_orders(A,B)|is_reflexive_in(A,B).
% 2.10/2.29 0 [] -relation(A)| -well_orders(A,B)|is_transitive_in(A,B).
% 2.10/2.29 0 [] -relation(A)| -well_orders(A,B)|is_antisymmetric_in(A,B).
% 2.10/2.29 0 [] -relation(A)| -well_orders(A,B)|is_connected_in(A,B).
% 2.10/2.29 0 [] -relation(A)| -well_orders(A,B)|is_well_founded_in(A,B).
% 2.10/2.29 0 [] -relation(A)|well_orders(A,B)| -is_reflexive_in(A,B)| -is_transitive_in(A,B)| -is_antisymmetric_in(A,B)| -is_connected_in(A,B)| -is_well_founded_in(A,B).
% 2.10/2.29 0 [] -relation(A)|relation_field(A)=set_union2(relation_dom(A),relation_rng(A)).
% 2.10/2.29 0 [] -relation(A)| -is_connected_in(A,B)| -in(C,B)| -in(D,B)|C=D|in(ordered_pair(C,D),A)|in(ordered_pair(D,C),A).
% 2.10/2.29 0 [] -relation(A)|is_connected_in(A,B)|in($f9(A,B),B).
% 2.10/2.29 0 [] -relation(A)|is_connected_in(A,B)|in($f8(A,B),B).
% 2.10/2.29 0 [] -relation(A)|is_connected_in(A,B)|$f9(A,B)!=$f8(A,B).
% 2.10/2.29 0 [] -relation(A)|is_connected_in(A,B)| -in(ordered_pair($f9(A,B),$f8(A,B)),A).
% 2.10/2.29 0 [] -relation(A)|is_connected_in(A,B)| -in(ordered_pair($f8(A,B),$f9(A,B)),A).
% 2.10/2.29 0 [] -relation(A)|relation_restriction(A,B)=set_intersection2(A,cartesian_product2(B,B)).
% 2.10/2.29 0 [] -relation(A)| -is_transitive_in(A,B)| -in(C,B)| -in(D,B)| -in(E,B)| -in(ordered_pair(C,D),A)| -in(ordered_pair(D,E),A)|in(ordered_pair(C,E),A).
% 2.10/2.29 0 [] -relation(A)|is_transitive_in(A,B)|in($f12(A,B),B).
% 2.10/2.29 0 [] -relation(A)|is_transitive_in(A,B)|in($f11(A,B),B).
% 2.10/2.29 0 [] -relation(A)|is_transitive_in(A,B)|in($f10(A,B),B).
% 2.10/2.29 0 [] -relation(A)|is_transitive_in(A,B)|in(ordered_pair($f12(A,B),$f11(A,B)),A).
% 2.10/2.29 0 [] -relation(A)|is_transitive_in(A,B)|in(ordered_pair($f11(A,B),$f10(A,B)),A).
% 2.10/2.29 0 [] -relation(A)|is_transitive_in(A,B)| -in(ordered_pair($f12(A,B),$f10(A,B)),A).
% 2.10/2.29 0 [] $T.
% 2.10/2.29 0 [] $T.
% 2.10/2.29 0 [] $T.
% 2.10/2.29 0 [] $T.
% 2.10/2.29 0 [] $T.
% 2.10/2.29 0 [] $T.
% 2.10/2.29 0 [] $T.
% 2.10/2.29 0 [] -relation(A)|relation(relation_restriction(A,B)).
% 2.10/2.29 0 [] $T.
% 2.10/2.29 0 [] $T.
% 2.10/2.29 0 [] $T.
% 2.10/2.29 0 [] $T.
% 2.10/2.29 0 [] $T.
% 2.10/2.29 0 [] $T.
% 2.10/2.29 0 [] element($f13(A),A).
% 2.10/2.29 0 [] empty(empty_set).
% 2.10/2.29 0 [] -empty(ordered_pair(A,B)).
% 2.10/2.29 0 [] relation(empty_set).
% 2.10/2.29 0 [] relation_empty_yielding(empty_set).
% 2.10/2.29 0 [] function(empty_set).
% 2.10/2.29 0 [] one_to_one(empty_set).
% 2.10/2.29 0 [] empty(empty_set).
% 2.10/2.29 0 [] epsilon_transitive(empty_set).
% 2.10/2.29 0 [] epsilon_connected(empty_set).
% 2.10/2.29 0 [] ordinal(empty_set).
% 2.10/2.29 0 [] empty(A)| -empty(set_union2(A,B)).
% 2.10/2.29 0 [] empty(A)| -empty(set_union2(B,A)).
% 2.10/2.29 0 [] set_union2(A,A)=A.
% 2.10/2.29 0 [] set_intersection2(A,A)=A.
% 2.10/2.29 0 [] relation($c1).
% 2.10/2.29 0 [] function($c1).
% 2.10/2.29 0 [] epsilon_transitive($c2).
% 2.10/2.29 0 [] epsilon_connected($c2).
% 2.10/2.29 0 [] ordinal($c2).
% 2.10/2.29 0 [] empty($c3).
% 2.10/2.29 0 [] relation($c4).
% 2.10/2.29 0 [] empty($c4).
% 2.10/2.29 0 [] function($c4).
% 2.10/2.29 0 [] relation($c5).
% 2.10/2.29 0 [] function($c5).
% 2.10/2.29 0 [] one_to_one($c5).
% 2.10/2.29 0 [] empty($c5).
% 2.10/2.29 0 [] epsilon_transitive($c5).
% 2.10/2.29 0 [] epsilon_connected($c5).
% 2.10/2.29 0 [] ordinal($c5).
% 2.10/2.29 0 [] -empty($c6).
% 2.10/2.29 0 [] relation($c7).
% 2.10/2.29 0 [] function($c7).
% 2.10/2.29 0 [] one_to_one($c7).
% 2.10/2.29 0 [] -empty($c8).
% 2.10/2.29 0 [] epsilon_transitive($c8).
% 2.10/2.29 0 [] epsilon_connected($c8).
% 2.10/2.29 0 [] ordinal($c8).
% 2.10/2.29 0 [] relation($c9).
% 2.10/2.29 0 [] relation_empty_yielding($c9).
% 2.10/2.29 0 [] function($c9).
% 2.10/2.29 0 [] subset(A,A).
% 2.10/2.29 0 [] -disjoint(A,B)|disjoint(B,A).
% 2.10/2.29 0 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(A,C).
% 2.10/2.29 0 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(B,D).
% 2.10/2.29 0 [] in(ordered_pair(A,B),cartesian_product2(C,D))| -in(A,C)| -in(B,D).
% 2.10/2.29 0 [] -relation(C)| -in(A,relation_restriction(C,B))|in(A,C).
% 2.10/2.29 0 [] -relation(C)| -in(A,relation_restriction(C,B))|in(A,cartesian_product2(B,B)).
% 2.10/2.29 0 [] -relation(C)|in(A,relation_restriction(C,B))| -in(A,C)| -in(A,cartesian_product2(B,B)).
% 2.10/2.29 0 [] set_union2(A,empty_set)=A.
% 2.10/2.29 0 [] -in(A,B)|element(A,B).
% 2.10/2.29 0 [] -relation(B)|subset(relation_field(relation_restriction(B,A)),relation_field(B)).
% 2.10/2.29 0 [] -relation(B)|subset(relation_field(relation_restriction(B,A)),A).
% 2.10/2.29 0 [] relation($c10).
% 2.10/2.29 0 [] well_orders($c10,$c11).
% 2.10/2.29 0 [] relation_field(relation_restriction($c10,$c11))!=$c11| -well_ordering(relation_restriction($c10,$c11)).
% 2.10/2.29 0 [] set_intersection2(A,empty_set)=empty_set.
% 2.10/2.29 0 [] -element(A,B)|empty(B)|in(A,B).
% 2.10/2.29 0 [] -relation(C)| -in(ordered_pair(A,B),C)|in(A,relation_field(C)).
% 2.10/2.29 0 [] -relation(C)| -in(ordered_pair(A,B),C)|in(B,relation_field(C)).
% 2.10/2.29 0 [] -element(A,powerset(B))|subset(A,B).
% 2.10/2.29 0 [] element(A,powerset(B))| -subset(A,B).
% 2.10/2.29 0 [] disjoint(A,B)|in($f14(A,B),A).
% 2.10/2.29 0 [] disjoint(A,B)|in($f14(A,B),B).
% 2.10/2.29 0 [] -in(C,A)| -in(C,B)| -disjoint(A,B).
% 2.10/2.29 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.10/2.29 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.10/2.29 0 [] -empty(A)|A=empty_set.
% 2.10/2.29 0 [] -in(A,B)| -empty(B).
% 2.10/2.29 0 [] -empty(A)|A=B| -empty(B).
% 2.10/2.29 0 [] -relation(A)| -well_orders(A,relation_field(A))|well_ordering(A).
% 2.10/2.29 0 [] -relation(A)|well_orders(A,relation_field(A))| -well_ordering(A).
% 2.10/2.29 end_of_list.
% 2.10/2.29
% 2.10/2.29 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 2.10/2.29
% 2.10/2.29 This ia a non-Horn set with equality. The strategy will be
% 2.10/2.29 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.10/2.29 deletion, with positive clauses in sos and nonpositive
% 2.10/2.29 clauses in usable.
% 2.10/2.29
% 2.10/2.29 dependent: set(knuth_bendix).
% 2.10/2.29 dependent: set(anl_eq).
% 2.10/2.29 dependent: set(para_from).
% 2.10/2.29 dependent: set(para_into).
% 2.10/2.29 dependent: clear(para_from_right).
% 2.10/2.29 dependent: clear(para_into_right).
% 2.10/2.29 dependent: set(para_from_vars).
% 2.10/2.29 dependent: set(eq_units_both_ways).
% 2.10/2.29 dependent: set(dynamic_demod_all).
% 2.10/2.29 dependent: set(dynamic_demod).
% 2.10/2.29 dependent: set(order_eq).
% 2.10/2.29 dependent: set(back_demod).
% 2.10/2.29 dependent: set(lrpo).
% 2.10/2.29 dependent: set(hyper_res).
% 2.10/2.30 dependent: set(unit_deletion).
% 2.10/2.30 dependent: set(factor).
% 2.10/2.30
% 2.10/2.30 ------------> process usable:
% 2.10/2.30 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 2.10/2.30 ** KEPT (pick-wt=4): 2 [] -empty(A)|function(A).
% 2.10/2.30 ** KEPT (pick-wt=4): 3 [] -ordinal(A)|epsilon_transitive(A).
% 2.10/2.30 ** KEPT (pick-wt=4): 4 [] -ordinal(A)|epsilon_connected(A).
% 2.10/2.30 ** KEPT (pick-wt=8): 5 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 2.10/2.30 ** KEPT (pick-wt=6): 6 [] -epsilon_transitive(A)| -epsilon_connected(A)|ordinal(A).
% 2.10/2.30 ** KEPT (pick-wt=4): 7 [] -empty(A)|epsilon_transitive(A).
% 2.10/2.30 ** KEPT (pick-wt=4): 8 [] -empty(A)|epsilon_connected(A).
% 2.10/2.30 ** KEPT (pick-wt=4): 9 [] -empty(A)|ordinal(A).
% 2.10/2.30 ** KEPT (pick-wt=6): 10 [] A!=B|subset(A,B).
% 2.10/2.30 ** KEPT (pick-wt=6): 11 [] A!=B|subset(B,A).
% 2.10/2.30 ** KEPT (pick-wt=9): 12 [] A=B| -subset(A,B)| -subset(B,A).
% 2.10/2.30 ** KEPT (pick-wt=13): 13 [] -relation(A)| -is_reflexive_in(A,B)| -in(C,B)|in(ordered_pair(C,C),A).
% 2.10/2.30 ** KEPT (pick-wt=10): 14 [] -relation(A)|is_reflexive_in(A,B)|in($f1(A,B),B).
% 2.10/2.30 ** KEPT (pick-wt=14): 15 [] -relation(A)|is_reflexive_in(A,B)| -in(ordered_pair($f1(A,B),$f1(A,B)),A).
% 2.10/2.30 ** KEPT (pick-wt=13): 16 [] -relation(A)|B!=fiber(A,C)| -in(D,B)|D!=C.
% 2.10/2.30 ** KEPT (pick-wt=15): 17 [] -relation(A)|B!=fiber(A,C)| -in(D,B)|in(ordered_pair(D,C),A).
% 2.10/2.30 ** KEPT (pick-wt=18): 18 [] -relation(A)|B!=fiber(A,C)|in(D,B)|D=C| -in(ordered_pair(D,C),A).
% 2.10/2.30 ** KEPT (pick-wt=19): 19 [] -relation(A)|B=fiber(A,C)|in($f2(A,C,B),B)|$f2(A,C,B)!=C.
% 2.10/2.30 ** KEPT (pick-wt=21): 20 [] -relation(A)|B=fiber(A,C)|in($f2(A,C,B),B)|in(ordered_pair($f2(A,C,B),C),A).
% 2.10/2.30 ** KEPT (pick-wt=27): 21 [] -relation(A)|B=fiber(A,C)| -in($f2(A,C,B),B)|$f2(A,C,B)=C| -in(ordered_pair($f2(A,C,B),C),A).
% 2.10/2.30 ** KEPT (pick-wt=9): 22 [] -subset(A,B)| -in(C,A)|in(C,B).
% 2.10/2.30 ** KEPT (pick-wt=8): 23 [] subset(A,B)| -in($f3(A,B),B).
% 2.10/2.30 ** KEPT (pick-wt=17): 24 [] -relation(A)| -is_well_founded_in(A,B)| -subset(C,B)|C=empty_set|in($f4(A,B,C),C).
% 2.10/2.30 ** KEPT (pick-wt=19): 25 [] -relation(A)| -is_well_founded_in(A,B)| -subset(C,B)|C=empty_set|disjoint(fiber(A,$f4(A,B,C)),C).
% 2.10/2.30 ** KEPT (pick-wt=10): 26 [] -relation(A)|is_well_founded_in(A,B)|subset($f5(A,B),B).
% 2.10/2.30 ** KEPT (pick-wt=10): 27 [] -relation(A)|is_well_founded_in(A,B)|$f5(A,B)!=empty_set.
% 2.10/2.30 ** KEPT (pick-wt=17): 28 [] -relation(A)|is_well_founded_in(A,B)| -in(C,$f5(A,B))| -disjoint(fiber(A,C),$f5(A,B)).
% 2.10/2.30 ** KEPT (pick-wt=24): 29 [] -relation(A)| -is_antisymmetric_in(A,B)| -in(C,B)| -in(D,B)| -in(ordered_pair(C,D),A)| -in(ordered_pair(D,C),A)|C=D.
% 2.10/2.30 ** KEPT (pick-wt=10): 30 [] -relation(A)|is_antisymmetric_in(A,B)|in($f7(A,B),B).
% 2.10/2.30 ** KEPT (pick-wt=10): 31 [] -relation(A)|is_antisymmetric_in(A,B)|in($f6(A,B),B).
% 2.10/2.30 ** KEPT (pick-wt=14): 32 [] -relation(A)|is_antisymmetric_in(A,B)|in(ordered_pair($f7(A,B),$f6(A,B)),A).
% 2.10/2.30 ** KEPT (pick-wt=14): 33 [] -relation(A)|is_antisymmetric_in(A,B)|in(ordered_pair($f6(A,B),$f7(A,B)),A).
% 2.10/2.30 ** KEPT (pick-wt=12): 34 [] -relation(A)|is_antisymmetric_in(A,B)|$f7(A,B)!=$f6(A,B).
% 2.10/2.30 ** KEPT (pick-wt=8): 35 [] -relation(A)| -well_orders(A,B)|is_reflexive_in(A,B).
% 2.10/2.30 ** KEPT (pick-wt=8): 36 [] -relation(A)| -well_orders(A,B)|is_transitive_in(A,B).
% 2.10/2.30 ** KEPT (pick-wt=8): 37 [] -relation(A)| -well_orders(A,B)|is_antisymmetric_in(A,B).
% 2.10/2.30 ** KEPT (pick-wt=8): 38 [] -relation(A)| -well_orders(A,B)|is_connected_in(A,B).
% 2.10/2.30 ** KEPT (pick-wt=8): 39 [] -relation(A)| -well_orders(A,B)|is_well_founded_in(A,B).
% 2.10/2.30 ** KEPT (pick-wt=20): 40 [] -relation(A)|well_orders(A,B)| -is_reflexive_in(A,B)| -is_transitive_in(A,B)| -is_antisymmetric_in(A,B)| -is_connected_in(A,B)| -is_well_founded_in(A,B).
% 2.10/2.30 ** KEPT (pick-wt=10): 42 [copy,41,flip.2] -relation(A)|set_union2(relation_dom(A),relation_rng(A))=relation_field(A).
% 2.10/2.30 ** KEPT (pick-wt=24): 43 [] -relation(A)| -is_connected_in(A,B)| -in(C,B)| -in(D,B)|C=D|in(ordered_pair(C,D),A)|in(ordered_pair(D,C),A).
% 2.10/2.30 ** KEPT (pick-wt=10): 44 [] -relation(A)|is_connected_in(A,B)|in($f9(A,B),B).
% 2.10/2.30 ** KEPT (pick-wt=10): 45 [] -relation(A)|is_connected_in(A,B)|in($f8(A,B),B).
% 2.10/2.30 ** KEPT (pick-wt=12): 46 [] -relation(A)|is_connected_in(A,B)|$f9(A,B)!=$f8(A,B).
% 2.10/2.30 ** KEPT (pick-wt=14): 47 [] -relation(A)|is_connected_in(A,B)| -in(ordered_pair($f9(A,B),$f8(A,B)),A).
% 2.10/2.30 ** KEPT (pick-wt=14): 48 [] -relation(A)|is_connected_in(A,B)| -in(ordered_pair($f8(A,B),$f9(A,B)),A).
% 2.10/2.30 ** KEPT (pick-wt=11): 50 [copy,49,flip.2] -relation(A)|set_intersection2(A,cartesian_product2(B,B))=relation_restriction(A,B).
% 2.10/2.30 ** KEPT (pick-wt=29): 51 [] -relation(A)| -is_transitive_in(A,B)| -in(C,B)| -in(D,B)| -in(E,B)| -in(ordered_pair(C,D),A)| -in(ordered_pair(D,E),A)|in(ordered_pair(C,E),A).
% 2.10/2.30 ** KEPT (pick-wt=10): 52 [] -relation(A)|is_transitive_in(A,B)|in($f12(A,B),B).
% 2.10/2.30 ** KEPT (pick-wt=10): 53 [] -relation(A)|is_transitive_in(A,B)|in($f11(A,B),B).
% 2.10/2.30 ** KEPT (pick-wt=10): 54 [] -relation(A)|is_transitive_in(A,B)|in($f10(A,B),B).
% 2.10/2.30 ** KEPT (pick-wt=14): 55 [] -relation(A)|is_transitive_in(A,B)|in(ordered_pair($f12(A,B),$f11(A,B)),A).
% 2.10/2.30 ** KEPT (pick-wt=14): 56 [] -relation(A)|is_transitive_in(A,B)|in(ordered_pair($f11(A,B),$f10(A,B)),A).
% 2.10/2.30 ** KEPT (pick-wt=14): 57 [] -relation(A)|is_transitive_in(A,B)| -in(ordered_pair($f12(A,B),$f10(A,B)),A).
% 2.10/2.30 ** KEPT (pick-wt=6): 58 [] -relation(A)|relation(relation_restriction(A,B)).
% 2.10/2.30 ** KEPT (pick-wt=4): 59 [] -empty(ordered_pair(A,B)).
% 2.10/2.30 ** KEPT (pick-wt=6): 60 [] empty(A)| -empty(set_union2(A,B)).
% 2.10/2.30 ** KEPT (pick-wt=6): 61 [] empty(A)| -empty(set_union2(B,A)).
% 2.10/2.30 ** KEPT (pick-wt=2): 62 [] -empty($c6).
% 2.10/2.30 ** KEPT (pick-wt=2): 63 [] -empty($c8).
% 2.10/2.30 ** KEPT (pick-wt=6): 64 [] -disjoint(A,B)|disjoint(B,A).
% 2.10/2.30 ** KEPT (pick-wt=10): 65 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(A,C).
% 2.10/2.30 ** KEPT (pick-wt=10): 66 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(B,D).
% 2.10/2.30 ** KEPT (pick-wt=13): 67 [] in(ordered_pair(A,B),cartesian_product2(C,D))| -in(A,C)| -in(B,D).
% 2.10/2.30 ** KEPT (pick-wt=10): 68 [] -relation(A)| -in(B,relation_restriction(A,C))|in(B,A).
% 2.10/2.30 ** KEPT (pick-wt=12): 69 [] -relation(A)| -in(B,relation_restriction(A,C))|in(B,cartesian_product2(C,C)).
% 2.10/2.30 ** KEPT (pick-wt=15): 70 [] -relation(A)|in(B,relation_restriction(A,C))| -in(B,A)| -in(B,cartesian_product2(C,C)).
% 2.10/2.30 ** KEPT (pick-wt=6): 71 [] -in(A,B)|element(A,B).
% 2.10/2.30 ** KEPT (pick-wt=9): 72 [] -relation(A)|subset(relation_field(relation_restriction(A,B)),relation_field(A)).
% 2.10/2.30 ** KEPT (pick-wt=8): 73 [] -relation(A)|subset(relation_field(relation_restriction(A,B)),B).
% 2.10/2.30 ** KEPT (pick-wt=10): 74 [] relation_field(relation_restriction($c10,$c11))!=$c11| -well_ordering(relation_restriction($c10,$c11)).
% 2.10/2.30 ** KEPT (pick-wt=8): 75 [] -element(A,B)|empty(B)|in(A,B).
% 2.10/2.30 ** KEPT (pick-wt=11): 76 [] -relation(A)| -in(ordered_pair(B,C),A)|in(B,relation_field(A)).
% 2.10/2.30 ** KEPT (pick-wt=11): 77 [] -relation(A)| -in(ordered_pair(B,C),A)|in(C,relation_field(A)).
% 2.10/2.30 ** KEPT (pick-wt=7): 78 [] -element(A,powerset(B))|subset(A,B).
% 2.10/2.30 ** KEPT (pick-wt=7): 79 [] element(A,powerset(B))| -subset(A,B).
% 2.10/2.30 ** KEPT (pick-wt=9): 80 [] -in(A,B)| -in(A,C)| -disjoint(B,C).
% 2.10/2.30 ** KEPT (pick-wt=10): 81 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.10/2.30 ** KEPT (pick-wt=9): 82 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.10/2.30 ** KEPT (pick-wt=5): 83 [] -empty(A)|A=empty_set.
% 2.10/2.30 ** KEPT (pick-wt=5): 84 [] -in(A,B)| -empty(B).
% 2.10/2.30 ** KEPT (pick-wt=7): 85 [] -empty(A)|A=B| -empty(B).
% 2.10/2.30 ** KEPT (pick-wt=8): 86 [] -relation(A)| -well_orders(A,relation_field(A))|well_ordering(A).
% 2.10/2.30 ** KEPT (pick-wt=8): 87 [] -relation(A)|well_orders(A,relation_field(A))| -well_ordering(A).
% 2.10/2.30
% 2.10/2.30 ------------> process sos:
% 2.10/2.30 ** KEPT (pick-wt=3): 99 [] A=A.
% 2.10/2.30 ** KEPT (pick-wt=7): 100 [] unordered_pair(A,B)=unordered_pair(B,A).
% 2.10/2.30 ** KEPT (pick-wt=7): 101 [] set_union2(A,B)=set_union2(B,A).
% 2.10/2.30 ** KEPT (pick-wt=7): 102 [] set_intersection2(A,B)=set_intersection2(B,A).
% 2.10/2.30 ** KEPT (pick-wt=8): 103 [] subset(A,B)|in($f3(A,B),A).
% 2.10/2.30 ** KEPT (pick-wt=10): 105 [copy,104,flip.1] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 2.10/2.30 ---> New Demodulator: 106 [new_demod,105] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 2.10/2.30 ** KEPT (pick-wt=4): 107 [] element($f13(A),A).
% 2.10/2.30 ** KEPT (pick-wt=2): 108 [] empty(empty_set).
% 2.10/2.30 ** KEPT (pick-wt=2): 109 [] relation(empty_set).
% 2.10/2.30 ** KEPT (pick-wt=2): 110 [] relation_empty_yielding(empty_set).
% 2.10/2.30 ** KEPT (pick-wt=2): 111 [] function(empty_set).
% 2.10/2.30 ** KEPT (pick-wt=2): 112 [] one_to_one(empty_set).
% 2.10/2.30 Following clause subsumed by 108 during input processing: 0 [] empty(empty_set).
% 4.55/4.82 ** KEPT (pick-wt=2): 113 [] epsilon_transitive(empty_set).
% 4.55/4.82 ** KEPT (pick-wt=2): 114 [] epsilon_connected(empty_set).
% 4.55/4.82 ** KEPT (pick-wt=2): 115 [] ordinal(empty_set).
% 4.55/4.82 ** KEPT (pick-wt=5): 116 [] set_union2(A,A)=A.
% 4.55/4.82 ---> New Demodulator: 117 [new_demod,116] set_union2(A,A)=A.
% 4.55/4.82 ** KEPT (pick-wt=5): 118 [] set_intersection2(A,A)=A.
% 4.55/4.82 ---> New Demodulator: 119 [new_demod,118] set_intersection2(A,A)=A.
% 4.55/4.82 ** KEPT (pick-wt=2): 120 [] relation($c1).
% 4.55/4.82 ** KEPT (pick-wt=2): 121 [] function($c1).
% 4.55/4.82 ** KEPT (pick-wt=2): 122 [] epsilon_transitive($c2).
% 4.55/4.82 ** KEPT (pick-wt=2): 123 [] epsilon_connected($c2).
% 4.55/4.82 ** KEPT (pick-wt=2): 124 [] ordinal($c2).
% 4.55/4.82 ** KEPT (pick-wt=2): 125 [] empty($c3).
% 4.55/4.82 ** KEPT (pick-wt=2): 126 [] relation($c4).
% 4.55/4.82 ** KEPT (pick-wt=2): 127 [] empty($c4).
% 4.55/4.82 ** KEPT (pick-wt=2): 128 [] function($c4).
% 4.55/4.82 ** KEPT (pick-wt=2): 129 [] relation($c5).
% 4.55/4.82 ** KEPT (pick-wt=2): 130 [] function($c5).
% 4.55/4.82 ** KEPT (pick-wt=2): 131 [] one_to_one($c5).
% 4.55/4.82 ** KEPT (pick-wt=2): 132 [] empty($c5).
% 4.55/4.82 ** KEPT (pick-wt=2): 133 [] epsilon_transitive($c5).
% 4.55/4.82 ** KEPT (pick-wt=2): 134 [] epsilon_connected($c5).
% 4.55/4.82 ** KEPT (pick-wt=2): 135 [] ordinal($c5).
% 4.55/4.82 ** KEPT (pick-wt=2): 136 [] relation($c7).
% 4.55/4.82 ** KEPT (pick-wt=2): 137 [] function($c7).
% 4.55/4.82 ** KEPT (pick-wt=2): 138 [] one_to_one($c7).
% 4.55/4.82 ** KEPT (pick-wt=2): 139 [] epsilon_transitive($c8).
% 4.55/4.82 ** KEPT (pick-wt=2): 140 [] epsilon_connected($c8).
% 4.55/4.82 ** KEPT (pick-wt=2): 141 [] ordinal($c8).
% 4.55/4.82 ** KEPT (pick-wt=2): 142 [] relation($c9).
% 4.55/4.82 ** KEPT (pick-wt=2): 143 [] relation_empty_yielding($c9).
% 4.55/4.82 ** KEPT (pick-wt=2): 144 [] function($c9).
% 4.55/4.82 ** KEPT (pick-wt=3): 145 [] subset(A,A).
% 4.55/4.82 ** KEPT (pick-wt=5): 146 [] set_union2(A,empty_set)=A.
% 4.55/4.82 ---> New Demodulator: 147 [new_demod,146] set_union2(A,empty_set)=A.
% 4.55/4.82 ** KEPT (pick-wt=2): 148 [] relation($c10).
% 4.55/4.82 ** KEPT (pick-wt=3): 149 [] well_orders($c10,$c11).
% 4.55/4.82 ** KEPT (pick-wt=5): 150 [] set_intersection2(A,empty_set)=empty_set.
% 4.55/4.82 ---> New Demodulator: 151 [new_demod,150] set_intersection2(A,empty_set)=empty_set.
% 4.55/4.82 ** KEPT (pick-wt=8): 152 [] disjoint(A,B)|in($f14(A,B),A).
% 4.55/4.82 ** KEPT (pick-wt=8): 153 [] disjoint(A,B)|in($f14(A,B),B).
% 4.55/4.82 Following clause subsumed by 99 during input processing: 0 [copy,99,flip.1] A=A.
% 4.55/4.82 99 back subsumes 98.
% 4.55/4.82 99 back subsumes 91.
% 4.55/4.82 99 back subsumes 90.
% 4.55/4.82 99 back subsumes 89.
% 4.55/4.82 Following clause subsumed by 100 during input processing: 0 [copy,100,flip.1] unordered_pair(A,B)=unordered_pair(B,A).
% 4.55/4.82 Following clause subsumed by 101 during input processing: 0 [copy,101,flip.1] set_union2(A,B)=set_union2(B,A).
% 4.55/4.82 Following clause subsumed by 102 during input processing: 0 [copy,102,flip.1] set_intersection2(A,B)=set_intersection2(B,A).
% 4.55/4.82 >>>> Starting back demodulation with 106.
% 4.55/4.82 >>>> Starting back demodulation with 117.
% 4.55/4.82 >>>> Starting back demodulation with 119.
% 4.55/4.82 >>>> Starting back demodulation with 147.
% 4.55/4.82 >>>> Starting back demodulation with 151.
% 4.55/4.82
% 4.55/4.82 ======= end of input processing =======
% 4.55/4.82
% 4.55/4.82 =========== start of search ===========
% 4.55/4.82
% 4.55/4.82
% 4.55/4.82 Resetting weight limit to 5.
% 4.55/4.82
% 4.55/4.82
% 4.55/4.82 Resetting weight limit to 5.
% 4.55/4.82
% 4.55/4.82 sos_size=358
% 4.55/4.82
% 4.55/4.82 Search stopped because sos empty.
% 4.55/4.82
% 4.55/4.82
% 4.55/4.82 Search stopped because sos empty.
% 4.55/4.82
% 4.55/4.82 ============ end of search ============
% 4.55/4.82
% 4.55/4.82 -------------- statistics -------------
% 4.55/4.82 clauses given 470
% 4.55/4.82 clauses generated 81367
% 4.55/4.82 clauses kept 745
% 4.55/4.82 clauses forward subsumed 1102
% 4.55/4.82 clauses back subsumed 9
% 4.55/4.82 Kbytes malloced 6835
% 4.55/4.82
% 4.55/4.82 ----------- times (seconds) -----------
% 4.55/4.82 user CPU time 2.53 (0 hr, 0 min, 2 sec)
% 4.55/4.82 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 4.55/4.82 wall-clock time 4 (0 hr, 0 min, 4 sec)
% 4.55/4.82
% 4.55/4.82 Process 352 finished Wed Jul 27 08:05:11 2022
% 4.55/4.82 Otter interrupted
% 4.55/4.82 PROOF NOT FOUND
%------------------------------------------------------------------------------