0.00/0.09 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.09 % Command : tptp2X_and_run_prover9 %d %s 0.09/0.29 % Computer : n025.cluster.edu 0.09/0.29 % Model : x86_64 x86_64 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.09/0.29 % Memory : 8042.1875MB 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64 0.09/0.29 % CPULimit : 1200 0.09/0.29 % DateTime : Tue Jul 13 16:54:27 EDT 2021 0.14/0.29 % CPUTime : 0.68/1.02 ============================== Prover9 =============================== 0.68/1.02 Prover9 (32) version 2009-11A, November 2009. 0.68/1.02 Process 28975 was started by sandbox2 on n025.cluster.edu, 0.68/1.02 Tue Jul 13 16:54:28 2021 0.68/1.02 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1200 -f /tmp/Prover9_28822_n025.cluster.edu". 0.68/1.02 ============================== end of head =========================== 0.68/1.02 0.68/1.02 ============================== INPUT ================================= 0.68/1.02 0.68/1.02 % Reading from file /tmp/Prover9_28822_n025.cluster.edu 0.68/1.02 0.68/1.02 set(prolog_style_variables). 0.68/1.02 set(auto2). 0.68/1.02 % set(auto2) -> set(auto). 0.68/1.02 % set(auto) -> set(auto_inference). 0.68/1.02 % set(auto) -> set(auto_setup). 0.68/1.02 % set(auto_setup) -> set(predicate_elim). 0.68/1.02 % set(auto_setup) -> assign(eq_defs, unfold). 0.68/1.02 % set(auto) -> set(auto_limits). 0.68/1.02 % set(auto_limits) -> assign(max_weight, "100.000"). 0.68/1.02 % set(auto_limits) -> assign(sos_limit, 20000). 0.68/1.02 % set(auto) -> set(auto_denials). 0.68/1.02 % set(auto) -> set(auto_process). 0.68/1.02 % set(auto2) -> assign(new_constants, 1). 0.68/1.02 % set(auto2) -> assign(fold_denial_max, 3). 0.68/1.02 % set(auto2) -> assign(max_weight, "200.000"). 0.68/1.02 % set(auto2) -> assign(max_hours, 1). 0.68/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.68/1.02 % set(auto2) -> assign(max_seconds, 0). 0.68/1.02 % set(auto2) -> assign(max_minutes, 5). 0.68/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.68/1.02 % set(auto2) -> set(sort_initial_sos). 0.68/1.02 % set(auto2) -> assign(sos_limit, -1). 0.68/1.02 % set(auto2) -> assign(lrs_ticks, 3000). 0.68/1.02 % set(auto2) -> assign(max_megs, 400). 0.68/1.02 % set(auto2) -> assign(stats, some). 0.68/1.02 % set(auto2) -> clear(echo_input). 0.68/1.02 % set(auto2) -> set(quiet). 0.68/1.02 % set(auto2) -> clear(print_initial_clauses). 0.68/1.02 % set(auto2) -> clear(print_given). 0.68/1.02 assign(lrs_ticks,-1). 0.68/1.02 assign(sos_limit,10000). 0.68/1.02 assign(order,kbo). 0.68/1.02 set(lex_order_vars). 0.68/1.02 clear(print_given). 0.68/1.02 0.68/1.02 % formulas(sos). % not echoed (47 formulas) 0.68/1.02 0.68/1.02 ============================== end of input ========================== 0.68/1.02 0.68/1.02 % From the command line: assign(max_seconds, 1200). 0.68/1.02 0.68/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.68/1.02 0.68/1.02 % Formulas that are not ordinary clauses: 0.68/1.02 1 (all X35 all X36 (leaf_occ(X35,X36) <-> (exists X37 (occurrence_of(X36,X37) & leaf(X35,X37) & subactivity_occurrence(X35,X36))))) # label(sos_11) # label(axiom) # label(non_clause). [assumption]. 0.68/1.02 2 (all X52 (activity_occurrence(X52) -> (exists X53 (occurrence_of(X52,X53) & activity(X53))))) # label(sos_18) # label(axiom) # label(non_clause). [assumption]. 0.68/1.02 3 (all X94 (activity(X94) -> subactivity(X94,X94))) # label(sos_31) # label(axiom) # label(non_clause). [assumption]. 0.68/1.02 4 (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.68/1.02 5 (all X51 (legal(X51) -> arboreal(X51))) # label(sos_17) # label(axiom) # label(non_clause). [assumption]. 0.68/1.02 6 (all X60 all X61 all X62 (leaf_occ(X61,X60) & occurrence_of(X60,X62) -> -(exists X63 min_precedes(X61,X63,X62)))) # label(sos_21) # label(axiom) # label(non_clause). [assumption]. 0.68/1.02 7 (all X85 all X86 all X87 all X88 (arboreal(X88) & subactivity_occurrence(X88,X86) & subactivity_occurrence(X87,X86) & arboreal(X87) & occurrence_of(X86,X85) -> min_precedes(X88,X87,X85) | X87 = X88 | min_precedes(X87,X88,X85))) # label(sos_28) # label(axiom) # label(non_clause). [assumption]. 0.68/1.02 8 (all X28 all X29 (precedes(X28,X29) <-> legal(X29) & earlier(X28,X29))) # label(sos_08) # label(axiom) # label(non_clause). [assumption]. 0.68/1.02 9 (all X91 all X92 (-atomic(X91) & occurrence_of(X92,X91) -> (exists X93 (root(X93,X91) & subactivity_occurrence(X93,X92))))) # label(sos_30) # label(axiom) # label(non_clause). [assumption]. 0.68/1.02 10 (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.68/1.02 11 (all X4 all X5 all X6 (earlier(X4,X5) & earlier(X5,X6) -> earlier(X4,X6))) # label(sos_01) # label(axiom) # label(non_clause). [assumption]. 0.68/1.02 12 (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.68/1.02 13 (all X25 all X26 all X27 (min_precedes(X25,X26,X27) -> -root(X26,X27))) # label(sos_07) # label(axiom) # label(non_clause). [assumption]. 0.68/1.02 14 (all X42 all X43 (leaf(X42,X43) <-> -(exists X45 min_precedes(X42,X45,X43)) & ((exists X44 min_precedes(X44,X42,X43)) | root(X42,X43)))) # label(sos_14) # label(axiom) # label(non_clause). [assumption]. 0.68/1.02 15 (all X38 all X39 (root(X38,X39) -> legal(X38))) # label(sos_12) # label(axiom) # label(non_clause). [assumption]. 0.68/1.02 16 (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.68/1.02 17 (all X95 (occurrence_of(X95,tptp0) -> (exists X96 exists X97 (root_occ(X96,X95) & occurrence_of(X97,tptp3) & next_subocc(X96,X97,tptp0) & leaf_occ(X97,X95) & occurrence_of(X96,tptp4))))) # label(sos_32) # label(axiom) # label(non_clause). [assumption]. 0.68/1.02 18 (all X7 all X8 all X9 all X10 (root_occ(X7,X9) & root_occ(X8,X9) & occurrence_of(X9,X10) -> X8 = X7)) # label(sos_02) # label(axiom) # label(non_clause). [assumption]. 0.68/1.02 19 (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.68/1.02 20 (all X11 all X12 all X13 all X14 (leaf_occ(X12,X13) & leaf_occ(X11,X13) & -atomic(X14) & occurrence_of(X13,X14) -> X12 = X11)) # label(sos_03) # label(axiom) # label(non_clause). [assumption]. 0.68/1.02 21 (all X15 all X16 all X17 (-(exists X18 (min_precedes(X15,X18,X17) & min_precedes(X18,X16,X17))) & min_precedes(X15,X16,X17) <-> next_subocc(X15,X16,X17))) # label(sos_04) # label(axiom) # label(non_clause). [assumption]. 0.68/1.02 22 (all X22 all X23 all X24 (min_precedes(X22,X23,X24) -> precedes(X22,X23))) # label(sos_06) # label(axiom) # label(non_clause). [assumption]. 0.68/1.02 23 (all X46 all X47 ((exists X48 (atomic(X48) & occurrence_of(X46,X48) & subactivity(X47,X48))) <-> atocc(X46,X47))) # label(sos_15) # label(axiom) # label(non_clause). [assumption]. 0.68/1.02 24 (all X89 all X90 (occurrence_of(X90,X89) -> activity(X89) & activity_occurrence(X90))) # label(sos_29) # label(axiom) # label(non_clause). [assumption]. 0.68/1.02 25 (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.68/1.02 26 (all X49 all X50 (atocc(X49,X50) & legal(X49) -> root(X49,X50))) # label(sos_16) # label(axiom) # label(non_clause). [assumption]. 0.68/1.02 27 (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.68/1.02 28 (all X30 all X31 (earlier(X30,X31) -> -earlier(X31,X30))) # label(sos_09) # label(axiom) # label(non_clause). [assumption]. 0.68/1.02 29 (all X82 all X83 (root(X83,X82) -> (exists X84 (atocc(X83,X84) & subactivity(X84,X82))))) # label(sos_27) # label(axiom) # label(non_clause). [assumption]. 0.68/1.02 30 (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.68/1.02 31 (all X54 all X55 (subactivity_occurrence(X54,X55) -> activity_occurrence(X55) & activity_occurrence(X54))) # label(sos_19) # label(axiom) # label(non_clause). [assumption]. 0.68/1.02 32 (all X98 all X99 (root_occ(X98,X99) & occurrence_of(X99,tptp0) -> (exists X100 (occurrence_of(X100,tptp1) & next_subocc(X98,X100,tptp0))))) # label(sos_45) # label(axiom) # label(non_clause). [assumption]. 0.68/1.02 33 (all X40 all X41 (occurrence_of(X40,X41) -> (atomic(X41) <-> arboreal(X40)))) # label(sos_13) # label(axiom) # label(non_clause). [assumption]. 0.68/1.02 34 (all X70 all X71 all X72 (min_precedes(X71,X72,X70) -> (exists X73 (occurrence_of(X73,X70) & subactivity_occurrence(X71,X73) & subactivity_occurrence(X72,X73))))) # label(sos_24) # label(axiom) # label(non_clause). [assumption]. 0.68/1.02 35 --(exists X101 occurrence_of(X101,tptp0)) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption]. 0.68/1.02 0.68/1.02 ============================== end of process non-clausal formulas === 0.68/1.02 0.68/1.02 ============================== PROCESS INITIAL CLAUSES =============== 0.68/1.02 0.68/1.02 ============================== PREDICATE ELIMINATION ================= 0.68/1.02 36 -activity(A) | subactivity(A,A) # label(sos_31) # label(axiom). [clausify(3)]. 0.68/1.02 37 activity(tptp0) # label(sos_33) # label(axiom). [assumption]. 0.68/1.02 38 -activity_occurrence(A) | activity(f2(A)) # label(sos_18) # label(axiom). [clausify(2)]. 0.68/1.02 Derived: subactivity(tptp0,tptp0). [resolve(36,a,37,a)]. 0.68/1.02 Derived: subactivity(f2(A),f2(A)) | -activity_occurrence(A). [resolve(36,a,38,b)]. 0.68/1.02 39 -occurrence_of(A,B) | activity(B) # label(sos_29) # label(axiom). [clausify(24)]. 0.68/1.02 Derived: -occurrence_of(A,B) | subactivity(B,B). [resolve(39,b,36,a)]. 0.68/1.02 40 root(A,f10(A,B)) | -root_occ(A,B) # label(sos_10) # label(axiom). [clausify(19)]. 0.68/1.02 41 -min_precedes(A,B,C) | -root(B,C) # label(sos_07) # label(axiom). [clausify(13)]. 0.68/1.02 42 -root(A,B) | legal(A) # label(sos_12) # label(axiom). [clausify(15)]. 0.68/1.02 Derived: -root_occ(A,B) | -min_precedes(C,A,f10(A,B)). [resolve(40,a,41,b)]. 0.68/1.02 Derived: -root_occ(A,B) | legal(A). [resolve(40,a,42,a)]. 0.68/1.02 43 -atocc(A,B) | -legal(A) | root(A,B) # label(sos_16) # label(axiom). [clausify(26)]. 0.68/1.02 Derived: -atocc(A,B) | -legal(A) | -min_precedes(C,A,B). [resolve(43,c,41,b)]. 0.68/1.02 44 -root(A,B) | atocc(A,f15(B,A)) # label(sos_27) # label(axiom). [clausify(29)]. 0.68/1.02 Derived: atocc(A,f15(f10(A,B),A)) | -root_occ(A,B). [resolve(44,a,40,a)]. 0.68/1.02 Derived: atocc(A,f15(B,A)) | -atocc(A,B) | -legal(A). [resolve(44,a,43,c)]. 0.68/1.02 45 -root(A,B) | subactivity(f15(B,A),B) # label(sos_27) # label(axiom). [clausify(29)]. 0.68/1.02 Derived: subactivity(f15(f10(A,B),A),f10(A,B)) | -root_occ(A,B). [resolve(45,a,40,a)]. 0.68/1.02 Derived: subactivity(f15(A,B),A) | -atocc(B,A) | -legal(B). [resolve(45,a,43,c)]. 0.68/1.02 46 atomic(A) | -occurrence_of(B,A) | root(f3(A,B),A) # label(sos_30) # label(axiom). [clausify(9)]. 0.68/1.02 Derived: atomic(A) | -occurrence_of(B,A) | -min_precedes(C,f3(A,B),A). [resolve(46,c,41,b)]. 0.68/1.02 Derived: atomic(A) | -occurrence_of(B,A) | legal(f3(A,B)). [resolve(46,c,42,a)]. 0.68/1.02 Derived: atomic(A) | -occurrence_of(B,A) | atocc(f3(A,B),f15(A,f3(A,B))). [resolve(46,c,44,a)]. 0.68/1.02 Derived: atomic(A) | -occurrence_of(B,A) | subactivity(f15(A,f3(A,B)),A). [resolve(46,c,45,a)]. 0.68/1.02 47 -leaf(A,B) | min_precedes(f6(A,B),A,B) | root(A,B) # label(sos_14) # label(axiom). [clausify(14)]. 0.68/1.02 Derived: -leaf(A,B) | min_precedes(f6(A,B),A,B) | -min_precedes(C,A,B). [resolve(47,c,41,b)]. 0.68/1.02 Derived: -leaf(A,B) | min_precedes(f6(A,B),A,B) | legal(A). [resolve(47,c,42,a)]. 0.68/1.02 Derived: -leaf(A,B) | min_precedes(f6(A,B),A,B) | atocc(A,f15(B,A)). [resolve(47,c,44,a)]. 0.68/1.02 Derived: -leaf(A,B) | min_precedes(f6(A,B),A,B) | subactivity(f15(B,A),B). [resolve(47,c,45,a)]. 0.68/1.02 48 leaf(A,B) | min_precedes(A,f7(A,B),B) | -root(A,B) # label(sos_14) # label(axiom). [clausify(14)]. 0.68/1.02 Derived: leaf(A,f10(A,B)) | min_precedes(A,f7(A,f10(A,B)),f10(A,B)) | -root_occ(A,B). [resolve(48,c,40,a)]. 0.68/1.02 Derived: leaf(A,B) | min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A). [resolve(48,c,43,c)]. 0.68/1.02 Derived: leaf(f3(A,B),A) | min_precedes(f3(A,B),f7(f3(A,B),A),A) | atomic(A) | -occurrence_of(B,A). [resolve(48,c,46,c)]. 0.68/1.02 49 -subactivity_occurrence(A,B) | -root(A,C) | -occurrence_of(B,C) | root_occ(A,B) # label(sos_10) # label(axiom). [clausify(19)]. 0.68/1.02 Derived: -subactivity_occurrence(A,B) | -occurrence_of(B,f10(A,C)) | root_occ(A,B) | -root_occ(A,C). [resolve(49,b,40,a)]. 0.68/1.02 Derived: -subactivity_occurrence(A,B) | -occurrence_of(B,C) | root_occ(A,B) | -atocc(A,C) | -legal(A). [resolve(49,b,43,c)]. 0.68/1.02 Derived: -subactivity_occurrence(f3(A,B),C) | -occurrence_of(C,A) | root_occ(f3(A,B),C) | atomic(A) | -occurrence_of(B,A). [resolve(49,b,46,c)]. 0.68/1.02 Derived: -subactivity_occurrence(A,B) | -occurrence_of(B,C) | root_occ(A,B) | -leaf(A,C) | min_precedes(f6(A,C),A,C). [resolve(49,b,47,c)]. 0.68/1.02 50 -leaf_occ(A,B) | leaf(A,f1(A,B)) # label(sos_11) # label(axiom). [clausify(1)]. 0.68/1.02 51 -leaf(A,B) | -min_precedes(A,C,B) # label(sos_14) # label(axiom). [clausify(14)]. 0.68/1.02 Derived: -leaf_occ(A,B) | -min_precedes(A,C,f1(A,B)). [resolve(50,b,51,a)]. 0.68/1.02 52 -leaf(A,B) | atomic(B) | leaf_occ(A,f4(A,B)) # label(sos_23) # label(axiom). [clausify(10)]. 0.68/1.02 Derived: atomic(f1(A,B)) | leaf_occ(A,f4(A,f1(A,B))) | -leaf_occ(A,B). [resolve(52,a,50,b)]. 0.68/1.02 53 -leaf(A,B) | atomic(B) | occurrence_of(f4(A,B),B) # label(sos_23) # label(axiom). [clausify(10)]. 0.68/1.02 Derived: atomic(f1(A,B)) | occurrence_of(f4(A,f1(A,B)),f1(A,B)) | -leaf_occ(A,B). [resolve(53,a,50,b)]. 0.68/1.02 54 atomic(A) | -leaf(B,A) | leaf_occ(B,f5(B,A)) # label(sos_25) # label(axiom). [clausify(12)]. 0.68/1.02 Derived: atomic(f1(A,B)) | leaf_occ(A,f5(A,f1(A,B))) | -leaf_occ(A,B). [resolve(54,b,50,b)]. 0.68/1.02 55 atomic(A) | -leaf(B,A) | occurrence_of(f5(B,A),A) # label(sos_25) # label(axiom). [clausify(12)]. 0.68/1.02 Derived: atomic(f1(A,B)) | occurrence_of(f5(A,f1(A,B)),f1(A,B)) | -leaf_occ(A,B). [resolve(55,b,50,b)]. 0.68/1.02 56 leaf_occ(A,B) | -occurrence_of(B,C) | -leaf(A,C) | -subactivity_occurrence(A,B) # label(sos_11) # label(axiom). [clausify(1)]. 0.68/1.02 Derived: leaf_occ(A,B) | -occurrence_of(B,f1(A,C)) | -subactivity_occurrence(A,B) | -leaf_occ(A,C). [resolve(56,c,50,b)]. 0.68/1.02 57 leaf(A,B) | min_precedes(A,f7(A,B),B) | -min_precedes(C,A,B) # label(sos_14) # label(axiom). [clausify(14)]. 0.68/1.02 Derived: min_precedes(A,f7(A,B),B) | -min_precedes(C,A,B) | -min_precedes(A,D,B). [resolve(57,a,51,a)]. 0.68/1.02 Derived: min_precedes(A,f7(A,B),B) | -min_precedes(C,A,B) | atomic(B) | leaf_occ(A,f4(A,B)). [resolve(57,a,52,a)]. 0.68/1.02 Derived: min_precedes(A,f7(A,B),B) | -min_precedes(C,A,B) | atomic(B) | occurrence_of(f4(A,B),B). [resolve(57,a,53,a)]. 0.68/1.02 Derived: min_precedes(A,f7(A,B),B) | -min_precedes(C,A,B) | atomic(B) | leaf_occ(A,f5(A,B)). [resolve(57,a,54,b)]. 0.68/1.02 Derived: min_precedes(A,f7(A,B),B) | -min_precedes(C,A,B) | atomic(B) | occurrence_of(f5(A,B),B). [resolve(57,a,55,b)]. 0.68/1.02 Derived: min_precedes(A,f7(A,B),B) | -min_precedes(C,A,B) | leaf_occ(A,D) | -occurrence_of(D,B) | -subactivity_occurrence(A,D). [resolve(57,a,56,c)]. 0.68/1.02 58 -leaf(A,B) | min_precedes(f6(A,B),A,B) | -min_precedes(C,A,B). [resolve(47,c,41,b)]. 0.68/1.02 Derived: min_precedes(f6(A,f1(A,B)),A,f1(A,B)) | -min_precedes(C,A,f1(A,B)) | -leaf_occ(A,B). [resolve(58,a,50,b)]. 0.68/1.02 Derived: min_precedes(f6(A,B),A,B) | -min_precedes(C,A,B) | min_precedes(A,f7(A,B),B) | -min_precedes(D,A,B). [resolve(58,a,57,a)]. 0.68/1.02 59 -leaf(A,B) | min_precedes(f6(A,B),A,B) | legal(A). [resolve(47,c,42,a)]. 0.68/1.02 Derived: min_precedes(f6(A,f1(A,B)),A,f1(A,B)) | legal(A) | -leaf_occ(A,B). [resolve(59,a,50,b)]. 0.68/1.02 60 -leaf(A,B) | min_precedes(f6(A,B),A,B) | atocc(A,f15(B,A)). [resolve(47,c,44,a)]. 0.68/1.02 Derived: min_precedes(f6(A,f1(A,B)),A,f1(A,B)) | atocc(A,f15(f1(A,B),A)) | -leaf_occ(A,B). [resolve(60,a,50,b)]. 0.68/1.02 61 -leaf(A,B) | min_precedes(f6(A,B),A,B) | subactivity(f15(B,A),B). [resolve(47,c,45,a)]. 0.68/1.02 Derived: min_precedes(f6(A,f1(A,B)),A,f1(A,B)) | subactivity(f15(f1(A,B),A),f1(A,B)) | -leaf_occ(A,B). [resolve(61,a,50,b)]. 0.68/1.02 62 leaf(A,f10(A,B)) | min_precedes(A,f7(A,f10(A,B)),f10(A,B)) | -root_occ(A,B). [resolve(48,c,40,a)]. 0.68/1.02 Derived: min_precedes(A,f7(A,f10(A,B)),f10(A,B)) | -root_occ(A,B) | -min_precedes(A,C,f10(A,B)). [resolve(62,a,51,a)]. 0.68/1.02 Derived: min_precedes(A,f7(A,f10(A,B)),f10(A,B)) | -root_occ(A,B) | atomic(f10(A,B)) | leaf_occ(A,f4(A,f10(A,B))). [resolve(62,a,52,a)]. 0.68/1.02 Derived: min_precedes(A,f7(A,f10(A,B)),f10(A,B)) | -root_occ(A,B) | atomic(f10(A,B)) | occurrence_of(f4(A,f10(A,B)),f10(A,B)). [resolve(62,a,53,a)]. 0.68/1.02 Derived: min_precedes(A,f7(A,f10(A,B)),f10(A,B)) | -root_occ(A,B) | atomic(f10(A,B)) | leaf_occ(A,f5(A,f10(A,B))). [resolve(62,a,54,b)]. 0.68/1.02 Derived: min_precedes(A,f7(A,f10(A,B)),f10(A,B)) | -root_occ(A,B) | atomic(f10(A,B)) | occurrence_of(f5(A,f10(A,B)),f10(A,B)). [resolve(62,a,55,b)]. 0.68/1.02 Derived: min_precedes(A,f7(A,f10(A,B)),f10(A,B)) | -root_occ(A,B) | leaf_occ(A,C) | -occurrence_of(C,f10(A,B)) | -subactivity_occurrence(A,C). [resolve(62,a,56,c)]. 0.68/1.02 Derived: min_precedes(A,f7(A,f10(A,B)),f10(A,B)) | -root_occ(A,B) | min_precedes(f6(A,f10(A,B)),A,f10(A,B)) | legal(A). [resolve(62,a,59,a)]. 0.68/1.02 Derived: min_precedes(A,f7(A,f10(A,B)),f10(A,B)) | -root_occ(A,B) | min_precedes(f6(A,f10(A,B)),A,f10(A,B)) | atocc(A,f15(f10(A,B),A)). [resolve(62,a,60,a)]. 0.68/1.02 Derived: min_precedes(A,f7(A,f10(A,B)),f10(A,B)) | -root_occ(A,B) | min_precedes(f6(A,f10(A,B)),A,f10(A,B)) | subactivity(f15(f10(A,B),A),f10(A,B)). [resolve(62,a,61,a)]. 0.68/1.02 63 leaf(A,B) | min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A). [resolve(48,c,43,c)]. 0.68/1.02 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A) | -min_precedes(A,C,B). [resolve(63,a,51,a)]. 0.68/1.02 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A) | atomic(B) | leaf_occ(A,f4(A,B)). [resolve(63,a,52,a)]. 0.68/1.02 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A) | atomic(B) | occurrence_of(f4(A,B),B). [resolve(63,a,53,a)]. 0.68/1.02 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A) | atomic(B) | leaf_occ(A,f5(A,B)). [resolve(63,a,54,b)]. 0.68/1.02 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A) | atomic(B) | occurrence_of(f5(A,B),B). [resolve(63,a,55,b)]. 0.68/1.02 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A) | leaf_occ(A,C) | -occurrence_of(C,B) | -subactivity_occurrence(A,C). [resolve(63,a,56,c)]. 0.68/1.02 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A) | min_precedes(f6(A,B),A,B) | atocc(A,f15(B,A)). [resolve(63,a,60,a)]. 0.68/1.02 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A) | min_precedes(f6(A,B),A,B) | subactivity(f15(B,A),B). [resolve(63,a,61,a)]. 0.68/1.02 64 leaf(f3(A,B),A) | min_precedes(f3(A,B),f7(f3(A,B),A),A) | atomic(A) | -occurrence_of(B,A). [resolve(48,c,46,c)]. 0.68/1.02 Derived: min_precedes(f3(A,B),f7(f3(A,B),A),A) | atomic(A) | -occurrence_of(B,A) | -min_precedes(f3(A,B),C,A). [resolve(64,a,51,a)]. 0.68/1.02 Derived: min_precedes(f3(A,B),f7(f3(A,B),A),A) | atomic(A) | -occurrence_of(B,A) | atomic(A) | leaf_occ(f3(A,B),f4(f3(A,B),A)). [resolve(64,a,52,a)]. 0.68/1.02 Derived: min_precedes(f3(A,B),f7(f3(A,B),A),A) | atomic(A) | -occurrence_of(B,A) | atomic(A) | occurrence_of(f4(f3(A,B),A),A). [resolve(64,a,53,a)]. 0.68/1.02 Derived: min_precedes(f3(A,B),f7(f3(A,B),A),A) | atomic(A) | -occurrence_of(B,A) | atomic(A) | leaf_occ(f3(A,B),f5(f3(A,B),A)). [resolve(64,a,54,b)]. 0.68/1.02 Derived: min_precedes(f3(A,B),f7(f3(A,B),A),A) | atomic(A) | -occurrence_of(B,A) | atomic(A) | occurrence_of(f5(f3(A,B),A),A). [resolve(64,a,55,b)]. 0.68/1.02 Derived: min_precedes(f3(A,B),f7(f3(A,B),A),A) | atomic(A) | -occurrence_of(B,A) | leaf_occ(f3(A,B),C) | -occurrence_of(C,A) | -subactivity_occurrence(f3(A,B),C). [resolve(64,a,56,c)]. 0.68/1.02 Derived: min_precedes(f3(A,B),f7(f3(A,B),A),A) | atomic(A) | -occurrence_of(B,A) | min_precedes(f6(f3(A,B),A),f3(A,B),A) | legal(f3(A,B)). [resolve(64,a,59,a)]. 0.68/1.02 Derived: min_precedes(f3(A,B),f7(f3(A,B),A),A) | atomic(A) | -occurrence_of(B,A) | min_precedes(f6(f3(A,B),A),f3(A,B),A) | atocc(f3(A,B),f15(A,f3(A,B))). [resolve(64,a,60,a)]. 0.68/1.02 Derived: min_precedes(f3(A,B),f7(f3(A,B),A),A) | atomic(A) | -occurrence_of(B,A) | min_precedes(f6(f3(A,B),A),f3(A,B),A) | subactivity(f15(A,f3(A,B)),A). [resolve(64,a,61,a)]. 0.68/1.02 65 -subactivity_occurrence(A,B) | -occurrence_of(B,C) | root_occ(A,B) | -leaf(A,C) | min_precedes(f6(A,C),A,C). [resolve(49,b,47,c)]. 0.68/1.02 Derived: -subactivity_occurrence(A,B) | -occurrence_of(B,f1(A,C)) | root_occ(A,B) | min_precedes(f6(A,f1(A,C)),A,f1(A,C)) | -leaf_occ(A,C). [resolve(65,d,50,b)]. 0.68/1.02 Derived: -subactivity_occurrence(A,B) | -occurrence_of(B,f10(A,C)) | root_occ(A,B) | min_precedes(f6(A,f10(A,C)),A,f10(A,C)) | min_precedes(A,f7(A,f10(A,C)),f10(A,C)) | -root_occ(A,C). [resolve(65,d,62,a)]. 0.68/1.02 Derived: -subactivity_occurrence(A,B) | -occurrence_of(B,C) | root_occ(A,B) | min_precedes(f6(A,C),A,C) | min_precedes(A,f7(A,C),C) | -atocc(A,C) | -legal(A). [resolve(65,d,63,a)]. 0.68/1.02 Derived: -subactivity_occurrence(f3(A,B),C) | -occurrence_of(C,A) | root_occ(f3(A,B),C) | min_precedes(f6(f3(A,B),A),f3(A,B),A) | min_precedes(f3(A,B),f7(f3(A,B),A),A) | atomic(A) | -occurrence_of(B,A). [resolve(65,d,64,a)]. 0.68/1.02 66 -occurrence_of(A,tptp0) | next_subocc(f8(A),f9(A),tptp0) # label(sos_32) # label(axiom). [clausify(17)]. 0.68/1.02 67 -min_precedes(A,B,C) | -min_precedes(B,D,C) | -next_subocc(A,D,C) # label(sos_04) # label(axiom). [clausify(21)]. 0.68/1.02 68 -next_subocc(A,B,C) | arboreal(A) # label(sos_05) # label(axiom). [clausify(16)]. 0.68/1.03 69 -next_subocc(A,B,C) | arboreal(B) # label(sos_05) # label(axiom). [clausify(16)]. 0.68/1.03 70 min_precedes(A,B,C) | -next_subocc(A,B,C) # label(sos_04) # label(axiom). [clausify(21)]. 0.68/1.03 Derived: -occurrence_of(A,tptp0) | -min_precedes(f8(A),B,tptp0) | -min_precedes(B,f9(A),tptp0). [resolve(66,b,67,c)]. 0.68/1.03 Derived: -occurrence_of(A,tptp0) | arboreal(f8(A)). [resolve(66,b,68,a)]. 0.68/1.03 Derived: -occurrence_of(A,tptp0) | arboreal(f9(A)). [resolve(66,b,69,a)]. 0.68/1.03 Derived: -occurrence_of(A,tptp0) | min_precedes(f8(A),f9(A),tptp0). [resolve(66,b,70,b)]. 0.68/1.03 71 -root_occ(A,B) | -occurrence_of(B,tptp0) | next_subocc(A,f16(A,B),tptp0) # label(sos_45) # label(axiom). [clausify(32)]. 0.68/1.03 Derived: -root_occ(A,B) | -occurrence_of(B,tptp0) | -min_precedes(A,C,tptp0) | -min_precedes(C,f16(A,B),tptp0). [resolve(71,c,67,c)]. 0.68/1.03 Derived: -root_occ(A,B) | -occurrence_of(B,tptp0) | arboreal(A). [resolve(71,c,68,a)]. 0.68/1.03 Derived: -root_occ(A,B) | -occurrence_of(B,tptp0) | arboreal(f16(A,B)). [resolve(71,c,69,a)]. 0.68/1.03 Derived: -root_occ(A,B) | -occurrence_of(B,tptp0) | min_precedes(A,f16(A,B),tptp0). [resolve(71,c,70,b)]. 0.68/1.03 72 min_precedes(A,f11(A,B,C),C) | -min_precedes(A,B,C) | next_subocc(A,B,C) # label(sos_04) # label(axiom). [clausify(21)]. 0.68/1.03 Derived: min_precedes(A,f11(A,B,C),C) | -min_precedes(A,B,C) | -min_precedes(A,D,C) | -min_precedes(D,B,C). [resolve(72,c,67,c)]. 0.68/1.03 Derived: min_precedes(A,f11(A,B,C),C) | -min_precedes(A,B,C) | arboreal(A). [resolve(72,c,68,a)]. 0.68/1.03 Derived: min_precedes(A,f11(A,B,C),C) | -min_precedes(A,B,C) | arboreal(B). [resolve(72,c,69,a)]. 0.68/1.03 73 min_precedes(f11(A,B,C),B,C) | -min_precedes(A,B,C) | next_subocc(A,B,C) # label(sos_04) # label(axiom). [clausify(21)]. 0.68/1.03 Derived: min_precedes(f11(A,B,C),B,C) | -min_precedes(A,B,C) | -min_precedes(A,D,C) | -min_precedes(D,B,C). [resolve(73,c,67,c)]. 0.68/1.03 Derived: min_precedes(f11(A,B,C),B,C) | -min_precedes(A,B,C) | arboreal(A). [resolve(73,c,68,a)]. 0.68/1.03 Derived: min_precedes(f11(A,B,C),B,C) | -min_precedes(A,B,C) | arboreal(B). [resolve(73,c,69,a)]. 0.68/1.03 74 -precedes(A,B) | legal(B) # label(sos_08) # label(axiom). [clausify(8)]. 0.68/1.03 75 -legal(A) | arboreal(A) # label(sos_17) # label(axiom). [clausify(5)]. 0.68/1.03 Derived: -precedes(A,B) | arboreal(B). [resolve(74,b,75,a)]. 0.68/1.03 76 precedes(A,B) | -legal(B) | -earlier(A,B) # label(sos_08) # label(axiom). [clausify(8)]. 0.68/1.03 Derived: precedes(A,B) | -earlier(A,B) | -precedes(C,B). [resolve(76,b,74,b)]. 0.68/1.03 77 -root_occ(A,B) | legal(A). [resolve(40,a,42,a)]. 0.68/1.03 Derived: -root_occ(A,B) | arboreal(A). [resolve(77,b,75,a)]. 0.68/1.03 Derived: -root_occ(A,B) | precedes(C,A) | -earlier(C,A). [resolve(77,b,76,b)]. 0.68/1.03 78 -atocc(A,B) | -legal(A) | -min_precedes(C,A,B). [resolve(43,c,41,b)]. 0.68/1.03 Derived: -atocc(A,B) | -min_precedes(C,A,B) | -precedes(D,A). [resolve(78,b,74,b)]. 0.68/1.03 Derived: -atocc(A,B) | -min_precedes(C,A,B) | -root_occ(A,D). [resolve(78,b,77,b)]. 0.68/1.03 79 atocc(A,f15(B,A)) | -atocc(A,B) | -legal(A). [resolve(44,a,43,c)]. 0.68/1.03 Derived: atocc(A,f15(B,A)) | -atocc(A,B) | -precedes(C,A). [resolve(79,c,74,b)]. 0.68/1.03 Derived: atocc(A,f15(B,A)) | -atocc(A,B) | -root_occ(A,C). [resolve(79,c,77,b)]. 0.68/1.03 80 subactivity(f15(A,B),A) | -atocc(B,A) | -legal(B). [resolve(45,a,43,c)]. 0.68/1.03 Derived: subactivity(f15(A,B),A) | -atocc(B,A) | -precedes(C,B). [resolve(80,c,74,b)]. 0.68/1.03 Derived: subactivity(f15(A,B),A) | -atocc(B,A) | -root_occ(B,C). [resolve(80,c,77,b)]. 0.68/1.03 81 atomic(A) | -occurrence_of(B,A) | legal(f3(A,B)). [resolve(46,c,42,a)]. 0.68/1.03 Derived: atomic(A) | -occurrence_of(B,A) | arboreal(f3(A,B)). [resolve(81,c,75,a)]. 0.68/1.03 Derived: atomic(A) | -occurrence_of(B,A) | precedes(C,f3(A,B)) | -earlier(C,f3(A,B)). [resolve(81,c,76,b)]. 0.68/1.03 Derived: atomic(A) | -occurrence_of(B,A) | -atocc(f3(A,B),C) | -min_precedes(D,f3(A,B),C). [resolve(81,c,78,b)]. 0.68/1.03 Derived: atomic(A) | -occurrence_of(B,A) | atocc(f3(A,B),f15(C,f3(A,B))) | -atocc(f3(A,B),C). [resolve(81,c,79,c)]. 0.68/1.03 Derived: atomic(A) | -occurrence_of(B,A) | subactivity(f15(C,f3(A,B)),C) | -atocc(f3(A,B),C). [resolve(81,c,80,c)]. 0.68/1.03 82 -subactivity_occurrence(A,B) | -occurrence_of(B,C) | root_occ(A,B) | -atocc(A,C) | -legal(A). [resolve(49,b,43,c)]. 0.68/1.03 Derived: -subactivity_occurrence(A,B) | -occurrence_of(B,C) | root_occ(A,B) | -atocc(A,C) | -precedes(D,A). [resolve(82,e,74,b)]. 0.68/1.03 Derived: -subactivity_occurrence(A,B) | -occurrence_of(B,C) | root_occ(A,B) | -atocc(A,C) | -root_occ(A,D). [resolve(82,e,77,b)]. 0.68/1.03 Derived: -subactivity_occurrence(f3(A,B),C) | -occurrence_of(C,D) | root_occ(f3(A,B),C) | -atocc(f3(A,B),D) | atomic(A) | -occurrence_of(B,A). [resolve(82,e,81,c)]. 0.68/1.03 83 min_precedes(f6(A,f1(A,B)),A,f1(A,B)) | legal(A) | -leaf_occ(A,B). [resolve(59,a,50,b)]. 0.68/1.03 Derived: min_precedes(f6(A,f1(A,B)),A,f1(A,B)) | -leaf_occ(A,B) | arboreal(A). [resolve(83,b,75,a)]. 0.68/1.03 Derived: min_precedes(f6(A,f1(A,B)),A,f1(A,B)) | -leaf_occ(A,B) | precedes(C,A) | -earlier(C,A). [resolve(83,b,76,b)]. 0.68/1.03 Derived: min_precedes(f6(A,f1(A,B)),A,f1(A,B)) | -leaf_occ(A,B) | -atocc(A,C) | -min_precedes(D,A,C). [resolve(83,b,78,b)]. 0.68/1.03 Derived: min_precedes(f6(A,f1(A,B)),A,f1(A,B)) | -leaf_occ(A,B) | atocc(A,f15(C,A)) | -atocc(A,C). [resolve(83,b,79,c)]. 0.68/1.03 Derived: min_precedes(f6(A,f1(A,B)),A,f1(A,B)) | -leaf_occ(A,B) | subactivity(f15(C,A),C) | -atocc(A,C). [resolve(83,b,80,c)]. 0.68/1.03 Derived: min_precedes(f6(A,f1(A,B)),A,f1(A,B)) | -leaf_occ(A,B) | -subactivity_occurrence(A,C) | -occurrence_of(C,D) | root_occ(A,C) | -atocc(A,D). [resolve(83,b,82,e)]. 0.68/1.03 84 min_precedes(A,f7(A,f10(A,B)),f10(A,B)) | -root_occ(A,B) | min_precedes(f6(A,f10(A,B)),A,f10(A,B)) | legal(A). [resolve(62,a,59,a)]. 0.68/1.03 85 min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A) | -min_precedes(A,C,B). [resolve(63,a,51,a)]. 0.68/1.03 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | -min_precedes(A,C,B) | -precedes(D,A). [resolve(85,c,74,b)]. 0.68/1.03 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | -min_precedes(A,C,B) | -root_occ(A,D). [resolve(85,c,77,b)]. 0.68/1.03 Derived: min_precedes(f3(A,B),f7(f3(A,B),C),C) | -atocc(f3(A,B),C) | -min_precedes(f3(A,B),D,C) | atomic(A) | -occurrence_of(B,A). [resolve(85,c,81,c)]. 0.68/1.03 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | -min_precedes(A,C,B) | min_precedes(f6(A,f1(A,D)),A,f1(A,D)) | -leaf_occ(A,D). [resolve(85,c,83,b)]. 0.68/1.03 86 min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A) | atomic(B) | leaf_occ(A,f4(A,B)). [resolve(63,a,52,a)]. 0.68/1.03 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | atomic(B) | leaf_occ(A,f4(A,B)) | -precedes(C,A). [resolve(86,c,74,b)]. 0.68/1.03 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | atomic(B) | leaf_occ(A,f4(A,B)) | -root_occ(A,C). [resolve(86,c,77,b)]. 0.68/1.03 Derived: min_precedes(f3(A,B),f7(f3(A,B),C),C) | -atocc(f3(A,B),C) | atomic(C) | leaf_occ(f3(A,B),f4(f3(A,B),C)) | atomic(A) | -occurrence_of(B,A). [resolve(86,c,81,c)]. 0.68/1.03 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | atomic(B) | leaf_occ(A,f4(A,B)) | min_precedes(f6(A,f1(A,C)),A,f1(A,C)) | -leaf_occ(A,C). [resolve(86,c,83,b)]. 0.68/1.03 87 min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A) | atomic(B) | occurrence_of(f4(A,B),B). [resolve(63,a,53,a)]. 0.68/1.03 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | atomic(B) | occurrence_of(f4(A,B),B) | -precedes(C,A). [resolve(87,c,74,b)]. 0.68/1.03 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | atomic(B) | occurrence_of(f4(A,B),B) | -root_occ(A,C). [resolve(87,c,77,b)]. 0.68/1.03 Derived: min_precedes(f3(A,B),f7(f3(A,B),C),C) | -atocc(f3(A,B),C) | atomic(C) | occurrence_of(f4(f3(A,B),C),C) | atomic(A) | -occurrence_of(B,A). [resolve(87,c,81,c)]. 0.68/1.03 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | atomic(B) | occurrence_of(f4(A,B),B) | min_precedes(f6(A,f1(A,C)),A,f1(A,C)) | -leaf_occ(A,C). [resolve(87,c,83,b)]. 0.68/1.03 88 min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A) | atomic(B) | leaf_occ(A,f5(A,B)). [resolve(63,a,54,b)]. 0.68/1.03 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | atomic(B) | leaf_occ(A,f5(A,B)) | -precedes(C,A). [resolve(88,c,74,b)]. 0.68/1.03 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | atomic(B) | leaf_occ(A,f5(A,B)) | -root_occ(A,C). [resolve(88,c,77,b)]. 0.68/1.03 Derived: min_precedes(f3(A,B),f7(f3(A,B),C),C) | -atocc(f3(A,B),C) | atomic(C) | leaf_occ(f3(A,B),f5(f3(A,B),C)) | atomic(A) | -occurrence_of(B,A). [resolve(88,c,81,c)]. 0.68/1.03 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | atomic(B) | leaf_occ(A,f5(A,B)) | min_precedes(f6(A,f1(A,C)),A,f1(A,C)) | -leaf_occ(A,C). [resolve(88,c,83,b)]. 0.68/1.03 89 min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A) | atomic(B) | occurrence_of(f5(A,B),B). [resolve(63,a,55,b)]. 0.68/1.03 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | atomic(B) | occurrence_of(f5(A,B),B) | -precedes(C,A). [resolve(89,c,74,b)]. 0.68/1.03 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | atomic(B) | occurrence_of(f5(A,B),B) | -root_occ(A,C). [resolve(89,c,77,b)]. 0.68/1.03 Derived: min_precedes(f3(A,B),f7(f3(A,B),C),C) | -atocc(f3(A,B),C) | atomic(C) | occurrence_of(f5(f3(A,B),C),C) | atomic(A) | -occurrence_of(B,A). [resolve(89,c,81,c)]. 0.68/1.03 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | atomic(B) | occurrence_of(f5(A,B),B) | min_precedes(f6(A,f1(A,C)),A,f1(A,C)) | -leaf_occ(A,C). [resolve(89,c,83,b)]. 0.68/1.03 90 min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A) | leaf_occ(A,C) | -occurrence_of(C,B) | -subactivity_occurrence(A,C). [resolve(63,a,56,c)]. 0.68/1.03 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | leaf_occ(A,C) | -occurrence_of(C,B) | -subactivity_occurrence(A,C) | -precedes(D,A). [resolve(90,c,74,b)]. 0.68/1.03 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | leaf_occ(A,C) | -occurrence_of(C,B) | -subactivity_occurrence(A,C) | -root_occ(A,D). [resolve(90,c,77,b)]. 0.68/1.03 Derived: min_precedes(f3(A,B),f7(f3(A,B),C),C) | -atocc(f3(A,B),C) | leaf_occ(f3(A,B),D) | -occurrence_of(D,C) | -subactivity_occurrence(f3(A,B),D) | atomic(A) | -occurrence_of(B,A). [resolve(90,c,81,c)]. 0.68/1.03 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | leaf_occ(A,C) | -occurrence_of(C,B) | -subactivity_occurrence(A,C) | min_precedes(f6(A,f1(A,D)),A,f1(A,D)) | -leaf_occ(A,D). [resolve(90,c,83,b)]. 0.68/1.03 91 min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A) | min_precedes(f6(A,B),A,B) | atocc(A,f15(B,A)). [resolve(63,a,60,a)]. 0.68/1.03 92 min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A) | min_precedes(f6(A,B),A,B) | subactivity(f15(B,A),B). [resolve(63,a,61,a)]. 0.68/1.03 93 min_precedes(f3(A,B),f7(f3(A,B),A),A) | atomic(A) | -occurrence_of(B,A) | min_precedes(f6(f3(A,B),A),f3(A,B),A) | legal(f3(A,B)). [resolve(64,a,59,a)]. 0.68/1.03 94 -subactivity_occurrence(A,B) | -occurrence_of(B,C) | root_occ(A,B) | min_precedes(f6(A,C),A,C) | min_precedes(A,f7(A,C),C) | -atocc(A,C) | -legal(A). [resolve(65,d,63,a)]. 0.68/1.03 95 -activity_occurrence(A) | occurrence_of(A,f2(A)) # label(sos_18) # label(axiom). [clausify(2)]. 0.68/1.03 96 -occurrence_of(A,B) | activity_occurrence(A) # label(sos_29) # label(axiom). [clausify(24)]. 0.68/1.03 97 -subactivity_occurrence(A,B) | activity_occurrence(B) # label(sos_19) # label(axiom). [clausify(31)]. 0.68/1.03 98 -subactivity_occurrence(A,B) | activity_occurrence(A) # label(sos_19) # label(axiom). [clausify(31)]. 0.68/1.03 Derived: occurrence_of(A,f2(A)) | -occurrence_of(A,B). [resolve(95,a,96,b)]. 0.68/1.03 Derived: occurrence_of(A,f2(A)) | -subactivity_occurrence(B,A). [resolve(95,a,97,b)]. 0.68/1.03 Derived: occurrence_of(A,f2(A)) | -subactivity_occurrence(A,B). [resolve(95,a,98,b)]. 0.68/1.03 99 subactivity(f2(A),f2(A)) | -activity_occurrence(A). [resolve(36,a,38,b)]. 0.68/1.03 Derived: subactivity(f2(A),f2(A)) | -occurrence_of(A,B). [resolve(99,b,96,b)]. 0.68/1.03 Derived: subactivity(f2(A),f2(A)) | -subactivity_occurrence(B,A). [resolve(99,b,97,b)]. 0.68/1.03 Derived: subactivity(f2(A),f2(A)) | -subactivity_occurrence(A,B). [resolve(99,b,98,b)]. 0.68/1.03 100 -atomic(A) | -occurrence_of(B,A) | -subactivity(C,A) | atocc(B,C) # label(sos_15) # label(axiom). [clausify(23)]. 0.68/1.03 101 subactivity(A,f12(B,A)) | -atocc(B,A) # label(sos_15) # label(axiom). [clausify(23)]. 0.68/1.03 102 -min_precedes(A,B,C) | subactivity(f13(C,A,B),C) # label(sos_26) # label(axiom). [clausify(27)]. 0.68/1.03 103 -min_precedes(A,B,C) | subactivity(f14(C,A,B),C) # label(sos_26) # label(axiom). [clausify(27)]. 0.68/1.03 Derived: -atomic(f12(A,B)) | -occurrence_of(C,f12(A,B)) | atocc(C,B) | -atocc(A,B). [resolve(100,c,101,a)]. 0.68/1.03 Derived: -atomic(A) | -occurrence_of(B,A) | atocc(B,f13(A,C,D)) | -min_precedes(C,D,A). [resolve(100,c,102,b)]. 0.68/1.03 Derived: -atomic(A) | -occurrence_of(B,A) | atocc(B,f14(A,C,D)) | -min_precedes(C,D,A). [resolve(100,c,103,b)]. 0.68/1.03 104 subactivity(tptp0,tptp0). [resolve(36,a,37,a)]. 0.68/1.03 Derived: -atomic(tptp0) | -occurrence_of(A,tptp0) | atocc(A,tptp0). [resolve(104,a,100,c)]. 8.37/8.68 105 -occurrence_of(A,B) | subactivity(B,B). [resolve(39,b,36,a)]. 8.37/8.68 Derived: -occurrence_of(A,B) | -atomic(B) | -occurrence_of(C,B) | atocc(C,B). [resolve(105,b,100,c)]. 8.37/8.68 106 subactivity(f15(f10(A,B),A),f10(A,B)) | -root_occ(A,B). [resolve(45,a,40,a)]. 8.37/8.68 Derived: -root_occ(A,B) | -atomic(f10(A,B)) | -occurrence_of(C,f10(A,B)) | atocc(C,f15(f10(A,B),A)). [resolve(106,a,100,c)]. 8.37/8.68 107 atomic(A) | -occurrence_of(B,A) | subactivity(f15(A,f3(A,B)),A). [resolve(46,c,45,a)]. 8.37/8.68 108 min_precedes(f6(A,f1(A,B)),A,f1(A,B)) | subactivity(f15(f1(A,B),A),f1(A,B)) | -leaf_occ(A,B). [resolve(61,a,50,b)]. 8.37/8.68 Derived: min_precedes(f6(A,f1(A,B)),A,f1(A,B)) | -leaf_occ(A,B) | -atomic(f1(A,B)) | -occurrence_of(C,f1(A,B)) | atocc(C,f15(f1(A,B),A)). [resolve(108,b,100,c)]. 8.37/8.68 109 min_precedes(A,f7(A,f10(A,B)),f10(A,B)) | -root_occ(A,B) | min_precedes(f6(A,f10(A,B)),A,f10(A,B)) | subactivity(f15(f10(A,B),A),f10(A,B)). [resolve(62,a,61,a)]. 8.37/8.68 110 min_precedes(f3(A,B),f7(f3(A,B),A),A) | atomic(A) | -occurrence_of(B,A) | min_precedes(f6(f3(A,B),A),f3(A,B),A) | subactivity(f15(A,f3(A,B)),A). [resolve(64,a,61,a)]. 8.37/8.68 111 subactivity(f15(A,B),A) | -atocc(B,A) | -precedes(C,B). [resolve(80,c,74,b)]. 8.37/8.68 Derived: -atocc(A,B) | -precedes(C,A) | -atomic(B) | -occurrence_of(D,B) | atocc(D,f15(B,A)). [resolve(111,a,100,c)]. 8.37/8.68 112 subactivity(f15(A,B),A) | -atocc(B,A) | -root_occ(B,C). [resolve(80,c,77,b)]. 8.37/8.68 Derived: -atocc(A,B) | -root_occ(A,C) | -atomic(B) | -occurrence_of(D,B) | atocc(D,f15(B,A)). [resolve(112,a,100,c)]. 8.37/8.68 113 atomic(A) | -occurrence_of(B,A) | subactivity(f15(C,f3(A,B)),C) | -atocc(f3(A,B),C). [resolve(81,c,80,c)]. 8.37/8.68 Derived: atomic(A) | -occurrence_of(B,A) | -atocc(f3(A,B),C) | -atomic(C) | -occurrence_of(D,C) | atocc(D,f15(C,f3(A,B))). [resolve(113,c,100,c)]. 8.37/8.68 114 min_precedes(f6(A,f1(A,B)),A,f1(A,B)) | -leaf_occ(A,B) | subactivity(f15(C,A),C) | -atocc(A,C). [resolve(83,b,80,c)]. 8.37/8.68 Derived: min_precedes(f6(A,f1(A,B)),A,f1(A,B)) | -leaf_occ(A,B) | -atocc(A,C) | -atomic(C) | -occurrence_of(D,C) | atocc(D,f15(C,A)). [resolve(114,c,100,c)]. 8.37/8.68 115 subactivity(f2(A),f2(A)) | -occurrence_of(A,B). [resolve(99,b,96,b)]. 8.37/8.68 116 subactivity(f2(A),f2(A)) | -subactivity_occurrence(B,A). [resolve(99,b,97,b)]. 8.37/8.68 117 subactivity(f2(A),f2(A)) | -subactivity_occurrence(A,B). [resolve(99,b,98,b)]. 8.37/8.68 8.37/8.68 ============================== end predicate elimination ============= 8.37/8.68 8.37/8.68 Auto_denials: (non-Horn, no changes). 8.37/8.68 8.37/8.68 Term ordering decisions: 8.37/8.68 Function symbol KB weights: tptp0=1. tptp1=1. tptp3=1. tptp4=1. tptp2=1. c1=1. f1=1. f3=1. f4=1. f5=1. f6=1. f7=1. f10=1. f12=1. f15=1. f16=1. f2=1. f8=1. f9=1. f11=1. f13=1. f14=1. f17=1. 8.37/8.68 8.37/8.68 ============================== end of process initial clauses ======== 8.37/8.68 8.37/8.68 ============================== CLAUSES FOR SEARCH ==================== 8.37/8.68 8.37/8.68 ============================== end of clauses for search ============= 8.37/8.68 8.37/8.68 ============================== SEARCH ================================ 8.37/8.68 8.37/8.68 % Starting search at 0.04 seconds. 8.37/8.68 8.37/8.68 Low Water (keep): wt=61.000, iters=3400 8.37/8.68 8.37/8.68 Low Water (keep): wt=60.000, iters=3360 8.37/8.68 8.37/8.68 Low Water (keep): wt=58.000, iters=3846 8.37/8.68 8.37/8.68 Low Water (keep): wt=56.000, iters=3679 8.37/8.68 8.37/8.68 Low Water (keep): wt=52.000, iters=3402 8.37/8.68 8.37/8.68 Low Water (keep): wt=51.000, iters=3353 8.37/8.68 8.37/8.68 Low Water (keep): wt=49.000, iters=3367 8.37/8.68 8.37/8.68 Low Water (keep): wt=48.000, iters=5063 8.37/8.68 8.37/8.68 Low Water (keep): wt=40.000, iters=4231 8.37/8.68 8.37/8.68 Low Water (keep): wt=39.000, iters=4104 8.37/8.68 8.37/8.68 Low Water (keep): wt=37.000, iters=3838 8.37/8.68 8.37/8.68 Low Water (keep): wt=35.000, iters=3593 8.37/8.68 8.37/8.68 Low Water (keep): wt=34.000, iters=3396 8.37/8.68 8.37/8.68 Low Water (keep): wt=33.000, iters=3661 8.37/8.68 8.37/8.68 Low Water (keep): wt=32.000, iters=3379 8.37/8.68 8.37/8.68 Low Water (displace): id=9907, wt=160.000 8.37/8.68 8.37/8.68 Low Water (displace): id=9140, wt=158.000 8.37/8.68 8.37/8.68 Low Water (displace): id=9555, wt=130.000 8.37/8.68 8.37/8.68 Low Water (displace): id=6607, wt=125.000 8.37/8.68 8.37/8.68 Low Water (displace): id=19019, wt=34.000 8.37/8.68 8.37/8.68 Low Water (displace): id=19021, wt=33.000 8.37/8.68 8.37/8.68 Low Water (displace): id=19022, wt=32.000 8.37/8.68 8.37/8.68 Low Water (displace): id=19023, wt=31.000 8.37/8.68 8.37/8.68 Low Water (displace): id=19027, wt=29.000 8.37/8.68 8.37/8.68 Low Water (displace): id=19028, wt=28.000 8.37/8.68 8.37/8.68 Low Water (displace): id=19370, wt=26.000 8.37/8.68 8.37/8.68 Low Water (displace): id=19679, wt=23.000 106.74/107.32 106.74/107.32 Low Water (keep): wt=30.000, iters=3819 106.74/107.32 106.74/107.32 Low Water (keep): wt=29.000, iters=3461 106.74/107.32 106.74/107.32 ============================== PROOF ================================= 106.74/107.32 % SZS status Theorem 106.74/107.32 % SZS output start Refutation 106.74/107.32 106.74/107.32 % Proof 1 at 105.66 (+ 0.37) seconds. 106.74/107.32 % Length of proof is 89. 106.74/107.32 % Level of proof is 14. 106.74/107.32 % Maximum clause weight is 54.000. 106.74/107.32 % Given clauses 20066. 106.74/107.32 106.74/107.32 1 (all X35 all X36 (leaf_occ(X35,X36) <-> (exists X37 (occurrence_of(X36,X37) & leaf(X35,X37) & subactivity_occurrence(X35,X36))))) # label(sos_11) # label(axiom) # label(non_clause). [assumption]. 106.74/107.32 2 (all X52 (activity_occurrence(X52) -> (exists X53 (occurrence_of(X52,X53) & activity(X53))))) # label(sos_18) # label(axiom) # label(non_clause). [assumption]. 106.74/107.32 4 (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]. 106.74/107.32 7 (all X85 all X86 all X87 all X88 (arboreal(X88) & subactivity_occurrence(X88,X86) & subactivity_occurrence(X87,X86) & arboreal(X87) & occurrence_of(X86,X85) -> min_precedes(X88,X87,X85) | X87 = X88 | min_precedes(X87,X88,X85))) # label(sos_28) # label(axiom) # label(non_clause). [assumption]. 106.74/107.32 9 (all X91 all X92 (-atomic(X91) & occurrence_of(X92,X91) -> (exists X93 (root(X93,X91) & subactivity_occurrence(X93,X92))))) # label(sos_30) # label(axiom) # label(non_clause). [assumption]. 106.74/107.32 14 (all X42 all X43 (leaf(X42,X43) <-> -(exists X45 min_precedes(X42,X45,X43)) & ((exists X44 min_precedes(X44,X42,X43)) | root(X42,X43)))) # label(sos_14) # label(axiom) # label(non_clause). [assumption]. 106.74/107.32 16 (all X19 all X20 all X21 (next_subocc(X19,X20,X21) -> arboreal(X19) & arboreal(X20))) # label(sos_05) # label(axiom) # label(non_clause). [assumption]. 106.74/107.32 17 (all X95 (occurrence_of(X95,tptp0) -> (exists X96 exists X97 (root_occ(X96,X95) & occurrence_of(X97,tptp3) & next_subocc(X96,X97,tptp0) & leaf_occ(X97,X95) & occurrence_of(X96,tptp4))))) # label(sos_32) # label(axiom) # label(non_clause). [assumption]. 106.74/107.32 18 (all X7 all X8 all X9 all X10 (root_occ(X7,X9) & root_occ(X8,X9) & occurrence_of(X9,X10) -> X8 = X7)) # label(sos_02) # label(axiom) # label(non_clause). [assumption]. 106.74/107.32 19 (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]. 106.74/107.32 21 (all X15 all X16 all X17 (-(exists X18 (min_precedes(X15,X18,X17) & min_precedes(X18,X16,X17))) & min_precedes(X15,X16,X17) <-> next_subocc(X15,X16,X17))) # label(sos_04) # label(axiom) # label(non_clause). [assumption]. 106.74/107.32 24 (all X89 all X90 (occurrence_of(X90,X89) -> activity(X89) & activity_occurrence(X90))) # label(sos_29) # label(axiom) # label(non_clause). [assumption]. 106.74/107.32 32 (all X98 all X99 (root_occ(X98,X99) & occurrence_of(X99,tptp0) -> (exists X100 (occurrence_of(X100,tptp1) & next_subocc(X98,X100,tptp0))))) # label(sos_45) # label(axiom) # label(non_clause). [assumption]. 106.74/107.32 34 (all X70 all X71 all X72 (min_precedes(X71,X72,X70) -> (exists X73 (occurrence_of(X73,X70) & subactivity_occurrence(X71,X73) & subactivity_occurrence(X72,X73))))) # label(sos_24) # label(axiom) # label(non_clause). [assumption]. 106.74/107.32 35 --(exists X101 occurrence_of(X101,tptp0)) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption]. 106.74/107.32 46 atomic(A) | -occurrence_of(B,A) | root(f3(A,B),A) # label(sos_30) # label(axiom). [clausify(9)]. 106.74/107.32 49 -subactivity_occurrence(A,B) | -root(A,C) | -occurrence_of(B,C) | root_occ(A,B) # label(sos_10) # label(axiom). [clausify(19)]. 106.74/107.32 50 -leaf_occ(A,B) | leaf(A,f1(A,B)) # label(sos_11) # label(axiom). [clausify(1)]. 106.74/107.32 51 -leaf(A,B) | -min_precedes(A,C,B) # label(sos_14) # label(axiom). [clausify(14)]. 106.74/107.32 66 -occurrence_of(A,tptp0) | next_subocc(f8(A),f9(A),tptp0) # label(sos_32) # label(axiom). [clausify(17)]. 106.74/107.32 67 -min_precedes(A,B,C) | -min_precedes(B,D,C) | -next_subocc(A,D,C) # label(sos_04) # label(axiom). [clausify(21)]. 106.74/107.32 69 -next_subocc(A,B,C) | arboreal(B) # label(sos_05) # label(axiom). [clausify(16)]. 106.74/107.32 70 min_precedes(A,B,C) | -next_subocc(A,B,C) # label(sos_04) # label(axiom). [clausify(21)]. 106.74/107.32 71 -root_occ(A,B) | -occurrence_of(B,tptp0) | next_subocc(A,f16(A,B),tptp0) # label(sos_45) # label(axiom). [clausify(32)]. 106.74/107.32 95 -activity_occurrence(A) | occurrence_of(A,f2(A)) # label(sos_18) # label(axiom). [clausify(2)]. 106.74/107.32 96 -occurrence_of(A,B) | activity_occurrence(A) # label(sos_29) # label(axiom). [clausify(24)]. 106.74/107.32 122 occurrence_of(c1,tptp0) # label(goals) # label(negated_conjecture). [clausify(35)]. 106.74/107.32 123 -atomic(tptp0) # label(sos_34) # label(axiom). [assumption]. 106.74/107.32 126 tptp1 != tptp3 # label(sos_42) # label(axiom). [assumption]. 106.74/107.32 127 tptp3 != tptp1. [copy(126),flip(a)]. 106.74/107.32 136 -leaf_occ(A,B) | subactivity_occurrence(A,B) # label(sos_11) # label(axiom). [clausify(1)]. 106.74/107.32 139 -occurrence_of(A,tptp0) | root_occ(f8(A),A) # label(sos_32) # label(axiom). [clausify(17)]. 106.74/107.32 140 -occurrence_of(A,tptp0) | occurrence_of(f9(A),tptp3) # label(sos_32) # label(axiom). [clausify(17)]. 106.74/107.32 141 -occurrence_of(A,tptp0) | leaf_occ(f9(A),A) # label(sos_32) # label(axiom). [clausify(17)]. 106.74/107.32 147 -leaf_occ(A,B) | occurrence_of(B,f1(A,B)) # label(sos_11) # label(axiom). [clausify(1)]. 106.74/107.32 150 -occurrence_of(A,B) | -occurrence_of(A,C) | C = B # label(sos_22) # label(axiom). [clausify(4)]. 106.74/107.32 152 atomic(A) | -occurrence_of(B,A) | subactivity_occurrence(f3(A,B),B) # label(sos_30) # label(axiom). [clausify(9)]. 106.74/107.32 155 -min_precedes(A,B,C) | occurrence_of(f17(C,A,B),C) # label(sos_24) # label(axiom). [clausify(34)]. 106.74/107.32 156 -min_precedes(A,B,C) | subactivity_occurrence(A,f17(C,A,B)) # label(sos_24) # label(axiom). [clausify(34)]. 106.74/107.32 157 -min_precedes(A,B,C) | subactivity_occurrence(B,f17(C,A,B)) # label(sos_24) # label(axiom). [clausify(34)]. 106.74/107.32 158 -root_occ(A,B) | -occurrence_of(B,tptp0) | occurrence_of(f16(A,B),tptp1) # label(sos_45) # label(axiom). [clausify(32)]. 106.74/107.32 159 -root_occ(A,B) | -root_occ(C,B) | -occurrence_of(B,D) | C = A # label(sos_02) # label(axiom). [clausify(18)]. 106.74/107.32 162 -arboreal(A) | -subactivity_occurrence(A,B) | -subactivity_occurrence(C,B) | -arboreal(C) | -occurrence_of(B,D) | min_precedes(A,C,D) | A = C | min_precedes(C,A,D) # label(sos_28) # label(axiom). [clausify(7)]. 106.74/107.32 168 -subactivity_occurrence(f3(A,B),C) | -occurrence_of(C,A) | root_occ(f3(A,B),C) | atomic(A) | -occurrence_of(B,A). [resolve(49,b,46,c)]. 106.74/107.32 169 -leaf_occ(A,B) | -min_precedes(A,C,f1(A,B)). [resolve(50,b,51,a)]. 106.74/107.32 201 -occurrence_of(A,tptp0) | -min_precedes(f8(A),B,tptp0) | -min_precedes(B,f9(A),tptp0). [resolve(66,b,67,c)]. 106.74/107.32 203 -occurrence_of(A,tptp0) | arboreal(f9(A)). [resolve(66,b,69,a)]. 106.74/107.32 207 -root_occ(A,B) | -occurrence_of(B,tptp0) | arboreal(f16(A,B)). [resolve(71,c,69,a)]. 106.74/107.32 208 -root_occ(A,B) | -occurrence_of(B,tptp0) | min_precedes(A,f16(A,B),tptp0). [resolve(71,c,70,b)]. 106.74/107.32 259 occurrence_of(A,f2(A)) | -occurrence_of(A,B). [resolve(95,a,96,b)]. 106.74/107.32 273 -subactivity_occurrence(f3(A,B),B) | -occurrence_of(B,A) | root_occ(f3(A,B),B) | atomic(A). [factor(168,b,e)]. 106.74/107.32 284 root_occ(f8(c1),c1). [resolve(139,a,122,a)]. 106.74/107.32 290 subactivity_occurrence(f3(tptp0,c1),c1). [resolve(152,b,122,a),unit_del(a,123)]. 106.74/107.32 308 min_precedes(f8(c1),f16(f8(c1),c1),tptp0). [resolve(284,a,208,a),unit_del(a,122)]. 106.74/107.32 309 arboreal(f16(f8(c1),c1)). [resolve(284,a,207,a),unit_del(a,122)]. 106.74/107.32 315 -root_occ(A,c1) | -occurrence_of(c1,B) | f8(c1) = A. [resolve(284,a,159,b)]. 106.74/107.32 316 occurrence_of(f16(f8(c1),c1),tptp1). [resolve(284,a,158,a),unit_del(a,122)]. 106.74/107.32 377 root_occ(f3(tptp0,c1),c1). [resolve(290,a,273,a),unit_del(a,122),unit_del(c,123)]. 106.74/107.32 492 occurrence_of(f16(f8(c1),c1),f2(f16(f8(c1),c1))). [resolve(316,a,259,b)]. 106.74/107.32 493 -occurrence_of(f16(f8(c1),c1),A) | tptp1 = A. [resolve(316,a,150,b)]. 106.74/107.32 739 subactivity_occurrence(f16(f8(c1),c1),f17(tptp0,f8(c1),f16(f8(c1),c1))). [resolve(308,a,157,a)]. 106.74/107.32 740 subactivity_occurrence(f8(c1),f17(tptp0,f8(c1),f16(f8(c1),c1))). [resolve(308,a,156,a)]. 106.74/107.32 741 occurrence_of(f17(tptp0,f8(c1),f16(f8(c1),c1)),tptp0). [resolve(308,a,155,a)]. 106.74/107.32 755 -occurrence_of(c1,A) | f3(tptp0,c1) = f8(c1). [resolve(315,a,377,a),flip(b)]. 106.74/107.32 911 f3(tptp0,c1) = f8(c1). [resolve(755,a,122,a)]. 106.74/107.32 1016 -subactivity_occurrence(f8(c1),A) | -occurrence_of(A,tptp0) | root_occ(f8(c1),A). [para(911(a,1),168(a,1)),rewrite([911(8)]),unit_del(d,123),unit_del(e,122)]. 106.74/107.33 1038 f2(f16(f8(c1),c1)) = tptp1. [resolve(492,a,493,a),flip(a)]. 106.74/107.33 1126 arboreal(f9(f17(tptp0,f8(c1),f16(f8(c1),c1)))). [resolve(741,a,203,a)]. 106.74/107.33 1134 -occurrence_of(f17(tptp0,f8(c1),f16(f8(c1),c1)),A) | tptp0 = A. [resolve(741,a,150,b)]. 106.74/107.33 1137 leaf_occ(f9(f17(tptp0,f8(c1),f16(f8(c1),c1))),f17(tptp0,f8(c1),f16(f8(c1),c1))). [resolve(741,a,141,a)]. 106.74/107.33 1138 occurrence_of(f9(f17(tptp0,f8(c1),f16(f8(c1),c1))),tptp3). [resolve(741,a,140,a)]. 106.74/107.33 1139 root_occ(f8(f17(tptp0,f8(c1),f16(f8(c1),c1))),f17(tptp0,f8(c1),f16(f8(c1),c1))). [resolve(741,a,139,a)]. 106.74/107.33 1323 root_occ(f8(c1),f17(tptp0,f8(c1),f16(f8(c1),c1))). [resolve(1016,a,740,a),unit_del(a,741)]. 106.74/107.33 1505 occurrence_of(f9(f17(tptp0,f8(c1),f16(f8(c1),c1))),f2(f9(f17(tptp0,f8(c1),f16(f8(c1),c1))))). [resolve(1138,a,259,b)]. 106.74/107.33 1506 -occurrence_of(f9(f17(tptp0,f8(c1),f16(f8(c1),c1))),A) | tptp3 = A. [resolve(1138,a,150,b)]. 106.74/107.33 1683 -root_occ(A,f17(tptp0,f8(c1),f16(f8(c1),c1))) | -occurrence_of(f17(tptp0,f8(c1),f16(f8(c1),c1)),B) | f8(c1) = A. [resolve(1323,a,159,b)]. 106.74/107.33 2162 -arboreal(A) | -subactivity_occurrence(A,f17(tptp0,f8(c1),f16(f8(c1),c1))) | -occurrence_of(f17(tptp0,f8(c1),f16(f8(c1),c1)),B) | min_precedes(A,f16(f8(c1),c1),B) | f16(f8(c1),c1) = A | min_precedes(f16(f8(c1),c1),A,B). [resolve(739,a,162,c),flip(f),unit_del(c,309)]. 106.74/107.33 4593 occurrence_of(f17(tptp0,f8(c1),f16(f8(c1),c1)),f1(f9(f17(tptp0,f8(c1),f16(f8(c1),c1))),f17(tptp0,f8(c1),f16(f8(c1),c1)))). [resolve(1137,a,147,a)]. 106.74/107.33 4594 subactivity_occurrence(f9(f17(tptp0,f8(c1),f16(f8(c1),c1))),f17(tptp0,f8(c1),f16(f8(c1),c1))). [resolve(1137,a,136,a)]. 106.74/107.33 7895 f2(f9(f17(tptp0,f8(c1),f16(f8(c1),c1)))) = tptp3. [resolve(1505,a,1506,a),flip(a)]. 106.74/107.33 8331 -occurrence_of(f17(tptp0,f8(c1),f16(f8(c1),c1)),A) | f8(f17(tptp0,f8(c1),f16(f8(c1),c1))) = f8(c1). [resolve(1683,a,1139,a),flip(b)]. 106.74/107.33 12827 -occurrence_of(f17(tptp0,f8(c1),f16(f8(c1),c1)),A) | min_precedes(f9(f17(tptp0,f8(c1),f16(f8(c1),c1))),f16(f8(c1),c1),A) | f9(f17(tptp0,f8(c1),f16(f8(c1),c1))) = f16(f8(c1),c1) | min_precedes(f16(f8(c1),c1),f9(f17(tptp0,f8(c1),f16(f8(c1),c1))),A). [resolve(2162,b,4594,a),flip(d),unit_del(a,1126)]. 106.74/107.33 15508 f8(f17(tptp0,f8(c1),f16(f8(c1),c1))) = f8(c1). [resolve(8331,a,741,a)]. 106.74/107.33 15538 -min_precedes(f8(c1),A,tptp0) | -min_precedes(A,f9(f17(tptp0,f8(c1),f16(f8(c1),c1))),tptp0). [para(15508(a,1),201(b,1)),unit_del(a,741)]. 106.74/107.33 22724 f1(f9(f17(tptp0,f8(c1),f16(f8(c1),c1))),f17(tptp0,f8(c1),f16(f8(c1),c1))) = tptp0. [resolve(4593,a,1134,a),flip(a)]. 106.74/107.33 22991 -min_precedes(f9(f17(tptp0,f8(c1),f16(f8(c1),c1))),A,tptp0). [para(22724(a,1),169(b,3)),unit_del(a,1137)]. 106.74/107.33 34521 f9(f17(tptp0,f8(c1),f16(f8(c1),c1))) = f16(f8(c1),c1) | min_precedes(f16(f8(c1),c1),f9(f17(tptp0,f8(c1),f16(f8(c1),c1))),tptp0). [resolve(12827,a,741,a),unit_del(a,22991)]. 106.74/107.33 34522 f9(f17(tptp0,f8(c1),f16(f8(c1),c1))) = f16(f8(c1),c1). [resolve(34521,b,15538,b),unit_del(b,308)]. 106.74/107.33 35204 $F. [back_rewrite(7895),rewrite([34522(9),1038(5)]),flip(a),unit_del(a,127)]. 106.74/107.33 106.74/107.33 % SZS output end Refutation 106.74/107.33 ============================== end of proof ========================== 106.74/107.33 106.74/107.33 ============================== STATISTICS ============================ 106.74/107.33 106.74/107.33 Given=20066. Generated=233485. Kept=35079. proofs=1. 106.74/107.33 Usable=15897. Sos=7113. Demods=645. Limbo=682, Disabled=11621. Hints=0. 106.74/107.33 Megabytes=56.75. 106.74/107.33 User_CPU=105.66, System_CPU=0.37, Wall_clock=106. 106.74/107.33 106.74/107.33 ============================== end of statistics ===================== 106.74/107.33 106.74/107.33 ============================== end of search ========================= 106.74/107.33 106.74/107.33 THEOREM PROVED 106.74/107.33 % SZS status Theorem 106.74/107.33 106.74/107.33 Exiting with 1 proof. 106.74/107.33 106.74/107.33 Process 28975 exit (max_proofs) Tue Jul 13 16:56:14 2021 106.74/107.33 Prover9 interrupted 106.74/107.33 EOF