%------------------------------------------------------------------------------ % File : Otter---3.3 % Problem : PRO013+1 : TPTP v8.1.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : otter-tptp-script %s % Computer : n025.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:10:58 EDT 2022 % Result : Unknown 41.36s 41.56s % Output : None % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : PRO013+1 : TPTP v8.1.0. Released v4.0.0. % 0.03/0.12 % Command : otter-tptp-script %s % 0.12/0.33 % Computer : n025.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 05:05:00 EDT 2022 % 0.12/0.33 % CPUTime : % 2.11/2.31 ----- Otter 3.3f, August 2004 ----- % 2.11/2.31 The process was started by sandbox on n025.cluster.edu, % 2.11/2.31 Wed Jul 27 05:05:00 2022 % 2.11/2.31 The command was "./otter". The process ID is 31755. % 2.11/2.31 % 2.11/2.31 set(prolog_style_variables). % 2.11/2.31 set(auto). % 2.11/2.31 dependent: set(auto1). % 2.11/2.31 dependent: set(process_input). % 2.11/2.31 dependent: clear(print_kept). % 2.11/2.31 dependent: clear(print_new_demod). % 2.11/2.31 dependent: clear(print_back_demod). % 2.11/2.31 dependent: clear(print_back_sub). % 2.11/2.31 dependent: set(control_memory). % 2.11/2.31 dependent: assign(max_mem, 12000). % 2.11/2.31 dependent: assign(pick_given_ratio, 4). % 2.11/2.31 dependent: assign(stats_level, 1). % 2.11/2.31 dependent: assign(max_seconds, 10800). % 2.11/2.31 clear(print_given). % 2.11/2.31 % 2.11/2.31 formula_list(usable). % 2.11/2.31 all A (A=A). % 2.11/2.31 all X0 X1 (occurrence_of(X1,X0)->activity(X0)&activity_occurrence(X1)). % 2.11/2.31 all X2 (activity_occurrence(X2)-> (exists X3 (activity(X3)&occurrence_of(X2,X3)))). % 2.11/2.31 all X4 X5 X6 (occurrence_of(X4,X5)&occurrence_of(X4,X6)->X5=X6). % 2.11/2.31 all X7 (activity(X7)->subactivity(X7,X7)). % 2.11/2.31 all X8 X9 (earlier(X8,X9)-> -earlier(X9,X8)). % 2.11/2.31 all X10 X11 X12 (earlier(X10,X11)&earlier(X11,X12)->earlier(X10,X12)). % 2.11/2.31 all X13 X14 X15 (earlier(X13,X14)&earlier(X15,X14)->earlier(X15,X13)|earlier(X13,X15)|X13=X15). % 2.11/2.31 all X16 X17 (occurrence_of(X16,X17)-> (arboreal(X16)<->atomic(X17))). % 2.11/2.31 all X18 (legal(X18)->arboreal(X18)). % 2.11/2.31 all X19 X20 (legal(X19)&earlier(X20,X19)->legal(X20)). % 2.11/2.31 all X21 X22 (precedes(X21,X22)<->earlier(X21,X22)&legal(X22)). % 2.11/2.31 all X23 X24 X25 (min_precedes(X24,X25,X23)-> (exists X26 X27 (subactivity(X26,X23)&subactivity(X27,X23)&atocc(X24,X26)&atocc(X25,X27)))). % 2.11/2.31 all X28 X29 (root(X29,X28)-> (exists X30 (subactivity(X30,X28)&atocc(X29,X30)))). % 2.11/2.31 all X31 X32 X33 (min_precedes(X31,X32,X33)-> (exists X34 (root(X34,X33)&min_precedes(X34,X32,X33)))). % 2.11/2.31 all X35 X36 X37 (min_precedes(X35,X36,X37)-> -root(X36,X37)). % 2.11/2.31 all X38 X39 X40 (min_precedes(X38,X39,X40)->precedes(X38,X39)). % 2.11/2.31 all X41 X42 (root(X41,X42)->legal(X41)). % 2.11/2.31 all X43 X44 (atocc(X43,X44)&legal(X43)->root(X43,X44)). % 2.11/2.31 all X45 X46 X47 X48 (min_precedes(X45,X46,X48)&min_precedes(X45,X47,X48)&precedes(X46,X47)->min_precedes(X46,X47,X48)). % 2.11/2.31 all X49 X50 X51 (min_precedes(X49,X50,X51)-> -atomic(X51)). % 2.11/2.31 all X52 X53 X54 X55 (min_precedes(X53,X52,X55)&min_precedes(X54,X52,X55)&precedes(X53,X54)->min_precedes(X53,X54,X55)). % 2.11/2.31 all X56 X57 (leaf(X56,X57)<-> (root(X56,X57)| (exists X58 min_precedes(X58,X56,X57)))& -(exists X59 min_precedes(X56,X59,X57))). % 2.11/2.31 all X60 X61 X62 (next_subocc(X60,X61,X62)<->min_precedes(X60,X61,X62)& -(exists X63 (min_precedes(X60,X63,X62)&min_precedes(X63,X61,X62)))). % 2.11/2.31 all X64 X65 (atocc(X64,X65)<-> (exists X66 (subactivity(X65,X66)&atomic(X66)&occurrence_of(X64,X66)))). % 2.11/2.31 all X67 X68 (subactivity_occurrence(X67,X68)->activity_occurrence(X67)&activity_occurrence(X68)). % 2.11/2.31 all X69 X70 X71 (min_precedes(X70,X71,X69)-> (exists X72 (occurrence_of(X72,X69)&subactivity_occurrence(X70,X72)&subactivity_occurrence(X71,X72)))). % 2.11/2.31 all X73 X74 (root(X74,X73)& -atomic(X73)-> (exists X75 (occurrence_of(X75,X73)&subactivity_occurrence(X74,X75)))). % 2.11/2.31 all X76 X77 (occurrence_of(X77,X76)& -atomic(X76)-> (exists X78 (root(X78,X76)&subactivity_occurrence(X78,X77)))). % 2.11/2.31 all X79 X80 X81 X82 (occurrence_of(X80,X79)&arboreal(X81)&arboreal(X82)&subactivity_occurrence(X81,X80)&subactivity_occurrence(X82,X80)->min_precedes(X81,X82,X79)|min_precedes(X82,X81,X79)|X81=X82). % 2.11/2.31 all X83 X84 X85 X86 (min_precedes(X83,X84,X85)&occurrence_of(X86,X85)&subactivity_occurrence(X84,X86)->subactivity_occurrence(X83,X86)). % 2.11/2.31 all X87 X88 X89 X90 (occurrence_of(X89,X87)&occurrence_of(X90,X88)& -atomic(X87)&subactivity_occurrence(X89,X90)->subactivity(X87,X88)). % 2.11/2.31 all X91 X92 X93 (subactivity_occurrence(X91,X92)&subactivity_occurrence(X92,X93)->subactivity_occurrence(X91,X93)). % 2.11/2.31 all X94 X95 X96 X97 (occurrence_of(X96,X94)&occurrence_of(X97,X95)&subactivity(X94,X95)& -subactivity_occurrence(X96,X97)-> (exists X98 (subactivity_occurrence(X98,X97)& -subactivity_occurrence(X98,X96)))). % 2.11/2.31 all X99 X100 (root_occ(X99,X100)<-> (exists X101 (occurrence_of(X100,X101)&subactivity_occurrence(X99,X100)&root(X99,X101)))). % 2.11/2.31 all X102 X103 (leaf_occ(X102,X103)<-> (exists X104 (occurrence_of(X103,X104)&subactivity_occurrence(X102,X103)&leaf(X102,X104)))). % 2.11/2.31 all X105 (occurrence_of(X105,tptp0)-> (exists X106 X107 X108 (occurrence_of(X106,tptp3)&root_occ(X106,X105)&occurrence_of(X107,tptp4)&min_precedes(X106,X107,tptp0)& (occurrence_of(X108,tptp2)|occurrence_of(X108,tptp1))&min_precedes(X107,X108,tptp0)& (all X109 (min_precedes(X106,X109,tptp0)->X109=X107|X109=X108))))). % 2.11/2.31 activity(tptp0). % 2.11/2.31 -atomic(tptp0). % 2.11/2.31 atomic(tptp4). % 2.11/2.31 atomic(tptp2). % 2.11/2.31 atomic(tptp1). % 2.11/2.31 atomic(tptp3). % 2.11/2.31 tptp4!=tptp3. % 2.11/2.31 tptp4!=tptp2. % 2.11/2.31 tptp4!=tptp1. % 2.11/2.31 tptp3!=tptp2. % 2.11/2.31 tptp3!=tptp1. % 2.11/2.31 tptp2!=tptp1. % 2.11/2.31 -(all X110 (occurrence_of(X110,tptp0)-> (exists X111 X112 (occurrence_of(X111,tptp3)&root_occ(X111,X110)& (occurrence_of(X112,tptp2)|occurrence_of(X112,tptp1))&min_precedes(X111,X112,tptp0)&leaf_occ(X112,X110))))). % 2.11/2.31 end_of_list. % 2.11/2.31 % 2.11/2.31 -------> usable clausifies to: % 2.11/2.31 % 2.11/2.31 list(usable). % 2.11/2.31 0 [] A=A. % 2.11/2.31 0 [] -occurrence_of(X1,X0)|activity(X0). % 2.11/2.31 0 [] -occurrence_of(X1,X0)|activity_occurrence(X1). % 2.11/2.31 0 [] -activity_occurrence(X2)|activity($f1(X2)). % 2.11/2.31 0 [] -activity_occurrence(X2)|occurrence_of(X2,$f1(X2)). % 2.11/2.31 0 [] -occurrence_of(X4,X5)| -occurrence_of(X4,X6)|X5=X6. % 2.11/2.31 0 [] -activity(X7)|subactivity(X7,X7). % 2.11/2.31 0 [] -earlier(X8,X9)| -earlier(X9,X8). % 2.11/2.31 0 [] -earlier(X10,X11)| -earlier(X11,X12)|earlier(X10,X12). % 2.11/2.31 0 [] -earlier(X13,X14)| -earlier(X15,X14)|earlier(X15,X13)|earlier(X13,X15)|X13=X15. % 2.11/2.31 0 [] -occurrence_of(X16,X17)| -arboreal(X16)|atomic(X17). % 2.11/2.31 0 [] -occurrence_of(X16,X17)|arboreal(X16)| -atomic(X17). % 2.11/2.31 0 [] -legal(X18)|arboreal(X18). % 2.11/2.31 0 [] -legal(X19)| -earlier(X20,X19)|legal(X20). % 2.11/2.31 0 [] -precedes(X21,X22)|earlier(X21,X22). % 2.11/2.31 0 [] -precedes(X21,X22)|legal(X22). % 2.11/2.31 0 [] precedes(X21,X22)| -earlier(X21,X22)| -legal(X22). % 2.11/2.31 0 [] -min_precedes(X24,X25,X23)|subactivity($f3(X23,X24,X25),X23). % 2.11/2.31 0 [] -min_precedes(X24,X25,X23)|subactivity($f2(X23,X24,X25),X23). % 2.11/2.31 0 [] -min_precedes(X24,X25,X23)|atocc(X24,$f3(X23,X24,X25)). % 2.11/2.31 0 [] -min_precedes(X24,X25,X23)|atocc(X25,$f2(X23,X24,X25)). % 2.11/2.31 0 [] -root(X29,X28)|subactivity($f4(X28,X29),X28). % 2.11/2.31 0 [] -root(X29,X28)|atocc(X29,$f4(X28,X29)). % 2.11/2.31 0 [] -min_precedes(X31,X32,X33)|root($f5(X31,X32,X33),X33). % 2.11/2.31 0 [] -min_precedes(X31,X32,X33)|min_precedes($f5(X31,X32,X33),X32,X33). % 2.11/2.31 0 [] -min_precedes(X35,X36,X37)| -root(X36,X37). % 2.11/2.31 0 [] -min_precedes(X38,X39,X40)|precedes(X38,X39). % 2.11/2.31 0 [] -root(X41,X42)|legal(X41). % 2.11/2.31 0 [] -atocc(X43,X44)| -legal(X43)|root(X43,X44). % 2.11/2.31 0 [] -min_precedes(X45,X46,X48)| -min_precedes(X45,X47,X48)| -precedes(X46,X47)|min_precedes(X46,X47,X48). % 2.11/2.31 0 [] -min_precedes(X49,X50,X51)| -atomic(X51). % 2.11/2.31 0 [] -min_precedes(X53,X52,X55)| -min_precedes(X54,X52,X55)| -precedes(X53,X54)|min_precedes(X53,X54,X55). % 2.11/2.31 0 [] -leaf(X56,X57)|root(X56,X57)|min_precedes($f6(X56,X57),X56,X57). % 2.11/2.31 0 [] -leaf(X56,X57)| -min_precedes(X56,X59,X57). % 2.11/2.31 0 [] leaf(X56,X57)| -root(X56,X57)|min_precedes(X56,$f7(X56,X57),X57). % 2.11/2.31 0 [] leaf(X56,X57)| -min_precedes(X58,X56,X57)|min_precedes(X56,$f7(X56,X57),X57). % 2.11/2.31 0 [] -next_subocc(X60,X61,X62)|min_precedes(X60,X61,X62). % 2.11/2.31 0 [] -next_subocc(X60,X61,X62)| -min_precedes(X60,X63,X62)| -min_precedes(X63,X61,X62). % 2.11/2.31 0 [] next_subocc(X60,X61,X62)| -min_precedes(X60,X61,X62)|min_precedes(X60,$f8(X60,X61,X62),X62). % 2.11/2.31 0 [] next_subocc(X60,X61,X62)| -min_precedes(X60,X61,X62)|min_precedes($f8(X60,X61,X62),X61,X62). % 2.11/2.31 0 [] -atocc(X64,X65)|subactivity(X65,$f9(X64,X65)). % 2.11/2.31 0 [] -atocc(X64,X65)|atomic($f9(X64,X65)). % 2.11/2.31 0 [] -atocc(X64,X65)|occurrence_of(X64,$f9(X64,X65)). % 2.11/2.31 0 [] atocc(X64,X65)| -subactivity(X65,X66)| -atomic(X66)| -occurrence_of(X64,X66). % 2.11/2.31 0 [] -subactivity_occurrence(X67,X68)|activity_occurrence(X67). % 2.11/2.31 0 [] -subactivity_occurrence(X67,X68)|activity_occurrence(X68). % 2.11/2.31 0 [] -min_precedes(X70,X71,X69)|occurrence_of($f10(X69,X70,X71),X69). % 2.11/2.31 0 [] -min_precedes(X70,X71,X69)|subactivity_occurrence(X70,$f10(X69,X70,X71)). % 2.11/2.31 0 [] -min_precedes(X70,X71,X69)|subactivity_occurrence(X71,$f10(X69,X70,X71)). % 2.11/2.31 0 [] -root(X74,X73)|atomic(X73)|occurrence_of($f11(X73,X74),X73). % 2.11/2.31 0 [] -root(X74,X73)|atomic(X73)|subactivity_occurrence(X74,$f11(X73,X74)). % 2.11/2.31 0 [] -occurrence_of(X77,X76)|atomic(X76)|root($f12(X76,X77),X76). % 2.11/2.31 0 [] -occurrence_of(X77,X76)|atomic(X76)|subactivity_occurrence($f12(X76,X77),X77). % 2.11/2.31 0 [] -occurrence_of(X80,X79)| -arboreal(X81)| -arboreal(X82)| -subactivity_occurrence(X81,X80)| -subactivity_occurrence(X82,X80)|min_precedes(X81,X82,X79)|min_precedes(X82,X81,X79)|X81=X82. % 2.11/2.31 0 [] -min_precedes(X83,X84,X85)| -occurrence_of(X86,X85)| -subactivity_occurrence(X84,X86)|subactivity_occurrence(X83,X86). % 2.11/2.31 0 [] -occurrence_of(X89,X87)| -occurrence_of(X90,X88)|atomic(X87)| -subactivity_occurrence(X89,X90)|subactivity(X87,X88). % 2.11/2.31 0 [] -subactivity_occurrence(X91,X92)| -subactivity_occurrence(X92,X93)|subactivity_occurrence(X91,X93). % 2.11/2.31 0 [] -occurrence_of(X96,X94)| -occurrence_of(X97,X95)| -subactivity(X94,X95)|subactivity_occurrence(X96,X97)|subactivity_occurrence($f13(X94,X95,X96,X97),X97). % 2.11/2.31 0 [] -occurrence_of(X96,X94)| -occurrence_of(X97,X95)| -subactivity(X94,X95)|subactivity_occurrence(X96,X97)| -subactivity_occurrence($f13(X94,X95,X96,X97),X96). % 2.11/2.31 0 [] -root_occ(X99,X100)|occurrence_of(X100,$f14(X99,X100)). % 2.11/2.31 0 [] -root_occ(X99,X100)|subactivity_occurrence(X99,X100). % 2.11/2.31 0 [] -root_occ(X99,X100)|root(X99,$f14(X99,X100)). % 2.11/2.31 0 [] root_occ(X99,X100)| -occurrence_of(X100,X101)| -subactivity_occurrence(X99,X100)| -root(X99,X101). % 2.11/2.31 0 [] -leaf_occ(X102,X103)|occurrence_of(X103,$f15(X102,X103)). % 2.11/2.31 0 [] -leaf_occ(X102,X103)|subactivity_occurrence(X102,X103). % 2.11/2.31 0 [] -leaf_occ(X102,X103)|leaf(X102,$f15(X102,X103)). % 2.11/2.31 0 [] leaf_occ(X102,X103)| -occurrence_of(X103,X104)| -subactivity_occurrence(X102,X103)| -leaf(X102,X104). % 2.11/2.31 0 [] -occurrence_of(X105,tptp0)|occurrence_of($f18(X105),tptp3). % 2.11/2.31 0 [] -occurrence_of(X105,tptp0)|root_occ($f18(X105),X105). % 2.11/2.31 0 [] -occurrence_of(X105,tptp0)|occurrence_of($f17(X105),tptp4). % 2.11/2.31 0 [] -occurrence_of(X105,tptp0)|min_precedes($f18(X105),$f17(X105),tptp0). % 2.11/2.31 0 [] -occurrence_of(X105,tptp0)|occurrence_of($f16(X105),tptp2)|occurrence_of($f16(X105),tptp1). % 2.11/2.31 0 [] -occurrence_of(X105,tptp0)|min_precedes($f17(X105),$f16(X105),tptp0). % 2.11/2.31 0 [] -occurrence_of(X105,tptp0)| -min_precedes($f18(X105),X109,tptp0)|X109=$f17(X105)|X109=$f16(X105). % 2.11/2.31 0 [] activity(tptp0). % 2.11/2.31 0 [] -atomic(tptp0). % 2.11/2.31 0 [] atomic(tptp4). % 2.11/2.31 0 [] atomic(tptp2). % 2.11/2.31 0 [] atomic(tptp1). % 2.11/2.31 0 [] atomic(tptp3). % 2.11/2.31 0 [] tptp4!=tptp3. % 2.11/2.31 0 [] tptp4!=tptp2. % 2.11/2.31 0 [] tptp4!=tptp1. % 2.11/2.31 0 [] tptp3!=tptp2. % 2.11/2.31 0 [] tptp3!=tptp1. % 2.11/2.31 0 [] tptp2!=tptp1. % 2.11/2.31 0 [] occurrence_of($c1,tptp0). % 2.11/2.31 0 [] -occurrence_of(X111,tptp3)| -root_occ(X111,$c1)| -occurrence_of(X112,tptp2)| -min_precedes(X111,X112,tptp0)| -leaf_occ(X112,$c1). % 2.11/2.31 0 [] -occurrence_of(X111,tptp3)| -root_occ(X111,$c1)| -occurrence_of(X112,tptp1)| -min_precedes(X111,X112,tptp0)| -leaf_occ(X112,$c1). % 2.11/2.31 end_of_list. % 2.11/2.31 % 2.11/2.31 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8. % 2.11/2.31 % 2.11/2.31 This ia a non-Horn set with equality. The strategy will be % 2.11/2.31 Knuth-Bendix, ordered hyper_res, factoring, and unit % 2.11/2.31 deletion, with positive clauses in sos and nonpositive % 2.11/2.31 clauses in usable. % 2.11/2.31 % 2.11/2.31 dependent: set(knuth_bendix). % 2.11/2.31 dependent: set(anl_eq). % 2.11/2.31 dependent: set(para_from). % 2.11/2.31 dependent: set(para_into). % 2.11/2.31 dependent: clear(para_from_right). % 2.11/2.31 dependent: clear(para_into_right). % 2.11/2.31 dependent: set(para_from_vars). % 2.11/2.31 dependent: set(eq_units_both_ways). % 2.11/2.31 dependent: set(dynamic_demod_all). % 2.11/2.31 dependent: set(dynamic_demod). % 2.11/2.31 dependent: set(order_eq). % 2.11/2.31 dependent: set(back_demod). % 2.11/2.31 dependent: set(lrpo). % 2.11/2.31 dependent: set(hyper_res). % 2.11/2.31 dependent: set(unit_deletion). % 2.11/2.31 dependent: set(factor). % 2.11/2.31 % 2.11/2.31 ------------> process usable: % 2.11/2.31 ** KEPT (pick-wt=5): 1 [] -occurrence_of(A,B)|activity(B). % 2.11/2.31 ** KEPT (pick-wt=5): 2 [] -occurrence_of(A,B)|activity_occurrence(A). % 2.11/2.31 ** KEPT (pick-wt=5): 3 [] -activity_occurrence(A)|activity($f1(A)). % 2.11/2.31 ** KEPT (pick-wt=6): 4 [] -activity_occurrence(A)|occurrence_of(A,$f1(A)). % 2.11/2.31 ** KEPT (pick-wt=9): 5 [] -occurrence_of(A,B)| -occurrence_of(A,C)|B=C. % 2.11/2.31 ** KEPT (pick-wt=5): 6 [] -activity(A)|subactivity(A,A). % 2.11/2.31 ** KEPT (pick-wt=6): 7 [] -earlier(A,B)| -earlier(B,A). % 2.11/2.31 ** KEPT (pick-wt=9): 8 [] -earlier(A,B)| -earlier(B,C)|earlier(A,C). % 2.11/2.31 ** KEPT (pick-wt=15): 9 [] -earlier(A,B)| -earlier(C,B)|earlier(C,A)|earlier(A,C)|A=C. % 2.11/2.31 ** KEPT (pick-wt=7): 10 [] -occurrence_of(A,B)| -arboreal(A)|atomic(B). % 2.11/2.31 ** KEPT (pick-wt=7): 11 [] -occurrence_of(A,B)|arboreal(A)| -atomic(B). % 2.11/2.31 ** KEPT (pick-wt=4): 12 [] -legal(A)|arboreal(A). % 2.11/2.31 ** KEPT (pick-wt=7): 13 [] -legal(A)| -earlier(B,A)|legal(B). % 2.11/2.32 ** KEPT (pick-wt=6): 14 [] -precedes(A,B)|earlier(A,B). % 2.11/2.32 ** KEPT (pick-wt=5): 15 [] -precedes(A,B)|legal(B). % 2.11/2.32 ** KEPT (pick-wt=8): 16 [] precedes(A,B)| -earlier(A,B)| -legal(B). % 2.11/2.32 ** KEPT (pick-wt=10): 17 [] -min_precedes(A,B,C)|subactivity($f3(C,A,B),C). % 2.11/2.32 ** KEPT (pick-wt=10): 18 [] -min_precedes(A,B,C)|subactivity($f2(C,A,B),C). % 2.11/2.32 ** KEPT (pick-wt=10): 19 [] -min_precedes(A,B,C)|atocc(A,$f3(C,A,B)). % 2.11/2.32 ** KEPT (pick-wt=10): 20 [] -min_precedes(A,B,C)|atocc(B,$f2(C,A,B)). % 2.11/2.32 ** KEPT (pick-wt=8): 21 [] -root(A,B)|subactivity($f4(B,A),B). % 2.11/2.32 ** KEPT (pick-wt=8): 22 [] -root(A,B)|atocc(A,$f4(B,A)). % 2.11/2.32 ** KEPT (pick-wt=10): 23 [] -min_precedes(A,B,C)|root($f5(A,B,C),C). % 2.11/2.32 ** KEPT (pick-wt=11): 24 [] -min_precedes(A,B,C)|min_precedes($f5(A,B,C),B,C). % 2.11/2.32 ** KEPT (pick-wt=7): 25 [] -min_precedes(A,B,C)| -root(B,C). % 2.11/2.32 ** KEPT (pick-wt=7): 26 [] -min_precedes(A,B,C)|precedes(A,B). % 2.11/2.32 ** KEPT (pick-wt=5): 27 [] -root(A,B)|legal(A). % 2.11/2.32 ** KEPT (pick-wt=8): 28 [] -atocc(A,B)| -legal(A)|root(A,B). % 2.11/2.32 ** KEPT (pick-wt=15): 29 [] -min_precedes(A,B,C)| -min_precedes(A,D,C)| -precedes(B,D)|min_precedes(B,D,C). % 2.11/2.32 ** KEPT (pick-wt=6): 30 [] -min_precedes(A,B,C)| -atomic(C). % 2.11/2.32 ** KEPT (pick-wt=15): 31 [] -min_precedes(A,B,C)| -min_precedes(D,B,C)| -precedes(A,D)|min_precedes(A,D,C). % 2.11/2.32 ** KEPT (pick-wt=12): 32 [] -leaf(A,B)|root(A,B)|min_precedes($f6(A,B),A,B). % 2.11/2.32 ** KEPT (pick-wt=7): 33 [] -leaf(A,B)| -min_precedes(A,C,B). % 2.11/2.32 ** KEPT (pick-wt=12): 34 [] leaf(A,B)| -root(A,B)|min_precedes(A,$f7(A,B),B). % 2.11/2.32 ** KEPT (pick-wt=13): 35 [] leaf(A,B)| -min_precedes(C,A,B)|min_precedes(A,$f7(A,B),B). % 2.11/2.32 ** KEPT (pick-wt=8): 36 [] -next_subocc(A,B,C)|min_precedes(A,B,C). % 2.11/2.32 ** KEPT (pick-wt=12): 37 [] -next_subocc(A,B,C)| -min_precedes(A,D,C)| -min_precedes(D,B,C). % 2.11/2.32 ** KEPT (pick-wt=15): 38 [] next_subocc(A,B,C)| -min_precedes(A,B,C)|min_precedes(A,$f8(A,B,C),C). % 2.11/2.32 ** KEPT (pick-wt=15): 39 [] next_subocc(A,B,C)| -min_precedes(A,B,C)|min_precedes($f8(A,B,C),B,C). % 2.11/2.32 ** KEPT (pick-wt=8): 40 [] -atocc(A,B)|subactivity(B,$f9(A,B)). % 2.11/2.32 ** KEPT (pick-wt=7): 41 [] -atocc(A,B)|atomic($f9(A,B)). % 2.11/2.32 ** KEPT (pick-wt=8): 42 [] -atocc(A,B)|occurrence_of(A,$f9(A,B)). % 2.11/2.32 ** KEPT (pick-wt=11): 43 [] atocc(A,B)| -subactivity(B,C)| -atomic(C)| -occurrence_of(A,C). % 2.11/2.32 ** KEPT (pick-wt=5): 44 [] -subactivity_occurrence(A,B)|activity_occurrence(A). % 2.11/2.32 ** KEPT (pick-wt=5): 45 [] -subactivity_occurrence(A,B)|activity_occurrence(B). % 2.11/2.32 ** KEPT (pick-wt=10): 46 [] -min_precedes(A,B,C)|occurrence_of($f10(C,A,B),C). % 2.11/2.32 ** KEPT (pick-wt=10): 47 [] -min_precedes(A,B,C)|subactivity_occurrence(A,$f10(C,A,B)). % 2.11/2.32 ** KEPT (pick-wt=10): 48 [] -min_precedes(A,B,C)|subactivity_occurrence(B,$f10(C,A,B)). % 2.11/2.32 ** KEPT (pick-wt=10): 49 [] -root(A,B)|atomic(B)|occurrence_of($f11(B,A),B). % 2.11/2.32 ** KEPT (pick-wt=10): 50 [] -root(A,B)|atomic(B)|subactivity_occurrence(A,$f11(B,A)). % 2.11/2.32 ** KEPT (pick-wt=10): 51 [] -occurrence_of(A,B)|atomic(B)|root($f12(B,A),B). % 2.11/2.32 ** KEPT (pick-wt=10): 52 [] -occurrence_of(A,B)|atomic(B)|subactivity_occurrence($f12(B,A),A). % 2.11/2.32 ** KEPT (pick-wt=24): 53 [] -occurrence_of(A,B)| -arboreal(C)| -arboreal(D)| -subactivity_occurrence(C,A)| -subactivity_occurrence(D,A)|min_precedes(C,D,B)|min_precedes(D,C,B)|C=D. % 2.11/2.32 ** KEPT (pick-wt=13): 54 [] -min_precedes(A,B,C)| -occurrence_of(D,C)| -subactivity_occurrence(B,D)|subactivity_occurrence(A,D). % 2.11/2.32 ** KEPT (pick-wt=14): 55 [] -occurrence_of(A,B)| -occurrence_of(C,D)|atomic(B)| -subactivity_occurrence(A,C)|subactivity(B,D). % 2.11/2.32 ** KEPT (pick-wt=9): 56 [] -subactivity_occurrence(A,B)| -subactivity_occurrence(B,C)|subactivity_occurrence(A,C). % 2.11/2.32 ** KEPT (pick-wt=19): 57 [] -occurrence_of(A,B)| -occurrence_of(C,D)| -subactivity(B,D)|subactivity_occurrence(A,C)|subactivity_occurrence($f13(B,D,A,C),C). % 2.11/2.32 ** KEPT (pick-wt=19): 58 [] -occurrence_of(A,B)| -occurrence_of(C,D)| -subactivity(B,D)|subactivity_occurrence(A,C)| -subactivity_occurrence($f13(B,D,A,C),A). % 2.11/2.32 ** KEPT (pick-wt=8): 59 [] -root_occ(A,B)|occurrence_of(B,$f14(A,B)). % 2.11/2.32 ** KEPT (pick-wt=6): 60 [] -root_occ(A,B)|subactivity_occurrence(A,B). % 2.11/2.32 ** KEPT (pick-wt=8): 61 [] -root_occ(A,B)|root(A,$f14(A,B)). % 2.11/2.32 ** KEPT (pick-wt=12): 62 [] root_occ(A,B)| -occurrence_of(B,C)| -subactivity_occurrence(A,B)| -root(A,C). % 41.36/41.56 ** KEPT (pick-wt=8): 63 [] -leaf_occ(A,B)|occurrence_of(B,$f15(A,B)). % 41.36/41.56 ** KEPT (pick-wt=6): 64 [] -leaf_occ(A,B)|subactivity_occurrence(A,B). % 41.36/41.56 ** KEPT (pick-wt=8): 65 [] -leaf_occ(A,B)|leaf(A,$f15(A,B)). % 41.36/41.56 ** KEPT (pick-wt=12): 66 [] leaf_occ(A,B)| -occurrence_of(B,C)| -subactivity_occurrence(A,B)| -leaf(A,C). % 41.36/41.56 ** KEPT (pick-wt=7): 67 [] -occurrence_of(A,tptp0)|occurrence_of($f18(A),tptp3). % 41.36/41.56 ** KEPT (pick-wt=7): 68 [] -occurrence_of(A,tptp0)|root_occ($f18(A),A). % 41.36/41.56 ** KEPT (pick-wt=7): 69 [] -occurrence_of(A,tptp0)|occurrence_of($f17(A),tptp4). % 41.36/41.56 ** KEPT (pick-wt=9): 70 [] -occurrence_of(A,tptp0)|min_precedes($f18(A),$f17(A),tptp0). % 41.36/41.56 ** KEPT (pick-wt=11): 71 [] -occurrence_of(A,tptp0)|occurrence_of($f16(A),tptp2)|occurrence_of($f16(A),tptp1). % 41.36/41.56 ** KEPT (pick-wt=9): 72 [] -occurrence_of(A,tptp0)|min_precedes($f17(A),$f16(A),tptp0). % 41.36/41.56 ** KEPT (pick-wt=16): 73 [] -occurrence_of(A,tptp0)| -min_precedes($f18(A),B,tptp0)|B=$f17(A)|B=$f16(A). % 41.36/41.56 ** KEPT (pick-wt=2): 74 [] -atomic(tptp0). % 41.36/41.56 ** KEPT (pick-wt=3): 75 [] tptp4!=tptp3. % 41.36/41.56 ** KEPT (pick-wt=3): 76 [] tptp4!=tptp2. % 41.36/41.56 ** KEPT (pick-wt=3): 77 [] tptp4!=tptp1. % 41.36/41.56 ** KEPT (pick-wt=3): 78 [] tptp3!=tptp2. % 41.36/41.56 ** KEPT (pick-wt=3): 79 [] tptp3!=tptp1. % 41.36/41.56 ** KEPT (pick-wt=3): 80 [] tptp2!=tptp1. % 41.36/41.56 ** KEPT (pick-wt=16): 81 [] -occurrence_of(A,tptp3)| -root_occ(A,$c1)| -occurrence_of(B,tptp2)| -min_precedes(A,B,tptp0)| -leaf_occ(B,$c1). % 41.36/41.56 ** KEPT (pick-wt=16): 82 [] -occurrence_of(A,tptp3)| -root_occ(A,$c1)| -occurrence_of(B,tptp1)| -min_precedes(A,B,tptp0)| -leaf_occ(B,$c1). % 41.36/41.56 % 41.36/41.56 ------------> process sos: % 41.36/41.56 ** KEPT (pick-wt=3): 93 [] A=A. % 41.36/41.56 ** KEPT (pick-wt=2): 94 [] activity(tptp0). % 41.36/41.56 ** KEPT (pick-wt=2): 95 [] atomic(tptp4). % 41.36/41.56 ** KEPT (pick-wt=2): 96 [] atomic(tptp2). % 41.36/41.56 ** KEPT (pick-wt=2): 97 [] atomic(tptp1). % 41.36/41.56 ** KEPT (pick-wt=2): 98 [] atomic(tptp3). % 41.36/41.56 ** KEPT (pick-wt=3): 99 [] occurrence_of($c1,tptp0). % 41.36/41.56 Following clause subsumed by 93 during input processing: 0 [copy,93,flip.1] A=A. % 41.36/41.56 93 back subsumes 89. % 41.36/41.56 93 back subsumes 85. % 41.36/41.56 93 back subsumes 83. % 41.36/41.56 % 41.36/41.56 ======= end of input processing ======= % 41.36/41.56 % 41.36/41.56 =========== start of search =========== % 41.36/41.56 % 41.36/41.56 % 41.36/41.56 Resetting weight limit to 9. % 41.36/41.56 % 41.36/41.56 % 41.36/41.56 Resetting weight limit to 9. % 41.36/41.56 % 41.36/41.56 sos_size=992 % 41.36/41.56 % 41.36/41.56 Search stopped because sos empty. % 41.36/41.56 % 41.36/41.56 % 41.36/41.56 Search stopped because sos empty. % 41.36/41.56 % 41.36/41.56 ============ end of search ============ % 41.36/41.56 % 41.36/41.56 -------------- statistics ------------- % 41.36/41.56 clauses given 1273 % 41.36/41.56 clauses generated 753169 % 41.36/41.56 clauses kept 1428 % 41.36/41.56 clauses forward subsumed 2654 % 41.36/41.56 clauses back subsumed 49 % 41.36/41.56 Kbytes malloced 7812 % 41.36/41.56 % 41.36/41.56 ----------- times (seconds) ----------- % 41.36/41.56 user CPU time 39.24 (0 hr, 0 min, 39 sec) % 41.36/41.56 system CPU time 0.00 (0 hr, 0 min, 0 sec) % 41.36/41.56 wall-clock time 41 (0 hr, 0 min, 41 sec) % 41.36/41.56 % 41.36/41.56 Process 31755 finished Wed Jul 27 05:05:41 2022 % 41.36/41.56 Otter interrupted % 41.36/41.56 PROOF NOT FOUND %------------------------------------------------------------------------------