TSTP Solution File: PRO005+3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PRO005+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n005.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:06 EDT 2022
% Result : Theorem 49.15s 49.45s
% Output : Refutation 49.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : PRO005+3 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.36 % Computer : n005.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Mon Jun 13 02:31:09 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.80/1.10 ============================== Prover9 ===============================
% 0.80/1.10 Prover9 (32) version 2009-11A, November 2009.
% 0.80/1.10 Process 2224 was started by sandbox2 on n005.cluster.edu,
% 0.80/1.10 Mon Jun 13 02:31:09 2022
% 0.80/1.10 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_2064_n005.cluster.edu".
% 0.80/1.10 ============================== end of head ===========================
% 0.80/1.10
% 0.80/1.10 ============================== INPUT =================================
% 0.80/1.10
% 0.80/1.10 % Reading from file /tmp/Prover9_2064_n005.cluster.edu
% 0.80/1.10
% 0.80/1.10 set(prolog_style_variables).
% 0.80/1.10 set(auto2).
% 0.80/1.10 % set(auto2) -> set(auto).
% 0.80/1.10 % set(auto) -> set(auto_inference).
% 0.80/1.10 % set(auto) -> set(auto_setup).
% 0.80/1.10 % set(auto_setup) -> set(predicate_elim).
% 0.80/1.10 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.80/1.10 % set(auto) -> set(auto_limits).
% 0.80/1.10 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.80/1.10 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.80/1.10 % set(auto) -> set(auto_denials).
% 0.80/1.10 % set(auto) -> set(auto_process).
% 0.80/1.10 % set(auto2) -> assign(new_constants, 1).
% 0.80/1.10 % set(auto2) -> assign(fold_denial_max, 3).
% 0.80/1.10 % set(auto2) -> assign(max_weight, "200.000").
% 0.80/1.10 % set(auto2) -> assign(max_hours, 1).
% 0.80/1.10 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.80/1.10 % set(auto2) -> assign(max_seconds, 0).
% 0.80/1.10 % set(auto2) -> assign(max_minutes, 5).
% 0.80/1.10 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.80/1.10 % set(auto2) -> set(sort_initial_sos).
% 0.80/1.10 % set(auto2) -> assign(sos_limit, -1).
% 0.80/1.10 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.80/1.10 % set(auto2) -> assign(max_megs, 400).
% 0.80/1.10 % set(auto2) -> assign(stats, some).
% 0.80/1.10 % set(auto2) -> clear(echo_input).
% 0.80/1.10 % set(auto2) -> set(quiet).
% 0.80/1.10 % set(auto2) -> clear(print_initial_clauses).
% 0.80/1.10 % set(auto2) -> clear(print_given).
% 0.80/1.10 assign(lrs_ticks,-1).
% 0.80/1.10 assign(sos_limit,10000).
% 0.80/1.10 assign(order,kbo).
% 0.80/1.10 set(lex_order_vars).
% 0.80/1.10 clear(print_given).
% 0.80/1.10
% 0.80/1.10 % formulas(sos). % not echoed (65 formulas)
% 0.80/1.10
% 0.80/1.10 ============================== end of input ==========================
% 0.80/1.10
% 0.80/1.10 % From the command line: assign(max_seconds, 300).
% 0.80/1.10
% 0.80/1.10 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.80/1.10
% 0.80/1.10 % Formulas that are not ordinary clauses:
% 0.80/1.10 1 (all X0 all X1 (occurrence_of(X1,X0) -> activity(X0) & activity_occurrence(X1))) # label(sos) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.10 2 (all X2 (activity_occurrence(X2) -> (exists X3 (activity(X3) & occurrence_of(X2,X3))))) # label(sos_01) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.10 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.80/1.10 4 (all X7 (activity(X7) -> subactivity(X7,X7))) # label(sos_03) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.10 5 (all X8 all X9 (earlier(X8,X9) -> -earlier(X9,X8))) # label(sos_04) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.10 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.80/1.10 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.80/1.10 8 (all X16 all X17 (occurrence_of(X16,X17) -> (arboreal(X16) <-> atomic(X17)))) # label(sos_07) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.10 9 (all X18 (legal(X18) -> arboreal(X18))) # label(sos_08) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.10 10 (all X19 all X20 (legal(X19) & earlier(X20,X19) -> legal(X20))) # label(sos_09) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.10 11 (all X21 all X22 (precedes(X21,X22) <-> earlier(X21,X22) & legal(X22))) # label(sos_10) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.10 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.80/1.10 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.80/1.10 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.80/1.10 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.80/1.10 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.80/1.10 17 (all X41 all X42 (root(X41,X42) -> legal(X41))) # label(sos_16) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.10 18 (all X43 all X44 (atocc(X43,X44) & legal(X43) -> root(X43,X44))) # label(sos_17) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.10 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.80/1.10 20 (all X49 all X50 all X51 (min_precedes(X49,X50,X51) -> -atomic(X51))) # label(sos_19) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.10 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.80/1.10 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.80/1.10 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.80/1.10 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.80/1.10 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.80/1.10 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.80/1.10 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.80/1.10 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.80/1.10 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.80/1.10 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.80/1.10 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.80/1.10 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.80/1.10 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.80/1.10 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 47 (all X148 all X149 all X150 (min_precedes(X148,X149,X150) -> arboreal(X148))) # label(sos_46) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 51 (all X164 all X165 (occurrence_of(X165,tptp0) & subactivity_occurrence(X164,X165) & arboreal(X164) & -leaf_occ(X164,X165) -> root_occ(X164,X165))) # label(sos_62) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.11 52 (all X166 all X167 (occurrence_of(X167,tptp0) & subactivity_occurrence(X166,X167) & arboreal(X166) & -leaf_occ(X166,X167) -> (exists X168 (occurrence_of(X168,tptp1) & next_subocc(X166,X168,tptp0))))) # label(sos_63) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.11 53 --(exists X169 occurrence_of(X169,tptp0)) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.80/1.11
% 0.80/1.11 ============================== end of process non-clausal formulas ===
% 0.80/1.11
% 0.80/1.11 ============================== PROCESS INITIAL CLAUSES ===============
% 0.80/1.11
% 0.80/1.11 ============================== PREDICATE ELIMINATION =================
% 0.80/1.11 54 -activity(A) | subactivity(A,A) # label(sos_03) # label(axiom). [clausify(4)].
% 0.80/1.11 55 -occurrence_of(A,B) | activity(B) # label(sos) # label(axiom). [clausify(1)].
% 0.80/1.11 56 -activity_occurrence(A) | activity(f1(A)) # label(sos_01) # label(axiom). [clausify(2)].
% 0.80/1.11 Derived: subactivity(A,A) | -occurrence_of(B,A). [resolve(54,a,55,b)].
% 0.80/1.11 Derived: subactivity(f1(A),f1(A)) | -activity_occurrence(A). [resolve(54,a,56,b)].
% 0.80/1.11 57 activity(tptp0) # label(sos_50) # label(axiom). [assumption].
% 0.80/1.11 Derived: subactivity(tptp0,tptp0). [resolve(57,a,54,a)].
% 0.80/1.11 58 -activity_occurrence(A) | occurrence_of(A,f1(A)) # label(sos_01) # label(axiom). [clausify(2)].
% 0.80/1.11 59 -occurrence_of(A,B) | activity_occurrence(A) # label(sos) # label(axiom). [clausify(1)].
% 0.80/1.11 Derived: occurrence_of(A,f1(A)) | -occurrence_of(A,B). [resolve(58,a,59,b)].
% 0.80/1.11 60 -subactivity_occurrence(A,B) | activity_occurrence(A) # label(sos_24) # label(axiom). [clausify(25)].
% 0.80/1.11 Derived: -subactivity_occurrence(A,B) | occurrence_of(A,f1(A)). [resolve(60,b,58,a)].
% 0.80/1.11 61 -subactivity_occurrence(A,B) | activity_occurrence(B) # label(sos_24) # label(axiom). [clausify(25)].
% 0.80/1.11 Derived: -subactivity_occurrence(A,B) | occurrence_of(B,f1(B)). [resolve(61,b,58,a)].
% 0.80/1.11 62 subactivity(f1(A),f1(A)) | -activity_occurrence(A). [resolve(54,a,56,b)].
% 0.80/1.11 Derived: subactivity(f1(A),f1(A)) | -occurrence_of(A,B). [resolve(62,b,59,b)].
% 0.80/1.11 Derived: subactivity(f1(A),f1(A)) | -subactivity_occurrence(A,B). [resolve(62,b,60,b)].
% 0.80/1.11 Derived: subactivity(f1(A),f1(A)) | -subactivity_occurrence(B,A). [resolve(62,b,61,b)].
% 0.80/1.11 63 precedes(A,B) | -earlier(A,B) | -legal(B) # label(sos_10) # label(axiom). [clausify(11)].
% 0.80/1.11 64 -precedes(A,B) | earlier(A,B) # label(sos_10) # label(axiom). [clausify(11)].
% 0.80/1.11 65 -precedes(A,B) | legal(B) # label(sos_10) # label(axiom). [clausify(11)].
% 0.80/1.11 66 -min_precedes(A,B,C) | precedes(A,B) # label(sos_15) # label(axiom). [clausify(16)].
% 0.80/1.11 Derived: -min_precedes(A,B,C) | earlier(A,B). [resolve(66,b,64,a)].
% 0.80/1.11 Derived: -min_precedes(A,B,C) | legal(B). [resolve(66,b,65,a)].
% 0.80/1.11 67 -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.80/1.11 Derived: -min_precedes(A,B,C) | -min_precedes(A,D,C) | min_precedes(B,D,C) | -earlier(B,D) | -legal(D). [resolve(67,c,63,a)].
% 0.80/1.11 Derived: -min_precedes(A,B,C) | -min_precedes(A,D,C) | min_precedes(B,D,C) | -min_precedes(B,D,E). [resolve(67,c,66,b)].
% 0.80/1.11 68 -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.80/1.11 Derived: -min_precedes(A,B,C) | -min_precedes(D,B,C) | min_precedes(A,D,C) | -earlier(A,D) | -legal(D). [resolve(68,c,63,a)].
% 0.80/1.11 Derived: -min_precedes(A,B,C) | -min_precedes(D,B,C) | min_precedes(A,D,C) | -min_precedes(A,D,E). [resolve(68,c,66,b)].
% 0.80/1.11 69 atocc(A,B) | -subactivity(B,C) | -atomic(C) | -occurrence_of(A,C) # label(sos_23) # label(axiom). [clausify(24)].
% 0.80/1.11 70 -min_precedes(A,B,C) | subactivity(f2(C,A,B),C) # label(sos_11) # label(axiom). [clausify(12)].
% 0.80/1.11 71 -min_precedes(A,B,C) | subactivity(f3(C,A,B),C) # label(sos_11) # label(axiom). [clausify(12)].
% 0.80/1.11 72 -root(A,B) | subactivity(f4(B,A),B) # label(sos_12) # label(axiom). [clausify(13)].
% 0.80/1.11 73 -atocc(A,B) | subactivity(B,f9(A,B)) # label(sos_23) # label(axiom). [clausify(24)].
% 0.80/1.11 Derived: atocc(A,f2(B,C,D)) | -atomic(B) | -occurrence_of(A,B) | -min_precedes(C,D,B). [resolve(69,b,70,b)].
% 0.80/1.11 Derived: atocc(A,f3(B,C,D)) | -atomic(B) | -occurrence_of(A,B) | -min_precedes(C,D,B). [resolve(69,b,71,b)].
% 0.80/1.11 Derived: atocc(A,f4(B,C)) | -atomic(B) | -occurrence_of(A,B) | -root(C,B). [resolve(69,b,72,b)].
% 0.80/1.11 Derived: atocc(A,B) | -atomic(f9(C,B)) | -occurrence_of(A,f9(C,B)) | -atocc(C,B). [resolve(69,b,73,b)].
% 0.80/1.11 74 -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.80/1.11 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(74,e,69,b)].
% 0.80/1.11 75 -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.80/1.11 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(75,c,70,b)].
% 0.80/1.11 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(75,c,71,b)].
% 0.80/1.11 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(75,c,72,b)].
% 0.80/1.11 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(75,c,73,b)].
% 0.80/1.11 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(75,c,74,e)].
% 0.80/1.11 76 -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.80/1.11 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(76,c,70,b)].
% 0.80/1.11 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(76,c,71,b)].
% 0.80/1.11 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(76,c,72,b)].
% 0.80/1.11 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(76,c,73,b)].
% 0.80/1.11 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(76,c,74,e)].
% 0.80/1.11 77 subactivity(A,A) | -occurrence_of(B,A). [resolve(54,a,55,b)].
% 0.80/1.11 Derived: -occurrence_of(A,B) | atocc(C,B) | -atomic(B) | -occurrence_of(C,B). [resolve(77,a,69,b)].
% 0.80/1.11 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(77,a,75,c)].
% 0.80/1.11 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(77,a,76,c)].
% 0.80/1.11 78 subactivity(tptp0,tptp0). [resolve(57,a,54,a)].
% 0.80/1.11 79 subactivity(f1(A),f1(A)) | -occurrence_of(A,B). [resolve(62,b,59,b)].
% 0.80/1.11 80 subactivity(f1(A),f1(A)) | -subactivity_occurrence(A,B). [resolve(62,b,60,b)].
% 0.80/1.11 81 subactivity(f1(A),f1(A)) | -subactivity_occurrence(B,A). [resolve(62,b,61,b)].
% 0.80/1.11 82 -min_precedes(A,B,C) | root(f5(A,B,C),C) # label(sos_13) # label(axiom). [clausify(14)].
% 0.80/1.11 83 -root(A,B) | atocc(A,f4(B,A)) # label(sos_12) # label(axiom). [clausify(13)].
% 0.80/1.11 Derived: -min_precedes(A,B,C) | atocc(f5(A,B,C),f4(C,f5(A,B,C))). [resolve(82,b,83,a)].
% 0.80/1.11 84 -min_precedes(A,B,C) | -root(B,C) # label(sos_14) # label(axiom). [clausify(15)].
% 0.80/1.11 Derived: -min_precedes(A,f5(B,C,D),D) | -min_precedes(B,C,D). [resolve(84,b,82,b)].
% 0.80/1.11 85 -root(A,B) | legal(A) # label(sos_16) # label(axiom). [clausify(17)].
% 0.80/1.11 Derived: legal(f5(A,B,C)) | -min_precedes(A,B,C). [resolve(85,a,82,b)].
% 0.80/1.11 86 -atocc(A,B) | -legal(A) | root(A,B) # label(sos_17) # label(axiom). [clausify(18)].
% 0.80/1.11 Derived: -atocc(A,B) | -legal(A) | atocc(A,f4(B,A)). [resolve(86,c,83,a)].
% 0.80/1.12 Derived: -atocc(A,B) | -legal(A) | -min_precedes(C,A,B). [resolve(86,c,84,b)].
% 0.80/1.12 87 -leaf(A,B) | root(A,B) | min_precedes(f6(A,B),A,B) # label(sos_21) # label(axiom). [clausify(22)].
% 0.80/1.12 Derived: -leaf(A,B) | min_precedes(f6(A,B),A,B) | atocc(A,f4(B,A)). [resolve(87,b,83,a)].
% 0.80/1.12 Derived: -leaf(A,B) | min_precedes(f6(A,B),A,B) | -min_precedes(C,A,B). [resolve(87,b,84,b)].
% 0.80/1.12 Derived: -leaf(A,B) | min_precedes(f6(A,B),A,B) | legal(A). [resolve(87,b,85,a)].
% 0.80/1.12 88 leaf(A,B) | -root(A,B) | min_precedes(A,f7(A,B),B) # label(sos_21) # label(axiom). [clausify(22)].
% 0.80/1.12 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(88,b,82,b)].
% 0.80/1.12 Derived: leaf(A,B) | min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A). [resolve(88,b,86,c)].
% 0.80/1.12 89 -root(A,B) | atomic(B) | occurrence_of(f11(B,A),B) # label(sos_26) # label(axiom). [clausify(27)].
% 0.80/1.12 Derived: atomic(A) | occurrence_of(f11(A,f5(B,C,A)),A) | -min_precedes(B,C,A). [resolve(89,a,82,b)].
% 0.80/1.12 Derived: atomic(A) | occurrence_of(f11(A,B),A) | -atocc(B,A) | -legal(B). [resolve(89,a,86,c)].
% 0.80/1.12 Derived: atomic(A) | occurrence_of(f11(A,B),A) | -leaf(B,A) | min_precedes(f6(B,A),B,A). [resolve(89,a,87,b)].
% 0.80/1.12 90 -root(A,B) | atomic(B) | subactivity_occurrence(A,f11(B,A)) # label(sos_26) # label(axiom). [clausify(27)].
% 0.80/1.12 Derived: atomic(A) | subactivity_occurrence(f5(B,C,A),f11(A,f5(B,C,A))) | -min_precedes(B,C,A). [resolve(90,a,82,b)].
% 0.80/1.12 Derived: atomic(A) | subactivity_occurrence(B,f11(A,B)) | -atocc(B,A) | -legal(B). [resolve(90,a,86,c)].
% 0.80/1.12 Derived: atomic(A) | subactivity_occurrence(B,f11(A,B)) | -leaf(B,A) | min_precedes(f6(B,A),B,A). [resolve(90,a,87,b)].
% 0.80/1.12 91 -occurrence_of(A,B) | atomic(B) | root(f12(B,A),B) # label(sos_27) # label(axiom). [clausify(28)].
% 0.80/1.12 Derived: -occurrence_of(A,B) | atomic(B) | atocc(f12(B,A),f4(B,f12(B,A))). [resolve(91,c,83,a)].
% 0.80/1.12 Derived: -occurrence_of(A,B) | atomic(B) | -min_precedes(C,f12(B,A),B). [resolve(91,c,84,b)].
% 0.80/1.12 Derived: -occurrence_of(A,B) | atomic(B) | legal(f12(B,A)). [resolve(91,c,85,a)].
% 0.80/1.12 Derived: -occurrence_of(A,B) | atomic(B) | leaf(f12(B,A),B) | min_precedes(f12(B,A),f7(f12(B,A),B),B). [resolve(91,c,88,b)].
% 0.80/1.12 Derived: -occurrence_of(A,B) | atomic(B) | atomic(B) | occurrence_of(f11(B,f12(B,A)),B). [resolve(91,c,89,a)].
% 0.80/1.12 Derived: -occurrence_of(A,B) | atomic(B) | atomic(B) | subactivity_occurrence(f12(B,A),f11(B,f12(B,A))). [resolve(91,c,90,a)].
% 0.80/1.12 92 -root_occ(A,B) | root(A,f14(A,B)) # label(sos_33) # label(axiom). [clausify(34)].
% 0.80/1.12 Derived: -root_occ(A,B) | atocc(A,f4(f14(A,B),A)). [resolve(92,b,83,a)].
% 0.80/1.12 Derived: -root_occ(A,B) | -min_precedes(C,A,f14(A,B)). [resolve(92,b,84,b)].
% 0.80/1.12 Derived: -root_occ(A,B) | legal(A). [resolve(92,b,85,a)].
% 0.80/1.12 Derived: -root_occ(A,B) | leaf(A,f14(A,B)) | min_precedes(A,f7(A,f14(A,B)),f14(A,B)). [resolve(92,b,88,b)].
% 0.80/1.12 Derived: -root_occ(A,B) | atomic(f14(A,B)) | occurrence_of(f11(f14(A,B),A),f14(A,B)). [resolve(92,b,89,a)].
% 0.80/1.12 Derived: -root_occ(A,B) | atomic(f14(A,B)) | subactivity_occurrence(A,f11(f14(A,B),A)). [resolve(92,b,90,a)].
% 0.80/1.12 93 root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -root(A,C) # label(sos_33) # label(axiom). [clausify(34)].
% 0.80/1.12 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(93,d,82,b)].
% 0.80/1.12 Derived: root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -atocc(A,C) | -legal(A). [resolve(93,d,86,c)].
% 0.80/1.12 Derived: root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -leaf(A,C) | min_precedes(f6(A,C),A,C). [resolve(93,d,87,b)].
% 0.80/1.12 Derived: root_occ(f12(A,B),C) | -occurrence_of(C,A) | -subactivity_occurrence(f12(A,B),C) | -occurrence_of(B,A) | atomic(A). [resolve(93,d,91,c)].
% 0.80/1.12 Derived: root_occ(A,B) | -occurrence_of(B,f14(A,C)) | -subactivity_occurrence(A,B) | -root_occ(A,C). [resolve(93,d,92,b)].
% 0.80/1.12 94 atocc(A,f4(B,C)) | -atomic(B) | -occurrence_of(A,B) | -root(C,B). [resolve(69,b,72,b)].
% 0.80/1.12 Derived: atocc(A,f4(B,f5(C,D,B))) | -atomic(B) | -occurrence_of(A,B) | -min_precedes(C,D,B). [resolve(94,d,82,b)].
% 0.80/1.12 Derived: atocc(A,f4(B,C)) | -atomic(B) | -occurrence_of(A,B) | -atocc(C,B) | -legal(C). [resolve(94,d,86,c)].
% 0.80/1.12 Derived: atocc(A,f4(B,C)) | -atomic(B) | -occurrence_of(A,B) | -leaf(C,B) | min_precedes(f6(C,B),C,B). [resolve(94,d,87,b)].
% 0.80/1.12 Derived: atocc(A,f4(f14(B,C),B)) | -atomic(f14(B,C)) | -occurrence_of(A,f14(B,C)) | -root_occ(B,C). [resolve(94,d,92,b)].
% 0.80/1.12 95 -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(75,c,72,b)].
% 0.80/1.12 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(95,e,82,b)].
% 0.80/1.12 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(95,e,86,c)].
% 0.80/1.12 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(95,e,87,b)].
% 0.80/1.12 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(95,e,91,c)].
% 0.80/1.12 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(95,e,92,b)].
% 0.80/1.12 96 -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(76,c,72,b)].
% 0.80/1.12 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(96,e,82,b)].
% 0.80/1.12 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(96,e,86,c)].
% 0.80/1.12 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(96,e,87,b)].
% 0.80/1.12 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(96,e,91,c)].
% 0.80/1.12 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(96,e,92,b)].
% 0.80/1.12 97 leaf(A,B) | -min_precedes(C,A,B) | min_precedes(A,f7(A,B),B) # label(sos_21) # label(axiom). [clausify(22)].
% 0.80/1.12 98 -leaf(A,B) | -min_precedes(A,C,B) # label(sos_21) # label(axiom). [clausify(22)].
% 0.80/1.12 Derived: -min_precedes(A,B,C) | min_precedes(B,f7(B,C),C) | -min_precedes(B,D,C). [resolve(97,a,98,a)].
% 0.80/1.12 99 -leaf_occ(A,B) | leaf(A,f15(A,B)) # label(sos_34) # label(axiom). [clausify(35)].
% 0.80/1.12 Derived: -leaf_occ(A,B) | -min_precedes(A,C,f15(A,B)). [resolve(99,b,98,a)].
% 0.80/1.12 100 leaf_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -leaf(A,C) # label(sos_34) # label(axiom). [clausify(35)].
% 0.80/1.12 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(100,d,97,a)].
% 0.80/1.12 Derived: leaf_occ(A,B) | -occurrence_of(B,f15(A,C)) | -subactivity_occurrence(A,B) | -leaf_occ(A,C). [resolve(100,d,99,b)].
% 0.80/1.12 101 -leaf(A,B) | atomic(B) | occurrence_of(f16(A,B),B) # label(sos_45) # label(axiom). [clausify(46)].
% 0.80/1.12 Derived: atomic(A) | occurrence_of(f16(B,A),A) | -min_precedes(C,B,A) | min_precedes(B,f7(B,A),A). [resolve(101,a,97,a)].
% 0.80/1.12 Derived: atomic(f15(A,B)) | occurrence_of(f16(A,f15(A,B)),f15(A,B)) | -leaf_occ(A,B). [resolve(101,a,99,b)].
% 0.80/1.12 102 -leaf(A,B) | atomic(B) | leaf_occ(A,f16(A,B)) # label(sos_45) # label(axiom). [clausify(46)].
% 0.80/1.12 Derived: atomic(A) | leaf_occ(B,f16(B,A)) | -min_precedes(C,B,A) | min_precedes(B,f7(B,A),A). [resolve(102,a,97,a)].
% 0.80/1.12 Derived: atomic(f15(A,B)) | leaf_occ(A,f16(A,f15(A,B))) | -leaf_occ(A,B). [resolve(102,a,99,b)].
% 0.80/1.12 103 -leaf(A,B) | min_precedes(f6(A,B),A,B) | atocc(A,f4(B,A)). [resolve(87,b,83,a)].
% 0.80/1.12 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(103,a,97,a)].
% 0.80/1.12 Derived: min_precedes(f6(A,f15(A,B)),A,f15(A,B)) | atocc(A,f4(f15(A,B),A)) | -leaf_occ(A,B). [resolve(103,a,99,b)].
% 0.80/1.12 104 -leaf(A,B) | min_precedes(f6(A,B),A,B) | -min_precedes(C,A,B). [resolve(87,b,84,b)].
% 0.80/1.12 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(104,a,97,a)].
% 0.80/1.12 Derived: min_precedes(f6(A,f15(A,B)),A,f15(A,B)) | -min_precedes(C,A,f15(A,B)) | -leaf_occ(A,B). [resolve(104,a,99,b)].
% 0.80/1.12 105 -leaf(A,B) | min_precedes(f6(A,B),A,B) | legal(A). [resolve(87,b,85,a)].
% 0.80/1.12 Derived: min_precedes(f6(A,f15(A,B)),A,f15(A,B)) | legal(A) | -leaf_occ(A,B). [resolve(105,a,99,b)].
% 0.80/1.12 106 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(88,b,82,b)].
% 0.80/1.12 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(106,a,98,a)].
% 0.80/1.12 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(106,a,100,d)].
% 0.80/1.12 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(106,a,101,a)].
% 0.80/1.12 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(106,a,102,a)].
% 0.80/1.12 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(106,a,103,a)].
% 0.80/1.12 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(106,a,105,a)].
% 0.80/1.12 107 leaf(A,B) | min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A). [resolve(88,b,86,c)].
% 0.80/1.12 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A) | -min_precedes(A,C,B). [resolve(107,a,98,a)].
% 0.80/1.12 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(107,a,100,d)].
% 0.80/1.12 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A) | atomic(B) | occurrence_of(f16(A,B),B). [resolve(107,a,101,a)].
% 0.80/1.12 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A) | atomic(B) | leaf_occ(A,f16(A,B)). [resolve(107,a,102,a)].
% 0.80/1.12 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(107,a,103,a)].
% 0.80/1.12 108 atomic(A) | occurrence_of(f11(A,B),A) | -leaf(B,A) | min_precedes(f6(B,A),B,A). [resolve(89,a,87,b)].
% 0.80/1.12 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(108,c,99,b)].
% 0.80/1.12 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(108,c,106,a)].
% 0.80/1.12 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(108,c,107,a)].
% 0.80/1.12 109 atomic(A) | subactivity_occurrence(B,f11(A,B)) | -leaf(B,A) | min_precedes(f6(B,A),B,A). [resolve(90,a,87,b)].
% 0.80/1.12 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(109,c,99,b)].
% 0.80/1.12 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(109,c,106,a)].
% 0.80/1.12 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(109,c,107,a)].
% 0.80/1.12 110 -occurrence_of(A,B) | atomic(B) | leaf(f12(B,A),B) | min_precedes(f12(B,A),f7(f12(B,A),B),B). [resolve(91,c,88,b)].
% 0.80/1.12 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(110,c,98,a)].
% 0.80/1.12 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(110,c,100,d)].
% 0.80/1.12 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(110,c,101,a)].
% 0.80/1.12 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(110,c,102,a)].
% 0.80/1.12 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(110,c,103,a)].
% 0.80/1.12 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(110,c,105,a)].
% 0.80/1.12 111 -root_occ(A,B) | leaf(A,f14(A,B)) | min_precedes(A,f7(A,f14(A,B)),f14(A,B)). [resolve(92,b,88,b)].
% 0.80/1.12 Derived: -root_occ(A,B) | min_precedes(A,f7(A,f14(A,B)),f14(A,B)) | -min_precedes(A,C,f14(A,B)). [resolve(111,b,98,a)].
% 0.80/1.12 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(111,b,100,d)].
% 0.80/1.12 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(111,b,101,a)].
% 0.80/1.12 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(111,b,102,a)].
% 0.80/1.12 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(111,b,103,a)].
% 0.80/1.12 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(111,b,105,a)].
% 0.80/1.12 112 root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -leaf(A,C) | min_precedes(f6(A,C),A,C). [resolve(93,d,87,b)].
% 0.80/1.12 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(112,d,99,b)].
% 0.80/1.12 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(112,d,106,a)].
% 0.80/1.12 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(112,d,107,a)].
% 0.80/1.12 113 atocc(A,f4(B,C)) | -atomic(B) | -occurrence_of(A,B) | -leaf(C,B) | min_precedes(f6(C,B),C,B). [resolve(94,d,87,b)].
% 0.80/1.12 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(113,d,99,b)].
% 0.80/1.12 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(113,d,106,a)].
% 0.80/1.12 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(113,d,107,a)].
% 0.80/1.12 114 -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(95,e,87,b)].
% 0.80/1.12 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(114,e,99,b)].
% 0.80/1.12 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(114,e,106,a)].
% 49.15/49.45 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(114,e,107,a)].
% 49.15/49.45 115 -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(96,e,87,b)].
% 49.15/49.45 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(115,e,99,b)].
% 49.15/49.45 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(115,e,106,a)].
% 49.15/49.45 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(115,e,107,a)].
% 49.15/49.45
% 49.15/49.45 ============================== end predicate elimination =============
% 49.15/49.45
% 49.15/49.45 Auto_denials: (non-Horn, no changes).
% 49.15/49.45
% 49.15/49.45 Term ordering decisions:
% 49.15/49.45 Function symbol KB weights: tptp0=1. tptp1=1. tptp2=1. tptp3=1. tptp4=1. c1=1. f4=1. f6=1. f7=1. f9=1. f11=1. f12=1. f14=1. f15=1. f16=1. f19=1. f1=1. f17=1. f18=1. f2=1. f3=1. f5=1. f8=1. f10=1. f13=1.
% 49.15/49.45
% 49.15/49.45 ============================== end of process initial clauses ========
% 49.15/49.45
% 49.15/49.45 ============================== CLAUSES FOR SEARCH ====================
% 49.15/49.45
% 49.15/49.45 ============================== end of clauses for search =============
% 49.15/49.45
% 49.15/49.45 ============================== SEARCH ================================
% 49.15/49.45
% 49.15/49.45 % Starting search at 0.06 seconds.
% 49.15/49.45
% 49.15/49.45 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 29 (0.00 of 0.29 sec).
% 49.15/49.45
% 49.15/49.45 Low Water (keep): wt=55.000, iters=3412
% 49.15/49.45
% 49.15/49.45 Low Water (keep): wt=54.000, iters=3372
% 49.15/49.45
% 49.15/49.45 Low Water (keep): wt=53.000, iters=3360
% 49.15/49.45
% 49.15/49.45 Low Water (keep): wt=51.000, iters=3337
% 49.15/49.45
% 49.15/49.45 Low Water (keep): wt=50.000, iters=3345
% 49.15/49.45
% 49.15/49.45 Low Water (keep): wt=48.000, iters=3371
% 49.15/49.45
% 49.15/49.45 Low Water (keep): wt=47.000, iters=3353
% 49.15/49.45
% 49.15/49.45 Low Water (keep): wt=46.000, iters=3486
% 49.15/49.45
% 49.15/49.45 Low Water (keep): wt=45.000, iters=3382
% 49.15/49.45
% 49.15/49.45 Low Water (keep): wt=44.000, iters=3393
% 49.15/49.45
% 49.15/49.45 Low Water (keep): wt=43.000, iters=3790
% 49.15/49.45
% 49.15/49.45 Low Water (keep): wt=41.000, iters=3515
% 49.15/49.45
% 49.15/49.45 Low Water (keep): wt=40.000, iters=3429
% 49.15/49.45
% 49.15/49.45 Low Water (keep): wt=39.000, iters=3727
% 49.15/49.45
% 49.15/49.45 Low Water (keep): wt=38.000, iters=3548
% 49.15/49.45
% 49.15/49.45 Low Water (keep): wt=37.000, iters=3407
% 49.15/49.45
% 49.15/49.45 Low Water (keep): wt=36.000, iters=3389
% 49.15/49.45
% 49.15/49.45 Low Water (keep): wt=35.000, iters=3403
% 49.15/49.45
% 49.15/49.45 Low Water (keep): wt=34.000, iters=3403
% 49.15/49.45
% 49.15/49.45 Low Water (keep): wt=33.000, iters=3523
% 49.15/49.45
% 49.15/49.45 Low Water (keep): wt=32.000, iters=3430
% 49.15/49.45
% 49.15/49.45 Low Water (keep): wt=31.000, iters=3553
% 49.15/49.45
% 49.15/49.45 Low Water (keep): wt=30.000, iters=3580
% 49.15/49.45
% 49.15/49.45 Low Water (keep): wt=29.000, iters=3728
% 49.15/49.45
% 49.15/49.45 Low Water (displace): id=8728, wt=144.000
% 49.15/49.45
% 49.15/49.45 Low Water (displace): id=9935, wt=126.000
% 49.15/49.45
% 49.15/49.45 Low Water (displace): id=8438, wt=121.000
% 49.15/49.45
% 49.15/49.45 Low Water (displace): id=24333, wt=31.000
% 49.15/49.45
% 49.15/49.45 Low Water (displace): id=24579, wt=30.000
% 49.15/49.45
% 49.15/49.45 Low Water (displace): id=24664, wt=28.000
% 49.15/49.45
% 49.15/49.45 Low Water (keep): wt=28.000, iters=3406
% 49.15/49.45
% 49.15/49.45 ============================== PROOF =================================
% 49.15/49.45 % SZS status Theorem
% 49.15/49.45 % SZS output start Refutation
% 49.15/49.45
% 49.15/49.45 % Proof 1 at 47.57 (+ 0.79) seconds.
% 49.15/49.45 % Length of proof is 107.
% 49.15/49.45 % Level of proof is 23.
% 49.15/49.45 % Maximum clause weight is 29.000.
% 49.15/49.45 % Given clauses 14883.
% 49.15/49.45
% 49.15/49.45 1 (all X0 all X1 (occurrence_of(X1,X0) -> activity(X0) & activity_occurrence(X1))) # label(sos) # label(axiom) # label(non_clause). [assumption].
% 49.15/49.45 2 (all X2 (activity_occurrence(X2) -> (exists X3 (activity(X3) & occurrence_of(X2,X3))))) # label(sos_01) # label(axiom) # label(non_clause). [assumption].
% 49.15/49.45 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].
% 49.15/49.45 8 (all X16 all X17 (occurrence_of(X16,X17) -> (arboreal(X16) <-> atomic(X17)))) # label(sos_07) # label(axiom) # label(non_clause). [assumption].
% 49.15/49.45 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].
% 49.15/49.45 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].
% 49.15/49.45 25 (all X67 all X68 (subactivity_occurrence(X67,X68) -> activity_occurrence(X67) & activity_occurrence(X68))) # label(sos_24) # label(axiom) # label(non_clause). [assumption].
% 49.15/49.45 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].
% 49.15/49.45 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].
% 49.15/49.45 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].
% 49.15/49.45 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].
% 49.15/49.45 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].
% 49.15/49.45 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].
% 49.15/49.45 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].
% 49.15/49.45 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].
% 49.15/49.45 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].
% 49.15/49.45 51 (all X164 all X165 (occurrence_of(X165,tptp0) & subactivity_occurrence(X164,X165) & arboreal(X164) & -leaf_occ(X164,X165) -> root_occ(X164,X165))) # label(sos_62) # label(axiom) # label(non_clause). [assumption].
% 49.15/49.45 52 (all X166 all X167 (occurrence_of(X167,tptp0) & subactivity_occurrence(X166,X167) & arboreal(X166) & -leaf_occ(X166,X167) -> (exists X168 (occurrence_of(X168,tptp1) & next_subocc(X166,X168,tptp0))))) # label(sos_63) # label(axiom) # label(non_clause). [assumption].
% 49.15/49.45 53 --(exists X169 occurrence_of(X169,tptp0)) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 49.15/49.45 58 -activity_occurrence(A) | occurrence_of(A,f1(A)) # label(sos_01) # label(axiom). [clausify(2)].
% 49.15/49.45 59 -occurrence_of(A,B) | activity_occurrence(A) # label(sos) # label(axiom). [clausify(1)].
% 49.15/49.45 60 -subactivity_occurrence(A,B) | activity_occurrence(A) # label(sos_24) # label(axiom). [clausify(25)].
% 49.15/49.45 97 leaf(A,B) | -min_precedes(C,A,B) | min_precedes(A,f7(A,B),B) # label(sos_21) # label(axiom). [clausify(22)].
% 49.15/49.45 98 -leaf(A,B) | -min_precedes(A,C,B) # label(sos_21) # label(axiom). [clausify(22)].
% 49.15/49.45 99 -leaf_occ(A,B) | leaf(A,f15(A,B)) # label(sos_34) # label(axiom). [clausify(35)].
% 49.15/49.45 101 -leaf(A,B) | atomic(B) | occurrence_of(f16(A,B),B) # label(sos_45) # label(axiom). [clausify(46)].
% 49.15/49.45 102 -leaf(A,B) | atomic(B) | leaf_occ(A,f16(A,B)) # label(sos_45) # label(axiom). [clausify(46)].
% 49.15/49.45 116 -occurrence_of(A,B) | -occurrence_of(A,C) | C = B # label(sos_02) # label(axiom). [clausify(3)].
% 49.15/49.45 121 -occurrence_of(A,B) | arboreal(A) | -atomic(B) # label(sos_07) # label(axiom). [clausify(8)].
% 49.15/49.45 128 -next_subocc(A,B,C) | min_precedes(A,B,C) # label(sos_22) # label(axiom). [clausify(23)].
% 49.15/49.45 134 -min_precedes(A,B,C) | occurrence_of(f10(C,A,B),C) # label(sos_25) # label(axiom). [clausify(26)].
% 49.15/49.45 136 -min_precedes(A,B,C) | subactivity_occurrence(B,f10(C,A,B)) # label(sos_25) # label(axiom). [clausify(26)].
% 49.15/49.45 142 -root_occ(A,B) | subactivity_occurrence(A,B) # label(sos_33) # label(axiom). [clausify(34)].
% 49.15/49.45 143 -leaf_occ(A,B) | occurrence_of(B,f15(A,B)) # label(sos_34) # label(axiom). [clausify(35)].
% 49.15/49.45 144 -leaf_occ(A,B) | subactivity_occurrence(A,B) # label(sos_34) # label(axiom). [clausify(35)].
% 49.15/49.45 146 -occurrence_of(A,B) | atomic(B) | -leaf_occ(C,A) | -leaf_occ(D,A) | D = C # label(sos_36) # label(axiom). [clausify(37)].
% 49.15/49.45 147 -occurrence_of(A,B) | -leaf_occ(C,A) | -min_precedes(C,D,B) # label(sos_37) # label(axiom). [clausify(38)].
% 49.15/49.45 148 -occurrence_of(A,B) | -root_occ(C,A) | -min_precedes(D,C,B) # label(sos_38) # label(axiom). [clausify(39)].
% 49.15/49.45 154 -next_subocc(A,B,C) | arboreal(A) # label(sos_44) # label(axiom). [clausify(45)].
% 49.15/49.45 160 -occurrence_of(A,tptp0) | root_occ(f17(A),A) # label(sos_49) # label(axiom). [clausify(50)].
% 49.15/49.45 161 -occurrence_of(A,tptp0) | occurrence_of(f18(A),tptp3) | occurrence_of(f18(A),tptp2) # label(sos_49) # label(axiom). [clausify(50)].
% 49.15/49.45 162 -occurrence_of(A,tptp0) | leaf_occ(f18(A),A) # label(sos_49) # label(axiom). [clausify(50)].
% 49.15/49.45 163 -occurrence_of(A,tptp0) | next_subocc(f17(A),f18(A),tptp0) # label(sos_49) # label(axiom). [clausify(50)].
% 49.15/49.45 164 -atomic(tptp0) # label(sos_51) # label(axiom). [assumption].
% 49.15/49.45 168 atomic(tptp1) # label(sos_55) # label(axiom). [assumption].
% 49.15/49.45 172 tptp1 != tptp3 # label(sos_59) # label(axiom). [assumption].
% 49.15/49.45 173 tptp3 != tptp1. [copy(172),flip(a)].
% 49.15/49.45 174 tptp1 != tptp2 # label(sos_60) # label(axiom). [assumption].
% 49.15/49.45 175 tptp2 != tptp1. [copy(174),flip(a)].
% 49.15/49.45 177 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | root_occ(B,A) # label(sos_62) # label(axiom). [clausify(51)].
% 49.15/49.45 178 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | occurrence_of(f19(B,A),tptp1) # label(sos_63) # label(axiom). [clausify(52)].
% 49.15/49.45 179 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | next_subocc(B,f19(B,A),tptp0) # label(sos_63) # label(axiom). [clausify(52)].
% 49.15/49.45 180 occurrence_of(c1,tptp0) # label(goals) # label(negated_conjecture). [clausify(53)].
% 49.15/49.45 181 occurrence_of(A,f1(A)) | -occurrence_of(A,B). [resolve(58,a,59,b)].
% 49.15/49.45 182 -subactivity_occurrence(A,B) | occurrence_of(A,f1(A)). [resolve(60,b,58,a)].
% 49.15/49.45 239 -leaf_occ(A,B) | -min_precedes(A,C,f15(A,B)). [resolve(99,b,98,a)].
% 49.15/49.45 242 atomic(A) | occurrence_of(f16(B,A),A) | -min_precedes(C,B,A) | min_precedes(B,f7(B,A),A). [resolve(101,a,97,a)].
% 49.15/49.45 244 atomic(A) | leaf_occ(B,f16(B,A)) | -min_precedes(C,B,A) | min_precedes(B,f7(B,A),A). [resolve(102,a,97,a)].
% 49.15/49.45 297 next_subocc(f17(c1),f18(c1),tptp0). [resolve(180,a,163,a)].
% 49.15/49.45 300 root_occ(f17(c1),c1). [resolve(180,a,160,a)].
% 49.15/49.45 317 arboreal(f17(c1)). [resolve(297,a,154,a)].
% 49.15/49.45 321 min_precedes(f17(c1),f18(c1),tptp0). [resolve(297,a,128,a)].
% 49.15/49.45 351 subactivity_occurrence(f17(c1),c1). [resolve(300,a,142,a)].
% 49.15/49.45 423 leaf_occ(f17(c1),c1) | next_subocc(f17(c1),f19(f17(c1),c1),tptp0). [resolve(351,a,179,b),unit_del(a,180),unit_del(b,317)].
% 49.15/49.45 424 leaf_occ(f17(c1),c1) | occurrence_of(f19(f17(c1),c1),tptp1). [resolve(351,a,178,b),unit_del(a,180),unit_del(b,317)].
% 49.15/49.45 495 -occurrence_of(A,tptp0) | -leaf_occ(f17(c1),A). [resolve(321,a,147,c)].
% 49.15/49.45 1356 occurrence_of(f19(f17(c1),c1),tptp1). [resolve(424,a,495,b),unit_del(b,180)].
% 49.15/49.45 1361 occurrence_of(f19(f17(c1),c1),f1(f19(f17(c1),c1))). [resolve(1356,a,181,b)].
% 49.15/49.45 1362 arboreal(f19(f17(c1),c1)). [resolve(1356,a,121,a),unit_del(b,168)].
% 49.15/49.45 1363 -occurrence_of(f19(f17(c1),c1),A) | tptp1 = A. [resolve(1356,a,116,b)].
% 49.15/49.45 1764 f1(f19(f17(c1),c1)) = tptp1. [resolve(1361,a,1363,a),flip(a)].
% 49.15/49.45 1915 leaf_occ(f17(c1),c1) | min_precedes(f17(c1),f19(f17(c1),c1),tptp0). [resolve(423,b,128,a)].
% 49.15/49.45 3124 leaf_occ(f17(c1),c1) | leaf_occ(f19(f17(c1),c1),f16(f19(f17(c1),c1),tptp0)) | min_precedes(f19(f17(c1),c1),f7(f19(f17(c1),c1),tptp0),tptp0). [resolve(1915,b,244,c),unit_del(b,164)].
% 49.15/49.45 3125 leaf_occ(f17(c1),c1) | occurrence_of(f16(f19(f17(c1),c1),tptp0),tptp0) | min_precedes(f19(f17(c1),c1),f7(f19(f17(c1),c1),tptp0),tptp0). [resolve(1915,b,242,c),unit_del(b,164)].
% 49.15/49.45 3154 leaf_occ(f17(c1),c1) | -occurrence_of(A,tptp0) | -root_occ(f19(f17(c1),c1),A). [resolve(1915,b,148,c)].
% 49.15/49.45 3156 leaf_occ(f17(c1),c1) | subactivity_occurrence(f19(f17(c1),c1),f10(tptp0,f17(c1),f19(f17(c1),c1))). [resolve(1915,b,136,a)].
% 49.15/49.45 3158 leaf_occ(f17(c1),c1) | occurrence_of(f10(tptp0,f17(c1),f19(f17(c1),c1)),tptp0). [resolve(1915,b,134,a)].
% 49.15/49.45 4656 occurrence_of(f10(tptp0,f17(c1),f19(f17(c1),c1)),tptp0). [resolve(3158,a,495,b),unit_del(b,180)].
% 49.15/49.45 9560 subactivity_occurrence(f19(f17(c1),c1),f10(tptp0,f17(c1),f19(f17(c1),c1))). [resolve(3156,a,495,b),unit_del(b,180)].
% 49.15/49.45 9572 leaf_occ(f19(f17(c1),c1),f10(tptp0,f17(c1),f19(f17(c1),c1))) | root_occ(f19(f17(c1),c1),f10(tptp0,f17(c1),f19(f17(c1),c1))). [resolve(9560,a,177,b),unit_del(a,4656),unit_del(b,1362)].
% 49.15/49.45 18830 leaf_occ(f17(c1),c1) | leaf_occ(f19(f17(c1),c1),f16(f19(f17(c1),c1),tptp0)) | -occurrence_of(A,tptp0) | -leaf_occ(f19(f17(c1),c1),A). [resolve(3124,c,147,c)].
% 49.15/49.45 18847 leaf_occ(f17(c1),c1) | occurrence_of(f16(f19(f17(c1),c1),tptp0),tptp0) | -occurrence_of(A,tptp0) | -leaf_occ(f19(f17(c1),c1),A). [resolve(3125,c,147,c)].
% 49.15/49.45 28685 leaf_occ(f19(f17(c1),c1),f10(tptp0,f17(c1),f19(f17(c1),c1))) | leaf_occ(f17(c1),c1). [resolve(9572,b,3154,c),unit_del(c,4656)].
% 49.15/49.45 28687 leaf_occ(f17(c1),c1) | occurrence_of(f16(f19(f17(c1),c1),tptp0),tptp0). [resolve(28685,a,18847,d),merge(b),unit_del(c,4656)].
% 49.15/49.45 28688 leaf_occ(f17(c1),c1) | leaf_occ(f19(f17(c1),c1),f16(f19(f17(c1),c1),tptp0)). [resolve(28685,a,18830,d),merge(b),unit_del(c,4656)].
% 49.15/49.45 28703 occurrence_of(f16(f19(f17(c1),c1),tptp0),tptp0). [resolve(28687,a,495,b),unit_del(b,180)].
% 49.15/49.45 28725 next_subocc(f17(f16(f19(f17(c1),c1),tptp0)),f18(f16(f19(f17(c1),c1),tptp0)),tptp0). [resolve(28703,a,163,a)].
% 49.15/49.45 28726 leaf_occ(f18(f16(f19(f17(c1),c1),tptp0)),f16(f19(f17(c1),c1),tptp0)). [resolve(28703,a,162,a)].
% 49.15/49.45 28732 -occurrence_of(f16(f19(f17(c1),c1),tptp0),A) | tptp0 = A. [resolve(28703,a,116,b)].
% 49.15/49.45 28866 -occurrence_of(f16(f19(f17(c1),c1),tptp0),A) | atomic(A) | -leaf_occ(B,f16(f19(f17(c1),c1),tptp0)) | f18(f16(f19(f17(c1),c1),tptp0)) = B. [resolve(28726,a,146,d)].
% 49.15/49.45 28868 occurrence_of(f16(f19(f17(c1),c1),tptp0),f15(f18(f16(f19(f17(c1),c1),tptp0)),f16(f19(f17(c1),c1),tptp0))). [resolve(28726,a,143,a)].
% 49.15/49.45 29059 min_precedes(f17(f16(f19(f17(c1),c1),tptp0)),f18(f16(f19(f17(c1),c1),tptp0)),tptp0). [resolve(28725,a,128,a)].
% 49.15/49.45 29094 occurrence_of(f16(f18(f16(f19(f17(c1),c1),tptp0)),tptp0),tptp0) | min_precedes(f18(f16(f19(f17(c1),c1),tptp0)),f7(f18(f16(f19(f17(c1),c1),tptp0)),tptp0),tptp0). [resolve(29059,a,242,c),unit_del(a,164)].
% 49.15/49.45 29725 f15(f18(f16(f19(f17(c1),c1),tptp0)),f16(f19(f17(c1),c1),tptp0)) = tptp0. [resolve(28868,a,28732,a),flip(a)].
% 49.15/49.45 29726 -min_precedes(f18(f16(f19(f17(c1),c1),tptp0)),A,tptp0). [para(29725(a,1),239(b,3)),unit_del(a,28726)].
% 49.15/49.45 29732 occurrence_of(f16(f18(f16(f19(f17(c1),c1),tptp0)),tptp0),tptp0). [back_unit_del(29094),unit_del(b,29726)].
% 49.15/49.45 29740 leaf_occ(f18(f16(f18(f16(f19(f17(c1),c1),tptp0)),tptp0)),f16(f18(f16(f19(f17(c1),c1),tptp0)),tptp0)). [resolve(29732,a,162,a)].
% 49.15/49.45 29741 occurrence_of(f18(f16(f18(f16(f19(f17(c1),c1),tptp0)),tptp0)),tptp3) | occurrence_of(f18(f16(f18(f16(f19(f17(c1),c1),tptp0)),tptp0)),tptp2). [resolve(29732,a,161,a)].
% 49.15/49.45 29874 subactivity_occurrence(f18(f16(f18(f16(f19(f17(c1),c1),tptp0)),tptp0)),f16(f18(f16(f19(f17(c1),c1),tptp0)),tptp0)). [resolve(29740,a,144,a)].
% 49.15/49.45 29907 occurrence_of(f18(f16(f18(f16(f19(f17(c1),c1),tptp0)),tptp0)),f1(f18(f16(f18(f16(f19(f17(c1),c1),tptp0)),tptp0)))). [resolve(29874,a,182,a)].
% 49.15/49.45 30012 -occurrence_of(f18(f16(f18(f16(f19(f17(c1),c1),tptp0)),tptp0)),A) | f1(f18(f16(f18(f16(f19(f17(c1),c1),tptp0)),tptp0))) = A. [resolve(29907,a,116,b)].
% 49.15/49.45 30400 f1(f18(f16(f18(f16(f19(f17(c1),c1),tptp0)),tptp0))) = tptp3 | occurrence_of(f18(f16(f18(f16(f19(f17(c1),c1),tptp0)),tptp0)),tptp2). [resolve(30012,a,29741,a)].
% 49.15/49.45 30473 f1(f18(f16(f18(f16(f19(f17(c1),c1),tptp0)),tptp0))) = tptp3 | f1(f18(f16(f18(f16(f19(f17(c1),c1),tptp0)),tptp0))) = tptp2. [resolve(30400,b,30012,a)].
% 49.15/49.45 33903 -occurrence_of(f16(f19(f17(c1),c1),tptp0),A) | atomic(A) | f18(f16(f19(f17(c1),c1),tptp0)) = f19(f17(c1),c1) | leaf_occ(f17(c1),c1). [resolve(28866,c,28688,b)].
% 49.15/49.45 33904 f18(f16(f19(f17(c1),c1),tptp0)) = f19(f17(c1),c1) | leaf_occ(f17(c1),c1). [resolve(33903,a,28703,a),unit_del(a,164)].
% 49.15/49.45 33908 f18(f16(f19(f17(c1),c1),tptp0)) = f19(f17(c1),c1). [resolve(33904,b,495,b),unit_del(b,180)].
% 49.15/49.45 33974 $F. [back_rewrite(30473),rewrite([33908(7),33908(7),1764(5),33908(10),33908(10),1764(8)]),flip(a),flip(b),unit_del(a,173),unit_del(b,175)].
% 49.15/49.45
% 49.15/49.45 % SZS output end Refutation
% 49.15/49.45 ============================== end of proof ==========================
% 49.15/49.45
% 49.15/49.45 ============================== STATISTICS ============================
% 49.15/49.45
% 49.15/49.45 Given=14883. Generated=1388891. Kept=33852. proofs=1.
% 49.15/49.45 Usable=12169. Sos=8743. Demods=240. Limbo=66, Disabled=13111. Hints=0.
% 49.15/49.45 Megabytes=52.01.
% 49.15/49.45 User_CPU=47.57, System_CPU=0.79, Wall_clock=49.
% 49.15/49.45
% 49.15/49.45 ============================== end of statistics =====================
% 49.15/49.45
% 49.15/49.45 ============================== end of search =========================
% 49.15/49.45
% 49.15/49.45 THEOREM PROVED
% 49.15/49.45 % SZS status Theorem
% 49.15/49.45
% 49.15/49.45 Exiting with 1 proof.
% 49.15/49.45
% 49.15/49.45 Process 2224 exit (max_proofs) Mon Jun 13 02:31:58 2022
% 49.15/49.45 Prover9 interrupted
%------------------------------------------------------------------------------