TSTP Solution File: SEU232+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU232+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n009.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:16 EDT 2022
% Result : Timeout 299.94s 300.10s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEU232+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n009.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 07:47:06 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.85/2.04 ----- Otter 3.3f, August 2004 -----
% 1.85/2.04 The process was started by sandbox2 on n009.cluster.edu,
% 1.85/2.04 Wed Jul 27 07:47:06 2022
% 1.85/2.04 The command was "./otter". The process ID is 23419.
% 1.85/2.04
% 1.85/2.04 set(prolog_style_variables).
% 1.85/2.04 set(auto).
% 1.85/2.04 dependent: set(auto1).
% 1.85/2.04 dependent: set(process_input).
% 1.85/2.04 dependent: clear(print_kept).
% 1.85/2.04 dependent: clear(print_new_demod).
% 1.85/2.04 dependent: clear(print_back_demod).
% 1.85/2.04 dependent: clear(print_back_sub).
% 1.85/2.04 dependent: set(control_memory).
% 1.85/2.04 dependent: assign(max_mem, 12000).
% 1.85/2.04 dependent: assign(pick_given_ratio, 4).
% 1.85/2.04 dependent: assign(stats_level, 1).
% 1.85/2.04 dependent: assign(max_seconds, 10800).
% 1.85/2.04 clear(print_given).
% 1.85/2.04
% 1.85/2.04 formula_list(usable).
% 1.85/2.04 all A (A=A).
% 1.85/2.04 all A B (in(A,B)-> -in(B,A)).
% 1.85/2.04 all A (empty(A)->function(A)).
% 1.85/2.04 all A (ordinal(A)->epsilon_transitive(A)&epsilon_connected(A)).
% 1.85/2.04 all A (empty(A)->relation(A)).
% 1.85/2.04 all A (relation(A)&empty(A)&function(A)->relation(A)&function(A)&one_to_one(A)).
% 1.85/2.04 all A (epsilon_transitive(A)&epsilon_connected(A)->ordinal(A)).
% 1.85/2.04 all A (epsilon_transitive(A)<-> (all B (in(B,A)->subset(B,A)))).
% 1.85/2.04 all A (epsilon_connected(A)<-> (all B C (-(in(B,A)&in(C,A)& -in(B,C)&B!=C& -in(C,B))))).
% 1.85/2.04 all A B (subset(A,B)<-> (all C (in(C,A)->in(C,B)))).
% 1.85/2.04 all A (ordinal(A)<->epsilon_transitive(A)&epsilon_connected(A)).
% 1.85/2.04 all A B C (C=set_difference(A,B)<-> (all D (in(D,C)<->in(D,A)& -in(D,B)))).
% 1.85/2.04 $T.
% 1.85/2.04 $T.
% 1.85/2.04 $T.
% 1.85/2.04 $T.
% 1.85/2.04 all A exists B element(B,A).
% 1.85/2.04 empty(empty_set).
% 1.85/2.04 relation(empty_set).
% 1.85/2.04 relation_empty_yielding(empty_set).
% 1.85/2.04 empty(empty_set).
% 1.85/2.04 all A B (relation(A)&relation(B)->relation(set_difference(A,B))).
% 1.85/2.04 empty(empty_set).
% 1.85/2.04 relation(empty_set).
% 1.85/2.04 exists A (relation(A)&function(A)).
% 1.85/2.04 exists A (epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 1.85/2.04 exists A (empty(A)&relation(A)).
% 1.85/2.04 exists A empty(A).
% 1.85/2.04 exists A (relation(A)&empty(A)&function(A)).
% 1.85/2.04 exists A (-empty(A)&relation(A)).
% 1.85/2.04 exists A (-empty(A)).
% 1.85/2.04 exists A (relation(A)&function(A)&one_to_one(A)).
% 1.85/2.04 exists A (relation(A)&relation_empty_yielding(A)).
% 1.85/2.04 exists A (relation(A)&relation_empty_yielding(A)&function(A)).
% 1.85/2.04 all A B subset(A,A).
% 1.85/2.04 all A B (in(A,B)->element(A,B)).
% 1.85/2.04 -(all A B (ordinal(B)-> (in(A,B)->ordinal(A)))).
% 1.85/2.04 all A B (element(A,B)->empty(B)|in(A,B)).
% 1.85/2.04 all A (set_difference(A,empty_set)=A).
% 1.85/2.04 all A B C (-(in(A,B)&in(B,C)&in(C,A))).
% 1.85/2.04 all A B (element(A,powerset(B))<->subset(A,B)).
% 1.85/2.04 all A (set_difference(empty_set,A)=empty_set).
% 1.85/2.04 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 1.85/2.04 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 1.85/2.04 all A (empty(A)->A=empty_set).
% 1.85/2.04 all A B (-(in(A,B)&empty(B))).
% 1.85/2.04 all A B (-(in(A,B)& (all C (-(in(C,B)& (all D (-(in(D,B)&in(D,C))))))))).
% 1.85/2.04 all A B (-(empty(A)&A!=B&empty(B))).
% 1.85/2.04 end_of_list.
% 1.85/2.04
% 1.85/2.04 -------> usable clausifies to:
% 1.85/2.04
% 1.85/2.04 list(usable).
% 1.85/2.04 0 [] A=A.
% 1.85/2.04 0 [] -in(A,B)| -in(B,A).
% 1.85/2.04 0 [] -empty(A)|function(A).
% 1.85/2.04 0 [] -ordinal(A)|epsilon_transitive(A).
% 1.85/2.04 0 [] -ordinal(A)|epsilon_connected(A).
% 1.85/2.04 0 [] -empty(A)|relation(A).
% 1.85/2.04 0 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 1.85/2.04 0 [] -epsilon_transitive(A)| -epsilon_connected(A)|ordinal(A).
% 1.85/2.04 0 [] -epsilon_transitive(A)| -in(B,A)|subset(B,A).
% 1.85/2.04 0 [] epsilon_transitive(A)|in($f1(A),A).
% 1.85/2.04 0 [] epsilon_transitive(A)| -subset($f1(A),A).
% 1.85/2.04 0 [] -epsilon_connected(A)| -in(B,A)| -in(C,A)|in(B,C)|B=C|in(C,B).
% 1.85/2.04 0 [] epsilon_connected(A)|in($f3(A),A).
% 1.85/2.04 0 [] epsilon_connected(A)|in($f2(A),A).
% 1.85/2.04 0 [] epsilon_connected(A)| -in($f3(A),$f2(A)).
% 1.85/2.04 0 [] epsilon_connected(A)|$f3(A)!=$f2(A).
% 1.85/2.04 0 [] epsilon_connected(A)| -in($f2(A),$f3(A)).
% 1.85/2.04 0 [] -subset(A,B)| -in(C,A)|in(C,B).
% 1.85/2.04 0 [] subset(A,B)|in($f4(A,B),A).
% 1.85/2.04 0 [] subset(A,B)| -in($f4(A,B),B).
% 1.85/2.04 0 [] -ordinal(A)|epsilon_transitive(A).
% 1.85/2.04 0 [] -ordinal(A)|epsilon_connected(A).
% 1.85/2.04 0 [] ordinal(A)| -epsilon_transitive(A)| -epsilon_connected(A).
% 1.85/2.04 0 [] C!=set_difference(A,B)| -in(D,C)|in(D,A).
% 1.85/2.04 0 [] C!=set_difference(A,B)| -in(D,C)| -in(D,B).
% 1.85/2.04 0 [] C!=set_difference(A,B)|in(D,C)| -in(D,A)|in(D,B).
% 1.85/2.04 0 [] C=set_difference(A,B)|in($f5(A,B,C),C)|in($f5(A,B,C),A).
% 1.85/2.04 0 [] C=set_difference(A,B)|in($f5(A,B,C),C)| -in($f5(A,B,C),B).
% 1.85/2.04 0 [] C=set_difference(A,B)| -in($f5(A,B,C),C)| -in($f5(A,B,C),A)|in($f5(A,B,C),B).
% 1.85/2.04 0 [] $T.
% 1.85/2.04 0 [] $T.
% 1.85/2.04 0 [] $T.
% 1.85/2.04 0 [] $T.
% 1.85/2.04 0 [] element($f6(A),A).
% 1.85/2.04 0 [] empty(empty_set).
% 1.85/2.04 0 [] relation(empty_set).
% 1.85/2.04 0 [] relation_empty_yielding(empty_set).
% 1.85/2.04 0 [] empty(empty_set).
% 1.85/2.04 0 [] -relation(A)| -relation(B)|relation(set_difference(A,B)).
% 1.85/2.04 0 [] empty(empty_set).
% 1.85/2.04 0 [] relation(empty_set).
% 1.85/2.04 0 [] relation($c1).
% 1.85/2.04 0 [] function($c1).
% 1.85/2.04 0 [] epsilon_transitive($c2).
% 1.85/2.04 0 [] epsilon_connected($c2).
% 1.85/2.04 0 [] ordinal($c2).
% 1.85/2.04 0 [] empty($c3).
% 1.85/2.04 0 [] relation($c3).
% 1.85/2.04 0 [] empty($c4).
% 1.85/2.04 0 [] relation($c5).
% 1.85/2.04 0 [] empty($c5).
% 1.85/2.04 0 [] function($c5).
% 1.85/2.04 0 [] -empty($c6).
% 1.85/2.04 0 [] relation($c6).
% 1.85/2.04 0 [] -empty($c7).
% 1.85/2.04 0 [] relation($c8).
% 1.85/2.04 0 [] function($c8).
% 1.85/2.04 0 [] one_to_one($c8).
% 1.85/2.04 0 [] relation($c9).
% 1.85/2.04 0 [] relation_empty_yielding($c9).
% 1.85/2.04 0 [] relation($c10).
% 1.85/2.04 0 [] relation_empty_yielding($c10).
% 1.85/2.04 0 [] function($c10).
% 1.85/2.04 0 [] subset(A,A).
% 1.85/2.04 0 [] -in(A,B)|element(A,B).
% 1.85/2.04 0 [] ordinal($c11).
% 1.85/2.04 0 [] in($c12,$c11).
% 1.85/2.04 0 [] -ordinal($c12).
% 1.85/2.04 0 [] -element(A,B)|empty(B)|in(A,B).
% 1.85/2.04 0 [] set_difference(A,empty_set)=A.
% 1.85/2.04 0 [] -in(A,B)| -in(B,C)| -in(C,A).
% 1.85/2.04 0 [] -element(A,powerset(B))|subset(A,B).
% 1.85/2.04 0 [] element(A,powerset(B))| -subset(A,B).
% 1.85/2.04 0 [] set_difference(empty_set,A)=empty_set.
% 1.85/2.04 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.85/2.04 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.85/2.04 0 [] -empty(A)|A=empty_set.
% 1.85/2.04 0 [] -in(A,B)| -empty(B).
% 1.85/2.04 0 [] -in(A,B)|in($f7(A,B),B).
% 1.85/2.04 0 [] -in(A,B)| -in(D,B)| -in(D,$f7(A,B)).
% 1.85/2.04 0 [] -empty(A)|A=B| -empty(B).
% 1.85/2.04 end_of_list.
% 1.85/2.04
% 1.85/2.04 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 1.85/2.04
% 1.85/2.04 This ia a non-Horn set with equality. The strategy will be
% 1.85/2.04 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.85/2.04 deletion, with positive clauses in sos and nonpositive
% 1.85/2.04 clauses in usable.
% 1.85/2.04
% 1.85/2.04 dependent: set(knuth_bendix).
% 1.85/2.04 dependent: set(anl_eq).
% 1.85/2.04 dependent: set(para_from).
% 1.85/2.04 dependent: set(para_into).
% 1.85/2.04 dependent: clear(para_from_right).
% 1.85/2.04 dependent: clear(para_into_right).
% 1.85/2.04 dependent: set(para_from_vars).
% 1.85/2.04 dependent: set(eq_units_both_ways).
% 1.85/2.04 dependent: set(dynamic_demod_all).
% 1.85/2.04 dependent: set(dynamic_demod).
% 1.85/2.04 dependent: set(order_eq).
% 1.85/2.04 dependent: set(back_demod).
% 1.85/2.04 dependent: set(lrpo).
% 1.85/2.04 dependent: set(hyper_res).
% 1.85/2.04 dependent: set(unit_deletion).
% 1.85/2.04 dependent: set(factor).
% 1.85/2.04
% 1.85/2.04 ------------> process usable:
% 1.85/2.04 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.85/2.04 ** KEPT (pick-wt=4): 2 [] -empty(A)|function(A).
% 1.85/2.04 ** KEPT (pick-wt=4): 3 [] -ordinal(A)|epsilon_transitive(A).
% 1.85/2.04 ** KEPT (pick-wt=4): 4 [] -ordinal(A)|epsilon_connected(A).
% 1.85/2.04 ** KEPT (pick-wt=4): 5 [] -empty(A)|relation(A).
% 1.85/2.04 ** KEPT (pick-wt=8): 6 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 1.85/2.04 ** KEPT (pick-wt=6): 7 [] -epsilon_transitive(A)| -epsilon_connected(A)|ordinal(A).
% 1.85/2.04 ** KEPT (pick-wt=8): 8 [] -epsilon_transitive(A)| -in(B,A)|subset(B,A).
% 1.85/2.04 ** KEPT (pick-wt=6): 9 [] epsilon_transitive(A)| -subset($f1(A),A).
% 1.85/2.04 ** KEPT (pick-wt=17): 10 [] -epsilon_connected(A)| -in(B,A)| -in(C,A)|in(B,C)|B=C|in(C,B).
% 1.85/2.04 ** KEPT (pick-wt=7): 11 [] epsilon_connected(A)| -in($f3(A),$f2(A)).
% 1.85/2.04 ** KEPT (pick-wt=7): 12 [] epsilon_connected(A)|$f3(A)!=$f2(A).
% 1.85/2.04 ** KEPT (pick-wt=7): 13 [] epsilon_connected(A)| -in($f2(A),$f3(A)).
% 1.85/2.04 ** KEPT (pick-wt=9): 14 [] -subset(A,B)| -in(C,A)|in(C,B).
% 1.85/2.04 ** KEPT (pick-wt=8): 15 [] subset(A,B)| -in($f4(A,B),B).
% 1.85/2.04 Following clause subsumed by 3 during input processing: 0 [] -ordinal(A)|epsilon_transitive(A).
% 1.85/2.04 Following clause subsumed by 4 during input processing: 0 [] -ordinal(A)|epsilon_connected(A).
% 1.85/2.04 Following clause subsumed by 7 during input processing: 0 [] ordinal(A)| -epsilon_transitive(A)| -epsilon_connected(A).
% 1.85/2.04 ** KEPT (pick-wt=11): 16 [] A!=set_difference(B,C)| -in(D,A)|in(D,B).
% 1.85/2.04 ** KEPT (pick-wt=11): 17 [] A!=set_difference(B,C)| -in(D,A)| -in(D,C).
% 1.85/2.04 ** KEPT (pick-wt=14): 18 [] A!=set_difference(B,C)|in(D,A)| -in(D,B)|in(D,C).
% 1.85/2.04 ** KEPT (pick-wt=17): 19 [] A=set_difference(B,C)|in($f5(B,C,A),A)| -in($f5(B,C,A),C).
% 1.85/2.04 ** KEPT (pick-wt=23): 20 [] A=set_difference(B,C)| -in($f5(B,C,A),A)| -in($f5(B,C,A),B)|in($f5(B,C,A),C).
% 1.85/2.04 ** KEPT (pick-wt=8): 21 [] -relation(A)| -relation(B)|relation(set_difference(A,B)).
% 1.85/2.04 ** KEPT (pick-wt=2): 22 [] -empty($c6).
% 1.85/2.04 ** KEPT (pick-wt=2): 23 [] -empty($c7).
% 1.85/2.04 ** KEPT (pick-wt=6): 24 [] -in(A,B)|element(A,B).
% 1.85/2.04 ** KEPT (pick-wt=2): 25 [] -ordinal($c12).
% 1.85/2.04 ** KEPT (pick-wt=8): 26 [] -element(A,B)|empty(B)|in(A,B).
% 1.85/2.04 ** KEPT (picAlarm clock
% 299.94/300.10 Otter interrupted
% 299.94/300.10 PROOF NOT FOUND
%------------------------------------------------------------------------------