TSTP Solution File: SEU201+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU201+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n026.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:08 EDT 2022
% Result : Unknown 47.07s 47.24s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SEU201+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.11/0.33 % Computer : n026.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Wed Jul 27 08:13:54 EDT 2022
% 0.11/0.33 % CPUTime :
% 1.68/2.37 ----- Otter 3.3f, August 2004 -----
% 1.68/2.37 The process was started by sandbox on n026.cluster.edu,
% 1.68/2.37 Wed Jul 27 08:13:54 2022
% 1.68/2.37 The command was "./otter". The process ID is 9910.
% 1.68/2.37
% 1.68/2.37 set(prolog_style_variables).
% 1.68/2.37 set(auto).
% 1.68/2.37 dependent: set(auto1).
% 1.68/2.37 dependent: set(process_input).
% 1.68/2.37 dependent: clear(print_kept).
% 1.68/2.37 dependent: clear(print_new_demod).
% 1.68/2.37 dependent: clear(print_back_demod).
% 1.68/2.37 dependent: clear(print_back_sub).
% 1.68/2.37 dependent: set(control_memory).
% 1.68/2.37 dependent: assign(max_mem, 12000).
% 1.68/2.37 dependent: assign(pick_given_ratio, 4).
% 1.68/2.37 dependent: assign(stats_level, 1).
% 1.68/2.37 dependent: assign(max_seconds, 10800).
% 1.68/2.37 clear(print_given).
% 1.68/2.37
% 1.68/2.37 formula_list(usable).
% 1.68/2.37 all A (A=A).
% 1.68/2.37 all A B (in(A,B)-> -in(B,A)).
% 1.68/2.37 all A (empty(A)->relation(A)).
% 1.68/2.37 all A B (unordered_pair(A,B)=unordered_pair(B,A)).
% 1.68/2.37 all A B (set_intersection2(A,B)=set_intersection2(B,A)).
% 1.68/2.37 all A B (A=B<->subset(A,B)&subset(B,A)).
% 1.68/2.37 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.68/2.37 all A B (subset(A,B)<-> (all C (in(C,A)->in(C,B)))).
% 1.68/2.37 all A B C (C=set_intersection2(A,B)<-> (all D (in(D,C)<->in(D,A)&in(D,B)))).
% 1.68/2.37 all A (relation(A)-> (all B (B=relation_rng(A)<-> (all C (in(C,B)<-> (exists D in(ordered_pair(D,C),A))))))).
% 1.68/2.37 all A B (ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A))).
% 1.68/2.37 $T.
% 1.68/2.37 $T.
% 1.68/2.37 $T.
% 1.68/2.37 $T.
% 1.68/2.37 $T.
% 1.68/2.37 $T.
% 1.68/2.37 $T.
% 1.68/2.37 all A B (relation(B)->relation(relation_rng_restriction(A,B))).
% 1.68/2.37 $T.
% 1.68/2.37 all A exists B element(B,A).
% 1.68/2.37 all A B (relation(A)&relation(B)->relation(set_intersection2(A,B))).
% 1.68/2.37 all A (-empty(powerset(A))).
% 1.68/2.37 empty(empty_set).
% 1.68/2.37 all A B (-empty(ordered_pair(A,B))).
% 1.68/2.37 all A (-empty(singleton(A))).
% 1.68/2.37 all A B (-empty(unordered_pair(A,B))).
% 1.68/2.37 empty(empty_set).
% 1.68/2.37 relation(empty_set).
% 1.68/2.37 all A (-empty(A)&relation(A)-> -empty(relation_rng(A))).
% 1.68/2.37 all A (empty(A)->empty(relation_rng(A))&relation(relation_rng(A))).
% 1.68/2.37 all A B (set_intersection2(A,A)=A).
% 1.68/2.37 exists A (empty(A)&relation(A)).
% 1.68/2.37 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)))).
% 1.68/2.37 exists A empty(A).
% 1.68/2.37 exists A (-empty(A)&relation(A)).
% 1.68/2.37 all A exists B (element(B,powerset(A))&empty(B)).
% 1.68/2.37 exists A (-empty(A)).
% 1.68/2.37 all A B subset(A,A).
% 1.68/2.37 all A B (relation(B)->subset(relation_rng(relation_rng_restriction(A,B)),A)).
% 1.68/2.37 all A B (relation(B)->subset(relation_rng(relation_rng_restriction(A,B)),relation_rng(B))).
% 1.68/2.37 -(all A B (relation(B)->relation_rng(relation_rng_restriction(A,B))=set_intersection2(relation_rng(B),A))).
% 1.68/2.37 all A B C (subset(A,B)&subset(A,C)->subset(A,set_intersection2(B,C))).
% 1.68/2.37 all A B (in(A,B)->element(A,B)).
% 1.68/2.37 all A (set_intersection2(A,empty_set)=empty_set).
% 1.68/2.37 all A B (element(A,B)->empty(B)|in(A,B)).
% 1.68/2.37 all A B (element(A,powerset(B))<->subset(A,B)).
% 1.68/2.37 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 1.68/2.37 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 1.68/2.37 all A (empty(A)->A=empty_set).
% 1.68/2.37 all A B (-(in(A,B)&empty(B))).
% 1.68/2.37 all A B (-(empty(A)&A!=B&empty(B))).
% 1.68/2.37 end_of_list.
% 1.68/2.37
% 1.68/2.37 -------> usable clausifies to:
% 1.68/2.37
% 1.68/2.37 list(usable).
% 1.68/2.37 0 [] A=A.
% 1.68/2.37 0 [] -in(A,B)| -in(B,A).
% 1.68/2.37 0 [] -empty(A)|relation(A).
% 1.68/2.37 0 [] unordered_pair(A,B)=unordered_pair(B,A).
% 1.68/2.37 0 [] set_intersection2(A,B)=set_intersection2(B,A).
% 1.68/2.37 0 [] A!=B|subset(A,B).
% 1.68/2.37 0 [] A!=B|subset(B,A).
% 1.68/2.37 0 [] A=B| -subset(A,B)| -subset(B,A).
% 1.68/2.37 0 [] -relation(B)| -relation(C)|C!=relation_rng_restriction(A,B)| -in(ordered_pair(D,E),C)|in(E,A).
% 1.68/2.37 0 [] -relation(B)| -relation(C)|C!=relation_rng_restriction(A,B)| -in(ordered_pair(D,E),C)|in(ordered_pair(D,E),B).
% 1.68/2.37 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.68/2.37 0 [] -relation(B)| -relation(C)|C=relation_rng_restriction(A,B)|in(ordered_pair($f2(A,B,C),$f1(A,B,C)),C)|in($f1(A,B,C),A).
% 1.68/2.37 0 [] -relation(B)| -relation(C)|C=relation_rng_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)),B).
% 1.68/2.37 0 [] -relation(B)| -relation(C)|C=relation_rng_restriction(A,B)| -in(ordered_pair($f2(A,B,C),$f1(A,B,C)),C)| -in($f1(A,B,C),A)| -in(ordered_pair($f2(A,B,C),$f1(A,B,C)),B).
% 1.68/2.37 0 [] -subset(A,B)| -in(C,A)|in(C,B).
% 1.68/2.37 0 [] subset(A,B)|in($f3(A,B),A).
% 1.68/2.37 0 [] subset(A,B)| -in($f3(A,B),B).
% 1.68/2.37 0 [] C!=set_intersection2(A,B)| -in(D,C)|in(D,A).
% 1.68/2.37 0 [] C!=set_intersection2(A,B)| -in(D,C)|in(D,B).
% 1.68/2.37 0 [] C!=set_intersection2(A,B)|in(D,C)| -in(D,A)| -in(D,B).
% 1.68/2.37 0 [] C=set_intersection2(A,B)|in($f4(A,B,C),C)|in($f4(A,B,C),A).
% 1.68/2.37 0 [] C=set_intersection2(A,B)|in($f4(A,B,C),C)|in($f4(A,B,C),B).
% 1.68/2.37 0 [] C=set_intersection2(A,B)| -in($f4(A,B,C),C)| -in($f4(A,B,C),A)| -in($f4(A,B,C),B).
% 1.68/2.37 0 [] -relation(A)|B!=relation_rng(A)| -in(C,B)|in(ordered_pair($f5(A,B,C),C),A).
% 1.68/2.37 0 [] -relation(A)|B!=relation_rng(A)|in(C,B)| -in(ordered_pair(D,C),A).
% 1.68/2.37 0 [] -relation(A)|B=relation_rng(A)|in($f7(A,B),B)|in(ordered_pair($f6(A,B),$f7(A,B)),A).
% 1.68/2.37 0 [] -relation(A)|B=relation_rng(A)| -in($f7(A,B),B)| -in(ordered_pair(X1,$f7(A,B)),A).
% 1.68/2.37 0 [] ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A)).
% 1.68/2.37 0 [] $T.
% 1.68/2.37 0 [] $T.
% 1.68/2.37 0 [] $T.
% 1.68/2.37 0 [] $T.
% 1.68/2.37 0 [] $T.
% 1.68/2.37 0 [] $T.
% 1.68/2.37 0 [] $T.
% 1.68/2.37 0 [] -relation(B)|relation(relation_rng_restriction(A,B)).
% 1.68/2.37 0 [] $T.
% 1.68/2.37 0 [] element($f8(A),A).
% 1.68/2.37 0 [] -relation(A)| -relation(B)|relation(set_intersection2(A,B)).
% 1.68/2.37 0 [] -empty(powerset(A)).
% 1.68/2.37 0 [] empty(empty_set).
% 1.68/2.37 0 [] -empty(ordered_pair(A,B)).
% 1.68/2.37 0 [] -empty(singleton(A)).
% 1.68/2.37 0 [] -empty(unordered_pair(A,B)).
% 1.68/2.37 0 [] empty(empty_set).
% 1.68/2.37 0 [] relation(empty_set).
% 1.68/2.37 0 [] empty(A)| -relation(A)| -empty(relation_rng(A)).
% 1.68/2.37 0 [] -empty(A)|empty(relation_rng(A)).
% 1.68/2.37 0 [] -empty(A)|relation(relation_rng(A)).
% 1.68/2.37 0 [] set_intersection2(A,A)=A.
% 1.68/2.37 0 [] empty($c1).
% 1.68/2.37 0 [] relation($c1).
% 1.68/2.37 0 [] empty(A)|element($f9(A),powerset(A)).
% 1.68/2.37 0 [] empty(A)| -empty($f9(A)).
% 1.68/2.37 0 [] empty($c2).
% 1.68/2.37 0 [] -empty($c3).
% 1.68/2.37 0 [] relation($c3).
% 1.68/2.37 0 [] element($f10(A),powerset(A)).
% 1.68/2.37 0 [] empty($f10(A)).
% 1.68/2.37 0 [] -empty($c4).
% 1.68/2.37 0 [] subset(A,A).
% 1.68/2.37 0 [] -relation(B)|subset(relation_rng(relation_rng_restriction(A,B)),A).
% 1.68/2.37 0 [] -relation(B)|subset(relation_rng(relation_rng_restriction(A,B)),relation_rng(B)).
% 1.68/2.37 0 [] relation($c5).
% 1.68/2.37 0 [] relation_rng(relation_rng_restriction($c6,$c5))!=set_intersection2(relation_rng($c5),$c6).
% 1.68/2.37 0 [] -subset(A,B)| -subset(A,C)|subset(A,set_intersection2(B,C)).
% 1.68/2.37 0 [] -in(A,B)|element(A,B).
% 1.68/2.37 0 [] set_intersection2(A,empty_set)=empty_set.
% 1.68/2.37 0 [] -element(A,B)|empty(B)|in(A,B).
% 1.68/2.37 0 [] -element(A,powerset(B))|subset(A,B).
% 1.68/2.37 0 [] element(A,powerset(B))| -subset(A,B).
% 1.68/2.37 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.68/2.37 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.68/2.37 0 [] -empty(A)|A=empty_set.
% 1.68/2.37 0 [] -in(A,B)| -empty(B).
% 1.68/2.37 0 [] -empty(A)|A=B| -empty(B).
% 1.68/2.37 end_of_list.
% 1.68/2.37
% 1.68/2.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 1.68/2.37
% 1.68/2.37 This ia a non-Horn set with equality. The strategy will be
% 1.68/2.37 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.68/2.37 deletion, with positive clauses in sos and nonpositive
% 1.68/2.37 clauses in usable.
% 1.68/2.37
% 1.68/2.37 dependent: set(knuth_bendix).
% 1.68/2.37 dependent: set(anl_eq).
% 1.68/2.37 dependent: set(para_from).
% 1.68/2.37 dependent: set(para_into).
% 1.68/2.37 dependent: clear(para_from_right).
% 1.68/2.37 dependent: clear(para_into_right).
% 1.68/2.37 dependent: set(para_from_vars).
% 1.68/2.37 dependent: set(eq_units_both_ways).
% 1.68/2.37 dependent: set(dynamic_demod_all).
% 1.68/2.37 dependent: set(dynamic_demod).
% 1.68/2.37 dependent: set(order_eq).
% 1.68/2.37 dependent: set(back_demod).
% 1.68/2.37 dependent: set(lrpo).
% 1.68/2.37 dependent: set(hyper_res).
% 1.68/2.37 dependent: set(unit_deletion).
% 1.68/2.37 dependent: set(factor).
% 1.68/2.37
% 1.68/2.37 ------------> process usable:
% 1.68/2.37 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.68/2.37 ** KEPT (pick-wt=4): 2 [] -empty(A)|relation(A).
% 1.68/2.37 ** KEPT (pick-wt=6): 3 [] A!=B|subset(A,B).
% 1.68/2.37 ** KEPT (pick-wt=6): 4 [] A!=B|subset(B,A).
% 1.68/2.37 ** KEPT (pick-wt=9): 5 [] A=B| -subset(A,B)| -subset(B,A).
% 1.68/2.37 ** KEPT (pick-wt=17): 6 [] -relation(A)| -relation(B)|B!=relation_rng_restriction(C,A)| -in(ordered_pair(D,E),B)|in(E,C).
% 1.68/2.37 ** KEPT (pick-wt=19): 7 [] -relation(A)| -relation(B)|B!=relation_rng_restriction(C,A)| -in(ordered_pair(D,E),B)|in(ordered_pair(D,E),A).
% 1.68/2.37 ** KEPT (pick-wt=22): 8 [] -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.68/2.37 ** KEPT (pick-wt=26): 9 [] -relation(A)| -relation(B)|B=relation_rng_restriction(C,A)|in(ordered_pair($f2(C,A,B),$f1(C,A,B)),B)|in($f1(C,A,B),C).
% 1.68/2.37 ** KEPT (pick-wt=31): 10 [] -relation(A)| -relation(B)|B=relation_rng_restriction(C,A)|in(ordered_pair($f2(C,A,B),$f1(C,A,B)),B)|in(ordered_pair($f2(C,A,B),$f1(C,A,B)),A).
% 1.68/2.37 ** KEPT (pick-wt=37): 11 [] -relation(A)| -relation(B)|B=relation_rng_restriction(C,A)| -in(ordered_pair($f2(C,A,B),$f1(C,A,B)),B)| -in($f1(C,A,B),C)| -in(ordered_pair($f2(C,A,B),$f1(C,A,B)),A).
% 1.68/2.37 ** KEPT (pick-wt=9): 12 [] -subset(A,B)| -in(C,A)|in(C,B).
% 1.68/2.37 ** KEPT (pick-wt=8): 13 [] subset(A,B)| -in($f3(A,B),B).
% 1.68/2.37 ** KEPT (pick-wt=11): 14 [] A!=set_intersection2(B,C)| -in(D,A)|in(D,B).
% 1.68/2.37 ** KEPT (pick-wt=11): 15 [] A!=set_intersection2(B,C)| -in(D,A)|in(D,C).
% 1.68/2.37 ** KEPT (pick-wt=14): 16 [] A!=set_intersection2(B,C)|in(D,A)| -in(D,B)| -in(D,C).
% 1.68/2.37 ** KEPT (pick-wt=23): 17 [] A=set_intersection2(B,C)| -in($f4(B,C,A),A)| -in($f4(B,C,A),B)| -in($f4(B,C,A),C).
% 1.68/2.37 ** KEPT (pick-wt=17): 18 [] -relation(A)|B!=relation_rng(A)| -in(C,B)|in(ordered_pair($f5(A,B,C),C),A).
% 1.68/2.37 ** KEPT (pick-wt=14): 19 [] -relation(A)|B!=relation_rng(A)|in(C,B)| -in(ordered_pair(D,C),A).
% 1.68/2.37 ** KEPT (pick-wt=20): 20 [] -relation(A)|B=relation_rng(A)|in($f7(A,B),B)|in(ordered_pair($f6(A,B),$f7(A,B)),A).
% 1.68/2.37 ** KEPT (pick-wt=18): 21 [] -relation(A)|B=relation_rng(A)| -in($f7(A,B),B)| -in(ordered_pair(C,$f7(A,B)),A).
% 1.68/2.37 ** KEPT (pick-wt=6): 22 [] -relation(A)|relation(relation_rng_restriction(B,A)).
% 1.68/2.37 ** KEPT (pick-wt=8): 23 [] -relation(A)| -relation(B)|relation(set_intersection2(A,B)).
% 1.68/2.37 ** KEPT (pick-wt=3): 24 [] -empty(powerset(A)).
% 1.68/2.37 ** KEPT (pick-wt=4): 25 [] -empty(ordered_pair(A,B)).
% 1.68/2.37 ** KEPT (pick-wt=3): 26 [] -empty(singleton(A)).
% 1.68/2.37 ** KEPT (pick-wt=4): 27 [] -empty(unordered_pair(A,B)).
% 1.68/2.37 ** KEPT (pick-wt=7): 28 [] empty(A)| -relation(A)| -empty(relation_rng(A)).
% 1.68/2.37 ** KEPT (pick-wt=5): 29 [] -empty(A)|empty(relation_rng(A)).
% 1.68/2.37 ** KEPT (pick-wt=5): 30 [] -empty(A)|relation(relation_rng(A)).
% 1.68/2.37 ** KEPT (pick-wt=5): 31 [] empty(A)| -empty($f9(A)).
% 1.68/2.37 ** KEPT (pick-wt=2): 32 [] -empty($c3).
% 1.68/2.37 ** KEPT (pick-wt=2): 33 [] -empty($c4).
% 1.68/2.37 ** KEPT (pick-wt=8): 34 [] -relation(A)|subset(relation_rng(relation_rng_restriction(B,A)),B).
% 1.68/2.37 ** KEPT (pick-wt=9): 35 [] -relation(A)|subset(relation_rng(relation_rng_restriction(B,A)),relation_rng(A)).
% 1.68/2.37 ** KEPT (pick-wt=9): 36 [] relation_rng(relation_rng_restriction($c6,$c5))!=set_intersection2(relation_rng($c5),$c6).
% 1.68/2.37 ** KEPT (pick-wt=11): 37 [] -subset(A,B)| -subset(A,C)|subset(A,set_intersection2(B,C)).
% 1.68/2.37 ** KEPT (pick-wt=6): 38 [] -in(A,B)|element(A,B).
% 1.68/2.37 ** KEPT (pick-wt=8): 39 [] -element(A,B)|empty(B)|in(A,B).
% 1.68/2.37 ** KEPT (pick-wt=7): 40 [] -element(A,powerset(B))|subset(A,B).
% 1.68/2.37 ** KEPT (pick-wt=7): 41 [] element(A,powerset(B))| -subset(A,B).
% 1.68/2.37 ** KEPT (pick-wt=10): 42 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.68/2.37 ** KEPT (pick-wt=9): 43 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.68/2.37 ** KEPT (pick-wt=5): 44 [] -empty(A)|A=empty_set.
% 1.68/2.37 ** KEPT (pick-wt=5): 45 [] -in(A,B)| -empty(B).
% 1.68/2.37 ** KEPT (pick-wt=7): 46 [] -empty(A)|A=B| -empty(B).
% 1.68/2.37 51 back subsumes 50.
% 1.68/2.37
% 1.68/2.37 ------------> process sos:
% 1.68/2.37 ** KEPT (pick-wt=3): 61 [] A=A.
% 1.68/2.37 ** KEPT (pick-wt=7): 62 [] unordered_pair(A,B)=unordered_pair(B,A).
% 1.68/2.37 ** KEPT (pick-wt=7): 63 [] set_intersection2(A,B)=set_intersection2(B,A).
% 1.68/2.37 ** KEPT (pick-wt=8): 64 [] subset(A,B)|in($f3(A,B),A).
% 1.68/2.37 ** KEPT (pick-wt=17): 65 [] A=set_intersection2(B,C)|in($f4(B,C,A),A)|in($f4(B,C,A),B).
% 1.68/2.37 ** KEPT (pick-wt=17): 66 [] A=set_intersection2(B,C)|in($f4(B,C,A),A)|in($f4(B,C,A),C).
% 1.68/2.37 ** KEPT (pick-wt=10): 68 [copy,67,flip.1] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 1.68/2.37 ---> New Demodulator: 69 [new_demod,68] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 1.68/2.37 ** KEPT (pick-wt=4): 70 [] element($f8(A),A).
% 1.68/2.37 ** KEPT (pick-wt=2): 71 [] empty(empty_set).
% 1.68/2.37 Following clause subsumed by 71 during input processing: 0 [] empty(empty_set).
% 1.68/2.37 ** KEPT (pick-wt=2): 72 [] relation(empty_set).
% 1.68/2.37 ** KEPT (pick-wt=5): 73 [] set_intersection2(A,A)=A.
% 1.68/2.37 ---> New Demodulator: 74 [new_demod,73] set_intersection2(A,A)=A.
% 1.68/2.37 ** KEPT (pick-wt=2): 75 [] empty($c1).
% 1.68/2.37 ** KEPT (pick-wt=2): 76 [] relation($c1).
% 1.68/2.37 ** KEPT (pick-wt=7): 77 [] empty(A)|element($f9(A),powerset(A)).
% 1.68/2.37 ** KEPT (pick-wt=2): 78 [] empty($c2).
% 1.68/2.37 ** KEPT (pick-wt=2): 79 [] relation($c3).
% 1.68/2.37 ** KEPT (pick-wt=5): 80 [] element($f10(A),powerset(A)).
% 1.68/2.37 ** KEPT (pick-wt=3): 81 [] empty($f10(A)).
% 1.68/2.37 ** KEPT (pick-wt=3): 82 [] subset(A,A).
% 47.07/47.24 ** KEPT (pick-wt=2): 83 [] relation($c5).
% 47.07/47.24 ** KEPT (pick-wt=5): 84 [] set_intersection2(A,empty_set)=empty_set.
% 47.07/47.24 ---> New Demodulator: 85 [new_demod,84] set_intersection2(A,empty_set)=empty_set.
% 47.07/47.24 Following clause subsumed by 61 during input processing: 0 [copy,61,flip.1] A=A.
% 47.07/47.24 61 back subsumes 59.
% 47.07/47.24 61 back subsumes 48.
% 47.07/47.24 Following clause subsumed by 62 during input processing: 0 [copy,62,flip.1] unordered_pair(A,B)=unordered_pair(B,A).
% 47.07/47.24 Following clause subsumed by 63 during input processing: 0 [copy,63,flip.1] set_intersection2(A,B)=set_intersection2(B,A).
% 47.07/47.24 >>>> Starting back demodulation with 69.
% 47.07/47.24 >>>> Starting back demodulation with 74.
% 47.07/47.24 >> back demodulating 60 with 74.
% 47.07/47.24 >> back demodulating 58 with 74.
% 47.07/47.24 >> back demodulating 57 with 74.
% 47.07/47.24 >> back demodulating 56 with 74.
% 47.07/47.24 >> back demodulating 53 with 74.
% 47.07/47.24 >>>> Starting back demodulation with 85.
% 47.07/47.24
% 47.07/47.24 ======= end of input processing =======
% 47.07/47.24
% 47.07/47.24 =========== start of search ===========
% 47.07/47.24
% 47.07/47.24
% 47.07/47.24 Resetting weight limit to 6.
% 47.07/47.24
% 47.07/47.24
% 47.07/47.24 Resetting weight limit to 6.
% 47.07/47.24
% 47.07/47.24 sos_size=509
% 47.07/47.24
% 47.07/47.24 Search stopped because sos empty.
% 47.07/47.24
% 47.07/47.24
% 47.07/47.24 Search stopped because sos empty.
% 47.07/47.24
% 47.07/47.24 ============ end of search ============
% 47.07/47.24
% 47.07/47.24 -------------- statistics -------------
% 47.07/47.24 clauses given 507
% 47.07/47.24 clauses generated 1048970
% 47.07/47.24 clauses kept 751
% 47.07/47.24 clauses forward subsumed 1979
% 47.07/47.24 clauses back subsumed 14
% 47.07/47.24 Kbytes malloced 7812
% 47.07/47.24
% 47.07/47.24 ----------- times (seconds) -----------
% 47.07/47.24 user CPU time 44.86 (0 hr, 0 min, 44 sec)
% 47.07/47.24 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 47.07/47.24 wall-clock time 47 (0 hr, 0 min, 47 sec)
% 47.07/47.24
% 47.07/47.24 Process 9910 finished Wed Jul 27 08:14:41 2022
% 47.07/47.24 Otter interrupted
% 47.07/47.24 PROOF NOT FOUND
%------------------------------------------------------------------------------