TSTP Solution File: SEU296+3 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU296+3 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n023.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:31 EDT 2022
% Result : Timeout 299.86s 300.04s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEU296+3 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.11/0.33 % Computer : n023.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Wed Jul 27 08:11:03 EDT 2022
% 0.11/0.33 % CPUTime :
% 2.33/2.55 ----- Otter 3.3f, August 2004 -----
% 2.33/2.55 The process was started by sandbox on n023.cluster.edu,
% 2.33/2.55 Wed Jul 27 08:11:03 2022
% 2.33/2.55 The command was "./otter". The process ID is 7008.
% 2.33/2.55
% 2.33/2.55 set(prolog_style_variables).
% 2.33/2.55 set(auto).
% 2.33/2.55 dependent: set(auto1).
% 2.33/2.55 dependent: set(process_input).
% 2.33/2.55 dependent: clear(print_kept).
% 2.33/2.55 dependent: clear(print_new_demod).
% 2.33/2.55 dependent: clear(print_back_demod).
% 2.33/2.55 dependent: clear(print_back_sub).
% 2.33/2.55 dependent: set(control_memory).
% 2.33/2.55 dependent: assign(max_mem, 12000).
% 2.33/2.55 dependent: assign(pick_given_ratio, 4).
% 2.33/2.55 dependent: assign(stats_level, 1).
% 2.33/2.55 dependent: assign(max_seconds, 10800).
% 2.33/2.55 clear(print_given).
% 2.33/2.55
% 2.33/2.55 formula_list(usable).
% 2.33/2.55 all A (A=A).
% 2.33/2.55 all A B (in(A,B)-> -in(B,A)).
% 2.33/2.55 all A (ordinal(A)-> (all B (element(B,A)->epsilon_transitive(B)&epsilon_connected(B)&ordinal(B)))).
% 2.33/2.55 all A (empty(A)->finite(A)).
% 2.33/2.55 all A (empty(A)->function(A)).
% 2.33/2.55 all A (ordinal(A)->epsilon_transitive(A)&epsilon_connected(A)).
% 2.33/2.55 all A (empty(A)->relation(A)).
% 2.33/2.55 all A (empty(A)&ordinal(A)->epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)&natural(A)).
% 2.33/2.55 all A (finite(A)-> (all B (element(B,powerset(A))->finite(B)))).
% 2.33/2.55 all A (relation(A)&empty(A)&function(A)->relation(A)&function(A)&one_to_one(A)).
% 2.33/2.55 all A (epsilon_transitive(A)&epsilon_connected(A)->ordinal(A)).
% 2.33/2.55 all A (element(A,omega)->epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)&natural(A)).
% 2.33/2.55 all A (empty(A)->epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 2.33/2.55 all A (element(A,positive_rationals)-> (ordinal(A)->epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)&natural(A))).
% 2.33/2.55 all A B (set_intersection2(A,B)=set_intersection2(B,A)).
% 2.33/2.55 all A (finite(A)<-> (exists B (relation(B)&function(B)&relation_rng(B)=A&in(relation_dom(B),omega)))).
% 2.33/2.55 all A B (relation(A)&relation(B)->relation(relation_composition(A,B))).
% 2.33/2.55 all A exists B element(B,A).
% 2.33/2.55 all A B (finite(B)->finite(set_intersection2(A,B))).
% 2.33/2.55 all A B (empty(A)&relation(B)->empty(relation_composition(B,A))&relation(relation_composition(B,A))).
% 2.33/2.55 all A B (finite(A)->finite(set_intersection2(A,B))).
% 2.33/2.55 empty(empty_set).
% 2.33/2.55 relation(empty_set).
% 2.33/2.55 relation_empty_yielding(empty_set).
% 2.33/2.55 all A B (relation(A)&function(A)&relation(B)&function(B)->relation(relation_composition(A,B))&function(relation_composition(A,B))).
% 2.33/2.55 epsilon_transitive(omega).
% 2.33/2.55 epsilon_connected(omega).
% 2.33/2.55 ordinal(omega).
% 2.33/2.55 -empty(omega).
% 2.33/2.55 all A B (relation(A)&relation(B)->relation(set_intersection2(A,B))).
% 2.33/2.55 all A (-empty(powerset(A))).
% 2.33/2.55 empty(empty_set).
% 2.33/2.55 relation(empty_set).
% 2.33/2.55 relation_empty_yielding(empty_set).
% 2.33/2.55 function(empty_set).
% 2.33/2.55 one_to_one(empty_set).
% 2.33/2.55 empty(empty_set).
% 2.33/2.55 epsilon_transitive(empty_set).
% 2.33/2.55 epsilon_connected(empty_set).
% 2.33/2.55 ordinal(empty_set).
% 2.33/2.55 empty(empty_set).
% 2.33/2.55 relation(empty_set).
% 2.33/2.55 all A (relation(A)&function(A)&transfinite_se_quence(A)->epsilon_transitive(relation_dom(A))&epsilon_connected(relation_dom(A))&ordinal(relation_dom(A))).
% 2.33/2.55 all A (-empty(A)&relation(A)-> -empty(relation_dom(A))).
% 2.33/2.55 all A (relation(A)&relation_non_empty(A)&function(A)->with_non_empty_elements(relation_rng(A))).
% 2.33/2.55 all A (-empty(A)&relation(A)-> -empty(relation_rng(A))).
% 2.33/2.55 all A (empty(A)->empty(relation_dom(A))&relation(relation_dom(A))).
% 2.33/2.55 -empty(positive_rationals).
% 2.33/2.55 all A B (relation(A)&function(A)&function_yielding(A)&relation(B)&function(B)->relation(relation_composition(B,A))&function(relation_composition(B,A))&function_yielding(relation_composition(B,A))).
% 2.33/2.55 all A (empty(A)->empty(relation_rng(A))&relation(relation_rng(A))).
% 2.33/2.55 all A B (empty(A)&relation(B)->empty(relation_composition(A,B))&relation(relation_composition(A,B))).
% 2.33/2.55 all A B (set_intersection2(A,A)=A).
% 2.33/2.55 exists A (-empty(A)&epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)&natural(A)).
% 2.33/2.55 exists A (-empty(A)&finite(A)).
% 2.33/2.55 exists A (relation(A)&function(A)&function_yielding(A)).
% 2.33/2.55 exists A (relation(A)&function(A)).
% 2.33/2.55 exists A (epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 2.33/2.55 exists A (epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)&being_limit_ordinal(A)).
% 2.33/2.55 exists A (empty(A)&relation(A)).
% 2.33/2.55 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)))).
% 2.33/2.55 exists A empty(A).
% 2.33/2.55 exists A (element(A,positive_rationals)& -empty(A)&epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 2.33/2.55 all A exists B (element(B,powerset(A))&empty(B)&relation(B)&function(B)&one_to_one(B)&epsilon_transitive(B)&epsilon_connected(B)&ordinal(B)&natural(B)&finite(B)).
% 2.33/2.55 exists A (relation(A)&empty(A)&function(A)).
% 2.33/2.55 exists A (relation(A)&function(A)&one_to_one(A)&empty(A)&epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 2.33/2.55 exists A (relation(A)&function(A)&transfinite_se_quence(A)&ordinal_yielding(A)).
% 2.33/2.55 exists A (-empty(A)&relation(A)).
% 2.33/2.55 all A exists B (element(B,powerset(A))&empty(B)).
% 2.33/2.55 exists A (-empty(A)).
% 2.33/2.55 exists A (element(A,positive_rationals)&empty(A)&epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)&natural(A)).
% 2.33/2.55 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)&finite(B)))).
% 2.33/2.55 exists A (relation(A)&function(A)&one_to_one(A)).
% 2.33/2.55 exists A (-empty(A)&epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 2.33/2.55 exists A (relation(A)&relation_empty_yielding(A)).
% 2.33/2.55 exists A (relation(A)&relation_empty_yielding(A)&function(A)).
% 2.33/2.55 exists A (relation(A)&function(A)&transfinite_se_quence(A)).
% 2.33/2.55 exists A (relation(A)&relation_non_empty(A)&function(A)).
% 2.33/2.55 all A B subset(A,A).
% 2.33/2.55 all A B (relation(B)->relation_image(B,A)=relation_image(B,set_intersection2(relation_dom(B),A))).
% 2.33/2.55 all A B (finite(A)->finite(set_intersection2(A,B))).
% 2.33/2.55 all A (relation(A)-> (all B (relation(B)->relation_rng(relation_composition(A,B))=relation_image(B,relation_rng(A))))).
% 2.33/2.55 -(all A B (relation(B)&function(B)-> (finite(A)->finite(relation_image(B,A))))).
% 2.33/2.55 all A B subset(set_intersection2(A,B),A).
% 2.33/2.55 all A B (in(A,B)->element(A,B)).
% 2.33/2.55 all A (set_intersection2(A,empty_set)=empty_set).
% 2.33/2.55 all A B (element(A,B)->empty(B)|in(A,B)).
% 2.33/2.55 all A B (element(A,powerset(B))<->subset(A,B)).
% 2.33/2.55 all A (relation(A)-> (all B (relation(B)-> (subset(relation_rng(A),relation_dom(B))->relation_dom(relation_composition(A,B))=relation_dom(A))))).
% 2.33/2.55 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 2.33/2.55 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 2.33/2.55 all A (empty(A)->A=empty_set).
% 2.33/2.55 all A B (-(in(A,B)&empty(B))).
% 2.33/2.55 all A B (-(empty(A)&A!=B&empty(B))).
% 2.33/2.55 end_of_list.
% 2.33/2.55
% 2.33/2.55 -------> usable clausifies to:
% 2.33/2.55
% 2.33/2.55 list(usable).
% 2.33/2.55 0 [] A=A.
% 2.33/2.55 0 [] -in(A,B)| -in(B,A).
% 2.33/2.55 0 [] -ordinal(A)| -element(B,A)|epsilon_transitive(B).
% 2.33/2.55 0 [] -ordinal(A)| -element(B,A)|epsilon_connected(B).
% 2.33/2.55 0 [] -ordinal(A)| -element(B,A)|ordinal(B).
% 2.33/2.55 0 [] -empty(A)|finite(A).
% 2.33/2.55 0 [] -empty(A)|function(A).
% 2.33/2.55 0 [] -ordinal(A)|epsilon_transitive(A).
% 2.33/2.55 0 [] -ordinal(A)|epsilon_connected(A).
% 2.33/2.55 0 [] -empty(A)|relation(A).
% 2.33/2.55 0 [] -empty(A)| -ordinal(A)|epsilon_transitive(A).
% 2.33/2.55 0 [] -empty(A)| -ordinal(A)|epsilon_connected(A).
% 2.33/2.55 0 [] -empty(A)| -ordinal(A)|natural(A).
% 2.33/2.55 0 [] -finite(A)| -element(B,powerset(A))|finite(B).
% 2.33/2.55 0 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 2.33/2.55 0 [] -epsilon_transitive(A)| -epsilon_connected(A)|ordinal(A).
% 2.33/2.55 0 [] -element(A,omega)|epsilon_transitive(A).
% 2.33/2.55 0 [] -element(A,omega)|epsilon_connected(A).
% 2.33/2.55 0 [] -element(A,omega)|ordinal(A).
% 2.33/2.55 0 [] -element(A,omega)|natural(A).
% 2.33/2.55 0 [] -empty(A)|epsilon_transitive(A).
% 2.33/2.55 0 [] -empty(A)|epsilon_connected(A).
% 2.33/2.55 0 [] -empty(A)|ordinal(A).
% 2.33/2.55 0 [] -element(A,positive_rationals)| -ordinal(A)|epsilon_transitive(A).
% 2.33/2.55 0 [] -element(A,positive_rationals)| -ordinal(A)|epsilon_connected(A).
% 2.33/2.55 0 [] -element(A,positive_rationals)| -ordinal(A)|natural(A).
% 2.33/2.55 0 [] set_intersection2(A,B)=set_intersection2(B,A).
% 2.33/2.55 0 [] -finite(A)|relation($f1(A)).
% 2.33/2.55 0 [] -finite(A)|function($f1(A)).
% 2.33/2.55 0 [] -finite(A)|relation_rng($f1(A))=A.
% 2.33/2.55 0 [] -finite(A)|in(relation_dom($f1(A)),omega).
% 2.33/2.55 0 [] finite(A)| -relation(B)| -function(B)|relation_rng(B)!=A| -in(relation_dom(B),omega).
% 2.33/2.55 0 [] -relation(A)| -relation(B)|relation(relation_composition(A,B)).
% 2.33/2.55 0 [] element($f2(A),A).
% 2.33/2.55 0 [] -finite(B)|finite(set_intersection2(A,B)).
% 2.33/2.55 0 [] -empty(A)| -relation(B)|empty(relation_composition(B,A)).
% 2.33/2.55 0 [] -empty(A)| -relation(B)|relation(relation_composition(B,A)).
% 2.33/2.55 0 [] -finite(A)|finite(set_intersection2(A,B)).
% 2.33/2.55 0 [] empty(empty_set).
% 2.33/2.55 0 [] relation(empty_set).
% 2.33/2.55 0 [] relation_empty_yielding(empty_set).
% 2.33/2.55 0 [] -relation(A)| -function(A)| -relation(B)| -function(B)|relation(relation_composition(A,B)).
% 2.33/2.55 0 [] -relation(A)| -function(A)| -relation(B)| -function(B)|function(relation_composition(A,B)).
% 2.33/2.55 0 [] epsilon_transitive(omega).
% 2.33/2.55 0 [] epsilon_connected(omega).
% 2.33/2.55 0 [] ordinal(omega).
% 2.33/2.55 0 [] -empty(omega).
% 2.33/2.55 0 [] -relation(A)| -relation(B)|relation(set_intersection2(A,B)).
% 2.33/2.55 0 [] -empty(powerset(A)).
% 2.33/2.55 0 [] empty(empty_set).
% 2.33/2.55 0 [] relation(empty_set).
% 2.33/2.55 0 [] relation_empty_yielding(empty_set).
% 2.33/2.55 0 [] function(empty_set).
% 2.33/2.55 0 [] one_to_one(empty_set).
% 2.33/2.55 0 [] empty(empty_set).
% 2.33/2.55 0 [] epsilon_transitive(empty_set).
% 2.33/2.55 0 [] epsilon_connected(empty_set).
% 2.33/2.55 0 [] ordinal(empty_set).
% 2.33/2.55 0 [] empty(empty_set).
% 2.33/2.55 0 [] relation(empty_set).
% 2.33/2.55 0 [] -relation(A)| -function(A)| -transfinite_se_quence(A)|epsilon_transitive(relation_dom(A)).
% 2.33/2.55 0 [] -relation(A)| -function(A)| -transfinite_se_quence(A)|epsilon_connected(relation_dom(A)).
% 2.33/2.55 0 [] -relation(A)| -function(A)| -transfinite_se_quence(A)|ordinal(relation_dom(A)).
% 2.33/2.55 0 [] empty(A)| -relation(A)| -empty(relation_dom(A)).
% 2.33/2.55 0 [] -relation(A)| -relation_non_empty(A)| -function(A)|with_non_empty_elements(relation_rng(A)).
% 2.33/2.55 0 [] empty(A)| -relation(A)| -empty(relation_rng(A)).
% 2.33/2.55 0 [] -empty(A)|empty(relation_dom(A)).
% 2.33/2.55 0 [] -empty(A)|relation(relation_dom(A)).
% 2.33/2.55 0 [] -empty(positive_rationals).
% 2.33/2.55 0 [] -relation(A)| -function(A)| -function_yielding(A)| -relation(B)| -function(B)|relation(relation_composition(B,A)).
% 2.33/2.55 0 [] -relation(A)| -function(A)| -function_yielding(A)| -relation(B)| -function(B)|function(relation_composition(B,A)).
% 2.33/2.55 0 [] -relation(A)| -function(A)| -function_yielding(A)| -relation(B)| -function(B)|function_yielding(relation_composition(B,A)).
% 2.33/2.55 0 [] -empty(A)|empty(relation_rng(A)).
% 2.33/2.55 0 [] -empty(A)|relation(relation_rng(A)).
% 2.33/2.55 0 [] -empty(A)| -relation(B)|empty(relation_composition(A,B)).
% 2.33/2.55 0 [] -empty(A)| -relation(B)|relation(relation_composition(A,B)).
% 2.33/2.55 0 [] set_intersection2(A,A)=A.
% 2.33/2.55 0 [] -empty($c1).
% 2.33/2.55 0 [] epsilon_transitive($c1).
% 2.33/2.55 0 [] epsilon_connected($c1).
% 2.33/2.55 0 [] ordinal($c1).
% 2.33/2.55 0 [] natural($c1).
% 2.33/2.55 0 [] -empty($c2).
% 2.33/2.55 0 [] finite($c2).
% 2.33/2.55 0 [] relation($c3).
% 2.33/2.55 0 [] function($c3).
% 2.33/2.55 0 [] function_yielding($c3).
% 2.33/2.55 0 [] relation($c4).
% 2.33/2.55 0 [] function($c4).
% 2.33/2.55 0 [] epsilon_transitive($c5).
% 2.33/2.55 0 [] epsilon_connected($c5).
% 2.33/2.55 0 [] ordinal($c5).
% 2.33/2.55 0 [] epsilon_transitive($c6).
% 2.33/2.55 0 [] epsilon_connected($c6).
% 2.33/2.55 0 [] ordinal($c6).
% 2.33/2.55 0 [] being_limit_ordinal($c6).
% 2.33/2.55 0 [] empty($c7).
% 2.33/2.55 0 [] relation($c7).
% 2.33/2.55 0 [] empty(A)|element($f3(A),powerset(A)).
% 2.33/2.55 0 [] empty(A)| -empty($f3(A)).
% 2.33/2.55 0 [] empty($c8).
% 2.33/2.55 0 [] element($c9,positive_rationals).
% 2.33/2.55 0 [] -empty($c9).
% 2.33/2.55 0 [] epsilon_transitive($c9).
% 2.33/2.55 0 [] epsilon_connected($c9).
% 2.33/2.55 0 [] ordinal($c9).
% 2.33/2.55 0 [] element($f4(A),powerset(A)).
% 2.33/2.55 0 [] empty($f4(A)).
% 2.33/2.55 0 [] relation($f4(A)).
% 2.33/2.55 0 [] function($f4(A)).
% 2.33/2.55 0 [] one_to_one($f4(A)).
% 2.33/2.55 0 [] epsilon_transitive($f4(A)).
% 2.33/2.55 0 [] epsilon_connected($f4(A)).
% 2.33/2.55 0 [] ordinal($f4(A)).
% 2.33/2.55 0 [] natural($f4(A)).
% 2.33/2.55 0 [] finite($f4(A)).
% 2.33/2.55 0 [] relation($c10).
% 2.33/2.55 0 [] empty($c10).
% 2.33/2.55 0 [] function($c10).
% 2.33/2.55 0 [] relation($c11).
% 2.33/2.55 0 [] function($c11).
% 2.33/2.55 0 [] one_to_one($c11).
% 2.33/2.55 0 [] empty($c11).
% 2.33/2.55 0 [] epsilon_transitive($c11).
% 2.33/2.55 0 [] epsilon_connected($c11).
% 2.33/2.55 0 [] ordinal($c11).
% 2.33/2.55 0 [] relation($c12).
% 2.33/2.55 0 [] function($c12).
% 2.33/2.55 0 [] transfinite_se_quence($c12).
% 2.33/2.55 0 [] ordinal_yielding($c12).
% 2.33/2.55 0 [] -empty($c13).
% 2.33/2.55 0 [] relation($c13).
% 2.33/2.55 0 [] element($f5(A),powerset(A)).
% 2.33/2.55 0 [] empty($f5(A)).
% 2.33/2.55 0 [] -empty($c14).
% 2.33/2.55 0 [] element($c15,positive_rationals).
% 2.33/2.55 0 [] empty($c15).
% 2.33/2.55 0 [] epsilon_transitive($c15).
% 2.33/2.55 0 [] epsilon_connected($c15).
% 2.33/2.55 0 [] ordinal($c15).
% 2.33/2.55 0 [] natural($c15).
% 2.33/2.55 0 [] empty(A)|element($f6(A),powerset(A)).
% 2.33/2.55 0 [] empty(A)| -empty($f6(A)).
% 2.33/2.55 0 [] empty(A)|finite($f6(A)).
% 2.33/2.55 0 [] relation($c16).
% 2.33/2.55 0 [] function($c16).
% 2.33/2.55 0 [] one_to_one($c16).
% 2.33/2.55 0 [] -empty($c17).
% 2.33/2.55 0 [] epsilon_transitive($c17).
% 2.33/2.55 0 [] epsilon_connected($c17).
% 2.33/2.55 0 [] ordinal($c17).
% 2.33/2.55 0 [] relation($c18).
% 2.33/2.55 0 [] relation_empty_yielding($c18).
% 2.33/2.55 0 [] relation($c19).
% 2.33/2.55 0 [] relation_empty_yielding($c19).
% 2.33/2.55 0 [] function($c19).
% 2.33/2.55 0 [] relation($c20).
% 2.33/2.55 0 [] function($c20).
% 2.33/2.55 0 [] transfinite_se_quence($c20).
% 2.33/2.55 0 [] relation($c21).
% 2.33/2.55 0 [] relation_non_empty($c21).
% 2.33/2.55 0 [] function($c21).
% 2.33/2.55 0 [] subset(A,A).
% 2.33/2.55 0 [] -relation(B)|relation_image(B,A)=relation_image(B,set_intersection2(relation_dom(B),A)).
% 2.33/2.55 0 [] -finite(A)|finite(set_intersection2(A,B)).
% 2.33/2.55 0 [] -relation(A)| -relation(B)|relation_rng(relation_composition(A,B))=relation_image(B,relation_rng(A)).
% 2.33/2.55 0 [] relation($c22).
% 2.33/2.55 0 [] function($c22).
% 2.33/2.55 0 [] finite($c23).
% 2.33/2.55 0 [] -finite(relation_image($c22,$c23)).
% 2.33/2.55 0 [] subset(set_intersection2(A,B),A).
% 2.33/2.55 0 [] -in(A,B)|element(A,B).
% 2.33/2.55 0 [] set_intersection2(A,empty_set)=empty_set.
% 2.33/2.55 0 [] -element(A,B)|empty(B)|in(A,B).
% 2.33/2.55 0 [] -element(A,powerset(B))|subset(A,B).
% 2.33/2.55 0 [] element(A,powerset(B))| -subset(A,B).
% 2.33/2.55 0 [] -relation(A)| -relation(B)| -subset(relation_rng(A),relation_dom(B))|relation_dom(relation_composition(A,B))=relation_dom(A).
% 2.33/2.55 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.33/2.55 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.33/2.55 0 [] -empty(A)|A=empty_set.
% 2.33/2.55 0 [] -in(A,B)| -empty(B).
% 2.33/2.55 0 [] -empty(A)|A=B| -empty(B).
% 2.33/2.55 end_of_list.
% 2.33/2.55
% 2.33/2.55 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 2.33/2.55
% 2.33/2.55 This ia a non-Horn set with equality. The strategy will be
% 2.33/2.55 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.33/2.55 deletion, with positive clauses in sos and nonpositive
% 2.33/2.55 clauses in usable.
% 2.33/2.55
% 2.33/2.55 dependent: set(knuth_bendix).
% 2.33/2.55 dependent: set(anl_eq).
% 2.33/2.55 dependent: set(para_from).
% 2.33/2.55 dependent: set(para_into).
% 2.33/2.55 dependent: clear(para_from_right).
% 2.33/2.55 dependent: clear(para_into_right).
% 2.33/2.55 dependent: set(para_from_vars).
% 2.33/2.55 dependent: set(eq_units_both_ways).
% 2.33/2.55 dependent: set(dynamic_demod_all).
% 2.33/2.55 dependent: set(dynamic_demod).
% 2.33/2.55 dependent: set(order_eq).
% 2.33/2.55 dependent: set(back_demod).
% 2.33/2.55 dependent: set(lrpo).
% 2.33/2.55 dependent: set(hyper_res).
% 2.33/2.55 dependent: set(unit_deletion).
% 2.33/2.55 dependent: set(factor).
% 2.33/2.55
% 2.33/2.55 ------------> process usable:
% 2.33/2.55 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 2.33/2.55 ** KEPT (pick-wt=7): 2 [] -ordinal(A)| -element(B,A)|epsilon_transitive(B).
% 2.33/2.55 ** KEPT (pick-wt=7): 3 [] -ordinal(A)| -element(B,A)|epsilon_connected(B).
% 2.33/2.55 ** KEPT (pick-wt=7): 4 [] -ordinal(A)| -element(B,A)|ordinal(B).
% 2.33/2.55 ** KEPT (pick-wt=4): 5 [] -empty(A)|finite(A).
% 2.33/2.55 ** KEPT (pick-wt=4): 6 [] -empty(A)|function(A).
% 2.33/2.55 ** KEPT (pick-wt=4): 7 [] -ordinal(A)|epsilon_transitive(A).
% 2.33/2.55 ** KEPT (pick-wt=4): 8 [] -ordinal(A)|epsilon_connected(A).
% 2.33/2.55 ** KEPT (pick-wt=4): 9 [] -empty(A)|relation(A).
% 2.33/2.55 Following clause subsumed by 7 during input processing: 0 [] -empty(A)| -ordinal(A)|epsilon_transitive(A).
% 2.33/2.55 Following clause subsumed by 8 during input processing: 0 [] -empty(A)| -ordinal(A)|epsilon_connected(A).
% 2.33/2.55 ** KEPT (pick-wt=6): 10 [] -empty(A)| -ordinal(A)|natural(A).
% 2.33/2.55 ** KEPT (pick-wt=8): 11 [] -finite(A)| -element(B,powerset(A))|finite(B).
% 2.33/2.55 ** KEPT (pick-wt=8): 12 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 2.33/2.55 ** KEPT (pick-wt=6): 13 [] -epsilon_transitive(A)| -epsilon_connected(A)|ordinal(A).
% 2.33/2.55 ** KEPT (pick-wt=5): 14 [] -element(A,omega)|epsilon_transitive(A).
% 2.33/2.55 ** KEPT (pick-wt=5): 15 [] -element(A,omega)|epsilon_connected(A).
% 2.33/2.55 ** KEPT (pick-wt=5): 16 [] -element(A,omega)|ordinal(A).
% 2.33/2.55 ** KEPT (pick-wt=5): 17 [] -element(A,omega)|natural(A).
% 2.33/2.55 ** KEPT (pick-wt=4): 18 [] -empty(A)|epsilon_transitive(A).
% 2.33/2.55 ** KEPT (pick-wt=4): 19 [] -empty(A)|epsilon_connected(A).
% 2.33/2.55 ** KEPT (pick-wt=4): 20 [] -empty(A)|ordinal(A).
% 2.33/2.55 Following clause subsumed by 7 during input processing: 0 [] -element(A,positive_rationals)| -ordinal(A)|epsilon_transitive(A).
% 2.33/2.55 Following clause subsumed by 8 during input processing: 0 [] -element(A,positive_rationals)| -ordinal(A)|epsilon_connected(A).
% 2.33/2.55 ** KEPT (pick-wt=7): 21 [] -element(A,positive_rationals)| -ordinal(A)|natural(A).
% 2.33/2.55 ** KEPT (pick-wt=5): 22 [] -finite(A)|relation($f1(A)).
% 2.33/2.55 ** KEPT (pick-wt=5): 23 [] -finite(A)|function($f1(A)).
% 2.33/2.55 ** KEPT (pick-wt=7): 24 [] -finite(A)|relation_rng($f1(A))=A.
% 2.33/2.55 ** KEPT (pick-wt=7): 25 [] -finite(A)|in(relation_dom($f1(A)),omega).
% 2.33/2.55 ** KEPT (pick-wt=14): 26 [] finite(A)| -relation(B)| -function(B)|relation_rng(B)!=A| -in(relation_dom(B),omega).
% 2.33/2.55 ** KEPT (pick-wt=8): 27 [] -relation(A)| -relation(B)|relation(relation_composition(A,B)).
% 2.33/2.55 ** KEPT (pick-wt=6): 28 [] -finite(A)|finite(set_intersection2(B,A)).
% 2.33/2.55 ** KEPT (pick-wt=8): 29 [] -empty(A)| -relation(B)|empty(relation_composition(B,A)).
% 2.33/2.55 ** KEPT (pick-wt=8): 30 [] -empty(A)| -relation(B)|relation(relation_composition(B,A)).
% 2.33/2.55 ** KEPT (pick-wt=6): 31 [] -finite(A)|finite(set_intersection2(A,B)).
% 2.33/2.55 Following clause subsumed by 27 during input processing: 0 [] -relation(A)| -function(A)| -relation(B)| -function(B)|relation(relation_composition(A,B)).
% 2.33/2.55 ** KEPT (pick-wt=12): 32 [] -relation(A)| -function(A)| -relation(B)| -function(B)|function(relation_composition(A,B)).
% 2.33/2.55 ** KEPT (pick-wt=2): 33 [] -empty(omega).
% 2.33/2.55 ** KEPT (pick-wt=8): 34 [] -relation(A)| -relation(B)|relation(set_intersection2(A,B)).
% 2.33/2.55 ** KEPT (pick-wt=3): 35 [] -empty(powerset(A)).
% 2.33/2.55 ** KEPT (pick-wt=9): 36 [] -relation(A)| -function(A)| -transfinite_se_quence(A)|epsilon_transitive(relation_dom(A)).
% 2.33/2.55 ** KEPT (pick-wt=9): 37 [] -relation(A)| -function(A)| -transfinite_se_quence(A)|epsilon_connected(relation_dom(A)).
% 2.33/2.55 ** KEPT (pick-wt=9): 38 [] -relation(A)| -function(A)| -transfinite_se_quence(A)|ordinal(relation_dom(A)).
% 2.33/2.55 ** KEPT (pick-wt=7): 39 [] empty(A)| -relation(A)| -empty(relation_dom(A)).
% 2.33/2.55 ** KEPT (pick-wt=9): 40 [] -relation(A)| -relation_non_empty(A)| -function(A)|with_non_empty_elements(relation_rng(A)).
% 2.33/2.55 ** KEPT (pick-wt=7): 41 [] empty(A)| -relation(A)| -empty(relation_rng(A)).
% 2.33/2.55 ** KEPT (pick-wt=5): 42 [] -empty(A)|empty(relation_dom(A)).
% 2.33/2.55 ** KEPT (pick-wt=5): 43 [] -empty(A)|relation(relation_dom(A)).
% 2.33/2.55 ** KEPT (pick-wt=2): 44 [] -empty(positive_rationals).
% 2.33/2.55 Following clause subsumed by 27 during input processing: 0 [] -relation(A)| -function(A)| -function_yielding(A)| -relation(B)| -function(B)|relation(relation_composition(B,A)).
% 2.33/2.55 Following clause subsumed by 32 during input processing: 0 [] -relation(A)| -function(A)| -function_yielding(A)| -relation(B)| -function(B)|function(relation_composition(B,A)).
% 2.33/2.55 ** KEPT (pick-wt=14): 45 [] -relation(A)| -function(A)| -function_yielding(A)| -relation(B)| -function(B)|function_yielding(relation_composition(B,A)).
% 2.33/2.55 ** KEPT (pick-wt=5): 46 [] -empty(A)|empty(relation_rng(A)).
% 2.33/2.55 ** KEPT (pick-wt=5): 47 [] -empty(A)|relation(relation_rng(A)).
% 2.33/2.55 ** KEPT (pick-wt=8): 48 [] -empty(A)| -relation(B)|empty(relation_composition(A,B)).
% 2.33/2.55 ** KEPT (pick-wt=8): 49 [] -empty(A)| -relation(B)|relation(relation_composition(A,B)).
% 2.33/2.55 ** KEPT (pick-wt=2): 50 [] -empty($c1).
% 2.33/2.55 ** KEPT (pick-wt=2): 51 [] -empty($c2).
% 2.33/2.55 ** KEPT (pick-wt=5): 52 [] empty(A)| -empty($f3(A)).
% 2.33/2.55 ** KEPT (pick-wt=2): 53 [] -empty($c9).
% 2.33/2.55 ** KEPT (pick-wt=2): 54 [] -empty($c13).
% 2.33/2.55 ** KEPT (pick-wt=2): 55 [] -empty($c14).
% 2.33/2.55 ** KEPT (pick-wt=5): 56 [] empty(A)| -empty($f6(A)).
% 2.33/2.55 ** KEPT (pick-wt=2): 57 [] -empty($c17).
% 2.33/2.55 ** KEPT (pick-wt=12): 59 [copy,58,flip.2] -relation(A)|relation_image(A,set_intersection2(relation_dom(A),B))=relation_image(A,B).
% 2.33/2.55 Following clause subsumed by 31 during input processing: 0 [] -finite(A)|finite(set_intersection2(A,B)).
% 2.33/2.55 ** KEPT (pick-wt=13): 60 [] -relation(A)| -relation(B)|relation_rng(relation_composition(A,B))=relation_image(B,relation_rng(A)).
% 2.33/2.55 ** KEPT (pick-wt=4): 61 [] -finite(relation_image($c22,$c23)).
% 2.33/2.55 ** KEPT (pick-wt=6): 62 [] -in(A,B)|element(A,B).
% 2.33/2.55 ** KEPT (pick-wt=8): 63 [] -element(A,B)|empty(B)|in(A,B).
% 2.33/2.55 ** KEPT (pick-wt=7): 64 [] -element(A,powerset(B))|subset(A,B).
% 2.33/2.55 ** KEPT (pick-wt=7): 65 [] element(A,powerset(B))| -subset(A,B).
% 2.33/2.55 ** KEPT (pick-wt=16): 66 [] -relation(A)| -relation(B)| -subset(relation_rng(A),relation_dom(B))|relation_dom(relation_composition(A,B))=relation_dom(A).
% 2.33/2.55 ** KEPT (pick-wt=10): 67 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.33/2.55 ** KEPT (pick-wt=9): 68 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.33/2.55 ** KEPT (pick-wt=5): 69 [] -empty(A)|A=empty_set.
% 2.33/2.55 ** KEPT (pick-wt=5): 70 [] -in(A,B)| -empty(B).
% 2.33/2.55 ** KEPT (pick-wt=7): 71 [] -empty(A)|A=B| -empty(B).
% 2.33/2.55
% 2.33/2.55 ------------> process sos:
% 2.33/2.55 ** KEPT (pick-wt=3): 80 [] A=A.
% 2.33/2.55 ** KEPT (pick-wt=7): 81 [] set_intersection2(A,B)=set_intersection2(B,A).
% 2.33/2.55 ** KEPT (pick-wt=4): 82 [] element($f2(A),A).
% 2.33/2.55 ** KEPT (pick-wt=2): 83 [] empty(empty_set).
% 2.33/2.55 ** KEPT (pick-wt=2): 84 [] relation(empty_set).
% 2.33/2.55 ** KEPT (pick-wt=2): 85 [] relation_empty_yielding(empty_set).
% 2.33/2.55 ** KEPT (pick-wt=2): 86 [] epsilon_transitive(omega).
% 2.33/2.55 ** KEPT (pick-wt=2): 87 [] epsilon_connected(omega).
% 2.33/2.55 ** KEPT (pick-wt=2): 88 [] ordinal(omega).
% 2.33/2.55 Following clause subsumed by 83 during input processing: 0 [] empty(empty_set).
% 2.33/2.55 Following clause subsumed by 84 during input processing: 0 [] relation(empty_set).
% 2.33/2.55 Following clause subsumed by 85 during input processing: 0 [] relation_empty_yielding(empty_set).
% 2.33/2.55 ** KEPT (pick-wt=2): 89 [] function(empty_set).
% 2.33/2.55 ** KEPT (pick-wt=2): 90 [] one_to_one(empty_set).
% 2.33/2.55 Following clause subsumed by 83 during input processing: 0 [] empty(empty_set).
% 2.33/2.55 ** KEPT (pick-wt=2): 91 [] epsilon_transitive(empty_set).
% 2.33/2.55 ** KEPT (pick-wt=2): 92 [] epsilon_connected(empty_set).
% 2.33/2.55 ** KEPT (pick-wt=2): 93 [] ordinal(empty_set).
% 2.33/2.55 Following clause subsumed by 83 during input processing: 0 [] empty(empty_set).
% 2.33/2.55 Following clause subsumed by 84 during input processing: 0 [] relation(empty_set).
% 2.33/2.55 ** KEPT (pick-wt=5): 94 [] set_intersection2(A,A)=A.
% 2.33/2.55 ---> New Demodulator: 95 [new_demod,94] set_intersection2(A,A)=A.
% 2.33/2.55 ** KEPT (pick-wt=2): 96 [] epsilon_transitive($c1).
% 2.33/2.55 ** KEPT (pick-wt=2): 97 [] epsilon_connected($c1).
% 2.33/2.55 ** KEPT (pick-wt=2): 98 [] ordinal($c1).
% 2.33/2.55 ** KEPT (pick-wt=2): 99 [] natural($c1).
% 2.33/2.55 ** KEPT (pick-wt=2): 100 [] finite($c2).
% 2.33/2.55 ** KEPT (pick-wt=2): 101 [] relation($c3).
% 2.33/2.55 ** KEPT (pick-wt=2): 102 [] function($c3).
% 2.33/2.55 ** KEPT (pick-wt=2): 103 [] function_yielding($c3).
% 2.33/2.55 ** KEPT (pick-wt=2): 104 [] relation($c4).
% 2.33/2.55 ** KEPT (pick-wt=2): 105 [] function($c4).
% 2.33/2.55 ** KEPT (pick-wt=2): 106 [] epsilon_transitive($c5).
% 2.33/2.55 ** KEPT (pick-wt=2): 107 [] epsilon_connected($c5).
% 2.33/2.55 ** KEPT (pick-wt=2): 108 [] ordinal($c5).
% 2.33/2.55 ** KEPT (pick-wt=2): 109 [] epsilon_transitive($c6).
% 2.33/2.55 ** KEPT (pick-wt=2): 110 [] epsilon_connected($c6).
% 2.33/2.55 ** KEPT (pick-wt=2): 111 [] ordinal($c6).
% 2.33/2.55 ** KEPT (pick-wt=2): 112 [] being_limit_ordinal($c6).
% 2.33/2.55 ** KEPT (pick-wt=2): 113 [] empty($c7).
% 2.33/2.55 ** KEPT (pick-wt=2): 114 [] relation($c7).
% 2.33/2.55 ** KEPT (pick-wt=7): 115 [] empty(A)|element($f3(A),powerset(A)).
% 2.33/2.55 ** KEPT (pick-wt=2): 116 [] empty($c8).
% 2.33/2.55 ** KEPT (pick-wt=3): 117 [] element($c9,positive_rationals).
% 2.33/2.55 ** KEPT (pick-wt=2): 118 [] epsilon_transitive($c9).
% 2.33/2.55 ** KEPT (pick-wt=2): 119 [] epsilon_connected($c9).
% 2.33/2.55 ** KEPT (pick-wt=2): 120 [] ordinal($c9).
% 2.33/2.55 ** KEPT (pick-wt=5): 121 [] element($f4(A),powerset(A)).
% 2.33/2.55 ** KEPT (pick-wt=3): 122 [] empty($f4(A)).
% 2.33/2.55 ** KEPT (pick-wt=3): 123 [] relation($f4(A)).
% 2.33/2.55 ** KEPT (pick-wt=3): 124 [] function($f4(A)).
% 2.33/2.55 ** KEPT (pick-wt=3): 125 [] one_to_one($f4(A)).
% 2.33/2.55 ** KEPT (pick-wt=3): 126 [] epsilon_transitive($f4(A)).
% 2.33/2.55 ** KEPT (pick-wt=3): 127 [] epsilon_connected($f4(A)).
% 2.33/2.55 ** KEPT (pick-wt=3): 128 [] ordinal($f4(A)).
% 2.33/2.55 ** KEPT (pick-wt=3): 129 [] natural($f4(A)).
% 2.33/2.55 ** KEPT (pick-wt=3): 130 [] finite($f4(A)).
% 2.33/2.55 ** KEPT (pick-wt=2): 131 [] relation($c10).
% 2.33/2.55 ** KEPT (pick-wt=2): 132 [] empty($c10).
% 2.33/2.55 ** KEPT (pick-wt=2): 133 [] function($c10).
% 2.33/2.55 ** KEPT (pick-wt=2): 134 [] relation($c11).
% 2.33/2.55 ** KEPT (pick-wt=2): 135 [] function($c11).
% 2.33/2.55 ** KEPT (pick-wt=2): 136 [] one_to_one($c11).
% 2.33/2.55 ** KEPT (pick-wt=2): 137 [] empty($c11).
% 2.33/2.55 ** KEPT (pick-wt=2): 138 [] epsilon_transitive($c11).
% 2.33/2.55 ** KEPT (pick-wt=2): 139 [] epsilon_connected($c11).
% 2.33/2.55 ** KEPT (pick-wt=2): 140 [] ordinal($c11).
% 2.33/2.55 ** KEPT (pick-wt=2): 141 [] relation($c12).
% 2.33/2.55 ** KEPT (pick-wt=2): 142 [] function($c12).
% 2.33/2.55 ** KEPT (pick-wt=2): 143 [] transfinite_se_quence($c12).
% 2.33/2.55 ** KEPT (pick-wt=2): 144 [] ordinal_yielding($c12).
% 2.33/2.55 ** KEPT (pick-wt=2): 145 [] relation($c13).
% 2.33/2.55 ** KEPT (pick-wt=5): 146 [] element($f5(A),powerset(A)).
% 2.33/2.55 ** KEPT (pick-wt=3): 147 [] empty($f5(A)).
% 2.33/2.55 ** KEPT (pick-wt=3): 148 [] element($c15,positive_rationals).
% 2.33/2.55 ** KEPT (pick-wt=2): 149 [] empty($c15).
% 2.33/2.55 ** KEPT (pick-wt=2): 150 [] epsilon_transitive($c15).
% 2.33/2.55 ** KEPT (pick-wt=2): 151 [] epsilon_connected($c15).
% 2.33/2.55 ** KEPT (pick-wt=2): 152 [] ordinal($c15).
% 2.33/2.55 ** KEPT (pick-wt=2): 153 [] natural($c15).
% 2.33/2.55 ** KEPT (pick-wt=7): 154 [] empty(A)|element($f6(A),powerset(A)).
% 2.33/2.55 ** KEPT (pick-wt=5): 155 [] empty(A)|finite($f6(A)).
% 2.33/2.55 ** KEPT (pick-wt=2): 156 [] relation($c16).
% 2.33/2.55 ** KEPT (pick-wt=2): 157 [] function($c16).
% 2.33/2.55 ** KEPT (pick-wt=2): 158 [] one_to_one($c16).
% 2.33/2.55 ** KEPT (pick-wt=2): 159 [] epsilon_transitive($c17).
% 2.33/2.55 ** KEPT (pick-wt=2): 160 [] epsilon_connected($c17).
% 2.33/2.55 ** KEPT (pick-wt=2): 161 [] ordinal($c17).
% 2.33/2.55 ** KEPT (pick-wt=2): 162 [] relation($c18).
% 2.33/2.55 ** KEPT (pick-wt=2): 163 [] relation_empty_yielding($c18).
% 2.33/2.55 ** KEPT (pick-wt=2): 164 [] relaAlarm clock
% 299.86/300.04 Otter interrupted
% 299.86/300.04 PROOF NOT FOUND
%------------------------------------------------------------------------------