0.00/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.13/0.14	% Command    : tptp2X_and_run_prover9 %d %s
0.14/0.35	% Computer   : n022.cluster.edu
0.14/0.35	% Model      : x86_64 x86_64
0.14/0.35	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.35	% Memory     : 8042.1875MB
0.14/0.35	% OS         : Linux 3.10.0-693.el7.x86_64
0.14/0.35	% CPULimit   : 960
0.14/0.35	% DateTime   : Thu Jul  2 06:54:02 EDT 2020
0.14/0.35	% CPUTime    : 
0.81/1.10	============================== Prover9 ===============================
0.81/1.10	Prover9 (32) version 2009-11A, November 2009.
0.81/1.10	Process 30443 was started by sandbox2 on n022.cluster.edu,
0.81/1.10	Thu Jul  2 06:54:03 2020
0.81/1.10	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_30290_n022.cluster.edu".
0.81/1.10	============================== end of head ===========================
0.81/1.10	
0.81/1.10	============================== INPUT =================================
0.81/1.10	
0.81/1.10	% Reading from file /tmp/Prover9_30290_n022.cluster.edu
0.81/1.10	
0.81/1.10	set(prolog_style_variables).
0.81/1.10	set(auto2).
0.81/1.10	    % set(auto2) -> set(auto).
0.81/1.10	    % set(auto) -> set(auto_inference).
0.81/1.10	    % set(auto) -> set(auto_setup).
0.81/1.10	    % set(auto_setup) -> set(predicate_elim).
0.81/1.10	    % set(auto_setup) -> assign(eq_defs, unfold).
0.81/1.10	    % set(auto) -> set(auto_limits).
0.81/1.10	    % set(auto_limits) -> assign(max_weight, "100.000").
0.81/1.10	    % set(auto_limits) -> assign(sos_limit, 20000).
0.81/1.10	    % set(auto) -> set(auto_denials).
0.81/1.10	    % set(auto) -> set(auto_process).
0.81/1.10	    % set(auto2) -> assign(new_constants, 1).
0.81/1.10	    % set(auto2) -> assign(fold_denial_max, 3).
0.81/1.10	    % set(auto2) -> assign(max_weight, "200.000").
0.81/1.10	    % set(auto2) -> assign(max_hours, 1).
0.81/1.10	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.81/1.10	    % set(auto2) -> assign(max_seconds, 0).
0.81/1.10	    % set(auto2) -> assign(max_minutes, 5).
0.81/1.10	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.81/1.10	    % set(auto2) -> set(sort_initial_sos).
0.81/1.10	    % set(auto2) -> assign(sos_limit, -1).
0.81/1.10	    % set(auto2) -> assign(lrs_ticks, 3000).
0.81/1.10	    % set(auto2) -> assign(max_megs, 400).
0.81/1.10	    % set(auto2) -> assign(stats, some).
0.81/1.10	    % set(auto2) -> clear(echo_input).
0.81/1.10	    % set(auto2) -> set(quiet).
0.81/1.10	    % set(auto2) -> clear(print_initial_clauses).
0.81/1.10	    % set(auto2) -> clear(print_given).
0.81/1.10	assign(lrs_ticks,-1).
0.81/1.10	assign(sos_limit,10000).
0.81/1.10	assign(order,kbo).
0.81/1.10	set(lex_order_vars).
0.81/1.10	clear(print_given).
0.81/1.10	
0.81/1.10	% formulas(sos).  % not echoed (63 formulas)
0.81/1.10	
0.81/1.10	============================== end of input ==========================
0.81/1.10	
0.81/1.10	% From the command line: assign(max_seconds, 960).
0.81/1.10	
0.81/1.10	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.81/1.10	
0.81/1.10	% Formulas that are not ordinary clauses:
0.81/1.10	1 (all X67 all X68 (subactivity_occurrence(X67,X68) -> activity_occurrence(X68) & activity_occurrence(X67))) # label(sos_24) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	2 (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.81/1.10	3 (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.81/1.10	4 (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.81/1.10	5 (all X19 all X20 (earlier(X20,X19) & legal(X19) -> legal(X20))) # label(sos_09) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	6 (all X99 all X100 ((exists X101 (root(X99,X101) & subactivity_occurrence(X99,X100) & occurrence_of(X100,X101))) <-> root_occ(X99,X100))) # label(sos_33) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	7 (all X13 all X14 all X15 (earlier(X15,X14) & earlier(X13,X14) -> earlier(X15,X13) | X15 = X13 | earlier(X13,X15))) # label(sos_06) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	8 (all X0 all X1 (occurrence_of(X1,X0) -> activity_occurrence(X1) & activity(X0))) # label(sos) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	9 (all X121 all X122 all X123 all X124 all X125 (next_subocc(X121,X123,X124) & subactivity_occurrence(X123,X125) & subactivity_occurrence(X122,X125) & occurrence_of(X125,X124) & next_subocc(X121,X122,X124) -> X122 = X123)) # label(sos_39) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	10 (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.81/1.10	11 (all X94 all X95 all X96 all X97 (occurrence_of(X96,X94) & occurrence_of(X97,X95) & -subactivity_occurrence(X96,X97) & subactivity(X94,X95) -> (exists X98 (-subactivity_occurrence(X98,X96) & subactivity_occurrence(X98,X97))))) # label(sos_32) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	12 (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.81/1.10	13 (all X109 all X110 all X111 all X112 (-atomic(X112) & leaf_occ(X110,X111) & leaf_occ(X109,X111) & occurrence_of(X111,X112) -> X109 = X110)) # label(sos_36) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	14 (all X8 all X9 (earlier(X8,X9) -> -earlier(X9,X8))) # label(sos_04) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	15 (all X138 all X139 all X140 all X141 (occurrence_of(X139,X138) & subactivity_occurrence(X140,X139) & leaf_occ(X141,X139) & -min_precedes(X140,X141,X138) & arboreal(X140) -> X140 = X141)) # label(sos_43) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	16 (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.81/1.10	17 (all X18 (legal(X18) -> arboreal(X18))) # label(sos_08) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	18 (all X23 all X24 all X25 (min_precedes(X24,X25,X23) -> (exists X26 exists X27 (subactivity(X26,X23) & subactivity(X27,X23) & atocc(X25,X27) & atocc(X24,X26))))) # label(sos_11) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	19 (all X69 all X70 all X71 (min_precedes(X70,X71,X69) -> (exists X72 (occurrence_of(X72,X69) & subactivity_occurrence(X71,X72) & subactivity_occurrence(X70,X72))))) # label(sos_25) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	20 (all X49 all X50 all X51 (min_precedes(X49,X50,X51) -> -atomic(X51))) # label(sos_19) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	21 (all X21 all X22 (legal(X22) & earlier(X21,X22) <-> precedes(X21,X22))) # label(sos_10) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	22 (all X4 all X5 all X6 (occurrence_of(X4,X5) & occurrence_of(X4,X6) -> X6 = X5)) # label(sos_02) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	23 (all X113 all X114 all X115 (leaf_occ(X114,X113) & occurrence_of(X113,X115) -> -(exists X116 min_precedes(X114,X116,X115)))) # label(sos_37) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	24 (all X45 all X46 all X47 all X48 (precedes(X46,X47) & min_precedes(X45,X47,X48) & min_precedes(X45,X46,X48) -> min_precedes(X46,X47,X48))) # label(sos_18) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	25 (all X60 all X61 all X62 (next_subocc(X60,X61,X62) <-> -(exists X63 (min_precedes(X63,X61,X62) & min_precedes(X60,X63,X62))) & min_precedes(X60,X61,X62))) # label(sos_22) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	26 (all X56 all X57 (-(exists X59 min_precedes(X56,X59,X57)) & ((exists X58 min_precedes(X58,X56,X57)) | root(X56,X57)) <-> leaf(X56,X57))) # label(sos_21) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	27 (all X2 (activity_occurrence(X2) -> (exists X3 (occurrence_of(X2,X3) & activity(X3))))) # label(sos_01) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	28 (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.81/1.10	29 (all X83 all X84 all X85 all X86 (min_precedes(X83,X84,X85) & subactivity_occurrence(X84,X86) & occurrence_of(X86,X85) -> subactivity_occurrence(X83,X86))) # label(sos_29) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	30 (all X148 all X149 all X150 (min_precedes(X148,X149,X150) -> arboreal(X148))) # label(sos_46) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	31 (all X43 all X44 (legal(X43) & atocc(X43,X44) -> root(X43,X44))) # label(sos_17) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	32 (all X35 all X36 all X37 (min_precedes(X35,X36,X37) -> -root(X36,X37))) # label(sos_14) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	33 (all X105 all X106 all X107 all X108 (occurrence_of(X107,X108) & root_occ(X106,X107) & root_occ(X105,X107) -> X105 = X106)) # label(sos_35) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	34 (all X16 all X17 (occurrence_of(X16,X17) -> (arboreal(X16) <-> atomic(X17)))) # label(sos_07) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	35 (all X7 (activity(X7) -> subactivity(X7,X7))) # label(sos_03) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	36 (all X64 all X65 ((exists X66 (occurrence_of(X64,X66) & atomic(X66) & subactivity(X65,X66))) <-> atocc(X64,X65))) # label(sos_23) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	37 (all X41 all X42 (root(X41,X42) -> legal(X41))) # label(sos_16) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	38 (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.81/1.10	39 (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.81/1.10	40 (all X79 all X80 all X81 all X82 (occurrence_of(X80,X79) & subactivity_occurrence(X81,X80) & subactivity_occurrence(X82,X80) & arboreal(X82) & arboreal(X81) -> X82 = X81 | min_precedes(X82,X81,X79) | min_precedes(X81,X82,X79))) # label(sos_28) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	41 (all X134 all X135 all X136 all X137 (subactivity_occurrence(X136,X135) & -min_precedes(X137,X136,X134) & arboreal(X136) & root_occ(X137,X135) & occurrence_of(X135,X134) -> X137 = X136)) # label(sos_42) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	42 (all X38 all X39 all X40 (min_precedes(X38,X39,X40) -> precedes(X38,X39))) # label(sos_15) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	43 (all X28 all X29 (root(X29,X28) -> (exists X30 (atocc(X29,X30) & subactivity(X30,X28))))) # label(sos_12) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	44 (all X156 all X157 all X158 all X159 all X160 (occurrence_of(X157,X156) & leaf_occ(X160,X157) & min_precedes(X159,X158,X156) & X158 != X160 & subactivity_occurrence(X158,X157) & root_occ(X159,X157) -> min_precedes(X158,X160,X156))) # label(sos_48) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	45 (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.81/1.10	46 (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.81/1.10	47 (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.81/1.10	48 (all X161 (occurrence_of(X161,tptp0) -> (exists X162 exists X163 exists X164 (occurrence_of(X162,tptp3) & root_occ(X162,X161) & occurrence_of(X163,tptp4) & next_subocc(X162,X163,tptp0) & leaf_occ(X164,X161) & next_subocc(X163,X164,tptp0) & (occurrence_of(X164,tptp2) | occurrence_of(X164,tptp1)))))) # label(sos_49) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	49 (all X87 all X88 all X89 all X90 (occurrence_of(X89,X87) & -atomic(X87) & subactivity_occurrence(X89,X90) & occurrence_of(X90,X88) -> subactivity(X87,X88))) # label(sos_30) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	50 (all X126 all X127 all X128 all X129 (next_subocc(X127,X126,X129) & next_subocc(X128,X126,X129) -> X128 = X127)) # label(sos_40) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	51 -(all X165 (occurrence_of(X165,tptp0) -> (exists X166 exists X167 ((occurrence_of(X167,tptp1) -> -(exists X168 (min_precedes(X166,X168,tptp0) & occurrence_of(X168,tptp2)))) & (occurrence_of(X167,tptp2) -> -(exists X169 (min_precedes(X166,X169,tptp0) & occurrence_of(X169,tptp1)))) & leaf_occ(X167,X165))))) # label(goals) # label(negated_conjecture) # label(non_clause).  [assumption].
0.81/1.11	
0.81/1.11	============================== end of process non-clausal formulas ===
0.81/1.11	
0.81/1.11	============================== PROCESS INITIAL CLAUSES ===============
0.81/1.11	
0.81/1.11	============================== PREDICATE ELIMINATION =================
0.81/1.11	52 -activity_occurrence(A) | occurrence_of(A,f12(A)) # label(sos_01) # label(axiom).  [clausify(27)].
0.81/1.11	53 -subactivity_occurrence(A,B) | activity_occurrence(B) # label(sos_24) # label(axiom).  [clausify(1)].
0.81/1.11	54 -subactivity_occurrence(A,B) | activity_occurrence(A) # label(sos_24) # label(axiom).  [clausify(1)].
0.81/1.11	55 -occurrence_of(A,B) | activity_occurrence(A) # label(sos) # label(axiom).  [clausify(8)].
0.81/1.11	Derived: occurrence_of(A,f12(A)) | -subactivity_occurrence(B,A).  [resolve(52,a,53,b)].
0.81/1.11	Derived: occurrence_of(A,f12(A)) | -subactivity_occurrence(A,B).  [resolve(52,a,54,b)].
0.81/1.11	Derived: occurrence_of(A,f12(A)) | -occurrence_of(A,B).  [resolve(52,a,55,b)].
0.81/1.11	56 -activity_occurrence(A) | activity(f12(A)) # label(sos_01) # label(axiom).  [clausify(27)].
0.81/1.11	Derived: activity(f12(A)) | -subactivity_occurrence(B,A).  [resolve(56,a,53,b)].
0.81/1.11	Derived: activity(f12(A)) | -subactivity_occurrence(A,B).  [resolve(56,a,54,b)].
0.81/1.11	Derived: activity(f12(A)) | -occurrence_of(A,B).  [resolve(56,a,55,b)].
0.81/1.11	57 -legal(A) | -earlier(B,A) | precedes(B,A) # label(sos_10) # label(axiom).  [clausify(21)].
0.81/1.11	58 -min_precedes(A,B,C) | -min_precedes(D,B,C) | -precedes(A,D) | min_precedes(A,D,C) # label(sos_20) # label(axiom).  [clausify(2)].
0.81/1.11	Derived: -legal(A) | -earlier(B,A) | -min_precedes(B,C,D) | -min_precedes(A,C,D) | min_precedes(B,A,D).  [resolve(57,c,58,c)].
0.81/1.11	59 legal(A) | -precedes(B,A) # label(sos_10) # label(axiom).  [clausify(21)].
0.81/1.11	60 earlier(A,B) | -precedes(A,B) # label(sos_10) # label(axiom).  [clausify(21)].
0.81/1.11	61 -precedes(A,B) | -min_precedes(C,B,D) | -min_precedes(C,A,D) | min_precedes(A,B,D) # label(sos_18) # label(axiom).  [clausify(24)].
0.81/1.11	Derived: -min_precedes(A,B,C) | -min_precedes(A,D,C) | min_precedes(D,B,C) | -legal(B) | -earlier(D,B).  [resolve(61,a,57,c)].
0.81/1.11	62 -min_precedes(A,B,C) | precedes(A,B) # label(sos_15) # label(axiom).  [clausify(42)].
0.81/1.11	Derived: -min_precedes(A,B,C) | -min_precedes(A,D,E) | -min_precedes(B,D,E) | min_precedes(A,B,E).  [resolve(62,b,58,c)].
0.81/1.11	Derived: -min_precedes(A,B,C) | legal(B).  [resolve(62,b,59,b)].
0.81/1.11	Derived: -min_precedes(A,B,C) | earlier(A,B).  [resolve(62,b,60,b)].
0.81/1.11	Derived: -min_precedes(A,B,C) | -min_precedes(D,B,E) | -min_precedes(D,A,E) | min_precedes(A,B,E).  [resolve(62,b,61,a)].
0.81/1.11	63 -leaf_occ(A,B) | leaf(A,f2(A,B)) # label(sos_34) # label(axiom).  [clausify(4)].
0.81/1.11	64 atomic(A) | -leaf(B,A) | occurrence_of(f1(B,A),A) # label(sos_45) # label(axiom).  [clausify(3)].
0.81/1.11	65 atomic(A) | -leaf(B,A) | leaf_occ(B,f1(B,A)) # label(sos_45) # label(axiom).  [clausify(3)].
0.81/1.11	Derived: -leaf_occ(A,B) | atomic(f2(A,B)) | occurrence_of(f1(A,f2(A,B)),f2(A,B)).  [resolve(63,b,64,b)].
0.81/1.11	Derived: -leaf_occ(A,B) | atomic(f2(A,B)) | leaf_occ(A,f1(A,f2(A,B))).  [resolve(63,b,65,b)].
0.81/1.11	66 leaf_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -leaf(A,C) # label(sos_34) # label(axiom).  [clausify(4)].
0.81/1.11	Derived: leaf_occ(A,B) | -occurrence_of(B,f2(A,C)) | -subactivity_occurrence(A,B) | -leaf_occ(A,C).  [resolve(66,d,63,b)].
0.81/1.11	67 min_precedes(A,f10(A,B),B) | -min_precedes(C,A,B) | leaf(A,B) # label(sos_21) # label(axiom).  [clausify(26)].
0.81/1.11	Derived: min_precedes(A,f10(A,B),B) | -min_precedes(C,A,B) | atomic(B) | occurrence_of(f1(A,B),B).  [resolve(67,c,64,b)].
0.81/1.11	Derived: min_precedes(A,f10(A,B),B) | -min_precedes(C,A,B) | atomic(B) | leaf_occ(A,f1(A,B)).  [resolve(67,c,65,b)].
0.81/1.11	Derived: min_precedes(A,f10(A,B),B) | -min_precedes(C,A,B) | leaf_occ(A,D) | -occurrence_of(D,B) | -subactivity_occurrence(A,D).  [resolve(67,c,66,d)].
0.81/1.11	68 min_precedes(A,f10(A,B),B) | -root(A,B) | leaf(A,B) # label(sos_21) # label(axiom).  [clausify(26)].
0.81/1.11	Derived: min_precedes(A,f10(A,B),B) | -root(A,B) | atomic(B) | occurrence_of(f1(A,B),B).  [resolve(68,c,64,b)].
0.81/1.11	Derived: min_precedes(A,f10(A,B),B) | -root(A,B) | atomic(B) | leaf_occ(A,f1(A,B)).  [resolve(68,c,65,b)].
0.81/1.11	Derived: min_precedes(A,f10(A,B),B) | -root(A,B) | leaf_occ(A,C) | -occurrence_of(C,B) | -subactivity_occurrence(A,C).  [resolve(68,c,66,d)].
0.81/1.11	69 -min_precedes(A,B,C) | -leaf(A,C) # label(sos_21) # label(axiom).  [clausify(26)].
0.81/1.11	Derived: -min_precedes(A,B,f2(A,C)) | -leaf_occ(A,C).  [resolve(69,b,63,b)].
0.81/1.11	Derived: -min_precedes(A,B,C) | min_precedes(A,f10(A,C),C) | -min_precedes(D,A,C).  [resolve(69,b,67,c)].
0.81/1.11	Derived: -min_precedes(A,B,C) | min_precedes(A,f10(A,C),C) | -root(A,C).  [resolve(69,b,68,c)].
0.81/1.11	70 min_precedes(f11(A,B),A,B) | root(A,B) | -leaf(A,B) # label(sos_21) # label(axiom).  [clausify(26)].
0.81/1.11	Derived: min_precedes(f11(A,f2(A,B)),A,f2(A,B)) | root(A,f2(A,B)) | -leaf_occ(A,B).  [resolve(70,c,63,b)].
0.81/1.11	Derived: min_precedes(f11(A,B),A,B) | root(A,B) | min_precedes(A,f10(A,B),B) | -min_precedes(C,A,B).  [resolve(70,c,67,c)].
0.81/1.11	71 root(A,f3(A,B)) | -root_occ(A,B) # label(sos_33) # label(axiom).  [clausify(6)].
0.81/1.11	72 -root(A,B) | -subactivity_occurrence(A,C) | -occurrence_of(C,B) | root_occ(A,C) # label(sos_33) # label(axiom).  [clausify(6)].
0.81/1.11	Derived: -root_occ(A,B) | -subactivity_occurrence(A,C) | -occurrence_of(C,f3(A,B)) | root_occ(A,C).  [resolve(71,a,72,a)].
0.81/1.11	73 -min_precedes(A,B,C) | root(f4(A,B,C),C) # label(sos_13) # label(axiom).  [clausify(10)].
0.81/1.11	Derived: -min_precedes(A,B,C) | -subactivity_occurrence(f4(A,B,C),D) | -occurrence_of(D,C) | root_occ(f4(A,B,C),D).  [resolve(73,b,72,a)].
0.81/1.11	74 atomic(A) | -occurrence_of(B,A) | root(f13(A,B),A) # label(sos_27) # label(axiom).  [clausify(28)].
0.81/1.11	Derived: atomic(A) | -occurrence_of(B,A) | -subactivity_occurrence(f13(A,B),C) | -occurrence_of(C,A) | root_occ(f13(A,B),C).  [resolve(74,c,72,a)].
0.81/1.11	75 -legal(A) | -atocc(A,B) | root(A,B) # label(sos_17) # label(axiom).  [clausify(31)].
0.81/1.11	Derived: -legal(A) | -atocc(A,B) | -subactivity_occurrence(A,C) | -occurrence_of(C,B) | root_occ(A,C).  [resolve(75,c,72,a)].
0.81/1.11	76 -min_precedes(A,B,C) | -root(B,C) # label(sos_14) # label(axiom).  [clausify(32)].
0.81/1.11	Derived: -min_precedes(A,B,f3(B,C)) | -root_occ(B,C).  [resolve(76,b,71,a)].
0.81/1.11	Derived: -min_precedes(A,f4(B,C,D),D) | -min_precedes(B,C,D).  [resolve(76,b,73,b)].
0.81/1.11	Derived: -min_precedes(A,f13(B,C),B) | atomic(B) | -occurrence_of(C,B).  [resolve(76,b,74,c)].
0.81/1.11	Derived: -min_precedes(A,B,C) | -legal(B) | -atocc(B,C).  [resolve(76,b,75,c)].
0.81/1.11	77 -root(A,B) | legal(A) # label(sos_16) # label(axiom).  [clausify(37)].
0.81/1.11	Derived: legal(A) | -root_occ(A,B).  [resolve(77,a,71,a)].
0.81/1.11	Derived: legal(f4(A,B,C)) | -min_precedes(A,B,C).  [resolve(77,a,73,b)].
0.81/1.11	Derived: legal(f13(A,B)) | atomic(A) | -occurrence_of(B,A).  [resolve(77,a,74,c)].
0.81/1.11	78 -root(A,B) | atocc(A,f15(B,A)) # label(sos_12) # label(axiom).  [clausify(43)].
0.81/1.11	Derived: atocc(A,f15(f3(A,B),A)) | -root_occ(A,B).  [resolve(78,a,71,a)].
0.81/1.11	Derived: atocc(f4(A,B,C),f15(C,f4(A,B,C))) | -min_precedes(A,B,C).  [resolve(78,a,73,b)].
0.81/1.11	Derived: atocc(f13(A,B),f15(A,f13(A,B))) | atomic(A) | -occurrence_of(B,A).  [resolve(78,a,74,c)].
0.81/1.11	Derived: atocc(A,f15(B,A)) | -legal(A) | -atocc(A,B).  [resolve(78,a,75,c)].
0.81/1.11	79 -root(A,B) | subactivity(f15(B,A),B) # label(sos_12) # label(axiom).  [clausify(43)].
0.81/1.11	Derived: subactivity(f15(f3(A,B),A),f3(A,B)) | -root_occ(A,B).  [resolve(79,a,71,a)].
0.81/1.11	Derived: subactivity(f15(A,f4(B,C,A)),A) | -min_precedes(B,C,A).  [resolve(79,a,73,b)].
0.81/1.11	Derived: subactivity(f15(A,f13(A,B)),A) | atomic(A) | -occurrence_of(B,A).  [resolve(79,a,74,c)].
0.81/1.11	Derived: subactivity(f15(A,B),A) | -legal(B) | -atocc(B,A).  [resolve(79,a,75,c)].
0.81/1.11	80 -root(A,B) | atomic(B) | subactivity_occurrence(A,f16(B,A)) # label(sos_26) # label(axiom).  [clausify(47)].
0.81/1.11	Derived: atomic(f3(A,B)) | subactivity_occurrence(A,f16(f3(A,B),A)) | -root_occ(A,B).  [resolve(80,a,71,a)].
0.81/1.11	Derived: atomic(A) | subactivity_occurrence(f4(B,C,A),f16(A,f4(B,C,A))) | -min_precedes(B,C,A).  [resolve(80,a,73,b)].
0.81/1.11	Derived: atomic(A) | subactivity_occurrence(f13(A,B),f16(A,f13(A,B))) | atomic(A) | -occurrence_of(B,A).  [resolve(80,a,74,c)].
0.81/1.11	Derived: atomic(A) | subactivity_occurrence(B,f16(A,B)) | -legal(B) | -atocc(B,A).  [resolve(80,a,75,c)].
0.81/1.11	81 -root(A,B) | atomic(B) | occurrence_of(f16(B,A),B) # label(sos_26) # label(axiom).  [clausify(47)].
0.81/1.11	Derived: atomic(f3(A,B)) | occurrence_of(f16(f3(A,B),A),f3(A,B)) | -root_occ(A,B).  [resolve(81,a,71,a)].
0.81/1.11	Derived: atomic(A) | occurrence_of(f16(A,f4(B,C,A)),A) | -min_precedes(B,C,A).  [resolve(81,a,73,b)].
0.81/1.11	Derived: atomic(A) | occurrence_of(f16(A,f13(A,B)),A) | atomic(A) | -occurrence_of(B,A).  [resolve(81,a,74,c)].
0.81/1.11	Derived: atomic(A) | occurrence_of(f16(A,B),A) | -legal(B) | -atocc(B,A).  [resolve(81,a,75,c)].
0.81/1.11	82 min_precedes(A,f10(A,B),B) | -root(A,B) | atomic(B) | occurrence_of(f1(A,B),B).  [resolve(68,c,64,b)].
0.81/1.11	Derived: min_precedes(A,f10(A,f3(A,B)),f3(A,B)) | atomic(f3(A,B)) | occurrence_of(f1(A,f3(A,B)),f3(A,B)) | -root_occ(A,B).  [resolve(82,b,71,a)].
0.81/1.11	Derived: min_precedes(f4(A,B,C),f10(f4(A,B,C),C),C) | atomic(C) | occurrence_of(f1(f4(A,B,C),C),C) | -min_precedes(A,B,C).  [resolve(82,b,73,b)].
0.81/1.11	Derived: min_precedes(f13(A,B),f10(f13(A,B),A),A) | atomic(A) | occurrence_of(f1(f13(A,B),A),A) | atomic(A) | -occurrence_of(B,A).  [resolve(82,b,74,c)].
0.81/1.11	Derived: min_precedes(A,f10(A,B),B) | atomic(B) | occurrence_of(f1(A,B),B) | -legal(A) | -atocc(A,B).  [resolve(82,b,75,c)].
0.81/1.11	83 min_precedes(A,f10(A,B),B) | -root(A,B) | atomic(B) | leaf_occ(A,f1(A,B)).  [resolve(68,c,65,b)].
0.81/1.11	Derived: min_precedes(A,f10(A,f3(A,B)),f3(A,B)) | atomic(f3(A,B)) | leaf_occ(A,f1(A,f3(A,B))) | -root_occ(A,B).  [resolve(83,b,71,a)].
0.81/1.11	Derived: min_precedes(f4(A,B,C),f10(f4(A,B,C),C),C) | atomic(C) | leaf_occ(f4(A,B,C),f1(f4(A,B,C),C)) | -min_precedes(A,B,C).  [resolve(83,b,73,b)].
0.81/1.11	Derived: min_precedes(f13(A,B),f10(f13(A,B),A),A) | atomic(A) | leaf_occ(f13(A,B),f1(f13(A,B),A)) | atomic(A) | -occurrence_of(B,A).  [resolve(83,b,74,c)].
0.81/1.11	Derived: min_precedes(A,f10(A,B),B) | atomic(B) | leaf_occ(A,f1(A,B)) | -legal(A) | -atocc(A,B).  [resolve(83,b,75,c)].
0.81/1.11	84 min_precedes(A,f10(A,B),B) | -root(A,B) | leaf_occ(A,C) | -occurrence_of(C,B) | -subactivity_occurrence(A,C).  [resolve(68,c,66,d)].
0.81/1.11	Derived: min_precedes(A,f10(A,f3(A,B)),f3(A,B)) | leaf_occ(A,C) | -occurrence_of(C,f3(A,B)) | -subactivity_occurrence(A,C) | -root_occ(A,B).  [resolve(84,b,71,a)].
0.81/1.11	Derived: min_precedes(f4(A,B,C),f10(f4(A,B,C),C),C) | leaf_occ(f4(A,B,C),D) | -occurrence_of(D,C) | -subactivity_occurrence(f4(A,B,C),D) | -min_precedes(A,B,C).  [resolve(84,b,73,b)].
0.81/1.11	Derived: min_precedes(f13(A,B),f10(f13(A,B),A),A) | leaf_occ(f13(A,B),C) | -occurrence_of(C,A) | -subactivity_occurrence(f13(A,B),C) | atomic(A) | -occurrence_of(B,A).  [resolve(84,b,74,c)].
0.81/1.11	Derived: min_precedes(A,f10(A,B),B) | leaf_occ(A,C) | -occurrence_of(C,B) | -subactivity_occurrence(A,C) | -legal(A) | -atocc(A,B).  [resolve(84,b,75,c)].
0.81/1.11	85 -min_precedes(A,B,C) | min_precedes(A,f10(A,C),C) | -root(A,C).  [resolve(69,b,68,c)].
0.81/1.11	Derived: -min_precedes(A,B,f3(A,C)) | min_precedes(A,f10(A,f3(A,C)),f3(A,C)) | -root_occ(A,C).  [resolve(85,c,71,a)].
0.81/1.11	Derived: -min_precedes(f4(A,B,C),D,C) | min_precedes(f4(A,B,C),f10(f4(A,B,C),C),C) | -min_precedes(A,B,C).  [resolve(85,c,73,b)].
0.81/1.11	Derived: -min_precedes(f13(A,B),C,A) | min_precedes(f13(A,B),f10(f13(A,B),A),A) | atomic(A) | -occurrence_of(B,A).  [resolve(85,c,74,c)].
0.81/1.11	Derived: -min_precedes(A,B,C) | min_precedes(A,f10(A,C),C) | -legal(A) | -atocc(A,C).  [resolve(85,c,75,c)].
0.81/1.11	86 min_precedes(f11(A,f2(A,B)),A,f2(A,B)) | root(A,f2(A,B)) | -leaf_occ(A,B).  [resolve(70,c,63,b)].
0.81/1.11	Derived: min_precedes(f11(A,f2(A,B)),A,f2(A,B)) | -leaf_occ(A,B) | -subactivity_occurrence(A,C) | -occurrence_of(C,f2(A,B)) | root_occ(A,C).  [resolve(86,b,72,a)].
0.81/1.11	Derived: min_precedes(f11(A,f2(A,B)),A,f2(A,B)) | -leaf_occ(A,B) | -min_precedes(C,A,f2(A,B)).  [resolve(86,b,76,b)].
0.81/1.11	Derived: min_precedes(f11(A,f2(A,B)),A,f2(A,B)) | -leaf_occ(A,B) | legal(A).  [resolve(86,b,77,a)].
0.81/1.11	Derived: min_precedes(f11(A,f2(A,B)),A,f2(A,B)) | -leaf_occ(A,B) | atocc(A,f15(f2(A,B),A)).  [resolve(86,b,78,a)].
0.81/1.11	Derived: min_precedes(f11(A,f2(A,B)),A,f2(A,B)) | -leaf_occ(A,B) | subactivity(f15(f2(A,B),A),f2(A,B)).  [resolve(86,b,79,a)].
0.81/1.11	Derived: min_precedes(f11(A,f2(A,B)),A,f2(A,B)) | -leaf_occ(A,B) | atomic(f2(A,B)) | subactivity_occurrence(A,f16(f2(A,B),A)).  [resolve(86,b,80,a)].
0.81/1.11	Derived: min_precedes(f11(A,f2(A,B)),A,f2(A,B)) | -leaf_occ(A,B) | atomic(f2(A,B)) | occurrence_of(f16(f2(A,B),A),f2(A,B)).  [resolve(86,b,81,a)].
0.81/1.12	Derived: min_precedes(f11(A,f2(A,B)),A,f2(A,B)) | -leaf_occ(A,B) | min_precedes(A,f10(A,f2(A,B)),f2(A,B)) | atomic(f2(A,B)) | occurrence_of(f1(A,f2(A,B)),f2(A,B)).  [resolve(86,b,82,b)].
0.81/1.12	Derived: min_precedes(f11(A,f2(A,B)),A,f2(A,B)) | -leaf_occ(A,B) | min_precedes(A,f10(A,f2(A,B)),f2(A,B)) | atomic(f2(A,B)) | leaf_occ(A,f1(A,f2(A,B))).  [resolve(86,b,83,b)].
0.81/1.12	Derived: min_precedes(f11(A,f2(A,B)),A,f2(A,B)) | -leaf_occ(A,B) | min_precedes(A,f10(A,f2(A,B)),f2(A,B)) | leaf_occ(A,C) | -occurrence_of(C,f2(A,B)) | -subactivity_occurrence(A,C).  [resolve(86,b,84,b)].
0.81/1.12	Derived: min_precedes(f11(A,f2(A,B)),A,f2(A,B)) | -leaf_occ(A,B) | -min_precedes(A,C,f2(A,B)) | min_precedes(A,f10(A,f2(A,B)),f2(A,B)).  [resolve(86,b,85,c)].
0.81/1.12	87 min_precedes(f11(A,B),A,B) | root(A,B) | min_precedes(A,f10(A,B),B) | -min_precedes(C,A,B).  [resolve(70,c,67,c)].
0.81/1.12	Derived: min_precedes(f11(A,B),A,B) | min_precedes(A,f10(A,B),B) | -min_precedes(C,A,B) | -subactivity_occurrence(A,D) | -occurrence_of(D,B) | root_occ(A,D).  [resolve(87,b,72,a)].
0.81/1.12	Derived: min_precedes(f11(A,B),A,B) | min_precedes(A,f10(A,B),B) | -min_precedes(C,A,B) | -min_precedes(D,A,B).  [resolve(87,b,76,b)].
0.81/1.12	88 -activity(A) | subactivity(A,A) # label(sos_03) # label(axiom).  [clausify(35)].
0.81/1.12	89 -occurrence_of(A,B) | activity(B) # label(sos) # label(axiom).  [clausify(8)].
0.81/1.12	90 activity(tptp0) # label(sos_50) # label(axiom).  [assumption].
0.81/1.12	Derived: subactivity(A,A) | -occurrence_of(B,A).  [resolve(88,a,89,b)].
0.81/1.12	Derived: subactivity(tptp0,tptp0).  [resolve(88,a,90,a)].
0.81/1.12	91 activity(f12(A)) | -subactivity_occurrence(B,A).  [resolve(56,a,53,b)].
0.81/1.12	Derived: -subactivity_occurrence(A,B) | subactivity(f12(B),f12(B)).  [resolve(91,a,88,a)].
0.81/1.12	92 activity(f12(A)) | -subactivity_occurrence(A,B).  [resolve(56,a,54,b)].
0.81/1.12	Derived: -subactivity_occurrence(A,B) | subactivity(f12(A),f12(A)).  [resolve(92,a,88,a)].
0.81/1.12	93 activity(f12(A)) | -occurrence_of(A,B).  [resolve(56,a,55,b)].
0.81/1.12	Derived: -occurrence_of(A,B) | subactivity(f12(A),f12(A)).  [resolve(93,a,88,a)].
0.81/1.12	94 -min_precedes(A,B,C) | subactivity(f6(C,A,B),C) # label(sos_11) # label(axiom).  [clausify(18)].
0.81/1.12	95 -occurrence_of(A,B) | -occurrence_of(C,D) | subactivity_occurrence(A,C) | -subactivity(B,D) | -subactivity_occurrence(f5(B,D,A,C),A) # label(sos_32) # label(axiom).  [clausify(11)].
0.81/1.12	96 -occurrence_of(A,B) | -occurrence_of(C,D) | subactivity_occurrence(A,C) | -subactivity(B,D) | subactivity_occurrence(f5(B,D,A,C),C) # label(sos_32) # label(axiom).  [clausify(11)].
0.81/1.12	Derived: -min_precedes(A,B,C) | -occurrence_of(D,f6(C,A,B)) | -occurrence_of(E,C) | subactivity_occurrence(D,E) | -subactivity_occurrence(f5(f6(C,A,B),C,D,E),D).  [resolve(94,b,95,d)].
0.81/1.12	Derived: -min_precedes(A,B,C) | -occurrence_of(D,f6(C,A,B)) | -occurrence_of(E,C) | subactivity_occurrence(D,E) | subactivity_occurrence(f5(f6(C,A,B),C,D,E),E).  [resolve(94,b,96,d)].
0.81/1.12	97 -min_precedes(A,B,C) | subactivity(f7(C,A,B),C) # label(sos_11) # label(axiom).  [clausify(18)].
0.81/1.12	Derived: -min_precedes(A,B,C) | -occurrence_of(D,f7(C,A,B)) | -occurrence_of(E,C) | subactivity_occurrence(D,E) | -subactivity_occurrence(f5(f7(C,A,B),C,D,E),D).  [resolve(97,b,95,d)].
0.81/1.12	Derived: -min_precedes(A,B,C) | -occurrence_of(D,f7(C,A,B)) | -occurrence_of(E,C) | subactivity_occurrence(D,E) | subactivity_occurrence(f5(f7(C,A,B),C,D,E),E).  [resolve(97,b,96,d)].
0.81/1.12	98 -occurrence_of(A,B) | -atomic(B) | -subactivity(C,B) | atocc(A,C) # label(sos_23) # label(axiom).  [clausify(36)].
0.81/1.12	Derived: -occurrence_of(A,B) | -atomic(B) | atocc(A,f6(B,C,D)) | -min_precedes(C,D,B).  [resolve(98,c,94,b)].
0.81/1.12	Derived: -occurrence_of(A,B) | -atomic(B) | atocc(A,f7(B,C,D)) | -min_precedes(C,D,B).  [resolve(98,c,97,b)].
0.81/1.12	99 subactivity(A,f14(B,A)) | -atocc(B,A) # label(sos_23) # label(axiom).  [clausify(36)].
0.81/1.12	Derived: -atocc(A,B) | -occurrence_of(C,B) | -occurrence_of(D,f14(A,B)) | subactivity_occurrence(C,D) | -subactivity_occurrence(f5(B,f14(A,B),C,D),C).  [resolve(99,a,95,d)].
0.81/1.12	Derived: -atocc(A,B) | -occurrence_of(C,B) | -occurrence_of(D,f14(A,B)) | subactivity_occurrence(C,D) | subactivity_occurrence(f5(B,f14(A,B),C,D),D).  [resolve(99,a,96,d)].
0.81/1.12	Derived: -atocc(A,B) | -occurrence_of(C,f14(A,B)) | -atomic(f14(A,B)) | atocc(C,B).  [resolve(99,a,98,c)].
0.81/1.12	100 -occurrence_of(A,B) | atomic(B) | -subactivity_occurrence(A,C) | -occurrence_of(C,D) | subactivity(B,D) # label(sos_30) # label(axiom).  [clausify(49)].
0.81/1.12	Derived: -occurrence_of(A,B) | atomic(B) | -subactivity_occurrence(A,C) | -occurrence_of(C,D) | -occurrence_of(E,B) | -occurrence_of(F,D) | subactivity_occurrence(E,F) | -subactivity_occurrence(f5(B,D,E,F),E).  [resolve(100,e,95,d)].
0.81/1.12	Derived: -occurrence_of(A,B) | atomic(B) | -subactivity_occurrence(A,C) | -occurrence_of(C,D) | -occurrence_of(E,B) | -occurrence_of(F,D) | subactivity_occurrence(E,F) | subactivity_occurrence(f5(B,D,E,F),F).  [resolve(100,e,96,d)].
0.81/1.12	Derived: -occurrence_of(A,B) | atomic(B) | -subactivity_occurrence(A,C) | -occurrence_of(C,D) | -occurrence_of(E,D) | -atomic(D) | atocc(E,B).  [resolve(100,e,98,c)].
0.81/1.12	101 subactivity(f15(f3(A,B),A),f3(A,B)) | -root_occ(A,B).  [resolve(79,a,71,a)].
0.81/1.12	Derived: -root_occ(A,B) | -occurrence_of(C,f15(f3(A,B),A)) | -occurrence_of(D,f3(A,B)) | subactivity_occurrence(C,D) | -subactivity_occurrence(f5(f15(f3(A,B),A),f3(A,B),C,D),C).  [resolve(101,a,95,d)].
0.81/1.12	Derived: -root_occ(A,B) | -occurrence_of(C,f15(f3(A,B),A)) | -occurrence_of(D,f3(A,B)) | subactivity_occurrence(C,D) | subactivity_occurrence(f5(f15(f3(A,B),A),f3(A,B),C,D),D).  [resolve(101,a,96,d)].
0.81/1.12	Derived: -root_occ(A,B) | -occurrence_of(C,f3(A,B)) | -atomic(f3(A,B)) | atocc(C,f15(f3(A,B),A)).  [resolve(101,a,98,c)].
0.81/1.12	102 subactivity(f15(A,f4(B,C,A)),A) | -min_precedes(B,C,A).  [resolve(79,a,73,b)].
0.81/1.12	Derived: -min_precedes(A,B,C) | -occurrence_of(D,f15(C,f4(A,B,C))) | -occurrence_of(E,C) | subactivity_occurrence(D,E) | -subactivity_occurrence(f5(f15(C,f4(A,B,C)),C,D,E),D).  [resolve(102,a,95,d)].
0.81/1.12	Derived: -min_precedes(A,B,C) | -occurrence_of(D,f15(C,f4(A,B,C))) | -occurrence_of(E,C) | subactivity_occurrence(D,E) | subactivity_occurrence(f5(f15(C,f4(A,B,C)),C,D,E),E).  [resolve(102,a,96,d)].
0.81/1.12	Derived: -min_precedes(A,B,C) | -occurrence_of(D,C) | -atomic(C) | atocc(D,f15(C,f4(A,B,C))).  [resolve(102,a,98,c)].
0.81/1.12	103 subactivity(f15(A,f13(A,B)),A) | atomic(A) | -occurrence_of(B,A).  [resolve(79,a,74,c)].
0.81/1.12	Derived: atomic(A) | -occurrence_of(B,A) | -occurrence_of(C,f15(A,f13(A,B))) | -occurrence_of(D,A) | subactivity_occurrence(C,D) | -subactivity_occurrence(f5(f15(A,f13(A,B)),A,C,D),C).  [resolve(103,a,95,d)].
0.81/1.12	Derived: atomic(A) | -occurrence_of(B,A) | -occurrence_of(C,f15(A,f13(A,B))) | -occurrence_of(D,A) | subactivity_occurrence(C,D) | subactivity_occurrence(f5(f15(A,f13(A,B)),A,C,D),D).  [resolve(103,a,96,d)].
0.81/1.12	104 subactivity(f15(A,B),A) | -legal(B) | -atocc(B,A).  [resolve(79,a,75,c)].
0.81/1.12	Derived: -legal(A) | -atocc(A,B) | -occurrence_of(C,f15(B,A)) | -occurrence_of(D,B) | subactivity_occurrence(C,D) | -subactivity_occurrence(f5(f15(B,A),B,C,D),C).  [resolve(104,a,95,d)].
0.81/1.12	Derived: -legal(A) | -atocc(A,B) | -occurrence_of(C,f15(B,A)) | -occurrence_of(D,B) | subactivity_occurrence(C,D) | subactivity_occurrence(f5(f15(B,A),B,C,D),D).  [resolve(104,a,96,d)].
0.81/1.12	Derived: -legal(A) | -atocc(A,B) | -occurrence_of(C,B) | -atomic(B) | atocc(C,f15(B,A)).  [resolve(104,a,98,c)].
0.81/1.12	105 min_precedes(f11(A,f2(A,B)),A,f2(A,B)) | -leaf_occ(A,B) | subactivity(f15(f2(A,B),A),f2(A,B)).  [resolve(86,b,79,a)].
0.81/1.12	Derived: min_precedes(f11(A,f2(A,B)),A,f2(A,B)) | -leaf_occ(A,B) | -occurrence_of(C,f15(f2(A,B),A)) | -occurrence_of(D,f2(A,B)) | subactivity_occurrence(C,D) | -subactivity_occurrence(f5(f15(f2(A,B),A),f2(A,B),C,D),C).  [resolve(105,c,95,d)].
0.81/1.12	Derived: min_precedes(f11(A,f2(A,B)),A,f2(A,B)) | -leaf_occ(A,B) | -occurrence_of(C,f15(f2(A,B),A)) | -occurrence_of(D,f2(A,B)) | subactivity_occurrence(C,D) | subactivity_occurrence(f5(f15(f2(A,B),A),f2(A,B),C,D),D).  [resolve(105,c,96,d)].
0.81/1.12	Derived: min_precedes(f11(A,f2(A,B)),A,f2(A,B)) | -leaf_occ(A,B) | -occurrence_of(C,f2(A,B)) | -atomic(f2(A,B)) | atocc(C,f15(f2(A,B),A)).  [resolve(105,c,98,c)].
0.81/1.12	106 subactivity(A,A) | -occurrence_of(B,A).  [resolve(88,a,89,b)].
0.81/1.12	Derived: -occurrence_of(A,B) | -occurrence_of(C,B) | -occurrence_of(D,B) | subactivity_occurrence(C,D) | -subactivity_occurrence(f5(B,B,C,D),C).  [resolve(106,a,95,d)].
0.83/1.25	Derived: -occurrence_of(A,B) | -occurrence_of(C,B) | -occurrence_of(D,B) | subactivity_occurrence(C,D) | subactivity_occurrence(f5(B,B,C,D),D).  [resolve(106,a,96,d)].
0.83/1.25	Derived: -occurrence_of(A,B) | -occurrence_of(C,B) | -atomic(B) | atocc(C,B).  [resolve(106,a,98,c)].
0.83/1.25	107 subactivity(tptp0,tptp0).  [resolve(88,a,90,a)].
0.83/1.25	108 -subactivity_occurrence(A,B) | subactivity(f12(B),f12(B)).  [resolve(91,a,88,a)].
0.83/1.25	109 -subactivity_occurrence(A,B) | subactivity(f12(A),f12(A)).  [resolve(92,a,88,a)].
0.83/1.25	110 -occurrence_of(A,B) | subactivity(f12(A),f12(A)).  [resolve(93,a,88,a)].
0.83/1.25	
0.83/1.25	============================== end predicate elimination =============
0.83/1.25	
0.83/1.25	Auto_denials:  (non-Horn, no changes).
0.83/1.25	
0.83/1.25	Term ordering decisions:
0.83/1.25	Function symbol KB weights:  tptp0=1. tptp1=1. tptp2=1. tptp3=1. tptp4=1. c1=1. f1=1. f2=1. f3=1. f10=1. f11=1. f13=1. f14=1. f15=1. f16=1. f20=1. f21=1. f12=1. f17=1. f18=1. f19=1. f4=1. f6=1. f7=1. f8=1. f9=1. f5=1.
0.83/1.25	
0.83/1.25	============================== end of process initial clauses ========
0.83/1.25	
0.83/1.25	============================== CLAUSES FOR SEARCH ====================
0.83/1.25	
0.83/1.25	============================== end of clauses for search =============
0.83/1.25	
0.83/1.25	============================== SEARCH ================================
0.83/1.25	
0.83/1.25	% Starting search at 0.06 seconds.
0.83/1.25	
0.83/1.25	============================== PROOF =================================
0.83/1.25	% SZS status Theorem
0.83/1.25	% SZS output start Refutation
0.83/1.25	
0.83/1.25	% Proof 1 at 0.16 (+ 0.00) seconds.
0.83/1.25	% Length of proof is 20.
0.83/1.25	% Level of proof is 6.
0.83/1.25	% Maximum clause weight is 15.000.
0.83/1.25	% Given clauses 319.
0.83/1.25	
0.83/1.25	4 (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.83/1.25	22 (all X4 all X5 all X6 (occurrence_of(X4,X5) & occurrence_of(X4,X6) -> X6 = X5)) # label(sos_02) # label(axiom) # label(non_clause).  [assumption].
0.83/1.25	26 (all X56 all X57 (-(exists X59 min_precedes(X56,X59,X57)) & ((exists X58 min_precedes(X58,X56,X57)) | root(X56,X57)) <-> leaf(X56,X57))) # label(sos_21) # label(axiom) # label(non_clause).  [assumption].
0.83/1.25	48 (all X161 (occurrence_of(X161,tptp0) -> (exists X162 exists X163 exists X164 (occurrence_of(X162,tptp3) & root_occ(X162,X161) & occurrence_of(X163,tptp4) & next_subocc(X162,X163,tptp0) & leaf_occ(X164,X161) & next_subocc(X163,X164,tptp0) & (occurrence_of(X164,tptp2) | occurrence_of(X164,tptp1)))))) # label(sos_49) # label(axiom) # label(non_clause).  [assumption].
0.83/1.25	51 -(all X165 (occurrence_of(X165,tptp0) -> (exists X166 exists X167 ((occurrence_of(X167,tptp1) -> -(exists X168 (min_precedes(X166,X168,tptp0) & occurrence_of(X168,tptp2)))) & (occurrence_of(X167,tptp2) -> -(exists X169 (min_precedes(X166,X169,tptp0) & occurrence_of(X169,tptp1)))) & leaf_occ(X167,X165))))) # label(goals) # label(negated_conjecture) # label(non_clause).  [assumption].
0.83/1.25	63 -leaf_occ(A,B) | leaf(A,f2(A,B)) # label(sos_34) # label(axiom).  [clausify(4)].
0.83/1.25	69 -min_precedes(A,B,C) | -leaf(A,C) # label(sos_21) # label(axiom).  [clausify(26)].
0.83/1.25	111 -leaf_occ(A,B) | occurrence_of(B,f2(A,B)) # label(sos_34) # label(axiom).  [clausify(4)].
0.83/1.25	134 -occurrence_of(A,B) | -occurrence_of(A,C) | C = B # label(sos_02) # label(axiom).  [clausify(22)].
0.83/1.25	167 -occurrence_of(A,tptp0) | leaf_occ(f19(A),A) # label(sos_49) # label(axiom).  [clausify(48)].
0.83/1.25	173 occurrence_of(c1,tptp0) # label(goals) # label(negated_conjecture).  [clausify(51)].
0.83/1.25	178 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.83/1.25	198 -min_precedes(A,B,f2(A,C)) | -leaf_occ(A,C).  [resolve(69,b,63,b)].
0.83/1.25	301 leaf_occ(f19(c1),c1).  [resolve(173,a,167,a)].
0.83/1.25	308 -occurrence_of(c1,A) | tptp0 = A.  [resolve(173,a,134,b)].
0.83/1.25	342 min_precedes(A,f20(A,f19(c1)),tptp0) | min_precedes(A,f21(A,f19(c1)),tptp0).  [resolve(301,a,178,c)].
0.83/1.25	349 occurrence_of(c1,f2(f19(c1),c1)).  [resolve(301,a,111,a)].
0.83/1.25	502 f2(f19(c1),c1) = tptp0.  [resolve(349,a,308,a),flip(a)].
0.83/1.25	755 -min_precedes(f19(c1),A,tptp0).  [para(502(a,1),198(a,3)),unit_del(b,301)].
0.83/1.25	1304 $F.  [resolve(342,b,755,a),unit_del(a,755)].
0.83/1.25	
0.83/1.25	% SZS output end Refutation
0.83/1.25	============================== end of proof ==========================
0.83/1.25	
0.83/1.25	============================== STATISTICS ============================
0.83/1.25	
0.83/1.25	Given=319. Generated=1908. Kept=1188. proofs=1.
0.83/1.25	Usable=302. Sos=685. Demods=8. Limbo=3, Disabled=425. Hints=0.
0.83/1.25	Megabytes=2.24.
0.83/1.25	User_CPU=0.16, System_CPU=0.00, Wall_clock=0.
0.83/1.25	
0.83/1.25	============================== end of statistics =====================
0.83/1.25	
0.83/1.25	============================== end of search =========================
0.83/1.25	
0.83/1.25	THEOREM PROVED
0.83/1.25	% SZS status Theorem
0.83/1.25	
0.83/1.25	Exiting with 1 proof.
0.83/1.25	
0.83/1.25	Process 30443 exit (max_proofs) Thu Jul  2 06:54:03 2020
0.83/1.25	Prover9 interrupted
0.83/1.25	EOF