TSTP Solution File: SEU339+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU339+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:44 EDT 2022
% Result : Timeout 299.88s 300.07s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SEU339+1 : TPTP v8.1.0. Released v3.3.0.
% 0.09/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:17:07 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.88/2.07 ----- Otter 3.3f, August 2004 -----
% 1.88/2.07 The process was started by sandbox2 on n016.cluster.edu,
% 1.88/2.07 Wed Jul 27 08:17:07 2022
% 1.88/2.07 The command was "./otter". The process ID is 28368.
% 1.88/2.07
% 1.88/2.07 set(prolog_style_variables).
% 1.88/2.07 set(auto).
% 1.88/2.07 dependent: set(auto1).
% 1.88/2.07 dependent: set(process_input).
% 1.88/2.07 dependent: clear(print_kept).
% 1.88/2.07 dependent: clear(print_new_demod).
% 1.88/2.07 dependent: clear(print_back_demod).
% 1.88/2.07 dependent: clear(print_back_sub).
% 1.88/2.07 dependent: set(control_memory).
% 1.88/2.07 dependent: assign(max_mem, 12000).
% 1.88/2.07 dependent: assign(pick_given_ratio, 4).
% 1.88/2.07 dependent: assign(stats_level, 1).
% 1.88/2.07 dependent: assign(max_seconds, 10800).
% 1.88/2.07 clear(print_given).
% 1.88/2.07
% 1.88/2.07 formula_list(usable).
% 1.88/2.07 all A (A=A).
% 1.88/2.07 all A B (in(A,B)-> -in(B,A)).
% 1.88/2.07 all A B C (element(C,powerset(cartesian_product2(A,B)))->relation(C)).
% 1.88/2.07 all A B (unordered_pair(A,B)=unordered_pair(B,A)).
% 1.88/2.07 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))))).
% 1.88/2.07 all A B (ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A))).
% 1.88/2.07 all A (rel_str(A)-> (antisymmetric_relstr(A)<->is_antisymmetric_in(the_InternalRel(A),the_carrier(A)))).
% 1.88/2.07 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.88/2.07 $T.
% 1.88/2.07 $T.
% 1.88/2.07 $T.
% 1.88/2.07 $T.
% 1.88/2.07 $T.
% 1.88/2.07 $T.
% 1.88/2.07 all A (rel_str(A)->one_sorted_str(A)).
% 1.88/2.07 $T.
% 1.88/2.07 $T.
% 1.88/2.07 $T.
% 1.88/2.07 all A B C (relation_of2_as_subset(C,A,B)->element(C,powerset(cartesian_product2(A,B)))).
% 1.88/2.07 all A (rel_str(A)->relation_of2_as_subset(the_InternalRel(A),the_carrier(A),the_carrier(A))).
% 1.88/2.07 $T.
% 1.88/2.07 exists A rel_str(A).
% 1.88/2.07 exists A one_sorted_str(A).
% 1.88/2.07 all A B exists C relation_of2(C,A,B).
% 1.88/2.07 all A exists B element(B,A).
% 1.88/2.07 all A B exists C relation_of2_as_subset(C,A,B).
% 1.88/2.07 all A (-empty(powerset(A))).
% 1.88/2.07 empty(empty_set).
% 1.88/2.07 all A (-empty(singleton(A))).
% 1.88/2.07 all A B (-empty(unordered_pair(A,B))).
% 1.88/2.07 all A B (-empty(A)& -empty(B)-> -empty(cartesian_product2(A,B))).
% 1.88/2.07 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)))).
% 1.88/2.07 exists A empty(A).
% 1.88/2.07 all A exists B (element(B,powerset(A))&empty(B)).
% 1.88/2.07 exists A (-empty(A)).
% 1.88/2.07 all A B C (relation_of2_as_subset(C,A,B)<->relation_of2(C,A,B)).
% 1.88/2.07 all A B subset(A,A).
% 1.88/2.07 all A B C D (in(ordered_pair(A,B),cartesian_product2(C,D))<->in(A,C)&in(B,D)).
% 1.88/2.07 all A B (in(A,B)->element(A,B)).
% 1.88/2.07 -(all A (antisymmetric_relstr(A)&rel_str(A)-> (all B (element(B,the_carrier(A))-> (all C (element(C,the_carrier(A))-> (related(A,B,C)&related(A,C,B)->B=C))))))).
% 1.88/2.07 all A B (element(A,B)->empty(B)|in(A,B)).
% 1.88/2.07 all A B (element(A,powerset(B))<->subset(A,B)).
% 1.88/2.07 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 1.88/2.07 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 1.88/2.07 all A (empty(A)->A=empty_set).
% 1.88/2.07 all A B (-(in(A,B)&empty(B))).
% 1.88/2.07 all A B (-(empty(A)&A!=B&empty(B))).
% 1.88/2.07 end_of_list.
% 1.88/2.07
% 1.88/2.07 -------> usable clausifies to:
% 1.88/2.07
% 1.88/2.07 list(usable).
% 1.88/2.07 0 [] A=A.
% 1.88/2.07 0 [] -in(A,B)| -in(B,A).
% 1.88/2.07 0 [] -element(C,powerset(cartesian_product2(A,B)))|relation(C).
% 1.88/2.07 0 [] unordered_pair(A,B)=unordered_pair(B,A).
% 1.88/2.07 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.
% 1.88/2.07 0 [] -relation(A)|is_antisymmetric_in(A,B)|in($f2(A,B),B).
% 1.88/2.07 0 [] -relation(A)|is_antisymmetric_in(A,B)|in($f1(A,B),B).
% 1.88/2.07 0 [] -relation(A)|is_antisymmetric_in(A,B)|in(ordered_pair($f2(A,B),$f1(A,B)),A).
% 1.88/2.07 0 [] -relation(A)|is_antisymmetric_in(A,B)|in(ordered_pair($f1(A,B),$f2(A,B)),A).
% 1.88/2.07 0 [] -relation(A)|is_antisymmetric_in(A,B)|$f2(A,B)!=$f1(A,B).
% 1.88/2.07 0 [] ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A)).
% 1.88/2.07 0 [] -rel_str(A)| -antisymmetric_relstr(A)|is_antisymmetric_in(the_InternalRel(A),the_carrier(A)).
% 1.88/2.07 0 [] -rel_str(A)|antisymmetric_relstr(A)| -is_antisymmetric_in(the_InternalRel(A),the_carrier(A)).
% 1.88/2.07 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.88/2.07 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.88/2.07 0 [] $T.
% 1.88/2.07 0 [] $T.
% 1.88/2.07 0 [] $T.
% 1.88/2.07 0 [] $T.
% 1.88/2.07 0 [] $T.
% 1.88/2.07 0 [] $T.
% 1.88/2.07 0 [] -rel_str(A)|one_sorted_str(A).
% 1.88/2.07 0 [] $T.
% 1.88/2.07 0 [] $T.
% 1.88/2.07 0 [] $T.
% 1.88/2.07 0 [] -relation_of2_as_subset(C,A,B)|element(C,powerset(cartesian_product2(A,B))).
% 1.88/2.07 0 [] -rel_str(A)|relation_of2_as_subset(the_InternalRel(A),the_carrier(A),the_carrier(A)).
% 1.88/2.07 0 [] $T.
% 1.88/2.07 0 [] rel_str($c1).
% 1.88/2.07 0 [] one_sorted_str($c2).
% 1.88/2.07 0 [] relation_of2($f3(A,B),A,B).
% 1.88/2.07 0 [] element($f4(A),A).
% 1.88/2.07 0 [] relation_of2_as_subset($f5(A,B),A,B).
% 1.88/2.07 0 [] -empty(powerset(A)).
% 1.88/2.07 0 [] empty(empty_set).
% 1.88/2.07 0 [] -empty(singleton(A)).
% 1.88/2.07 0 [] -empty(unordered_pair(A,B)).
% 1.88/2.07 0 [] empty(A)|empty(B)| -empty(cartesian_product2(A,B)).
% 1.88/2.07 0 [] empty(A)|element($f6(A),powerset(A)).
% 1.88/2.07 0 [] empty(A)| -empty($f6(A)).
% 1.88/2.07 0 [] empty($c3).
% 1.88/2.07 0 [] element($f7(A),powerset(A)).
% 1.88/2.07 0 [] empty($f7(A)).
% 1.88/2.07 0 [] -empty($c4).
% 1.88/2.07 0 [] -relation_of2_as_subset(C,A,B)|relation_of2(C,A,B).
% 1.88/2.07 0 [] relation_of2_as_subset(C,A,B)| -relation_of2(C,A,B).
% 1.88/2.07 0 [] subset(A,A).
% 1.88/2.07 0 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(A,C).
% 1.88/2.07 0 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(B,D).
% 1.88/2.07 0 [] in(ordered_pair(A,B),cartesian_product2(C,D))| -in(A,C)| -in(B,D).
% 1.88/2.07 0 [] -in(A,B)|element(A,B).
% 1.88/2.07 0 [] antisymmetric_relstr($c7).
% 1.88/2.07 0 [] rel_str($c7).
% 1.88/2.07 0 [] element($c6,the_carrier($c7)).
% 1.88/2.07 0 [] element($c5,the_carrier($c7)).
% 1.88/2.07 0 [] related($c7,$c6,$c5).
% 1.88/2.07 0 [] related($c7,$c5,$c6).
% 1.88/2.07 0 [] $c6!=$c5.
% 1.88/2.07 0 [] -element(A,B)|empty(B)|in(A,B).
% 1.88/2.07 0 [] -element(A,powerset(B))|subset(A,B).
% 1.88/2.07 0 [] element(A,powerset(B))| -subset(A,B).
% 1.88/2.07 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.88/2.07 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.88/2.07 0 [] -empty(A)|A=empty_set.
% 1.88/2.07 0 [] -in(A,B)| -empty(B).
% 1.88/2.07 0 [] -empty(A)|A=B| -empty(B).
% 1.88/2.07 end_of_list.
% 1.88/2.07
% 1.88/2.07 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 1.88/2.07
% 1.88/2.07 This ia a non-Horn set with equality. The strategy will be
% 1.88/2.07 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.88/2.07 deletion, with positive clauses in sos and nonpositive
% 1.88/2.07 clauses in usable.
% 1.88/2.07
% 1.88/2.07 dependent: set(knuth_bendix).
% 1.88/2.07 dependent: set(anl_eq).
% 1.88/2.07 dependent: set(para_from).
% 1.88/2.07 dependent: set(para_into).
% 1.88/2.07 dependent: clear(para_from_right).
% 1.88/2.07 dependent: clear(para_into_right).
% 1.88/2.07 dependent: set(para_from_vars).
% 1.88/2.07 dependent: set(eq_units_both_ways).
% 1.88/2.07 dependent: set(dynamic_demod_all).
% 1.88/2.07 dependent: set(dynamic_demod).
% 1.88/2.07 dependent: set(order_eq).
% 1.88/2.07 dependent: set(back_demod).
% 1.88/2.07 dependent: set(lrpo).
% 1.88/2.07 dependent: set(hyper_res).
% 1.88/2.07 dependent: set(unit_deletion).
% 1.88/2.07 dependent: set(factor).
% 1.88/2.07
% 1.88/2.07 ------------> process usable:
% 1.88/2.07 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.88/2.07 ** KEPT (pick-wt=8): 2 [] -element(A,powerset(cartesian_product2(B,C)))|relation(A).
% 1.88/2.07 ** KEPT (pick-wt=24): 3 [] -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.
% 1.88/2.07 ** KEPT (pick-wt=10): 4 [] -relation(A)|is_antisymmetric_in(A,B)|in($f2(A,B),B).
% 1.88/2.07 ** KEPT (pick-wt=10): 5 [] -relation(A)|is_antisymmetric_in(A,B)|in($f1(A,B),B).
% 1.88/2.07 ** KEPT (pick-wt=14): 6 [] -relation(A)|is_antisymmetric_in(A,B)|in(ordered_pair($f2(A,B),$f1(A,B)),A).
% 1.88/2.07 ** KEPT (pick-wt=14): 7 [] -relation(A)|is_antisymmetric_in(A,B)|in(ordered_pair($f1(A,B),$f2(A,B)),A).
% 1.88/2.07 ** KEPT (pick-wt=12): 8 [] -relation(A)|is_antisymmetric_in(A,B)|$f2(A,B)!=$f1(A,B).
% 1.88/2.07 ** KEPT (pick-wt=9): 9 [] -rel_str(A)| -antisymmetric_relstr(A)|is_antisymmetric_in(the_InternalRel(A),the_carrier(A)).
% 1.88/2.07 ** KEPT (pick-wt=9): 10 [] -rel_str(A)|antisymmetric_relstr(A)| -is_antisymmetric_in(the_InternalRel(A),the_carrier(A)).
% 1.88/2.07 ** KEPT (pick-wt=20): 11 [] -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.88/2.07 ** KEPT (pick-wt=20): 12 [] -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.88/2.07 ** KEPT (pick-wt=4): 13 [] -rel_str(A)|one_sorted_str(A).
% 1.88/2.07 ** KEPT (pick-wt=10): 14 [] -relation_of2_as_subset(A,B,C)|element(A,powerset(cartesian_product2(B,C))).
% 1.88/2.07 ** KEPT (pick-wt=9): 15 [] -rel_str(A)|relation_of2_as_subset(the_InternalRel(A),the_carrier(A),the_carrier(A)).
% 1.88/2.07 ** KEPT (pick-wt=3): 16 [] -empty(powerset(A)).
% 1.88/2.07 ** KEPT (pick-wt=3): 17 [] -empty(singleton(A)).
% 1.88/2.07 ** KEPT (pick-wt=4): 18 [] -empty(unordered_pair(A,B)).
% 1.88/2.07 ** KEPT (pick-wt=8): 19 [] empty(A)|empty(B)| -empty(cartesian_product2(A,B)).
% 1.88/2.07 ** KEPT (picAlarm clock
% 299.88/300.07 Otter interrupted
% 299.88/300.07 PROOF NOT FOUND
%------------------------------------------------------------------------------