TSTP Solution File: SEU254+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU254+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n021.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:21 EDT 2022
% Result : Unknown 15.67s 15.84s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU254+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.13 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n021.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 07:48:53 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.83/2.03 ----- Otter 3.3f, August 2004 -----
% 1.83/2.03 The process was started by sandbox on n021.cluster.edu,
% 1.83/2.03 Wed Jul 27 07:48:53 2022
% 1.83/2.03 The command was "./otter". The process ID is 18991.
% 1.83/2.03
% 1.83/2.03 set(prolog_style_variables).
% 1.83/2.03 set(auto).
% 1.83/2.03 dependent: set(auto1).
% 1.83/2.03 dependent: set(process_input).
% 1.83/2.03 dependent: clear(print_kept).
% 1.83/2.03 dependent: clear(print_new_demod).
% 1.83/2.03 dependent: clear(print_back_demod).
% 1.83/2.03 dependent: clear(print_back_sub).
% 1.83/2.03 dependent: set(control_memory).
% 1.83/2.03 dependent: assign(max_mem, 12000).
% 1.83/2.03 dependent: assign(pick_given_ratio, 4).
% 1.83/2.03 dependent: assign(stats_level, 1).
% 1.83/2.03 dependent: assign(max_seconds, 10800).
% 1.83/2.03 clear(print_given).
% 1.83/2.03
% 1.83/2.03 formula_list(usable).
% 1.83/2.03 all A (A=A).
% 1.83/2.03 all A B (in(A,B)-> -in(B,A)).
% 1.83/2.03 all A (empty(A)->function(A)).
% 1.83/2.03 all A (relation(A)&empty(A)&function(A)->relation(A)&function(A)&one_to_one(A)).
% 1.83/2.03 all A B (unordered_pair(A,B)=unordered_pair(B,A)).
% 1.83/2.03 all A B (set_intersection2(A,B)=set_intersection2(B,A)).
% 1.83/2.03 all A B (ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A))).
% 1.83/2.03 all A (relation(A)-> (all B (relation_restriction(A,B)=set_intersection2(A,cartesian_product2(B,B))))).
% 1.83/2.03 $T.
% 1.83/2.03 $T.
% 1.83/2.03 $T.
% 1.83/2.03 all A B (relation(A)->relation(relation_restriction(A,B))).
% 1.83/2.03 $T.
% 1.83/2.03 $T.
% 1.83/2.03 $T.
% 1.83/2.03 $T.
% 1.83/2.03 all A exists B element(B,A).
% 1.83/2.03 empty(empty_set).
% 1.83/2.03 all A B (-empty(ordered_pair(A,B))).
% 1.83/2.03 all A B (set_intersection2(A,A)=A).
% 1.83/2.03 all A (relation(A)-> (transitive(A)<-> (all B C D (in(ordered_pair(B,C),A)&in(ordered_pair(C,D),A)->in(ordered_pair(B,D),A))))).
% 1.83/2.03 exists A (relation(A)&function(A)).
% 1.83/2.03 exists A empty(A).
% 1.83/2.03 exists A (relation(A)&empty(A)&function(A)).
% 1.83/2.03 exists A (-empty(A)).
% 1.83/2.03 exists A (relation(A)&function(A)&one_to_one(A)).
% 1.83/2.03 all A B C D (in(ordered_pair(A,B),cartesian_product2(C,D))<->in(A,C)&in(B,D)).
% 1.83/2.03 all A B C (relation(C)-> (in(A,relation_restriction(C,B))<->in(A,C)&in(A,cartesian_product2(B,B)))).
% 1.83/2.03 all A B (in(A,B)->element(A,B)).
% 1.83/2.03 -(all A B (relation(B)-> (transitive(B)->transitive(relation_restriction(B,A))))).
% 1.83/2.03 all A (set_intersection2(A,empty_set)=empty_set).
% 1.83/2.03 all A B (element(A,B)->empty(B)|in(A,B)).
% 1.83/2.03 all A (empty(A)->A=empty_set).
% 1.83/2.03 all A B (-(in(A,B)&empty(B))).
% 1.83/2.03 all A B (-(empty(A)&A!=B&empty(B))).
% 1.83/2.03 end_of_list.
% 1.83/2.03
% 1.83/2.03 -------> usable clausifies to:
% 1.83/2.03
% 1.83/2.03 list(usable).
% 1.83/2.03 0 [] A=A.
% 1.83/2.03 0 [] -in(A,B)| -in(B,A).
% 1.83/2.03 0 [] -empty(A)|function(A).
% 1.83/2.03 0 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 1.83/2.03 0 [] unordered_pair(A,B)=unordered_pair(B,A).
% 1.83/2.03 0 [] set_intersection2(A,B)=set_intersection2(B,A).
% 1.83/2.03 0 [] ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A)).
% 1.83/2.03 0 [] -relation(A)|relation_restriction(A,B)=set_intersection2(A,cartesian_product2(B,B)).
% 1.83/2.03 0 [] $T.
% 1.83/2.03 0 [] $T.
% 1.83/2.03 0 [] $T.
% 1.83/2.03 0 [] -relation(A)|relation(relation_restriction(A,B)).
% 1.83/2.03 0 [] $T.
% 1.83/2.03 0 [] $T.
% 1.83/2.03 0 [] $T.
% 1.83/2.03 0 [] $T.
% 1.83/2.03 0 [] element($f1(A),A).
% 1.83/2.03 0 [] empty(empty_set).
% 1.83/2.03 0 [] -empty(ordered_pair(A,B)).
% 1.83/2.03 0 [] set_intersection2(A,A)=A.
% 1.83/2.03 0 [] -relation(A)| -transitive(A)| -in(ordered_pair(B,C),A)| -in(ordered_pair(C,D),A)|in(ordered_pair(B,D),A).
% 1.83/2.03 0 [] -relation(A)|transitive(A)|in(ordered_pair($f4(A),$f3(A)),A).
% 1.83/2.03 0 [] -relation(A)|transitive(A)|in(ordered_pair($f3(A),$f2(A)),A).
% 1.83/2.03 0 [] -relation(A)|transitive(A)| -in(ordered_pair($f4(A),$f2(A)),A).
% 1.83/2.03 0 [] relation($c1).
% 1.83/2.03 0 [] function($c1).
% 1.83/2.03 0 [] empty($c2).
% 1.83/2.03 0 [] relation($c3).
% 1.83/2.03 0 [] empty($c3).
% 1.83/2.03 0 [] function($c3).
% 1.83/2.03 0 [] -empty($c4).
% 1.83/2.03 0 [] relation($c5).
% 1.83/2.03 0 [] function($c5).
% 1.83/2.03 0 [] one_to_one($c5).
% 1.83/2.03 0 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(A,C).
% 1.83/2.03 0 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(B,D).
% 1.83/2.03 0 [] in(ordered_pair(A,B),cartesian_product2(C,D))| -in(A,C)| -in(B,D).
% 1.83/2.03 0 [] -relation(C)| -in(A,relation_restriction(C,B))|in(A,C).
% 1.83/2.03 0 [] -relation(C)| -in(A,relation_restriction(C,B))|in(A,cartesian_product2(B,B)).
% 1.83/2.03 0 [] -relation(C)|in(A,relation_restriction(C,B))| -in(A,C)| -in(A,cartesian_product2(B,B)).
% 1.83/2.03 0 [] -in(A,B)|element(A,B).
% 1.83/2.03 0 [] relation($c6).
% 1.83/2.03 0 [] transitive($c6).
% 1.83/2.03 0 [] -transitive(relation_restriction($c6,$c7)).
% 1.83/2.03 0 [] set_intersection2(A,empty_set)=empty_set.
% 1.83/2.03 0 [] -element(A,B)|empty(B)|in(A,B).
% 1.83/2.03 0 [] -empty(A)|A=empty_set.
% 1.83/2.03 0 [] -in(A,B)| -empty(B).
% 1.83/2.03 0 [] -empty(A)|A=B| -empty(B).
% 1.83/2.03 end_of_list.
% 1.83/2.03
% 1.83/2.03 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 1.83/2.03
% 1.83/2.03 This ia a non-Horn set with equality. The strategy will be
% 1.83/2.03 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.83/2.03 deletion, with positive clauses in sos and nonpositive
% 1.83/2.03 clauses in usable.
% 1.83/2.03
% 1.83/2.03 dependent: set(knuth_bendix).
% 1.83/2.03 dependent: set(anl_eq).
% 1.83/2.03 dependent: set(para_from).
% 1.83/2.03 dependent: set(para_into).
% 1.83/2.03 dependent: clear(para_from_right).
% 1.83/2.03 dependent: clear(para_into_right).
% 1.83/2.03 dependent: set(para_from_vars).
% 1.83/2.03 dependent: set(eq_units_both_ways).
% 1.83/2.03 dependent: set(dynamic_demod_all).
% 1.83/2.03 dependent: set(dynamic_demod).
% 1.83/2.03 dependent: set(order_eq).
% 1.83/2.03 dependent: set(back_demod).
% 1.83/2.03 dependent: set(lrpo).
% 1.83/2.03 dependent: set(hyper_res).
% 1.83/2.03 dependent: set(unit_deletion).
% 1.83/2.03 dependent: set(factor).
% 1.83/2.03
% 1.83/2.03 ------------> process usable:
% 1.83/2.03 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.83/2.03 ** KEPT (pick-wt=4): 2 [] -empty(A)|function(A).
% 1.83/2.03 ** KEPT (pick-wt=8): 3 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 1.83/2.03 ** KEPT (pick-wt=11): 5 [copy,4,flip.2] -relation(A)|set_intersection2(A,cartesian_product2(B,B))=relation_restriction(A,B).
% 1.83/2.03 ** KEPT (pick-wt=6): 6 [] -relation(A)|relation(relation_restriction(A,B)).
% 1.83/2.03 ** KEPT (pick-wt=4): 7 [] -empty(ordered_pair(A,B)).
% 1.83/2.03 ** KEPT (pick-wt=19): 8 [] -relation(A)| -transitive(A)| -in(ordered_pair(B,C),A)| -in(ordered_pair(C,D),A)|in(ordered_pair(B,D),A).
% 1.83/2.03 ** KEPT (pick-wt=11): 9 [] -relation(A)|transitive(A)|in(ordered_pair($f4(A),$f3(A)),A).
% 1.83/2.03 ** KEPT (pick-wt=11): 10 [] -relation(A)|transitive(A)|in(ordered_pair($f3(A),$f2(A)),A).
% 1.83/2.03 ** KEPT (pick-wt=11): 11 [] -relation(A)|transitive(A)| -in(ordered_pair($f4(A),$f2(A)),A).
% 1.83/2.03 ** KEPT (pick-wt=2): 12 [] -empty($c4).
% 1.83/2.03 ** KEPT (pick-wt=10): 13 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(A,C).
% 1.83/2.03 ** KEPT (pick-wt=10): 14 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(B,D).
% 1.83/2.03 ** KEPT (pick-wt=13): 15 [] in(ordered_pair(A,B),cartesian_product2(C,D))| -in(A,C)| -in(B,D).
% 1.83/2.03 ** KEPT (pick-wt=10): 16 [] -relation(A)| -in(B,relation_restriction(A,C))|in(B,A).
% 1.83/2.03 ** KEPT (pick-wt=12): 17 [] -relation(A)| -in(B,relation_restriction(A,C))|in(B,cartesian_product2(C,C)).
% 1.83/2.03 ** KEPT (pick-wt=15): 18 [] -relation(A)|in(B,relation_restriction(A,C))| -in(B,A)| -in(B,cartesian_product2(C,C)).
% 1.83/2.03 ** KEPT (pick-wt=6): 19 [] -in(A,B)|element(A,B).
% 1.83/2.03 ** KEPT (pick-wt=4): 20 [] -transitive(relation_restriction($c6,$c7)).
% 1.83/2.03 ** KEPT (pick-wt=8): 21 [] -element(A,B)|empty(B)|in(A,B).
% 1.83/2.03 ** KEPT (pick-wt=5): 22 [] -empty(A)|A=empty_set.
% 1.83/2.03 ** KEPT (pick-wt=5): 23 [] -in(A,B)| -empty(B).
% 1.83/2.03 ** KEPT (pick-wt=7): 24 [] -empty(A)|A=B| -empty(B).
% 1.83/2.03
% 1.83/2.03 ------------> process sos:
% 1.83/2.03 ** KEPT (pick-wt=3): 29 [] A=A.
% 1.83/2.03 ** KEPT (pick-wt=7): 30 [] unordered_pair(A,B)=unordered_pair(B,A).
% 1.83/2.03 ** KEPT (pick-wt=7): 31 [] set_intersection2(A,B)=set_intersection2(B,A).
% 1.83/2.03 ** KEPT (pick-wt=10): 33 [copy,32,flip.1] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 1.83/2.03 ---> New Demodulator: 34 [new_demod,33] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 1.83/2.03 ** KEPT (pick-wt=4): 35 [] element($f1(A),A).
% 1.83/2.03 ** KEPT (pick-wt=2): 36 [] empty(empty_set).
% 1.83/2.03 ** KEPT (pick-wt=5): 37 [] set_intersection2(A,A)=A.
% 1.83/2.03 ---> New Demodulator: 38 [new_demod,37] set_intersection2(A,A)=A.
% 1.83/2.03 ** KEPT (pick-wt=2): 39 [] relation($c1).
% 1.83/2.03 ** KEPT (pick-wt=2): 40 [] function($c1).
% 1.83/2.03 ** KEPT (pick-wt=2): 41 [] empty($c2).
% 1.83/2.03 ** KEPT (pick-wt=2): 42 [] relation($c3).
% 1.83/2.03 ** KEPT (pick-wt=2): 43 [] empty($c3).
% 1.83/2.03 ** KEPT (pick-wt=2): 44 [] function($c3).
% 1.83/2.03 ** KEPT (pick-wt=2): 45 [] relation($c5).
% 1.83/2.03 ** KEPT (pick-wt=2): 46 [] function($c5).
% 1.83/2.03 ** KEPT (pick-wt=2): 47 [] one_to_one($c5).
% 1.83/2.03 ** KEPT (pick-wt=2): 48 [] relation($c6).
% 1.83/2.03 ** KEPT (pick-wt=2): 49 [] transitive($c6).
% 1.83/2.03 ** KEPT (pick-wt=5): 50 [] set_intersection2(A,empty_set)=empty_set.
% 1.83/2.03 ---> New Demodulator: 51 [new_demod,50] set_intersection2(A,empty_set)=empty_set.
% 1.83/2.03 Following clause subsumed by 29 during input processing: 0 [copy,29,flip.1] A=A.
% 1.83/2.03 29 back subsumes 28.
% 1.83/2.03 Following clause subsumed by 30 during input processing: 0 [copy,30,flip.1] unordered_pair(A,B)=unordered_pair(B,A).
% 1.83/2.03 Following clause subsumed by 31 during input processing: 0 [copy,31,flip.1] set_intersection2(A,B)=set_intersection2(B,A).
% 1.83/2.03 >>>> Starting back demodulation with 34.
% 15.67/15.84 >>>> Starting back demodulation with 38.
% 15.67/15.84 >>>> Starting back demodulation with 51.
% 15.67/15.84
% 15.67/15.84 ======= end of input processing =======
% 15.67/15.84
% 15.67/15.84 =========== start of search ===========
% 15.67/15.84
% 15.67/15.84
% 15.67/15.84 Resetting weight limit to 9.
% 15.67/15.84
% 15.67/15.84
% 15.67/15.84 Resetting weight limit to 9.
% 15.67/15.84
% 15.67/15.84 sos_size=842
% 15.67/15.84
% 15.67/15.84 Search stopped because sos empty.
% 15.67/15.84
% 15.67/15.84
% 15.67/15.84 Search stopped because sos empty.
% 15.67/15.84
% 15.67/15.84 ============ end of search ============
% 15.67/15.84
% 15.67/15.84 -------------- statistics -------------
% 15.67/15.84 clauses given 1080
% 15.67/15.84 clauses generated 993043
% 15.67/15.84 clauses kept 1179
% 15.67/15.84 clauses forward subsumed 7881
% 15.67/15.84 clauses back subsumed 66
% 15.67/15.84 Kbytes malloced 6835
% 15.67/15.84
% 15.67/15.84 ----------- times (seconds) -----------
% 15.67/15.84 user CPU time 13.81 (0 hr, 0 min, 13 sec)
% 15.67/15.84 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 15.67/15.84 wall-clock time 15 (0 hr, 0 min, 15 sec)
% 15.67/15.84
% 15.67/15.84 Process 18991 finished Wed Jul 27 07:49:08 2022
% 15.67/15.84 Otter interrupted
% 15.67/15.84 PROOF NOT FOUND
%------------------------------------------------------------------------------