%------------------------------------------------------------------------------ % File : Otter---3.3 % Problem : NUM381+1 : TPTP v8.1.0. Released v3.2.0. % Transfm : none % Format : tptp:raw % Command : otter-tptp-script %s % Computer : n023.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:08:13 EDT 2022 % Result : Unknown 3.81s 3.98s % Output : None % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.11 % Problem : NUM381+1 : TPTP v8.1.0. Released v3.2.0. % 0.11/0.12 % Command : otter-tptp-script %s % 0.12/0.33 % Computer : n023.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 10:08:48 EDT 2022 % 0.12/0.33 % CPUTime : % 2.06/2.25 ----- Otter 3.3f, August 2004 ----- % 2.06/2.25 The process was started by sandbox on n023.cluster.edu, % 2.06/2.25 Wed Jul 27 10:08:48 2022 % 2.06/2.25 The command was "./otter". The process ID is 13791. % 2.06/2.25 % 2.06/2.25 set(prolog_style_variables). % 2.06/2.25 set(auto). % 2.06/2.25 dependent: set(auto1). % 2.06/2.25 dependent: set(process_input). % 2.06/2.25 dependent: clear(print_kept). % 2.06/2.25 dependent: clear(print_new_demod). % 2.06/2.25 dependent: clear(print_back_demod). % 2.06/2.25 dependent: clear(print_back_sub). % 2.06/2.25 dependent: set(control_memory). % 2.06/2.25 dependent: assign(max_mem, 12000). % 2.06/2.25 dependent: assign(pick_given_ratio, 4). % 2.06/2.25 dependent: assign(stats_level, 1). % 2.06/2.25 dependent: assign(max_seconds, 10800). % 2.06/2.25 clear(print_given). % 2.06/2.25 % 2.06/2.25 formula_list(usable). % 2.06/2.25 all A (A=A). % 2.06/2.25 all A B (in(A,B)-> -in(B,A)). % 2.06/2.25 all A (empty(A)->function(A)). % 2.06/2.25 all A (empty(A)->relation(A)). % 2.06/2.25 all A (relation(A)&empty(A)&function(A)->relation(A)&function(A)&one_to_one(A)). % 2.06/2.25 all A B C D E F (F=unordered_quintuple(A,B,C,D,E)<-> (all G (in(G,F)<-> -(G!=A&G!=B&G!=C&G!=D&G!=E)))). % 2.06/2.25 all A exists B element(B,A). % 2.06/2.25 empty(empty_set). % 2.06/2.25 relation(empty_set). % 2.06/2.25 relation_empty_yielding(empty_set). % 2.06/2.25 empty(empty_set). % 2.06/2.25 empty(empty_set). % 2.06/2.25 relation(empty_set). % 2.06/2.25 exists A (relation(A)&function(A)). % 2.06/2.25 exists A (empty(A)&relation(A)). % 2.06/2.25 exists A empty(A). % 2.06/2.25 exists A (relation(A)&empty(A)&function(A)). % 2.06/2.25 exists A (-empty(A)&relation(A)). % 2.06/2.25 exists A (-empty(A)). % 2.06/2.25 exists A (relation(A)&function(A)&one_to_one(A)). % 2.06/2.25 exists A (relation(A)&relation_empty_yielding(A)). % 2.06/2.25 exists A (relation(A)&relation_empty_yielding(A)&function(A)). % 2.06/2.25 exists A (relation(A)&relation_non_empty(A)&function(A)). % 2.06/2.25 all A B (in(A,B)->element(A,B)). % 2.06/2.25 all A B (element(A,B)->empty(B)|in(A,B)). % 2.06/2.25 -(all A B C D E (-(in(A,B)&in(B,C)&in(C,D)&in(D,E)&in(E,A)))). % 2.06/2.25 all A (empty(A)->A=empty_set). % 2.06/2.25 all A B (-(in(A,B)&empty(B))). % 2.06/2.25 all A B (-(in(A,B)& (all C (-(in(C,B)& (all D (-(in(D,B)&in(D,C))))))))). % 2.06/2.25 all A B (-(empty(A)&A!=B&empty(B))). % 2.06/2.25 end_of_list. % 2.06/2.25 % 2.06/2.25 -------> usable clausifies to: % 2.06/2.25 % 2.06/2.25 list(usable). % 2.06/2.25 0 [] A=A. % 2.06/2.25 0 [] -in(A,B)| -in(B,A). % 2.06/2.25 0 [] -empty(A)|function(A). % 2.06/2.25 0 [] -empty(A)|relation(A). % 2.06/2.25 0 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A). % 2.06/2.25 0 [] F!=unordered_quintuple(A,B,C,D,E)| -in(G,F)|G=A|G=B|G=C|G=D|G=E. % 2.06/2.25 0 [] F!=unordered_quintuple(A,B,C,D,E)|in(G,F)|G!=A. % 2.06/2.25 0 [] F!=unordered_quintuple(A,B,C,D,E)|in(G,F)|G!=B. % 2.06/2.25 0 [] F!=unordered_quintuple(A,B,C,D,E)|in(G,F)|G!=C. % 2.06/2.25 0 [] F!=unordered_quintuple(A,B,C,D,E)|in(G,F)|G!=D. % 2.06/2.25 0 [] F!=unordered_quintuple(A,B,C,D,E)|in(G,F)|G!=E. % 2.06/2.25 0 [] F=unordered_quintuple(A,B,C,D,E)|in($f1(A,B,C,D,E,F),F)|$f1(A,B,C,D,E,F)=A|$f1(A,B,C,D,E,F)=B|$f1(A,B,C,D,E,F)=C|$f1(A,B,C,D,E,F)=D|$f1(A,B,C,D,E,F)=E. % 2.06/2.25 0 [] F=unordered_quintuple(A,B,C,D,E)| -in($f1(A,B,C,D,E,F),F)|$f1(A,B,C,D,E,F)!=A. % 2.06/2.25 0 [] F=unordered_quintuple(A,B,C,D,E)| -in($f1(A,B,C,D,E,F),F)|$f1(A,B,C,D,E,F)!=B. % 2.06/2.25 0 [] F=unordered_quintuple(A,B,C,D,E)| -in($f1(A,B,C,D,E,F),F)|$f1(A,B,C,D,E,F)!=C. % 2.06/2.25 0 [] F=unordered_quintuple(A,B,C,D,E)| -in($f1(A,B,C,D,E,F),F)|$f1(A,B,C,D,E,F)!=D. % 2.06/2.25 0 [] F=unordered_quintuple(A,B,C,D,E)| -in($f1(A,B,C,D,E,F),F)|$f1(A,B,C,D,E,F)!=E. % 2.06/2.25 0 [] element($f2(A),A). % 2.06/2.25 0 [] empty(empty_set). % 2.06/2.25 0 [] relation(empty_set). % 2.06/2.25 0 [] relation_empty_yielding(empty_set). % 2.06/2.25 0 [] empty(empty_set). % 2.06/2.25 0 [] empty(empty_set). % 2.06/2.25 0 [] relation(empty_set). % 2.06/2.25 0 [] relation($c1). % 2.06/2.25 0 [] function($c1). % 2.06/2.25 0 [] empty($c2). % 2.06/2.25 0 [] relation($c2). % 2.06/2.25 0 [] empty($c3). % 2.06/2.25 0 [] relation($c4). % 2.06/2.25 0 [] empty($c4). % 2.06/2.25 0 [] function($c4). % 2.06/2.25 0 [] -empty($c5). % 2.06/2.25 0 [] relation($c5). % 2.06/2.25 0 [] -empty($c6). % 2.06/2.25 0 [] relation($c7). % 2.06/2.25 0 [] function($c7). % 2.06/2.25 0 [] one_to_one($c7). % 2.06/2.25 0 [] relation($c8). % 2.06/2.25 0 [] relation_empty_yielding($c8). % 2.06/2.25 0 [] relation($c9). % 2.06/2.25 0 [] relation_empty_yielding($c9). % 2.06/2.25 0 [] function($c9). % 2.06/2.25 0 [] relation($c10). % 2.06/2.25 0 [] relation_non_empty($c10). % 2.06/2.25 0 [] function($c10). % 2.06/2.25 0 [] -in(A,B)|element(A,B). % 2.06/2.25 0 [] -element(A,B)|empty(B)|in(A,B). % 2.06/2.25 0 [] in($c15,$c14). % 2.06/2.25 0 [] in($c14,$c13). % 2.06/2.25 0 [] in($c13,$c12). % 2.06/2.25 0 [] in($c12,$c11). % 2.06/2.25 0 [] in($c11,$c15). % 2.06/2.25 0 [] -empty(A)|A=empty_set. % 2.06/2.25 0 [] -in(A,B)| -empty(B). % 2.06/2.25 0 [] -in(A,B)|in($f3(A,B),B). % 2.06/2.25 0 [] -in(A,B)| -in(D,B)| -in(D,$f3(A,B)). % 2.06/2.25 0 [] -empty(A)|A=B| -empty(B). % 2.06/2.25 end_of_list. % 2.06/2.25 % 2.06/2.25 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7. % 2.06/2.25 % 2.06/2.25 This ia a non-Horn set with equality. The strategy will be % 2.06/2.25 Knuth-Bendix, ordered hyper_res, factoring, and unit % 2.06/2.26 deletion, with positive clauses in sos and nonpositive % 2.06/2.26 clauses in usable. % 2.06/2.26 % 2.06/2.26 dependent: set(knuth_bendix). % 2.06/2.26 dependent: set(anl_eq). % 2.06/2.26 dependent: set(para_from). % 2.06/2.26 dependent: set(para_into). % 2.06/2.26 dependent: clear(para_from_right). % 2.06/2.26 dependent: clear(para_into_right). % 2.06/2.26 dependent: set(para_from_vars). % 2.06/2.26 dependent: set(eq_units_both_ways). % 2.06/2.26 dependent: set(dynamic_demod_all). % 2.06/2.26 dependent: set(dynamic_demod). % 2.06/2.26 dependent: set(order_eq). % 2.06/2.26 dependent: set(back_demod). % 2.06/2.26 dependent: set(lrpo). % 2.06/2.26 dependent: set(hyper_res). % 2.06/2.26 dependent: set(unit_deletion). % 2.06/2.26 dependent: set(factor). % 2.06/2.26 % 2.06/2.26 ------------> process usable: % 2.06/2.26 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A). % 2.06/2.26 ** KEPT (pick-wt=4): 2 [] -empty(A)|function(A). % 2.06/2.26 ** KEPT (pick-wt=4): 3 [] -empty(A)|relation(A). % 2.06/2.26 ** KEPT (pick-wt=8): 4 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A). % 2.06/2.26 ** KEPT (pick-wt=26): 5 [] A!=unordered_quintuple(B,C,D,E,F)| -in(G,A)|G=B|G=C|G=D|G=E|G=F. % 2.06/2.26 ** KEPT (pick-wt=14): 6 [] A!=unordered_quintuple(B,C,D,E,F)|in(G,A)|G!=B. % 2.06/2.26 ** KEPT (pick-wt=14): 7 [] A!=unordered_quintuple(B,C,D,E,F)|in(G,A)|G!=C. % 2.06/2.26 ** KEPT (pick-wt=14): 8 [] A!=unordered_quintuple(B,C,D,E,F)|in(G,A)|G!=D. % 2.06/2.26 ** KEPT (pick-wt=14): 9 [] A!=unordered_quintuple(B,C,D,E,F)|in(G,A)|G!=E. % 2.06/2.26 ** KEPT (pick-wt=14): 10 [] A!=unordered_quintuple(B,C,D,E,F)|in(G,A)|G!=F. % 2.06/2.26 ** KEPT (pick-wt=26): 11 [] A=unordered_quintuple(B,C,D,E,F)| -in($f1(B,C,D,E,F,A),A)|$f1(B,C,D,E,F,A)!=B. % 2.06/2.26 ** KEPT (pick-wt=26): 12 [] A=unordered_quintuple(B,C,D,E,F)| -in($f1(B,C,D,E,F,A),A)|$f1(B,C,D,E,F,A)!=C. % 2.06/2.26 ** KEPT (pick-wt=26): 13 [] A=unordered_quintuple(B,C,D,E,F)| -in($f1(B,C,D,E,F,A),A)|$f1(B,C,D,E,F,A)!=D. % 2.06/2.26 ** KEPT (pick-wt=26): 14 [] A=unordered_quintuple(B,C,D,E,F)| -in($f1(B,C,D,E,F,A),A)|$f1(B,C,D,E,F,A)!=E. % 2.06/2.26 ** KEPT (pick-wt=26): 15 [] A=unordered_quintuple(B,C,D,E,F)| -in($f1(B,C,D,E,F,A),A)|$f1(B,C,D,E,F,A)!=F. % 2.06/2.26 ** KEPT (pick-wt=2): 16 [] -empty($c5). % 2.06/2.26 ** KEPT (pick-wt=2): 17 [] -empty($c6). % 2.06/2.26 ** KEPT (pick-wt=6): 18 [] -in(A,B)|element(A,B). % 2.06/2.26 ** KEPT (pick-wt=8): 19 [] -element(A,B)|empty(B)|in(A,B). % 2.06/2.26 ** KEPT (pick-wt=5): 20 [] -empty(A)|A=empty_set. % 2.06/2.26 ** KEPT (pick-wt=5): 21 [] -in(A,B)| -empty(B). % 2.06/2.26 ** KEPT (pick-wt=8): 22 [] -in(A,B)|in($f3(A,B),B). % 2.06/2.26 ** KEPT (pick-wt=11): 23 [] -in(A,B)| -in(C,B)| -in(C,$f3(A,B)). % 2.06/2.26 ** KEPT (pick-wt=7): 24 [] -empty(A)|A=B| -empty(B). % 2.06/2.26 % 2.06/2.26 ------------> process sos: % 2.06/2.26 ** KEPT (pick-wt=3): 79 [] A=A. % 2.06/2.26 ** KEPT (pick-wt=62): 80 [] A=unordered_quintuple(B,C,D,E,F)|in($f1(B,C,D,E,F,A),A)|$f1(B,C,D,E,F,A)=B|$f1(B,C,D,E,F,A)=C|$f1(B,C,D,E,F,A)=D|$f1(B,C,D,E,F,A)=E|$f1(B,C,D,E,F,A)=F. % 2.06/2.26 ** KEPT (pick-wt=4): 81 [] element($f2(A),A). % 2.06/2.26 ** KEPT (pick-wt=2): 82 [] empty(empty_set). % 2.06/2.26 ** KEPT (pick-wt=2): 83 [] relation(empty_set). % 2.06/2.26 ** KEPT (pick-wt=2): 84 [] relation_empty_yielding(empty_set). % 2.06/2.26 Following clause subsumed by 82 during input processing: 0 [] empty(empty_set). % 2.06/2.26 Following clause subsumed by 82 during input processing: 0 [] empty(empty_set). % 2.06/2.26 Following clause subsumed by 83 during input processing: 0 [] relation(empty_set). % 2.06/2.26 ** KEPT (pick-wt=2): 85 [] relation($c1). % 2.06/2.26 ** KEPT (pick-wt=2): 86 [] function($c1). % 2.06/2.26 ** KEPT (pick-wt=2): 87 [] empty($c2). % 2.06/2.26 ** KEPT (pick-wt=2): 88 [] relation($c2). % 2.06/2.26 ** KEPT (pick-wt=2): 89 [] empty($c3). % 2.06/2.26 ** KEPT (pick-wt=2): 90 [] relation($c4). % 2.06/2.26 ** KEPT (pick-wt=2): 91 [] empty($c4). % 2.06/2.26 ** KEPT (pick-wt=2): 92 [] function($c4). % 2.06/2.26 ** KEPT (pick-wt=2): 93 [] relation($c5). % 2.06/2.26 ** KEPT (pick-wt=2): 94 [] relation($c7). % 2.06/2.26 ** KEPT (pick-wt=2): 95 [] function($c7). % 2.06/2.26 ** KEPT (pick-wt=2): 96 [] one_to_one($c7). % 2.06/2.26 ** KEPT (pick-wt=2): 97 [] relation($c8). % 2.06/2.26 ** KEPT (pick-wt=2): 98 [] relation_empty_yielding($c8). % 2.06/2.26 ** KEPT (pick-wt=2): 99 [] relation($c9). % 2.06/2.26 ** KEPT (pick-wt=2): 100 [] relation_empty_yielding($c9). % 2.06/2.26 ** KEPT (pick-wt=2): 101 [] function($c9). % 2.06/2.26 ** KEPT (pick-wt=2): 102 [] relation($c10). % 2.06/2.26 ** KEPT (pick-wt=2): 103 [] relation_non_empty($c10). % 2.06/2.26 ** KEPT (pick-wt=2): 104 [] function($c10). % 2.06/2.26 ** KEPT (pick-wt=3): 105 [] in($c15,$c14). % 2.06/2.26 ** KEPT (pick-wt=3): 106 [] in($c14,$c13). % 2.06/2.26 ** KEPT (pick-wt=3): 107 [] in($c13,$c12). % 2.06/2.26 ** KEPT (pick-wt=3): 108 [] in($c12,$c11). % 2.06/2.26 ** KEPT (pick-wt=3): 109 [] in($c11,$c15). % 3.81/3.98 Following clause subsumed by 79 during input processing: 0 [copy,79,flip.1] A=A. % 3.81/3.98 79 back subsumes 37. % 3.81/3.98 % 3.81/3.98 ======= end of input processing ======= % 3.81/3.98 % 3.81/3.98 =========== start of search =========== % 3.81/3.98 % 3.81/3.98 Search stopped in tp_alloc by max_mem option. % 3.81/3.98 % 3.81/3.98 Search stopped in tp_alloc by max_mem option. % 3.81/3.98 % 3.81/3.98 ============ end of search ============ % 3.81/3.98 % 3.81/3.98 -------------- statistics ------------- % 3.81/3.98 clauses given 6 % 3.81/3.98 clauses generated 9685 % 3.81/3.98 clauses kept 4760 % 3.81/3.98 clauses forward subsumed 4982 % 3.81/3.98 clauses back subsumed 1 % 3.81/3.98 Kbytes malloced 11718 % 3.81/3.98 % 3.81/3.98 ----------- times (seconds) ----------- % 3.81/3.98 user CPU time 1.73 (0 hr, 0 min, 1 sec) % 3.81/3.98 system CPU time 0.01 (0 hr, 0 min, 0 sec) % 3.81/3.98 wall-clock time 3 (0 hr, 0 min, 3 sec) % 3.81/3.98 % 3.81/3.98 Process 13791 finished Wed Jul 27 10:08:51 2022 % 3.81/3.98 Otter interrupted % 3.81/3.98 PROOF NOT FOUND %------------------------------------------------------------------------------