TSTP Solution File: SEU368+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU368+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n029.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:54 EDT 2022
% Result : Unknown 27.55s 27.76s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SEU368+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.13 % Command : otter-tptp-script %s
% 0.14/0.34 % Computer : n029.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Wed Jul 27 07:58:14 EDT 2022
% 0.14/0.35 % CPUTime :
% 1.95/2.12 ----- Otter 3.3f, August 2004 -----
% 1.95/2.12 The process was started by sandbox2 on n029.cluster.edu,
% 1.95/2.12 Wed Jul 27 07:58:14 2022
% 1.95/2.12 The command was "./otter". The process ID is 31469.
% 1.95/2.12
% 1.95/2.12 set(prolog_style_variables).
% 1.95/2.12 set(auto).
% 1.95/2.12 dependent: set(auto1).
% 1.95/2.12 dependent: set(process_input).
% 1.95/2.12 dependent: clear(print_kept).
% 1.95/2.12 dependent: clear(print_new_demod).
% 1.95/2.12 dependent: clear(print_back_demod).
% 1.95/2.12 dependent: clear(print_back_sub).
% 1.95/2.12 dependent: set(control_memory).
% 1.95/2.12 dependent: assign(max_mem, 12000).
% 1.95/2.12 dependent: assign(pick_given_ratio, 4).
% 1.95/2.12 dependent: assign(stats_level, 1).
% 1.95/2.12 dependent: assign(max_seconds, 10800).
% 1.95/2.12 clear(print_given).
% 1.95/2.12
% 1.95/2.12 formula_list(usable).
% 1.95/2.12 all A (A=A).
% 1.95/2.12 all A B (in(A,B)-> -in(B,A)).
% 1.95/2.12 $T.
% 1.95/2.12 exists A (one_sorted_str(A)& -empty_carrier(A)).
% 1.95/2.12 all A (-empty_carrier(A)&one_sorted_str(A)-> -empty(the_carrier(A))).
% 1.95/2.12 all A (-empty_carrier(A)&one_sorted_str(A)-> (exists B (element(B,powerset(the_carrier(A)))& -empty(B)))).
% 1.95/2.12 exists A (rel_str(A)& -empty_carrier(A)&strict_rel_str(A)&reflexive_relstr(A)&transitive_relstr(A)&antisymmetric_relstr(A)).
% 1.95/2.12 empty(empty_set).
% 1.95/2.12 all A B (in(A,B)->element(A,B)).
% 1.95/2.12 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 1.95/2.12 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 1.95/2.12 all A B subset(A,A).
% 1.95/2.12 all A (-empty(A)-> -empty_carrier(incl_POSet(A))&strict_rel_str(incl_POSet(A))&reflexive_relstr(incl_POSet(A))&transitive_relstr(incl_POSet(A))&antisymmetric_relstr(incl_POSet(A))).
% 1.95/2.12 all A B (-empty(A)&relation_of2(B,A,A)-> -empty_carrier(rel_str_of(A,B))&strict_rel_str(rel_str_of(A,B))).
% 1.95/2.12 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)))).
% 1.95/2.12 all A B (-empty(A)& -empty(B)-> -empty(cartesian_product2(A,B))).
% 1.95/2.12 all A exists B (element(B,powerset(A))&empty(B)).
% 1.95/2.12 exists A empty(A).
% 1.95/2.12 exists A (-empty(A)).
% 1.95/2.12 all A B (element(A,B)->empty(B)|in(A,B)).
% 1.95/2.12 all A (empty(A)->A=empty_set).
% 1.95/2.12 all A B (-(in(A,B)&empty(B))).
% 1.95/2.12 all A B (-(empty(A)&A!=B&empty(B))).
% 1.95/2.12 all A B exists C relation_of2(C,A,B).
% 1.95/2.12 all A exists B element(B,A).
% 1.95/2.12 $T.
% 1.95/2.12 $T.
% 1.95/2.12 $T.
% 1.95/2.12 $T.
% 1.95/2.12 all A B (reflexive(B)&antisymmetric(B)&transitive(B)&v1_partfun1(B,A,A)&relation_of2(B,A,A)->strict_rel_str(rel_str_of(A,B))&reflexive_relstr(rel_str_of(A,B))&transitive_relstr(rel_str_of(A,B))&antisymmetric_relstr(rel_str_of(A,B))).
% 1.95/2.12 all A B C (element(C,powerset(cartesian_product2(A,B)))->relation(C)).
% 1.95/2.12 all A (-empty(powerset(A))).
% 1.95/2.12 all A B (element(A,powerset(B))<->subset(A,B)).
% 1.95/2.12 all A B (relation_of2(B,A,A)-> (all C D (rel_str_of(A,B)=rel_str_of(C,D)->A=C&B=D))).
% 1.95/2.12 all A (rel_str(A)-> (strict_rel_str(A)->A=rel_str_of(the_carrier(A),the_InternalRel(A)))).
% 1.95/2.12 exists A rel_str(A).
% 1.95/2.12 exists A one_sorted_str(A).
% 1.95/2.12 all A B exists C relation_of2_as_subset(C,A,B).
% 1.95/2.12 all A B C (relation_of2_as_subset(C,A,B)<->relation_of2(C,A,B)).
% 1.95/2.12 all A B (relation_of2(B,A,A)->strict_rel_str(rel_str_of(A,B))&rel_str(rel_str_of(A,B))).
% 1.95/2.12 all A relation(inclusion_relation(A)).
% 1.95/2.12 all A (rel_str(A)->one_sorted_str(A)).
% 1.95/2.12 $T.
% 1.95/2.12 all A B C (relation_of2_as_subset(C,A,B)->element(C,powerset(cartesian_product2(A,B)))).
% 1.95/2.12 exists A (rel_str(A)&strict_rel_str(A)).
% 1.95/2.12 all A (reflexive_relstr(A)&transitive_relstr(A)&antisymmetric_relstr(A)&rel_str(A)->relation(the_InternalRel(A))&reflexive(the_InternalRel(A))&antisymmetric(the_InternalRel(A))&transitive(the_InternalRel(A))&v1_partfun1(the_InternalRel(A),the_carrier(A),the_carrier(A))).
% 1.95/2.12 all A (inclusion_order(A)=inclusion_relation(A)).
% 1.95/2.12 all A (reflexive(inclusion_order(A))&antisymmetric(inclusion_order(A))&transitive(inclusion_order(A))&v1_partfun1(inclusion_order(A),A,A)&relation_of2_as_subset(inclusion_order(A),A,A)).
% 1.95/2.12 all A (strict_rel_str(incl_POSet(A))&rel_str(incl_POSet(A))).
% 1.95/2.12 all A (rel_str(A)->relation_of2_as_subset(the_InternalRel(A),the_carrier(A),the_carrier(A))).
% 1.95/2.12 $T.
% 1.95/2.12 all A (strict_rel_str(incl_POSet(A))&reflexive_relstr(incl_POSet(A))&transitive_relstr(incl_POSet(A))&antisymmetric_relstr(incl_POSet(A))).
% 1.95/2.12 all A (incl_POSet(A)=rel_str_of(A,inclusion_order(A))).
% 1.95/2.12 -(all A (the_carrier(incl_POSet(A))=A&the_InternalRel(incl_POSet(A))=inclusion_order(A))).
% 1.95/2.12 end_of_list.
% 1.95/2.12
% 1.95/2.12 -------> usable clausifies to:
% 1.95/2.12
% 1.95/2.12 list(usable).
% 1.95/2.12 0 [] A=A.
% 1.95/2.12 0 [] -in(A,B)| -in(B,A).
% 1.95/2.12 0 [] $T.
% 1.95/2.12 0 [] one_sorted_str($c1).
% 1.95/2.12 0 [] -empty_carrier($c1).
% 1.95/2.13 0 [] empty_carrier(A)| -one_sorted_str(A)| -empty(the_carrier(A)).
% 1.95/2.13 0 [] empty_carrier(A)| -one_sorted_str(A)|element($f1(A),powerset(the_carrier(A))).
% 1.95/2.13 0 [] empty_carrier(A)| -one_sorted_str(A)| -empty($f1(A)).
% 1.95/2.13 0 [] rel_str($c2).
% 1.95/2.13 0 [] -empty_carrier($c2).
% 1.95/2.13 0 [] strict_rel_str($c2).
% 1.95/2.13 0 [] reflexive_relstr($c2).
% 1.95/2.13 0 [] transitive_relstr($c2).
% 1.95/2.13 0 [] antisymmetric_relstr($c2).
% 1.95/2.13 0 [] empty(empty_set).
% 1.95/2.13 0 [] -in(A,B)|element(A,B).
% 1.95/2.13 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.95/2.13 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.95/2.13 0 [] subset(A,A).
% 1.95/2.13 0 [] empty(A)| -empty_carrier(incl_POSet(A)).
% 1.95/2.13 0 [] empty(A)|strict_rel_str(incl_POSet(A)).
% 1.95/2.13 0 [] empty(A)|reflexive_relstr(incl_POSet(A)).
% 1.95/2.13 0 [] empty(A)|transitive_relstr(incl_POSet(A)).
% 1.95/2.13 0 [] empty(A)|antisymmetric_relstr(incl_POSet(A)).
% 1.95/2.13 0 [] empty(A)| -relation_of2(B,A,A)| -empty_carrier(rel_str_of(A,B)).
% 1.95/2.13 0 [] empty(A)| -relation_of2(B,A,A)|strict_rel_str(rel_str_of(A,B)).
% 1.95/2.13 0 [] empty(A)|element($f2(A),powerset(A)).
% 1.95/2.13 0 [] empty(A)| -empty($f2(A)).
% 1.95/2.13 0 [] empty(A)|empty(B)| -empty(cartesian_product2(A,B)).
% 1.95/2.13 0 [] element($f3(A),powerset(A)).
% 1.95/2.13 0 [] empty($f3(A)).
% 1.95/2.13 0 [] empty($c3).
% 1.95/2.13 0 [] -empty($c4).
% 1.95/2.13 0 [] -element(A,B)|empty(B)|in(A,B).
% 1.95/2.13 0 [] -empty(A)|A=empty_set.
% 1.95/2.13 0 [] -in(A,B)| -empty(B).
% 1.95/2.13 0 [] -empty(A)|A=B| -empty(B).
% 1.95/2.13 0 [] relation_of2($f4(A,B),A,B).
% 1.95/2.13 0 [] element($f5(A),A).
% 1.95/2.13 0 [] $T.
% 1.95/2.13 0 [] $T.
% 1.95/2.13 0 [] $T.
% 1.95/2.13 0 [] $T.
% 1.95/2.13 0 [] -reflexive(B)| -antisymmetric(B)| -transitive(B)| -v1_partfun1(B,A,A)| -relation_of2(B,A,A)|strict_rel_str(rel_str_of(A,B)).
% 1.95/2.13 0 [] -reflexive(B)| -antisymmetric(B)| -transitive(B)| -v1_partfun1(B,A,A)| -relation_of2(B,A,A)|reflexive_relstr(rel_str_of(A,B)).
% 1.95/2.13 0 [] -reflexive(B)| -antisymmetric(B)| -transitive(B)| -v1_partfun1(B,A,A)| -relation_of2(B,A,A)|transitive_relstr(rel_str_of(A,B)).
% 1.95/2.13 0 [] -reflexive(B)| -antisymmetric(B)| -transitive(B)| -v1_partfun1(B,A,A)| -relation_of2(B,A,A)|antisymmetric_relstr(rel_str_of(A,B)).
% 1.95/2.13 0 [] -element(C,powerset(cartesian_product2(A,B)))|relation(C).
% 1.95/2.13 0 [] -empty(powerset(A)).
% 1.95/2.13 0 [] -element(A,powerset(B))|subset(A,B).
% 1.95/2.13 0 [] element(A,powerset(B))| -subset(A,B).
% 1.95/2.13 0 [] -relation_of2(B,A,A)|rel_str_of(A,B)!=rel_str_of(C,D)|A=C.
% 1.95/2.13 0 [] -relation_of2(B,A,A)|rel_str_of(A,B)!=rel_str_of(C,D)|B=D.
% 1.95/2.13 0 [] -rel_str(A)| -strict_rel_str(A)|A=rel_str_of(the_carrier(A),the_InternalRel(A)).
% 1.95/2.13 0 [] rel_str($c5).
% 1.95/2.13 0 [] one_sorted_str($c6).
% 1.95/2.13 0 [] relation_of2_as_subset($f6(A,B),A,B).
% 1.95/2.13 0 [] -relation_of2_as_subset(C,A,B)|relation_of2(C,A,B).
% 1.95/2.13 0 [] relation_of2_as_subset(C,A,B)| -relation_of2(C,A,B).
% 1.95/2.13 0 [] -relation_of2(B,A,A)|strict_rel_str(rel_str_of(A,B)).
% 1.95/2.13 0 [] -relation_of2(B,A,A)|rel_str(rel_str_of(A,B)).
% 1.95/2.13 0 [] relation(inclusion_relation(A)).
% 1.95/2.13 0 [] -rel_str(A)|one_sorted_str(A).
% 1.95/2.13 0 [] $T.
% 1.95/2.13 0 [] -relation_of2_as_subset(C,A,B)|element(C,powerset(cartesian_product2(A,B))).
% 1.95/2.13 0 [] rel_str($c7).
% 1.95/2.13 0 [] strict_rel_str($c7).
% 1.95/2.13 0 [] -reflexive_relstr(A)| -transitive_relstr(A)| -antisymmetric_relstr(A)| -rel_str(A)|relation(the_InternalRel(A)).
% 1.95/2.13 0 [] -reflexive_relstr(A)| -transitive_relstr(A)| -antisymmetric_relstr(A)| -rel_str(A)|reflexive(the_InternalRel(A)).
% 1.95/2.13 0 [] -reflexive_relstr(A)| -transitive_relstr(A)| -antisymmetric_relstr(A)| -rel_str(A)|antisymmetric(the_InternalRel(A)).
% 1.95/2.13 0 [] -reflexive_relstr(A)| -transitive_relstr(A)| -antisymmetric_relstr(A)| -rel_str(A)|transitive(the_InternalRel(A)).
% 1.95/2.13 0 [] -reflexive_relstr(A)| -transitive_relstr(A)| -antisymmetric_relstr(A)| -rel_str(A)|v1_partfun1(the_InternalRel(A),the_carrier(A),the_carrier(A)).
% 1.95/2.13 0 [] inclusion_order(A)=inclusion_relation(A).
% 1.95/2.13 0 [] reflexive(inclusion_order(A)).
% 1.95/2.13 0 [] antisymmetric(inclusion_order(A)).
% 1.95/2.13 0 [] transitive(inclusion_order(A)).
% 1.95/2.13 0 [] v1_partfun1(inclusion_order(A),A,A).
% 1.95/2.13 0 [] relation_of2_as_subset(inclusion_order(A),A,A).
% 1.95/2.13 0 [] strict_rel_str(incl_POSet(A)).
% 1.95/2.13 0 [] rel_str(incl_POSet(A)).
% 1.95/2.13 0 [] -rel_str(A)|relation_of2_as_subset(the_InternalRel(A),the_carrier(A),the_carrier(A)).
% 1.95/2.13 0 [] $T.
% 1.95/2.13 0 [] strict_rel_str(incl_POSet(A)).
% 1.95/2.13 0 [] reflexive_relstr(incl_POSet(A)).
% 1.95/2.13 0 [] transitive_relstr(incl_POSet(A)).
% 1.95/2.13 0 [] antisymmetric_relstr(incl_POSet(A)).
% 1.95/2.13 0 [] incl_POSet(A)=rel_str_of(A,inclusion_order(A)).
% 1.95/2.13 0 [] the_carrier(incl_POSet($c8))!=$c8|the_InternalRel(incl_POSet($c8))!=inclusion_order($c8).
% 1.95/2.13 end_of_list.
% 1.95/2.13
% 1.95/2.13 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 1.95/2.13
% 1.95/2.13 This ia a non-Horn set with equality. The strategy will be
% 1.95/2.13 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.95/2.13 deletion, with positive clauses in sos and nonpositive
% 1.95/2.13 clauses in usable.
% 1.95/2.13
% 1.95/2.13 dependent: set(knuth_bendix).
% 1.95/2.13 dependent: set(anl_eq).
% 1.95/2.13 dependent: set(para_from).
% 1.95/2.13 dependent: set(para_into).
% 1.95/2.13 dependent: clear(para_from_right).
% 1.95/2.13 dependent: clear(para_into_right).
% 1.95/2.13 dependent: set(para_from_vars).
% 1.95/2.13 dependent: set(eq_units_both_ways).
% 1.95/2.13 dependent: set(dynamic_demod_all).
% 1.95/2.13 dependent: set(dynamic_demod).
% 1.95/2.13 dependent: set(order_eq).
% 1.95/2.13 dependent: set(back_demod).
% 1.95/2.13 dependent: set(lrpo).
% 1.95/2.13 dependent: set(hyper_res).
% 1.95/2.13 dependent: set(unit_deletion).
% 1.95/2.13 dependent: set(factor).
% 1.95/2.13
% 1.95/2.13 ------------> process usable:
% 1.95/2.13 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.95/2.13 ** KEPT (pick-wt=2): 2 [] -empty_carrier($c1).
% 1.95/2.13 ** KEPT (pick-wt=7): 3 [] empty_carrier(A)| -one_sorted_str(A)| -empty(the_carrier(A)).
% 1.95/2.13 ** KEPT (pick-wt=10): 4 [] empty_carrier(A)| -one_sorted_str(A)|element($f1(A),powerset(the_carrier(A))).
% 1.95/2.13 ** KEPT (pick-wt=7): 5 [] empty_carrier(A)| -one_sorted_str(A)| -empty($f1(A)).
% 1.95/2.13 ** KEPT (pick-wt=2): 6 [] -empty_carrier($c2).
% 1.95/2.13 ** KEPT (pick-wt=6): 7 [] -in(A,B)|element(A,B).
% 1.95/2.13 ** KEPT (pick-wt=10): 8 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.95/2.13 ** KEPT (pick-wt=9): 9 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.95/2.13 ** KEPT (pick-wt=5): 10 [] empty(A)| -empty_carrier(incl_POSet(A)).
% 1.95/2.13 ** KEPT (pick-wt=10): 11 [] empty(A)| -relation_of2(B,A,A)| -empty_carrier(rel_str_of(A,B)).
% 1.95/2.13 ** KEPT (pick-wt=10): 12 [] empty(A)| -relation_of2(B,A,A)|strict_rel_str(rel_str_of(A,B)).
% 1.95/2.13 ** KEPT (pick-wt=5): 13 [] empty(A)| -empty($f2(A)).
% 1.95/2.13 ** KEPT (pick-wt=8): 14 [] empty(A)|empty(B)| -empty(cartesian_product2(A,B)).
% 1.95/2.13 ** KEPT (pick-wt=2): 15 [] -empty($c4).
% 1.95/2.13 ** KEPT (pick-wt=8): 16 [] -element(A,B)|empty(B)|in(A,B).
% 1.95/2.13 ** KEPT (pick-wt=5): 17 [] -empty(A)|A=empty_set.
% 1.95/2.13 ** KEPT (pick-wt=5): 18 [] -in(A,B)| -empty(B).
% 1.95/2.13 ** KEPT (pick-wt=7): 19 [] -empty(A)|A=B| -empty(B).
% 1.95/2.13 ** KEPT (pick-wt=18): 20 [] -reflexive(A)| -antisymmetric(A)| -transitive(A)| -v1_partfun1(A,B,B)| -relation_of2(A,B,B)|strict_rel_str(rel_str_of(B,A)).
% 1.95/2.13 ** KEPT (pick-wt=18): 21 [] -reflexive(A)| -antisymmetric(A)| -transitive(A)| -v1_partfun1(A,B,B)| -relation_of2(A,B,B)|reflexive_relstr(rel_str_of(B,A)).
% 1.95/2.13 ** KEPT (pick-wt=18): 22 [] -reflexive(A)| -antisymmetric(A)| -transitive(A)| -v1_partfun1(A,B,B)| -relation_of2(A,B,B)|transitive_relstr(rel_str_of(B,A)).
% 1.95/2.13 ** KEPT (pick-wt=18): 23 [] -reflexive(A)| -antisymmetric(A)| -transitive(A)| -v1_partfun1(A,B,B)| -relation_of2(A,B,B)|antisymmetric_relstr(rel_str_of(B,A)).
% 1.95/2.13 ** KEPT (pick-wt=8): 24 [] -element(A,powerset(cartesian_product2(B,C)))|relation(A).
% 1.95/2.13 ** KEPT (pick-wt=3): 25 [] -empty(powerset(A)).
% 1.95/2.13 ** KEPT (pick-wt=7): 26 [] -element(A,powerset(B))|subset(A,B).
% 1.95/2.13 ** KEPT (pick-wt=7): 27 [] element(A,powerset(B))| -subset(A,B).
% 1.95/2.13 ** KEPT (pick-wt=14): 28 [] -relation_of2(A,B,B)|rel_str_of(B,A)!=rel_str_of(C,D)|B=C.
% 1.95/2.13 ** KEPT (pick-wt=14): 29 [] -relation_of2(A,B,B)|rel_str_of(B,A)!=rel_str_of(C,D)|A=D.
% 1.95/2.13 ** KEPT (pick-wt=11): 31 [copy,30,flip.3] -rel_str(A)| -strict_rel_str(A)|rel_str_of(the_carrier(A),the_InternalRel(A))=A.
% 1.95/2.13 ** KEPT (pick-wt=8): 32 [] -relation_of2_as_subset(A,B,C)|relation_of2(A,B,C).
% 1.95/2.13 ** KEPT (pick-wt=8): 33 [] relation_of2_as_subset(A,B,C)| -relation_of2(A,B,C).
% 1.95/2.13 ** KEPT (pick-wt=8): 34 [] -relation_of2(A,B,B)|strict_rel_str(rel_str_of(B,A)).
% 1.95/2.13 ** KEPT (pick-wt=8): 35 [] -relation_of2(A,B,B)|rel_str(rel_str_of(B,A)).
% 1.95/2.13 ** KEPT (pick-wt=4): 36 [] -rel_str(A)|one_sorted_str(A).
% 1.95/2.13 ** KEPT (pick-wt=10): 37 [] -relation_of2_as_subset(A,B,C)|element(A,powerset(cartesian_product2(B,C))).
% 1.95/2.13 ** KEPT (pick-wt=11): 38 [] -reflexive_relstr(A)| -transitive_relstr(A)| -antisymmetric_relstr(A)| -rel_str(A)|relation(the_InternalRel(A)).
% 1.95/2.13 ** KEPT (pick-wt=11): 39 [] -reflexive_relstr(A)| -transitive_relstr(A)| -antisymmetric_relstr(A)| -rel_str(A)|reflexive(the_InternalRel(A)).
% 1.95/2.13 ** KEPT (pick-wt=11): 40 [] -reflexive_relstr(A)| -transitive_relstr(A)| -antisymmetric_relstr(A)| -rel_str(A)|antisymmetric(the_InternalRel(A)).
% 27.55/27.75 ** KEPT (pick-wt=11): 41 [] -reflexive_relstr(A)| -transitive_relstr(A)| -antisymmetric_relstr(A)| -rel_str(A)|transitive(the_InternalRel(A)).
% 27.55/27.75 ** KEPT (pick-wt=15): 42 [] -reflexive_relstr(A)| -transitive_relstr(A)| -antisymmetric_relstr(A)| -rel_str(A)|v1_partfun1(the_InternalRel(A),the_carrier(A),the_carrier(A)).
% 27.55/27.75 ** KEPT (pick-wt=9): 43 [] -rel_str(A)|relation_of2_as_subset(the_InternalRel(A),the_carrier(A),the_carrier(A)).
% 27.55/27.75 ** KEPT (pick-wt=11): 44 [] the_carrier(incl_POSet($c8))!=$c8|the_InternalRel(incl_POSet($c8))!=inclusion_order($c8).
% 27.55/27.75 34 back subsumes 20.
% 27.55/27.75 34 back subsumes 12.
% 27.55/27.75
% 27.55/27.75 ------------> process sos:
% 27.55/27.75 ** KEPT (pick-wt=3): 48 [] A=A.
% 27.55/27.75 ** KEPT (pick-wt=2): 49 [] one_sorted_str($c1).
% 27.55/27.75 ** KEPT (pick-wt=2): 50 [] rel_str($c2).
% 27.55/27.75 ** KEPT (pick-wt=2): 51 [] strict_rel_str($c2).
% 27.55/27.75 ** KEPT (pick-wt=2): 52 [] reflexive_relstr($c2).
% 27.55/27.75 ** KEPT (pick-wt=2): 53 [] transitive_relstr($c2).
% 27.55/27.75 ** KEPT (pick-wt=2): 54 [] antisymmetric_relstr($c2).
% 27.55/27.75 ** KEPT (pick-wt=2): 55 [] empty(empty_set).
% 27.55/27.75 ** KEPT (pick-wt=3): 56 [] subset(A,A).
% 27.55/27.75 ** KEPT (pick-wt=5): 57 [] empty(A)|strict_rel_str(incl_POSet(A)).
% 27.55/27.75 ** KEPT (pick-wt=5): 58 [] empty(A)|reflexive_relstr(incl_POSet(A)).
% 27.55/27.75 ** KEPT (pick-wt=5): 59 [] empty(A)|transitive_relstr(incl_POSet(A)).
% 27.55/27.75 ** KEPT (pick-wt=5): 60 [] empty(A)|antisymmetric_relstr(incl_POSet(A)).
% 27.55/27.75 ** KEPT (pick-wt=7): 61 [] empty(A)|element($f2(A),powerset(A)).
% 27.55/27.75 ** KEPT (pick-wt=5): 62 [] element($f3(A),powerset(A)).
% 27.55/27.75 ** KEPT (pick-wt=3): 63 [] empty($f3(A)).
% 27.55/27.75 ** KEPT (pick-wt=2): 64 [] empty($c3).
% 27.55/27.75 ** KEPT (pick-wt=6): 65 [] relation_of2($f4(A,B),A,B).
% 27.55/27.75 ** KEPT (pick-wt=4): 66 [] element($f5(A),A).
% 27.55/27.75 ** KEPT (pick-wt=2): 67 [] rel_str($c5).
% 27.55/27.75 ** KEPT (pick-wt=2): 68 [] one_sorted_str($c6).
% 27.55/27.75 ** KEPT (pick-wt=6): 69 [] relation_of2_as_subset($f6(A,B),A,B).
% 27.55/27.75 ** KEPT (pick-wt=3): 70 [] relation(inclusion_relation(A)).
% 27.55/27.75 ** KEPT (pick-wt=2): 71 [] rel_str($c7).
% 27.55/27.75 ** KEPT (pick-wt=2): 72 [] strict_rel_str($c7).
% 27.55/27.75 ** KEPT (pick-wt=5): 74 [copy,73,flip.1] inclusion_relation(A)=inclusion_order(A).
% 27.55/27.75 ---> New Demodulator: 75 [new_demod,74] inclusion_relation(A)=inclusion_order(A).
% 27.55/27.75 ** KEPT (pick-wt=3): 76 [] reflexive(inclusion_order(A)).
% 27.55/27.75 ** KEPT (pick-wt=3): 77 [] antisymmetric(inclusion_order(A)).
% 27.55/27.75 ** KEPT (pick-wt=3): 78 [] transitive(inclusion_order(A)).
% 27.55/27.75 ** KEPT (pick-wt=5): 79 [] v1_partfun1(inclusion_order(A),A,A).
% 27.55/27.75 ** KEPT (pick-wt=5): 80 [] relation_of2_as_subset(inclusion_order(A),A,A).
% 27.55/27.75 ** KEPT (pick-wt=3): 81 [] strict_rel_str(incl_POSet(A)).
% 27.55/27.75 ** KEPT (pick-wt=3): 82 [] rel_str(incl_POSet(A)).
% 27.55/27.75 Following clause subsumed by 81 during input processing: 0 [] strict_rel_str(incl_POSet(A)).
% 27.55/27.75 ** KEPT (pick-wt=3): 83 [] reflexive_relstr(incl_POSet(A)).
% 27.55/27.75 ** KEPT (pick-wt=3): 84 [] transitive_relstr(incl_POSet(A)).
% 27.55/27.75 ** KEPT (pick-wt=3): 85 [] antisymmetric_relstr(incl_POSet(A)).
% 27.55/27.75 ** KEPT (pick-wt=7): 87 [copy,86,flip.1] rel_str_of(A,inclusion_order(A))=incl_POSet(A).
% 27.55/27.75 ---> New Demodulator: 88 [new_demod,87] rel_str_of(A,inclusion_order(A))=incl_POSet(A).
% 27.55/27.75 Following clause subsumed by 48 during input processing: 0 [copy,48,flip.1] A=A.
% 27.55/27.75 48 back subsumes 47.
% 27.55/27.75 >>>> Starting back demodulation with 75.
% 27.55/27.75 >> back demodulating 70 with 75.
% 27.55/27.75 81 back subsumes 57.
% 27.55/27.75 83 back subsumes 58.
% 27.55/27.75 84 back subsumes 59.
% 27.55/27.75 85 back subsumes 60.
% 27.55/27.75 >>>> Starting back demodulation with 88.
% 27.55/27.75
% 27.55/27.75 ======= end of input processing =======
% 27.55/27.75
% 27.55/27.75 =========== start of search ===========
% 27.55/27.75
% 27.55/27.75
% 27.55/27.75 Resetting weight limit to 7.
% 27.55/27.75
% 27.55/27.75
% 27.55/27.75 Resetting weight limit to 7.
% 27.55/27.75
% 27.55/27.75 sos_size=1116
% 27.55/27.75
% 27.55/27.75 Search stopped because sos empty.
% 27.55/27.75
% 27.55/27.75
% 27.55/27.75 Search stopped because sos empty.
% 27.55/27.75
% 27.55/27.75 ============ end of search ============
% 27.55/27.75
% 27.55/27.75 -------------- statistics -------------
% 27.55/27.75 clauses given 1348
% 27.55/27.75 clauses generated 1613944
% 27.55/27.75 clauses kept 1428
% 27.55/27.75 clauses forward subsumed 3463
% 27.55/27.75 clauses back subsumed 32
% 27.55/27.75 Kbytes malloced 6835
% 27.55/27.75
% 27.55/27.75 ----------- times (seconds) -----------
% 27.55/27.75 user CPU time 25.62 (0 hr, 0 min, 25 sec)
% 27.55/27.75 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 27.55/27.75 wall-clock time 28 (0 hr, 0 min, 28 sec)
% 27.55/27.75
% 27.55/27.75 Process 31469 finished Wed Jul 27 07:58:42 2022
% 27.55/27.75 Otter interrupted
% 27.55/27.75 PROOF NOT FOUND
%------------------------------------------------------------------------------