TSTP Solution File: PRO004+3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PRO004+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n022.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:05 EDT 2022
% Result : Theorem 21.68s 21.93s
% Output : Refutation 21.68s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : PRO004+3 : TPTP v8.1.0. Released v4.0.0.
% 0.13/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n022.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jun 13 01:01:03 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.44/1.05 ============================== Prover9 ===============================
% 0.44/1.05 Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.05 Process 4162 was started by sandbox2 on n022.cluster.edu,
% 0.44/1.05 Mon Jun 13 01:01:04 2022
% 0.44/1.05 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_4008_n022.cluster.edu".
% 0.44/1.05 ============================== end of head ===========================
% 0.44/1.05
% 0.44/1.05 ============================== INPUT =================================
% 0.44/1.05
% 0.44/1.05 % Reading from file /tmp/Prover9_4008_n022.cluster.edu
% 0.44/1.05
% 0.44/1.05 set(prolog_style_variables).
% 0.44/1.05 set(auto2).
% 0.44/1.05 % set(auto2) -> set(auto).
% 0.44/1.05 % set(auto) -> set(auto_inference).
% 0.44/1.05 % set(auto) -> set(auto_setup).
% 0.44/1.05 % set(auto_setup) -> set(predicate_elim).
% 0.44/1.05 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/1.05 % set(auto) -> set(auto_limits).
% 0.44/1.05 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/1.05 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/1.05 % set(auto) -> set(auto_denials).
% 0.44/1.05 % set(auto) -> set(auto_process).
% 0.44/1.05 % set(auto2) -> assign(new_constants, 1).
% 0.44/1.05 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/1.05 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/1.05 % set(auto2) -> assign(max_hours, 1).
% 0.44/1.05 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/1.05 % set(auto2) -> assign(max_seconds, 0).
% 0.44/1.05 % set(auto2) -> assign(max_minutes, 5).
% 0.44/1.05 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/1.05 % set(auto2) -> set(sort_initial_sos).
% 0.44/1.05 % set(auto2) -> assign(sos_limit, -1).
% 0.44/1.05 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/1.05 % set(auto2) -> assign(max_megs, 400).
% 0.44/1.05 % set(auto2) -> assign(stats, some).
% 0.44/1.05 % set(auto2) -> clear(echo_input).
% 0.44/1.05 % set(auto2) -> set(quiet).
% 0.44/1.05 % set(auto2) -> clear(print_initial_clauses).
% 0.44/1.05 % set(auto2) -> clear(print_given).
% 0.44/1.05 assign(lrs_ticks,-1).
% 0.44/1.05 assign(sos_limit,10000).
% 0.44/1.05 assign(order,kbo).
% 0.44/1.05 set(lex_order_vars).
% 0.44/1.05 clear(print_given).
% 0.44/1.05
% 0.44/1.05 % formulas(sos). % not echoed (66 formulas)
% 0.44/1.05
% 0.44/1.05 ============================== end of input ==========================
% 0.44/1.05
% 0.44/1.05 % From the command line: assign(max_seconds, 300).
% 0.44/1.05
% 0.44/1.05 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/1.05
% 0.44/1.05 % Formulas that are not ordinary clauses:
% 0.44/1.05 1 (all X0 all X1 (occurrence_of(X1,X0) -> activity(X0) & activity_occurrence(X1))) # label(sos) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.05 2 (all X2 (activity_occurrence(X2) -> (exists X3 (activity(X3) & occurrence_of(X2,X3))))) # label(sos_01) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.05 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.44/1.05 4 (all X7 (activity(X7) -> subactivity(X7,X7))) # label(sos_03) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.05 5 (all X8 all X9 (earlier(X8,X9) -> -earlier(X9,X8))) # label(sos_04) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.05 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.44/1.05 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.44/1.05 8 (all X16 all X17 (occurrence_of(X16,X17) -> (arboreal(X16) <-> atomic(X17)))) # label(sos_07) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.05 9 (all X18 (legal(X18) -> arboreal(X18))) # label(sos_08) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.05 10 (all X19 all X20 (legal(X19) & earlier(X20,X19) -> legal(X20))) # label(sos_09) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.05 11 (all X21 all X22 (precedes(X21,X22) <-> earlier(X21,X22) & legal(X22))) # label(sos_10) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.05 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.44/1.05 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.44/1.05 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.44/1.05 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.44/1.05 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.44/1.05 17 (all X41 all X42 (root(X41,X42) -> legal(X41))) # label(sos_16) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.05 18 (all X43 all X44 (atocc(X43,X44) & legal(X43) -> root(X43,X44))) # label(sos_17) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.05 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.44/1.05 20 (all X49 all X50 all X51 (min_precedes(X49,X50,X51) -> -atomic(X51))) # label(sos_19) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.05 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.44/1.05 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.44/1.05 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.44/1.05 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.44/1.05 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.44/1.05 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.44/1.05 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.44/1.05 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.44/1.05 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.44/1.05 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.44/1.05 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.44/1.05 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.44/1.05 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.44/1.05 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.44/1.05 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.44/1.05 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.44/1.05 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.44/1.05 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.44/1.05 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.44/1.05 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.44/1.05 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.44/1.05 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.44/1.05 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.44/1.05 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.44/1.05 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.44/1.05 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.44/1.05 47 (all X148 all X149 all X150 (min_precedes(X148,X149,X150) -> arboreal(X148))) # label(sos_46) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.05 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.44/1.05 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.44/1.05 50 (all X161 (occurrence_of(X161,tptp0) -> (exists X162 exists X163 (occurrence_of(X162,tptp4) & root_occ(X162,X161) & occurrence_of(X163,tptp3) & leaf_occ(X163,X161) & next_subocc(X162,X163,tptp0))))) # label(sos_49) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.05 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.44/1.05 52 (all X166 all X167 (occurrence_of(X167,tptp0) & subactivity_occurrence(X166,X167) & arboreal(X166) & -leaf_occ(X166,X167) -> root_occ(X166,X167))) # label(sos_63) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.05 53 (all X168 all X169 (occurrence_of(X169,tptp0) & subactivity_occurrence(X168,X169) & arboreal(X168) & -leaf_occ(X168,X169) -> (exists X170 (occurrence_of(X170,tptp1) & next_subocc(X168,X170,tptp0))))) # label(sos_64) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.05 54 --(exists X171 occurrence_of(X171,tptp0)) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.44/1.05
% 0.44/1.05 ============================== end of process non-clausal formulas ===
% 0.44/1.05
% 0.44/1.05 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/1.05
% 0.44/1.05 ============================== PREDICATE ELIMINATION =================
% 0.44/1.05 55 -activity(A) | subactivity(A,A) # label(sos_03) # label(axiom). [clausify(4)].
% 0.44/1.05 56 -occurrence_of(A,B) | activity(B) # label(sos) # label(axiom). [clausify(1)].
% 0.44/1.05 57 -activity_occurrence(A) | activity(f1(A)) # label(sos_01) # label(axiom). [clausify(2)].
% 0.44/1.05 Derived: subactivity(A,A) | -occurrence_of(B,A). [resolve(55,a,56,b)].
% 0.44/1.05 Derived: subactivity(f1(A),f1(A)) | -activity_occurrence(A). [resolve(55,a,57,b)].
% 0.44/1.05 58 activity(tptp0) # label(sos_50) # label(axiom). [assumption].
% 0.44/1.05 Derived: subactivity(tptp0,tptp0). [resolve(58,a,55,a)].
% 0.44/1.05 59 -activity_occurrence(A) | occurrence_of(A,f1(A)) # label(sos_01) # label(axiom). [clausify(2)].
% 0.44/1.05 60 -occurrence_of(A,B) | activity_occurrence(A) # label(sos) # label(axiom). [clausify(1)].
% 0.44/1.05 Derived: occurrence_of(A,f1(A)) | -occurrence_of(A,B). [resolve(59,a,60,b)].
% 0.44/1.05 61 -subactivity_occurrence(A,B) | activity_occurrence(A) # label(sos_24) # label(axiom). [clausify(25)].
% 0.44/1.05 Derived: -subactivity_occurrence(A,B) | occurrence_of(A,f1(A)). [resolve(61,b,59,a)].
% 0.44/1.05 62 -subactivity_occurrence(A,B) | activity_occurrence(B) # label(sos_24) # label(axiom). [clausify(25)].
% 0.44/1.05 Derived: -subactivity_occurrence(A,B) | occurrence_of(B,f1(B)). [resolve(62,b,59,a)].
% 0.44/1.05 63 subactivity(f1(A),f1(A)) | -activity_occurrence(A). [resolve(55,a,57,b)].
% 0.44/1.05 Derived: subactivity(f1(A),f1(A)) | -occurrence_of(A,B). [resolve(63,b,60,b)].
% 0.44/1.05 Derived: subactivity(f1(A),f1(A)) | -subactivity_occurrence(A,B). [resolve(63,b,61,b)].
% 0.44/1.05 Derived: subactivity(f1(A),f1(A)) | -subactivity_occurrence(B,A). [resolve(63,b,62,b)].
% 0.44/1.05 64 precedes(A,B) | -earlier(A,B) | -legal(B) # label(sos_10) # label(axiom). [clausify(11)].
% 0.44/1.05 65 -precedes(A,B) | earlier(A,B) # label(sos_10) # label(axiom). [clausify(11)].
% 0.44/1.05 66 -precedes(A,B) | legal(B) # label(sos_10) # label(axiom). [clausify(11)].
% 0.44/1.05 67 -min_precedes(A,B,C) | precedes(A,B) # label(sos_15) # label(axiom). [clausify(16)].
% 0.44/1.05 Derived: -min_precedes(A,B,C) | earlier(A,B). [resolve(67,b,65,a)].
% 0.44/1.05 Derived: -min_precedes(A,B,C) | legal(B). [resolve(67,b,66,a)].
% 0.44/1.05 68 -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.44/1.05 Derived: -min_precedes(A,B,C) | -min_precedes(A,D,C) | min_precedes(B,D,C) | -earlier(B,D) | -legal(D). [resolve(68,c,64,a)].
% 0.44/1.05 Derived: -min_precedes(A,B,C) | -min_precedes(A,D,C) | min_precedes(B,D,C) | -min_precedes(B,D,E). [resolve(68,c,67,b)].
% 0.44/1.05 69 -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.44/1.05 Derived: -min_precedes(A,B,C) | -min_precedes(D,B,C) | min_precedes(A,D,C) | -earlier(A,D) | -legal(D). [resolve(69,c,64,a)].
% 0.44/1.05 Derived: -min_precedes(A,B,C) | -min_precedes(D,B,C) | min_precedes(A,D,C) | -min_precedes(A,D,E). [resolve(69,c,67,b)].
% 0.44/1.05 70 atocc(A,B) | -subactivity(B,C) | -atomic(C) | -occurrence_of(A,C) # label(sos_23) # label(axiom). [clausify(24)].
% 0.44/1.05 71 -min_precedes(A,B,C) | subactivity(f2(C,A,B),C) # label(sos_11) # label(axiom). [clausify(12)].
% 0.44/1.05 72 -min_precedes(A,B,C) | subactivity(f3(C,A,B),C) # label(sos_11) # label(axiom). [clausify(12)].
% 0.44/1.05 73 -root(A,B) | subactivity(f4(B,A),B) # label(sos_12) # label(axiom). [clausify(13)].
% 0.44/1.05 74 -atocc(A,B) | subactivity(B,f9(A,B)) # label(sos_23) # label(axiom). [clausify(24)].
% 0.44/1.05 Derived: atocc(A,f2(B,C,D)) | -atomic(B) | -occurrence_of(A,B) | -min_precedes(C,D,B). [resolve(70,b,71,b)].
% 0.44/1.05 Derived: atocc(A,f3(B,C,D)) | -atomic(B) | -occurrence_of(A,B) | -min_precedes(C,D,B). [resolve(70,b,72,b)].
% 0.44/1.05 Derived: atocc(A,f4(B,C)) | -atomic(B) | -occurrence_of(A,B) | -root(C,B). [resolve(70,b,73,b)].
% 0.44/1.05 Derived: atocc(A,B) | -atomic(f9(C,B)) | -occurrence_of(A,f9(C,B)) | -atocc(C,B). [resolve(70,b,74,b)].
% 0.44/1.05 75 -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.44/1.05 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(75,e,70,b)].
% 0.44/1.05 76 -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.44/1.05 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(76,c,71,b)].
% 0.44/1.05 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(76,c,72,b)].
% 0.44/1.05 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(76,c,73,b)].
% 0.44/1.05 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(76,c,74,b)].
% 0.44/1.05 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(76,c,75,e)].
% 0.44/1.05 77 -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.44/1.05 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(77,c,71,b)].
% 0.44/1.05 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(77,c,72,b)].
% 0.44/1.05 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(77,c,73,b)].
% 0.44/1.05 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(77,c,74,b)].
% 0.44/1.05 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(77,c,75,e)].
% 0.44/1.05 78 subactivity(A,A) | -occurrence_of(B,A). [resolve(55,a,56,b)].
% 0.44/1.05 Derived: -occurrence_of(A,B) | atocc(C,B) | -atomic(B) | -occurrence_of(C,B). [resolve(78,a,70,b)].
% 0.44/1.05 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(78,a,76,c)].
% 0.44/1.05 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(78,a,77,c)].
% 0.44/1.05 79 subactivity(tptp0,tptp0). [resolve(58,a,55,a)].
% 0.44/1.05 80 subactivity(f1(A),f1(A)) | -occurrence_of(A,B). [resolve(63,b,60,b)].
% 0.44/1.05 81 subactivity(f1(A),f1(A)) | -subactivity_occurrence(A,B). [resolve(63,b,61,b)].
% 0.44/1.05 82 subactivity(f1(A),f1(A)) | -subactivity_occurrence(B,A). [resolve(63,b,62,b)].
% 0.44/1.05 83 -min_precedes(A,B,C) | root(f5(A,B,C),C) # label(sos_13) # label(axiom). [clausify(14)].
% 0.44/1.05 84 -root(A,B) | atocc(A,f4(B,A)) # label(sos_12) # label(axiom). [clausify(13)].
% 0.44/1.05 Derived: -min_precedes(A,B,C) | atocc(f5(A,B,C),f4(C,f5(A,B,C))). [resolve(83,b,84,a)].
% 0.44/1.05 85 -min_precedes(A,B,C) | -root(B,C) # label(sos_14) # label(axiom). [clausify(15)].
% 0.44/1.05 Derived: -min_precedes(A,f5(B,C,D),D) | -min_precedes(B,C,D). [resolve(85,b,83,b)].
% 0.44/1.05 86 -root(A,B) | legal(A) # label(sos_16) # label(axiom). [clausify(17)].
% 0.44/1.05 Derived: legal(f5(A,B,C)) | -min_precedes(A,B,C). [resolve(86,a,83,b)].
% 0.44/1.06 87 -atocc(A,B) | -legal(A) | root(A,B) # label(sos_17) # label(axiom). [clausify(18)].
% 0.44/1.06 Derived: -atocc(A,B) | -legal(A) | atocc(A,f4(B,A)). [resolve(87,c,84,a)].
% 0.44/1.06 Derived: -atocc(A,B) | -legal(A) | -min_precedes(C,A,B). [resolve(87,c,85,b)].
% 0.44/1.06 88 -leaf(A,B) | root(A,B) | min_precedes(f6(A,B),A,B) # label(sos_21) # label(axiom). [clausify(22)].
% 0.44/1.06 Derived: -leaf(A,B) | min_precedes(f6(A,B),A,B) | atocc(A,f4(B,A)). [resolve(88,b,84,a)].
% 0.44/1.06 Derived: -leaf(A,B) | min_precedes(f6(A,B),A,B) | -min_precedes(C,A,B). [resolve(88,b,85,b)].
% 0.44/1.06 Derived: -leaf(A,B) | min_precedes(f6(A,B),A,B) | legal(A). [resolve(88,b,86,a)].
% 0.44/1.06 89 leaf(A,B) | -root(A,B) | min_precedes(A,f7(A,B),B) # label(sos_21) # label(axiom). [clausify(22)].
% 0.44/1.06 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(89,b,83,b)].
% 0.44/1.06 Derived: leaf(A,B) | min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A). [resolve(89,b,87,c)].
% 0.44/1.06 90 -root(A,B) | atomic(B) | occurrence_of(f11(B,A),B) # label(sos_26) # label(axiom). [clausify(27)].
% 0.44/1.06 Derived: atomic(A) | occurrence_of(f11(A,f5(B,C,A)),A) | -min_precedes(B,C,A). [resolve(90,a,83,b)].
% 0.44/1.06 Derived: atomic(A) | occurrence_of(f11(A,B),A) | -atocc(B,A) | -legal(B). [resolve(90,a,87,c)].
% 0.44/1.06 Derived: atomic(A) | occurrence_of(f11(A,B),A) | -leaf(B,A) | min_precedes(f6(B,A),B,A). [resolve(90,a,88,b)].
% 0.44/1.06 91 -root(A,B) | atomic(B) | subactivity_occurrence(A,f11(B,A)) # label(sos_26) # label(axiom). [clausify(27)].
% 0.44/1.06 Derived: atomic(A) | subactivity_occurrence(f5(B,C,A),f11(A,f5(B,C,A))) | -min_precedes(B,C,A). [resolve(91,a,83,b)].
% 0.44/1.06 Derived: atomic(A) | subactivity_occurrence(B,f11(A,B)) | -atocc(B,A) | -legal(B). [resolve(91,a,87,c)].
% 0.44/1.06 Derived: atomic(A) | subactivity_occurrence(B,f11(A,B)) | -leaf(B,A) | min_precedes(f6(B,A),B,A). [resolve(91,a,88,b)].
% 0.44/1.06 92 -occurrence_of(A,B) | atomic(B) | root(f12(B,A),B) # label(sos_27) # label(axiom). [clausify(28)].
% 0.44/1.06 Derived: -occurrence_of(A,B) | atomic(B) | atocc(f12(B,A),f4(B,f12(B,A))). [resolve(92,c,84,a)].
% 0.44/1.06 Derived: -occurrence_of(A,B) | atomic(B) | -min_precedes(C,f12(B,A),B). [resolve(92,c,85,b)].
% 0.44/1.06 Derived: -occurrence_of(A,B) | atomic(B) | legal(f12(B,A)). [resolve(92,c,86,a)].
% 0.44/1.06 Derived: -occurrence_of(A,B) | atomic(B) | leaf(f12(B,A),B) | min_precedes(f12(B,A),f7(f12(B,A),B),B). [resolve(92,c,89,b)].
% 0.44/1.06 Derived: -occurrence_of(A,B) | atomic(B) | atomic(B) | occurrence_of(f11(B,f12(B,A)),B). [resolve(92,c,90,a)].
% 0.44/1.06 Derived: -occurrence_of(A,B) | atomic(B) | atomic(B) | subactivity_occurrence(f12(B,A),f11(B,f12(B,A))). [resolve(92,c,91,a)].
% 0.44/1.06 93 -root_occ(A,B) | root(A,f14(A,B)) # label(sos_33) # label(axiom). [clausify(34)].
% 0.44/1.06 Derived: -root_occ(A,B) | atocc(A,f4(f14(A,B),A)). [resolve(93,b,84,a)].
% 0.44/1.06 Derived: -root_occ(A,B) | -min_precedes(C,A,f14(A,B)). [resolve(93,b,85,b)].
% 0.44/1.06 Derived: -root_occ(A,B) | legal(A). [resolve(93,b,86,a)].
% 0.44/1.06 Derived: -root_occ(A,B) | leaf(A,f14(A,B)) | min_precedes(A,f7(A,f14(A,B)),f14(A,B)). [resolve(93,b,89,b)].
% 0.44/1.06 Derived: -root_occ(A,B) | atomic(f14(A,B)) | occurrence_of(f11(f14(A,B),A),f14(A,B)). [resolve(93,b,90,a)].
% 0.44/1.06 Derived: -root_occ(A,B) | atomic(f14(A,B)) | subactivity_occurrence(A,f11(f14(A,B),A)). [resolve(93,b,91,a)].
% 0.44/1.06 94 root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -root(A,C) # label(sos_33) # label(axiom). [clausify(34)].
% 0.44/1.06 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(94,d,83,b)].
% 0.44/1.06 Derived: root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -atocc(A,C) | -legal(A). [resolve(94,d,87,c)].
% 0.44/1.06 Derived: root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -leaf(A,C) | min_precedes(f6(A,C),A,C). [resolve(94,d,88,b)].
% 0.44/1.06 Derived: root_occ(f12(A,B),C) | -occurrence_of(C,A) | -subactivity_occurrence(f12(A,B),C) | -occurrence_of(B,A) | atomic(A). [resolve(94,d,92,c)].
% 0.44/1.06 Derived: root_occ(A,B) | -occurrence_of(B,f14(A,C)) | -subactivity_occurrence(A,B) | -root_occ(A,C). [resolve(94,d,93,b)].
% 0.44/1.06 95 atocc(A,f4(B,C)) | -atomic(B) | -occurrence_of(A,B) | -root(C,B). [resolve(70,b,73,b)].
% 0.44/1.06 Derived: atocc(A,f4(B,f5(C,D,B))) | -atomic(B) | -occurrence_of(A,B) | -min_precedes(C,D,B). [resolve(95,d,83,b)].
% 0.44/1.06 Derived: atocc(A,f4(B,C)) | -atomic(B) | -occurrence_of(A,B) | -atocc(C,B) | -legal(C). [resolve(95,d,87,c)].
% 0.44/1.06 Derived: atocc(A,f4(B,C)) | -atomic(B) | -occurrence_of(A,B) | -leaf(C,B) | min_precedes(f6(C,B),C,B). [resolve(95,d,88,b)].
% 0.44/1.06 Derived: atocc(A,f4(f14(B,C),B)) | -atomic(f14(B,C)) | -occurrence_of(A,f14(B,C)) | -root_occ(B,C). [resolve(95,d,93,b)].
% 0.44/1.06 96 -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(76,c,73,b)].
% 0.44/1.06 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(96,e,83,b)].
% 0.44/1.06 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(96,e,87,c)].
% 0.44/1.06 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(96,e,88,b)].
% 0.44/1.06 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(96,e,92,c)].
% 0.44/1.06 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(96,e,93,b)].
% 0.44/1.06 97 -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(77,c,73,b)].
% 0.44/1.06 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(97,e,83,b)].
% 0.44/1.06 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(97,e,87,c)].
% 0.44/1.06 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(97,e,88,b)].
% 0.44/1.06 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(97,e,92,c)].
% 0.44/1.06 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(97,e,93,b)].
% 0.44/1.06 98 leaf(A,B) | -min_precedes(C,A,B) | min_precedes(A,f7(A,B),B) # label(sos_21) # label(axiom). [clausify(22)].
% 0.44/1.06 99 -leaf(A,B) | -min_precedes(A,C,B) # label(sos_21) # label(axiom). [clausify(22)].
% 0.44/1.06 Derived: -min_precedes(A,B,C) | min_precedes(B,f7(B,C),C) | -min_precedes(B,D,C). [resolve(98,a,99,a)].
% 0.44/1.06 100 -leaf_occ(A,B) | leaf(A,f15(A,B)) # label(sos_34) # label(axiom). [clausify(35)].
% 0.44/1.06 Derived: -leaf_occ(A,B) | -min_precedes(A,C,f15(A,B)). [resolve(100,b,99,a)].
% 0.44/1.06 101 leaf_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -leaf(A,C) # label(sos_34) # label(axiom). [clausify(35)].
% 0.44/1.06 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(101,d,98,a)].
% 0.44/1.06 Derived: leaf_occ(A,B) | -occurrence_of(B,f15(A,C)) | -subactivity_occurrence(A,B) | -leaf_occ(A,C). [resolve(101,d,100,b)].
% 0.44/1.06 102 -leaf(A,B) | atomic(B) | occurrence_of(f16(A,B),B) # label(sos_45) # label(axiom). [clausify(46)].
% 0.44/1.06 Derived: atomic(A) | occurrence_of(f16(B,A),A) | -min_precedes(C,B,A) | min_precedes(B,f7(B,A),A). [resolve(102,a,98,a)].
% 0.44/1.06 Derived: atomic(f15(A,B)) | occurrence_of(f16(A,f15(A,B)),f15(A,B)) | -leaf_occ(A,B). [resolve(102,a,100,b)].
% 0.44/1.06 103 -leaf(A,B) | atomic(B) | leaf_occ(A,f16(A,B)) # label(sos_45) # label(axiom). [clausify(46)].
% 0.44/1.06 Derived: atomic(A) | leaf_occ(B,f16(B,A)) | -min_precedes(C,B,A) | min_precedes(B,f7(B,A),A). [resolve(103,a,98,a)].
% 0.44/1.06 Derived: atomic(f15(A,B)) | leaf_occ(A,f16(A,f15(A,B))) | -leaf_occ(A,B). [resolve(103,a,100,b)].
% 0.44/1.06 104 -leaf(A,B) | min_precedes(f6(A,B),A,B) | atocc(A,f4(B,A)). [resolve(88,b,84,a)].
% 0.44/1.06 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(104,a,98,a)].
% 0.44/1.06 Derived: min_precedes(f6(A,f15(A,B)),A,f15(A,B)) | atocc(A,f4(f15(A,B),A)) | -leaf_occ(A,B). [resolve(104,a,100,b)].
% 0.44/1.06 105 -leaf(A,B) | min_precedes(f6(A,B),A,B) | -min_precedes(C,A,B). [resolve(88,b,85,b)].
% 0.44/1.06 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(105,a,98,a)].
% 0.44/1.06 Derived: min_precedes(f6(A,f15(A,B)),A,f15(A,B)) | -min_precedes(C,A,f15(A,B)) | -leaf_occ(A,B). [resolve(105,a,100,b)].
% 0.44/1.06 106 -leaf(A,B) | min_precedes(f6(A,B),A,B) | legal(A). [resolve(88,b,86,a)].
% 0.44/1.06 Derived: min_precedes(f6(A,f15(A,B)),A,f15(A,B)) | legal(A) | -leaf_occ(A,B). [resolve(106,a,100,b)].
% 0.44/1.06 107 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(89,b,83,b)].
% 0.44/1.06 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(107,a,99,a)].
% 0.44/1.06 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(107,a,101,d)].
% 0.44/1.06 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(107,a,102,a)].
% 0.44/1.06 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(107,a,103,a)].
% 0.44/1.06 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(107,a,104,a)].
% 0.44/1.06 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(107,a,106,a)].
% 0.44/1.06 108 leaf(A,B) | min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A). [resolve(89,b,87,c)].
% 0.44/1.06 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A) | -min_precedes(A,C,B). [resolve(108,a,99,a)].
% 0.44/1.06 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(108,a,101,d)].
% 0.44/1.06 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A) | atomic(B) | occurrence_of(f16(A,B),B). [resolve(108,a,102,a)].
% 0.44/1.06 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A) | atomic(B) | leaf_occ(A,f16(A,B)). [resolve(108,a,103,a)].
% 0.44/1.06 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(108,a,104,a)].
% 0.44/1.06 109 atomic(A) | occurrence_of(f11(A,B),A) | -leaf(B,A) | min_precedes(f6(B,A),B,A). [resolve(90,a,88,b)].
% 0.44/1.06 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(109,c,100,b)].
% 0.44/1.06 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(109,c,107,a)].
% 0.44/1.06 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(109,c,108,a)].
% 0.44/1.06 110 atomic(A) | subactivity_occurrence(B,f11(A,B)) | -leaf(B,A) | min_precedes(f6(B,A),B,A). [resolve(91,a,88,b)].
% 0.44/1.06 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(110,c,100,b)].
% 0.44/1.06 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(110,c,107,a)].
% 0.44/1.06 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(110,c,108,a)].
% 0.44/1.06 111 -occurrence_of(A,B) | atomic(B) | leaf(f12(B,A),B) | min_precedes(f12(B,A),f7(f12(B,A),B),B). [resolve(92,c,89,b)].
% 0.44/1.06 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(111,c,99,a)].
% 0.44/1.06 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(111,c,101,d)].
% 0.44/1.06 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(111,c,102,a)].
% 0.44/1.06 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(111,c,103,a)].
% 0.44/1.06 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(111,c,104,a)].
% 0.44/1.06 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(111,c,106,a)].
% 0.44/1.06 112 -root_occ(A,B) | leaf(A,f14(A,B)) | min_precedes(A,f7(A,f14(A,B)),f14(A,B)). [resolve(93,b,89,b)].
% 0.44/1.06 Derived: -root_occ(A,B) | min_precedes(A,f7(A,f14(A,B)),f14(A,B)) | -min_precedes(A,C,f14(A,B)). [resolve(112,b,99,a)].
% 0.44/1.06 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(112,b,101,d)].
% 0.44/1.06 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(112,b,102,a)].
% 0.44/1.06 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(112,b,103,a)].
% 0.44/1.06 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(112,b,104,a)].
% 0.44/1.06 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(112,b,106,a)].
% 0.44/1.06 113 root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -leaf(A,C) | min_precedes(f6(A,C),A,C). [resolve(94,d,88,b)].
% 0.44/1.06 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(113,d,100,b)].
% 0.44/1.06 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(113,d,107,a)].
% 0.44/1.06 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(113,d,108,a)].
% 0.44/1.06 114 atocc(A,f4(B,C)) | -atomic(B) | -occurrence_of(A,B) | -leaf(C,B) | min_precedes(f6(C,B),C,B). [resolve(95,d,88,b)].
% 0.44/1.06 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(114,d,100,b)].
% 0.44/1.06 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(114,d,107,a)].
% 0.44/1.06 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(114,d,108,a)].
% 0.44/1.06 115 -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(96,e,88,b)].
% 0.44/1.06 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(115,e,100,b)].
% 0.44/1.06 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(115,e,107,a)].
% 21.68/21.93 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(115,e,108,a)].
% 21.68/21.93 116 -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(97,e,88,b)].
% 21.68/21.93 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(116,e,100,b)].
% 21.68/21.93 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(116,e,107,a)].
% 21.68/21.93 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(116,e,108,a)].
% 21.68/21.93
% 21.68/21.93 ============================== end predicate elimination =============
% 21.68/21.93
% 21.68/21.93 Auto_denials: (non-Horn, no changes).
% 21.68/21.93
% 21.68/21.93 Term ordering decisions:
% 21.68/21.93 Function symbol KB weights: tptp0=1. tptp1=1. tptp3=1. tptp4=1. tptp2=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.
% 21.68/21.93
% 21.68/21.93 ============================== end of process initial clauses ========
% 21.68/21.93
% 21.68/21.93 ============================== CLAUSES FOR SEARCH ====================
% 21.68/21.93
% 21.68/21.93 ============================== end of clauses for search =============
% 21.68/21.93
% 21.68/21.93 ============================== SEARCH ================================
% 21.68/21.93
% 21.68/21.93 % Starting search at 0.03 seconds.
% 21.68/21.93
% 21.68/21.93 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 23 (0.00 of 0.20 sec).
% 21.68/21.93
% 21.68/21.93 Low Water (keep): wt=57.000, iters=3451
% 21.68/21.93
% 21.68/21.93 Low Water (keep): wt=55.000, iters=3386
% 21.68/21.93
% 21.68/21.93 Low Water (keep): wt=54.000, iters=3430
% 21.68/21.93
% 21.68/21.93 Low Water (keep): wt=53.000, iters=3367
% 21.68/21.93
% 21.68/21.93 Low Water (keep): wt=51.000, iters=3570
% 21.68/21.93
% 21.68/21.93 Low Water (keep): wt=50.000, iters=3502
% 21.68/21.93
% 21.68/21.93 Low Water (keep): wt=48.000, iters=3341
% 21.68/21.93
% 21.68/21.93 Low Water (keep): wt=47.000, iters=3669
% 21.68/21.93
% 21.68/21.93 Low Water (keep): wt=46.000, iters=3812
% 21.68/21.93
% 21.68/21.93 Low Water (keep): wt=43.000, iters=3436
% 21.68/21.93
% 21.68/21.93 Low Water (keep): wt=42.000, iters=3469
% 21.68/21.93
% 21.68/21.93 Low Water (keep): wt=41.000, iters=3512
% 21.68/21.93
% 21.68/21.93 Low Water (keep): wt=40.000, iters=3358
% 21.68/21.93
% 21.68/21.93 Low Water (keep): wt=39.000, iters=3485
% 21.68/21.93
% 21.68/21.93 Low Water (keep): wt=38.000, iters=3413
% 21.68/21.93
% 21.68/21.93 Low Water (keep): wt=37.000, iters=3335
% 21.68/21.93
% 21.68/21.93 Low Water (keep): wt=36.000, iters=3467
% 21.68/21.93
% 21.68/21.93 Low Water (keep): wt=34.000, iters=3524
% 21.68/21.93
% 21.68/21.93 Low Water (keep): wt=33.000, iters=3487
% 21.68/21.93
% 21.68/21.93 Low Water (keep): wt=32.000, iters=3541
% 21.68/21.93
% 21.68/21.93 Low Water (keep): wt=31.000, iters=3508
% 21.68/21.93
% 21.68/21.93 Low Water (keep): wt=30.000, iters=3334
% 21.68/21.93
% 21.68/21.93 ============================== PROOF =================================
% 21.68/21.93 % SZS status Theorem
% 21.68/21.93 % SZS output start Refutation
% 21.68/21.93
% 21.68/21.93 % Proof 1 at 20.61 (+ 0.28) seconds.
% 21.68/21.93 % Length of proof is 98.
% 21.68/21.93 % Level of proof is 20.
% 21.68/21.93 % Maximum clause weight is 29.000.
% 21.68/21.93 % Given clauses 12948.
% 21.68/21.93
% 21.68/21.93 1 (all X0 all X1 (occurrence_of(X1,X0) -> activity(X0) & activity_occurrence(X1))) # label(sos) # label(axiom) # label(non_clause). [assumption].
% 21.68/21.93 2 (all X2 (activity_occurrence(X2) -> (exists X3 (activity(X3) & occurrence_of(X2,X3))))) # label(sos_01) # label(axiom) # label(non_clause). [assumption].
% 21.68/21.93 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].
% 21.68/21.93 8 (all X16 all X17 (occurrence_of(X16,X17) -> (arboreal(X16) <-> atomic(X17)))) # label(sos_07) # label(axiom) # label(non_clause). [assumption].
% 21.68/21.93 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].
% 21.68/21.93 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].
% 21.68/21.93 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].
% 21.68/21.93 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].
% 21.68/21.93 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].
% 21.68/21.93 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].
% 21.68/21.93 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].
% 21.68/21.93 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].
% 21.68/21.93 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].
% 21.68/21.93 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].
% 21.68/21.93 50 (all X161 (occurrence_of(X161,tptp0) -> (exists X162 exists X163 (occurrence_of(X162,tptp4) & root_occ(X162,X161) & occurrence_of(X163,tptp3) & leaf_occ(X163,X161) & next_subocc(X162,X163,tptp0))))) # label(sos_49) # label(axiom) # label(non_clause). [assumption].
% 21.68/21.93 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].
% 21.68/21.93 53 (all X168 all X169 (occurrence_of(X169,tptp0) & subactivity_occurrence(X168,X169) & arboreal(X168) & -leaf_occ(X168,X169) -> (exists X170 (occurrence_of(X170,tptp1) & next_subocc(X168,X170,tptp0))))) # label(sos_64) # label(axiom) # label(non_clause). [assumption].
% 21.68/21.93 54 --(exists X171 occurrence_of(X171,tptp0)) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 21.68/21.93 59 -activity_occurrence(A) | occurrence_of(A,f1(A)) # label(sos_01) # label(axiom). [clausify(2)].
% 21.68/21.93 60 -occurrence_of(A,B) | activity_occurrence(A) # label(sos) # label(axiom). [clausify(1)].
% 21.68/21.93 98 leaf(A,B) | -min_precedes(C,A,B) | min_precedes(A,f7(A,B),B) # label(sos_21) # label(axiom). [clausify(22)].
% 21.68/21.93 99 -leaf(A,B) | -min_precedes(A,C,B) # label(sos_21) # label(axiom). [clausify(22)].
% 21.68/21.93 100 -leaf_occ(A,B) | leaf(A,f15(A,B)) # label(sos_34) # label(axiom). [clausify(35)].
% 21.68/21.93 102 -leaf(A,B) | atomic(B) | occurrence_of(f16(A,B),B) # label(sos_45) # label(axiom). [clausify(46)].
% 21.68/21.93 103 -leaf(A,B) | atomic(B) | leaf_occ(A,f16(A,B)) # label(sos_45) # label(axiom). [clausify(46)].
% 21.68/21.93 117 -occurrence_of(A,B) | -occurrence_of(A,C) | C = B # label(sos_02) # label(axiom). [clausify(3)].
% 21.68/21.93 122 -occurrence_of(A,B) | arboreal(A) | -atomic(B) # label(sos_07) # label(axiom). [clausify(8)].
% 21.68/21.93 129 -next_subocc(A,B,C) | min_precedes(A,B,C) # label(sos_22) # label(axiom). [clausify(23)].
% 21.68/21.93 135 -min_precedes(A,B,C) | occurrence_of(f10(C,A,B),C) # label(sos_25) # label(axiom). [clausify(26)].
% 21.68/21.93 137 -min_precedes(A,B,C) | subactivity_occurrence(B,f10(C,A,B)) # label(sos_25) # label(axiom). [clausify(26)].
% 21.68/21.93 143 -root_occ(A,B) | subactivity_occurrence(A,B) # label(sos_33) # label(axiom). [clausify(34)].
% 21.68/21.93 144 -leaf_occ(A,B) | occurrence_of(B,f15(A,B)) # label(sos_34) # label(axiom). [clausify(35)].
% 21.68/21.93 147 -occurrence_of(A,B) | atomic(B) | -leaf_occ(C,A) | -leaf_occ(D,A) | D = C # label(sos_36) # label(axiom). [clausify(37)].
% 21.68/21.93 148 -occurrence_of(A,B) | -leaf_occ(C,A) | -min_precedes(C,D,B) # label(sos_37) # label(axiom). [clausify(38)].
% 21.68/21.93 149 -occurrence_of(A,B) | -root_occ(C,A) | -min_precedes(D,C,B) # label(sos_38) # label(axiom). [clausify(39)].
% 21.68/21.93 155 -next_subocc(A,B,C) | arboreal(A) # label(sos_44) # label(axiom). [clausify(45)].
% 21.68/21.93 161 -occurrence_of(A,tptp0) | root_occ(f17(A),A) # label(sos_49) # label(axiom). [clausify(50)].
% 21.68/21.93 162 -occurrence_of(A,tptp0) | occurrence_of(f18(A),tptp3) # label(sos_49) # label(axiom). [clausify(50)].
% 21.68/21.93 163 -occurrence_of(A,tptp0) | leaf_occ(f18(A),A) # label(sos_49) # label(axiom). [clausify(50)].
% 21.68/21.93 164 -occurrence_of(A,tptp0) | next_subocc(f17(A),f18(A),tptp0) # label(sos_49) # label(axiom). [clausify(50)].
% 21.68/21.93 165 -atomic(tptp0) # label(sos_51) # label(axiom). [assumption].
% 21.68/21.93 169 atomic(tptp1) # label(sos_55) # label(axiom). [assumption].
% 21.68/21.93 174 tptp1 != tptp3 # label(sos_59) # label(axiom). [assumption].
% 21.68/21.93 175 tptp3 != tptp1. [copy(174),flip(a)].
% 21.68/21.93 180 -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)].
% 21.68/21.93 181 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | occurrence_of(f19(B,A),tptp1) # label(sos_64) # label(axiom). [clausify(53)].
% 21.68/21.93 182 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | next_subocc(B,f19(B,A),tptp0) # label(sos_64) # label(axiom). [clausify(53)].
% 21.68/21.93 183 occurrence_of(c1,tptp0) # label(goals) # label(negated_conjecture). [clausify(54)].
% 21.68/21.93 184 occurrence_of(A,f1(A)) | -occurrence_of(A,B). [resolve(59,a,60,b)].
% 21.68/21.93 242 -leaf_occ(A,B) | -min_precedes(A,C,f15(A,B)). [resolve(100,b,99,a)].
% 21.68/21.93 245 atomic(A) | occurrence_of(f16(B,A),A) | -min_precedes(C,B,A) | min_precedes(B,f7(B,A),A). [resolve(102,a,98,a)].
% 21.68/21.93 247 atomic(A) | leaf_occ(B,f16(B,A)) | -min_precedes(C,B,A) | min_precedes(B,f7(B,A),A). [resolve(103,a,98,a)].
% 21.68/21.93 300 next_subocc(f17(c1),f18(c1),tptp0). [resolve(183,a,164,a)].
% 21.68/21.93 303 root_occ(f17(c1),c1). [resolve(183,a,161,a)].
% 21.68/21.93 320 arboreal(f17(c1)). [resolve(300,a,155,a)].
% 21.68/21.93 324 min_precedes(f17(c1),f18(c1),tptp0). [resolve(300,a,129,a)].
% 21.68/21.93 360 subactivity_occurrence(f17(c1),c1). [resolve(303,a,143,a)].
% 21.68/21.93 437 leaf_occ(f17(c1),c1) | next_subocc(f17(c1),f19(f17(c1),c1),tptp0). [resolve(360,a,182,b),unit_del(a,183),unit_del(b,320)].
% 21.68/21.93 438 leaf_occ(f17(c1),c1) | occurrence_of(f19(f17(c1),c1),tptp1). [resolve(360,a,181,b),unit_del(a,183),unit_del(b,320)].
% 21.68/21.93 525 -occurrence_of(A,tptp0) | -leaf_occ(f17(c1),A). [resolve(324,a,148,c)].
% 21.68/21.93 1524 occurrence_of(f19(f17(c1),c1),tptp1). [resolve(438,a,525,b),unit_del(b,183)].
% 21.68/21.93 1533 occurrence_of(f19(f17(c1),c1),f1(f19(f17(c1),c1))). [resolve(1524,a,184,b)].
% 21.68/21.93 1534 arboreal(f19(f17(c1),c1)). [resolve(1524,a,122,a),unit_del(b,169)].
% 21.68/21.93 1535 -occurrence_of(f19(f17(c1),c1),A) | tptp1 = A. [resolve(1524,a,117,b)].
% 21.68/21.93 1978 f1(f19(f17(c1),c1)) = tptp1. [resolve(1533,a,1535,a),flip(a)].
% 21.68/21.93 2036 leaf_occ(f17(c1),c1) | min_precedes(f17(c1),f19(f17(c1),c1),tptp0). [resolve(437,b,129,a)].
% 21.68/21.93 3214 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(2036,b,247,c),unit_del(b,165)].
% 21.68/21.93 3215 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(2036,b,245,c),unit_del(b,165)].
% 21.68/21.93 3244 leaf_occ(f17(c1),c1) | -occurrence_of(A,tptp0) | -root_occ(f19(f17(c1),c1),A). [resolve(2036,b,149,c)].
% 21.68/21.93 3246 leaf_occ(f17(c1),c1) | subactivity_occurrence(f19(f17(c1),c1),f10(tptp0,f17(c1),f19(f17(c1),c1))). [resolve(2036,b,137,a)].
% 21.68/21.93 3248 leaf_occ(f17(c1),c1) | occurrence_of(f10(tptp0,f17(c1),f19(f17(c1),c1)),tptp0). [resolve(2036,b,135,a)].
% 21.68/21.93 5034 occurrence_of(f10(tptp0,f17(c1),f19(f17(c1),c1)),tptp0). [resolve(3248,a,525,b),unit_del(b,183)].
% 21.68/21.93 10088 subactivity_occurrence(f19(f17(c1),c1),f10(tptp0,f17(c1),f19(f17(c1),c1))). [resolve(3246,a,525,b),unit_del(b,183)].
% 21.68/21.93 10100 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(10088,a,180,b),unit_del(a,5034),unit_del(b,1534)].
% 21.68/21.93 17453 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(3214,c,148,c)].
% 21.68/21.93 17491 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(3215,c,148,c)].
% 21.68/21.93 30385 leaf_occ(f19(f17(c1),c1),f10(tptp0,f17(c1),f19(f17(c1),c1))) | leaf_occ(f17(c1),c1). [resolve(10100,b,3244,c),unit_del(c,5034)].
% 21.68/21.93 30390 leaf_occ(f17(c1),c1) | occurrence_of(f16(f19(f17(c1),c1),tptp0),tptp0). [resolve(30385,a,17491,d),merge(b),unit_del(c,5034)].
% 21.68/21.93 30391 leaf_occ(f17(c1),c1) | leaf_occ(f19(f17(c1),c1),f16(f19(f17(c1),c1),tptp0)). [resolve(30385,a,17453,d),merge(b),unit_del(c,5034)].
% 21.68/21.93 30413 occurrence_of(f16(f19(f17(c1),c1),tptp0),tptp0). [resolve(30390,a,525,b),unit_del(b,183)].
% 21.68/21.93 30470 next_subocc(f17(f16(f19(f17(c1),c1),tptp0)),f18(f16(f19(f17(c1),c1),tptp0)),tptp0). [resolve(30413,a,164,a)].
% 21.68/21.93 30471 leaf_occ(f18(f16(f19(f17(c1),c1),tptp0)),f16(f19(f17(c1),c1),tptp0)). [resolve(30413,a,163,a)].
% 21.68/21.93 30477 -occurrence_of(f16(f19(f17(c1),c1),tptp0),A) | tptp0 = A. [resolve(30413,a,117,b)].
% 21.68/21.93 30817 -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(30471,a,147,d)].
% 21.68/21.93 30819 occurrence_of(f16(f19(f17(c1),c1),tptp0),f15(f18(f16(f19(f17(c1),c1),tptp0)),f16(f19(f17(c1),c1),tptp0))). [resolve(30471,a,144,a)].
% 21.68/21.93 31104 min_precedes(f17(f16(f19(f17(c1),c1),tptp0)),f18(f16(f19(f17(c1),c1),tptp0)),tptp0). [resolve(30470,a,129,a)].
% 21.68/21.93 31151 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(31104,a,245,c),unit_del(a,165)].
% 21.68/21.93 32424 f15(f18(f16(f19(f17(c1),c1),tptp0)),f16(f19(f17(c1),c1),tptp0)) = tptp0. [resolve(30819,a,30477,a),flip(a)].
% 21.68/21.93 32426 -min_precedes(f18(f16(f19(f17(c1),c1),tptp0)),A,tptp0). [para(32424(a,1),242(b,3)),unit_del(a,30471)].
% 21.68/21.93 32435 occurrence_of(f16(f18(f16(f19(f17(c1),c1),tptp0)),tptp0),tptp0). [back_unit_del(31151),unit_del(b,32426)].
% 21.68/21.93 32448 occurrence_of(f18(f16(f18(f16(f19(f17(c1),c1),tptp0)),tptp0)),tptp3). [resolve(32435,a,162,a)].
% 21.68/21.93 32491 occurrence_of(f18(f16(f18(f16(f19(f17(c1),c1),tptp0)),tptp0)),f1(f18(f16(f18(f16(f19(f17(c1),c1),tptp0)),tptp0)))). [resolve(32448,a,184,b)].
% 21.68/21.93 32493 -occurrence_of(f18(f16(f18(f16(f19(f17(c1),c1),tptp0)),tptp0)),A) | tptp3 = A. [resolve(32448,a,117,b)].
% 21.68/21.93 33252 f1(f18(f16(f18(f16(f19(f17(c1),c1),tptp0)),tptp0))) = tptp3. [resolve(32491,a,32493,a),flip(a)].
% 21.68/21.93 38583 -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(30817,c,30391,b)].
% 21.68/21.93 38584 f18(f16(f19(f17(c1),c1),tptp0)) = f19(f17(c1),c1) | leaf_occ(f17(c1),c1). [resolve(38583,a,30413,a),unit_del(a,165)].
% 21.68/21.93 38590 f18(f16(f19(f17(c1),c1),tptp0)) = f19(f17(c1),c1). [resolve(38584,b,525,b),unit_del(b,183)].
% 21.68/21.93 38855 $F. [back_rewrite(33252),rewrite([38590(7),38590(7),1978(5)]),flip(a),unit_del(a,175)].
% 21.68/21.93
% 21.68/21.93 % SZS output end Refutation
% 21.68/21.93 ============================== end of proof ==========================
% 21.68/21.93
% 21.68/21.93 ============================== STATISTICS ============================
% 21.68/21.93
% 21.68/21.93 Given=12948. Generated=481381. Kept=38730. proofs=1.
% 21.68/21.93 Usable=8014. Sos=6738. Demods=399. Limbo=265, Disabled=23951. Hints=0.
% 21.68/21.93 Megabytes=53.70.
% 21.68/21.93 User_CPU=20.61, System_CPU=0.28, Wall_clock=21.
% 21.68/21.93
% 21.68/21.93 ============================== end of statistics =====================
% 21.68/21.93
% 21.68/21.93 ============================== end of search =========================
% 21.68/21.93
% 21.68/21.93 THEOREM PROVED
% 21.68/21.93 % SZS status Theorem
% 21.68/21.93
% 21.68/21.93 Exiting with 1 proof.
% 21.68/21.93
% 21.68/21.93 Process 4162 exit (max_proofs) Mon Jun 13 01:01:25 2022
% 21.68/21.93 Prover9 interrupted
%------------------------------------------------------------------------------