TSTP Solution File: PRO002+3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PRO002+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n020.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Mon Jul 18 17:52:03 EDT 2022
% Result : Theorem 8.77s 9.04s
% Output : Refutation 8.77s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : PRO002+3 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n020.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 13 02:31:35 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.42/1.06 ============================== Prover9 ===============================
% 0.42/1.06 Prover9 (32) version 2009-11A, November 2009.
% 0.42/1.06 Process 1335 was started by sandbox on n020.cluster.edu,
% 0.42/1.06 Mon Jun 13 02:31:36 2022
% 0.42/1.06 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_1103_n020.cluster.edu".
% 0.42/1.06 ============================== end of head ===========================
% 0.42/1.06
% 0.42/1.06 ============================== INPUT =================================
% 0.42/1.06
% 0.42/1.06 % Reading from file /tmp/Prover9_1103_n020.cluster.edu
% 0.42/1.06
% 0.42/1.06 set(prolog_style_variables).
% 0.42/1.06 set(auto2).
% 0.42/1.06 % set(auto2) -> set(auto).
% 0.42/1.06 % set(auto) -> set(auto_inference).
% 0.42/1.06 % set(auto) -> set(auto_setup).
% 0.42/1.06 % set(auto_setup) -> set(predicate_elim).
% 0.42/1.06 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/1.06 % set(auto) -> set(auto_limits).
% 0.42/1.06 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/1.06 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/1.06 % set(auto) -> set(auto_denials).
% 0.42/1.06 % set(auto) -> set(auto_process).
% 0.42/1.06 % set(auto2) -> assign(new_constants, 1).
% 0.42/1.06 % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/1.06 % set(auto2) -> assign(max_weight, "200.000").
% 0.42/1.06 % set(auto2) -> assign(max_hours, 1).
% 0.42/1.06 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/1.06 % set(auto2) -> assign(max_seconds, 0).
% 0.42/1.06 % set(auto2) -> assign(max_minutes, 5).
% 0.42/1.06 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/1.06 % set(auto2) -> set(sort_initial_sos).
% 0.42/1.06 % set(auto2) -> assign(sos_limit, -1).
% 0.42/1.06 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/1.06 % set(auto2) -> assign(max_megs, 400).
% 0.42/1.06 % set(auto2) -> assign(stats, some).
% 0.42/1.06 % set(auto2) -> clear(echo_input).
% 0.42/1.06 % set(auto2) -> set(quiet).
% 0.42/1.06 % set(auto2) -> clear(print_initial_clauses).
% 0.42/1.06 % set(auto2) -> clear(print_given).
% 0.42/1.06 assign(lrs_ticks,-1).
% 0.42/1.06 assign(sos_limit,10000).
% 0.42/1.06 assign(order,kbo).
% 0.42/1.06 set(lex_order_vars).
% 0.42/1.06 clear(print_given).
% 0.42/1.06
% 0.42/1.06 % formulas(sos). % not echoed (69 formulas)
% 0.42/1.06
% 0.42/1.06 ============================== end of input ==========================
% 0.42/1.06
% 0.42/1.06 % From the command line: assign(max_seconds, 300).
% 0.42/1.06
% 0.42/1.06 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/1.06
% 0.42/1.06 % Formulas that are not ordinary clauses:
% 0.42/1.06 1 (all X0 all X1 (occurrence_of(X1,X0) -> activity(X0) & activity_occurrence(X1))) # label(sos) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 2 (all X2 (activity_occurrence(X2) -> (exists X3 (activity(X3) & occurrence_of(X2,X3))))) # label(sos_01) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 3 (all X4 all X5 all X6 (occurrence_of(X4,X5) & occurrence_of(X4,X6) -> X5 = X6)) # label(sos_02) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 4 (all X7 (activity(X7) -> subactivity(X7,X7))) # label(sos_03) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 5 (all X8 all X9 (earlier(X8,X9) -> -earlier(X9,X8))) # label(sos_04) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 6 (all X10 all X11 all X12 (earlier(X10,X11) & earlier(X11,X12) -> earlier(X10,X12))) # label(sos_05) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 7 (all X13 all X14 all X15 (earlier(X13,X14) & earlier(X15,X14) -> earlier(X15,X13) | earlier(X13,X15) | X13 = X15)) # label(sos_06) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 8 (all X16 all X17 (occurrence_of(X16,X17) -> (arboreal(X16) <-> atomic(X17)))) # label(sos_07) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 9 (all X18 (legal(X18) -> arboreal(X18))) # label(sos_08) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 10 (all X19 all X20 (legal(X19) & earlier(X20,X19) -> legal(X20))) # label(sos_09) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 11 (all X21 all X22 (precedes(X21,X22) <-> earlier(X21,X22) & legal(X22))) # label(sos_10) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 12 (all X23 all X24 all X25 (min_precedes(X24,X25,X23) -> (exists X26 exists X27 (subactivity(X26,X23) & subactivity(X27,X23) & atocc(X24,X26) & atocc(X25,X27))))) # label(sos_11) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 13 (all X28 all X29 (root(X29,X28) -> (exists X30 (subactivity(X30,X28) & atocc(X29,X30))))) # label(sos_12) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 14 (all X31 all X32 all X33 (min_precedes(X31,X32,X33) -> (exists X34 (root(X34,X33) & min_precedes(X34,X32,X33))))) # label(sos_13) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 15 (all X35 all X36 all X37 (min_precedes(X35,X36,X37) -> -root(X36,X37))) # label(sos_14) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 16 (all X38 all X39 all X40 (min_precedes(X38,X39,X40) -> precedes(X38,X39))) # label(sos_15) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 17 (all X41 all X42 (root(X41,X42) -> legal(X41))) # label(sos_16) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 18 (all X43 all X44 (atocc(X43,X44) & legal(X43) -> root(X43,X44))) # label(sos_17) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 19 (all X45 all X46 all X47 all X48 (min_precedes(X45,X46,X48) & min_precedes(X45,X47,X48) & precedes(X46,X47) -> min_precedes(X46,X47,X48))) # label(sos_18) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 20 (all X49 all X50 all X51 (min_precedes(X49,X50,X51) -> -atomic(X51))) # label(sos_19) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 21 (all X52 all X53 all X54 all X55 (min_precedes(X53,X52,X55) & min_precedes(X54,X52,X55) & precedes(X53,X54) -> min_precedes(X53,X54,X55))) # label(sos_20) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 22 (all X56 all X57 (leaf(X56,X57) <-> (root(X56,X57) | (exists X58 min_precedes(X58,X56,X57))) & -(exists X59 min_precedes(X56,X59,X57)))) # label(sos_21) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 23 (all X60 all X61 all X62 (next_subocc(X60,X61,X62) <-> min_precedes(X60,X61,X62) & -(exists X63 (min_precedes(X60,X63,X62) & min_precedes(X63,X61,X62))))) # label(sos_22) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 24 (all X64 all X65 (atocc(X64,X65) <-> (exists X66 (subactivity(X65,X66) & atomic(X66) & occurrence_of(X64,X66))))) # label(sos_23) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 25 (all X67 all X68 (subactivity_occurrence(X67,X68) -> activity_occurrence(X67) & activity_occurrence(X68))) # label(sos_24) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 26 (all X69 all X70 all X71 (min_precedes(X70,X71,X69) -> (exists X72 (occurrence_of(X72,X69) & subactivity_occurrence(X70,X72) & subactivity_occurrence(X71,X72))))) # label(sos_25) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 27 (all X73 all X74 (root(X74,X73) & -atomic(X73) -> (exists X75 (occurrence_of(X75,X73) & subactivity_occurrence(X74,X75))))) # label(sos_26) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 28 (all X76 all X77 (occurrence_of(X77,X76) & -atomic(X76) -> (exists X78 (root(X78,X76) & subactivity_occurrence(X78,X77))))) # label(sos_27) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 29 (all X79 all X80 all X81 all X82 (occurrence_of(X80,X79) & arboreal(X81) & arboreal(X82) & subactivity_occurrence(X81,X80) & subactivity_occurrence(X82,X80) -> min_precedes(X81,X82,X79) | min_precedes(X82,X81,X79) | X81 = X82)) # label(sos_28) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 30 (all X83 all X84 all X85 all X86 (min_precedes(X83,X84,X85) & occurrence_of(X86,X85) & subactivity_occurrence(X84,X86) -> subactivity_occurrence(X83,X86))) # label(sos_29) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 31 (all X87 all X88 all X89 all X90 (occurrence_of(X89,X87) & occurrence_of(X90,X88) & -atomic(X87) & subactivity_occurrence(X89,X90) -> subactivity(X87,X88))) # label(sos_30) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 32 (all X91 all X92 all X93 (subactivity_occurrence(X91,X92) & subactivity_occurrence(X92,X93) -> subactivity_occurrence(X91,X93))) # label(sos_31) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 33 (all X94 all X95 all X96 all X97 (occurrence_of(X96,X94) & occurrence_of(X97,X95) & subactivity(X94,X95) & -subactivity_occurrence(X96,X97) -> (exists X98 (subactivity_occurrence(X98,X97) & -subactivity_occurrence(X98,X96))))) # label(sos_32) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 34 (all X99 all X100 (root_occ(X99,X100) <-> (exists X101 (occurrence_of(X100,X101) & subactivity_occurrence(X99,X100) & root(X99,X101))))) # label(sos_33) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 35 (all X102 all X103 (leaf_occ(X102,X103) <-> (exists X104 (occurrence_of(X103,X104) & subactivity_occurrence(X102,X103) & leaf(X102,X104))))) # label(sos_34) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 36 (all X105 all X106 all X107 all X108 (occurrence_of(X107,X108) & root_occ(X105,X107) & root_occ(X106,X107) -> X105 = X106)) # label(sos_35) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 37 (all X109 all X110 all X111 all X112 (occurrence_of(X111,X112) & -atomic(X112) & leaf_occ(X109,X111) & leaf_occ(X110,X111) -> X109 = X110)) # label(sos_36) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 38 (all X113 all X114 all X115 (occurrence_of(X113,X115) & leaf_occ(X114,X113) -> -(exists X116 min_precedes(X114,X116,X115)))) # label(sos_37) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 39 (all X117 all X118 all X119 (occurrence_of(X117,X119) & root_occ(X118,X117) -> -(exists X120 min_precedes(X120,X118,X119)))) # label(sos_38) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 40 (all X121 all X122 all X123 all X124 all X125 (next_subocc(X121,X122,X124) & next_subocc(X121,X123,X124) & occurrence_of(X125,X124) & subactivity_occurrence(X123,X125) & subactivity_occurrence(X122,X125) -> X122 = X123)) # label(sos_39) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 41 (all X126 all X127 all X128 all X129 (next_subocc(X127,X126,X129) & next_subocc(X128,X126,X129) -> X127 = X128)) # label(sos_40) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 42 (all X130 all X131 all X132 all X133 (occurrence_of(X130,X133) & leaf_occ(X131,X130) & root_occ(X132,X130) & X131 != X132 -> min_precedes(X132,X131,X133))) # label(sos_41) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 43 (all X134 all X135 all X136 all X137 (occurrence_of(X135,X134) & subactivity_occurrence(X136,X135) & root_occ(X137,X135) & arboreal(X136) & -min_precedes(X137,X136,X134) -> X137 = X136)) # label(sos_42) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 44 (all X138 all X139 all X140 all X141 (occurrence_of(X139,X138) & subactivity_occurrence(X140,X139) & leaf_occ(X141,X139) & arboreal(X140) & -min_precedes(X140,X141,X138) -> X141 = X140)) # label(sos_43) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 45 (all X142 all X143 all X144 (next_subocc(X142,X143,X144) -> arboreal(X142) & arboreal(X143))) # label(sos_44) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 46 (all X145 all X146 (leaf(X145,X146) & -atomic(X146) -> (exists X147 (occurrence_of(X147,X146) & leaf_occ(X145,X147))))) # label(sos_45) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 47 (all X148 all X149 all X150 (min_precedes(X148,X149,X150) -> arboreal(X148))) # label(sos_46) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 48 (all X151 all X152 all X153 all X154 all X155 (occurrence_of(X152,X151) & root_occ(X154,X152) & leaf_occ(X155,X152) & subactivity_occurrence(X153,X152) & min_precedes(X153,X155,X151) & X153 != X154 -> min_precedes(X154,X153,X151))) # label(sos_47) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 49 (all X156 all X157 all X158 all X159 all X160 (occurrence_of(X157,X156) & root_occ(X159,X157) & leaf_occ(X160,X157) & subactivity_occurrence(X158,X157) & min_precedes(X159,X158,X156) & X158 != X160 -> min_precedes(X158,X160,X156))) # label(sos_48) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 50 (all X161 (occurrence_of(X161,tptp0) -> (exists X162 exists X163 (occurrence_of(X162,tptp4) & root_occ(X162,X161) & (occurrence_of(X163,tptp3) | occurrence_of(X163,tptp2)) & leaf_occ(X163,X161) & next_subocc(X162,X163,tptp0))))) # label(sos_49) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 51 (all X164 all X165 all X166 all X167 all X168 (send_message(X164,X165,X166,X167,X168) -> activity(X164) & atomic(X164) & root(X165,X166) & root(X167,X168))) # label(sos_62) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 52 (all X169 all X170 all X171 all X172 all X173 (send_message(X169,X170,X171,X172,X173) -> X169 != tptp4 & X169 != tptp3 & X169 != tptp2)) # label(sos_63) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.07 53 (all X174 all X175 all X176 all X177 all X178 all X179 (send_message(X174,X175,X176,X177,X178) & occurrence_of(X179,X174) -> min_precedes(X177,X179,X178))) # label(sos_64) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.07 54 (all X180 all X181 all X182 (tptp1(X180,X181,X182) -> activity(X180) & -atomic(X180) & -atomic(X181) & root(X182,X181))) # label(sos_65) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.07 55 (all X183 all X184 all X185 all X186 (tptp1(X183,X184,X185) & occurrence_of(X186,X183) -> (exists X187 exists X188 exists X189 exists X190 (send_message(X187,X188,X189,X185,X184) & occurrence_of(X190,X187) & root_occ(X190,X186))))) # label(sos_66) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.07 56 (all X191 all X192 -tptp1(tptp0,X191,X192)) # label(sos_67) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.07 57 --(exists X193 exists X194 exists X195 (tptp1(X193,tptp0,X194) & occurrence_of(X195,X193))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.42/1.07
% 0.42/1.07 ============================== end of process non-clausal formulas ===
% 0.42/1.07
% 0.42/1.07 ============================== PROCESS INITIAL CLAUSES ===============
% 0.42/1.07
% 0.42/1.07 ============================== PREDICATE ELIMINATION =================
% 0.42/1.07 58 -activity(A) | subactivity(A,A) # label(sos_03) # label(axiom). [clausify(4)].
% 0.42/1.07 59 -occurrence_of(A,B) | activity(B) # label(sos) # label(axiom). [clausify(1)].
% 0.42/1.07 60 -activity_occurrence(A) | activity(f1(A)) # label(sos_01) # label(axiom). [clausify(2)].
% 0.42/1.07 Derived: subactivity(A,A) | -occurrence_of(B,A). [resolve(58,a,59,b)].
% 0.42/1.07 Derived: subactivity(f1(A),f1(A)) | -activity_occurrence(A). [resolve(58,a,60,b)].
% 0.42/1.07 61 activity(tptp0) # label(sos_50) # label(axiom). [assumption].
% 0.42/1.07 Derived: subactivity(tptp0,tptp0). [resolve(61,a,58,a)].
% 0.42/1.07 62 -send_message(A,B,C,D,E) | activity(A) # label(sos_62) # label(axiom). [clausify(51)].
% 0.42/1.07 Derived: -send_message(A,B,C,D,E) | subactivity(A,A). [resolve(62,b,58,a)].
% 0.42/1.07 63 -tptp1(A,B,C) | activity(A) # label(sos_65) # label(axiom). [clausify(54)].
% 0.42/1.07 Derived: -tptp1(A,B,C) | subactivity(A,A). [resolve(63,b,58,a)].
% 0.42/1.07 64 -activity_occurrence(A) | occurrence_of(A,f1(A)) # label(sos_01) # label(axiom). [clausify(2)].
% 0.42/1.07 65 -occurrence_of(A,B) | activity_occurrence(A) # label(sos) # label(axiom). [clausify(1)].
% 0.42/1.07 Derived: occurrence_of(A,f1(A)) | -occurrence_of(A,B). [resolve(64,a,65,b)].
% 0.42/1.07 66 -subactivity_occurrence(A,B) | activity_occurrence(A) # label(sos_24) # label(axiom). [clausify(25)].
% 0.42/1.07 Derived: -subactivity_occurrence(A,B) | occurrence_of(A,f1(A)). [resolve(66,b,64,a)].
% 0.42/1.07 67 -subactivity_occurrence(A,B) | activity_occurrence(B) # label(sos_24) # label(axiom). [clausify(25)].
% 0.42/1.07 Derived: -subactivity_occurrence(A,B) | occurrence_of(B,f1(B)). [resolve(67,b,64,a)].
% 0.42/1.07 68 subactivity(f1(A),f1(A)) | -activity_occurrence(A). [resolve(58,a,60,b)].
% 0.42/1.07 Derived: subactivity(f1(A),f1(A)) | -occurrence_of(A,B). [resolve(68,b,65,b)].
% 0.42/1.07 Derived: subactivity(f1(A),f1(A)) | -subactivity_occurrence(A,B). [resolve(68,b,66,b)].
% 0.42/1.07 Derived: subactivity(f1(A),f1(A)) | -subactivity_occurrence(B,A). [resolve(68,b,67,b)].
% 0.42/1.07 69 precedes(A,B) | -earlier(A,B) | -legal(B) # label(sos_10) # label(axiom). [clausify(11)].
% 0.42/1.07 70 -precedes(A,B) | earlier(A,B) # label(sos_10) # label(axiom). [clausify(11)].
% 0.42/1.07 71 -precedes(A,B) | legal(B) # label(sos_10) # label(axiom). [clausify(11)].
% 0.42/1.07 72 -min_precedes(A,B,C) | precedes(A,B) # label(sos_15) # label(axiom). [clausify(16)].
% 0.42/1.07 Derived: -min_precedes(A,B,C) | earlier(A,B). [resolve(72,b,70,a)].
% 0.42/1.07 Derived: -min_precedes(A,B,C) | legal(B). [resolve(72,b,71,a)].
% 0.42/1.07 73 -min_precedes(A,B,C) | -min_precedes(A,D,C) | -precedes(B,D) | min_precedes(B,D,C) # label(sos_18) # label(axiom). [clausify(19)].
% 0.42/1.07 Derived: -min_precedes(A,B,C) | -min_precedes(A,D,C) | min_precedes(B,D,C) | -earlier(B,D) | -legal(D). [resolve(73,c,69,a)].
% 0.42/1.07 Derived: -min_precedes(A,B,C) | -min_precedes(A,D,C) | min_precedes(B,D,C) | -min_precedes(B,D,E). [resolve(73,c,72,b)].
% 0.42/1.07 74 -min_precedes(A,B,C) | -min_precedes(D,B,C) | -precedes(A,D) | min_precedes(A,D,C) # label(sos_20) # label(axiom). [clausify(21)].
% 0.42/1.07 Derived: -min_precedes(A,B,C) | -min_precedes(D,B,C) | min_precedes(A,D,C) | -earlier(A,D) | -legal(D). [resolve(74,c,69,a)].
% 0.42/1.07 Derived: -min_precedes(A,B,C) | -min_precedes(D,B,C) | min_precedes(A,D,C) | -min_precedes(A,D,E). [resolve(74,c,72,b)].
% 0.42/1.07 75 atocc(A,B) | -subactivity(B,C) | -atomic(C) | -occurrence_of(A,C) # label(sos_23) # label(axiom). [clausify(24)].
% 0.42/1.07 76 -min_precedes(A,B,C) | subactivity(f2(C,A,B),C) # label(sos_11) # label(axiom). [clausify(12)].
% 0.42/1.07 77 -min_precedes(A,B,C) | subactivity(f3(C,A,B),C) # label(sos_11) # label(axiom). [clausify(12)].
% 0.42/1.07 78 -root(A,B) | subactivity(f4(B,A),B) # label(sos_12) # label(axiom). [clausify(13)].
% 0.42/1.07 79 -atocc(A,B) | subactivity(B,f9(A,B)) # label(sos_23) # label(axiom). [clausify(24)].
% 0.42/1.07 Derived: atocc(A,f2(B,C,D)) | -atomic(B) | -occurrence_of(A,B) | -min_precedes(C,D,B). [resolve(75,b,76,b)].
% 0.42/1.07 Derived: atocc(A,f3(B,C,D)) | -atomic(B) | -occurrence_of(A,B) | -min_precedes(C,D,B). [resolve(75,b,77,b)].
% 0.42/1.07 Derived: atocc(A,f4(B,C)) | -atomic(B) | -occurrence_of(A,B) | -root(C,B). [resolve(75,b,78,b)].
% 0.42/1.07 Derived: atocc(A,B) | -atomic(f9(C,B)) | -occurrence_of(A,f9(C,B)) | -atocc(C,B). [resolve(75,b,79,b)].
% 0.42/1.07 80 -occurrence_of(A,B) | -occurrence_of(C,D) | atomic(B) | -subactivity_occurrence(A,C) | subactivity(B,D) # label(sos_30) # label(axiom). [clausify(31)].
% 0.42/1.07 Derived: -occurrence_of(A,B) | -occurrence_of(C,D) | atomic(B) | -subactivity_occurrence(A,C) | atocc(E,B) | -atomic(D) | -occurrence_of(E,D). [resolve(80,e,75,b)].
% 0.42/1.07 81 -occurrence_of(A,B) | -occurrence_of(C,D) | -subactivity(B,D) | subactivity_occurrence(A,C) | subactivity_occurrence(f13(B,D,A,C),C) # label(sos_32) # label(axiom). [clausify(33)].
% 0.42/1.07 Derived: -occurrence_of(A,f2(B,C,D)) | -occurrence_of(E,B) | subactivity_occurrence(A,E) | subactivity_occurrence(f13(f2(B,C,D),B,A,E),E) | -min_precedes(C,D,B). [resolve(81,c,76,b)].
% 0.42/1.07 Derived: -occurrence_of(A,f3(B,C,D)) | -occurrence_of(E,B) | subactivity_occurrence(A,E) | subactivity_occurrence(f13(f3(B,C,D),B,A,E),E) | -min_precedes(C,D,B). [resolve(81,c,77,b)].
% 0.42/1.07 Derived: -occurrence_of(A,f4(B,C)) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | subactivity_occurrence(f13(f4(B,C),B,A,D),D) | -root(C,B). [resolve(81,c,78,b)].
% 0.42/1.07 Derived: -occurrence_of(A,B) | -occurrence_of(C,f9(D,B)) | subactivity_occurrence(A,C) | subactivity_occurrence(f13(B,f9(D,B),A,C),C) | -atocc(D,B). [resolve(81,c,79,b)].
% 0.42/1.07 Derived: -occurrence_of(A,B) | -occurrence_of(C,D) | subactivity_occurrence(A,C) | subactivity_occurrence(f13(B,D,A,C),C) | -occurrence_of(E,B) | -occurrence_of(F,D) | atomic(B) | -subactivity_occurrence(E,F). [resolve(81,c,80,e)].
% 0.42/1.07 82 -occurrence_of(A,B) | -occurrence_of(C,D) | -subactivity(B,D) | subactivity_occurrence(A,C) | -subactivity_occurrence(f13(B,D,A,C),A) # label(sos_32) # label(axiom). [clausify(33)].
% 0.42/1.07 Derived: -occurrence_of(A,f2(B,C,D)) | -occurrence_of(E,B) | subactivity_occurrence(A,E) | -subactivity_occurrence(f13(f2(B,C,D),B,A,E),A) | -min_precedes(C,D,B). [resolve(82,c,76,b)].
% 0.42/1.07 Derived: -occurrence_of(A,f3(B,C,D)) | -occurrence_of(E,B) | subactivity_occurrence(A,E) | -subactivity_occurrence(f13(f3(B,C,D),B,A,E),A) | -min_precedes(C,D,B). [resolve(82,c,77,b)].
% 0.42/1.07 Derived: -occurrence_of(A,f4(B,C)) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | -subactivity_occurrence(f13(f4(B,C),B,A,D),A) | -root(C,B). [resolve(82,c,78,b)].
% 0.42/1.07 Derived: -occurrence_of(A,B) | -occurrence_of(C,f9(D,B)) | subactivity_occurrence(A,C) | -subactivity_occurrence(f13(B,f9(D,B),A,C),A) | -atocc(D,B). [resolve(82,c,79,b)].
% 0.42/1.07 Derived: -occurrence_of(A,B) | -occurrence_of(C,D) | subactivity_occurrence(A,C) | -subactivity_occurrence(f13(B,D,A,C),A) | -occurrence_of(E,B) | -occurrence_of(F,D) | atomic(B) | -subactivity_occurrence(E,F). [resolve(82,c,80,e)].
% 0.42/1.07 83 subactivity(A,A) | -occurrence_of(B,A). [resolve(58,a,59,b)].
% 0.42/1.07 Derived: -occurrence_of(A,B) | atocc(C,B) | -atomic(B) | -occurrence_of(C,B). [resolve(83,a,75,b)].
% 0.42/1.07 Derived: -occurrence_of(A,B) | -occurrence_of(C,B) | -occurrence_of(D,B) | subactivity_occurrence(C,D) | subactivity_occurrence(f13(B,B,C,D),D). [resolve(83,a,81,c)].
% 0.42/1.07 Derived: -occurrence_of(A,B) | -occurrence_of(C,B) | -occurrence_of(D,B) | subactivity_occurrence(C,D) | -subactivity_occurrence(f13(B,B,C,D),C). [resolve(83,a,82,c)].
% 0.42/1.07 84 subactivity(tptp0,tptp0). [resolve(61,a,58,a)].
% 0.42/1.07 85 -send_message(A,B,C,D,E) | subactivity(A,A). [resolve(62,b,58,a)].
% 0.42/1.07 86 -tptp1(A,B,C) | subactivity(A,A). [resolve(63,b,58,a)].
% 0.42/1.07 87 subactivity(f1(A),f1(A)) | -occurrence_of(A,B). [resolve(68,b,65,b)].
% 0.42/1.07 88 subactivity(f1(A),f1(A)) | -subactivity_occurrence(A,B). [resolve(68,b,66,b)].
% 0.42/1.07 89 subactivity(f1(A),f1(A)) | -subactivity_occurrence(B,A). [resolve(68,b,67,b)].
% 0.42/1.07 90 -min_precedes(A,B,C) | root(f5(A,B,C),C) # label(sos_13) # label(axiom). [clausify(14)].
% 0.42/1.07 91 -root(A,B) | atocc(A,f4(B,A)) # label(sos_12) # label(axiom). [clausify(13)].
% 0.42/1.07 Derived: -min_precedes(A,B,C) | atocc(f5(A,B,C),f4(C,f5(A,B,C))). [resolve(90,b,91,a)].
% 0.42/1.07 92 -min_precedes(A,B,C) | -root(B,C) # label(sos_14) # label(axiom). [clausify(15)].
% 0.42/1.07 Derived: -min_precedes(A,f5(B,C,D),D) | -min_precedes(B,C,D). [resolve(92,b,90,b)].
% 0.42/1.07 93 -root(A,B) | legal(A) # label(sos_16) # label(axiom). [clausify(17)].
% 0.42/1.07 Derived: legal(f5(A,B,C)) | -min_precedes(A,B,C). [resolve(93,a,90,b)].
% 0.42/1.07 94 -atocc(A,B) | -legal(A) | root(A,B) # label(sos_17) # label(axiom). [clausify(18)].
% 0.42/1.07 Derived: -atocc(A,B) | -legal(A) | atocc(A,f4(B,A)). [resolve(94,c,91,a)].
% 0.42/1.07 Derived: -atocc(A,B) | -legal(A) | -min_precedes(C,A,B). [resolve(94,c,92,b)].
% 0.42/1.07 95 -leaf(A,B) | root(A,B) | min_precedes(f6(A,B),A,B) # label(sos_21) # label(axiom). [clausify(22)].
% 0.42/1.07 Derived: -leaf(A,B) | min_precedes(f6(A,B),A,B) | atocc(A,f4(B,A)). [resolve(95,b,91,a)].
% 0.42/1.07 Derived: -leaf(A,B) | min_precedes(f6(A,B),A,B) | -min_precedes(C,A,B). [resolve(95,b,92,b)].
% 0.42/1.07 Derived: -leaf(A,B) | min_precedes(f6(A,B),A,B) | legal(A). [resolve(95,b,93,a)].
% 0.42/1.07 96 leaf(A,B) | -root(A,B) | min_precedes(A,f7(A,B),B) # label(sos_21) # label(axiom). [clausify(22)].
% 0.42/1.07 Derived: leaf(f5(A,B,C),C) | min_precedes(f5(A,B,C),f7(f5(A,B,C),C),C) | -min_precedes(A,B,C). [resolve(96,b,90,b)].
% 0.42/1.07 Derived: leaf(A,B) | min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A). [resolve(96,b,94,c)].
% 0.42/1.07 97 -root(A,B) | atomic(B) | occurrence_of(f11(B,A),B) # label(sos_26) # label(axiom). [clausify(27)].
% 0.42/1.07 Derived: atomic(A) | occurrence_of(f11(A,f5(B,C,A)),A) | -min_precedes(B,C,A). [resolve(97,a,90,b)].
% 0.42/1.07 Derived: atomic(A) | occurrence_of(f11(A,B),A) | -atocc(B,A) | -legal(B). [resolve(97,a,94,c)].
% 0.42/1.07 Derived: atomic(A) | occurrence_of(f11(A,B),A) | -leaf(B,A) | min_precedes(f6(B,A),B,A). [resolve(97,a,95,b)].
% 0.42/1.07 98 -root(A,B) | atomic(B) | subactivity_occurrence(A,f11(B,A)) # label(sos_26) # label(axiom). [clausify(27)].
% 0.42/1.07 Derived: atomic(A) | subactivity_occurrence(f5(B,C,A),f11(A,f5(B,C,A))) | -min_precedes(B,C,A). [resolve(98,a,90,b)].
% 0.42/1.07 Derived: atomic(A) | subactivity_occurrence(B,f11(A,B)) | -atocc(B,A) | -legal(B). [resolve(98,a,94,c)].
% 0.42/1.07 Derived: atomic(A) | subactivity_occurrence(B,f11(A,B)) | -leaf(B,A) | min_precedes(f6(B,A),B,A). [resolve(98,a,95,b)].
% 0.42/1.07 99 -occurrence_of(A,B) | atomic(B) | root(f12(B,A),B) # label(sos_27) # label(axiom). [clausify(28)].
% 0.42/1.07 Derived: -occurrence_of(A,B) | atomic(B) | atocc(f12(B,A),f4(B,f12(B,A))). [resolve(99,c,91,a)].
% 0.42/1.07 Derived: -occurrence_of(A,B) | atomic(B) | -min_precedes(C,f12(B,A),B). [resolve(99,c,92,b)].
% 0.42/1.07 Derived: -occurrence_of(A,B) | atomic(B) | legal(f12(B,A)). [resolve(99,c,93,a)].
% 0.42/1.07 Derived: -occurrence_of(A,B) | atomic(B) | leaf(f12(B,A),B) | min_precedes(f12(B,A),f7(f12(B,A),B),B). [resolve(99,c,96,b)].
% 0.42/1.07 Derived: -occurrence_of(A,B) | atomic(B) | atomic(B) | occurrence_of(f11(B,f12(B,A)),B). [resolve(99,c,97,a)].
% 0.42/1.07 Derived: -occurrence_of(A,B) | atomic(B) | atomic(B) | subactivity_occurrence(f12(B,A),f11(B,f12(B,A))). [resolve(99,c,98,a)].
% 0.42/1.07 100 -root_occ(A,B) | root(A,f14(A,B)) # label(sos_33) # label(axiom). [clausify(34)].
% 0.42/1.07 Derived: -root_occ(A,B) | atocc(A,f4(f14(A,B),A)). [resolve(100,b,91,a)].
% 0.42/1.07 Derived: -root_occ(A,B) | -min_precedes(C,A,f14(A,B)). [resolve(100,b,92,b)].
% 0.42/1.07 Derived: -root_occ(A,B) | legal(A). [resolve(100,b,93,a)].
% 0.42/1.07 Derived: -root_occ(A,B) | leaf(A,f14(A,B)) | min_precedes(A,f7(A,f14(A,B)),f14(A,B)). [resolve(100,b,96,b)].
% 0.42/1.08 Derived: -root_occ(A,B) | atomic(f14(A,B)) | occurrence_of(f11(f14(A,B),A),f14(A,B)). [resolve(100,b,97,a)].
% 0.42/1.08 Derived: -root_occ(A,B) | atomic(f14(A,B)) | subactivity_occurrence(A,f11(f14(A,B),A)). [resolve(100,b,98,a)].
% 0.42/1.08 101 root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -root(A,C) # label(sos_33) # label(axiom). [clausify(34)].
% 0.42/1.08 Derived: root_occ(f5(A,B,C),D) | -occurrence_of(D,C) | -subactivity_occurrence(f5(A,B,C),D) | -min_precedes(A,B,C). [resolve(101,d,90,b)].
% 0.42/1.08 Derived: root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -atocc(A,C) | -legal(A). [resolve(101,d,94,c)].
% 0.42/1.08 Derived: root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -leaf(A,C) | min_precedes(f6(A,C),A,C). [resolve(101,d,95,b)].
% 0.42/1.08 Derived: root_occ(f12(A,B),C) | -occurrence_of(C,A) | -subactivity_occurrence(f12(A,B),C) | -occurrence_of(B,A) | atomic(A). [resolve(101,d,99,c)].
% 0.42/1.08 Derived: root_occ(A,B) | -occurrence_of(B,f14(A,C)) | -subactivity_occurrence(A,B) | -root_occ(A,C). [resolve(101,d,100,b)].
% 0.42/1.08 102 -send_message(A,B,C,D,E) | root(B,C) # label(sos_62) # label(axiom). [clausify(51)].
% 0.42/1.08 Derived: -send_message(A,B,C,D,E) | atocc(B,f4(C,B)). [resolve(102,b,91,a)].
% 0.42/1.08 Derived: -send_message(A,B,C,D,E) | -min_precedes(F,B,C). [resolve(102,b,92,b)].
% 0.42/1.08 Derived: -send_message(A,B,C,D,E) | legal(B). [resolve(102,b,93,a)].
% 0.42/1.08 Derived: -send_message(A,B,C,D,E) | leaf(B,C) | min_precedes(B,f7(B,C),C). [resolve(102,b,96,b)].
% 0.42/1.08 Derived: -send_message(A,B,C,D,E) | atomic(C) | occurrence_of(f11(C,B),C). [resolve(102,b,97,a)].
% 0.42/1.08 Derived: -send_message(A,B,C,D,E) | atomic(C) | subactivity_occurrence(B,f11(C,B)). [resolve(102,b,98,a)].
% 0.42/1.08 Derived: -send_message(A,B,C,D,E) | root_occ(B,F) | -occurrence_of(F,C) | -subactivity_occurrence(B,F). [resolve(102,b,101,d)].
% 0.42/1.08 103 -send_message(A,B,C,D,E) | root(D,E) # label(sos_62) # label(axiom). [clausify(51)].
% 0.42/1.08 Derived: -send_message(A,B,C,D,E) | atocc(D,f4(E,D)). [resolve(103,b,91,a)].
% 0.42/1.08 Derived: -send_message(A,B,C,D,E) | -min_precedes(F,D,E). [resolve(103,b,92,b)].
% 0.42/1.08 Derived: -send_message(A,B,C,D,E) | legal(D). [resolve(103,b,93,a)].
% 0.42/1.08 Derived: -send_message(A,B,C,D,E) | leaf(D,E) | min_precedes(D,f7(D,E),E). [resolve(103,b,96,b)].
% 0.42/1.08 Derived: -send_message(A,B,C,D,E) | atomic(E) | occurrence_of(f11(E,D),E). [resolve(103,b,97,a)].
% 0.42/1.08 Derived: -send_message(A,B,C,D,E) | atomic(E) | subactivity_occurrence(D,f11(E,D)). [resolve(103,b,98,a)].
% 0.42/1.08 Derived: -send_message(A,B,C,D,E) | root_occ(D,F) | -occurrence_of(F,E) | -subactivity_occurrence(D,F). [resolve(103,b,101,d)].
% 0.42/1.08 104 -tptp1(A,B,C) | root(C,B) # label(sos_65) # label(axiom). [clausify(54)].
% 0.42/1.08 Derived: -tptp1(A,B,C) | atocc(C,f4(B,C)). [resolve(104,b,91,a)].
% 0.42/1.08 Derived: -tptp1(A,B,C) | -min_precedes(D,C,B). [resolve(104,b,92,b)].
% 0.42/1.08 Derived: -tptp1(A,B,C) | legal(C). [resolve(104,b,93,a)].
% 0.42/1.08 Derived: -tptp1(A,B,C) | leaf(C,B) | min_precedes(C,f7(C,B),B). [resolve(104,b,96,b)].
% 0.42/1.08 Derived: -tptp1(A,B,C) | atomic(B) | occurrence_of(f11(B,C),B). [resolve(104,b,97,a)].
% 0.42/1.08 Derived: -tptp1(A,B,C) | atomic(B) | subactivity_occurrence(C,f11(B,C)). [resolve(104,b,98,a)].
% 0.42/1.08 Derived: -tptp1(A,B,C) | root_occ(C,D) | -occurrence_of(D,B) | -subactivity_occurrence(C,D). [resolve(104,b,101,d)].
% 0.42/1.08 105 atocc(A,f4(B,C)) | -atomic(B) | -occurrence_of(A,B) | -root(C,B). [resolve(75,b,78,b)].
% 0.42/1.08 Derived: atocc(A,f4(B,f5(C,D,B))) | -atomic(B) | -occurrence_of(A,B) | -min_precedes(C,D,B). [resolve(105,d,90,b)].
% 0.42/1.08 Derived: atocc(A,f4(B,C)) | -atomic(B) | -occurrence_of(A,B) | -atocc(C,B) | -legal(C). [resolve(105,d,94,c)].
% 0.42/1.08 Derived: atocc(A,f4(B,C)) | -atomic(B) | -occurrence_of(A,B) | -leaf(C,B) | min_precedes(f6(C,B),C,B). [resolve(105,d,95,b)].
% 0.42/1.08 Derived: atocc(A,f4(f14(B,C),B)) | -atomic(f14(B,C)) | -occurrence_of(A,f14(B,C)) | -root_occ(B,C). [resolve(105,d,100,b)].
% 0.42/1.08 Derived: atocc(A,f4(B,C)) | -atomic(B) | -occurrence_of(A,B) | -send_message(D,C,B,E,F). [resolve(105,d,102,b)].
% 0.42/1.08 Derived: atocc(A,f4(B,C)) | -atomic(B) | -occurrence_of(A,B) | -send_message(D,E,F,C,B). [resolve(105,d,103,b)].
% 0.42/1.08 Derived: atocc(A,f4(B,C)) | -atomic(B) | -occurrence_of(A,B) | -tptp1(D,B,C). [resolve(105,d,104,b)].
% 0.81/1.08 106 -occurrence_of(A,f4(B,C)) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | subactivity_occurrence(f13(f4(B,C),B,A,D),D) | -root(C,B). [resolve(81,c,78,b)].
% 0.81/1.08 Derived: -occurrence_of(A,f4(B,f5(C,D,B))) | -occurrence_of(E,B) | subactivity_occurrence(A,E) | subactivity_occurrence(f13(f4(B,f5(C,D,B)),B,A,E),E) | -min_precedes(C,D,B). [resolve(106,e,90,b)].
% 0.81/1.08 Derived: -occurrence_of(A,f4(B,C)) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | subactivity_occurrence(f13(f4(B,C),B,A,D),D) | -atocc(C,B) | -legal(C). [resolve(106,e,94,c)].
% 0.81/1.08 Derived: -occurrence_of(A,f4(B,C)) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | subactivity_occurrence(f13(f4(B,C),B,A,D),D) | -leaf(C,B) | min_precedes(f6(C,B),C,B). [resolve(106,e,95,b)].
% 0.81/1.08 Derived: -occurrence_of(A,f4(B,f12(B,C))) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | subactivity_occurrence(f13(f4(B,f12(B,C)),B,A,D),D) | -occurrence_of(C,B) | atomic(B). [resolve(106,e,99,c)].
% 0.81/1.08 Derived: -occurrence_of(A,f4(f14(B,C),B)) | -occurrence_of(D,f14(B,C)) | subactivity_occurrence(A,D) | subactivity_occurrence(f13(f4(f14(B,C),B),f14(B,C),A,D),D) | -root_occ(B,C). [resolve(106,e,100,b)].
% 0.81/1.08 Derived: -occurrence_of(A,f4(B,C)) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | subactivity_occurrence(f13(f4(B,C),B,A,D),D) | -send_message(E,C,B,F,V6). [resolve(106,e,102,b)].
% 0.81/1.08 Derived: -occurrence_of(A,f4(B,C)) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | subactivity_occurrence(f13(f4(B,C),B,A,D),D) | -send_message(E,F,V6,C,B). [resolve(106,e,103,b)].
% 0.81/1.08 Derived: -occurrence_of(A,f4(B,C)) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | subactivity_occurrence(f13(f4(B,C),B,A,D),D) | -tptp1(E,B,C). [resolve(106,e,104,b)].
% 0.81/1.08 107 -occurrence_of(A,f4(B,C)) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | -subactivity_occurrence(f13(f4(B,C),B,A,D),A) | -root(C,B). [resolve(82,c,78,b)].
% 0.81/1.08 Derived: -occurrence_of(A,f4(B,f5(C,D,B))) | -occurrence_of(E,B) | subactivity_occurrence(A,E) | -subactivity_occurrence(f13(f4(B,f5(C,D,B)),B,A,E),A) | -min_precedes(C,D,B). [resolve(107,e,90,b)].
% 0.81/1.08 Derived: -occurrence_of(A,f4(B,C)) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | -subactivity_occurrence(f13(f4(B,C),B,A,D),A) | -atocc(C,B) | -legal(C). [resolve(107,e,94,c)].
% 0.81/1.08 Derived: -occurrence_of(A,f4(B,C)) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | -subactivity_occurrence(f13(f4(B,C),B,A,D),A) | -leaf(C,B) | min_precedes(f6(C,B),C,B). [resolve(107,e,95,b)].
% 0.81/1.08 Derived: -occurrence_of(A,f4(B,f12(B,C))) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | -subactivity_occurrence(f13(f4(B,f12(B,C)),B,A,D),A) | -occurrence_of(C,B) | atomic(B). [resolve(107,e,99,c)].
% 0.81/1.08 Derived: -occurrence_of(A,f4(f14(B,C),B)) | -occurrence_of(D,f14(B,C)) | subactivity_occurrence(A,D) | -subactivity_occurrence(f13(f4(f14(B,C),B),f14(B,C),A,D),A) | -root_occ(B,C). [resolve(107,e,100,b)].
% 0.81/1.08 Derived: -occurrence_of(A,f4(B,C)) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | -subactivity_occurrence(f13(f4(B,C),B,A,D),A) | -send_message(E,C,B,F,V6). [resolve(107,e,102,b)].
% 0.81/1.08 Derived: -occurrence_of(A,f4(B,C)) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | -subactivity_occurrence(f13(f4(B,C),B,A,D),A) | -send_message(E,F,V6,C,B). [resolve(107,e,103,b)].
% 0.81/1.08 Derived: -occurrence_of(A,f4(B,C)) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | -subactivity_occurrence(f13(f4(B,C),B,A,D),A) | -tptp1(E,B,C). [resolve(107,e,104,b)].
% 0.81/1.08 108 leaf(A,B) | -min_precedes(C,A,B) | min_precedes(A,f7(A,B),B) # label(sos_21) # label(axiom). [clausify(22)].
% 0.81/1.08 109 -leaf(A,B) | -min_precedes(A,C,B) # label(sos_21) # label(axiom). [clausify(22)].
% 0.81/1.08 Derived: -min_precedes(A,B,C) | min_precedes(B,f7(B,C),C) | -min_precedes(B,D,C). [resolve(108,a,109,a)].
% 0.81/1.08 110 -leaf_occ(A,B) | leaf(A,f15(A,B)) # label(sos_34) # label(axiom). [clausify(35)].
% 0.81/1.08 Derived: -leaf_occ(A,B) | -min_precedes(A,C,f15(A,B)). [resolve(110,b,109,a)].
% 0.81/1.08 111 leaf_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -leaf(A,C) # label(sos_34) # label(axiom). [clausify(35)].
% 0.81/1.08 Derived: leaf_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -min_precedes(D,A,C) | min_precedes(A,f7(A,C),C). [resolve(111,d,108,a)].
% 0.81/1.08 Derived: leaf_occ(A,B) | -occurrence_of(B,f15(A,C)) | -subactivity_occurrence(A,B) | -leaf_occ(A,C). [resolve(111,d,110,b)].
% 0.81/1.08 112 -leaf(A,B) | atomic(B) | occurrence_of(f16(A,B),B) # label(sos_45) # label(axiom). [clausify(46)].
% 0.81/1.08 Derived: atomic(A) | occurrence_of(f16(B,A),A) | -min_precedes(C,B,A) | min_precedes(B,f7(B,A),A). [resolve(112,a,108,a)].
% 0.81/1.08 Derived: atomic(f15(A,B)) | occurrence_of(f16(A,f15(A,B)),f15(A,B)) | -leaf_occ(A,B). [resolve(112,a,110,b)].
% 0.81/1.08 113 -leaf(A,B) | atomic(B) | leaf_occ(A,f16(A,B)) # label(sos_45) # label(axiom). [clausify(46)].
% 0.81/1.08 Derived: atomic(A) | leaf_occ(B,f16(B,A)) | -min_precedes(C,B,A) | min_precedes(B,f7(B,A),A). [resolve(113,a,108,a)].
% 0.81/1.08 Derived: atomic(f15(A,B)) | leaf_occ(A,f16(A,f15(A,B))) | -leaf_occ(A,B). [resolve(113,a,110,b)].
% 0.81/1.08 114 -leaf(A,B) | min_precedes(f6(A,B),A,B) | atocc(A,f4(B,A)). [resolve(95,b,91,a)].
% 0.81/1.08 Derived: min_precedes(f6(A,B),A,B) | atocc(A,f4(B,A)) | -min_precedes(C,A,B) | min_precedes(A,f7(A,B),B). [resolve(114,a,108,a)].
% 0.81/1.08 Derived: min_precedes(f6(A,f15(A,B)),A,f15(A,B)) | atocc(A,f4(f15(A,B),A)) | -leaf_occ(A,B). [resolve(114,a,110,b)].
% 0.81/1.08 115 -leaf(A,B) | min_precedes(f6(A,B),A,B) | -min_precedes(C,A,B). [resolve(95,b,92,b)].
% 0.81/1.08 Derived: min_precedes(f6(A,B),A,B) | -min_precedes(C,A,B) | -min_precedes(D,A,B) | min_precedes(A,f7(A,B),B). [resolve(115,a,108,a)].
% 0.81/1.08 Derived: min_precedes(f6(A,f15(A,B)),A,f15(A,B)) | -min_precedes(C,A,f15(A,B)) | -leaf_occ(A,B). [resolve(115,a,110,b)].
% 0.81/1.08 116 -leaf(A,B) | min_precedes(f6(A,B),A,B) | legal(A). [resolve(95,b,93,a)].
% 0.81/1.08 Derived: min_precedes(f6(A,f15(A,B)),A,f15(A,B)) | legal(A) | -leaf_occ(A,B). [resolve(116,a,110,b)].
% 0.81/1.08 117 leaf(f5(A,B,C),C) | min_precedes(f5(A,B,C),f7(f5(A,B,C),C),C) | -min_precedes(A,B,C). [resolve(96,b,90,b)].
% 0.81/1.08 Derived: min_precedes(f5(A,B,C),f7(f5(A,B,C),C),C) | -min_precedes(A,B,C) | -min_precedes(f5(A,B,C),D,C). [resolve(117,a,109,a)].
% 0.81/1.08 Derived: min_precedes(f5(A,B,C),f7(f5(A,B,C),C),C) | -min_precedes(A,B,C) | leaf_occ(f5(A,B,C),D) | -occurrence_of(D,C) | -subactivity_occurrence(f5(A,B,C),D). [resolve(117,a,111,d)].
% 0.81/1.08 Derived: min_precedes(f5(A,B,C),f7(f5(A,B,C),C),C) | -min_precedes(A,B,C) | atomic(C) | occurrence_of(f16(f5(A,B,C),C),C). [resolve(117,a,112,a)].
% 0.81/1.08 Derived: min_precedes(f5(A,B,C),f7(f5(A,B,C),C),C) | -min_precedes(A,B,C) | atomic(C) | leaf_occ(f5(A,B,C),f16(f5(A,B,C),C)). [resolve(117,a,113,a)].
% 0.81/1.08 Derived: min_precedes(f5(A,B,C),f7(f5(A,B,C),C),C) | -min_precedes(A,B,C) | min_precedes(f6(f5(A,B,C),C),f5(A,B,C),C) | atocc(f5(A,B,C),f4(C,f5(A,B,C))). [resolve(117,a,114,a)].
% 0.81/1.08 Derived: min_precedes(f5(A,B,C),f7(f5(A,B,C),C),C) | -min_precedes(A,B,C) | min_precedes(f6(f5(A,B,C),C),f5(A,B,C),C) | legal(f5(A,B,C)). [resolve(117,a,116,a)].
% 0.81/1.08 118 leaf(A,B) | min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A). [resolve(96,b,94,c)].
% 0.81/1.08 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A) | -min_precedes(A,C,B). [resolve(118,a,109,a)].
% 0.81/1.08 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(118,a,111,d)].
% 0.81/1.08 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A) | atomic(B) | occurrence_of(f16(A,B),B). [resolve(118,a,112,a)].
% 0.81/1.08 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A) | atomic(B) | leaf_occ(A,f16(A,B)). [resolve(118,a,113,a)].
% 0.81/1.08 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A) | min_precedes(f6(A,B),A,B) | atocc(A,f4(B,A)). [resolve(118,a,114,a)].
% 0.81/1.08 119 atomic(A) | occurrence_of(f11(A,B),A) | -leaf(B,A) | min_precedes(f6(B,A),B,A). [resolve(97,a,95,b)].
% 0.81/1.08 Derived: atomic(f15(A,B)) | occurrence_of(f11(f15(A,B),A),f15(A,B)) | min_precedes(f6(A,f15(A,B)),A,f15(A,B)) | -leaf_occ(A,B). [resolve(119,c,110,b)].
% 0.81/1.08 Derived: atomic(A) | occurrence_of(f11(A,f5(B,C,A)),A) | min_precedes(f6(f5(B,C,A),A),f5(B,C,A),A) | min_precedes(f5(B,C,A),f7(f5(B,C,A),A),A) | -min_precedes(B,C,A). [resolve(119,c,117,a)].
% 0.81/1.08 Derived: atomic(A) | occurrence_of(f11(A,B),A) | min_precedes(f6(B,A),B,A) | min_precedes(B,f7(B,A),A) | -atocc(B,A) | -legal(B). [resolve(119,c,118,a)].
% 0.81/1.09 120 atomic(A) | subactivity_occurrence(B,f11(A,B)) | -leaf(B,A) | min_precedes(f6(B,A),B,A). [resolve(98,a,95,b)].
% 0.81/1.09 Derived: atomic(f15(A,B)) | subactivity_occurrence(A,f11(f15(A,B),A)) | min_precedes(f6(A,f15(A,B)),A,f15(A,B)) | -leaf_occ(A,B). [resolve(120,c,110,b)].
% 0.81/1.09 Derived: atomic(A) | subactivity_occurrence(f5(B,C,A),f11(A,f5(B,C,A))) | min_precedes(f6(f5(B,C,A),A),f5(B,C,A),A) | min_precedes(f5(B,C,A),f7(f5(B,C,A),A),A) | -min_precedes(B,C,A). [resolve(120,c,117,a)].
% 0.81/1.09 Derived: atomic(A) | subactivity_occurrence(B,f11(A,B)) | min_precedes(f6(B,A),B,A) | min_precedes(B,f7(B,A),A) | -atocc(B,A) | -legal(B). [resolve(120,c,118,a)].
% 0.81/1.09 121 -occurrence_of(A,B) | atomic(B) | leaf(f12(B,A),B) | min_precedes(f12(B,A),f7(f12(B,A),B),B). [resolve(99,c,96,b)].
% 0.81/1.09 Derived: -occurrence_of(A,B) | atomic(B) | min_precedes(f12(B,A),f7(f12(B,A),B),B) | -min_precedes(f12(B,A),C,B). [resolve(121,c,109,a)].
% 0.81/1.09 Derived: -occurrence_of(A,B) | atomic(B) | min_precedes(f12(B,A),f7(f12(B,A),B),B) | leaf_occ(f12(B,A),C) | -occurrence_of(C,B) | -subactivity_occurrence(f12(B,A),C). [resolve(121,c,111,d)].
% 0.81/1.09 Derived: -occurrence_of(A,B) | atomic(B) | min_precedes(f12(B,A),f7(f12(B,A),B),B) | atomic(B) | occurrence_of(f16(f12(B,A),B),B). [resolve(121,c,112,a)].
% 0.81/1.09 Derived: -occurrence_of(A,B) | atomic(B) | min_precedes(f12(B,A),f7(f12(B,A),B),B) | atomic(B) | leaf_occ(f12(B,A),f16(f12(B,A),B)). [resolve(121,c,113,a)].
% 0.81/1.09 Derived: -occurrence_of(A,B) | atomic(B) | min_precedes(f12(B,A),f7(f12(B,A),B),B) | min_precedes(f6(f12(B,A),B),f12(B,A),B) | atocc(f12(B,A),f4(B,f12(B,A))). [resolve(121,c,114,a)].
% 0.81/1.09 Derived: -occurrence_of(A,B) | atomic(B) | min_precedes(f12(B,A),f7(f12(B,A),B),B) | min_precedes(f6(f12(B,A),B),f12(B,A),B) | legal(f12(B,A)). [resolve(121,c,116,a)].
% 0.81/1.09 122 -root_occ(A,B) | leaf(A,f14(A,B)) | min_precedes(A,f7(A,f14(A,B)),f14(A,B)). [resolve(100,b,96,b)].
% 0.81/1.09 Derived: -root_occ(A,B) | min_precedes(A,f7(A,f14(A,B)),f14(A,B)) | -min_precedes(A,C,f14(A,B)). [resolve(122,b,109,a)].
% 0.81/1.09 Derived: -root_occ(A,B) | min_precedes(A,f7(A,f14(A,B)),f14(A,B)) | leaf_occ(A,C) | -occurrence_of(C,f14(A,B)) | -subactivity_occurrence(A,C). [resolve(122,b,111,d)].
% 0.81/1.09 Derived: -root_occ(A,B) | min_precedes(A,f7(A,f14(A,B)),f14(A,B)) | atomic(f14(A,B)) | occurrence_of(f16(A,f14(A,B)),f14(A,B)). [resolve(122,b,112,a)].
% 0.81/1.09 Derived: -root_occ(A,B) | min_precedes(A,f7(A,f14(A,B)),f14(A,B)) | atomic(f14(A,B)) | leaf_occ(A,f16(A,f14(A,B))). [resolve(122,b,113,a)].
% 0.81/1.09 Derived: -root_occ(A,B) | min_precedes(A,f7(A,f14(A,B)),f14(A,B)) | min_precedes(f6(A,f14(A,B)),A,f14(A,B)) | atocc(A,f4(f14(A,B),A)). [resolve(122,b,114,a)].
% 0.81/1.09 Derived: -root_occ(A,B) | min_precedes(A,f7(A,f14(A,B)),f14(A,B)) | min_precedes(f6(A,f14(A,B)),A,f14(A,B)) | legal(A). [resolve(122,b,116,a)].
% 0.81/1.09 123 root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -leaf(A,C) | min_precedes(f6(A,C),A,C). [resolve(101,d,95,b)].
% 0.81/1.09 Derived: root_occ(A,B) | -occurrence_of(B,f15(A,C)) | -subactivity_occurrence(A,B) | min_precedes(f6(A,f15(A,C)),A,f15(A,C)) | -leaf_occ(A,C). [resolve(123,d,110,b)].
% 0.81/1.09 Derived: root_occ(f5(A,B,C),D) | -occurrence_of(D,C) | -subactivity_occurrence(f5(A,B,C),D) | min_precedes(f6(f5(A,B,C),C),f5(A,B,C),C) | min_precedes(f5(A,B,C),f7(f5(A,B,C),C),C) | -min_precedes(A,B,C). [resolve(123,d,117,a)].
% 0.81/1.09 Derived: root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | min_precedes(f6(A,C),A,C) | min_precedes(A,f7(A,C),C) | -atocc(A,C) | -legal(A). [resolve(123,d,118,a)].
% 0.81/1.09 124 -send_message(A,B,C,D,E) | leaf(B,C) | min_precedes(B,f7(B,C),C). [resolve(102,b,96,b)].
% 0.81/1.09 Derived: -send_message(A,B,C,D,E) | min_precedes(B,f7(B,C),C) | -min_precedes(B,F,C). [resolve(124,b,109,a)].
% 0.81/1.09 Derived: -send_message(A,B,C,D,E) | min_precedes(B,f7(B,C),C) | leaf_occ(B,F) | -occurrence_of(F,C) | -subactivity_occurrence(B,F). [resolve(124,b,111,d)].
% 0.81/1.09 Derived: -send_message(A,B,C,D,E) | min_precedes(B,f7(B,C),C) | atomic(C) | occurrence_of(f16(B,C),C). [resolve(124,b,112,a)].
% 0.81/1.09 Derived: -send_message(A,B,C,D,E) | min_precedes(B,f7(B,C),C) | atomic(C) | leaf_occ(B,f16(B,C)). [resolve(124,b,113,a)].
% 0.81/1.09 Derived: -send_message(A,B,C,D,E) | min_precedes(B,f7(B,C),C) | min_precedes(f6(B,C),B,C) | atocc(B,f4(C,B)). [resolve(124,b,114,a)].
% 0.81/1.09 Derived: -send_message(A,B,C,D,E) | min_precedes(B,f7(B,C),C) | min_precedes(f6(B,C),B,C) | legal(B). [resolve(124,b,116,a)].
% 0.81/1.09 125 -send_message(A,B,C,D,E) | leaf(D,E) | min_precedes(D,f7(D,E),E). [resolve(103,b,96,b)].
% 0.81/1.09 Derived: -send_message(A,B,C,D,E) | min_precedes(D,f7(D,E),E) | -min_precedes(D,F,E). [resolve(125,b,109,a)].
% 0.81/1.09 Derived: -send_message(A,B,C,D,E) | min_precedes(D,f7(D,E),E) | leaf_occ(D,F) | -occurrence_of(F,E) | -subactivity_occurrence(D,F). [resolve(125,b,111,d)].
% 0.81/1.09 Derived: -send_message(A,B,C,D,E) | min_precedes(D,f7(D,E),E) | atomic(E) | occurrence_of(f16(D,E),E). [resolve(125,b,112,a)].
% 0.81/1.09 Derived: -send_message(A,B,C,D,E) | min_precedes(D,f7(D,E),E) | atomic(E) | leaf_occ(D,f16(D,E)). [resolve(125,b,113,a)].
% 0.81/1.09 Derived: -send_message(A,B,C,D,E) | min_precedes(D,f7(D,E),E) | min_precedes(f6(D,E),D,E) | atocc(D,f4(E,D)). [resolve(125,b,114,a)].
% 0.81/1.09 Derived: -send_message(A,B,C,D,E) | min_precedes(D,f7(D,E),E) | min_precedes(f6(D,E),D,E) | legal(D). [resolve(125,b,116,a)].
% 0.81/1.09 126 -tptp1(A,B,C) | leaf(C,B) | min_precedes(C,f7(C,B),B). [resolve(104,b,96,b)].
% 0.81/1.09 Derived: -tptp1(A,B,C) | min_precedes(C,f7(C,B),B) | -min_precedes(C,D,B). [resolve(126,b,109,a)].
% 0.81/1.09 Derived: -tptp1(A,B,C) | min_precedes(C,f7(C,B),B) | leaf_occ(C,D) | -occurrence_of(D,B) | -subactivity_occurrence(C,D). [resolve(126,b,111,d)].
% 0.81/1.09 Derived: -tptp1(A,B,C) | min_precedes(C,f7(C,B),B) | atomic(B) | occurrence_of(f16(C,B),B). [resolve(126,b,112,a)].
% 0.81/1.09 Derived: -tptp1(A,B,C) | min_precedes(C,f7(C,B),B) | atomic(B) | leaf_occ(C,f16(C,B)). [resolve(126,b,113,a)].
% 0.81/1.09 Derived: -tptp1(A,B,C) | min_precedes(C,f7(C,B),B) | min_precedes(f6(C,B),C,B) | atocc(C,f4(B,C)). [resolve(126,b,114,a)].
% 0.81/1.09 Derived: -tptp1(A,B,C) | min_precedes(C,f7(C,B),B) | min_precedes(f6(C,B),C,B) | legal(C). [resolve(126,b,116,a)].
% 0.81/1.09 127 atocc(A,f4(B,C)) | -atomic(B) | -occurrence_of(A,B) | -leaf(C,B) | min_precedes(f6(C,B),C,B). [resolve(105,d,95,b)].
% 0.81/1.09 Derived: atocc(A,f4(f15(B,C),B)) | -atomic(f15(B,C)) | -occurrence_of(A,f15(B,C)) | min_precedes(f6(B,f15(B,C)),B,f15(B,C)) | -leaf_occ(B,C). [resolve(127,d,110,b)].
% 0.81/1.09 Derived: atocc(A,f4(B,f5(C,D,B))) | -atomic(B) | -occurrence_of(A,B) | min_precedes(f6(f5(C,D,B),B),f5(C,D,B),B) | min_precedes(f5(C,D,B),f7(f5(C,D,B),B),B) | -min_precedes(C,D,B). [resolve(127,d,117,a)].
% 0.81/1.09 Derived: atocc(A,f4(B,C)) | -atomic(B) | -occurrence_of(A,B) | min_precedes(f6(C,B),C,B) | min_precedes(C,f7(C,B),B) | -atocc(C,B) | -legal(C). [resolve(127,d,118,a)].
% 0.81/1.09 128 -occurrence_of(A,f4(B,C)) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | subactivity_occurrence(f13(f4(B,C),B,A,D),D) | -leaf(C,B) | min_precedes(f6(C,B),C,B). [resolve(106,e,95,b)].
% 0.81/1.09 Derived: -occurrence_of(A,f4(f15(B,C),B)) | -occurrence_of(D,f15(B,C)) | subactivity_occurrence(A,D) | subactivity_occurrence(f13(f4(f15(B,C),B),f15(B,C),A,D),D) | min_precedes(f6(B,f15(B,C)),B,f15(B,C)) | -leaf_occ(B,C). [resolve(128,e,110,b)].
% 0.81/1.09 Derived: -occurrence_of(A,f4(B,f5(C,D,B))) | -occurrence_of(E,B) | subactivity_occurrence(A,E) | subactivity_occurrence(f13(f4(B,f5(C,D,B)),B,A,E),E) | min_precedes(f6(f5(C,D,B),B),f5(C,D,B),B) | min_precedes(f5(C,D,B),f7(f5(C,D,B),B),B) | -min_precedes(C,D,B). [resolve(128,e,117,a)].
% 0.81/1.09 Derived: -occurrence_of(A,f4(B,C)) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | subactivity_occurrence(f13(f4(B,C),B,A,D),D) | min_precedes(f6(C,B),C,B) | min_precedes(C,f7(C,B),B) | -atocc(C,B) | -legal(C). [resolve(128,e,118,a)].
% 0.81/1.09 129 -occurrence_of(A,f4(B,C)) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | -subactivity_occurrence(f13(f4(B,C),B,A,D),A) | -leaf(C,B) | min_precedes(f6(C,B),C,B). [resolve(107,e,95,b)].
% 0.81/1.09 Derived: -occurrence_of(A,f4(f15(B,C),B)) | -occurrence_of(D,f15(B,C)) | subactivity_occurrence(A,D) | -subactivity_occurrence(f13(f4(f15(B,C),B),f15(B,C),A,D),A) | min_precedes(f6(B,f15(B,C)),B,f15(B,C)) | -leaf_occ(B,C). [resolve(129,e,110,b)].
% 0.81/1.10 Derived: -occurrence_of(A,f4(B,f5(C,D,B))) | -occurrence_of(E,B) | subactivity_occurrence(A,E) | -subactivity_occurrence(f13(f4(B,f5(C,D,B)),B,A,E),A) | min_precedes(f6(f5(C,D,B),B),f5(C,D,B),B) | min_precedes(f5(C,D,B),f7(f5(C,D,B),B),B) | -min_precedes(C,D,B). [resolve(129,e,117,a)].
% 0.81/1.10 Derived: -occurrence_of(A,f4(B,C)) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | -subactivity_occurrence(f13(f4(B,C),B,A,D),A) | min_precedes(f6(C,B),C,B) | min_precedes(C,f7(C,B),B) | -atocc(C,B) | -legal(C). [resolve(129,e,118,a)].
% 0.81/1.10 130 -tptp1(A,B,C) | -occurrence_of(D,A) | send_message(f19(A,B,C,D),f20(A,B,C,D),f21(A,B,C,D),C,B) # label(sos_66) # label(axiom). [clausify(55)].
% 0.81/1.10 131 -send_message(A,B,C,D,E) | atomic(A) # label(sos_62) # label(axiom). [clausify(51)].
% 0.81/1.10 132 -send_message(A,B,C,D,E) | A != tptp4 # label(sos_63) # label(axiom). [clausify(52)].
% 0.81/1.10 133 -send_message(A,B,C,D,E) | A != tptp3 # label(sos_63) # label(axiom). [clausify(52)].
% 0.81/1.10 134 -send_message(A,B,C,D,E) | A != tptp2 # label(sos_63) # label(axiom). [clausify(52)].
% 0.81/1.10 135 -send_message(A,B,C,D,E) | -occurrence_of(F,A) | min_precedes(D,F,E) # label(sos_64) # label(axiom). [clausify(53)].
% 0.81/1.10 Derived: -tptp1(A,B,C) | -occurrence_of(D,A) | atomic(f19(A,B,C,D)). [resolve(130,c,131,a)].
% 0.81/1.10 Derived: -tptp1(A,B,C) | -occurrence_of(D,A) | f19(A,B,C,D) != tptp4. [resolve(130,c,132,a)].
% 0.81/1.10 Derived: -tptp1(A,B,C) | -occurrence_of(D,A) | f19(A,B,C,D) != tptp3. [resolve(130,c,133,a)].
% 0.81/1.10 Derived: -tptp1(A,B,C) | -occurrence_of(D,A) | f19(A,B,C,D) != tptp2. [resolve(130,c,134,a)].
% 0.81/1.10 Derived: -tptp1(A,B,C) | -occurrence_of(D,A) | -occurrence_of(E,f19(A,B,C,D)) | min_precedes(C,E,B). [resolve(130,c,135,a)].
% 0.81/1.10 136 -send_message(A,B,C,D,E) | atocc(B,f4(C,B)). [resolve(102,b,91,a)].
% 0.81/1.10 Derived: atocc(f20(A,B,C,D),f4(f21(A,B,C,D),f20(A,B,C,D))) | -tptp1(A,B,C) | -occurrence_of(D,A). [resolve(136,a,130,c)].
% 0.81/1.10 137 -send_message(A,B,C,D,E) | -min_precedes(F,B,C). [resolve(102,b,92,b)].
% 0.81/1.10 Derived: -min_precedes(A,f20(B,C,D,E),f21(B,C,D,E)) | -tptp1(B,C,D) | -occurrence_of(E,B). [resolve(137,a,130,c)].
% 0.81/1.10 138 -send_message(A,B,C,D,E) | legal(B). [resolve(102,b,93,a)].
% 0.81/1.10 Derived: legal(f20(A,B,C,D)) | -tptp1(A,B,C) | -occurrence_of(D,A). [resolve(138,a,130,c)].
% 0.81/1.10 139 -send_message(A,B,C,D,E) | atomic(C) | occurrence_of(f11(C,B),C). [resolve(102,b,97,a)].
% 0.81/1.10 Derived: atomic(f21(A,B,C,D)) | occurrence_of(f11(f21(A,B,C,D),f20(A,B,C,D)),f21(A,B,C,D)) | -tptp1(A,B,C) | -occurrence_of(D,A). [resolve(139,a,130,c)].
% 0.81/1.10 140 -send_message(A,B,C,D,E) | atomic(C) | subactivity_occurrence(B,f11(C,B)). [resolve(102,b,98,a)].
% 0.81/1.10 Derived: atomic(f21(A,B,C,D)) | subactivity_occurrence(f20(A,B,C,D),f11(f21(A,B,C,D),f20(A,B,C,D))) | -tptp1(A,B,C) | -occurrence_of(D,A). [resolve(140,a,130,c)].
% 0.81/1.10 141 -send_message(A,B,C,D,E) | root_occ(B,F) | -occurrence_of(F,C) | -subactivity_occurrence(B,F). [resolve(102,b,101,d)].
% 0.81/1.10 Derived: root_occ(f20(A,B,C,D),E) | -occurrence_of(E,f21(A,B,C,D)) | -subactivity_occurrence(f20(A,B,C,D),E) | -tptp1(A,B,C) | -occurrence_of(D,A). [resolve(141,a,130,c)].
% 0.81/1.10 142 -send_message(A,B,C,D,E) | atocc(D,f4(E,D)). [resolve(103,b,91,a)].
% 0.81/1.10 143 -send_message(A,B,C,D,E) | -min_precedes(F,D,E). [resolve(103,b,92,b)].
% 0.81/1.10 144 -send_message(A,B,C,D,E) | legal(D). [resolve(103,b,93,a)].
% 0.81/1.10 145 -send_message(A,B,C,D,E) | atomic(E) | occurrence_of(f11(E,D),E). [resolve(103,b,97,a)].
% 0.81/1.10 146 -send_message(A,B,C,D,E) | atomic(E) | subactivity_occurrence(D,f11(E,D)). [resolve(103,b,98,a)].
% 0.81/1.10 147 -send_message(A,B,C,D,E) | root_occ(D,F) | -occurrence_of(F,E) | -subactivity_occurrence(D,F). [resolve(103,b,101,d)].
% 0.81/1.10 148 atocc(A,f4(B,C)) | -atomic(B) | -occurrence_of(A,B) | -send_message(D,C,B,E,F). [resolve(105,d,102,b)].
% 0.81/1.10 Derived: atocc(A,f4(f21(B,C,D,E),f20(B,C,D,E))) | -atomic(f21(B,C,D,E)) | -occurrence_of(A,f21(B,C,D,E)) | -tptp1(B,C,D) | -occurrence_of(E,B). [resolve(148,d,130,c)].
% 0.81/1.10 149 atocc(A,f4(B,C)) | -atomic(B) | -occurrence_of(A,B) | -send_message(D,E,F,C,B). [resolve(105,d,103,b)].
% 0.81/1.10 150 -occurrence_of(A,f4(B,C)) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | subactivity_occurrence(f13(f4(B,C),B,A,D),D) | -send_message(E,C,B,F,V6). [resolve(106,e,102,b)].
% 0.81/1.12 Derived: -occurrence_of(A,f4(f21(B,C,D,E),f20(B,C,D,E))) | -occurrence_of(F,f21(B,C,D,E)) | subactivity_occurrence(A,F) | subactivity_occurrence(f13(f4(f21(B,C,D,E),f20(B,C,D,E)),f21(B,C,D,E),A,F),F) | -tptp1(B,C,D) | -occurrence_of(E,B). [resolve(150,e,130,c)].
% 0.81/1.12 151 -occurrence_of(A,f4(B,C)) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | subactivity_occurrence(f13(f4(B,C),B,A,D),D) | -send_message(E,F,V6,C,B). [resolve(106,e,103,b)].
% 0.81/1.12 152 -occurrence_of(A,f4(B,C)) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | -subactivity_occurrence(f13(f4(B,C),B,A,D),A) | -send_message(E,C,B,F,V6). [resolve(107,e,102,b)].
% 0.81/1.12 Derived: -occurrence_of(A,f4(f21(B,C,D,E),f20(B,C,D,E))) | -occurrence_of(F,f21(B,C,D,E)) | subactivity_occurrence(A,F) | -subactivity_occurrence(f13(f4(f21(B,C,D,E),f20(B,C,D,E)),f21(B,C,D,E),A,F),A) | -tptp1(B,C,D) | -occurrence_of(E,B). [resolve(152,e,130,c)].
% 0.81/1.12 153 -occurrence_of(A,f4(B,C)) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | -subactivity_occurrence(f13(f4(B,C),B,A,D),A) | -send_message(E,F,V6,C,B). [resolve(107,e,103,b)].
% 0.81/1.12 154 -send_message(A,B,C,D,E) | min_precedes(B,f7(B,C),C) | -min_precedes(B,F,C). [resolve(124,b,109,a)].
% 0.81/1.12 Derived: min_precedes(f20(A,B,C,D),f7(f20(A,B,C,D),f21(A,B,C,D)),f21(A,B,C,D)) | -min_precedes(f20(A,B,C,D),E,f21(A,B,C,D)) | -tptp1(A,B,C) | -occurrence_of(D,A). [resolve(154,a,130,c)].
% 0.81/1.12 155 -send_message(A,B,C,D,E) | min_precedes(B,f7(B,C),C) | leaf_occ(B,F) | -occurrence_of(F,C) | -subactivity_occurrence(B,F). [resolve(124,b,111,d)].
% 0.81/1.12 Derived: min_precedes(f20(A,B,C,D),f7(f20(A,B,C,D),f21(A,B,C,D)),f21(A,B,C,D)) | leaf_occ(f20(A,B,C,D),E) | -occurrence_of(E,f21(A,B,C,D)) | -subactivity_occurrence(f20(A,B,C,D),E) | -tptp1(A,B,C) | -occurrence_of(D,A). [resolve(155,a,130,c)].
% 0.81/1.12 156 -send_message(A,B,C,D,E) | min_precedes(B,f7(B,C),C) | atomic(C) | occurrence_of(f16(B,C),C). [resolve(124,b,112,a)].
% 0.81/1.12 Derived: min_precedes(f20(A,B,C,D),f7(f20(A,B,C,D),f21(A,B,C,D)),f21(A,B,C,D)) | atomic(f21(A,B,C,D)) | occurrence_of(f16(f20(A,B,C,D),f21(A,B,C,D)),f21(A,B,C,D)) | -tptp1(A,B,C) | -occurrence_of(D,A). [resolve(156,a,130,c)].
% 0.81/1.12 157 -send_message(A,B,C,D,E) | min_precedes(B,f7(B,C),C) | atomic(C) | leaf_occ(B,f16(B,C)). [resolve(124,b,113,a)].
% 0.81/1.12 Derived: min_precedes(f20(A,B,C,D),f7(f20(A,B,C,D),f21(A,B,C,D)),f21(A,B,C,D)) | atomic(f21(A,B,C,D)) | leaf_occ(f20(A,B,C,D),f16(f20(A,B,C,D),f21(A,B,C,D))) | -tptp1(A,B,C) | -occurrence_of(D,A). [resolve(157,a,130,c)].
% 0.81/1.12 158 -send_message(A,B,C,D,E) | min_precedes(B,f7(B,C),C) | min_precedes(f6(B,C),B,C) | atocc(B,f4(C,B)). [resolve(124,b,114,a)].
% 0.81/1.12 159 -send_message(A,B,C,D,E) | min_precedes(B,f7(B,C),C) | min_precedes(f6(B,C),B,C) | legal(B). [resolve(124,b,116,a)].
% 0.81/1.12 160 -send_message(A,B,C,D,E) | min_precedes(D,f7(D,E),E) | -min_precedes(D,F,E). [resolve(125,b,109,a)].
% 0.81/1.12 161 -send_message(A,B,C,D,E) | min_precedes(D,f7(D,E),E) | leaf_occ(D,F) | -occurrence_of(F,E) | -subactivity_occurrence(D,F). [resolve(125,b,111,d)].
% 0.81/1.12 162 -send_message(A,B,C,D,E) | min_precedes(D,f7(D,E),E) | atomic(E) | occurrence_of(f16(D,E),E). [resolve(125,b,112,a)].
% 0.81/1.12 163 -send_message(A,B,C,D,E) | min_precedes(D,f7(D,E),E) | atomic(E) | leaf_occ(D,f16(D,E)). [resolve(125,b,113,a)].
% 0.81/1.12 164 -send_message(A,B,C,D,E) | min_precedes(D,f7(D,E),E) | min_precedes(f6(D,E),D,E) | atocc(D,f4(E,D)). [resolve(125,b,114,a)].
% 0.81/1.12 165 -send_message(A,B,C,D,E) | min_precedes(D,f7(D,E),E) | min_precedes(f6(D,E),D,E) | legal(D). [resolve(125,b,116,a)].
% 0.81/1.12
% 0.81/1.12 ============================== end predicate elimination =============
% 0.81/1.12
% 0.81/1.12 Auto_denials: (non-Horn, no changes).
% 0.81/1.12
% 0.81/1.12 Term ordering decisions:
% 0.81/1.12 Function symbol KB weights: tptp0=1. tptp2=1. tptp3=1. tptp4=1. tptp5=1. c1=1. c2=1. c3=1. f4=1. f6=1. f7=1. f9=1. f11=1. f12=1. f14=1. f15=1. f16=1. f1=1. f17=1. f18=1. f2=1. f3=1. f5=1. f8=1. f10=1. f13=1. f19=1. f20=1. f21=1. f22=1.
% 0.81/1.12
% 0.81/1.12 ============================== end of process initial clauses ========
% 0.81/1.12
% 0.81/1.12 ============================== CLAUSES FOR SEARCH ====================
% 0.81/1.12
% 0.81/1.12 ============================== end of clauses for search =============
% 8.77/9.04
% 8.77/9.04 ============================== SEARCH ================================
% 8.77/9.04
% 8.77/9.04 % Starting search at 0.08 seconds.
% 8.77/9.04
% 8.77/9.04 Low Water (keep): wt=89.000, iters=3768
% 8.77/9.04
% 8.77/9.04 Low Water (keep): wt=78.000, iters=3697
% 8.77/9.04
% 8.77/9.04 Low Water (keep): wt=63.000, iters=4509
% 8.77/9.04
% 8.77/9.04 Low Water (keep): wt=49.000, iters=3636
% 8.77/9.04
% 8.77/9.04 Low Water (keep): wt=45.000, iters=3354
% 8.77/9.04
% 8.77/9.04 Low Water (keep): wt=44.000, iters=3367
% 8.77/9.04
% 8.77/9.04 Low Water (keep): wt=40.000, iters=3424
% 8.77/9.04
% 8.77/9.04 Low Water (keep): wt=39.000, iters=3333
% 8.77/9.04
% 8.77/9.04 Low Water (keep): wt=38.000, iters=3391
% 8.77/9.04
% 8.77/9.04 Low Water (keep): wt=37.000, iters=3333
% 8.77/9.04
% 8.77/9.04 Low Water (keep): wt=36.000, iters=3333
% 8.77/9.04
% 8.77/9.04 Low Water (keep): wt=35.000, iters=3547
% 8.77/9.04
% 8.77/9.04 Low Water (keep): wt=34.000, iters=3376
% 8.77/9.04
% 8.77/9.04 Low Water (keep): wt=33.000, iters=3578
% 8.77/9.04
% 8.77/9.04 Low Water (keep): wt=32.000, iters=3404
% 8.77/9.04
% 8.77/9.04 Low Water (keep): wt=31.000, iters=3406
% 8.77/9.04
% 8.77/9.04 Low Water (keep): wt=30.000, iters=3670
% 8.77/9.04
% 8.77/9.04 Low Water (displace): id=26796, wt=31.000
% 8.77/9.04
% 8.77/9.04 Low Water (displace): id=26806, wt=27.000
% 8.77/9.04
% 8.77/9.04 Low Water (displace): id=26866, wt=26.000
% 8.77/9.04
% 8.77/9.04 Low Water (keep): wt=29.000, iters=3420
% 8.77/9.04
% 8.77/9.04 ============================== PROOF =================================
% 8.77/9.04 % SZS status Theorem
% 8.77/9.04 % SZS output start Refutation
% 8.77/9.04
% 8.77/9.04 % Proof 1 at 7.89 (+ 0.11) seconds.
% 8.77/9.04 % Length of proof is 106.
% 8.77/9.04 % Level of proof is 14.
% 8.77/9.04 % Maximum clause weight is 31.000.
% 8.77/9.04 % Given clauses 6752.
% 8.77/9.04
% 8.77/9.04 2 (all X2 (activity_occurrence(X2) -> (exists X3 (activity(X3) & occurrence_of(X2,X3))))) # label(sos_01) # label(axiom) # label(non_clause). [assumption].
% 8.77/9.04 3 (all X4 all X5 all X6 (occurrence_of(X4,X5) & occurrence_of(X4,X6) -> X5 = X6)) # label(sos_02) # label(axiom) # label(non_clause). [assumption].
% 8.77/9.04 23 (all X60 all X61 all X62 (next_subocc(X60,X61,X62) <-> min_precedes(X60,X61,X62) & -(exists X63 (min_precedes(X60,X63,X62) & min_precedes(X63,X61,X62))))) # label(sos_22) # label(axiom) # label(non_clause). [assumption].
% 8.77/9.04 25 (all X67 all X68 (subactivity_occurrence(X67,X68) -> activity_occurrence(X67) & activity_occurrence(X68))) # label(sos_24) # label(axiom) # label(non_clause). [assumption].
% 8.77/9.04 26 (all X69 all X70 all X71 (min_precedes(X70,X71,X69) -> (exists X72 (occurrence_of(X72,X69) & subactivity_occurrence(X70,X72) & subactivity_occurrence(X71,X72))))) # label(sos_25) # label(axiom) # label(non_clause). [assumption].
% 8.77/9.04 28 (all X76 all X77 (occurrence_of(X77,X76) & -atomic(X76) -> (exists X78 (root(X78,X76) & subactivity_occurrence(X78,X77))))) # label(sos_27) # label(axiom) # label(non_clause). [assumption].
% 8.77/9.04 34 (all X99 all X100 (root_occ(X99,X100) <-> (exists X101 (occurrence_of(X100,X101) & subactivity_occurrence(X99,X100) & root(X99,X101))))) # label(sos_33) # label(axiom) # label(non_clause). [assumption].
% 8.77/9.04 35 (all X102 all X103 (leaf_occ(X102,X103) <-> (exists X104 (occurrence_of(X103,X104) & subactivity_occurrence(X102,X103) & leaf(X102,X104))))) # label(sos_34) # label(axiom) # label(non_clause). [assumption].
% 8.77/9.04 36 (all X105 all X106 all X107 all X108 (occurrence_of(X107,X108) & root_occ(X105,X107) & root_occ(X106,X107) -> X105 = X106)) # label(sos_35) # label(axiom) # label(non_clause). [assumption].
% 8.77/9.04 49 (all X156 all X157 all X158 all X159 all X160 (occurrence_of(X157,X156) & root_occ(X159,X157) & leaf_occ(X160,X157) & subactivity_occurrence(X158,X157) & min_precedes(X159,X158,X156) & X158 != X160 -> min_precedes(X158,X160,X156))) # label(sos_48) # label(axiom) # label(non_clause). [assumption].
% 8.77/9.04 50 (all X161 (occurrence_of(X161,tptp0) -> (exists X162 exists X163 (occurrence_of(X162,tptp4) & root_occ(X162,X161) & (occurrence_of(X163,tptp3) | occurrence_of(X163,tptp2)) & leaf_occ(X163,X161) & next_subocc(X162,X163,tptp0))))) # label(sos_49) # label(axiom) # label(non_clause). [assumption].
% 8.77/9.04 52 (all X169 all X170 all X171 all X172 all X173 (send_message(X169,X170,X171,X172,X173) -> X169 != tptp4 & X169 != tptp3 & X169 != tptp2)) # label(sos_63) # label(axiom) # label(non_clause). [assumption].
% 8.77/9.04 53 (all X174 all X175 all X176 all X177 all X178 all X179 (send_message(X174,X175,X176,X177,X178) & occurrence_of(X179,X174) -> min_precedes(X177,X179,X178))) # label(sos_64) # label(axiom) # label(non_clause). [assumption].
% 8.77/9.04 54 (all X180 all X181 all X182 (tptp1(X180,X181,X182) -> activity(X180) & -atomic(X180) & -atomic(X181) & root(X182,X181))) # label(sos_65) # label(axiom) # label(non_clause). [assumption].
% 8.77/9.04 55 (all X183 all X184 all X185 all X186 (tptp1(X183,X184,X185) & occurrence_of(X186,X183) -> (exists X187 exists X188 exists X189 exists X190 (send_message(X187,X188,X189,X185,X184) & occurrence_of(X190,X187) & root_occ(X190,X186))))) # label(sos_66) # label(axiom) # label(non_clause). [assumption].
% 8.77/9.04 57 --(exists X193 exists X194 exists X195 (tptp1(X193,tptp0,X194) & occurrence_of(X195,X193))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 8.77/9.04 64 -activity_occurrence(A) | occurrence_of(A,f1(A)) # label(sos_01) # label(axiom). [clausify(2)].
% 8.77/9.04 66 -subactivity_occurrence(A,B) | activity_occurrence(A) # label(sos_24) # label(axiom). [clausify(25)].
% 8.77/9.04 99 -occurrence_of(A,B) | atomic(B) | root(f12(B,A),B) # label(sos_27) # label(axiom). [clausify(28)].
% 8.77/9.04 101 root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -root(A,C) # label(sos_33) # label(axiom). [clausify(34)].
% 8.77/9.04 104 -tptp1(A,B,C) | root(C,B) # label(sos_65) # label(axiom). [clausify(54)].
% 8.77/9.04 130 -tptp1(A,B,C) | -occurrence_of(D,A) | send_message(f19(A,B,C,D),f20(A,B,C,D),f21(A,B,C,D),C,B) # label(sos_66) # label(axiom). [clausify(55)].
% 8.77/9.04 133 -send_message(A,B,C,D,E) | A != tptp3 # label(sos_63) # label(axiom). [clausify(52)].
% 8.77/9.04 134 -send_message(A,B,C,D,E) | A != tptp2 # label(sos_63) # label(axiom). [clausify(52)].
% 8.77/9.04 135 -send_message(A,B,C,D,E) | -occurrence_of(F,A) | min_precedes(D,F,E) # label(sos_64) # label(axiom). [clausify(53)].
% 8.77/9.04 166 -occurrence_of(A,B) | -occurrence_of(A,C) | C = B # label(sos_02) # label(axiom). [clausify(3)].
% 8.77/9.04 179 -next_subocc(A,B,C) | -min_precedes(A,D,C) | -min_precedes(D,B,C) # label(sos_22) # label(axiom). [clausify(23)].
% 8.77/9.04 184 -min_precedes(A,B,C) | occurrence_of(f10(C,A,B),C) # label(sos_25) # label(axiom). [clausify(26)].
% 8.77/9.04 185 -min_precedes(A,B,C) | subactivity_occurrence(A,f10(C,A,B)) # label(sos_25) # label(axiom). [clausify(26)].
% 8.77/9.04 186 -min_precedes(A,B,C) | subactivity_occurrence(B,f10(C,A,B)) # label(sos_25) # label(axiom). [clausify(26)].
% 8.77/9.04 187 -occurrence_of(A,B) | atomic(B) | subactivity_occurrence(f12(B,A),A) # label(sos_27) # label(axiom). [clausify(28)].
% 8.77/9.04 194 -leaf_occ(A,B) | subactivity_occurrence(A,B) # label(sos_34) # label(axiom). [clausify(35)].
% 8.77/9.04 195 -occurrence_of(A,B) | -root_occ(C,A) | -root_occ(D,A) | D = C # label(sos_35) # label(axiom). [clausify(36)].
% 8.77/9.04 208 -occurrence_of(A,B) | -root_occ(C,A) | -leaf_occ(D,A) | -subactivity_occurrence(E,A) | -min_precedes(C,E,B) | D = E | min_precedes(E,D,B) # label(sos_48) # label(axiom). [clausify(49)].
% 8.77/9.04 210 -occurrence_of(A,tptp0) | root_occ(f17(A),A) # label(sos_49) # label(axiom). [clausify(50)].
% 8.77/9.04 211 -occurrence_of(A,tptp0) | occurrence_of(f18(A),tptp3) | occurrence_of(f18(A),tptp2) # label(sos_49) # label(axiom). [clausify(50)].
% 8.77/9.04 212 -occurrence_of(A,tptp0) | leaf_occ(f18(A),A) # label(sos_49) # label(axiom). [clausify(50)].
% 8.77/9.04 213 -occurrence_of(A,tptp0) | next_subocc(f17(A),f18(A),tptp0) # label(sos_49) # label(axiom). [clausify(50)].
% 8.77/9.04 226 -tptp1(A,B,C) | -atomic(A) # label(sos_65) # label(axiom). [clausify(54)].
% 8.77/9.04 228 -tptp1(A,B,C) | -occurrence_of(D,A) | occurrence_of(f22(A,B,C,D),f19(A,B,C,D)) # label(sos_66) # label(axiom). [clausify(55)].
% 8.77/9.04 229 -tptp1(A,B,C) | -occurrence_of(D,A) | root_occ(f22(A,B,C,D),D) # label(sos_66) # label(axiom). [clausify(55)].
% 8.77/9.04 231 tptp1(c1,tptp0,c2) # label(goals) # label(negated_conjecture). [clausify(57)].
% 8.77/9.04 232 occurrence_of(c3,c1) # label(goals) # label(negated_conjecture). [clausify(57)].
% 8.77/9.04 234 -subactivity_occurrence(A,B) | occurrence_of(A,f1(A)). [resolve(66,b,64,a)].
% 8.77/9.04 278 root_occ(f12(A,B),C) | -occurrence_of(C,A) | -subactivity_occurrence(f12(A,B),C) | -occurrence_of(B,A) | atomic(A). [resolve(101,d,99,c)].
% 8.77/9.04 285 -tptp1(A,B,C) | root_occ(C,D) | -occurrence_of(D,B) | -subactivity_occurrence(C,D). [resolve(104,b,101,d)].
% 8.77/9.04 341 -tptp1(A,B,C) | -occurrence_of(D,A) | f19(A,B,C,D) != tptp3. [resolve(130,c,133,a)].
% 8.77/9.04 342 -tptp1(A,B,C) | -occurrence_of(D,A) | f19(A,B,C,D) != tptp2. [resolve(130,c,134,a)].
% 8.77/9.04 343 -tptp1(A,B,C) | -occurrence_of(D,A) | -occurrence_of(E,f19(A,B,C,D)) | min_precedes(C,E,B). [resolve(130,c,135,a)].
% 8.77/9.04 370 root_occ(f12(A,B),B) | -occurrence_of(B,A) | -subactivity_occurrence(f12(A,B),B) | atomic(A). [factor(278,b,d)].
% 8.77/9.04 379 -occurrence_of(A,c1) | root_occ(f22(c1,tptp0,c2,A),A). [resolve(231,a,229,a)].
% 8.77/9.04 380 -occurrence_of(A,c1) | occurrence_of(f22(c1,tptp0,c2,A),f19(c1,tptp0,c2,A)). [resolve(231,a,228,a)].
% 8.77/9.04 381 -atomic(c1). [resolve(231,a,226,a)].
% 8.77/9.04 382 subactivity_occurrence(f12(c1,c3),c3). [resolve(232,a,187,a),unit_del(a,381)].
% 8.77/9.04 395 root_occ(c2,A) | -occurrence_of(A,tptp0) | -subactivity_occurrence(c2,A). [resolve(285,a,231,a)].
% 8.77/9.04 407 -occurrence_of(A,c1) | f19(c1,tptp0,c2,A) != tptp3. [resolve(341,a,231,a)].
% 8.77/9.04 408 -occurrence_of(A,c1) | f19(c1,tptp0,c2,A) != tptp2. [resolve(342,a,231,a)].
% 8.77/9.04 409 -occurrence_of(A,c1) | -occurrence_of(B,f19(c1,tptp0,c2,A)) | min_precedes(c2,B,tptp0). [resolve(343,a,231,a)].
% 8.77/9.04 426 root_occ(f22(c1,tptp0,c2,c3),c3). [resolve(379,a,232,a)].
% 8.77/9.04 452 occurrence_of(f22(c1,tptp0,c2,c3),f19(c1,tptp0,c2,c3)). [resolve(380,a,232,a)].
% 8.77/9.04 453 f19(c1,tptp0,c2,c3) != tptp3. [resolve(407,a,232,a)].
% 8.77/9.04 455 root_occ(f12(c1,c3),c3). [resolve(382,a,370,c),unit_del(b,232),unit_del(c,381)].
% 8.77/9.04 464 occurrence_of(f12(c1,c3),f1(f12(c1,c3))). [resolve(382,a,234,a)].
% 8.77/9.04 504 f19(c1,tptp0,c2,c3) != tptp2. [resolve(408,a,232,a)].
% 8.77/9.04 572 -occurrence_of(c3,A) | -root_occ(B,c3) | f12(c1,c3) = B. [resolve(455,a,195,c)].
% 8.77/9.04 750 -occurrence_of(f12(c1,c3),A) | f1(f12(c1,c3)) = A. [resolve(464,a,166,b)].
% 8.77/9.04 1385 min_precedes(c2,f22(c1,tptp0,c2,c3),tptp0). [resolve(452,a,409,b),unit_del(a,232)].
% 8.77/9.04 1425 -occurrence_of(A,tptp0) | -root_occ(c2,A) | -leaf_occ(B,A) | -subactivity_occurrence(f22(c1,tptp0,c2,c3),A) | f22(c1,tptp0,c2,c3) = B | min_precedes(f22(c1,tptp0,c2,c3),B,tptp0). [resolve(1385,a,208,e),flip(e)].
% 8.77/9.04 1430 subactivity_occurrence(f22(c1,tptp0,c2,c3),f10(tptp0,c2,f22(c1,tptp0,c2,c3))). [resolve(1385,a,186,a)].
% 8.77/9.04 1431 subactivity_occurrence(c2,f10(tptp0,c2,f22(c1,tptp0,c2,c3))). [resolve(1385,a,185,a)].
% 8.77/9.04 1432 occurrence_of(f10(tptp0,c2,f22(c1,tptp0,c2,c3)),tptp0). [resolve(1385,a,184,a)].
% 8.77/9.04 1667 root_occ(c2,f10(tptp0,c2,f22(c1,tptp0,c2,c3))). [resolve(1431,a,395,c),unit_del(b,1432)].
% 8.77/9.04 1692 next_subocc(f17(f10(tptp0,c2,f22(c1,tptp0,c2,c3))),f18(f10(tptp0,c2,f22(c1,tptp0,c2,c3))),tptp0). [resolve(1432,a,213,a)].
% 8.77/9.04 1693 leaf_occ(f18(f10(tptp0,c2,f22(c1,tptp0,c2,c3))),f10(tptp0,c2,f22(c1,tptp0,c2,c3))). [resolve(1432,a,212,a)].
% 8.77/9.04 1694 occurrence_of(f18(f10(tptp0,c2,f22(c1,tptp0,c2,c3))),tptp3) | occurrence_of(f18(f10(tptp0,c2,f22(c1,tptp0,c2,c3))),tptp2). [resolve(1432,a,211,a)].
% 8.77/9.04 1695 root_occ(f17(f10(tptp0,c2,f22(c1,tptp0,c2,c3))),f10(tptp0,c2,f22(c1,tptp0,c2,c3))). [resolve(1432,a,210,a)].
% 8.77/9.04 1900 -occurrence_of(f10(tptp0,c2,f22(c1,tptp0,c2,c3)),A) | -root_occ(B,f10(tptp0,c2,f22(c1,tptp0,c2,c3))) | c2 = B. [resolve(1667,a,195,c)].
% 8.77/9.04 1971 -occurrence_of(c3,A) | f22(c1,tptp0,c2,c3) = f12(c1,c3). [resolve(572,b,426,a),flip(b)].
% 8.77/9.04 2974 f22(c1,tptp0,c2,c3) = f12(c1,c3). [resolve(1971,a,232,a)].
% 8.77/9.04 3069 -occurrence_of(f10(tptp0,c2,f12(c1,c3)),A) | -root_occ(B,f10(tptp0,c2,f12(c1,c3))) | c2 = B. [back_rewrite(1900),rewrite([2974(7),2974(14)])].
% 8.77/9.04 3099 root_occ(f17(f10(tptp0,c2,f12(c1,c3))),f10(tptp0,c2,f12(c1,c3))). [back_rewrite(1695),rewrite([2974(7),2974(14)])].
% 8.77/9.04 3100 occurrence_of(f18(f10(tptp0,c2,f12(c1,c3))),tptp3) | occurrence_of(f18(f10(tptp0,c2,f12(c1,c3))),tptp2). [back_rewrite(1694),rewrite([2974(7),2974(16)])].
% 8.77/9.04 3101 leaf_occ(f18(f10(tptp0,c2,f12(c1,c3))),f10(tptp0,c2,f12(c1,c3))). [back_rewrite(1693),rewrite([2974(7),2974(14)])].
% 8.77/9.04 3102 next_subocc(f17(f10(tptp0,c2,f12(c1,c3))),f18(f10(tptp0,c2,f12(c1,c3))),tptp0). [back_rewrite(1692),rewrite([2974(7),2974(14)])].
% 8.77/9.04 3126 root_occ(c2,f10(tptp0,c2,f12(c1,c3))). [back_rewrite(1667),rewrite([2974(8)])].
% 8.77/9.04 3138 occurrence_of(f10(tptp0,c2,f12(c1,c3)),tptp0). [back_rewrite(1432),rewrite([2974(7)])].
% 8.77/9.04 3140 subactivity_occurrence(f12(c1,c3),f10(tptp0,c2,f12(c1,c3))). [back_rewrite(1430),rewrite([2974(5),2974(10)])].
% 8.77/9.04 3144 -occurrence_of(A,tptp0) | -root_occ(c2,A) | -leaf_occ(B,A) | -subactivity_occurrence(f12(c1,c3),A) | f12(c1,c3) = B | min_precedes(f12(c1,c3),B,tptp0). [back_rewrite(1425),rewrite([2974(10),2974(14),2974(18)])].
% 8.77/9.04 3182 min_precedes(c2,f12(c1,c3),tptp0). [back_rewrite(1385),rewrite([2974(6)])].
% 8.77/9.04 3183 occurrence_of(f12(c1,c3),f19(c1,tptp0,c2,c3)). [back_rewrite(452),rewrite([2974(5)])].
% 8.77/9.04 3232 f19(c1,tptp0,c2,c3) = f1(f12(c1,c3)). [resolve(3183,a,750,a),flip(a)].
% 8.77/9.04 3233 f1(f12(c1,c3)) != tptp2. [back_rewrite(504),rewrite([3232(5)])].
% 8.77/9.04 3234 f1(f12(c1,c3)) != tptp3. [back_rewrite(453),rewrite([3232(5)])].
% 8.77/9.04 6257 subactivity_occurrence(f18(f10(tptp0,c2,f12(c1,c3))),f10(tptp0,c2,f12(c1,c3))). [resolve(3101,a,194,a)].
% 8.77/9.04 7268 occurrence_of(f18(f10(tptp0,c2,f12(c1,c3))),f1(f18(f10(tptp0,c2,f12(c1,c3))))). [resolve(6257,a,234,a)].
% 8.77/9.04 9510 -min_precedes(f17(f10(tptp0,c2,f12(c1,c3))),A,tptp0) | -min_precedes(A,f18(f10(tptp0,c2,f12(c1,c3))),tptp0). [resolve(3102,a,179,a)].
% 8.77/9.04 10599 -occurrence_of(f18(f10(tptp0,c2,f12(c1,c3))),A) | f1(f18(f10(tptp0,c2,f12(c1,c3)))) = A. [resolve(7268,a,166,b)].
% 8.77/9.04 16401 -occurrence_of(f10(tptp0,c2,f12(c1,c3)),A) | f17(f10(tptp0,c2,f12(c1,c3))) = c2. [resolve(3069,b,3099,a),flip(b)].
% 8.77/9.04 16408 f17(f10(tptp0,c2,f12(c1,c3))) = c2. [resolve(16401,a,3138,a)].
% 8.77/9.04 16446 -min_precedes(c2,A,tptp0) | -min_precedes(A,f18(f10(tptp0,c2,f12(c1,c3))),tptp0). [back_rewrite(9510),rewrite([16408(7)])].
% 8.77/9.04 17440 f1(f18(f10(tptp0,c2,f12(c1,c3)))) = tptp3 | occurrence_of(f18(f10(tptp0,c2,f12(c1,c3))),tptp2). [resolve(10599,a,3100,a)].
% 8.77/9.04 18665 f1(f18(f10(tptp0,c2,f12(c1,c3)))) = tptp3 | f1(f18(f10(tptp0,c2,f12(c1,c3)))) = tptp2. [resolve(17440,b,10599,a)].
% 8.77/9.04 22124 -leaf_occ(A,f10(tptp0,c2,f12(c1,c3))) | f12(c1,c3) = A | min_precedes(f12(c1,c3),A,tptp0). [resolve(3144,b,3126,a),unit_del(a,3138),unit_del(c,3140)].
% 8.77/9.04 22127 f18(f10(tptp0,c2,f12(c1,c3))) = f12(c1,c3) | min_precedes(f12(c1,c3),f18(f10(tptp0,c2,f12(c1,c3))),tptp0). [resolve(22124,a,3101,a),flip(a)].
% 8.77/9.04 29370 f18(f10(tptp0,c2,f12(c1,c3))) = f12(c1,c3). [resolve(22127,b,16446,b),unit_del(b,3182)].
% 8.77/9.04 29880 $F. [back_rewrite(18665),rewrite([29370(7),29370(13)]),unit_del(a,3234),unit_del(b,3233)].
% 8.77/9.04
% 8.77/9.04 % SZS output end Refutation
% 8.77/9.04 ============================== end of proof ==========================
% 8.77/9.04
% 8.77/9.04 ============================== STATISTICS ============================
% 8.77/9.04
% 8.77/9.04 Given=6752. Generated=173094. Kept=29709. proofs=1.
% 8.77/9.04 Usable=3629. Sos=7951. Demods=128. Limbo=510, Disabled=17938. Hints=0.
% 8.77/9.04 Megabytes=49.10.
% 8.77/9.04 User_CPU=7.89, System_CPU=0.11, Wall_clock=8.
% 8.77/9.04
% 8.77/9.04 ============================== end of statistics =====================
% 8.77/9.04
% 8.77/9.04 ============================== end of search =========================
% 8.77/9.04
% 8.77/9.04 THEOREM PROVED
% 8.77/9.04 % SZS status Theorem
% 8.77/9.04
% 8.77/9.04 Exiting with 1 proof.
% 8.77/9.04
% 8.77/9.04 Process 1335 exit (max_proofs) Mon Jun 13 02:31:44 2022
% 8.77/9.04 Prover9 interrupted
%------------------------------------------------------------------------------