0.05/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.05/0.10 % Command : tptp2X_and_run_prover9 %d %s 0.09/0.30 % Computer : n010.cluster.edu 0.09/0.30 % Model : x86_64 x86_64 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.09/0.30 % Memory : 8042.1875MB 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64 0.09/0.30 % CPULimit : 960 0.09/0.30 % DateTime : Thu Jul 2 06:51:42 EDT 2020 0.09/0.30 % CPUTime : 0.75/1.06 ============================== Prover9 =============================== 0.75/1.06 Prover9 (32) version 2009-11A, November 2009. 0.75/1.06 Process 17417 was started by sandbox2 on n010.cluster.edu, 0.75/1.06 Thu Jul 2 06:51:43 2020 0.75/1.06 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_17264_n010.cluster.edu". 0.75/1.06 ============================== end of head =========================== 0.75/1.06 0.75/1.06 ============================== INPUT ================================= 0.75/1.06 0.75/1.06 % Reading from file /tmp/Prover9_17264_n010.cluster.edu 0.75/1.06 0.75/1.06 set(prolog_style_variables). 0.75/1.06 set(auto2). 0.75/1.06 % set(auto2) -> set(auto). 0.75/1.06 % set(auto) -> set(auto_inference). 0.75/1.06 % set(auto) -> set(auto_setup). 0.75/1.06 % set(auto_setup) -> set(predicate_elim). 0.75/1.06 % set(auto_setup) -> assign(eq_defs, unfold). 0.75/1.06 % set(auto) -> set(auto_limits). 0.75/1.06 % set(auto_limits) -> assign(max_weight, "100.000"). 0.75/1.06 % set(auto_limits) -> assign(sos_limit, 20000). 0.75/1.06 % set(auto) -> set(auto_denials). 0.75/1.06 % set(auto) -> set(auto_process). 0.75/1.06 % set(auto2) -> assign(new_constants, 1). 0.75/1.06 % set(auto2) -> assign(fold_denial_max, 3). 0.75/1.06 % set(auto2) -> assign(max_weight, "200.000"). 0.75/1.06 % set(auto2) -> assign(max_hours, 1). 0.75/1.06 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.75/1.06 % set(auto2) -> assign(max_seconds, 0). 0.75/1.06 % set(auto2) -> assign(max_minutes, 5). 0.75/1.06 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.75/1.06 % set(auto2) -> set(sort_initial_sos). 0.75/1.06 % set(auto2) -> assign(sos_limit, -1). 0.75/1.06 % set(auto2) -> assign(lrs_ticks, 3000). 0.75/1.06 % set(auto2) -> assign(max_megs, 400). 0.75/1.06 % set(auto2) -> assign(stats, some). 0.75/1.06 % set(auto2) -> clear(echo_input). 0.75/1.06 % set(auto2) -> set(quiet). 0.75/1.06 % set(auto2) -> clear(print_initial_clauses). 0.75/1.06 % set(auto2) -> clear(print_given). 0.75/1.06 assign(lrs_ticks,-1). 0.75/1.06 assign(sos_limit,10000). 0.75/1.06 assign(order,kbo). 0.75/1.06 set(lex_order_vars). 0.75/1.06 clear(print_given). 0.75/1.06 0.75/1.06 % formulas(sos). % not echoed (46 formulas) 0.75/1.06 0.75/1.06 ============================== end of input ========================== 0.75/1.06 0.75/1.06 % From the command line: assign(max_seconds, 960). 0.75/1.06 0.75/1.06 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.75/1.06 0.75/1.06 % Formulas that are not ordinary clauses: 0.75/1.06 1 (all X38 all X39 (root(X38,X39) -> legal(X38))) # label(sos_12) # label(axiom) # label(non_clause). [assumption]. 0.75/1.06 2 (all X91 all X92 (-atomic(X91) & occurrence_of(X92,X91) -> (exists X93 (subactivity_occurrence(X93,X92) & root(X93,X91))))) # label(sos_30) # label(axiom) # label(non_clause). [assumption]. 0.75/1.06 3 (all X4 all X5 all X6 (earlier(X5,X6) & earlier(X4,X5) -> earlier(X4,X6))) # label(sos_01) # label(axiom) # label(non_clause). [assumption]. 0.75/1.06 4 (all X67 all X68 (leaf(X67,X68) & -atomic(X68) -> (exists X69 (leaf_occ(X67,X69) & occurrence_of(X69,X68))))) # label(sos_23) # label(axiom) # label(non_clause). [assumption]. 0.75/1.06 5 (all X74 all X75 (-atomic(X75) & leaf(X74,X75) -> (exists X76 (leaf_occ(X74,X76) & occurrence_of(X76,X75))))) # label(sos_25) # label(axiom) # label(non_clause). [assumption]. 0.75/1.06 6 (all X0 all X1 all X2 all X3 (min_precedes(X0,X1,X3) & min_precedes(X1,X2,X3) -> min_precedes(X0,X2,X3))) # label(sos) # label(axiom) # label(non_clause). [assumption]. 0.75/1.06 7 (all X35 all X36 ((exists X37 (occurrence_of(X36,X37) & subactivity_occurrence(X35,X36) & leaf(X35,X37))) <-> leaf_occ(X35,X36))) # label(sos_11) # label(axiom) # label(non_clause). [assumption]. 0.75/1.06 8 (all X56 all X57 all X58 (root_occ(X57,X56) & occurrence_of(X56,X58) -> -(exists X59 min_precedes(X59,X57,X58)))) # label(sos_20) # label(axiom) # label(non_clause). [assumption]. 0.75/1.06 9 (all X19 all X20 all X21 (next_subocc(X19,X20,X21) -> arboreal(X19) & arboreal(X20))) # label(sos_05) # label(axiom) # label(non_clause). [assumption]. 0.75/1.06 10 (all X30 all X31 (earlier(X30,X31) -> -earlier(X31,X30))) # label(sos_09) # label(axiom) # label(non_clause). [assumption]. 0.75/1.06 11 (all X70 all X71 all X72 (min_precedes(X71,X72,X70) -> (exists X73 (subactivity_occurrence(X71,X73) & subactivity_occurrence(X72,X73) & occurrence_of(X73,X70))))) # label(sos_24) # label(axiom) # label(non_clause). [assumption]. 0.75/1.06 12 (all X11 all X12 all X13 all X14 (occurrence_of(X13,X14) & -atomic(X14) & leaf_occ(X11,X13) & leaf_occ(X12,X13) -> X12 = X11)) # label(sos_03) # label(axiom) # label(non_clause). [assumption]. 0.75/1.06 13 (all X82 all X83 (root(X83,X82) -> (exists X84 (subactivity(X84,X82) & atocc(X83,X84))))) # label(sos_27) # label(axiom) # label(non_clause). [assumption]. 0.75/1.06 14 (all X60 all X61 all X62 (occurrence_of(X60,X62) & leaf_occ(X61,X60) -> -(exists X63 min_precedes(X61,X63,X62)))) # label(sos_21) # label(axiom) # label(non_clause). [assumption]. 0.75/1.06 15 (all X85 all X86 all X87 all X88 (occurrence_of(X86,X85) & subactivity_occurrence(X87,X86) & subactivity_occurrence(X88,X86) & arboreal(X88) & arboreal(X87) -> X87 = X88 | min_precedes(X88,X87,X85) | min_precedes(X87,X88,X85))) # label(sos_28) # label(axiom) # label(non_clause). [assumption]. 0.75/1.06 16 (all X89 all X90 (occurrence_of(X90,X89) -> activity(X89) & activity_occurrence(X90))) # label(sos_29) # label(axiom) # label(non_clause). [assumption]. 0.75/1.06 17 (all X49 all X50 (atocc(X49,X50) & legal(X49) -> root(X49,X50))) # label(sos_16) # label(axiom) # label(non_clause). [assumption]. 0.75/1.06 18 (all X32 all X33 ((exists X34 (subactivity_occurrence(X32,X33) & root(X32,X34) & occurrence_of(X33,X34))) <-> root_occ(X32,X33))) # label(sos_10) # label(axiom) # label(non_clause). [assumption]. 0.75/1.06 19 (all X64 all X65 all X66 (occurrence_of(X64,X65) & occurrence_of(X64,X66) -> X66 = X65)) # label(sos_22) # label(axiom) # label(non_clause). [assumption]. 0.75/1.06 20 (all X46 all X47 (atocc(X46,X47) <-> (exists X48 (subactivity(X47,X48) & occurrence_of(X46,X48) & atomic(X48))))) # label(sos_15) # label(axiom) # label(non_clause). [assumption]. 0.75/1.06 21 (all X52 (activity_occurrence(X52) -> (exists X53 (occurrence_of(X52,X53) & activity(X53))))) # label(sos_18) # label(axiom) # label(non_clause). [assumption]. 0.75/1.06 22 (all X40 all X41 (occurrence_of(X40,X41) -> (atomic(X41) <-> arboreal(X40)))) # label(sos_13) # label(axiom) # label(non_clause). [assumption]. 0.75/1.06 23 (all X77 all X78 all X79 (min_precedes(X78,X79,X77) -> (exists X80 exists X81 (subactivity(X80,X77) & atocc(X78,X80) & atocc(X79,X81) & subactivity(X81,X77))))) # label(sos_26) # label(axiom) # label(non_clause). [assumption]. 0.75/1.06 24 (all X15 all X16 all X17 (next_subocc(X15,X16,X17) <-> -(exists X18 (min_precedes(X15,X18,X17) & min_precedes(X18,X16,X17))) & min_precedes(X15,X16,X17))) # label(sos_04) # label(axiom) # label(non_clause). [assumption]. 0.75/1.06 25 (all X22 all X23 all X24 (min_precedes(X22,X23,X24) -> precedes(X22,X23))) # label(sos_06) # label(axiom) # label(non_clause). [assumption]. 0.75/1.06 26 (all X51 (legal(X51) -> arboreal(X51))) # label(sos_17) # label(axiom) # label(non_clause). [assumption]. 0.75/1.06 27 (all X95 (occurrence_of(X95,tptp0) -> (exists X96 exists X97 exists X98 (occurrence_of(X96,tptp3) & next_subocc(X96,X97,tptp0) & next_subocc(X97,X98,tptp0) & leaf_occ(X98,X95) & (occurrence_of(X98,tptp1) | occurrence_of(X98,tptp2)) & occurrence_of(X97,tptp4) & root_occ(X96,X95))))) # label(sos_32) # label(axiom) # label(non_clause). [assumption]. 0.75/1.06 28 (all X7 all X8 all X9 all X10 (root_occ(X7,X9) & root_occ(X8,X9) & occurrence_of(X9,X10) -> X7 = X8)) # label(sos_02) # label(axiom) # label(non_clause). [assumption]. 0.75/1.06 29 (all X94 (activity(X94) -> subactivity(X94,X94))) # label(sos_31) # label(axiom) # label(non_clause). [assumption]. 0.75/1.06 30 (all X25 all X26 all X27 (min_precedes(X25,X26,X27) -> -root(X26,X27))) # label(sos_07) # label(axiom) # label(non_clause). [assumption]. 0.75/1.06 31 (all X28 all X29 (legal(X29) & earlier(X28,X29) <-> precedes(X28,X29))) # label(sos_08) # label(axiom) # label(non_clause). [assumption]. 0.75/1.06 32 (all X54 all X55 (subactivity_occurrence(X54,X55) -> activity_occurrence(X54) & activity_occurrence(X55))) # label(sos_19) # label(axiom) # label(non_clause). [assumption]. 0.75/1.06 33 (all X42 all X43 (-(exists X45 min_precedes(X42,X45,X43)) & (root(X42,X43) | (exists X44 min_precedes(X44,X42,X43))) <-> leaf(X42,X43))) # label(sos_14) # label(axiom) # label(non_clause). [assumption]. 0.75/1.06 34 -(all X99 (occurrence_of(X99,tptp0) -> (exists X100 exists X101 ((occurrence_of(X101,tptp2) -> -(exists X103 (occurrence_of(X103,tptp1) & subactivity_occurrence(X103,X99) & min_precedes(X100,X103,tptp0)))) & (occurrence_of(X101,tptp1) -> -(exists X102 (occurrence_of(X102,tptp2) & min_precedes(X100,X102,tptp0) & subactivity_occurrence(X102,X99)))) & leaf_occ(X101,X99))))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption]. 0.75/1.07 0.75/1.07 ============================== end of process non-clausal formulas === 0.75/1.07 0.75/1.07 ============================== PROCESS INITIAL CLAUSES =============== 0.75/1.07 0.75/1.07 ============================== PREDICATE ELIMINATION ================= 0.75/1.07 35 -activity(A) | subactivity(A,A) # label(sos_31) # label(axiom). [clausify(29)]. 0.75/1.07 36 activity(tptp0) # label(sos_33) # label(axiom). [assumption]. 0.75/1.07 37 -occurrence_of(A,B) | activity(B) # label(sos_29) # label(axiom). [clausify(16)]. 0.75/1.07 38 -activity_occurrence(A) | activity(f9(A)) # label(sos_18) # label(axiom). [clausify(21)]. 0.75/1.07 Derived: subactivity(tptp0,tptp0). [resolve(35,a,36,a)]. 0.75/1.07 Derived: subactivity(A,A) | -occurrence_of(B,A). [resolve(35,a,37,b)]. 0.75/1.07 Derived: subactivity(f9(A),f9(A)) | -activity_occurrence(A). [resolve(35,a,38,b)]. 0.75/1.07 39 -atocc(A,B) | -legal(A) | root(A,B) # label(sos_16) # label(axiom). [clausify(17)]. 0.75/1.07 40 -min_precedes(A,B,C) | -root(B,C) # label(sos_07) # label(axiom). [clausify(30)]. 0.75/1.07 41 -root(A,B) | legal(A) # label(sos_12) # label(axiom). [clausify(1)]. 0.75/1.07 42 -root(A,B) | subactivity(f6(B,A),B) # label(sos_27) # label(axiom). [clausify(13)]. 0.75/1.07 43 -root(A,B) | atocc(A,f6(B,A)) # label(sos_27) # label(axiom). [clausify(13)]. 0.75/1.07 Derived: -atocc(A,B) | -legal(A) | -min_precedes(C,A,B). [resolve(39,c,40,b)]. 0.75/1.07 Derived: -atocc(A,B) | -legal(A) | subactivity(f6(B,A),B). [resolve(39,c,42,a)]. 0.75/1.07 Derived: -atocc(A,B) | -legal(A) | atocc(A,f6(B,A)). [resolve(39,c,43,a)]. 0.75/1.07 44 root(A,f7(A,B)) | -root_occ(A,B) # label(sos_10) # label(axiom). [clausify(18)]. 0.75/1.07 Derived: -root_occ(A,B) | -min_precedes(C,A,f7(A,B)). [resolve(44,a,40,b)]. 0.75/1.07 Derived: -root_occ(A,B) | legal(A). [resolve(44,a,41,a)]. 0.75/1.07 Derived: -root_occ(A,B) | subactivity(f6(f7(A,B),A),f7(A,B)). [resolve(44,a,42,a)]. 0.75/1.07 Derived: -root_occ(A,B) | atocc(A,f6(f7(A,B),A)). [resolve(44,a,43,a)]. 0.75/1.07 45 atomic(A) | -occurrence_of(B,A) | root(f1(A,B),A) # label(sos_30) # label(axiom). [clausify(2)]. 0.75/1.07 Derived: atomic(A) | -occurrence_of(B,A) | -min_precedes(C,f1(A,B),A). [resolve(45,c,40,b)]. 0.75/1.07 Derived: atomic(A) | -occurrence_of(B,A) | legal(f1(A,B)). [resolve(45,c,41,a)]. 0.75/1.07 Derived: atomic(A) | -occurrence_of(B,A) | subactivity(f6(A,f1(A,B)),A). [resolve(45,c,42,a)]. 0.75/1.07 Derived: atomic(A) | -occurrence_of(B,A) | atocc(f1(A,B),f6(A,f1(A,B))). [resolve(45,c,43,a)]. 0.75/1.07 46 -subactivity_occurrence(A,B) | -root(A,C) | -occurrence_of(B,C) | root_occ(A,B) # label(sos_10) # label(axiom). [clausify(18)]. 0.75/1.07 Derived: -subactivity_occurrence(A,B) | -occurrence_of(B,C) | root_occ(A,B) | -atocc(A,C) | -legal(A). [resolve(46,b,39,c)]. 0.75/1.07 Derived: -subactivity_occurrence(A,B) | -occurrence_of(B,f7(A,C)) | root_occ(A,B) | -root_occ(A,C). [resolve(46,b,44,a)]. 0.75/1.07 Derived: -subactivity_occurrence(f1(A,B),C) | -occurrence_of(C,A) | root_occ(f1(A,B),C) | atomic(A) | -occurrence_of(B,A). [resolve(46,b,45,c)]. 0.75/1.07 47 min_precedes(A,f16(A,B),B) | -root(A,B) | leaf(A,B) # label(sos_14) # label(axiom). [clausify(33)]. 0.75/1.07 Derived: min_precedes(A,f16(A,B),B) | leaf(A,B) | -atocc(A,B) | -legal(A). [resolve(47,b,39,c)]. 0.75/1.07 Derived: min_precedes(A,f16(A,f7(A,B)),f7(A,B)) | leaf(A,f7(A,B)) | -root_occ(A,B). [resolve(47,b,44,a)]. 0.75/1.07 Derived: min_precedes(f1(A,B),f16(f1(A,B),A),A) | leaf(f1(A,B),A) | atomic(A) | -occurrence_of(B,A). [resolve(47,b,45,c)]. 0.75/1.07 48 root(A,B) | min_precedes(f17(A,B),A,B) | -leaf(A,B) # label(sos_14) # label(axiom). [clausify(33)]. 0.75/1.07 Derived: min_precedes(f17(A,B),A,B) | -leaf(A,B) | -min_precedes(C,A,B). [resolve(48,a,40,b)]. 0.75/1.07 Derived: min_precedes(f17(A,B),A,B) | -leaf(A,B) | legal(A). [resolve(48,a,41,a)]. 0.75/1.07 Derived: min_precedes(f17(A,B),A,B) | -leaf(A,B) | subactivity(f6(B,A),B). [resolve(48,a,42,a)]. 0.75/1.07 Derived: min_precedes(f17(A,B),A,B) | -leaf(A,B) | atocc(A,f6(B,A)). [resolve(48,a,43,a)]. 0.75/1.07 Derived: min_precedes(f17(A,B),A,B) | -leaf(A,B) | -subactivity_occurrence(A,C) | -occurrence_of(C,B) | root_occ(A,C). [resolve(48,a,46,b)]. 0.75/1.07 49 leaf(A,f4(A,B)) | -leaf_occ(A,B) # label(sos_11) # label(axiom). [clausify(7)]. 0.75/1.07 50 -min_precedes(A,B,C) | -leaf(A,C) # label(sos_14) # label(axiom). [clausify(33)]. 0.75/1.07 Derived: -leaf_occ(A,B) | -min_precedes(A,C,f4(A,B)). [resolve(49,a,50,b)]. 0.75/1.07 51 -leaf(A,B) | atomic(B) | leaf_occ(A,f2(A,B)) # label(sos_23) # label(axiom). [clausify(4)]. 0.75/1.07 Derived: atomic(f4(A,B)) | leaf_occ(A,f2(A,f4(A,B))) | -leaf_occ(A,B). [resolve(51,a,49,a)]. 0.75/1.07 52 -leaf(A,B) | atomic(B) | occurrence_of(f2(A,B),B) # label(sos_23) # label(axiom). [clausify(4)]. 0.75/1.07 Derived: atomic(f4(A,B)) | occurrence_of(f2(A,f4(A,B)),f4(A,B)) | -leaf_occ(A,B). [resolve(52,a,49,a)]. 0.75/1.07 53 atomic(A) | -leaf(B,A) | leaf_occ(B,f3(B,A)) # label(sos_25) # label(axiom). [clausify(5)]. 0.75/1.07 Derived: atomic(f4(A,B)) | leaf_occ(A,f3(A,f4(A,B))) | -leaf_occ(A,B). [resolve(53,b,49,a)]. 0.75/1.07 54 atomic(A) | -leaf(B,A) | occurrence_of(f3(B,A),A) # label(sos_25) # label(axiom). [clausify(5)]. 0.75/1.07 Derived: atomic(f4(A,B)) | occurrence_of(f3(A,f4(A,B)),f4(A,B)) | -leaf_occ(A,B). [resolve(54,b,49,a)]. 0.75/1.07 55 -occurrence_of(A,B) | -subactivity_occurrence(C,A) | -leaf(C,B) | leaf_occ(C,A) # label(sos_11) # label(axiom). [clausify(7)]. 0.75/1.07 Derived: -occurrence_of(A,f4(B,C)) | -subactivity_occurrence(B,A) | leaf_occ(B,A) | -leaf_occ(B,C). [resolve(55,c,49,a)]. 0.75/1.07 56 min_precedes(A,f16(A,B),B) | -min_precedes(C,A,B) | leaf(A,B) # label(sos_14) # label(axiom). [clausify(33)]. 0.75/1.07 Derived: min_precedes(A,f16(A,B),B) | -min_precedes(C,A,B) | -min_precedes(A,D,B). [resolve(56,c,50,b)]. 0.75/1.07 Derived: min_precedes(A,f16(A,B),B) | -min_precedes(C,A,B) | atomic(B) | leaf_occ(A,f2(A,B)). [resolve(56,c,51,a)]. 0.75/1.07 Derived: min_precedes(A,f16(A,B),B) | -min_precedes(C,A,B) | atomic(B) | occurrence_of(f2(A,B),B). [resolve(56,c,52,a)]. 0.75/1.07 Derived: min_precedes(A,f16(A,B),B) | -min_precedes(C,A,B) | atomic(B) | leaf_occ(A,f3(A,B)). [resolve(56,c,53,b)]. 0.75/1.07 Derived: min_precedes(A,f16(A,B),B) | -min_precedes(C,A,B) | atomic(B) | occurrence_of(f3(A,B),B). [resolve(56,c,54,b)]. 0.75/1.07 Derived: min_precedes(A,f16(A,B),B) | -min_precedes(C,A,B) | -occurrence_of(D,B) | -subactivity_occurrence(A,D) | leaf_occ(A,D). [resolve(56,c,55,c)]. 0.75/1.07 57 min_precedes(A,f16(A,B),B) | leaf(A,B) | -atocc(A,B) | -legal(A). [resolve(47,b,39,c)]. 0.75/1.07 Derived: min_precedes(A,f16(A,B),B) | -atocc(A,B) | -legal(A) | -min_precedes(A,C,B). [resolve(57,b,50,b)]. 0.75/1.07 Derived: min_precedes(A,f16(A,B),B) | -atocc(A,B) | -legal(A) | atomic(B) | leaf_occ(A,f2(A,B)). [resolve(57,b,51,a)]. 0.75/1.07 Derived: min_precedes(A,f16(A,B),B) | -atocc(A,B) | -legal(A) | atomic(B) | occurrence_of(f2(A,B),B). [resolve(57,b,52,a)]. 0.75/1.07 Derived: min_precedes(A,f16(A,B),B) | -atocc(A,B) | -legal(A) | atomic(B) | leaf_occ(A,f3(A,B)). [resolve(57,b,53,b)]. 0.75/1.07 Derived: min_precedes(A,f16(A,B),B) | -atocc(A,B) | -legal(A) | atomic(B) | occurrence_of(f3(A,B),B). [resolve(57,b,54,b)]. 0.75/1.07 Derived: min_precedes(A,f16(A,B),B) | -atocc(A,B) | -legal(A) | -occurrence_of(C,B) | -subactivity_occurrence(A,C) | leaf_occ(A,C). [resolve(57,b,55,c)]. 0.75/1.07 58 min_precedes(A,f16(A,f7(A,B)),f7(A,B)) | leaf(A,f7(A,B)) | -root_occ(A,B). [resolve(47,b,44,a)]. 0.75/1.07 Derived: min_precedes(A,f16(A,f7(A,B)),f7(A,B)) | -root_occ(A,B) | -min_precedes(A,C,f7(A,B)). [resolve(58,b,50,b)]. 0.75/1.07 Derived: min_precedes(A,f16(A,f7(A,B)),f7(A,B)) | -root_occ(A,B) | atomic(f7(A,B)) | leaf_occ(A,f2(A,f7(A,B))). [resolve(58,b,51,a)]. 0.75/1.07 Derived: min_precedes(A,f16(A,f7(A,B)),f7(A,B)) | -root_occ(A,B) | atomic(f7(A,B)) | occurrence_of(f2(A,f7(A,B)),f7(A,B)). [resolve(58,b,52,a)]. 0.75/1.07 Derived: min_precedes(A,f16(A,f7(A,B)),f7(A,B)) | -root_occ(A,B) | atomic(f7(A,B)) | leaf_occ(A,f3(A,f7(A,B))). [resolve(58,b,53,b)]. 0.75/1.07 Derived: min_precedes(A,f16(A,f7(A,B)),f7(A,B)) | -root_occ(A,B) | atomic(f7(A,B)) | occurrence_of(f3(A,f7(A,B)),f7(A,B)). [resolve(58,b,54,b)]. 0.75/1.07 Derived: min_precedes(A,f16(A,f7(A,B)),f7(A,B)) | -root_occ(A,B) | -occurrence_of(C,f7(A,B)) | -subactivity_occurrence(A,C) | leaf_occ(A,C). [resolve(58,b,55,c)]. 0.75/1.07 59 min_precedes(f1(A,B),f16(f1(A,B),A),A) | leaf(f1(A,B),A) | atomic(A) | -occurrence_of(B,A). [resolve(47,b,45,c)]. 0.75/1.07 Derived: min_precedes(f1(A,B),f16(f1(A,B),A),A) | atomic(A) | -occurrence_of(B,A) | -min_precedes(f1(A,B),C,A). [resolve(59,b,50,b)]. 0.75/1.07 Derived: min_precedes(f1(A,B),f16(f1(A,B),A),A) | atomic(A) | -occurrence_of(B,A) | atomic(A) | leaf_occ(f1(A,B),f2(f1(A,B),A)). [resolve(59,b,51,a)]. 0.75/1.07 Derived: min_precedes(f1(A,B),f16(f1(A,B),A),A) | atomic(A) | -occurrence_of(B,A) | atomic(A) | occurrence_of(f2(f1(A,B),A),A). [resolve(59,b,52,a)]. 0.75/1.07 Derived: min_precedes(f1(A,B),f16(f1(A,B),A),A) | atomic(A) | -occurrence_of(B,A) | atomic(A) | leaf_occ(f1(A,B),f3(f1(A,B),A)). [resolve(59,b,53,b)]. 0.75/1.07 Derived: min_precedes(f1(A,B),f16(f1(A,B),A),A) | atomic(A) | -occurrence_of(B,A) | atomic(A) | occurrence_of(f3(f1(A,B),A),A). [resolve(59,b,54,b)]. 0.75/1.07 Derived: min_precedes(f1(A,B),f16(f1(A,B),A),A) | atomic(A) | -occurrence_of(B,A) | -occurrence_of(C,A) | -subactivity_occurrence(f1(A,B),C) | leaf_occ(f1(A,B),C). [resolve(59,b,55,c)]. 0.75/1.07 60 min_precedes(f17(A,B),A,B) | -leaf(A,B) | -min_precedes(C,A,B). [resolve(48,a,40,b)]. 0.75/1.07 Derived: min_precedes(f17(A,f4(A,B)),A,f4(A,B)) | -min_precedes(C,A,f4(A,B)) | -leaf_occ(A,B). [resolve(60,b,49,a)]. 0.75/1.07 Derived: min_precedes(f17(A,B),A,B) | -min_precedes(C,A,B) | min_precedes(A,f16(A,B),B) | -min_precedes(D,A,B). [resolve(60,b,56,c)]. 0.75/1.07 61 min_precedes(f17(A,B),A,B) | -leaf(A,B) | legal(A). [resolve(48,a,41,a)]. 0.75/1.07 Derived: min_precedes(f17(A,f4(A,B)),A,f4(A,B)) | legal(A) | -leaf_occ(A,B). [resolve(61,b,49,a)]. 0.75/1.07 Derived: min_precedes(f17(A,f7(A,B)),A,f7(A,B)) | legal(A) | min_precedes(A,f16(A,f7(A,B)),f7(A,B)) | -root_occ(A,B). [resolve(61,b,58,b)]. 0.75/1.07 Derived: min_precedes(f17(f1(A,B),A),f1(A,B),A) | legal(f1(A,B)) | min_precedes(f1(A,B),f16(f1(A,B),A),A) | atomic(A) | -occurrence_of(B,A). [resolve(61,b,59,b)]. 0.75/1.07 62 min_precedes(f17(A,B),A,B) | -leaf(A,B) | subactivity(f6(B,A),B). [resolve(48,a,42,a)]. 0.75/1.07 Derived: min_precedes(f17(A,f4(A,B)),A,f4(A,B)) | subactivity(f6(f4(A,B),A),f4(A,B)) | -leaf_occ(A,B). [resolve(62,b,49,a)]. 0.75/1.07 Derived: min_precedes(f17(A,B),A,B) | subactivity(f6(B,A),B) | min_precedes(A,f16(A,B),B) | -atocc(A,B) | -legal(A). [resolve(62,b,57,b)]. 0.75/1.07 Derived: min_precedes(f17(A,f7(A,B)),A,f7(A,B)) | subactivity(f6(f7(A,B),A),f7(A,B)) | min_precedes(A,f16(A,f7(A,B)),f7(A,B)) | -root_occ(A,B). [resolve(62,b,58,b)]. 0.75/1.07 Derived: min_precedes(f17(f1(A,B),A),f1(A,B),A) | subactivity(f6(A,f1(A,B)),A) | min_precedes(f1(A,B),f16(f1(A,B),A),A) | atomic(A) | -occurrence_of(B,A). [resolve(62,b,59,b)]. 0.75/1.07 63 min_precedes(f17(A,B),A,B) | -leaf(A,B) | atocc(A,f6(B,A)). [resolve(48,a,43,a)]. 0.75/1.07 Derived: min_precedes(f17(A,f4(A,B)),A,f4(A,B)) | atocc(A,f6(f4(A,B),A)) | -leaf_occ(A,B). [resolve(63,b,49,a)]. 0.75/1.07 Derived: min_precedes(f17(A,B),A,B) | atocc(A,f6(B,A)) | min_precedes(A,f16(A,B),B) | -atocc(A,B) | -legal(A). [resolve(63,b,57,b)]. 0.75/1.07 Derived: min_precedes(f17(A,f7(A,B)),A,f7(A,B)) | atocc(A,f6(f7(A,B),A)) | min_precedes(A,f16(A,f7(A,B)),f7(A,B)) | -root_occ(A,B). [resolve(63,b,58,b)]. 0.75/1.07 Derived: min_precedes(f17(f1(A,B),A),f1(A,B),A) | atocc(f1(A,B),f6(A,f1(A,B))) | min_precedes(f1(A,B),f16(f1(A,B),A),A) | atomic(A) | -occurrence_of(B,A). [resolve(63,b,59,b)]. 0.75/1.07 64 min_precedes(f17(A,B),A,B) | -leaf(A,B) | -subactivity_occurrence(A,C) | -occurrence_of(C,B) | root_occ(A,C). [resolve(48,a,46,b)]. 0.75/1.07 Derived: min_precedes(f17(A,f4(A,B)),A,f4(A,B)) | -subactivity_occurrence(A,C) | -occurrence_of(C,f4(A,B)) | root_occ(A,C) | -leaf_occ(A,B). [resolve(64,b,49,a)]. 0.75/1.07 Derived: min_precedes(f17(A,B),A,B) | -subactivity_occurrence(A,C) | -occurrence_of(C,B) | root_occ(A,C) | min_precedes(A,f16(A,B),B) | -atocc(A,B) | -legal(A). [resolve(64,b,57,b)]. 0.75/1.07 Derived: min_precedes(f17(A,f7(A,B)),A,f7(A,B)) | -subactivity_occurrence(A,C) | -occurrence_of(C,f7(A,B)) | root_occ(A,C) | min_precedes(A,f16(A,f7(A,B)),f7(A,B)) | -root_occ(A,B). [resolve(64,b,58,b)]. 0.75/1.07 Derived: min_precedes(f17(f1(A,B),A),f1(A,B),A) | -subactivity_occurrence(f1(A,B),C) | -occurrence_of(C,A) | root_occ(f1(A,B),C) | min_precedes(f1(A,B),f16(f1(A,B),A),A) | atomic(A) | -occurrence_of(B,A). [resolve(64,b,59,b)]. 0.75/1.07 65 -occurrence_of(A,tptp0) | next_subocc(f13(A),f14(A),tptp0) # label(sos_32) # label(axiom). [clausify(27)]. 0.75/1.07 66 -next_subocc(A,B,C) | -min_precedes(A,D,C) | -min_precedes(D,B,C) # label(sos_04) # label(axiom). [clausify(24)]. 0.75/1.07 67 -next_subocc(A,B,C) | arboreal(A) # label(sos_05) # label(axiom). [clausify(9)]. 0.75/1.07 68 -next_subocc(A,B,C) | arboreal(B) # label(sos_05) # label(axiom). [clausify(9)]. 0.75/1.07 69 -next_subocc(A,B,C) | min_precedes(A,B,C) # label(sos_04) # label(axiom). [clausify(24)]. 0.75/1.07 Derived: -occurrence_of(A,tptp0) | -min_precedes(f13(A),B,tptp0) | -min_precedes(B,f14(A),tptp0). [resolve(65,b,66,a)]. 0.75/1.07 Derived: -occurrence_of(A,tptp0) | arboreal(f13(A)). [resolve(65,b,67,a)]. 0.75/1.07 Derived: -occurrence_of(A,tptp0) | arboreal(f14(A)). [resolve(65,b,68,a)]. 0.75/1.07 Derived: -occurrence_of(A,tptp0) | min_precedes(f13(A),f14(A),tptp0). [resolve(65,b,69,a)]. 0.75/1.07 70 -occurrence_of(A,tptp0) | next_subocc(f14(A),f15(A),tptp0) # label(sos_32) # label(axiom). [clausify(27)]. 0.75/1.07 Derived: -occurrence_of(A,tptp0) | -min_precedes(f14(A),B,tptp0) | -min_precedes(B,f15(A),tptp0). [resolve(70,b,66,a)]. 0.75/1.07 Derived: -occurrence_of(A,tptp0) | arboreal(f15(A)). [resolve(70,b,68,a)]. 0.75/1.07 Derived: -occurrence_of(A,tptp0) | min_precedes(f14(A),f15(A),tptp0). [resolve(70,b,69,a)]. 0.75/1.07 71 next_subocc(A,B,C) | min_precedes(A,f12(A,B,C),C) | -min_precedes(A,B,C) # label(sos_04) # label(axiom). [clausify(24)]. 0.75/1.07 Derived: min_precedes(A,f12(A,B,C),C) | -min_precedes(A,B,C) | -min_precedes(A,D,C) | -min_precedes(D,B,C). [resolve(71,a,66,a)]. 0.75/1.07 Derived: min_precedes(A,f12(A,B,C),C) | -min_precedes(A,B,C) | arboreal(A). [resolve(71,a,67,a)]. 0.75/1.07 Derived: min_precedes(A,f12(A,B,C),C) | -min_precedes(A,B,C) | arboreal(B). [resolve(71,a,68,a)]. 0.75/1.07 72 next_subocc(A,B,C) | min_precedes(f12(A,B,C),B,C) | -min_precedes(A,B,C) # label(sos_04) # label(axiom). [clausify(24)]. 0.75/1.07 Derived: min_precedes(f12(A,B,C),B,C) | -min_precedes(A,B,C) | -min_precedes(A,D,C) | -min_precedes(D,B,C). [resolve(72,a,66,a)]. 0.75/1.07 Derived: min_precedes(f12(A,B,C),B,C) | -min_precedes(A,B,C) | arboreal(A). [resolve(72,a,67,a)]. 0.75/1.07 Derived: min_precedes(f12(A,B,C),B,C) | -min_precedes(A,B,C) | arboreal(B). [resolve(72,a,68,a)]. 0.75/1.07 73 legal(A) | -precedes(B,A) # label(sos_08) # label(axiom). [clausify(31)]. 0.75/1.07 74 -legal(A) | arboreal(A) # label(sos_17) # label(axiom). [clausify(26)]. 0.75/1.07 Derived: -precedes(A,B) | arboreal(B). [resolve(73,a,74,a)]. 0.75/1.07 75 -legal(A) | -earlier(B,A) | precedes(B,A) # label(sos_08) # label(axiom). [clausify(31)]. 0.75/1.07 Derived: -earlier(A,B) | precedes(A,B) | -precedes(C,B). [resolve(75,a,73,a)]. 0.75/1.07 76 -atocc(A,B) | -legal(A) | -min_precedes(C,A,B). [resolve(39,c,40,b)]. 0.75/1.07 Derived: -atocc(A,B) | -min_precedes(C,A,B) | -precedes(D,A). [resolve(76,b,73,a)]. 0.75/1.07 77 -atocc(A,B) | -legal(A) | subactivity(f6(B,A),B). [resolve(39,c,42,a)]. 0.75/1.07 Derived: -atocc(A,B) | subactivity(f6(B,A),B) | -precedes(C,A). [resolve(77,b,73,a)]. 0.75/1.07 78 -atocc(A,B) | -legal(A) | atocc(A,f6(B,A)). [resolve(39,c,43,a)]. 0.75/1.07 Derived: -atocc(A,B) | atocc(A,f6(B,A)) | -precedes(C,A). [resolve(78,b,73,a)]. 0.75/1.07 79 -root_occ(A,B) | legal(A). [resolve(44,a,41,a)]. 0.75/1.07 Derived: -root_occ(A,B) | arboreal(A). [resolve(79,b,74,a)]. 0.75/1.07 Derived: -root_occ(A,B) | -earlier(C,A) | precedes(C,A). [resolve(79,b,75,a)]. 0.75/1.07 Derived: -root_occ(A,B) | -atocc(A,C) | -min_precedes(D,A,C). [resolve(79,b,76,b)]. 0.75/1.07 Derived: -root_occ(A,B) | -atocc(A,C) | subactivity(f6(C,A),C). [resolve(79,b,77,b)]. 0.75/1.07 Derived: -root_occ(A,B) | -atocc(A,C) | atocc(A,f6(C,A)). [resolve(79,b,78,b)]. 0.75/1.07 80 atomic(A) | -occurrence_of(B,A) | legal(f1(A,B)). [resolve(45,c,41,a)]. 0.75/1.07 Derived: atomic(A) | -occurrence_of(B,A) | arboreal(f1(A,B)). [resolve(80,c,74,a)]. 0.75/1.07 Derived: atomic(A) | -occurrence_of(B,A) | -earlier(C,f1(A,B)) | precedes(C,f1(A,B)). [resolve(80,c,75,a)]. 0.75/1.07 Derived: atomic(A) | -occurrence_of(B,A) | -atocc(f1(A,B),C) | -min_precedes(D,f1(A,B),C). [resolve(80,c,76,b)]. 0.75/1.07 Derived: atomic(A) | -occurrence_of(B,A) | -atocc(f1(A,B),C) | subactivity(f6(C,f1(A,B)),C). [resolve(80,c,77,b)]. 0.75/1.07 Derived: atomic(A) | -occurrence_of(B,A) | -atocc(f1(A,B),C) | atocc(f1(A,B),f6(C,f1(A,B))). [resolve(80,c,78,b)]. 0.75/1.07 81 -subactivity_occurrence(A,B) | -occurrence_of(B,C) | root_occ(A,B) | -atocc(A,C) | -legal(A). [resolve(46,b,39,c)]. 0.75/1.08 Derived: -subactivity_occurrence(A,B) | -occurrence_of(B,C) | root_occ(A,B) | -atocc(A,C) | -precedes(D,A). [resolve(81,e,73,a)]. 0.75/1.08 Derived: -subactivity_occurrence(A,B) | -occurrence_of(B,C) | root_occ(A,B) | -atocc(A,C) | -root_occ(A,D). [resolve(81,e,79,b)]. 0.75/1.08 Derived: -subactivity_occurrence(f1(A,B),C) | -occurrence_of(C,D) | root_occ(f1(A,B),C) | -atocc(f1(A,B),D) | atomic(A) | -occurrence_of(B,A). [resolve(81,e,80,c)]. 0.75/1.08 82 min_precedes(A,f16(A,B),B) | -atocc(A,B) | -legal(A) | -min_precedes(A,C,B). [resolve(57,b,50,b)]. 0.75/1.08 Derived: min_precedes(A,f16(A,B),B) | -atocc(A,B) | -min_precedes(A,C,B) | -precedes(D,A). [resolve(82,c,73,a)]. 0.75/1.08 Derived: min_precedes(A,f16(A,B),B) | -atocc(A,B) | -min_precedes(A,C,B) | -root_occ(A,D). [resolve(82,c,79,b)]. 0.75/1.08 Derived: min_precedes(f1(A,B),f16(f1(A,B),C),C) | -atocc(f1(A,B),C) | -min_precedes(f1(A,B),D,C) | atomic(A) | -occurrence_of(B,A). [resolve(82,c,80,c)]. 0.75/1.08 83 min_precedes(A,f16(A,B),B) | -atocc(A,B) | -legal(A) | atomic(B) | leaf_occ(A,f2(A,B)). [resolve(57,b,51,a)]. 0.75/1.08 Derived: min_precedes(A,f16(A,B),B) | -atocc(A,B) | atomic(B) | leaf_occ(A,f2(A,B)) | -precedes(C,A). [resolve(83,c,73,a)]. 0.75/1.08 Derived: min_precedes(A,f16(A,B),B) | -atocc(A,B) | atomic(B) | leaf_occ(A,f2(A,B)) | -root_occ(A,C). [resolve(83,c,79,b)]. 0.75/1.08 Derived: min_precedes(f1(A,B),f16(f1(A,B),C),C) | -atocc(f1(A,B),C) | atomic(C) | leaf_occ(f1(A,B),f2(f1(A,B),C)) | atomic(A) | -occurrence_of(B,A). [resolve(83,c,80,c)]. 0.75/1.08 84 min_precedes(A,f16(A,B),B) | -atocc(A,B) | -legal(A) | atomic(B) | occurrence_of(f2(A,B),B). [resolve(57,b,52,a)]. 0.75/1.08 Derived: min_precedes(A,f16(A,B),B) | -atocc(A,B) | atomic(B) | occurrence_of(f2(A,B),B) | -precedes(C,A). [resolve(84,c,73,a)]. 0.75/1.08 Derived: min_precedes(A,f16(A,B),B) | -atocc(A,B) | atomic(B) | occurrence_of(f2(A,B),B) | -root_occ(A,C). [resolve(84,c,79,b)]. 0.75/1.08 Derived: min_precedes(f1(A,B),f16(f1(A,B),C),C) | -atocc(f1(A,B),C) | atomic(C) | occurrence_of(f2(f1(A,B),C),C) | atomic(A) | -occurrence_of(B,A). [resolve(84,c,80,c)]. 0.75/1.08 85 min_precedes(A,f16(A,B),B) | -atocc(A,B) | -legal(A) | atomic(B) | leaf_occ(A,f3(A,B)). [resolve(57,b,53,b)]. 0.75/1.08 Derived: min_precedes(A,f16(A,B),B) | -atocc(A,B) | atomic(B) | leaf_occ(A,f3(A,B)) | -precedes(C,A). [resolve(85,c,73,a)]. 0.75/1.08 Derived: min_precedes(A,f16(A,B),B) | -atocc(A,B) | atomic(B) | leaf_occ(A,f3(A,B)) | -root_occ(A,C). [resolve(85,c,79,b)]. 0.75/1.08 Derived: min_precedes(f1(A,B),f16(f1(A,B),C),C) | -atocc(f1(A,B),C) | atomic(C) | leaf_occ(f1(A,B),f3(f1(A,B),C)) | atomic(A) | -occurrence_of(B,A). [resolve(85,c,80,c)]. 0.75/1.08 86 min_precedes(A,f16(A,B),B) | -atocc(A,B) | -legal(A) | atomic(B) | occurrence_of(f3(A,B),B). [resolve(57,b,54,b)]. 0.75/1.08 Derived: min_precedes(A,f16(A,B),B) | -atocc(A,B) | atomic(B) | occurrence_of(f3(A,B),B) | -precedes(C,A). [resolve(86,c,73,a)]. 0.75/1.08 Derived: min_precedes(A,f16(A,B),B) | -atocc(A,B) | atomic(B) | occurrence_of(f3(A,B),B) | -root_occ(A,C). [resolve(86,c,79,b)]. 0.75/1.08 Derived: min_precedes(f1(A,B),f16(f1(A,B),C),C) | -atocc(f1(A,B),C) | atomic(C) | occurrence_of(f3(f1(A,B),C),C) | atomic(A) | -occurrence_of(B,A). [resolve(86,c,80,c)]. 0.75/1.08 87 min_precedes(A,f16(A,B),B) | -atocc(A,B) | -legal(A) | -occurrence_of(C,B) | -subactivity_occurrence(A,C) | leaf_occ(A,C). [resolve(57,b,55,c)]. 0.75/1.08 Derived: min_precedes(A,f16(A,B),B) | -atocc(A,B) | -occurrence_of(C,B) | -subactivity_occurrence(A,C) | leaf_occ(A,C) | -precedes(D,A). [resolve(87,c,73,a)]. 0.75/1.08 Derived: min_precedes(A,f16(A,B),B) | -atocc(A,B) | -occurrence_of(C,B) | -subactivity_occurrence(A,C) | leaf_occ(A,C) | -root_occ(A,D). [resolve(87,c,79,b)]. 0.75/1.08 Derived: min_precedes(f1(A,B),f16(f1(A,B),C),C) | -atocc(f1(A,B),C) | -occurrence_of(D,C) | -subactivity_occurrence(f1(A,B),D) | leaf_occ(f1(A,B),D) | atomic(A) | -occurrence_of(B,A). [resolve(87,c,80,c)]. 0.75/1.08 88 min_precedes(f17(A,f4(A,B)),A,f4(A,B)) | legal(A) | -leaf_occ(A,B). [resolve(61,b,49,a)]. 0.75/1.08 Derived: min_precedes(f17(A,f4(A,B)),A,f4(A,B)) | -leaf_occ(A,B) | arboreal(A). [resolve(88,b,74,a)]. 0.75/1.08 Derived: min_precedes(f17(A,f4(A,B)),A,f4(A,B)) | -leaf_occ(A,B) | -earlier(C,A) | precedes(C,A). [resolve(88,b,75,a)]. 0.80/1.08 Derived: min_precedes(f17(A,f4(A,B)),A,f4(A,B)) | -leaf_occ(A,B) | -atocc(A,C) | -min_precedes(D,A,C). [resolve(88,b,76,b)]. 0.80/1.08 Derived: min_precedes(f17(A,f4(A,B)),A,f4(A,B)) | -leaf_occ(A,B) | -atocc(A,C) | subactivity(f6(C,A),C). [resolve(88,b,77,b)]. 0.80/1.08 Derived: min_precedes(f17(A,f4(A,B)),A,f4(A,B)) | -leaf_occ(A,B) | -atocc(A,C) | atocc(A,f6(C,A)). [resolve(88,b,78,b)]. 0.80/1.08 Derived: min_precedes(f17(A,f4(A,B)),A,f4(A,B)) | -leaf_occ(A,B) | -subactivity_occurrence(A,C) | -occurrence_of(C,D) | root_occ(A,C) | -atocc(A,D). [resolve(88,b,81,e)]. 0.80/1.08 Derived: min_precedes(f17(A,f4(A,B)),A,f4(A,B)) | -leaf_occ(A,B) | min_precedes(A,f16(A,C),C) | -atocc(A,C) | -min_precedes(A,D,C). [resolve(88,b,82,c)]. 0.80/1.08 Derived: min_precedes(f17(A,f4(A,B)),A,f4(A,B)) | -leaf_occ(A,B) | min_precedes(A,f16(A,C),C) | -atocc(A,C) | atomic(C) | leaf_occ(A,f2(A,C)). [resolve(88,b,83,c)]. 0.80/1.08 Derived: min_precedes(f17(A,f4(A,B)),A,f4(A,B)) | -leaf_occ(A,B) | min_precedes(A,f16(A,C),C) | -atocc(A,C) | atomic(C) | occurrence_of(f2(A,C),C). [resolve(88,b,84,c)]. 0.80/1.08 Derived: min_precedes(f17(A,f4(A,B)),A,f4(A,B)) | -leaf_occ(A,B) | min_precedes(A,f16(A,C),C) | -atocc(A,C) | atomic(C) | leaf_occ(A,f3(A,C)). [resolve(88,b,85,c)]. 0.80/1.08 Derived: min_precedes(f17(A,f4(A,B)),A,f4(A,B)) | -leaf_occ(A,B) | min_precedes(A,f16(A,C),C) | -atocc(A,C) | atomic(C) | occurrence_of(f3(A,C),C). [resolve(88,b,86,c)]. 0.80/1.08 Derived: min_precedes(f17(A,f4(A,B)),A,f4(A,B)) | -leaf_occ(A,B) | min_precedes(A,f16(A,C),C) | -atocc(A,C) | -occurrence_of(D,C) | -subactivity_occurrence(A,D) | leaf_occ(A,D). [resolve(88,b,87,c)]. 0.80/1.08 89 min_precedes(f17(A,f7(A,B)),A,f7(A,B)) | legal(A) | min_precedes(A,f16(A,f7(A,B)),f7(A,B)) | -root_occ(A,B). [resolve(61,b,58,b)]. 0.80/1.08 90 min_precedes(f17(f1(A,B),A),f1(A,B),A) | legal(f1(A,B)) | min_precedes(f1(A,B),f16(f1(A,B),A),A) | atomic(A) | -occurrence_of(B,A). [resolve(61,b,59,b)]. 0.80/1.08 91 min_precedes(f17(A,B),A,B) | subactivity(f6(B,A),B) | min_precedes(A,f16(A,B),B) | -atocc(A,B) | -legal(A). [resolve(62,b,57,b)]. 0.80/1.08 92 min_precedes(f17(A,B),A,B) | atocc(A,f6(B,A)) | min_precedes(A,f16(A,B),B) | -atocc(A,B) | -legal(A). [resolve(63,b,57,b)]. 0.80/1.08 93 min_precedes(f17(A,B),A,B) | -subactivity_occurrence(A,C) | -occurrence_of(C,B) | root_occ(A,C) | min_precedes(A,f16(A,B),B) | -atocc(A,B) | -legal(A). [resolve(64,b,57,b)]. 0.80/1.08 94 -activity_occurrence(A) | occurrence_of(A,f9(A)) # label(sos_18) # label(axiom). [clausify(21)]. 0.80/1.08 95 -occurrence_of(A,B) | activity_occurrence(A) # label(sos_29) # label(axiom). [clausify(16)]. 0.80/1.08 96 -subactivity_occurrence(A,B) | activity_occurrence(A) # label(sos_19) # label(axiom). [clausify(32)]. 0.80/1.08 97 -subactivity_occurrence(A,B) | activity_occurrence(B) # label(sos_19) # label(axiom). [clausify(32)]. 0.80/1.08 Derived: occurrence_of(A,f9(A)) | -occurrence_of(A,B). [resolve(94,a,95,b)]. 0.80/1.08 Derived: occurrence_of(A,f9(A)) | -subactivity_occurrence(A,B). [resolve(94,a,96,b)]. 0.80/1.08 Derived: occurrence_of(A,f9(A)) | -subactivity_occurrence(B,A). [resolve(94,a,97,b)]. 0.80/1.08 98 subactivity(f9(A),f9(A)) | -activity_occurrence(A). [resolve(35,a,38,b)]. 0.80/1.08 Derived: subactivity(f9(A),f9(A)) | -occurrence_of(A,B). [resolve(98,b,95,b)]. 0.80/1.08 Derived: subactivity(f9(A),f9(A)) | -subactivity_occurrence(A,B). [resolve(98,b,96,b)]. 0.80/1.08 Derived: subactivity(f9(A),f9(A)) | -subactivity_occurrence(B,A). [resolve(98,b,97,b)]. 0.80/1.08 99 atocc(A,B) | -subactivity(B,C) | -occurrence_of(A,C) | -atomic(C) # label(sos_15) # label(axiom). [clausify(20)]. 0.80/1.08 100 -atocc(A,B) | subactivity(B,f8(A,B)) # label(sos_15) # label(axiom). [clausify(20)]. 0.80/1.08 101 -min_precedes(A,B,C) | subactivity(f10(C,A,B),C) # label(sos_26) # label(axiom). [clausify(23)]. 0.80/1.08 102 -min_precedes(A,B,C) | subactivity(f11(C,A,B),C) # label(sos_26) # label(axiom). [clausify(23)]. 0.80/1.08 Derived: atocc(A,B) | -occurrence_of(A,f8(C,B)) | -atomic(f8(C,B)) | -atocc(C,B). [resolve(99,b,100,b)]. 0.80/1.08 Derived: atocc(A,f10(B,C,D)) | -occurrence_of(A,B) | -atomic(B) | -min_precedes(C,D,B). [resolve(99,b,101,b)]. 0.80/1.08 Derived: atocc(A,f11(B,C,D)) | -occurrence_of(A,B) | -atomic(B) | -min_precedes(C,D,B). [resolve(99,b,102,b)]. 0.80/1.08 103 subactivity(tptp0,tptp0). [resolve(35,a,36,a)]. 0.85/1.14 Derived: atocc(A,tptp0) | -occurrence_of(A,tptp0) | -atomic(tptp0). [resolve(103,a,99,b)]. 0.85/1.14 104 subactivity(A,A) | -occurrence_of(B,A). [resolve(35,a,37,b)]. 0.85/1.14 Derived: -occurrence_of(A,B) | atocc(C,B) | -occurrence_of(C,B) | -atomic(B). [resolve(104,a,99,b)]. 0.85/1.14 105 -root_occ(A,B) | subactivity(f6(f7(A,B),A),f7(A,B)). [resolve(44,a,42,a)]. 0.85/1.14 Derived: -root_occ(A,B) | atocc(C,f6(f7(A,B),A)) | -occurrence_of(C,f7(A,B)) | -atomic(f7(A,B)). [resolve(105,b,99,b)]. 0.85/1.14 106 atomic(A) | -occurrence_of(B,A) | subactivity(f6(A,f1(A,B)),A). [resolve(45,c,42,a)]. 0.85/1.14 107 min_precedes(f17(A,f4(A,B)),A,f4(A,B)) | subactivity(f6(f4(A,B),A),f4(A,B)) | -leaf_occ(A,B). [resolve(62,b,49,a)]. 0.85/1.14 Derived: min_precedes(f17(A,f4(A,B)),A,f4(A,B)) | -leaf_occ(A,B) | atocc(C,f6(f4(A,B),A)) | -occurrence_of(C,f4(A,B)) | -atomic(f4(A,B)). [resolve(107,b,99,b)]. 0.85/1.14 108 min_precedes(f17(A,f7(A,B)),A,f7(A,B)) | subactivity(f6(f7(A,B),A),f7(A,B)) | min_precedes(A,f16(A,f7(A,B)),f7(A,B)) | -root_occ(A,B). [resolve(62,b,58,b)]. 0.85/1.14 109 min_precedes(f17(f1(A,B),A),f1(A,B),A) | subactivity(f6(A,f1(A,B)),A) | min_precedes(f1(A,B),f16(f1(A,B),A),A) | atomic(A) | -occurrence_of(B,A). [resolve(62,b,59,b)]. 0.85/1.14 110 -atocc(A,B) | subactivity(f6(B,A),B) | -precedes(C,A). [resolve(77,b,73,a)]. 0.85/1.14 Derived: -atocc(A,B) | -precedes(C,A) | atocc(D,f6(B,A)) | -occurrence_of(D,B) | -atomic(B). [resolve(110,b,99,b)]. 0.85/1.14 111 -root_occ(A,B) | -atocc(A,C) | subactivity(f6(C,A),C). [resolve(79,b,77,b)]. 0.85/1.14 Derived: -root_occ(A,B) | -atocc(A,C) | atocc(D,f6(C,A)) | -occurrence_of(D,C) | -atomic(C). [resolve(111,c,99,b)]. 0.85/1.14 112 atomic(A) | -occurrence_of(B,A) | -atocc(f1(A,B),C) | subactivity(f6(C,f1(A,B)),C). [resolve(80,c,77,b)]. 0.85/1.14 Derived: atomic(A) | -occurrence_of(B,A) | -atocc(f1(A,B),C) | atocc(D,f6(C,f1(A,B))) | -occurrence_of(D,C) | -atomic(C). [resolve(112,d,99,b)]. 0.85/1.14 113 min_precedes(f17(A,f4(A,B)),A,f4(A,B)) | -leaf_occ(A,B) | -atocc(A,C) | subactivity(f6(C,A),C). [resolve(88,b,77,b)]. 0.85/1.14 Derived: min_precedes(f17(A,f4(A,B)),A,f4(A,B)) | -leaf_occ(A,B) | -atocc(A,C) | atocc(D,f6(C,A)) | -occurrence_of(D,C) | -atomic(C). [resolve(113,d,99,b)]. 0.85/1.14 114 subactivity(f9(A),f9(A)) | -occurrence_of(A,B). [resolve(98,b,95,b)]. 0.85/1.14 115 subactivity(f9(A),f9(A)) | -subactivity_occurrence(A,B). [resolve(98,b,96,b)]. 0.85/1.14 116 subactivity(f9(A),f9(A)) | -subactivity_occurrence(B,A). [resolve(98,b,97,b)]. 0.85/1.14 0.85/1.14 ============================== end predicate elimination ============= 0.85/1.14 0.85/1.14 Auto_denials: (non-Horn, no changes). 0.85/1.14 0.85/1.14 Term ordering decisions: 0.85/1.14 Function symbol KB weights: tptp0=1. tptp1=1. tptp2=1. tptp3=1. tptp4=1. c1=1. f1=1. f2=1. f3=1. f4=1. f6=1. f7=1. f8=1. f16=1. f17=1. f18=1. f19=1. f9=1. f13=1. f14=1. f15=1. f5=1. f10=1. f11=1. f12=1. 0.85/1.14 0.85/1.14 ============================== end of process initial clauses ======== 0.85/1.14 0.85/1.14 ============================== CLAUSES FOR SEARCH ==================== 0.85/1.14 0.85/1.14 ============================== end of clauses for search ============= 0.85/1.14 0.85/1.14 ============================== SEARCH ================================ 0.85/1.14 0.85/1.14 % Starting search at 0.04 seconds. 0.85/1.14 0.85/1.14 ============================== PROOF ================================= 0.85/1.14 % SZS status Theorem 0.85/1.14 % SZS output start Refutation 0.85/1.14 0.85/1.14 % Proof 1 at 0.08 (+ 0.00) seconds. 0.85/1.14 % Length of proof is 20. 0.85/1.14 % Level of proof is 6. 0.85/1.14 % Maximum clause weight is 15.000. 0.85/1.14 % Given clauses 247. 0.85/1.14 0.85/1.14 7 (all X35 all X36 ((exists X37 (occurrence_of(X36,X37) & subactivity_occurrence(X35,X36) & leaf(X35,X37))) <-> leaf_occ(X35,X36))) # label(sos_11) # label(axiom) # label(non_clause). [assumption]. 0.85/1.14 19 (all X64 all X65 all X66 (occurrence_of(X64,X65) & occurrence_of(X64,X66) -> X66 = X65)) # label(sos_22) # label(axiom) # label(non_clause). [assumption]. 0.85/1.14 27 (all X95 (occurrence_of(X95,tptp0) -> (exists X96 exists X97 exists X98 (occurrence_of(X96,tptp3) & next_subocc(X96,X97,tptp0) & next_subocc(X97,X98,tptp0) & leaf_occ(X98,X95) & (occurrence_of(X98,tptp1) | occurrence_of(X98,tptp2)) & occurrence_of(X97,tptp4) & root_occ(X96,X95))))) # label(sos_32) # label(axiom) # label(non_clause). [assumption]. 0.85/1.14 33 (all X42 all X43 (-(exists X45 min_precedes(X42,X45,X43)) & (root(X42,X43) | (exists X44 min_precedes(X44,X42,X43))) <-> leaf(X42,X43))) # label(sos_14) # label(axiom) # label(non_clause). [assumption]. 0.85/1.14 34 -(all X99 (occurrence_of(X99,tptp0) -> (exists X100 exists X101 ((occurrence_of(X101,tptp2) -> -(exists X103 (occurrence_of(X103,tptp1) & subactivity_occurrence(X103,X99) & min_precedes(X100,X103,tptp0)))) & (occurrence_of(X101,tptp1) -> -(exists X102 (occurrence_of(X102,tptp2) & min_precedes(X100,X102,tptp0) & subactivity_occurrence(X102,X99)))) & leaf_occ(X101,X99))))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption]. 0.85/1.14 49 leaf(A,f4(A,B)) | -leaf_occ(A,B) # label(sos_11) # label(axiom). [clausify(7)]. 0.85/1.14 50 -min_precedes(A,B,C) | -leaf(A,C) # label(sos_14) # label(axiom). [clausify(33)]. 0.85/1.14 121 occurrence_of(c1,tptp0) # label(goals) # label(negated_conjecture). [clausify(34)]. 0.85/1.14 141 -occurrence_of(A,tptp0) | leaf_occ(f15(A),A) # label(sos_32) # label(axiom). [clausify(27)]. 0.85/1.14 144 occurrence_of(A,f4(B,A)) | -leaf_occ(B,A) # label(sos_11) # label(axiom). [clausify(7)]. 0.85/1.14 148 -occurrence_of(A,B) | -occurrence_of(A,C) | C = B # label(sos_22) # label(axiom). [clausify(19)]. 0.85/1.14 174 min_precedes(A,f18(A,B),tptp0) | min_precedes(A,f19(A,B),tptp0) | -leaf_occ(B,c1) # label(goals) # label(negated_conjecture). [clausify(34)]. 0.85/1.14 182 -leaf_occ(A,B) | -min_precedes(A,C,f4(A,B)). [resolve(49,a,50,b)]. 0.85/1.14 298 leaf_occ(f15(c1),c1). [resolve(141,a,121,a)]. 0.85/1.14 301 -occurrence_of(c1,A) | tptp0 = A. [resolve(148,a,121,a),flip(b)]. 0.85/1.14 325 min_precedes(A,f18(A,f15(c1)),tptp0) | min_precedes(A,f19(A,f15(c1)),tptp0). [resolve(298,a,174,c)]. 0.85/1.14 341 occurrence_of(c1,f4(f15(c1),c1)). [resolve(298,a,144,b)]. 0.85/1.14 575 f4(f15(c1),c1) = tptp0. [resolve(341,a,301,a),flip(a)]. 0.85/1.14 648 -min_precedes(f15(c1),A,tptp0). [para(575(a,1),182(b,3)),unit_del(a,298)]. 0.85/1.14 772 $F. [resolve(325,b,648,a),unit_del(a,648)]. 0.85/1.14 0.85/1.14 % SZS output end Refutation 0.85/1.14 ============================== end of proof ========================== 0.85/1.14 0.85/1.14 ============================== STATISTICS ============================ 0.85/1.14 0.85/1.14 Given=247. Generated=904. Kept=650. proofs=1. 0.85/1.14 Usable=235. Sos=305. Demods=4. Limbo=0, Disabled=359. Hints=0. 0.85/1.14 Megabytes=1.18. 0.85/1.14 User_CPU=0.08, System_CPU=0.00, Wall_clock=0. 0.85/1.14 0.85/1.14 ============================== end of statistics ===================== 0.85/1.14 0.85/1.14 ============================== end of search ========================= 0.85/1.14 0.85/1.14 THEOREM PROVED 0.85/1.14 % SZS status Theorem 0.85/1.14 0.85/1.14 Exiting with 1 proof. 0.85/1.14 0.85/1.14 Process 17417 exit (max_proofs) Thu Jul 2 06:51:43 2020 0.85/1.14 Prover9 interrupted 0.85/1.14 EOF