TSTP Solution File: SEU246+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU246+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n028.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:19 EDT 2022
% Result : Unknown 12.32s 12.52s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SEU246+1 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n028.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Jul 27 07:54:04 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.85/2.04 ----- Otter 3.3f, August 2004 -----
% 1.85/2.04 The process was started by sandbox2 on n028.cluster.edu,
% 1.85/2.04 Wed Jul 27 07:54:04 2022
% 1.85/2.04 The command was "./otter". The process ID is 17835.
% 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 (relation(A)&empty(A)&function(A)->relation(A)&function(A)&one_to_one(A)).
% 1.85/2.04 all A B (unordered_pair(A,B)=unordered_pair(B,A)).
% 1.85/2.04 all A B (set_intersection2(A,B)=set_intersection2(B,A)).
% 1.85/2.04 all A (relation(A)-> (all B C (relation(C)-> (C=relation_dom_restriction(A,B)<-> (all D E (in(ordered_pair(D,E),C)<->in(D,B)&in(ordered_pair(D,E),A))))))).
% 1.85/2.05 all A B (relation(B)-> (all C (relation(C)-> (C=relation_rng_restriction(A,B)<-> (all D E (in(ordered_pair(D,E),C)<->in(E,A)&in(ordered_pair(D,E),B))))))).
% 1.85/2.05 all A (relation(A)-> (all B (relation(B)-> (A=B<-> (all C D (in(ordered_pair(C,D),A)<->in(ordered_pair(C,D),B))))))).
% 1.85/2.05 all A B (ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A))).
% 1.85/2.05 all A (relation(A)-> (all B (relation_restriction(A,B)=set_intersection2(A,cartesian_product2(B,B))))).
% 1.85/2.05 $T.
% 1.85/2.05 $T.
% 1.85/2.05 $T.
% 1.85/2.05 all A B (relation(A)->relation(relation_restriction(A,B))).
% 1.85/2.05 $T.
% 1.85/2.05 $T.
% 1.85/2.05 $T.
% 1.85/2.05 all A B (relation(A)->relation(relation_dom_restriction(A,B))).
% 1.85/2.05 all A B (relation(B)->relation(relation_rng_restriction(A,B))).
% 1.85/2.05 $T.
% 1.85/2.05 all A exists B element(B,A).
% 1.85/2.05 empty(empty_set).
% 1.85/2.05 all A B (-empty(ordered_pair(A,B))).
% 1.85/2.05 all A B (relation(A)&function(A)->relation(relation_dom_restriction(A,B))&function(relation_dom_restriction(A,B))).
% 1.85/2.05 all A B (relation(B)&function(B)->relation(relation_rng_restriction(A,B))&function(relation_rng_restriction(A,B))).
% 1.85/2.05 all A B (set_intersection2(A,A)=A).
% 1.85/2.05 exists A (relation(A)&function(A)).
% 1.85/2.05 exists A empty(A).
% 1.85/2.05 exists A (relation(A)&empty(A)&function(A)).
% 1.85/2.05 exists A (-empty(A)).
% 1.85/2.05 exists A (relation(A)&function(A)&one_to_one(A)).
% 1.85/2.05 all A B C D (in(ordered_pair(A,B),cartesian_product2(C,D))<->in(A,C)&in(B,D)).
% 1.85/2.05 all A B C (relation(C)-> (in(A,relation_restriction(C,B))<->in(A,C)&in(A,cartesian_product2(B,B)))).
% 1.85/2.05 -(all A B (relation(B)->relation_restriction(B,A)=relation_dom_restriction(relation_rng_restriction(A,B),A))).
% 1.85/2.05 all A B (in(A,B)->element(A,B)).
% 1.85/2.05 all A (set_intersection2(A,empty_set)=empty_set).
% 1.85/2.05 all A B (element(A,B)->empty(B)|in(A,B)).
% 1.85/2.05 all A (empty(A)->A=empty_set).
% 1.85/2.05 all A B (-(in(A,B)&empty(B))).
% 1.85/2.05 all A B (-(empty(A)&A!=B&empty(B))).
% 1.85/2.05 end_of_list.
% 1.85/2.05
% 1.85/2.05 -------> usable clausifies to:
% 1.85/2.05
% 1.85/2.05 list(usable).
% 1.85/2.05 0 [] A=A.
% 1.85/2.05 0 [] -in(A,B)| -in(B,A).
% 1.85/2.05 0 [] -empty(A)|function(A).
% 1.85/2.05 0 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 1.85/2.05 0 [] unordered_pair(A,B)=unordered_pair(B,A).
% 1.85/2.05 0 [] set_intersection2(A,B)=set_intersection2(B,A).
% 1.85/2.05 0 [] -relation(A)| -relation(C)|C!=relation_dom_restriction(A,B)| -in(ordered_pair(D,E),C)|in(D,B).
% 1.85/2.05 0 [] -relation(A)| -relation(C)|C!=relation_dom_restriction(A,B)| -in(ordered_pair(D,E),C)|in(ordered_pair(D,E),A).
% 1.85/2.05 0 [] -relation(A)| -relation(C)|C!=relation_dom_restriction(A,B)|in(ordered_pair(D,E),C)| -in(D,B)| -in(ordered_pair(D,E),A).
% 1.85/2.05 0 [] -relation(A)| -relation(C)|C=relation_dom_restriction(A,B)|in(ordered_pair($f2(A,B,C),$f1(A,B,C)),C)|in($f2(A,B,C),B).
% 1.85/2.05 0 [] -relation(A)| -relation(C)|C=relation_dom_restriction(A,B)|in(ordered_pair($f2(A,B,C),$f1(A,B,C)),C)|in(ordered_pair($f2(A,B,C),$f1(A,B,C)),A).
% 1.85/2.05 0 [] -relation(A)| -relation(C)|C=relation_dom_restriction(A,B)| -in(ordered_pair($f2(A,B,C),$f1(A,B,C)),C)| -in($f2(A,B,C),B)| -in(ordered_pair($f2(A,B,C),$f1(A,B,C)),A).
% 1.85/2.05 0 [] -relation(B)| -relation(C)|C!=relation_rng_restriction(A,B)| -in(ordered_pair(D,E),C)|in(E,A).
% 1.85/2.05 0 [] -relation(B)| -relation(C)|C!=relation_rng_restriction(A,B)| -in(ordered_pair(D,E),C)|in(ordered_pair(D,E),B).
% 1.85/2.05 0 [] -relation(B)| -relation(C)|C!=relation_rng_restriction(A,B)|in(ordered_pair(D,E),C)| -in(E,A)| -in(ordered_pair(D,E),B).
% 1.88/2.05 0 [] -relation(B)| -relation(C)|C=relation_rng_restriction(A,B)|in(ordered_pair($f4(A,B,C),$f3(A,B,C)),C)|in($f3(A,B,C),A).
% 1.88/2.05 0 [] -relation(B)| -relation(C)|C=relation_rng_restriction(A,B)|in(ordered_pair($f4(A,B,C),$f3(A,B,C)),C)|in(ordered_pair($f4(A,B,C),$f3(A,B,C)),B).
% 1.88/2.05 0 [] -relation(B)| -relation(C)|C=relation_rng_restriction(A,B)| -in(ordered_pair($f4(A,B,C),$f3(A,B,C)),C)| -in($f3(A,B,C),A)| -in(ordered_pair($f4(A,B,C),$f3(A,B,C)),B).
% 1.88/2.05 0 [] -relation(A)| -relation(B)|A!=B| -in(ordered_pair(C,D),A)|in(ordered_pair(C,D),B).
% 1.88/2.05 0 [] -relation(A)| -relation(B)|A!=B|in(ordered_pair(C,D),A)| -in(ordered_pair(C,D),B).
% 1.88/2.05 0 [] -relation(A)| -relation(B)|A=B|in(ordered_pair($f6(A,B),$f5(A,B)),A)|in(ordered_pair($f6(A,B),$f5(A,B)),B).
% 1.88/2.05 0 [] -relation(A)| -relation(B)|A=B| -in(ordered_pair($f6(A,B),$f5(A,B)),A)| -in(ordered_pair($f6(A,B),$f5(A,B)),B).
% 1.88/2.05 0 [] ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A)).
% 1.88/2.05 0 [] -relation(A)|relation_restriction(A,B)=set_intersection2(A,cartesian_product2(B,B)).
% 1.88/2.05 0 [] $T.
% 1.88/2.05 0 [] $T.
% 1.88/2.05 0 [] $T.
% 1.88/2.05 0 [] -relation(A)|relation(relation_restriction(A,B)).
% 1.88/2.05 0 [] $T.
% 1.88/2.05 0 [] $T.
% 1.88/2.05 0 [] $T.
% 1.88/2.05 0 [] -relation(A)|relation(relation_dom_restriction(A,B)).
% 1.88/2.05 0 [] -relation(B)|relation(relation_rng_restriction(A,B)).
% 1.88/2.05 0 [] $T.
% 1.88/2.05 0 [] element($f7(A),A).
% 1.88/2.05 0 [] empty(empty_set).
% 1.88/2.05 0 [] -empty(ordered_pair(A,B)).
% 1.88/2.05 0 [] -relation(A)| -function(A)|relation(relation_dom_restriction(A,B)).
% 1.88/2.05 0 [] -relation(A)| -function(A)|function(relation_dom_restriction(A,B)).
% 1.88/2.05 0 [] -relation(B)| -function(B)|relation(relation_rng_restriction(A,B)).
% 1.88/2.05 0 [] -relation(B)| -function(B)|function(relation_rng_restriction(A,B)).
% 1.88/2.05 0 [] set_intersection2(A,A)=A.
% 1.88/2.05 0 [] relation($c1).
% 1.88/2.05 0 [] function($c1).
% 1.88/2.05 0 [] empty($c2).
% 1.88/2.05 0 [] relation($c3).
% 1.88/2.05 0 [] empty($c3).
% 1.88/2.05 0 [] function($c3).
% 1.88/2.05 0 [] -empty($c4).
% 1.88/2.05 0 [] relation($c5).
% 1.88/2.05 0 [] function($c5).
% 1.88/2.05 0 [] one_to_one($c5).
% 1.88/2.05 0 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(A,C).
% 1.88/2.05 0 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(B,D).
% 1.88/2.05 0 [] in(ordered_pair(A,B),cartesian_product2(C,D))| -in(A,C)| -in(B,D).
% 1.88/2.05 0 [] -relation(C)| -in(A,relation_restriction(C,B))|in(A,C).
% 1.88/2.05 0 [] -relation(C)| -in(A,relation_restriction(C,B))|in(A,cartesian_product2(B,B)).
% 1.88/2.05 0 [] -relation(C)|in(A,relation_restriction(C,B))| -in(A,C)| -in(A,cartesian_product2(B,B)).
% 1.88/2.05 0 [] relation($c6).
% 1.88/2.05 0 [] relation_restriction($c6,$c7)!=relation_dom_restriction(relation_rng_restriction($c7,$c6),$c7).
% 1.88/2.05 0 [] -in(A,B)|element(A,B).
% 1.88/2.05 0 [] set_intersection2(A,empty_set)=empty_set.
% 1.88/2.05 0 [] -element(A,B)|empty(B)|in(A,B).
% 1.88/2.05 0 [] -empty(A)|A=empty_set.
% 1.88/2.05 0 [] -in(A,B)| -empty(B).
% 1.88/2.05 0 [] -empty(A)|A=B| -empty(B).
% 1.88/2.05 end_of_list.
% 1.88/2.05
% 1.88/2.05 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 1.88/2.05
% 1.88/2.05 This ia a non-Horn set with equality. The strategy will be
% 1.88/2.05 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.88/2.05 deletion, with positive clauses in sos and nonpositive
% 1.88/2.05 clauses in usable.
% 1.88/2.05
% 1.88/2.05 dependent: set(knuth_bendix).
% 1.88/2.05 dependent: set(anl_eq).
% 1.88/2.05 dependent: set(para_from).
% 1.88/2.05 dependent: set(para_into).
% 1.88/2.05 dependent: clear(para_from_right).
% 1.88/2.05 dependent: clear(para_into_right).
% 1.88/2.05 dependent: set(para_from_vars).
% 1.88/2.05 dependent: set(eq_units_both_ways).
% 1.88/2.05 dependent: set(dynamic_demod_all).
% 1.88/2.05 dependent: set(dynamic_demod).
% 1.88/2.05 dependent: set(order_eq).
% 1.88/2.05 dependent: set(back_demod).
% 1.88/2.05 dependent: set(lrpo).
% 1.88/2.05 dependent: set(hyper_res).
% 1.88/2.05 dependent: set(unit_deletion).
% 1.88/2.05 dependent: set(factor).
% 1.88/2.05
% 1.88/2.05 ------------> process usable:
% 1.88/2.05 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.88/2.05 ** KEPT (pick-wt=4): 2 [] -empty(A)|function(A).
% 1.88/2.05 ** KEPT (pick-wt=8): 3 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 1.88/2.05 ** KEPT (pick-wt=17): 4 [] -relation(A)| -relation(B)|B!=relation_dom_restriction(A,C)| -in(ordered_pair(D,E),B)|in(D,C).
% 1.88/2.05 ** KEPT (pick-wt=19): 5 [] -relation(A)| -relation(B)|B!=relation_dom_restriction(A,C)| -in(ordered_pair(D,E),B)|in(ordered_pair(D,E),A).
% 1.88/2.05 ** KEPT (pick-wt=22): 6 [] -relation(A)| -relation(B)|B!=relation_dom_restriction(A,C)|in(ordered_pair(D,E),B)| -in(D,C)| -in(ordered_pair(D,E),A).
% 1.88/2.05 ** KEPT (pick-wt=26): 7 [] -relation(A)| -relation(B)|B=relation_dom_restriction(A,C)|in(ordered_pair($f2(A,C,B),$f1(A,C,B)),B)|in($f2(A,C,B),C).
% 1.88/2.05 ** KEPT (pick-wt=31): 8 [] -relation(A)| -relation(B)|B=relation_dom_restriction(A,C)|in(ordered_pair($f2(A,C,B),$f1(A,C,B)),B)|in(ordered_pair($f2(A,C,B),$f1(A,C,B)),A).
% 1.88/2.05 ** KEPT (pick-wt=37): 9 [] -relation(A)| -relation(B)|B=relation_dom_restriction(A,C)| -in(ordered_pair($f2(A,C,B),$f1(A,C,B)),B)| -in($f2(A,C,B),C)| -in(ordered_pair($f2(A,C,B),$f1(A,C,B)),A).
% 1.88/2.05 ** KEPT (pick-wt=17): 10 [] -relation(A)| -relation(B)|B!=relation_rng_restriction(C,A)| -in(ordered_pair(D,E),B)|in(E,C).
% 1.88/2.05 ** KEPT (pick-wt=19): 11 [] -relation(A)| -relation(B)|B!=relation_rng_restriction(C,A)| -in(ordered_pair(D,E),B)|in(ordered_pair(D,E),A).
% 1.88/2.05 ** KEPT (pick-wt=22): 12 [] -relation(A)| -relation(B)|B!=relation_rng_restriction(C,A)|in(ordered_pair(D,E),B)| -in(E,C)| -in(ordered_pair(D,E),A).
% 1.88/2.05 ** KEPT (pick-wt=26): 13 [] -relation(A)| -relation(B)|B=relation_rng_restriction(C,A)|in(ordered_pair($f4(C,A,B),$f3(C,A,B)),B)|in($f3(C,A,B),C).
% 1.88/2.05 ** KEPT (pick-wt=31): 14 [] -relation(A)| -relation(B)|B=relation_rng_restriction(C,A)|in(ordered_pair($f4(C,A,B),$f3(C,A,B)),B)|in(ordered_pair($f4(C,A,B),$f3(C,A,B)),A).
% 1.88/2.05 ** KEPT (pick-wt=37): 15 [] -relation(A)| -relation(B)|B=relation_rng_restriction(C,A)| -in(ordered_pair($f4(C,A,B),$f3(C,A,B)),B)| -in($f3(C,A,B),C)| -in(ordered_pair($f4(C,A,B),$f3(C,A,B)),A).
% 1.88/2.05 ** KEPT (pick-wt=17): 16 [] -relation(A)| -relation(B)|A!=B| -in(ordered_pair(C,D),A)|in(ordered_pair(C,D),B).
% 1.88/2.05 ** KEPT (pick-wt=17): 17 [] -relation(A)| -relation(B)|A!=B|in(ordered_pair(C,D),A)| -in(ordered_pair(C,D),B).
% 1.88/2.05 ** KEPT (pick-wt=25): 18 [] -relation(A)| -relation(B)|A=B|in(ordered_pair($f6(A,B),$f5(A,B)),A)|in(ordered_pair($f6(A,B),$f5(A,B)),B).
% 1.88/2.05 ** KEPT (pick-wt=25): 19 [] -relation(A)| -relation(B)|A=B| -in(ordered_pair($f6(A,B),$f5(A,B)),A)| -in(ordered_pair($f6(A,B),$f5(A,B)),B).
% 1.88/2.05 ** KEPT (pick-wt=11): 21 [copy,20,flip.2] -relation(A)|set_intersection2(A,cartesian_product2(B,B))=relation_restriction(A,B).
% 1.88/2.05 ** KEPT (pick-wt=6): 22 [] -relation(A)|relation(relation_restriction(A,B)).
% 1.88/2.05 ** KEPT (pick-wt=6): 23 [] -relation(A)|relation(relation_dom_restriction(A,B)).
% 1.88/2.05 ** KEPT (pick-wt=6): 24 [] -relation(A)|relation(relation_rng_restriction(B,A)).
% 1.88/2.05 ** KEPT (pick-wt=4): 25 [] -empty(ordered_pair(A,B)).
% 1.88/2.05 Following clause subsumed by 23 during input processing: 0 [] -relation(A)| -function(A)|relation(relation_dom_restriction(A,B)).
% 1.88/2.05 ** KEPT (pick-wt=8): 26 [] -relation(A)| -function(A)|function(relation_dom_restriction(A,B)).
% 1.88/2.05 Following clause subsumed by 24 during input processing: 0 [] -relation(A)| -function(A)|relation(relation_rng_restriction(B,A)).
% 1.88/2.05 ** KEPT (pick-wt=8): 27 [] -relation(A)| -function(A)|function(relation_rng_restriction(B,A)).
% 1.88/2.05 ** KEPT (pick-wt=2): 28 [] -empty($c4).
% 1.88/2.05 ** KEPT (pick-wt=10): 29 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(A,C).
% 1.88/2.05 ** KEPT (pick-wt=10): 30 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(B,D).
% 1.88/2.05 ** KEPT (pick-wt=13): 31 [] in(ordered_pair(A,B),cartesian_product2(C,D))| -in(A,C)| -in(B,D).
% 1.88/2.05 ** KEPT (pick-wt=10): 32 [] -relation(A)| -in(B,relation_restriction(A,C))|in(B,A).
% 1.88/2.05 ** KEPT (pick-wt=12): 33 [] -relation(A)| -in(B,relation_restriction(A,C))|in(B,cartesian_product2(C,C)).
% 1.88/2.05 ** KEPT (pick-wt=15): 34 [] -relation(A)|in(B,relation_restriction(A,C))| -in(B,A)| -in(B,cartesian_product2(C,C)).
% 1.88/2.05 ** KEPT (pick-wt=9): 36 [copy,35,flip.1] relation_dom_restriction(relation_rng_restriction($c7,$c6),$c7)!=relation_restriction($c6,$c7).
% 1.88/2.05 ** KEPT (pick-wt=6): 37 [] -in(A,B)|element(A,B).
% 1.88/2.05 ** KEPT (pick-wt=8): 38 [] -element(A,B)|empty(B)|in(A,B).
% 1.88/2.05 ** KEPT (pick-wt=5): 39 [] -empty(A)|A=empty_set.
% 1.88/2.05 ** KEPT (pick-wt=5): 40 [] -in(A,B)| -empty(B).
% 1.88/2.05 ** KEPT (pick-wt=7): 41 [] -empty(A)|A=B| -empty(B).
% 1.88/2.05 45 back subsumes 44.
% 1.88/2.05 49 back subsumes 48.
% 1.88/2.05
% 1.88/2.05 ------------> process sos:
% 1.88/2.05 ** KEPT (pick-wt=3): 56 [] A=A.
% 1.88/2.05 ** KEPT (pick-wt=7): 57 [] unordered_pair(A,B)=unordered_pair(B,A).
% 1.88/2.05 ** KEPT (pick-wt=7): 58 [] set_intersection2(A,B)=set_intersection2(B,A).
% 1.88/2.05 ** KEPT (pick-wt=10): 60 [copy,59,flip.1] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 12.32/12.52 ---> New Demodulator: 61 [new_demod,60] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 12.32/12.52 ** KEPT (pick-wt=4): 62 [] element($f7(A),A).
% 12.32/12.52 ** KEPT (pick-wt=2): 63 [] empty(empty_set).
% 12.32/12.52 ** KEPT (pick-wt=5): 64 [] set_intersection2(A,A)=A.
% 12.32/12.52 ---> New Demodulator: 65 [new_demod,64] set_intersection2(A,A)=A.
% 12.32/12.52 ** KEPT (pick-wt=2): 66 [] relation($c1).
% 12.32/12.52 ** KEPT (pick-wt=2): 67 [] function($c1).
% 12.32/12.52 ** KEPT (pick-wt=2): 68 [] empty($c2).
% 12.32/12.52 ** KEPT (pick-wt=2): 69 [] relation($c3).
% 12.32/12.52 ** KEPT (pick-wt=2): 70 [] empty($c3).
% 12.32/12.52 ** KEPT (pick-wt=2): 71 [] function($c3).
% 12.32/12.52 ** KEPT (pick-wt=2): 72 [] relation($c5).
% 12.32/12.52 ** KEPT (pick-wt=2): 73 [] function($c5).
% 12.32/12.52 ** KEPT (pick-wt=2): 74 [] one_to_one($c5).
% 12.32/12.52 ** KEPT (pick-wt=2): 75 [] relation($c6).
% 12.32/12.52 ** KEPT (pick-wt=5): 76 [] set_intersection2(A,empty_set)=empty_set.
% 12.32/12.52 ---> New Demodulator: 77 [new_demod,76] set_intersection2(A,empty_set)=empty_set.
% 12.32/12.52 Following clause subsumed by 56 during input processing: 0 [copy,56,flip.1] A=A.
% 12.32/12.52 56 back subsumes 55.
% 12.32/12.52 56 back subsumes 52.
% 12.32/12.52 56 back subsumes 51.
% 12.32/12.52 Following clause subsumed by 57 during input processing: 0 [copy,57,flip.1] unordered_pair(A,B)=unordered_pair(B,A).
% 12.32/12.52 Following clause subsumed by 58 during input processing: 0 [copy,58,flip.1] set_intersection2(A,B)=set_intersection2(B,A).
% 12.32/12.52 >>>> Starting back demodulation with 61.
% 12.32/12.52 >>>> Starting back demodulation with 65.
% 12.32/12.52 >>>> Starting back demodulation with 77.
% 12.32/12.52
% 12.32/12.52 ======= end of input processing =======
% 12.32/12.52
% 12.32/12.52 =========== start of search ===========
% 12.32/12.52
% 12.32/12.52
% 12.32/12.52 Resetting weight limit to 6.
% 12.32/12.52
% 12.32/12.52
% 12.32/12.52 Resetting weight limit to 6.
% 12.32/12.52
% 12.32/12.52 sos_size=443
% 12.32/12.52
% 12.32/12.52 Search stopped because sos empty.
% 12.32/12.52
% 12.32/12.52
% 12.32/12.52 Search stopped because sos empty.
% 12.32/12.52
% 12.32/12.52 ============ end of search ============
% 12.32/12.52
% 12.32/12.52 -------------- statistics -------------
% 12.32/12.52 clauses given 488
% 12.32/12.52 clauses generated 427330
% 12.32/12.52 clauses kept 625
% 12.32/12.52 clauses forward subsumed 542
% 12.32/12.52 clauses back subsumed 26
% 12.32/12.52 Kbytes malloced 6835
% 12.32/12.52
% 12.32/12.52 ----------- times (seconds) -----------
% 12.32/12.52 user CPU time 10.47 (0 hr, 0 min, 10 sec)
% 12.32/12.52 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 12.32/12.52 wall-clock time 12 (0 hr, 0 min, 12 sec)
% 12.32/12.52
% 12.32/12.52 Process 17835 finished Wed Jul 27 07:54:16 2022
% 12.32/12.52 Otter interrupted
% 12.32/12.52 PROOF NOT FOUND
%------------------------------------------------------------------------------