0.08/0.08	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.08/0.09	% Command  : tptp2X_and_run_prover9 %d %s
0.09/0.28	% Computer : n007.cluster.edu
0.09/0.28	% Model    : x86_64 x86_64
0.09/0.28	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.09/0.28	% Memory   : 8042.1875MB
0.09/0.28	% OS       : Linux 3.10.0-693.el7.x86_64
0.09/0.28	% CPULimit : 1920
0.09/0.28	% WCLimit  : 240
0.09/0.28	% DateTime : Wed Jul 30 02:00:34 EDT 2025
0.09/0.29	% CPUTime  : 
0.68/1.02	============================== Prover9 ===============================
0.68/1.02	Prover9 (32) version 2009-11A, November 2009.
0.68/1.02	Process 24700 was started by sandbox2 on n007.cluster.edu,
0.68/1.02	Wed Jul 30 02:00:34 2025
0.68/1.02	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1920 -f /tmp/Prover9_24546_n007.cluster.edu".
0.68/1.02	============================== end of head ===========================
0.68/1.02	
0.68/1.02	============================== INPUT =================================
0.68/1.02	
0.68/1.02	% Reading from file /tmp/Prover9_24546_n007.cluster.edu
0.68/1.02	
0.68/1.02	set(prolog_style_variables).
0.68/1.02	set(auto2).
0.68/1.02	    % set(auto2) -> set(auto).
0.68/1.02	    % set(auto) -> set(auto_inference).
0.68/1.02	    % set(auto) -> set(auto_setup).
0.68/1.02	    % set(auto_setup) -> set(predicate_elim).
0.68/1.02	    % set(auto_setup) -> assign(eq_defs, unfold).
0.68/1.02	    % set(auto) -> set(auto_limits).
0.68/1.02	    % set(auto_limits) -> assign(max_weight, "100.000").
0.68/1.02	    % set(auto_limits) -> assign(sos_limit, 20000).
0.68/1.02	    % set(auto) -> set(auto_denials).
0.68/1.02	    % set(auto) -> set(auto_process).
0.68/1.02	    % set(auto2) -> assign(new_constants, 1).
0.68/1.02	    % set(auto2) -> assign(fold_denial_max, 3).
0.68/1.02	    % set(auto2) -> assign(max_weight, "200.000").
0.68/1.02	    % set(auto2) -> assign(max_hours, 1).
0.68/1.02	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.68/1.02	    % set(auto2) -> assign(max_seconds, 0).
0.68/1.02	    % set(auto2) -> assign(max_minutes, 5).
0.68/1.02	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.68/1.02	    % set(auto2) -> set(sort_initial_sos).
0.68/1.02	    % set(auto2) -> assign(sos_limit, -1).
0.68/1.02	    % set(auto2) -> assign(lrs_ticks, 3000).
0.68/1.02	    % set(auto2) -> assign(max_megs, 400).
0.68/1.02	    % set(auto2) -> assign(stats, some).
0.68/1.02	    % set(auto2) -> clear(echo_input).
0.68/1.02	    % set(auto2) -> set(quiet).
0.68/1.02	    % set(auto2) -> clear(print_initial_clauses).
0.68/1.02	    % set(auto2) -> clear(print_given).
0.68/1.02	assign(lrs_ticks,-1).
0.68/1.02	assign(sos_limit,10000).
0.68/1.02	assign(order,kbo).
0.68/1.02	set(lex_order_vars).
0.68/1.02	clear(print_given).
0.68/1.02	
0.68/1.02	% formulas(sos).  % not echoed (63 formulas)
0.68/1.02	
0.68/1.02	============================== end of input ==========================
0.68/1.02	
0.68/1.02	% From the command line: assign(max_seconds, 1920).
0.68/1.02	
0.68/1.02	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.68/1.02	
0.68/1.02	% Formulas that are not ordinary clauses:
0.68/1.02	1 (all X41 all X42 (root(X41,X42) -> legal(X41))) # label(sos_16) # label(axiom) # label(non_clause).  [assumption].
0.68/1.02	2 (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.68/1.02	3 (all X0 all X1 (occurrence_of(X1,X0) -> activity(X0) & activity_occurrence(X1))) # label(sos) # label(axiom) # label(non_clause).  [assumption].
0.68/1.02	4 (all X10 all X11 all X12 (earlier(X11,X12) & earlier(X10,X11) -> earlier(X10,X12))) # label(sos_05) # label(axiom) # label(non_clause).  [assumption].
0.68/1.02	5 (all X117 all X118 all X119 (root_occ(X118,X117) & occurrence_of(X117,X119) -> -(exists X120 min_precedes(X120,X118,X119)))) # label(sos_38) # label(axiom) # label(non_clause).  [assumption].
0.68/1.02	6 (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.68/1.02	7 (all X134 all X135 all X136 all X137 (subactivity_occurrence(X136,X135) & root_occ(X137,X135) & arboreal(X136) & -min_precedes(X137,X136,X134) & occurrence_of(X135,X134) -> X136 = X137)) # label(sos_42) # label(axiom) # label(non_clause).  [assumption].
0.68/1.02	8 (all X19 all X20 (legal(X19) & earlier(X20,X19) -> legal(X20))) # label(sos_09) # label(axiom) # label(non_clause).  [assumption].
0.68/1.02	9 (all X121 all X122 all X123 all X124 all X125 (occurrence_of(X125,X124) & subactivity_occurrence(X123,X125) & subactivity_occurrence(X122,X125) & next_subocc(X121,X123,X124) & next_subocc(X121,X122,X124) -> X122 = X123)) # label(sos_39) # label(axiom) # label(non_clause).  [assumption].
0.68/1.02	10 (all X73 all X74 (root(X74,X73) & -atomic(X73) -> (exists X75 (subactivity_occurrence(X74,X75) & occurrence_of(X75,X73))))) # label(sos_26) # label(axiom) # label(non_clause).  [assumption].
0.68/1.02	11 (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.68/1.02	12 (all X13 all X14 all X15 (earlier(X13,X14) & earlier(X15,X14) -> earlier(X13,X15) | X13 = X15 | earlier(X15,X13))) # label(sos_06) # label(axiom) # label(non_clause).  [assumption].
0.68/1.02	13 (all X142 all X143 all X144 (next_subocc(X142,X143,X144) -> arboreal(X143) & arboreal(X142))) # label(sos_44) # label(axiom) # label(non_clause).  [assumption].
0.68/1.02	14 (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.68/1.02	15 (all X67 all X68 (subactivity_occurrence(X67,X68) -> activity_occurrence(X67) & activity_occurrence(X68))) # label(sos_24) # label(axiom) # label(non_clause).  [assumption].
0.68/1.02	16 (all X105 all X106 all X107 all X108 (occurrence_of(X107,X108) & root_occ(X106,X107) & root_occ(X105,X107) -> X106 = X105)) # label(sos_35) # label(axiom) # label(non_clause).  [assumption].
0.68/1.02	17 (all X126 all X127 all X128 all X129 (next_subocc(X128,X126,X129) & next_subocc(X127,X126,X129) -> X128 = X127)) # label(sos_40) # label(axiom) # label(non_clause).  [assumption].
0.68/1.02	18 (all X94 all X95 all X96 all X97 (occurrence_of(X97,X95) & subactivity(X94,X95) & -subactivity_occurrence(X96,X97) & occurrence_of(X96,X94) -> (exists X98 (subactivity_occurrence(X98,X97) & -subactivity_occurrence(X98,X96))))) # label(sos_32) # label(axiom) # label(non_clause).  [assumption].
0.68/1.02	19 (all X60 all X61 all X62 (-(exists X63 (min_precedes(X60,X63,X62) & min_precedes(X63,X61,X62))) & min_precedes(X60,X61,X62) <-> next_subocc(X60,X61,X62))) # label(sos_22) # label(axiom) # label(non_clause).  [assumption].
0.68/1.02	20 (all X130 all X131 all X132 all X133 (root_occ(X132,X130) & X132 != X131 & leaf_occ(X131,X130) & occurrence_of(X130,X133) -> min_precedes(X132,X131,X133))) # label(sos_41) # label(axiom) # label(non_clause).  [assumption].
0.68/1.02	21 (all X18 (legal(X18) -> arboreal(X18))) # label(sos_08) # label(axiom) # label(non_clause).  [assumption].
0.68/1.02	22 (all X21 all X22 (earlier(X21,X22) & legal(X22) <-> precedes(X21,X22))) # label(sos_10) # label(axiom) # label(non_clause).  [assumption].
0.68/1.02	23 (all X8 all X9 (earlier(X8,X9) -> -earlier(X9,X8))) # label(sos_04) # label(axiom) # label(non_clause).  [assumption].
0.68/1.02	24 (all X138 all X139 all X140 all X141 (occurrence_of(X139,X138) & -min_precedes(X140,X141,X138) & arboreal(X140) & leaf_occ(X141,X139) & subactivity_occurrence(X140,X139) -> X140 = X141)) # label(sos_43) # label(axiom) # label(non_clause).  [assumption].
0.68/1.02	25 (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.68/1.02	26 (all X161 (occurrence_of(X161,tptp0) -> (exists X162 exists X163 exists X164 (root_occ(X162,X161) & (occurrence_of(X164,tptp1) | occurrence_of(X164,tptp2)) & leaf_occ(X164,X161) & next_subocc(X163,X164,tptp0) & next_subocc(X162,X163,tptp0) & occurrence_of(X163,tptp4) & occurrence_of(X162,tptp3))))) # label(sos_49) # label(axiom) # label(non_clause).  [assumption].
0.68/1.02	27 (all X109 all X110 all X111 all X112 (leaf_occ(X110,X111) & leaf_occ(X109,X111) & -atomic(X112) & occurrence_of(X111,X112) -> X109 = X110)) # label(sos_36) # label(axiom) # label(non_clause).  [assumption].
0.68/1.02	28 (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.68/1.02	29 (all X16 all X17 (occurrence_of(X16,X17) -> (arboreal(X16) <-> atomic(X17)))) # label(sos_07) # label(axiom) # label(non_clause).  [assumption].
0.68/1.02	30 (all X79 all X80 all X81 all X82 (subactivity_occurrence(X81,X80) & subactivity_occurrence(X82,X80) & arboreal(X82) & arboreal(X81) & occurrence_of(X80,X79) -> min_precedes(X81,X82,X79) | min_precedes(X82,X81,X79) | X82 = X81)) # label(sos_28) # label(axiom) # label(non_clause).  [assumption].
0.68/1.02	31 (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.68/1.02	32 (all X148 all X149 all X150 (min_precedes(X148,X149,X150) -> arboreal(X148))) # label(sos_46) # label(axiom) # label(non_clause).  [assumption].
0.68/1.02	33 (all X64 all X65 (atocc(X64,X65) <-> (exists X66 (occurrence_of(X64,X66) & atomic(X66) & subactivity(X65,X66))))) # label(sos_23) # label(axiom) # label(non_clause).  [assumption].
0.68/1.02	34 (all X49 all X50 all X51 (min_precedes(X49,X50,X51) -> -atomic(X51))) # label(sos_19) # label(axiom) # label(non_clause).  [assumption].
0.68/1.02	35 (all X23 all X24 all X25 (min_precedes(X24,X25,X23) -> (exists X26 exists X27 (atocc(X24,X26) & atocc(X25,X27) & subactivity(X27,X23) & subactivity(X26,X23))))) # label(sos_11) # label(axiom) # label(non_clause).  [assumption].
0.68/1.02	36 (all X99 all X100 ((exists X101 (occurrence_of(X100,X101) & subactivity_occurrence(X99,X100) & root(X99,X101))) <-> root_occ(X99,X100))) # label(sos_33) # label(axiom) # label(non_clause).  [assumption].
0.68/1.02	37 (all X2 (activity_occurrence(X2) -> (exists X3 (occurrence_of(X2,X3) & activity(X3))))) # label(sos_01) # label(axiom) # label(non_clause).  [assumption].
0.68/1.02	38 (all X43 all X44 (legal(X43) & atocc(X43,X44) -> root(X43,X44))) # label(sos_17) # label(axiom) # label(non_clause).  [assumption].
0.68/1.02	39 (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.68/1.02	40 (all X156 all X157 all X158 all X159 all X160 (subactivity_occurrence(X158,X157) & min_precedes(X159,X158,X156) & X158 != X160 & leaf_occ(X160,X157) & root_occ(X159,X157) & occurrence_of(X157,X156) -> min_precedes(X158,X160,X156))) # label(sos_48) # label(axiom) # label(non_clause).  [assumption].
0.68/1.02	41 (all X38 all X39 all X40 (min_precedes(X38,X39,X40) -> precedes(X38,X39))) # label(sos_15) # label(axiom) # label(non_clause).  [assumption].
0.68/1.02	42 (all X56 all X57 (leaf(X56,X57) <-> -(exists X59 min_precedes(X56,X59,X57)) & ((exists X58 min_precedes(X58,X56,X57)) | root(X56,X57)))) # label(sos_21) # label(axiom) # label(non_clause).  [assumption].
0.68/1.02	43 (all X145 all X146 (-atomic(X146) & leaf(X145,X146) -> (exists X147 (occurrence_of(X147,X146) & leaf_occ(X145,X147))))) # label(sos_45) # label(axiom) # label(non_clause).  [assumption].
0.68/1.02	44 (all X35 all X36 all X37 (min_precedes(X35,X36,X37) -> -root(X36,X37))) # label(sos_14) # label(axiom) # label(non_clause).  [assumption].
0.68/1.02	45 (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.68/1.02	46 (all X91 all X92 all X93 (subactivity_occurrence(X92,X93) & subactivity_occurrence(X91,X92) -> subactivity_occurrence(X91,X93))) # label(sos_31) # label(axiom) # label(non_clause).  [assumption].
0.68/1.02	47 (all X7 (activity(X7) -> subactivity(X7,X7))) # label(sos_03) # label(axiom) # label(non_clause).  [assumption].
0.68/1.02	48 (all X76 all X77 (-atomic(X76) & occurrence_of(X77,X76) -> (exists X78 (root(X78,X76) & subactivity_occurrence(X78,X77))))) # label(sos_27) # label(axiom) # label(non_clause).  [assumption].
0.68/1.02	49 (all X87 all X88 all X89 all X90 (occurrence_of(X89,X87) & subactivity_occurrence(X89,X90) & -atomic(X87) & occurrence_of(X90,X88) -> subactivity(X87,X88))) # label(sos_30) # label(axiom) # label(non_clause).  [assumption].
0.68/1.02	50 (all X151 all X152 all X153 all X154 all X155 (min_precedes(X153,X155,X151) & X154 != X153 & subactivity_occurrence(X153,X152) & leaf_occ(X155,X152) & root_occ(X154,X152) & occurrence_of(X152,X151) -> min_precedes(X154,X153,X151))) # label(sos_47) # label(axiom) # label(non_clause).  [assumption].
0.68/1.02	51 -(all X165 (occurrence_of(X165,tptp0) -> (exists X166 exists X167 ((occurrence_of(X167,tptp2) -> -(exists X169 (occurrence_of(X169,tptp1) & min_precedes(X166,X169,tptp0)))) & (occurrence_of(X167,tptp1) -> -(exists X168 (min_precedes(X166,X168,tptp0) & occurrence_of(X168,tptp2)))) & leaf_occ(X167,X165))))) # label(goals) # label(negated_conjecture) # label(non_clause).  [assumption].
0.68/1.02	
0.68/1.02	============================== end of process non-clausal formulas ===
0.68/1.02	
0.68/1.02	============================== PROCESS INITIAL CLAUSES ===============
0.68/1.02	
0.68/1.02	============================== PREDICATE ELIMINATION =================
0.68/1.02	52 root(A,f13(A,B)) | -root_occ(A,B) # label(sos_33) # label(axiom).  [clausify(36)].
0.68/1.02	53 -root(A,B) | legal(A) # label(sos_16) # label(axiom).  [clausify(1)].
0.68/1.02	54 -root(A,B) | subactivity(f2(B,A),B) # label(sos_12) # label(axiom).  [clausify(6)].
0.68/1.02	55 -root(A,B) | atocc(A,f2(B,A)) # label(sos_12) # label(axiom).  [clausify(6)].
0.68/1.02	56 -root(A,B) | atomic(B) | subactivity_occurrence(A,f3(B,A)) # label(sos_26) # label(axiom).  [clausify(10)].
0.68/1.02	57 -root(A,B) | atomic(B) | occurrence_of(f3(B,A),B) # label(sos_26) # label(axiom).  [clausify(10)].
0.68/1.02	58 -occurrence_of(A,B) | -subactivity_occurrence(C,A) | -root(C,B) | root_occ(C,A) # label(sos_33) # label(axiom).  [clausify(36)].
0.68/1.02	Derived: -root_occ(A,B) | legal(A).  [resolve(52,a,53,a)].
0.68/1.02	Derived: -root_occ(A,B) | subactivity(f2(f13(A,B),A),f13(A,B)).  [resolve(52,a,54,a)].
0.68/1.02	Derived: -root_occ(A,B) | atocc(A,f2(f13(A,B),A)).  [resolve(52,a,55,a)].
0.68/1.02	Derived: -root_occ(A,B) | atomic(f13(A,B)) | subactivity_occurrence(A,f3(f13(A,B),A)).  [resolve(52,a,56,a)].
0.68/1.02	Derived: -root_occ(A,B) | atomic(f13(A,B)) | occurrence_of(f3(f13(A,B),A),f13(A,B)).  [resolve(52,a,57,a)].
0.68/1.02	Derived: -root_occ(A,B) | -occurrence_of(C,f13(A,B)) | -subactivity_occurrence(A,C) | root_occ(A,C).  [resolve(52,a,58,c)].
0.68/1.02	59 -legal(A) | -atocc(A,B) | root(A,B) # label(sos_17) # label(axiom).  [clausify(38)].
0.68/1.02	Derived: -legal(A) | -atocc(A,B) | subactivity(f2(B,A),B).  [resolve(59,c,54,a)].
0.68/1.02	Derived: -legal(A) | -atocc(A,B) | atocc(A,f2(B,A)).  [resolve(59,c,55,a)].
0.68/1.02	Derived: -legal(A) | -atocc(A,B) | atomic(B) | subactivity_occurrence(A,f3(B,A)).  [resolve(59,c,56,a)].
0.68/1.02	Derived: -legal(A) | -atocc(A,B) | atomic(B) | occurrence_of(f3(B,A),B).  [resolve(59,c,57,a)].
0.68/1.02	Derived: -legal(A) | -atocc(A,B) | -occurrence_of(C,B) | -subactivity_occurrence(A,C) | root_occ(A,C).  [resolve(59,c,58,c)].
0.68/1.02	60 -leaf(A,B) | min_precedes(f15(A,B),A,B) | root(A,B) # label(sos_21) # label(axiom).  [clausify(42)].
0.68/1.02	Derived: -leaf(A,B) | min_precedes(f15(A,B),A,B) | legal(A).  [resolve(60,c,53,a)].
0.68/1.02	Derived: -leaf(A,B) | min_precedes(f15(A,B),A,B) | subactivity(f2(B,A),B).  [resolve(60,c,54,a)].
0.68/1.02	Derived: -leaf(A,B) | min_precedes(f15(A,B),A,B) | atocc(A,f2(B,A)).  [resolve(60,c,55,a)].
0.68/1.02	Derived: -leaf(A,B) | min_precedes(f15(A,B),A,B) | atomic(B) | subactivity_occurrence(A,f3(B,A)).  [resolve(60,c,56,a)].
0.68/1.02	Derived: -leaf(A,B) | min_precedes(f15(A,B),A,B) | atomic(B) | occurrence_of(f3(B,A),B).  [resolve(60,c,57,a)].
0.68/1.02	Derived: -leaf(A,B) | min_precedes(f15(A,B),A,B) | -occurrence_of(C,B) | -subactivity_occurrence(A,C) | root_occ(A,C).  [resolve(60,c,58,c)].
0.68/1.02	61 leaf(A,B) | min_precedes(A,f16(A,B),B) | -root(A,B) # label(sos_21) # label(axiom).  [clausify(42)].
0.68/1.02	Derived: leaf(A,f13(A,B)) | min_precedes(A,f16(A,f13(A,B)),f13(A,B)) | -root_occ(A,B).  [resolve(61,c,52,a)].
0.68/1.02	Derived: leaf(A,B) | min_precedes(A,f16(A,B),B) | -legal(A) | -atocc(A,B).  [resolve(61,c,59,c)].
0.68/1.02	62 -min_precedes(A,B,C) | -root(B,C) # label(sos_14) # label(axiom).  [clausify(44)].
0.68/1.02	Derived: -min_precedes(A,B,f13(B,C)) | -root_occ(B,C).  [resolve(62,b,52,a)].
0.68/1.02	Derived: -min_precedes(A,B,C) | -legal(B) | -atocc(B,C).  [resolve(62,b,59,c)].
0.68/1.02	Derived: -min_precedes(A,B,C) | -leaf(B,C) | min_precedes(f15(B,C),B,C).  [resolve(62,b,60,c)].
0.68/1.02	63 -min_precedes(A,B,C) | root(f18(A,B,C),C) # label(sos_13) # label(axiom).  [clausify(45)].
0.68/1.02	Derived: -min_precedes(A,B,C) | legal(f18(A,B,C)).  [resolve(63,b,53,a)].
0.68/1.02	Derived: -min_precedes(A,B,C) | subactivity(f2(C,f18(A,B,C)),C).  [resolve(63,b,54,a)].
0.68/1.02	Derived: -min_precedes(A,B,C) | atocc(f18(A,B,C),f2(C,f18(A,B,C))).  [resolve(63,b,55,a)].
0.68/1.02	Derived: -min_precedes(A,B,C) | atomic(C) | subactivity_occurrence(f18(A,B,C),f3(C,f18(A,B,C))).  [resolve(63,b,56,a)].
0.68/1.02	Derived: -min_precedes(A,B,C) | atomic(C) | occurrence_of(f3(C,f18(A,B,C)),C).  [resolve(63,b,57,a)].
0.68/1.02	Derived: -min_precedes(A,B,C) | -occurrence_of(D,C) | -subactivity_occurrence(f18(A,B,C),D) | root_occ(f18(A,B,C),D).  [resolve(63,b,58,c)].
0.68/1.03	Derived: -min_precedes(A,B,C) | leaf(f18(A,B,C),C) | min_precedes(f18(A,B,C),f16(f18(A,B,C),C),C).  [resolve(63,b,61,c)].
0.68/1.03	Derived: -min_precedes(A,B,C) | -min_precedes(D,f18(A,B,C),C).  [resolve(63,b,62,b)].
0.68/1.03	64 atomic(A) | -occurrence_of(B,A) | root(f19(A,B),A) # label(sos_27) # label(axiom).  [clausify(48)].
0.68/1.03	Derived: atomic(A) | -occurrence_of(B,A) | legal(f19(A,B)).  [resolve(64,c,53,a)].
0.68/1.03	Derived: atomic(A) | -occurrence_of(B,A) | subactivity(f2(A,f19(A,B)),A).  [resolve(64,c,54,a)].
0.68/1.03	Derived: atomic(A) | -occurrence_of(B,A) | atocc(f19(A,B),f2(A,f19(A,B))).  [resolve(64,c,55,a)].
0.68/1.03	Derived: atomic(A) | -occurrence_of(B,A) | atomic(A) | subactivity_occurrence(f19(A,B),f3(A,f19(A,B))).  [resolve(64,c,56,a)].
0.68/1.03	Derived: atomic(A) | -occurrence_of(B,A) | atomic(A) | occurrence_of(f3(A,f19(A,B)),A).  [resolve(64,c,57,a)].
0.68/1.03	Derived: atomic(A) | -occurrence_of(B,A) | -occurrence_of(C,A) | -subactivity_occurrence(f19(A,B),C) | root_occ(f19(A,B),C).  [resolve(64,c,58,c)].
0.68/1.03	Derived: atomic(A) | -occurrence_of(B,A) | leaf(f19(A,B),A) | min_precedes(f19(A,B),f16(f19(A,B),A),A).  [resolve(64,c,61,c)].
0.68/1.03	Derived: atomic(A) | -occurrence_of(B,A) | -min_precedes(C,f19(A,B),A).  [resolve(64,c,62,b)].
0.68/1.03	65 leaf_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -leaf(A,C) # label(sos_34) # label(axiom).  [clausify(2)].
0.68/1.03	66 -leaf_occ(A,B) | leaf(A,f1(A,B)) # label(sos_34) # label(axiom).  [clausify(2)].
0.68/1.03	Derived: leaf_occ(A,B) | -occurrence_of(B,f1(A,C)) | -subactivity_occurrence(A,B) | -leaf_occ(A,C).  [resolve(65,d,66,b)].
0.68/1.03	67 -leaf(A,B) | -min_precedes(A,C,B) # label(sos_21) # label(axiom).  [clausify(42)].
0.68/1.03	Derived: -min_precedes(A,B,f1(A,C)) | -leaf_occ(A,C).  [resolve(67,a,66,b)].
0.68/1.03	68 leaf(A,B) | min_precedes(A,f16(A,B),B) | -min_precedes(C,A,B) # label(sos_21) # label(axiom).  [clausify(42)].
0.68/1.03	Derived: min_precedes(A,f16(A,B),B) | -min_precedes(C,A,B) | leaf_occ(A,D) | -occurrence_of(D,B) | -subactivity_occurrence(A,D).  [resolve(68,a,65,d)].
0.68/1.03	Derived: min_precedes(A,f16(A,B),B) | -min_precedes(C,A,B) | -min_precedes(A,D,B).  [resolve(68,a,67,a)].
0.68/1.03	69 atomic(A) | -leaf(B,A) | occurrence_of(f17(B,A),A) # label(sos_45) # label(axiom).  [clausify(43)].
0.68/1.03	Derived: atomic(f1(A,B)) | occurrence_of(f17(A,f1(A,B)),f1(A,B)) | -leaf_occ(A,B).  [resolve(69,b,66,b)].
0.68/1.03	Derived: atomic(A) | occurrence_of(f17(B,A),A) | min_precedes(B,f16(B,A),A) | -min_precedes(C,B,A).  [resolve(69,b,68,a)].
0.68/1.03	70 atomic(A) | -leaf(B,A) | leaf_occ(B,f17(B,A)) # label(sos_45) # label(axiom).  [clausify(43)].
0.68/1.03	Derived: atomic(f1(A,B)) | leaf_occ(A,f17(A,f1(A,B))) | -leaf_occ(A,B).  [resolve(70,b,66,b)].
0.68/1.03	Derived: atomic(A) | leaf_occ(B,f17(B,A)) | min_precedes(B,f16(B,A),A) | -min_precedes(C,B,A).  [resolve(70,b,68,a)].
0.68/1.03	71 -leaf(A,B) | min_precedes(f15(A,B),A,B) | legal(A).  [resolve(60,c,53,a)].
0.68/1.03	Derived: min_precedes(f15(A,f1(A,B)),A,f1(A,B)) | legal(A) | -leaf_occ(A,B).  [resolve(71,a,66,b)].
0.68/1.03	Derived: min_precedes(f15(A,B),A,B) | legal(A) | min_precedes(A,f16(A,B),B) | -min_precedes(C,A,B).  [resolve(71,a,68,a)].
0.68/1.03	72 -leaf(A,B) | min_precedes(f15(A,B),A,B) | subactivity(f2(B,A),B).  [resolve(60,c,54,a)].
0.68/1.03	Derived: min_precedes(f15(A,f1(A,B)),A,f1(A,B)) | subactivity(f2(f1(A,B),A),f1(A,B)) | -leaf_occ(A,B).  [resolve(72,a,66,b)].
0.68/1.03	Derived: min_precedes(f15(A,B),A,B) | subactivity(f2(B,A),B) | min_precedes(A,f16(A,B),B) | -min_precedes(C,A,B).  [resolve(72,a,68,a)].
0.68/1.03	73 -leaf(A,B) | min_precedes(f15(A,B),A,B) | atocc(A,f2(B,A)).  [resolve(60,c,55,a)].
0.68/1.03	Derived: min_precedes(f15(A,f1(A,B)),A,f1(A,B)) | atocc(A,f2(f1(A,B),A)) | -leaf_occ(A,B).  [resolve(73,a,66,b)].
0.68/1.03	Derived: min_precedes(f15(A,B),A,B) | atocc(A,f2(B,A)) | min_precedes(A,f16(A,B),B) | -min_precedes(C,A,B).  [resolve(73,a,68,a)].
0.68/1.03	74 -leaf(A,B) | min_precedes(f15(A,B),A,B) | atomic(B) | subactivity_occurrence(A,f3(B,A)).  [resolve(60,c,56,a)].
0.68/1.03	Derived: min_precedes(f15(A,f1(A,B)),A,f1(A,B)) | atomic(f1(A,B)) | subactivity_occurrence(A,f3(f1(A,B),A)) | -leaf_occ(A,B).  [resolve(74,a,66,b)].
0.68/1.03	Derived: min_precedes(f15(A,B),A,B) | atomic(B) | subactivity_occurrence(A,f3(B,A)) | min_precedes(A,f16(A,B),B) | -min_precedes(C,A,B).  [resolve(74,a,68,a)].
0.68/1.03	75 -leaf(A,B) | min_precedes(f15(A,B),A,B) | atomic(B) | occurrence_of(f3(B,A),B).  [resolve(60,c,57,a)].
0.68/1.03	Derived: min_precedes(f15(A,f1(A,B)),A,f1(A,B)) | atomic(f1(A,B)) | occurrence_of(f3(f1(A,B),A),f1(A,B)) | -leaf_occ(A,B).  [resolve(75,a,66,b)].
0.68/1.03	Derived: min_precedes(f15(A,B),A,B) | atomic(B) | occurrence_of(f3(B,A),B) | min_precedes(A,f16(A,B),B) | -min_precedes(C,A,B).  [resolve(75,a,68,a)].
0.68/1.03	76 -leaf(A,B) | min_precedes(f15(A,B),A,B) | -occurrence_of(C,B) | -subactivity_occurrence(A,C) | root_occ(A,C).  [resolve(60,c,58,c)].
0.68/1.03	Derived: min_precedes(f15(A,f1(A,B)),A,f1(A,B)) | -occurrence_of(C,f1(A,B)) | -subactivity_occurrence(A,C) | root_occ(A,C) | -leaf_occ(A,B).  [resolve(76,a,66,b)].
0.68/1.03	Derived: min_precedes(f15(A,B),A,B) | -occurrence_of(C,B) | -subactivity_occurrence(A,C) | root_occ(A,C) | min_precedes(A,f16(A,B),B) | -min_precedes(D,A,B).  [resolve(76,a,68,a)].
0.68/1.03	77 leaf(A,f13(A,B)) | min_precedes(A,f16(A,f13(A,B)),f13(A,B)) | -root_occ(A,B).  [resolve(61,c,52,a)].
0.68/1.03	Derived: min_precedes(A,f16(A,f13(A,B)),f13(A,B)) | -root_occ(A,B) | leaf_occ(A,C) | -occurrence_of(C,f13(A,B)) | -subactivity_occurrence(A,C).  [resolve(77,a,65,d)].
0.68/1.03	Derived: min_precedes(A,f16(A,f13(A,B)),f13(A,B)) | -root_occ(A,B) | -min_precedes(A,C,f13(A,B)).  [resolve(77,a,67,a)].
0.68/1.03	Derived: min_precedes(A,f16(A,f13(A,B)),f13(A,B)) | -root_occ(A,B) | atomic(f13(A,B)) | occurrence_of(f17(A,f13(A,B)),f13(A,B)).  [resolve(77,a,69,b)].
0.68/1.03	Derived: min_precedes(A,f16(A,f13(A,B)),f13(A,B)) | -root_occ(A,B) | atomic(f13(A,B)) | leaf_occ(A,f17(A,f13(A,B))).  [resolve(77,a,70,b)].
0.68/1.03	Derived: min_precedes(A,f16(A,f13(A,B)),f13(A,B)) | -root_occ(A,B) | min_precedes(f15(A,f13(A,B)),A,f13(A,B)) | legal(A).  [resolve(77,a,71,a)].
0.68/1.03	Derived: min_precedes(A,f16(A,f13(A,B)),f13(A,B)) | -root_occ(A,B) | min_precedes(f15(A,f13(A,B)),A,f13(A,B)) | subactivity(f2(f13(A,B),A),f13(A,B)).  [resolve(77,a,72,a)].
0.68/1.03	Derived: min_precedes(A,f16(A,f13(A,B)),f13(A,B)) | -root_occ(A,B) | min_precedes(f15(A,f13(A,B)),A,f13(A,B)) | atocc(A,f2(f13(A,B),A)).  [resolve(77,a,73,a)].
0.68/1.03	Derived: min_precedes(A,f16(A,f13(A,B)),f13(A,B)) | -root_occ(A,B) | min_precedes(f15(A,f13(A,B)),A,f13(A,B)) | atomic(f13(A,B)) | subactivity_occurrence(A,f3(f13(A,B),A)).  [resolve(77,a,74,a)].
0.68/1.03	Derived: min_precedes(A,f16(A,f13(A,B)),f13(A,B)) | -root_occ(A,B) | min_precedes(f15(A,f13(A,B)),A,f13(A,B)) | atomic(f13(A,B)) | occurrence_of(f3(f13(A,B),A),f13(A,B)).  [resolve(77,a,75,a)].
0.68/1.03	Derived: min_precedes(A,f16(A,f13(A,B)),f13(A,B)) | -root_occ(A,B) | min_precedes(f15(A,f13(A,B)),A,f13(A,B)) | -occurrence_of(C,f13(A,B)) | -subactivity_occurrence(A,C) | root_occ(A,C).  [resolve(77,a,76,a)].
0.68/1.03	78 leaf(A,B) | min_precedes(A,f16(A,B),B) | -legal(A) | -atocc(A,B).  [resolve(61,c,59,c)].
0.68/1.03	Derived: min_precedes(A,f16(A,B),B) | -legal(A) | -atocc(A,B) | leaf_occ(A,C) | -occurrence_of(C,B) | -subactivity_occurrence(A,C).  [resolve(78,a,65,d)].
0.68/1.03	Derived: min_precedes(A,f16(A,B),B) | -legal(A) | -atocc(A,B) | -min_precedes(A,C,B).  [resolve(78,a,67,a)].
0.68/1.03	Derived: min_precedes(A,f16(A,B),B) | -legal(A) | -atocc(A,B) | atomic(B) | occurrence_of(f17(A,B),B).  [resolve(78,a,69,b)].
0.68/1.03	Derived: min_precedes(A,f16(A,B),B) | -legal(A) | -atocc(A,B) | atomic(B) | leaf_occ(A,f17(A,B)).  [resolve(78,a,70,b)].
0.68/1.03	Derived: min_precedes(A,f16(A,B),B) | -legal(A) | -atocc(A,B) | min_precedes(f15(A,B),A,B) | subactivity(f2(B,A),B).  [resolve(78,a,72,a)].
0.68/1.03	Derived: min_precedes(A,f16(A,B),B) | -legal(A) | -atocc(A,B) | min_precedes(f15(A,B),A,B) | atocc(A,f2(B,A)).  [resolve(78,a,73,a)].
0.68/1.03	Derived: min_precedes(A,f16(A,B),B) | -legal(A) | -atocc(A,B) | min_precedes(f15(A,B),A,B) | atomic(B) | subactivity_occurrence(A,f3(B,A)).  [resolve(78,a,74,a)].
0.68/1.03	Derived: min_precedes(A,f16(A,B),B) | -legal(A) | -atocc(A,B) | min_precedes(f15(A,B),A,B) | atomic(B) | occurrence_of(f3(B,A),B).  [resolve(78,a,75,a)].
0.68/1.03	Derived: min_precedes(A,f16(A,B),B) | -legal(A) | -atocc(A,B) | min_precedes(f15(A,B),A,B) | -occurrence_of(C,B) | -subactivity_occurrence(A,C) | root_occ(A,C).  [resolve(78,a,76,a)].
0.68/1.03	79 -min_precedes(A,B,C) | -leaf(B,C) | min_precedes(f15(B,C),B,C).  [resolve(62,b,60,c)].
0.68/1.03	Derived: -min_precedes(A,B,f1(B,C)) | min_precedes(f15(B,f1(B,C)),B,f1(B,C)) | -leaf_occ(B,C).  [resolve(79,b,66,b)].
0.68/1.03	Derived: -min_precedes(A,B,C) | min_precedes(f15(B,C),B,C) | min_precedes(B,f16(B,C),C) | -min_precedes(D,B,C).  [resolve(79,b,68,a)].
0.68/1.03	80 -min_precedes(A,B,C) | leaf(f18(A,B,C),C) | min_precedes(f18(A,B,C),f16(f18(A,B,C),C),C).  [resolve(63,b,61,c)].
0.68/1.03	Derived: -min_precedes(A,B,C) | min_precedes(f18(A,B,C),f16(f18(A,B,C),C),C) | leaf_occ(f18(A,B,C),D) | -occurrence_of(D,C) | -subactivity_occurrence(f18(A,B,C),D).  [resolve(80,b,65,d)].
0.68/1.03	Derived: -min_precedes(A,B,C) | min_precedes(f18(A,B,C),f16(f18(A,B,C),C),C) | -min_precedes(f18(A,B,C),D,C).  [resolve(80,b,67,a)].
0.68/1.03	Derived: -min_precedes(A,B,C) | min_precedes(f18(A,B,C),f16(f18(A,B,C),C),C) | atomic(C) | occurrence_of(f17(f18(A,B,C),C),C).  [resolve(80,b,69,b)].
0.68/1.03	Derived: -min_precedes(A,B,C) | min_precedes(f18(A,B,C),f16(f18(A,B,C),C),C) | atomic(C) | leaf_occ(f18(A,B,C),f17(f18(A,B,C),C)).  [resolve(80,b,70,b)].
0.68/1.03	Derived: -min_precedes(A,B,C) | min_precedes(f18(A,B,C),f16(f18(A,B,C),C),C) | min_precedes(f15(f18(A,B,C),C),f18(A,B,C),C) | legal(f18(A,B,C)).  [resolve(80,b,71,a)].
0.68/1.03	Derived: -min_precedes(A,B,C) | min_precedes(f18(A,B,C),f16(f18(A,B,C),C),C) | min_precedes(f15(f18(A,B,C),C),f18(A,B,C),C) | subactivity(f2(C,f18(A,B,C)),C).  [resolve(80,b,72,a)].
0.68/1.03	Derived: -min_precedes(A,B,C) | min_precedes(f18(A,B,C),f16(f18(A,B,C),C),C) | min_precedes(f15(f18(A,B,C),C),f18(A,B,C),C) | atocc(f18(A,B,C),f2(C,f18(A,B,C))).  [resolve(80,b,73,a)].
0.68/1.03	Derived: -min_precedes(A,B,C) | min_precedes(f18(A,B,C),f16(f18(A,B,C),C),C) | min_precedes(f15(f18(A,B,C),C),f18(A,B,C),C) | atomic(C) | subactivity_occurrence(f18(A,B,C),f3(C,f18(A,B,C))).  [resolve(80,b,74,a)].
0.68/1.03	Derived: -min_precedes(A,B,C) | min_precedes(f18(A,B,C),f16(f18(A,B,C),C),C) | min_precedes(f15(f18(A,B,C),C),f18(A,B,C),C) | atomic(C) | occurrence_of(f3(C,f18(A,B,C)),C).  [resolve(80,b,75,a)].
0.68/1.03	Derived: -min_precedes(A,B,C) | min_precedes(f18(A,B,C),f16(f18(A,B,C),C),C) | min_precedes(f15(f18(A,B,C),C),f18(A,B,C),C) | -occurrence_of(D,C) | -subactivity_occurrence(f18(A,B,C),D) | root_occ(f18(A,B,C),D).  [resolve(80,b,76,a)].
0.68/1.03	81 atomic(A) | -occurrence_of(B,A) | leaf(f19(A,B),A) | min_precedes(f19(A,B),f16(f19(A,B),A),A).  [resolve(64,c,61,c)].
0.68/1.03	Derived: atomic(A) | -occurrence_of(B,A) | min_precedes(f19(A,B),f16(f19(A,B),A),A) | leaf_occ(f19(A,B),C) | -occurrence_of(C,A) | -subactivity_occurrence(f19(A,B),C).  [resolve(81,c,65,d)].
0.68/1.03	Derived: atomic(A) | -occurrence_of(B,A) | min_precedes(f19(A,B),f16(f19(A,B),A),A) | -min_precedes(f19(A,B),C,A).  [resolve(81,c,67,a)].
0.68/1.03	Derived: atomic(A) | -occurrence_of(B,A) | min_precedes(f19(A,B),f16(f19(A,B),A),A) | atomic(A) | occurrence_of(f17(f19(A,B),A),A).  [resolve(81,c,69,b)].
0.68/1.03	Derived: atomic(A) | -occurrence_of(B,A) | min_precedes(f19(A,B),f16(f19(A,B),A),A) | atomic(A) | leaf_occ(f19(A,B),f17(f19(A,B),A)).  [resolve(81,c,70,b)].
0.68/1.03	Derived: atomic(A) | -occurrence_of(B,A) | min_precedes(f19(A,B),f16(f19(A,B),A),A) | min_precedes(f15(f19(A,B),A),f19(A,B),A) | legal(f19(A,B)).  [resolve(81,c,71,a)].
0.68/1.03	Derived: atomic(A) | -occurrence_of(B,A) | min_precedes(f19(A,B),f16(f19(A,B),A),A) | min_precedes(f15(f19(A,B),A),f19(A,B),A) | subactivity(f2(A,f19(A,B)),A).  [resolve(81,c,72,a)].
0.68/1.03	Derived: atomic(A) | -occurrence_of(B,A) | min_precedes(f19(A,B),f16(f19(A,B),A),A) | min_precedes(f15(f19(A,B),A),f19(A,B),A) | atocc(f19(A,B),f2(A,f19(A,B))).  [resolve(81,c,73,a)].
0.68/1.03	Derived: atomic(A) | -occurrence_of(B,A) | min_precedes(f19(A,B),f16(f19(A,B),A),A) | min_precedes(f15(f19(A,B),A),f19(A,B),A) | atomic(A) | subactivity_occurrence(f19(A,B),f3(A,f19(A,B))).  [resolve(81,c,74,a)].
0.68/1.03	Derived: atomic(A) | -occurrence_of(B,A) | min_precedes(f19(A,B),f16(f19(A,B),A),A) | min_precedes(f15(f19(A,B),A),f19(A,B),A) | atomic(A) | occurrence_of(f3(A,f19(A,B)),A).  [resolve(81,c,75,a)].
0.68/1.03	Derived: atomic(A) | -occurrence_of(B,A) | min_precedes(f19(A,B),f16(f19(A,B),A),A) | min_precedes(f15(f19(A,B),A),f19(A,B),A) | -occurrence_of(C,A) | -subactivity_occurrence(f19(A,B),C) | root_occ(f19(A,B),C).  [resolve(81,c,76,a)].
0.68/1.04	82 -activity(A) | subactivity(A,A) # label(sos_03) # label(axiom).  [clausify(47)].
0.68/1.04	83 -occurrence_of(A,B) | activity(B) # label(sos) # label(axiom).  [clausify(3)].
0.68/1.04	84 activity(tptp0) # label(sos_50) # label(axiom).  [assumption].
0.68/1.04	85 -activity_occurrence(A) | activity(f14(A)) # label(sos_01) # label(axiom).  [clausify(37)].
0.68/1.04	Derived: subactivity(A,A) | -occurrence_of(B,A).  [resolve(82,a,83,b)].
0.68/1.04	Derived: subactivity(tptp0,tptp0).  [resolve(82,a,84,a)].
0.68/1.04	Derived: subactivity(f14(A),f14(A)) | -activity_occurrence(A).  [resolve(82,a,85,b)].
0.68/1.04	86 -activity_occurrence(A) | occurrence_of(A,f14(A)) # label(sos_01) # label(axiom).  [clausify(37)].
0.68/1.04	87 -occurrence_of(A,B) | activity_occurrence(A) # label(sos) # label(axiom).  [clausify(3)].
0.68/1.04	88 -subactivity_occurrence(A,B) | activity_occurrence(A) # label(sos_24) # label(axiom).  [clausify(15)].
0.68/1.04	89 -subactivity_occurrence(A,B) | activity_occurrence(B) # label(sos_24) # label(axiom).  [clausify(15)].
0.68/1.04	Derived: occurrence_of(A,f14(A)) | -occurrence_of(A,B).  [resolve(86,a,87,b)].
0.68/1.04	Derived: occurrence_of(A,f14(A)) | -subactivity_occurrence(A,B).  [resolve(86,a,88,b)].
0.68/1.04	Derived: occurrence_of(A,f14(A)) | -subactivity_occurrence(B,A).  [resolve(86,a,89,b)].
0.68/1.04	90 subactivity(f14(A),f14(A)) | -activity_occurrence(A).  [resolve(82,a,85,b)].
0.68/1.04	Derived: subactivity(f14(A),f14(A)) | -occurrence_of(A,B).  [resolve(90,b,87,b)].
0.68/1.04	Derived: subactivity(f14(A),f14(A)) | -subactivity_occurrence(A,B).  [resolve(90,b,88,b)].
0.68/1.04	Derived: subactivity(f14(A),f14(A)) | -subactivity_occurrence(B,A).  [resolve(90,b,89,b)].
0.68/1.04	91 -atocc(A,B) | subactivity(B,f10(A,B)) # label(sos_23) # label(axiom).  [clausify(33)].
0.68/1.04	92 -occurrence_of(A,B) | -subactivity(C,B) | subactivity_occurrence(D,A) | -occurrence_of(D,C) | subactivity_occurrence(f4(C,B,D,A),A) # label(sos_32) # label(axiom).  [clausify(18)].
0.68/1.04	93 -occurrence_of(A,B) | -subactivity(C,B) | subactivity_occurrence(D,A) | -occurrence_of(D,C) | -subactivity_occurrence(f4(C,B,D,A),D) # label(sos_32) # label(axiom).  [clausify(18)].
0.68/1.04	Derived: -atocc(A,B) | -occurrence_of(C,f10(A,B)) | subactivity_occurrence(D,C) | -occurrence_of(D,B) | subactivity_occurrence(f4(B,f10(A,B),D,C),C).  [resolve(91,b,92,b)].
0.68/1.04	Derived: -atocc(A,B) | -occurrence_of(C,f10(A,B)) | subactivity_occurrence(D,C) | -occurrence_of(D,B) | -subactivity_occurrence(f4(B,f10(A,B),D,C),D).  [resolve(91,b,93,b)].
0.68/1.04	94 atocc(A,B) | -occurrence_of(A,C) | -atomic(C) | -subactivity(B,C) # label(sos_23) # label(axiom).  [clausify(33)].
0.68/1.04	Derived: atocc(A,B) | -occurrence_of(A,f10(C,B)) | -atomic(f10(C,B)) | -atocc(C,B).  [resolve(94,d,91,b)].
0.68/1.04	95 -min_precedes(A,B,C) | subactivity(f12(C,A,B),C) # label(sos_11) # label(axiom).  [clausify(35)].
0.68/1.04	Derived: -min_precedes(A,B,C) | -occurrence_of(D,C) | subactivity_occurrence(E,D) | -occurrence_of(E,f12(C,A,B)) | subactivity_occurrence(f4(f12(C,A,B),C,E,D),D).  [resolve(95,b,92,b)].
0.68/1.04	Derived: -min_precedes(A,B,C) | -occurrence_of(D,C) | subactivity_occurrence(E,D) | -occurrence_of(E,f12(C,A,B)) | -subactivity_occurrence(f4(f12(C,A,B),C,E,D),E).  [resolve(95,b,93,b)].
0.68/1.04	Derived: -min_precedes(A,B,C) | atocc(D,f12(C,A,B)) | -occurrence_of(D,C) | -atomic(C).  [resolve(95,b,94,d)].
0.68/1.04	96 -min_precedes(A,B,C) | subactivity(f11(C,A,B),C) # label(sos_11) # label(axiom).  [clausify(35)].
0.68/1.04	Derived: -min_precedes(A,B,C) | -occurrence_of(D,C) | subactivity_occurrence(E,D) | -occurrence_of(E,f11(C,A,B)) | subactivity_occurrence(f4(f11(C,A,B),C,E,D),D).  [resolve(96,b,92,b)].
0.68/1.04	Derived: -min_precedes(A,B,C) | -occurrence_of(D,C) | subactivity_occurrence(E,D) | -occurrence_of(E,f11(C,A,B)) | -subactivity_occurrence(f4(f11(C,A,B),C,E,D),E).  [resolve(96,b,93,b)].
0.68/1.04	Derived: -min_precedes(A,B,C) | atocc(D,f11(C,A,B)) | -occurrence_of(D,C) | -atomic(C).  [resolve(96,b,94,d)].
0.68/1.04	97 -occurrence_of(A,B) | -subactivity_occurrence(A,C) | atomic(B) | -occurrence_of(C,D) | subactivity(B,D) # label(sos_30) # label(axiom).  [clausify(49)].
0.68/1.04	Derived: -occurrence_of(A,B) | -subactivity_occurrence(A,C) | atomic(B) | -occurrence_of(C,D) | -occurrence_of(E,D) | subactivity_occurrence(F,E) | -occurrence_of(F,B) | subactivity_occurrence(f4(B,D,F,E),E).  [resolve(97,e,92,b)].
0.68/1.04	Derived: -occurrence_of(A,B) | -subactivity_occurrence(A,C) | atomic(B) | -occurrence_of(C,D) | -occurrence_of(E,D) | subactivity_occurrence(F,E) | -occurrence_of(F,B) | -subactivity_occurrence(f4(B,D,F,E),F).  [resolve(97,e,93,b)].
0.68/1.04	Derived: -occurrence_of(A,B) | -subactivity_occurrence(A,C) | atomic(B) | -occurrence_of(C,D) | atocc(E,B) | -occurrence_of(E,D) | -atomic(D).  [resolve(97,e,94,d)].
0.68/1.04	98 -root_occ(A,B) | subactivity(f2(f13(A,B),A),f13(A,B)).  [resolve(52,a,54,a)].
0.68/1.04	Derived: -root_occ(A,B) | -occurrence_of(C,f13(A,B)) | subactivity_occurrence(D,C) | -occurrence_of(D,f2(f13(A,B),A)) | subactivity_occurrence(f4(f2(f13(A,B),A),f13(A,B),D,C),C).  [resolve(98,b,92,b)].
0.68/1.04	Derived: -root_occ(A,B) | -occurrence_of(C,f13(A,B)) | subactivity_occurrence(D,C) | -occurrence_of(D,f2(f13(A,B),A)) | -subactivity_occurrence(f4(f2(f13(A,B),A),f13(A,B),D,C),D).  [resolve(98,b,93,b)].
0.68/1.04	Derived: -root_occ(A,B) | atocc(C,f2(f13(A,B),A)) | -occurrence_of(C,f13(A,B)) | -atomic(f13(A,B)).  [resolve(98,b,94,d)].
0.68/1.04	99 -legal(A) | -atocc(A,B) | subactivity(f2(B,A),B).  [resolve(59,c,54,a)].
0.68/1.04	Derived: -legal(A) | -atocc(A,B) | -occurrence_of(C,B) | subactivity_occurrence(D,C) | -occurrence_of(D,f2(B,A)) | subactivity_occurrence(f4(f2(B,A),B,D,C),C).  [resolve(99,c,92,b)].
0.68/1.04	Derived: -legal(A) | -atocc(A,B) | -occurrence_of(C,B) | subactivity_occurrence(D,C) | -occurrence_of(D,f2(B,A)) | -subactivity_occurrence(f4(f2(B,A),B,D,C),D).  [resolve(99,c,93,b)].
0.68/1.04	Derived: -legal(A) | -atocc(A,B) | atocc(C,f2(B,A)) | -occurrence_of(C,B) | -atomic(B).  [resolve(99,c,94,d)].
0.68/1.04	100 -min_precedes(A,B,C) | subactivity(f2(C,f18(A,B,C)),C).  [resolve(63,b,54,a)].
0.68/1.04	Derived: -min_precedes(A,B,C) | -occurrence_of(D,C) | subactivity_occurrence(E,D) | -occurrence_of(E,f2(C,f18(A,B,C))) | subactivity_occurrence(f4(f2(C,f18(A,B,C)),C,E,D),D).  [resolve(100,b,92,b)].
0.68/1.04	Derived: -min_precedes(A,B,C) | -occurrence_of(D,C) | subactivity_occurrence(E,D) | -occurrence_of(E,f2(C,f18(A,B,C))) | -subactivity_occurrence(f4(f2(C,f18(A,B,C)),C,E,D),E).  [resolve(100,b,93,b)].
0.68/1.04	Derived: -min_precedes(A,B,C) | atocc(D,f2(C,f18(A,B,C))) | -occurrence_of(D,C) | -atomic(C).  [resolve(100,b,94,d)].
0.68/1.04	101 atomic(A) | -occurrence_of(B,A) | subactivity(f2(A,f19(A,B)),A).  [resolve(64,c,54,a)].
0.68/1.04	Derived: atomic(A) | -occurrence_of(B,A) | -occurrence_of(C,A) | subactivity_occurrence(D,C) | -occurrence_of(D,f2(A,f19(A,B))) | subactivity_occurrence(f4(f2(A,f19(A,B)),A,D,C),C).  [resolve(101,c,92,b)].
0.68/1.04	Derived: atomic(A) | -occurrence_of(B,A) | -occurrence_of(C,A) | subactivity_occurrence(D,C) | -occurrence_of(D,f2(A,f19(A,B))) | -subactivity_occurrence(f4(f2(A,f19(A,B)),A,D,C),D).  [resolve(101,c,93,b)].
0.68/1.04	102 min_precedes(f15(A,f1(A,B)),A,f1(A,B)) | subactivity(f2(f1(A,B),A),f1(A,B)) | -leaf_occ(A,B).  [resolve(72,a,66,b)].
0.68/1.04	Derived: min_precedes(f15(A,f1(A,B)),A,f1(A,B)) | -leaf_occ(A,B) | -occurrence_of(C,f1(A,B)) | subactivity_occurrence(D,C) | -occurrence_of(D,f2(f1(A,B),A)) | subactivity_occurrence(f4(f2(f1(A,B),A),f1(A,B),D,C),C).  [resolve(102,b,92,b)].
0.68/1.04	Derived: min_precedes(f15(A,f1(A,B)),A,f1(A,B)) | -leaf_occ(A,B) | -occurrence_of(C,f1(A,B)) | subactivity_occurrence(D,C) | -occurrence_of(D,f2(f1(A,B),A)) | -subactivity_occurrence(f4(f2(f1(A,B),A),f1(A,B),D,C),D).  [resolve(102,b,93,b)].
0.68/1.04	Derived: min_precedes(f15(A,f1(A,B)),A,f1(A,B)) | -leaf_occ(A,B) | atocc(C,f2(f1(A,B),A)) | -occurrence_of(C,f1(A,B)) | -atomic(f1(A,B)).  [resolve(102,b,94,d)].
0.68/1.04	103 min_precedes(f15(A,B),A,B) | subactivity(f2(B,A),B) | min_precedes(A,f16(A,B),B) | -min_precedes(C,A,B).  [resolve(72,a,68,a)].
0.68/1.04	104 min_precedes(A,f16(A,f13(A,B)),f13(A,B)) | -root_occ(A,B) | min_precedes(f15(A,f13(A,B)),A,f13(A,B)) | subactivity(f2(f13(A,B),A),f13(A,B)).  [resolve(77,a,72,a)].
0.68/1.04	105 min_precedes(A,f16(A,B),B) | -legal(A) | -atocc(A,B) | min_precedes(f15(A,B),A,B) | subactivity(f2(B,A),B).  [resolve(78,a,72,a)].
0.68/1.04	106 -min_precedes(A,B,C) | min_precedes(f18(A,B,C),f16(f18(A,B,C),C),C) | min_precedes(f15(f18(A,B,C),C),f18(A,B,C),C) | subactivity(f2(C,f18(A,B,C)),C).  [resolve(80,b,72,a)].
0.87/1.18	107 atomic(A) | -occurrence_of(B,A) | min_precedes(f19(A,B),f16(f19(A,B),A),A) | min_precedes(f15(f19(A,B),A),f19(A,B),A) | subactivity(f2(A,f19(A,B)),A).  [resolve(81,c,72,a)].
0.87/1.18	108 subactivity(A,A) | -occurrence_of(B,A).  [resolve(82,a,83,b)].
0.87/1.18	Derived: -occurrence_of(A,B) | -occurrence_of(C,B) | subactivity_occurrence(D,C) | -occurrence_of(D,B) | subactivity_occurrence(f4(B,B,D,C),C).  [resolve(108,a,92,b)].
0.87/1.18	Derived: -occurrence_of(A,B) | -occurrence_of(C,B) | subactivity_occurrence(D,C) | -occurrence_of(D,B) | -subactivity_occurrence(f4(B,B,D,C),D).  [resolve(108,a,93,b)].
0.87/1.18	Derived: -occurrence_of(A,B) | atocc(C,B) | -occurrence_of(C,B) | -atomic(B).  [resolve(108,a,94,d)].
0.87/1.18	109 subactivity(tptp0,tptp0).  [resolve(82,a,84,a)].
0.87/1.18	110 subactivity(f14(A),f14(A)) | -occurrence_of(A,B).  [resolve(90,b,87,b)].
0.87/1.18	111 subactivity(f14(A),f14(A)) | -subactivity_occurrence(A,B).  [resolve(90,b,88,b)].
0.87/1.18	112 subactivity(f14(A),f14(A)) | -subactivity_occurrence(B,A).  [resolve(90,b,89,b)].
0.87/1.18	113 earlier(A,B) | -precedes(A,B) # label(sos_10) # label(axiom).  [clausify(22)].
0.87/1.18	114 -earlier(A,B) | -legal(B) | precedes(A,B) # label(sos_10) # label(axiom).  [clausify(22)].
0.87/1.18	115 legal(A) | -precedes(B,A) # label(sos_10) # label(axiom).  [clausify(22)].
0.87/1.18	116 -min_precedes(A,B,C) | -min_precedes(D,B,C) | -precedes(A,D) | min_precedes(A,D,C) # label(sos_20) # label(axiom).  [clausify(28)].
0.87/1.18	Derived: -min_precedes(A,B,C) | -min_precedes(D,B,C) | min_precedes(A,D,C) | -earlier(A,D) | -legal(D).  [resolve(116,c,114,c)].
0.87/1.18	117 -min_precedes(A,B,C) | -min_precedes(A,D,C) | -precedes(B,D) | min_precedes(B,D,C) # label(sos_18) # label(axiom).  [clausify(39)].
0.87/1.18	Derived: -min_precedes(A,B,C) | -min_precedes(A,D,C) | min_precedes(B,D,C) | -earlier(B,D) | -legal(D).  [resolve(117,c,114,c)].
0.87/1.18	118 -min_precedes(A,B,C) | precedes(A,B) # label(sos_15) # label(axiom).  [clausify(41)].
0.87/1.18	Derived: -min_precedes(A,B,C) | earlier(A,B).  [resolve(118,b,113,b)].
0.87/1.18	Derived: -min_precedes(A,B,C) | legal(B).  [resolve(118,b,115,b)].
0.87/1.18	Derived: -min_precedes(A,B,C) | -min_precedes(A,D,E) | -min_precedes(B,D,E) | min_precedes(A,B,E).  [resolve(118,b,116,c)].
0.87/1.18	Derived: -min_precedes(A,B,C) | -min_precedes(D,A,E) | -min_precedes(D,B,E) | min_precedes(A,B,E).  [resolve(118,b,117,c)].
0.87/1.18	
0.87/1.18	============================== end predicate elimination =============
0.87/1.18	
0.87/1.18	Auto_denials:  (non-Horn, no changes).
0.87/1.18	
0.87/1.18	Term ordering decisions:
0.87/1.18	Function symbol KB weights:  tptp0=1. tptp1=1. tptp2=1. tptp3=1. tptp4=1. c1=1. f1=1. f2=1. f3=1. f10=1. f13=1. f15=1. f16=1. f17=1. f19=1. f20=1. f21=1. f7=1. f8=1. f9=1. f14=1. f5=1. f6=1. f11=1. f12=1. f18=1. f4=1.
0.87/1.18	
0.87/1.18	============================== end of process initial clauses ========
0.87/1.18	
0.87/1.18	============================== CLAUSES FOR SEARCH ====================
0.87/1.18	
0.87/1.18	============================== end of clauses for search =============
0.87/1.18	
0.87/1.18	============================== SEARCH ================================
0.87/1.18	
0.87/1.18	% Starting search at 0.05 seconds.
0.87/1.18	
0.87/1.18	============================== PROOF =================================
0.87/1.18	% SZS status Theorem
0.87/1.18	% SZS output start Refutation
0.87/1.18	
0.87/1.18	% Proof 1 at 0.17 (+ 0.01) seconds.
0.87/1.18	% Length of proof is 20.
0.87/1.18	% Level of proof is 6.
0.87/1.18	% Maximum clause weight is 15.000.
0.87/1.18	% Given clauses 361.
0.87/1.18	
0.87/1.18	2 (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.87/1.18	26 (all X161 (occurrence_of(X161,tptp0) -> (exists X162 exists X163 exists X164 (root_occ(X162,X161) & (occurrence_of(X164,tptp1) | occurrence_of(X164,tptp2)) & leaf_occ(X164,X161) & next_subocc(X163,X164,tptp0) & next_subocc(X162,X163,tptp0) & occurrence_of(X163,tptp4) & occurrence_of(X162,tptp3))))) # label(sos_49) # label(axiom) # label(non_clause).  [assumption].
0.87/1.18	31 (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.87/1.18	42 (all X56 all X57 (leaf(X56,X57) <-> -(exists X59 min_precedes(X56,X59,X57)) & ((exists X58 min_precedes(X58,X56,X57)) | root(X56,X57)))) # label(sos_21) # label(axiom) # label(non_clause).  [assumption].
0.87/1.19	51 -(all X165 (occurrence_of(X165,tptp0) -> (exists X166 exists X167 ((occurrence_of(X167,tptp2) -> -(exists X169 (occurrence_of(X169,tptp1) & min_precedes(X166,X169,tptp0)))) & (occurrence_of(X167,tptp1) -> -(exists X168 (min_precedes(X166,X168,tptp0) & occurrence_of(X168,tptp2)))) & leaf_occ(X167,X165))))) # label(goals) # label(negated_conjecture) # label(non_clause).  [assumption].
0.87/1.19	66 -leaf_occ(A,B) | leaf(A,f1(A,B)) # label(sos_34) # label(axiom).  [clausify(2)].
0.87/1.19	67 -leaf(A,B) | -min_precedes(A,C,B) # label(sos_21) # label(axiom).  [clausify(42)].
0.87/1.19	119 -leaf_occ(A,B) | occurrence_of(B,f1(A,B)) # label(sos_34) # label(axiom).  [clausify(2)].
0.87/1.19	153 -occurrence_of(A,tptp0) | leaf_occ(f9(A),A) # label(sos_49) # label(axiom).  [clausify(26)].
0.87/1.19	168 -occurrence_of(A,B) | -occurrence_of(A,C) | C = B # label(sos_02) # label(axiom).  [clausify(31)].
0.87/1.19	184 occurrence_of(c1,tptp0) # label(goals) # label(negated_conjecture).  [clausify(51)].
0.87/1.19	192 min_precedes(A,f20(A,B),tptp0) | min_precedes(A,f21(A,B),tptp0) | -leaf_occ(B,c1) # label(goals) # label(negated_conjecture).  [clausify(51)].
0.87/1.19	220 -min_precedes(A,B,f1(A,C)) | -leaf_occ(A,C).  [resolve(67,a,66,b)].
0.87/1.19	317 -occurrence_of(c1,A) | tptp0 = A.  [resolve(184,a,168,b)].
0.87/1.19	323 leaf_occ(f9(c1),c1).  [resolve(184,a,153,a)].
0.87/1.19	377 min_precedes(A,f20(A,f9(c1)),tptp0) | min_precedes(A,f21(A,f9(c1)),tptp0).  [resolve(323,a,192,c)].
0.87/1.19	387 occurrence_of(c1,f1(f9(c1),c1)).  [resolve(323,a,119,a)].
0.87/1.19	526 f1(f9(c1),c1) = tptp0.  [resolve(387,a,317,a),flip(a)].
0.87/1.19	772 -min_precedes(f9(c1),A,tptp0).  [para(526(a,1),220(a,3)),unit_del(b,323)].
0.87/1.19	1465 $F.  [resolve(377,b,772,a),unit_del(a,772)].
0.87/1.19	
0.87/1.19	% SZS output end Refutation
0.87/1.19	============================== end of proof ==========================
0.87/1.19	
0.87/1.19	============================== STATISTICS ============================
0.87/1.19	
0.87/1.19	Given=361. Generated=2259. Kept=1336. proofs=1.
0.87/1.19	Usable=344. Sos=796. Demods=8. Limbo=6, Disabled=444. Hints=0.
0.87/1.19	Megabytes=2.55.
0.87/1.19	User_CPU=0.17, System_CPU=0.01, Wall_clock=1.
0.87/1.19	
0.87/1.19	============================== end of statistics =====================
0.87/1.19	
0.87/1.19	============================== end of search =========================
0.87/1.19	
0.87/1.19	THEOREM PROVED
0.87/1.19	% SZS status Theorem
0.87/1.19	
0.87/1.19	Exiting with 1 proof.
0.87/1.19	
0.87/1.19	Process 24700 exit (max_proofs) Wed Jul 30 02:00:35 2025
0.87/1.19	Prover9 interrupted
0.87/1.19	EOF