%------------------------------------------------------------------------------ % File : Otter---3.3 % Problem : NUM401+1 : TPTP v8.1.0. Released v3.2.0. % Transfm : none % Format : tptp:raw % Command : otter-tptp-script %s % Computer : n006.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:14 EDT 2022 % Result : Timeout 299.93s 300.06s % Output : None % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : NUM401+1 : TPTP v8.1.0. Released v3.2.0. % 0.03/0.12 % Command : otter-tptp-script %s % 0.13/0.33 % Computer : n006.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 300 % 0.13/0.33 % DateTime : Wed Jul 27 09:51:46 EDT 2022 % 0.13/0.33 % CPUTime : % 2.18/2.37 ----- Otter 3.3f, August 2004 ----- % 2.18/2.37 The process was started by sandbox on n006.cluster.edu, % 2.18/2.37 Wed Jul 27 09:51:47 2022 % 2.18/2.37 The command was "./otter". The process ID is 486. % 2.18/2.37 % 2.18/2.37 set(prolog_style_variables). % 2.18/2.37 set(auto). % 2.18/2.37 dependent: set(auto1). % 2.18/2.37 dependent: set(process_input). % 2.18/2.37 dependent: clear(print_kept). % 2.18/2.37 dependent: clear(print_new_demod). % 2.18/2.37 dependent: clear(print_back_demod). % 2.18/2.37 dependent: clear(print_back_sub). % 2.18/2.37 dependent: set(control_memory). % 2.18/2.37 dependent: assign(max_mem, 12000). % 2.18/2.37 dependent: assign(pick_given_ratio, 4). % 2.18/2.37 dependent: assign(stats_level, 1). % 2.18/2.37 dependent: assign(max_seconds, 10800). % 2.18/2.37 clear(print_given). % 2.18/2.37 % 2.18/2.37 formula_list(usable). % 2.18/2.37 all A (A=A). % 2.18/2.37 all A B (in(A,B)-> -in(B,A)). % 2.18/2.37 all A (empty(A)->function(A)). % 2.18/2.37 all A (ordinal(A)->epsilon_transitive(A)&epsilon_connected(A)). % 2.18/2.37 all A (empty(A)->relation(A)). % 2.18/2.37 all A (relation(A)&empty(A)&function(A)->relation(A)&function(A)&one_to_one(A)). % 2.18/2.37 all A (epsilon_transitive(A)&epsilon_connected(A)->ordinal(A)). % 2.18/2.37 all A (empty(A)->epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)). % 2.18/2.37 all A B (set_union2(A,B)=set_union2(B,A)). % 2.18/2.37 all A B (ordinal(A)&ordinal(B)->ordinal_subset(A,B)|ordinal_subset(B,A)). % 2.18/2.37 all A B (A=B<->subset(A,B)&subset(B,A)). % 2.18/2.37 all A (succ(A)=set_union2(A,singleton(A))). % 2.18/2.37 all A B (B=singleton(A)<-> (all C (in(C,B)<->C=A))). % 2.18/2.37 all A (epsilon_transitive(A)<-> (all B (in(B,A)->subset(B,A)))). % 2.18/2.37 all A B C (C=set_union2(A,B)<-> (all D (in(D,C)<->in(D,A)|in(D,B)))). % 2.18/2.37 all A exists B element(B,A). % 2.18/2.37 empty(empty_set). % 2.18/2.37 relation(empty_set). % 2.18/2.37 relation_empty_yielding(empty_set). % 2.18/2.37 all A (-empty(succ(A))). % 2.18/2.37 empty(empty_set). % 2.18/2.37 relation(empty_set). % 2.18/2.37 relation_empty_yielding(empty_set). % 2.18/2.37 function(empty_set). % 2.18/2.37 one_to_one(empty_set). % 2.18/2.37 empty(empty_set). % 2.18/2.37 epsilon_transitive(empty_set). % 2.18/2.37 epsilon_connected(empty_set). % 2.18/2.37 ordinal(empty_set). % 2.18/2.37 all A B (relation(A)&relation(B)->relation(set_union2(A,B))). % 2.18/2.37 all A B (-empty(A)-> -empty(set_union2(A,B))). % 2.18/2.37 all A (ordinal(A)-> -empty(succ(A))&epsilon_transitive(succ(A))&epsilon_connected(succ(A))&ordinal(succ(A))). % 2.18/2.37 all A B (-empty(A)-> -empty(set_union2(B,A))). % 2.18/2.37 empty(empty_set). % 2.18/2.37 relation(empty_set). % 2.18/2.37 all A B (set_union2(A,A)=A). % 2.18/2.37 exists A (relation(A)&function(A)). % 2.18/2.37 exists A (epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)). % 2.18/2.37 exists A (empty(A)&relation(A)). % 2.18/2.37 exists A empty(A). % 2.18/2.37 exists A (relation(A)&empty(A)&function(A)). % 2.18/2.37 exists A (relation(A)&function(A)&one_to_one(A)&empty(A)&epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)). % 2.18/2.37 exists A (-empty(A)&relation(A)). % 2.18/2.37 exists A (-empty(A)). % 2.18/2.37 exists A (relation(A)&function(A)&one_to_one(A)). % 2.18/2.37 exists A (-empty(A)&epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)). % 2.18/2.37 exists A (relation(A)&relation_empty_yielding(A)). % 2.18/2.37 exists A (relation(A)&relation_empty_yielding(A)&function(A)). % 2.18/2.37 exists A (relation(A)&relation_non_empty(A)&function(A)). % 2.18/2.37 all A B (ordinal(A)&ordinal(B)-> (ordinal_subset(A,B)<->subset(A,B))). % 2.18/2.37 all A B (ordinal(A)&ordinal(B)->ordinal_subset(A,A)). % 2.18/2.37 all A B subset(A,A). % 2.18/2.37 all A in(A,succ(A)). % 2.18/2.37 all A (A!=succ(A)). % 2.18/2.37 all A (set_union2(A,empty_set)=A). % 2.18/2.37 all A B (in(A,B)->element(A,B)). % 2.18/2.37 all A (ordinal(A)-> (all B (ordinal(B)-> -(-in(A,B)&A!=B& -in(B,A))))). % 2.18/2.37 all A B (element(A,B)->empty(B)|in(A,B)). % 2.18/2.37 -(all A (ordinal(A)-> (all B (ordinal(B)-> (in(A,succ(B))<->ordinal_subset(A,B)))))). % 2.18/2.37 all A B (element(A,powerset(B))<->subset(A,B)). % 2.18/2.37 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)). % 2.18/2.37 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))). % 2.18/2.37 all A (empty(A)->A=empty_set). % 2.18/2.37 all A B (-(in(A,B)&empty(B))). % 2.18/2.37 all A B (-(empty(A)&A!=B&empty(B))). % 2.18/2.37 end_of_list. % 2.18/2.37 % 2.18/2.37 -------> usable clausifies to: % 2.18/2.37 % 2.18/2.37 list(usable). % 2.18/2.37 0 [] A=A. % 2.18/2.37 0 [] -in(A,B)| -in(B,A). % 2.18/2.37 0 [] -empty(A)|function(A). % 2.18/2.37 0 [] -ordinal(A)|epsilon_transitive(A). % 2.18/2.37 0 [] -ordinal(A)|epsilon_connected(A). % 2.18/2.37 0 [] -empty(A)|relation(A). % 2.18/2.37 0 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A). % 2.18/2.37 0 [] -epsilon_transitive(A)| -epsilon_connected(A)|ordinal(A). % 2.18/2.37 0 [] -empty(A)|epsilon_transitive(A). % 2.18/2.37 0 [] -empty(A)|epsilon_connected(A). % 2.18/2.37 0 [] -empty(A)|ordinal(A). % 2.18/2.37 0 [] set_union2(A,B)=set_union2(B,A). % 2.18/2.37 0 [] -ordinal(A)| -ordinal(B)|ordinal_subset(A,B)|ordinal_subset(B,A). % 2.18/2.37 0 [] A!=B|subset(A,B). % 2.18/2.37 0 [] A!=B|subset(B,A). % 2.18/2.37 0 [] A=B| -subset(A,B)| -subset(B,A). % 2.18/2.37 0 [] succ(A)=set_union2(A,singleton(A)). % 2.18/2.37 0 [] B!=singleton(A)| -in(C,B)|C=A. % 2.18/2.37 0 [] B!=singleton(A)|in(C,B)|C!=A. % 2.18/2.37 0 [] B=singleton(A)|in($f1(A,B),B)|$f1(A,B)=A. % 2.18/2.37 0 [] B=singleton(A)| -in($f1(A,B),B)|$f1(A,B)!=A. % 2.18/2.37 0 [] -epsilon_transitive(A)| -in(B,A)|subset(B,A). % 2.18/2.37 0 [] epsilon_transitive(A)|in($f2(A),A). % 2.18/2.37 0 [] epsilon_transitive(A)| -subset($f2(A),A). % 2.18/2.37 0 [] C!=set_union2(A,B)| -in(D,C)|in(D,A)|in(D,B). % 2.18/2.37 0 [] C!=set_union2(A,B)|in(D,C)| -in(D,A). % 2.18/2.37 0 [] C!=set_union2(A,B)|in(D,C)| -in(D,B). % 2.18/2.37 0 [] C=set_union2(A,B)|in($f3(A,B,C),C)|in($f3(A,B,C),A)|in($f3(A,B,C),B). % 2.18/2.37 0 [] C=set_union2(A,B)| -in($f3(A,B,C),C)| -in($f3(A,B,C),A). % 2.18/2.37 0 [] C=set_union2(A,B)| -in($f3(A,B,C),C)| -in($f3(A,B,C),B). % 2.18/2.37 0 [] element($f4(A),A). % 2.18/2.37 0 [] empty(empty_set). % 2.18/2.37 0 [] relation(empty_set). % 2.18/2.37 0 [] relation_empty_yielding(empty_set). % 2.18/2.37 0 [] -empty(succ(A)). % 2.18/2.37 0 [] empty(empty_set). % 2.18/2.37 0 [] relation(empty_set). % 2.18/2.37 0 [] relation_empty_yielding(empty_set). % 2.18/2.37 0 [] function(empty_set). % 2.18/2.37 0 [] one_to_one(empty_set). % 2.18/2.37 0 [] empty(empty_set). % 2.18/2.37 0 [] epsilon_transitive(empty_set). % 2.18/2.37 0 [] epsilon_connected(empty_set). % 2.18/2.37 0 [] ordinal(empty_set). % 2.18/2.37 0 [] -relation(A)| -relation(B)|relation(set_union2(A,B)). % 2.18/2.37 0 [] empty(A)| -empty(set_union2(A,B)). % 2.18/2.37 0 [] -ordinal(A)| -empty(succ(A)). % 2.18/2.37 0 [] -ordinal(A)|epsilon_transitive(succ(A)). % 2.18/2.37 0 [] -ordinal(A)|epsilon_connected(succ(A)). % 2.18/2.37 0 [] -ordinal(A)|ordinal(succ(A)). % 2.18/2.37 0 [] empty(A)| -empty(set_union2(B,A)). % 2.18/2.37 0 [] empty(empty_set). % 2.18/2.37 0 [] relation(empty_set). % 2.18/2.37 0 [] set_union2(A,A)=A. % 2.18/2.37 0 [] relation($c1). % 2.18/2.37 0 [] function($c1). % 2.18/2.37 0 [] epsilon_transitive($c2). % 2.18/2.37 0 [] epsilon_connected($c2). % 2.18/2.37 0 [] ordinal($c2). % 2.18/2.37 0 [] empty($c3). % 2.18/2.37 0 [] relation($c3). % 2.18/2.37 0 [] empty($c4). % 2.18/2.37 0 [] relation($c5). % 2.18/2.37 0 [] empty($c5). % 2.18/2.37 0 [] function($c5). % 2.18/2.37 0 [] relation($c6). % 2.18/2.37 0 [] function($c6). % 2.18/2.37 0 [] one_to_one($c6). % 2.18/2.37 0 [] empty($c6). % 2.18/2.37 0 [] epsilon_transitive($c6). % 2.18/2.37 0 [] epsilon_connected($c6). % 2.18/2.37 0 [] ordinal($c6). % 2.18/2.37 0 [] -empty($c7). % 2.18/2.37 0 [] relation($c7). % 2.18/2.37 0 [] -empty($c8). % 2.18/2.37 0 [] relation($c9). % 2.18/2.37 0 [] function($c9). % 2.18/2.37 0 [] one_to_one($c9). % 2.18/2.37 0 [] -empty($c10). % 2.18/2.37 0 [] epsilon_transitive($c10). % 2.18/2.37 0 [] epsilon_connected($c10). % 2.18/2.37 0 [] ordinal($c10). % 2.18/2.37 0 [] relation($c11). % 2.18/2.37 0 [] relation_empty_yielding($c11). % 2.18/2.37 0 [] relation($c12). % 2.18/2.37 0 [] relation_empty_yielding($c12). % 2.18/2.37 0 [] function($c12). % 2.18/2.37 0 [] relation($c13). % 2.18/2.37 0 [] relation_non_empty($c13). % 2.18/2.37 0 [] function($c13). % 2.18/2.37 0 [] -ordinal(A)| -ordinal(B)| -ordinal_subset(A,B)|subset(A,B). % 2.18/2.37 0 [] -ordinal(A)| -ordinal(B)|ordinal_subset(A,B)| -subset(A,B). % 2.18/2.37 0 [] -ordinal(A)| -ordinal(B)|ordinal_subset(A,A). % 2.18/2.37 0 [] subset(A,A). % 2.18/2.37 0 [] in(A,succ(A)). % 2.18/2.37 0 [] A!=succ(A). % 2.18/2.37 0 [] set_union2(A,empty_set)=A. % 2.18/2.37 0 [] -in(A,B)|element(A,B). % 2.18/2.37 0 [] -ordinal(A)| -ordinal(B)|in(A,B)|A=B|in(B,A). % 2.18/2.37 0 [] -element(A,B)|empty(B)|in(A,B). % 2.18/2.37 0 [] ordinal($c15). % 2.18/2.37 0 [] ordinal($c14). % 2.18/2.37 0 [] in($c15,succ($c14))|ordinal_subset($c15,$c14). % 2.18/2.37 0 [] -in($c15,succ($c14))| -ordinal_subset($c15,$c14). % 2.18/2.37 0 [] -element(A,powerset(B))|subset(A,B). % 2.18/2.37 0 [] element(A,powerset(B))| -subset(A,B). % 2.18/2.37 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C). % 2.18/2.37 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C). % 2.18/2.37 0 [] -empty(A)|A=empty_set. % 2.18/2.37 0 [] -in(A,B)| -empty(B). % 2.18/2.37 0 [] -empty(A)|A=B| -empty(B). % 2.18/2.37 end_of_list. % 2.18/2.37 % 2.18/2.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5. % 2.18/2.37 % 2.18/2.37 This ia a non-Horn set with equality. The strategy will be % 2.18/2.37 Knuth-Bendix, ordered hyper_res, factoring, and unit % 2.18/2.37 deletion, with positive clauses in sos and nonpositive % 2.18/2.37 clauses in usable. % 2.18/2.37 % 2.18/2.37 dependent: set(knuth_bendix). % 2.18/2.37 dependent: set(anl_eq). % 2.18/2.37 dependent: set(para_from). % 2.18/2.37 dependent: set(para_into). % 2.18/2.37 dependent: clear(para_from_right). % 2.18/2.37 dependent: clear(para_into_right). % 2.18/2.37 dependent: set(para_from_vars). % 2.18/2.37 dependent: set(eq_units_both_ways). % 2.18/2.37 dependent: set(dynamic_demod_all). % 2.18/2.37 dependent: set(dynamic_demod). % 2.18/2.37 dependent: set(order_eq). % 2.18/2.37 dependent: set(back_demod). % 2.18/2.37 dependent: set(lrpo). % 2.18/2.37 dependent: set(hyper_res). % 2.18/2.37 dependent: set(unit_deletion). % 2.18/2.37 dependent: set(factor). % 2.18/2.37 % 2.18/2.37 ------------> process usable: % 2.18/2.37 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A). % 2.18/2.37 ** KEPT (pick-wt=4): 2 [] -empty(A)|function(A). % 2.18/2.37 ** KEPT (pick-wt=4): 3 [] -ordinal(A)|epsilon_transitive(A). % 2.18/2.37 ** KEPT (pick-wt=4): 4 [] -ordinal(A)|epsilon_connected(A). % 2.18/2.37 ** KEPT (pick-wt=4): 5 [] -empty(A)|relation(A). % 2.18/2.37 ** KEPT (pick-wt=8): 6 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A). % 2.18/2.37 ** KEPT (pick-wt=6): 7 [] -epsilon_transitive(A)| -epsilon_connected(A)|ordinal(A). % 2.18/2.37 ** KEPT (pick-wt=4): 8 [] -empty(A)|epsilon_transitive(A). % 2.18/2.37 ** KEPT (pick-wt=4): 9 [] -empty(A)|epsilon_connected(A). % 2.18/2.37 ** KEPT (pick-wt=4): 10 [] -empty(A)|ordinal(A). % 2.18/2.37 ** KEPT (pick-wt=10): 11 [] -ordinal(A)| -ordinal(B)|ordinal_subset(A,B)|ordinal_subset(B,A). % 2.18/2.37 ** KEPT (pick-wt=6): 12 [] A!=B|subset(A,B). % 2.18/2.37 ** KEPT (pick-wt=6): 13 [] A!=B|subset(B,A). % 2.18/2.37 ** KEPT (pick-wt=9): 14 [] A=B| -subset(A,B)| -subset(B,A). % 2.18/2.37 ** KEPT (pick-wt=10): 15 [] A!=singleton(B)| -in(C,A)|C=B. % 2.18/2.37 ** KEPT (pick-wt=10): 16 [] A!=singleton(B)|in(C,A)|C!=B. % 2.18/2.37 ** KEPT (pick-wt=14): 17 [] A=singleton(B)| -in($f1(B,A),A)|$f1(B,A)!=B. % 2.18/2.37 ** KEPT (pick-wt=8): 18 [] -epsilon_transitive(A)| -in(B,A)|subset(B,A). % 2.18/2.37 ** KEPT (pick-wt=6): 19 [] epsilon_transitive(A)| -subset($f2(A),A). % 2.18/2.37 ** KEPT (pick-wt=14): 20 [] A!=set_union2(B,C)| -in(D,A)|in(D,B)|in(D,C). % 2.18/2.37 ** KEPT (pick-wt=11): 21 [] A!=set_union2(B,C)|in(D,A)| -in(D,B). % 2.18/2.37 ** KEPT (pick-wt=11): 22 [] A!=set_union2(B,C)|in(D,A)| -in(D,C). % 2.18/2.37 ** KEPT (pick-wt=17): 23 [] A=set_union2(B,C)| -in($f3(B,C,A),A)| -in($f3(B,C,A),B). % 2.18/2.37 ** KEPT (pick-wt=17): 24 [] A=set_union2(B,C)| -in($f3(B,C,A),A)| -in($f3(B,C,A),C). % 2.18/2.37 ** KEPT (pick-wt=3): 25 [] -empty(succ(A)). % 2.18/2.37 ** KEPT (pick-wt=8): 26 [] -relation(A)| -relation(B)|relation(set_union2(A,B)). % 2.18/2.37 ** KEPT (pick-wt=6): 27 [] empty(A)| -empty(set_union2(A,B)). % 2.18/2.37 Following clause subsumed by 25 during input processing: 0 [] -ordinal(A)| -empty(succ(A)). % 2.18/2.37 ** KEPT (pick-wt=5): 28 [] -ordinal(A)|epsilon_transitive(succ(A)). % 2.18/2.37 ** KEPT (pick-wt=5): 29 [] -ordinal(A)|epsilon_connected(succ(A)). % 2.18/2.37 ** KEPT (pick-wt=5): 30 [] -ordinal(A)|ordinal(succ(A)). % 2.18/2.37 ** KEPT (pick-wt=6): 31 [] empty(A)| -empty(set_union2(B,A)). % 2.18/2.37 ** KEPT (pick-wt=2): 32 [] -empty($c7). % 2.18/2.37 ** KEPT (pick-wt=2): 33 [] -empty($c8). % 2.18/2.37 ** KEPT (pick-wt=2): 34 [] -empty($c10). % 2.18/2.37 ** KEPT (pick-wt=10): 35 [] -ordinal(A)| -ordinal(B)| -ordinal_subset(A,B)|subset(A,B). % 2.18/2.37 ** KEPT (pick-wt=10): 36 [] -ordinal(A)| -ordinal(B)|ordinal_subset(A,B)| -subset(A,B). % 2.18/2.37 ** KEPT (pick-wt=5): 38 [copy,37,factor_simp] -ordinal(A)|ordinal_subset(A,A). % 2.18/2.37 ** KEPT (pick-wt=4): 40 [copy,39,flip.1] succ(A)!=A. % 2.18/2.37 ** KEPT (pick-wt=6): 41 [] -in(A,B)|element(A,B). % 2.18/2.37 ** KEPT (pick-wt=13): 42 [] -ordinal(A)| -ordinal(B)|in(A,B)|A=B|in(B,A). % 2.18/2.37 ** KEPT (pick-wt=8): 43 [] -element(A,B)|empty(B)|in(A,B). % 2.18/2.37 ** KEPT (pick-wt=7): 44 [] -in($c15,succ($c14))| -ordinal_subset($c15,$c14). % 2.18/2.37 ** KEPT (pick-wt=7): 45 [] -element(A,powerset(B))|subset(A,B). % 2.18/2.37 ** KEPT (pick-wt=7): 46 [] element(A,powerset(B))| -subset(A,B). % 2.18/2.37 ** KEPT (pick-wt=10): 47 [] -in(A,B)| -element(B,powerset(C))|element(A,C). % 2.18/2.37 ** KEPT (pick-wt=9): 48 [] -in(A,B)| -element(B,powerset(C))| -empty(C). % 2.18/2.37 ** KEPT (pick-wt=5): 49 [] -empty(A)|A=empty_set. % 2.18/2.37 ** KEPT (pick-wt=5): 50 [] -in(A,B)| -empty(B). % 2.18/2.37 ** KEPT (pick-wt=7): 51 [] -empty(A)|A=B| -empty(B). % 2.18/2.37 % 2.18/2.37 ------------> process sos: % 2.18/2.37 ** KEPT (pick-wt=3): 61 [] A=A. % 2.18/2.37 ** KEPT (pick-wt=7): 62 [] set_union2(A,B)=set_union2(B,A). % 2.18/2.37 ** KEPT (pick-wt=7): 63 [] succ(A)=set_union2(A,singleton(A)). % 2.18/2.37 ---> New Demodulator: 64 [new_demod,63] succ(A)=set_union2(A,singleton(A)). % 2.18/2.37 ** KEPT (pick-wt=14): 65 [] A=singleton(B)|in($f1(B,A),A)|$f1(B,A)=B. % 2.18/2.37 ** KEPT (pick-wt=6): 66 [] epsilon_transitive(A)|in($f2(A),A). % 2.18/2.37 ** KEPT (pick-wt=23): 67 [] A=set_union2(B,C)|in($f3(B,C,A),A)|in($f3(B,C,A),B)|in($f3(B,C,A),C). % 2.18/2.37 ** KEPT (pick-wt=4): 68 [] element($f4(A),A). % 2.18/2.37 ** KEPT (pick-wt=2): 69 [] empty(empty_set). % 2.18/2.37 ** KEPT (pick-wt=2): 70 [] relation(empty_set). % 2.18/2.37 ** KEPT (pick-wt=2): 71 [] relation_empty_yielding(empty_set). % 2.18/2.37 Following clause subsumed by 69 during input processing: 0 [] empty(empty_set). % 2.18/2.37 Following clause subsumed by 70 during input processing: 0 [] relation(empty_set). % 2.18/2.37 Following clause subsumed by 71 during input processing: 0 [] relation_empty_yielding(empty_set). % 2.18/2.37 ** KEPT (pick-wt=2): 72 [] function(empty_set). % 2.18/2.37 ** KEPT (pick-wt=2): 73 [] one_to_one(empty_set). % 2.18/2.37 Alarm clock % 299.93/300.06 Otter interrupted % 299.93/300.06 PROOF NOT FOUND %------------------------------------------------------------------------------