TSTP Solution File: SEU362+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU362+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n025.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:52 EDT 2022
% Result : Timeout 299.80s 300.01s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : SEU362+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.11 % Command : otter-tptp-script %s
% 0.10/0.32 % Computer : n025.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Wed Jul 27 07:41:45 EDT 2022
% 0.10/0.32 % CPUTime :
% 1.98/2.17 ----- Otter 3.3f, August 2004 -----
% 1.98/2.17 The process was started by sandbox on n025.cluster.edu,
% 1.98/2.17 Wed Jul 27 07:41:45 2022
% 1.98/2.17 The command was "./otter". The process ID is 28926.
% 1.98/2.17
% 1.98/2.17 set(prolog_style_variables).
% 1.98/2.17 set(auto).
% 1.98/2.17 dependent: set(auto1).
% 1.98/2.17 dependent: set(process_input).
% 1.98/2.17 dependent: clear(print_kept).
% 1.98/2.17 dependent: clear(print_new_demod).
% 1.98/2.17 dependent: clear(print_back_demod).
% 1.98/2.17 dependent: clear(print_back_sub).
% 1.98/2.17 dependent: set(control_memory).
% 1.98/2.17 dependent: assign(max_mem, 12000).
% 1.98/2.17 dependent: assign(pick_given_ratio, 4).
% 1.98/2.17 dependent: assign(stats_level, 1).
% 1.98/2.17 dependent: assign(max_seconds, 10800).
% 1.98/2.17 clear(print_given).
% 1.98/2.17
% 1.98/2.17 formula_list(usable).
% 1.98/2.17 all A (A=A).
% 1.98/2.17 all A B (in(A,B)-> -in(B,A)).
% 1.98/2.17 all A (empty(A)->finite(A)).
% 1.98/2.17 all A B C (element(C,powerset(cartesian_product2(A,B)))->relation(C)).
% 1.98/2.17 all A (finite(A)-> (all B (element(B,powerset(A))->finite(B)))).
% 1.98/2.17 all A (rel_str(A)-> (all B (rel_str(B)-> (subrelstr(B,A)<->subset(the_carrier(B),the_carrier(A))&subset(the_InternalRel(B),the_InternalRel(A)))))).
% 1.98/2.17 all A (rel_str(A)-> (all B (element(B,the_carrier(A))-> (all C (element(C,the_carrier(A))-> (related(A,B,C)<->in(ordered_pair(B,C),the_InternalRel(A)))))))).
% 1.98/2.18 $T.
% 1.98/2.18 $T.
% 1.98/2.18 $T.
% 1.98/2.18 $T.
% 1.98/2.18 all A (rel_str(A)->one_sorted_str(A)).
% 1.98/2.18 $T.
% 1.98/2.18 $T.
% 1.98/2.18 $T.
% 1.98/2.18 all A (rel_str(A)-> (all B (subrelstr(B,A)->rel_str(B)))).
% 1.98/2.18 all A B C (relation_of2_as_subset(C,A,B)->element(C,powerset(cartesian_product2(A,B)))).
% 1.98/2.18 all A (rel_str(A)->relation_of2_as_subset(the_InternalRel(A),the_carrier(A),the_carrier(A))).
% 1.98/2.18 $T.
% 1.98/2.18 exists A rel_str(A).
% 1.98/2.18 exists A one_sorted_str(A).
% 1.98/2.18 all A B exists C relation_of2(C,A,B).
% 1.98/2.18 all A exists B element(B,A).
% 1.98/2.18 all A (rel_str(A)-> (exists B subrelstr(B,A))).
% 1.98/2.18 all A B exists C relation_of2_as_subset(C,A,B).
% 1.98/2.18 all A B (finite(A)&finite(B)->finite(cartesian_product2(A,B))).
% 1.98/2.18 empty(empty_set).
% 1.98/2.18 exists A (-empty(A)&finite(A)).
% 1.98/2.18 exists A empty(A).
% 1.98/2.18 exists A (-empty(A)).
% 1.98/2.18 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)&finite(B)))).
% 1.98/2.18 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)&finite(B)))).
% 1.98/2.18 all A B C (relation_of2_as_subset(C,A,B)<->relation_of2(C,A,B)).
% 1.98/2.18 all A B subset(A,A).
% 1.98/2.18 all A B (in(A,B)->element(A,B)).
% 1.98/2.18 all A B (element(A,B)->empty(B)|in(A,B)).
% 1.98/2.18 all A B (element(A,powerset(B))<->subset(A,B)).
% 1.98/2.18 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 1.98/2.18 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 1.98/2.18 -(all A (rel_str(A)-> (all B (subrelstr(B,A)-> (all C (element(C,the_carrier(A))-> (all D (element(D,the_carrier(A))-> (all E (element(E,the_carrier(B))-> (all F (element(F,the_carrier(B))-> (E=C&F=D&related(B,E,F)->related(A,C,D)))))))))))))).
% 1.98/2.18 all A (empty(A)->A=empty_set).
% 1.98/2.18 all A B (-(in(A,B)&empty(B))).
% 1.98/2.18 all A B (-(empty(A)&A!=B&empty(B))).
% 1.98/2.18 end_of_list.
% 1.98/2.18
% 1.98/2.18 -------> usable clausifies to:
% 1.98/2.18
% 1.98/2.18 list(usable).
% 1.98/2.18 0 [] A=A.
% 1.98/2.18 0 [] -in(A,B)| -in(B,A).
% 1.98/2.18 0 [] -empty(A)|finite(A).
% 1.98/2.18 0 [] -element(C,powerset(cartesian_product2(A,B)))|relation(C).
% 1.98/2.18 0 [] -finite(A)| -element(B,powerset(A))|finite(B).
% 1.98/2.18 0 [] -rel_str(A)| -rel_str(B)| -subrelstr(B,A)|subset(the_carrier(B),the_carrier(A)).
% 1.98/2.18 0 [] -rel_str(A)| -rel_str(B)| -subrelstr(B,A)|subset(the_InternalRel(B),the_InternalRel(A)).
% 1.98/2.18 0 [] -rel_str(A)| -rel_str(B)|subrelstr(B,A)| -subset(the_carrier(B),the_carrier(A))| -subset(the_InternalRel(B),the_InternalRel(A)).
% 1.98/2.18 0 [] -rel_str(A)| -element(B,the_carrier(A))| -element(C,the_carrier(A))| -related(A,B,C)|in(ordered_pair(B,C),the_InternalRel(A)).
% 1.98/2.18 0 [] -rel_str(A)| -element(B,the_carrier(A))| -element(C,the_carrier(A))|related(A,B,C)| -in(ordered_pair(B,C),the_InternalRel(A)).
% 1.98/2.18 0 [] $T.
% 1.98/2.18 0 [] $T.
% 1.98/2.18 0 [] $T.
% 1.98/2.18 0 [] $T.
% 1.98/2.18 0 [] -rel_str(A)|one_sorted_str(A).
% 1.98/2.18 0 [] $T.
% 1.98/2.18 0 [] $T.
% 1.98/2.18 0 [] $T.
% 1.98/2.18 0 [] -rel_str(A)| -subrelstr(B,A)|rel_str(B).
% 1.98/2.18 0 [] -relation_of2_as_subset(C,A,B)|element(C,powerset(cartesian_product2(A,B))).
% 1.98/2.18 0 [] -rel_str(A)|relation_of2_as_subset(the_InternalRel(A),the_carrier(A),the_carrier(A)).
% 1.98/2.18 0 [] $T.
% 1.98/2.18 0 [] rel_str($c1).
% 1.98/2.18 0 [] one_sorted_str($c2).
% 1.98/2.18 0 [] relation_of2($f1(A,B),A,B).
% 1.98/2.18 0 [] element($f2(A),A).
% 1.98/2.18 0 [] -rel_str(A)|subrelstr($f3(A),A).
% 1.98/2.18 0 [] relation_of2_as_subset($f4(A,B),A,B).
% 1.98/2.18 0 [] -finite(A)| -finite(B)|finite(cartesian_product2(A,B)).
% 1.98/2.18 0 [] empty(empty_set).
% 1.98/2.18 0 [] -empty($c3).
% 1.98/2.18 0 [] finite($c3).
% 1.98/2.18 0 [] empty($c4).
% 1.98/2.18 0 [] -empty($c5).
% 1.98/2.18 0 [] empty(A)|element($f5(A),powerset(A)).
% 1.98/2.18 0 [] empty(A)| -empty($f5(A)).
% 1.98/2.18 0 [] empty(A)|finite($f5(A)).
% 1.98/2.18 0 [] empty(A)|element($f6(A),powerset(A)).
% 1.98/2.18 0 [] empty(A)| -empty($f6(A)).
% 1.98/2.18 0 [] empty(A)|finite($f6(A)).
% 1.98/2.18 0 [] -relation_of2_as_subset(C,A,B)|relation_of2(C,A,B).
% 1.98/2.18 0 [] relation_of2_as_subset(C,A,B)| -relation_of2(C,A,B).
% 1.98/2.18 0 [] subset(A,A).
% 1.98/2.18 0 [] -in(A,B)|element(A,B).
% 1.98/2.18 0 [] -element(A,B)|empty(B)|in(A,B).
% 1.98/2.18 0 [] -element(A,powerset(B))|subset(A,B).
% 1.98/2.18 0 [] element(A,powerset(B))| -subset(A,B).
% 1.98/2.18 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.98/2.18 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.98/2.18 0 [] rel_str($c11).
% 1.98/2.18 0 [] subrelstr($c10,$c11).
% 1.98/2.18 0 [] element($c9,the_carrier($c11)).
% 1.98/2.18 0 [] element($c8,the_carrier($c11)).
% 1.98/2.18 0 [] element($c7,the_carrier($c10)).
% 1.98/2.18 0 [] element($c6,the_carrier($c10)).
% 1.98/2.18 0 [] $c7=$c9.
% 1.98/2.18 0 [] $c6=$c8.
% 1.98/2.18 0 [] related($c10,$c7,$c6).
% 1.98/2.18 0 [] -related($c11,$c9,$c8).
% 1.98/2.18 0 [] -empty(A)|A=empty_set.
% 1.98/2.18 0 [] -in(A,B)| -empty(B).
% 1.98/2.18 0 [] -empty(A)|A=B| -empty(B).
% 1.98/2.18 end_of_list.
% 1.98/2.18
% 1.98/2.18 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 1.98/2.18
% 1.98/2.18 This ia a non-Horn set with equality. The strategy will be
% 1.98/2.18 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.98/2.18 deletion, with positive clauses in sos and nonpositive
% 1.98/2.18 clauses in usable.
% 1.98/2.18
% 1.98/2.18 dependent: set(knuth_bendix).
% 1.98/2.18 dependent: set(anl_eq).
% 1.98/2.18 dependent: set(para_from).
% 1.98/2.18 dependent: set(para_into).
% 1.98/2.18 dependent: clear(para_from_right).
% 1.98/2.18 dependent: clear(para_into_right).
% 1.98/2.18 dependent: set(para_from_vars).
% 1.98/2.18 dependent: set(eq_units_both_ways).
% 1.98/2.18 dependent: set(dynamic_demod_all).
% 1.98/2.18 dependent: set(dynamic_demod).
% 1.98/2.18 dependent: set(order_eq).
% 1.98/2.18 dependent: set(back_demod).
% 1.98/2.18 dependent: set(lrpo).
% 1.98/2.18 dependent: set(hyper_res).
% 1.98/2.18 dependent: set(unit_deletion).
% 1.98/2.18 dependent: set(factor).
% 1.98/2.18
% 1.98/2.18 ------------> process usable:
% 1.98/2.18 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.98/2.18 ** KEPT (pick-wt=4): 2 [] -empty(A)|finite(A).
% 1.98/2.18 ** KEPT (pick-wt=8): 3 [] -element(A,powerset(cartesian_product2(B,C)))|relation(A).
% 1.98/2.18 ** KEPT (pick-wt=8): 4 [] -finite(A)| -element(B,powerset(A))|finite(B).
% 1.98/2.18 ** KEPT (pick-wt=12): 5 [] -rel_str(A)| -rel_str(B)| -subrelstr(B,A)|subset(the_carrier(B),the_carrier(A)).
% 1.98/2.18 ** KEPT (pick-wt=12): 6 [] -rel_str(A)| -rel_str(B)| -subrelstr(B,A)|subset(the_InternalRel(B),the_InternalRel(A)).
% 1.98/2.18 ** KEPT (pick-wt=17): 7 [] -rel_str(A)| -rel_str(B)|subrelstr(B,A)| -subset(the_carrier(B),the_carrier(A))| -subset(the_InternalRel(B),the_InternalRel(A)).
% 1.98/2.18 ** KEPT (pick-wt=20): 8 [] -rel_str(A)| -element(B,the_carrier(A))| -element(C,the_carrier(A))| -related(A,B,C)|in(ordered_pair(B,C),the_InternalRel(A)).
% 1.98/2.18 ** KEPT (pick-wt=20): 9 [] -rel_str(A)| -element(B,the_carrier(A))| -element(C,the_carrier(A))|related(A,B,C)| -in(ordered_pair(B,C),the_InternalRel(A)).
% 1.98/2.18 ** KEPT (pick-wt=4): 10 [] -rel_str(A)|one_sorted_str(A).
% 1.98/2.18 ** KEPT (pick-wt=7): 11 [] -rel_str(A)| -subrelstr(B,A)|rel_str(B).
% 1.98/2.18 ** KEPT (pick-wt=10): 12 [] -relation_of2_as_subset(A,B,C)|element(A,powerset(cartesian_product2(B,C))).
% 1.98/2.18 ** KEPT (pick-wt=9): 13 [] -rel_str(A)|relation_of2_as_subset(the_InternalRel(A),the_carrier(A),the_carrier(A)).
% 1.98/2.18 ** KEPT (pick-wt=6): 14 [] -rel_str(A)|subrelstr($f3(A),A).
% 1.98/2.18 ** KEPT (pick-wt=8): 15 [] -finite(A)| -finite(B)|finite(cartesian_product2(A,B)).
% 1.98/2.18 ** KEPT (pick-wt=2): 16 [] -empty($c3).
% 1.98/2.18 ** KEPT (pick-wt=2): 17 [] -empty($c5).
% 1.98/2.18 ** KEPT (pick-wt=5): 18 [] empty(A)| -empty($f5(A)).
% 1.98/2.18 ** KEPT (pick-wt=5): 19 [] empty(A)| -empty($f6(A)).
% 1.98/2.18 ** KEPT (pick-wt=8): 20 [] -relation_of2_as_subset(A,B,C)|relation_of2(A,B,C).
% 1.98/2.18 ** KEPT (pick-wt=8): 21 [] relation_of2_as_subset(A,B,C)| -relation_of2(A,B,C).
% 1.98/2.18 ** KEPT (pick-wt=6): 22 [] -in(A,B)|element(A,B).
% 1.98/2.18 ** KEPT (pick-wt=8): 23 [] -element(A,B)|empty(B)|in(A,B).
% 1.98/2.18 ** KEPT (pick-wt=7): 24 [] -element(A,powerset(B))|subset(A,B).
% 1.98/2.18 ** KEPT (pick-wt=7): 25 [] element(A,powerset(B))| -subset(A,B).
% 1.98/2.18 ** KEPT (pick-wt=10): 26 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.98/2.18 ** KEPT (pick-wt=9): 27 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.98/2.18 ** KEPT (pick-wt=4): 28 [] -related($c11,$c9,$c8).
% 1.98/2.18 ** KEPT (pick-wt=5): 29 [] -empty(A)|A=empty_set.
% 1.98/2.18 ** Alarm clock
% 299.80/300.01 Otter interrupted
% 299.80/300.01 PROOF NOT FOUND
%------------------------------------------------------------------------------