0.08/0.13	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.08/0.14	% Command  : tptp2X_and_run_prover9 %d %s
0.13/0.35	% Computer : n023.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 : 960
0.13/0.35	% WCLimit  : 120
0.13/0.35	% DateTime : Tue Aug  9 03:03:28 EDT 2022
0.13/0.35	% CPUTime  : 
0.80/1.06	============================== Prover9 ===============================
0.80/1.06	Prover9 (32) version 2009-11A, November 2009.
0.80/1.06	Process 17840 was started by sandbox on n023.cluster.edu,
0.80/1.06	Tue Aug  9 03:03:28 2022
0.80/1.06	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 960 -f /tmp/Prover9_17681_n023.cluster.edu".
0.80/1.06	============================== end of head ===========================
0.80/1.06	
0.80/1.06	============================== INPUT =================================
0.80/1.06	
0.80/1.06	% Reading from file /tmp/Prover9_17681_n023.cluster.edu
0.80/1.06	
0.80/1.06	set(prolog_style_variables).
0.80/1.06	set(auto2).
0.80/1.06	    % set(auto2) -> set(auto).
0.80/1.06	    % set(auto) -> set(auto_inference).
0.80/1.06	    % set(auto) -> set(auto_setup).
0.80/1.06	    % set(auto_setup) -> set(predicate_elim).
0.80/1.06	    % set(auto_setup) -> assign(eq_defs, unfold).
0.80/1.06	    % set(auto) -> set(auto_limits).
0.80/1.06	    % set(auto_limits) -> assign(max_weight, "100.000").
0.80/1.06	    % set(auto_limits) -> assign(sos_limit, 20000).
0.80/1.06	    % set(auto) -> set(auto_denials).
0.80/1.06	    % set(auto) -> set(auto_process).
0.80/1.06	    % set(auto2) -> assign(new_constants, 1).
0.80/1.06	    % set(auto2) -> assign(fold_denial_max, 3).
0.80/1.06	    % set(auto2) -> assign(max_weight, "200.000").
0.80/1.06	    % set(auto2) -> assign(max_hours, 1).
0.80/1.06	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.80/1.06	    % set(auto2) -> assign(max_seconds, 0).
0.80/1.06	    % set(auto2) -> assign(max_minutes, 5).
0.80/1.06	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.80/1.06	    % set(auto2) -> set(sort_initial_sos).
0.80/1.06	    % set(auto2) -> assign(sos_limit, -1).
0.80/1.06	    % set(auto2) -> assign(lrs_ticks, 3000).
0.80/1.06	    % set(auto2) -> assign(max_megs, 400).
0.80/1.06	    % set(auto2) -> assign(stats, some).
0.80/1.06	    % set(auto2) -> clear(echo_input).
0.80/1.06	    % set(auto2) -> set(quiet).
0.80/1.06	    % set(auto2) -> clear(print_initial_clauses).
0.80/1.06	    % set(auto2) -> clear(print_given).
0.80/1.06	assign(lrs_ticks,-1).
0.80/1.06	assign(sos_limit,10000).
0.80/1.06	assign(order,kbo).
0.80/1.06	set(lex_order_vars).
0.80/1.06	clear(print_given).
0.80/1.06	
0.80/1.06	% formulas(sos).  % not echoed (49 formulas)
0.80/1.06	
0.80/1.06	============================== end of input ==========================
0.80/1.06	
0.80/1.06	% From the command line: assign(max_seconds, 960).
0.80/1.06	
0.80/1.06	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.80/1.06	
0.80/1.06	% Formulas that are not ordinary clauses:
0.80/1.06	1 (all X87 all X88 all X89 all X90 (occurrence_of(X89,X87) & occurrence_of(X90,X88) & -atomic(X87) & subactivity_occurrence(X89,X90) -> subactivity(X87,X88))) # label(sos_30) # label(axiom) # label(non_clause).  [assumption].
0.80/1.06	2 (all X23 all X24 all X25 (min_precedes(X24,X25,X23) -> (exists X26 exists X27 (subactivity(X26,X23) & atocc(X24,X26) & atocc(X25,X27) & subactivity(X27,X23))))) # label(sos_11) # label(axiom) # label(non_clause).  [assumption].
0.80/1.06	3 (all X35 all X36 all X37 (min_precedes(X35,X36,X37) -> -root(X36,X37))) # label(sos_14) # label(axiom) # label(non_clause).  [assumption].
0.80/1.06	4 (all X69 all X70 all X71 (min_precedes(X70,X71,X69) -> (exists X72 (subactivity_occurrence(X71,X72) & subactivity_occurrence(X70,X72) & occurrence_of(X72,X69))))) # label(sos_25) # label(axiom) # label(non_clause).  [assumption].
0.80/1.06	5 (all X64 all X65 (atocc(X64,X65) <-> (exists X66 (subactivity(X65,X66) & occurrence_of(X64,X66) & atomic(X66))))) # label(sos_23) # label(axiom) # label(non_clause).  [assumption].
0.80/1.06	6 (all X16 all X17 (occurrence_of(X16,X17) -> (atomic(X17) <-> arboreal(X16)))) # label(sos_07) # label(axiom) # label(non_clause).  [assumption].
0.80/1.06	7 (all X102 all X103 (leaf_occ(X102,X103) <-> (exists X104 (occurrence_of(X103,X104) & leaf(X102,X104) & subactivity_occurrence(X102,X103))))) # label(sos_34) # label(axiom) # label(non_clause).  [assumption].
0.80/1.06	8 (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.80/1.06	9 (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.80/1.06	10 (all X0 all X1 (occurrence_of(X1,X0) -> activity_occurrence(X1) & activity(X0))) # label(sos) # label(axiom) # label(non_clause).  [assumption].
0.80/1.06	11 (all X45 all X46 all X47 all X48 (min_precedes(X45,X46,X48) & precedes(X46,X47) & min_precedes(X45,X47,X48) -> min_precedes(X46,X47,X48))) # label(sos_18) # label(axiom) # label(non_clause).  [assumption].
0.80/1.06	12 (all X79 all X80 all X81 all X82 (occurrence_of(X80,X79) & arboreal(X81) & arboreal(X82) & subactivity_occurrence(X82,X80) & subactivity_occurrence(X81,X80) -> min_precedes(X81,X82,X79) | min_precedes(X82,X81,X79) | X82 = X81)) # label(sos_28) # label(axiom) # label(non_clause).  [assumption].
0.80/1.06	13 (all X56 all X57 (-(exists X59 min_precedes(X56,X59,X57)) & (root(X56,X57) | (exists X58 min_precedes(X58,X56,X57))) <-> leaf(X56,X57))) # label(sos_21) # label(axiom) # label(non_clause).  [assumption].
0.80/1.06	14 (all X8 all X9 (earlier(X8,X9) -> -earlier(X9,X8))) # label(sos_04) # label(axiom) # label(non_clause).  [assumption].
0.80/1.06	15 (all X99 all X100 (root_occ(X99,X100) <-> (exists X101 (occurrence_of(X100,X101) & subactivity_occurrence(X99,X100) & root(X99,X101))))) # label(sos_33) # label(axiom) # label(non_clause).  [assumption].
0.80/1.06	16 (all X41 all X42 (root(X41,X42) -> legal(X41))) # label(sos_16) # label(axiom) # label(non_clause).  [assumption].
0.80/1.06	17 (all X94 all X95 all X96 all X97 (occurrence_of(X96,X94) & -subactivity_occurrence(X96,X97) & subactivity(X94,X95) & occurrence_of(X97,X95) -> (exists X98 (-subactivity_occurrence(X98,X96) & subactivity_occurrence(X98,X97))))) # label(sos_32) # label(axiom) # label(non_clause).  [assumption].
0.80/1.06	18 (all X28 all X29 (root(X29,X28) -> (exists X30 (subactivity(X30,X28) & atocc(X29,X30))))) # label(sos_12) # label(axiom) # label(non_clause).  [assumption].
0.80/1.06	19 (all X38 all X39 all X40 (min_precedes(X38,X39,X40) -> precedes(X38,X39))) # label(sos_15) # label(axiom) # label(non_clause).  [assumption].
0.80/1.06	20 (all X60 all X61 all X62 (next_subocc(X60,X61,X62) <-> -(exists X63 (min_precedes(X60,X63,X62) & min_precedes(X63,X61,X62))) & min_precedes(X60,X61,X62))) # label(sos_22) # label(axiom) # label(non_clause).  [assumption].
0.80/1.06	21 (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.80/1.06	22 (all X83 all X84 all X85 all X86 (occurrence_of(X86,X85) & subactivity_occurrence(X84,X86) & min_precedes(X83,X84,X85) -> subactivity_occurrence(X83,X86))) # label(sos_29) # label(axiom) # label(non_clause).  [assumption].
0.80/1.06	23 (all X105 (occurrence_of(X105,tptp0) -> (exists X106 exists X107 exists X108 (occurrence_of(X106,tptp3) & occurrence_of(X107,tptp4) & (occurrence_of(X108,tptp2) | occurrence_of(X108,tptp1)) & leaf_occ(X108,X105) & next_subocc(X107,X108,tptp0) & next_subocc(X106,X107,tptp0) & root_occ(X106,X105))))) # label(sos_35) # label(axiom) # label(non_clause).  [assumption].
0.80/1.06	24 (all X31 all X32 all X33 (min_precedes(X31,X32,X33) -> (exists X34 (min_precedes(X34,X32,X33) & root(X34,X33))))) # label(sos_13) # label(axiom) # label(non_clause).  [assumption].
0.80/1.06	25 (all X19 all X20 (legal(X19) & earlier(X20,X19) -> legal(X20))) # label(sos_09) # label(axiom) # label(non_clause).  [assumption].
0.80/1.06	26 (all X18 (legal(X18) -> arboreal(X18))) # label(sos_08) # label(axiom) # label(non_clause).  [assumption].
0.80/1.06	27 (all X21 all X22 (precedes(X21,X22) <-> legal(X22) & earlier(X21,X22))) # label(sos_10) # label(axiom) # label(non_clause).  [assumption].
0.80/1.06	28 (all X13 all X14 all X15 (earlier(X15,X14) & earlier(X13,X14) -> X13 = X15 | earlier(X13,X15) | earlier(X15,X13))) # label(sos_06) # label(axiom) # label(non_clause).  [assumption].
0.80/1.06	29 (all X7 (activity(X7) -> subactivity(X7,X7))) # label(sos_03) # label(axiom) # label(non_clause).  [assumption].
0.80/1.06	30 (all X49 all X50 all X51 (min_precedes(X49,X50,X51) -> -atomic(X51))) # label(sos_19) # label(axiom) # label(non_clause).  [assumption].
0.80/1.06	31 (all X2 (activity_occurrence(X2) -> (exists X3 (activity(X3) & occurrence_of(X2,X3))))) # label(sos_01) # label(axiom) # label(non_clause).  [assumption].
0.80/1.06	32 (all X76 all X77 (occurrence_of(X77,X76) & -atomic(X76) -> (exists X78 (subactivity_occurrence(X78,X77) & root(X78,X76))))) # label(sos_27) # label(axiom) # label(non_clause).  [assumption].
0.80/1.06	33 (all X67 all X68 (subactivity_occurrence(X67,X68) -> activity_occurrence(X68) & activity_occurrence(X67))) # label(sos_24) # label(axiom) # label(non_clause).  [assumption].
0.80/1.06	34 (all X43 all X44 (atocc(X43,X44) & legal(X43) -> root(X43,X44))) # label(sos_17) # label(axiom) # label(non_clause).  [assumption].
0.80/1.06	35 (all X4 all X5 all X6 (occurrence_of(X4,X6) & occurrence_of(X4,X5) -> X6 = X5)) # label(sos_02) # label(axiom) # label(non_clause).  [assumption].
0.80/1.06	36 (all X52 all X53 all X54 all X55 (min_precedes(X54,X52,X55) & precedes(X53,X54) & min_precedes(X53,X52,X55) -> min_precedes(X53,X54,X55))) # label(sos_20) # label(axiom) # label(non_clause).  [assumption].
0.80/1.06	37 -(all X109 (occurrence_of(X109,tptp0) -> (exists X110 exists X111 (root_occ(X110,X109) & (occurrence_of(X111,tptp1) | occurrence_of(X111,tptp2)) & min_precedes(X110,X111,tptp0) & leaf_occ(X111,X109) & occurrence_of(X110,tptp3))))) # label(goals) # label(negated_conjecture) # label(non_clause).  [assumption].
0.80/1.06	
0.80/1.06	============================== end of process non-clausal formulas ===
0.80/1.06	
0.80/1.06	============================== PROCESS INITIAL CLAUSES ===============
0.80/1.06	
0.80/1.06	============================== PREDICATE ELIMINATION =================
0.80/1.06	38 -activity(A) | subactivity(A,A) # label(sos_03) # label(axiom).  [clausify(29)].
0.80/1.06	39 activity(tptp0) # label(sos_36) # label(axiom).  [assumption].
0.80/1.06	40 -occurrence_of(A,B) | activity(B) # label(sos) # label(axiom).  [clausify(10)].
0.80/1.06	Derived: subactivity(tptp0,tptp0).  [resolve(38,a,39,a)].
0.80/1.06	Derived: subactivity(A,A) | -occurrence_of(B,A).  [resolve(38,a,40,b)].
0.80/1.06	41 -activity_occurrence(A) | activity(f17(A)) # label(sos_01) # label(axiom).  [clausify(31)].
0.80/1.06	Derived: -activity_occurrence(A) | subactivity(f17(A),f17(A)).  [resolve(41,b,38,a)].
0.80/1.06	42 -root_occ(A,B) | root(A,f8(A,B)) # label(sos_33) # label(axiom).  [clausify(15)].
0.80/1.06	43 -min_precedes(A,B,C) | -root(B,C) # label(sos_14) # label(axiom).  [clausify(3)].
0.80/1.06	44 -root(A,B) | legal(A) # label(sos_16) # label(axiom).  [clausify(16)].
0.80/1.06	Derived: -root_occ(A,B) | -min_precedes(C,A,f8(A,B)).  [resolve(42,b,43,b)].
0.80/1.06	Derived: -root_occ(A,B) | legal(A).  [resolve(42,b,44,a)].
0.80/1.06	45 -root(A,B) | subactivity(f10(B,A),B) # label(sos_12) # label(axiom).  [clausify(18)].
0.80/1.06	Derived: subactivity(f10(f8(A,B),A),f8(A,B)) | -root_occ(A,B).  [resolve(45,a,42,b)].
0.80/1.06	46 -root(A,B) | atocc(A,f10(B,A)) # label(sos_12) # label(axiom).  [clausify(18)].
0.80/1.06	Derived: atocc(A,f10(f8(A,B),A)) | -root_occ(A,B).  [resolve(46,a,42,b)].
0.80/1.06	47 -atocc(A,B) | -legal(A) | root(A,B) # label(sos_17) # label(axiom).  [clausify(34)].
0.80/1.06	Derived: -atocc(A,B) | -legal(A) | -min_precedes(C,A,B).  [resolve(47,c,43,b)].
0.80/1.06	Derived: -atocc(A,B) | -legal(A) | subactivity(f10(B,A),B).  [resolve(47,c,45,a)].
0.80/1.06	Derived: -atocc(A,B) | -legal(A) | atocc(A,f10(B,A)).  [resolve(47,c,46,a)].
0.80/1.06	48 -root(A,B) | atomic(B) | subactivity_occurrence(A,f12(B,A)) # label(sos_26) # label(axiom).  [clausify(21)].
0.80/1.06	Derived: atomic(f8(A,B)) | subactivity_occurrence(A,f12(f8(A,B),A)) | -root_occ(A,B).  [resolve(48,a,42,b)].
0.80/1.06	Derived: atomic(A) | subactivity_occurrence(B,f12(A,B)) | -atocc(B,A) | -legal(B).  [resolve(48,a,47,c)].
0.80/1.06	49 -root(A,B) | atomic(B) | occurrence_of(f12(B,A),B) # label(sos_26) # label(axiom).  [clausify(21)].
0.80/1.07	Derived: atomic(f8(A,B)) | occurrence_of(f12(f8(A,B),A),f8(A,B)) | -root_occ(A,B).  [resolve(49,a,42,b)].
0.80/1.07	Derived: atomic(A) | occurrence_of(f12(A,B),A) | -atocc(B,A) | -legal(B).  [resolve(49,a,47,c)].
0.80/1.07	50 -min_precedes(A,B,C) | root(f16(A,B,C),C) # label(sos_13) # label(axiom).  [clausify(24)].
0.80/1.07	Derived: -min_precedes(A,B,C) | -min_precedes(D,f16(A,B,C),C).  [resolve(50,b,43,b)].
0.80/1.07	Derived: -min_precedes(A,B,C) | legal(f16(A,B,C)).  [resolve(50,b,44,a)].
0.80/1.07	Derived: -min_precedes(A,B,C) | subactivity(f10(C,f16(A,B,C)),C).  [resolve(50,b,45,a)].
0.80/1.07	Derived: -min_precedes(A,B,C) | atocc(f16(A,B,C),f10(C,f16(A,B,C))).  [resolve(50,b,46,a)].
0.80/1.07	Derived: -min_precedes(A,B,C) | atomic(C) | subactivity_occurrence(f16(A,B,C),f12(C,f16(A,B,C))).  [resolve(50,b,48,a)].
0.80/1.07	Derived: -min_precedes(A,B,C) | atomic(C) | occurrence_of(f12(C,f16(A,B,C)),C).  [resolve(50,b,49,a)].
0.80/1.07	51 -occurrence_of(A,B) | atomic(B) | root(f18(B,A),B) # label(sos_27) # label(axiom).  [clausify(32)].
0.80/1.07	Derived: -occurrence_of(A,B) | atomic(B) | -min_precedes(C,f18(B,A),B).  [resolve(51,c,43,b)].
0.80/1.07	Derived: -occurrence_of(A,B) | atomic(B) | legal(f18(B,A)).  [resolve(51,c,44,a)].
0.80/1.07	Derived: -occurrence_of(A,B) | atomic(B) | subactivity(f10(B,f18(B,A)),B).  [resolve(51,c,45,a)].
0.80/1.07	Derived: -occurrence_of(A,B) | atomic(B) | atocc(f18(B,A),f10(B,f18(B,A))).  [resolve(51,c,46,a)].
0.80/1.07	Derived: -occurrence_of(A,B) | atomic(B) | atomic(B) | subactivity_occurrence(f18(B,A),f12(B,f18(B,A))).  [resolve(51,c,48,a)].
0.80/1.07	Derived: -occurrence_of(A,B) | atomic(B) | atomic(B) | occurrence_of(f12(B,f18(B,A)),B).  [resolve(51,c,49,a)].
0.80/1.07	52 min_precedes(A,f6(A,B),B) | -root(A,B) | leaf(A,B) # label(sos_21) # label(axiom).  [clausify(13)].
0.80/1.07	Derived: min_precedes(A,f6(A,f8(A,B)),f8(A,B)) | leaf(A,f8(A,B)) | -root_occ(A,B).  [resolve(52,b,42,b)].
0.80/1.07	Derived: min_precedes(A,f6(A,B),B) | leaf(A,B) | -atocc(A,B) | -legal(A).  [resolve(52,b,47,c)].
0.80/1.07	Derived: min_precedes(f16(A,B,C),f6(f16(A,B,C),C),C) | leaf(f16(A,B,C),C) | -min_precedes(A,B,C).  [resolve(52,b,50,b)].
0.80/1.07	Derived: min_precedes(f18(A,B),f6(f18(A,B),A),A) | leaf(f18(A,B),A) | -occurrence_of(B,A) | atomic(A).  [resolve(52,b,51,c)].
0.80/1.07	53 root(A,B) | min_precedes(f7(A,B),A,B) | -leaf(A,B) # label(sos_21) # label(axiom).  [clausify(13)].
0.80/1.07	Derived: min_precedes(f7(A,B),A,B) | -leaf(A,B) | -min_precedes(C,A,B).  [resolve(53,a,43,b)].
0.80/1.07	Derived: min_precedes(f7(A,B),A,B) | -leaf(A,B) | legal(A).  [resolve(53,a,44,a)].
0.80/1.07	Derived: min_precedes(f7(A,B),A,B) | -leaf(A,B) | subactivity(f10(B,A),B).  [resolve(53,a,45,a)].
0.80/1.07	Derived: min_precedes(f7(A,B),A,B) | -leaf(A,B) | atocc(A,f10(B,A)).  [resolve(53,a,46,a)].
0.80/1.07	Derived: min_precedes(f7(A,B),A,B) | -leaf(A,B) | atomic(B) | subactivity_occurrence(A,f12(B,A)).  [resolve(53,a,48,a)].
0.80/1.07	Derived: min_precedes(f7(A,B),A,B) | -leaf(A,B) | atomic(B) | occurrence_of(f12(B,A),B).  [resolve(53,a,49,a)].
0.80/1.07	54 root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -root(A,C) # label(sos_33) # label(axiom).  [clausify(15)].
0.80/1.07	Derived: root_occ(A,B) | -occurrence_of(B,f8(A,C)) | -subactivity_occurrence(A,B) | -root_occ(A,C).  [resolve(54,d,42,b)].
0.80/1.07	Derived: root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -atocc(A,C) | -legal(A).  [resolve(54,d,47,c)].
0.80/1.07	Derived: root_occ(f16(A,B,C),D) | -occurrence_of(D,C) | -subactivity_occurrence(f16(A,B,C),D) | -min_precedes(A,B,C).  [resolve(54,d,50,b)].
0.80/1.07	Derived: root_occ(f18(A,B),C) | -occurrence_of(C,A) | -subactivity_occurrence(f18(A,B),C) | -occurrence_of(B,A) | atomic(A).  [resolve(54,d,51,c)].
0.80/1.07	Derived: root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | min_precedes(f7(A,C),A,C) | -leaf(A,C).  [resolve(54,d,53,a)].
0.80/1.07	55 -leaf_occ(A,B) | leaf(A,f5(A,B)) # label(sos_34) # label(axiom).  [clausify(7)].
0.80/1.07	56 -min_precedes(A,B,C) | -leaf(A,C) # label(sos_21) # label(axiom).  [clausify(13)].
0.80/1.07	Derived: -leaf_occ(A,B) | -min_precedes(A,C,f5(A,B)).  [resolve(55,b,56,b)].
0.80/1.07	57 leaf_occ(A,B) | -occurrence_of(B,C) | -leaf(A,C) | -subactivity_occurrence(A,B) # label(sos_34) # label(axiom).  [clausify(7)].
0.80/1.07	Derived: leaf_occ(A,B) | -occurrence_of(B,f5(A,C)) | -subactivity_occurrence(A,B) | -leaf_occ(A,C).  [resolve(57,c,55,b)].
0.80/1.07	58 min_precedes(A,f6(A,B),B) | -min_precedes(C,A,B) | leaf(A,B) # label(sos_21) # label(axiom).  [clausify(13)].
0.80/1.07	Derived: min_precedes(A,f6(A,B),B) | -min_precedes(C,A,B) | -min_precedes(A,D,B).  [resolve(58,c,56,b)].
0.80/1.07	Derived: min_precedes(A,f6(A,B),B) | -min_precedes(C,A,B) | leaf_occ(A,D) | -occurrence_of(D,B) | -subactivity_occurrence(A,D).  [resolve(58,c,57,c)].
0.80/1.07	59 min_precedes(A,f6(A,f8(A,B)),f8(A,B)) | leaf(A,f8(A,B)) | -root_occ(A,B).  [resolve(52,b,42,b)].
0.80/1.07	Derived: min_precedes(A,f6(A,f8(A,B)),f8(A,B)) | -root_occ(A,B) | -min_precedes(A,C,f8(A,B)).  [resolve(59,b,56,b)].
0.80/1.07	Derived: min_precedes(A,f6(A,f8(A,B)),f8(A,B)) | -root_occ(A,B) | leaf_occ(A,C) | -occurrence_of(C,f8(A,B)) | -subactivity_occurrence(A,C).  [resolve(59,b,57,c)].
0.80/1.07	60 min_precedes(A,f6(A,B),B) | leaf(A,B) | -atocc(A,B) | -legal(A).  [resolve(52,b,47,c)].
0.80/1.07	Derived: min_precedes(A,f6(A,B),B) | -atocc(A,B) | -legal(A) | -min_precedes(A,C,B).  [resolve(60,b,56,b)].
0.80/1.07	Derived: min_precedes(A,f6(A,B),B) | -atocc(A,B) | -legal(A) | leaf_occ(A,C) | -occurrence_of(C,B) | -subactivity_occurrence(A,C).  [resolve(60,b,57,c)].
0.80/1.07	61 min_precedes(f16(A,B,C),f6(f16(A,B,C),C),C) | leaf(f16(A,B,C),C) | -min_precedes(A,B,C).  [resolve(52,b,50,b)].
0.80/1.07	Derived: min_precedes(f16(A,B,C),f6(f16(A,B,C),C),C) | -min_precedes(A,B,C) | -min_precedes(f16(A,B,C),D,C).  [resolve(61,b,56,b)].
0.80/1.07	Derived: min_precedes(f16(A,B,C),f6(f16(A,B,C),C),C) | -min_precedes(A,B,C) | leaf_occ(f16(A,B,C),D) | -occurrence_of(D,C) | -subactivity_occurrence(f16(A,B,C),D).  [resolve(61,b,57,c)].
0.80/1.07	62 min_precedes(f18(A,B),f6(f18(A,B),A),A) | leaf(f18(A,B),A) | -occurrence_of(B,A) | atomic(A).  [resolve(52,b,51,c)].
0.80/1.07	Derived: min_precedes(f18(A,B),f6(f18(A,B),A),A) | -occurrence_of(B,A) | atomic(A) | -min_precedes(f18(A,B),C,A).  [resolve(62,b,56,b)].
0.80/1.07	Derived: min_precedes(f18(A,B),f6(f18(A,B),A),A) | -occurrence_of(B,A) | atomic(A) | leaf_occ(f18(A,B),C) | -occurrence_of(C,A) | -subactivity_occurrence(f18(A,B),C).  [resolve(62,b,57,c)].
0.80/1.07	63 min_precedes(f7(A,B),A,B) | -leaf(A,B) | -min_precedes(C,A,B).  [resolve(53,a,43,b)].
0.80/1.07	Derived: min_precedes(f7(A,f5(A,B)),A,f5(A,B)) | -min_precedes(C,A,f5(A,B)) | -leaf_occ(A,B).  [resolve(63,b,55,b)].
0.80/1.07	Derived: min_precedes(f7(A,B),A,B) | -min_precedes(C,A,B) | min_precedes(A,f6(A,B),B) | -min_precedes(D,A,B).  [resolve(63,b,58,c)].
0.80/1.07	64 min_precedes(f7(A,B),A,B) | -leaf(A,B) | legal(A).  [resolve(53,a,44,a)].
0.80/1.07	Derived: min_precedes(f7(A,f5(A,B)),A,f5(A,B)) | legal(A) | -leaf_occ(A,B).  [resolve(64,b,55,b)].
0.80/1.07	Derived: min_precedes(f7(A,f8(A,B)),A,f8(A,B)) | legal(A) | min_precedes(A,f6(A,f8(A,B)),f8(A,B)) | -root_occ(A,B).  [resolve(64,b,59,b)].
0.80/1.07	Derived: min_precedes(f7(f16(A,B,C),C),f16(A,B,C),C) | legal(f16(A,B,C)) | min_precedes(f16(A,B,C),f6(f16(A,B,C),C),C) | -min_precedes(A,B,C).  [resolve(64,b,61,b)].
0.80/1.07	Derived: min_precedes(f7(f18(A,B),A),f18(A,B),A) | legal(f18(A,B)) | min_precedes(f18(A,B),f6(f18(A,B),A),A) | -occurrence_of(B,A) | atomic(A).  [resolve(64,b,62,b)].
0.80/1.07	65 min_precedes(f7(A,B),A,B) | -leaf(A,B) | subactivity(f10(B,A),B).  [resolve(53,a,45,a)].
0.80/1.07	Derived: min_precedes(f7(A,f5(A,B)),A,f5(A,B)) | subactivity(f10(f5(A,B),A),f5(A,B)) | -leaf_occ(A,B).  [resolve(65,b,55,b)].
0.80/1.07	Derived: min_precedes(f7(A,f8(A,B)),A,f8(A,B)) | subactivity(f10(f8(A,B),A),f8(A,B)) | min_precedes(A,f6(A,f8(A,B)),f8(A,B)) | -root_occ(A,B).  [resolve(65,b,59,b)].
0.80/1.07	Derived: min_precedes(f7(A,B),A,B) | subactivity(f10(B,A),B) | min_precedes(A,f6(A,B),B) | -atocc(A,B) | -legal(A).  [resolve(65,b,60,b)].
0.80/1.07	Derived: min_precedes(f7(f16(A,B,C),C),f16(A,B,C),C) | subactivity(f10(C,f16(A,B,C)),C) | min_precedes(f16(A,B,C),f6(f16(A,B,C),C),C) | -min_precedes(A,B,C).  [resolve(65,b,61,b)].
0.80/1.07	Derived: min_precedes(f7(f18(A,B),A),f18(A,B),A) | subactivity(f10(A,f18(A,B)),A) | min_precedes(f18(A,B),f6(f18(A,B),A),A) | -occurrence_of(B,A) | atomic(A).  [resolve(65,b,62,b)].
0.80/1.07	66 min_precedes(f7(A,B),A,B) | -leaf(A,B) | atocc(A,f10(B,A)).  [resolve(53,a,46,a)].
0.80/1.07	Derived: min_precedes(f7(A,f5(A,B)),A,f5(A,B)) | atocc(A,f10(f5(A,B),A)) | -leaf_occ(A,B).  [resolve(66,b,55,b)].
0.80/1.07	Derived: min_precedes(f7(A,f8(A,B)),A,f8(A,B)) | atocc(A,f10(f8(A,B),A)) | min_precedes(A,f6(A,f8(A,B)),f8(A,B)) | -root_occ(A,B).  [resolve(66,b,59,b)].
0.80/1.07	Derived: min_precedes(f7(A,B),A,B) | atocc(A,f10(B,A)) | min_precedes(A,f6(A,B),B) | -atocc(A,B) | -legal(A).  [resolve(66,b,60,b)].
0.80/1.07	Derived: min_precedes(f7(f16(A,B,C),C),f16(A,B,C),C) | atocc(f16(A,B,C),f10(C,f16(A,B,C))) | min_precedes(f16(A,B,C),f6(f16(A,B,C),C),C) | -min_precedes(A,B,C).  [resolve(66,b,61,b)].
0.80/1.07	Derived: min_precedes(f7(f18(A,B),A),f18(A,B),A) | atocc(f18(A,B),f10(A,f18(A,B))) | min_precedes(f18(A,B),f6(f18(A,B),A),A) | -occurrence_of(B,A) | atomic(A).  [resolve(66,b,62,b)].
0.80/1.07	67 min_precedes(f7(A,B),A,B) | -leaf(A,B) | atomic(B) | subactivity_occurrence(A,f12(B,A)).  [resolve(53,a,48,a)].
0.80/1.07	Derived: min_precedes(f7(A,f5(A,B)),A,f5(A,B)) | atomic(f5(A,B)) | subactivity_occurrence(A,f12(f5(A,B),A)) | -leaf_occ(A,B).  [resolve(67,b,55,b)].
0.80/1.07	Derived: min_precedes(f7(A,f8(A,B)),A,f8(A,B)) | atomic(f8(A,B)) | subactivity_occurrence(A,f12(f8(A,B),A)) | min_precedes(A,f6(A,f8(A,B)),f8(A,B)) | -root_occ(A,B).  [resolve(67,b,59,b)].
0.80/1.07	Derived: min_precedes(f7(A,B),A,B) | atomic(B) | subactivity_occurrence(A,f12(B,A)) | min_precedes(A,f6(A,B),B) | -atocc(A,B) | -legal(A).  [resolve(67,b,60,b)].
0.80/1.07	Derived: min_precedes(f7(f16(A,B,C),C),f16(A,B,C),C) | atomic(C) | subactivity_occurrence(f16(A,B,C),f12(C,f16(A,B,C))) | min_precedes(f16(A,B,C),f6(f16(A,B,C),C),C) | -min_precedes(A,B,C).  [resolve(67,b,61,b)].
0.80/1.07	Derived: min_precedes(f7(f18(A,B),A),f18(A,B),A) | atomic(A) | subactivity_occurrence(f18(A,B),f12(A,f18(A,B))) | min_precedes(f18(A,B),f6(f18(A,B),A),A) | -occurrence_of(B,A) | atomic(A).  [resolve(67,b,62,b)].
0.80/1.07	68 min_precedes(f7(A,B),A,B) | -leaf(A,B) | atomic(B) | occurrence_of(f12(B,A),B).  [resolve(53,a,49,a)].
0.80/1.07	Derived: min_precedes(f7(A,f5(A,B)),A,f5(A,B)) | atomic(f5(A,B)) | occurrence_of(f12(f5(A,B),A),f5(A,B)) | -leaf_occ(A,B).  [resolve(68,b,55,b)].
0.80/1.07	Derived: min_precedes(f7(A,f8(A,B)),A,f8(A,B)) | atomic(f8(A,B)) | occurrence_of(f12(f8(A,B),A),f8(A,B)) | min_precedes(A,f6(A,f8(A,B)),f8(A,B)) | -root_occ(A,B).  [resolve(68,b,59,b)].
0.80/1.07	Derived: min_precedes(f7(A,B),A,B) | atomic(B) | occurrence_of(f12(B,A),B) | min_precedes(A,f6(A,B),B) | -atocc(A,B) | -legal(A).  [resolve(68,b,60,b)].
0.80/1.07	Derived: min_precedes(f7(f16(A,B,C),C),f16(A,B,C),C) | atomic(C) | occurrence_of(f12(C,f16(A,B,C)),C) | min_precedes(f16(A,B,C),f6(f16(A,B,C),C),C) | -min_precedes(A,B,C).  [resolve(68,b,61,b)].
0.80/1.07	Derived: min_precedes(f7(f18(A,B),A),f18(A,B),A) | atomic(A) | occurrence_of(f12(A,f18(A,B)),A) | min_precedes(f18(A,B),f6(f18(A,B),A),A) | -occurrence_of(B,A) | atomic(A).  [resolve(68,b,62,b)].
0.80/1.07	69 root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | min_precedes(f7(A,C),A,C) | -leaf(A,C).  [resolve(54,d,53,a)].
0.80/1.07	Derived: root_occ(A,B) | -occurrence_of(B,f5(A,C)) | -subactivity_occurrence(A,B) | min_precedes(f7(A,f5(A,C)),A,f5(A,C)) | -leaf_occ(A,C).  [resolve(69,e,55,b)].
0.80/1.07	Derived: root_occ(A,B) | -occurrence_of(B,f8(A,C)) | -subactivity_occurrence(A,B) | min_precedes(f7(A,f8(A,C)),A,f8(A,C)) | min_precedes(A,f6(A,f8(A,C)),f8(A,C)) | -root_occ(A,C).  [resolve(69,e,59,b)].
0.80/1.07	Derived: root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | min_precedes(f7(A,C),A,C) | min_precedes(A,f6(A,C),C) | -atocc(A,C) | -legal(A).  [resolve(69,e,60,b)].
0.80/1.07	Derived: root_occ(f16(A,B,C),D) | -occurrence_of(D,C) | -subactivity_occurrence(f16(A,B,C),D) | min_precedes(f7(f16(A,B,C),C),f16(A,B,C),C) | min_precedes(f16(A,B,C),f6(f16(A,B,C),C),C) | -min_precedes(A,B,C).  [resolve(69,e,61,b)].
0.80/1.07	Derived: root_occ(f18(A,B),C) | -occurrence_of(C,A) | -subactivity_occurrence(f18(A,B),C) | min_precedes(f7(f18(A,B),A),f18(A,B),A) | min_precedes(f18(A,B),f6(f18(A,B),A),A) | -occurrence_of(B,A) | atomic(A).  [resolve(69,e,62,b)].
0.80/1.07	70 -occurrence_of(A,tptp0) | next_subocc(f14(A),f15(A),tptp0) # label(sos_35) # label(axiom).  [clausify(23)].
0.80/1.07	71 -next_subocc(A,B,C) | -min_precedes(A,D,C) | -min_precedes(D,B,C) # label(sos_22) # label(axiom).  [clausify(20)].
0.80/1.07	72 -next_subocc(A,B,C) | min_precedes(A,B,C) # label(sos_22) # label(axiom).  [clausify(20)].
0.80/1.07	Derived: -occurrence_of(A,tptp0) | -min_precedes(f14(A),B,tptp0) | -min_precedes(B,f15(A),tptp0).  [resolve(70,b,71,a)].
0.80/1.07	Derived: -occurrence_of(A,tptp0) | min_precedes(f14(A),f15(A),tptp0).  [resolve(70,b,72,a)].
0.80/1.07	73 -occurrence_of(A,tptp0) | next_subocc(f13(A),f14(A),tptp0) # label(sos_35) # label(axiom).  [clausify(23)].
0.80/1.07	Derived: -occurrence_of(A,tptp0) | -min_precedes(f13(A),B,tptp0) | -min_precedes(B,f14(A),tptp0).  [resolve(73,b,71,a)].
0.80/1.07	Derived: -occurrence_of(A,tptp0) | min_precedes(f13(A),f14(A),tptp0).  [resolve(73,b,72,a)].
0.80/1.07	74 next_subocc(A,B,C) | min_precedes(A,f11(A,B,C),C) | -min_precedes(A,B,C) # label(sos_22) # label(axiom).  [clausify(20)].
0.80/1.07	Derived: min_precedes(A,f11(A,B,C),C) | -min_precedes(A,B,C) | -min_precedes(A,D,C) | -min_precedes(D,B,C).  [resolve(74,a,71,a)].
0.80/1.07	75 next_subocc(A,B,C) | min_precedes(f11(A,B,C),B,C) | -min_precedes(A,B,C) # label(sos_22) # label(axiom).  [clausify(20)].
0.82/1.08	Derived: min_precedes(f11(A,B,C),B,C) | -min_precedes(A,B,C) | -min_precedes(A,D,C) | -min_precedes(D,B,C).  [resolve(75,a,71,a)].
0.82/1.08	76 -activity_occurrence(A) | occurrence_of(A,f17(A)) # label(sos_01) # label(axiom).  [clausify(31)].
0.82/1.08	77 -occurrence_of(A,B) | activity_occurrence(A) # label(sos) # label(axiom).  [clausify(10)].
0.82/1.08	78 -subactivity_occurrence(A,B) | activity_occurrence(B) # label(sos_24) # label(axiom).  [clausify(33)].
0.82/1.08	79 -subactivity_occurrence(A,B) | activity_occurrence(A) # label(sos_24) # label(axiom).  [clausify(33)].
0.82/1.08	Derived: occurrence_of(A,f17(A)) | -occurrence_of(A,B).  [resolve(76,a,77,b)].
0.82/1.08	Derived: occurrence_of(A,f17(A)) | -subactivity_occurrence(B,A).  [resolve(76,a,78,b)].
0.82/1.08	Derived: occurrence_of(A,f17(A)) | -subactivity_occurrence(A,B).  [resolve(76,a,79,b)].
0.82/1.08	80 -activity_occurrence(A) | subactivity(f17(A),f17(A)).  [resolve(41,b,38,a)].
0.82/1.08	Derived: subactivity(f17(A),f17(A)) | -occurrence_of(A,B).  [resolve(80,a,77,b)].
0.82/1.08	Derived: subactivity(f17(A),f17(A)) | -subactivity_occurrence(B,A).  [resolve(80,a,78,b)].
0.82/1.08	Derived: subactivity(f17(A),f17(A)) | -subactivity_occurrence(A,B).  [resolve(80,a,79,b)].
0.82/1.08	81 -min_precedes(A,B,C) | precedes(A,B) # label(sos_15) # label(axiom).  [clausify(19)].
0.82/1.08	82 -precedes(A,B) | legal(B) # label(sos_10) # label(axiom).  [clausify(27)].
0.82/1.08	83 -precedes(A,B) | earlier(A,B) # label(sos_10) # label(axiom).  [clausify(27)].
0.82/1.08	Derived: -min_precedes(A,B,C) | legal(B).  [resolve(81,b,82,a)].
0.82/1.08	Derived: -min_precedes(A,B,C) | earlier(A,B).  [resolve(81,b,83,a)].
0.82/1.08	84 precedes(A,B) | -legal(B) | -earlier(A,B) # label(sos_10) # label(axiom).  [clausify(27)].
0.82/1.08	85 -min_precedes(A,B,C) | -precedes(B,D) | -min_precedes(A,D,C) | min_precedes(B,D,C) # label(sos_18) # label(axiom).  [clausify(11)].
0.82/1.08	Derived: -min_precedes(A,B,C) | -min_precedes(A,D,C) | min_precedes(B,D,C) | -min_precedes(B,D,E).  [resolve(85,b,81,b)].
0.82/1.08	Derived: -min_precedes(A,B,C) | -min_precedes(A,D,C) | min_precedes(B,D,C) | -legal(D) | -earlier(B,D).  [resolve(85,b,84,a)].
0.82/1.08	86 -min_precedes(A,B,C) | -precedes(D,A) | -min_precedes(D,B,C) | min_precedes(D,A,C) # label(sos_20) # label(axiom).  [clausify(36)].
0.82/1.08	Derived: -min_precedes(A,B,C) | -min_precedes(D,B,C) | min_precedes(D,A,C) | -min_precedes(D,A,E).  [resolve(86,b,81,b)].
0.82/1.08	Derived: -min_precedes(A,B,C) | -min_precedes(D,B,C) | min_precedes(D,A,C) | -legal(A) | -earlier(D,A).  [resolve(86,b,84,a)].
0.82/1.08	87 atocc(A,B) | -subactivity(B,C) | -occurrence_of(A,C) | -atomic(C) # label(sos_23) # label(axiom).  [clausify(5)].
0.82/1.08	88 -atocc(A,B) | subactivity(B,f4(A,B)) # label(sos_23) # label(axiom).  [clausify(5)].
0.82/1.08	89 -min_precedes(A,B,C) | subactivity(f1(C,A,B),C) # label(sos_11) # label(axiom).  [clausify(2)].
0.82/1.08	90 -min_precedes(A,B,C) | subactivity(f2(C,A,B),C) # label(sos_11) # label(axiom).  [clausify(2)].
0.82/1.08	Derived: atocc(A,B) | -occurrence_of(A,f4(C,B)) | -atomic(f4(C,B)) | -atocc(C,B).  [resolve(87,b,88,b)].
0.82/1.08	Derived: atocc(A,f1(B,C,D)) | -occurrence_of(A,B) | -atomic(B) | -min_precedes(C,D,B).  [resolve(87,b,89,b)].
0.82/1.08	Derived: atocc(A,f2(B,C,D)) | -occurrence_of(A,B) | -atomic(B) | -min_precedes(C,D,B).  [resolve(87,b,90,b)].
0.82/1.08	91 -occurrence_of(A,B) | -occurrence_of(C,D) | atomic(B) | -subactivity_occurrence(A,C) | subactivity(B,D) # label(sos_30) # label(axiom).  [clausify(1)].
0.82/1.08	Derived: -occurrence_of(A,B) | -occurrence_of(C,D) | atomic(B) | -subactivity_occurrence(A,C) | atocc(E,B) | -occurrence_of(E,D) | -atomic(D).  [resolve(91,e,87,b)].
0.82/1.08	92 -occurrence_of(A,B) | subactivity_occurrence(A,C) | -subactivity(B,D) | -occurrence_of(C,D) | -subactivity_occurrence(f9(B,D,A,C),A) # label(sos_32) # label(axiom).  [clausify(17)].
0.82/1.08	Derived: -occurrence_of(A,B) | subactivity_occurrence(A,C) | -occurrence_of(C,f4(D,B)) | -subactivity_occurrence(f9(B,f4(D,B),A,C),A) | -atocc(D,B).  [resolve(92,c,88,b)].
0.82/1.08	Derived: -occurrence_of(A,f1(B,C,D)) | subactivity_occurrence(A,E) | -occurrence_of(E,B) | -subactivity_occurrence(f9(f1(B,C,D),B,A,E),A) | -min_precedes(C,D,B).  [resolve(92,c,89,b)].
0.82/1.08	Derived: -occurrence_of(A,f2(B,C,D)) | subactivity_occurrence(A,E) | -occurrence_of(E,B) | -subactivity_occurrence(f9(f2(B,C,D),B,A,E),A) | -min_precedes(C,D,B).  [resolve(92,c,90,b)].
0.82/1.08	Derived: -occurrence_of(A,B) | subactivity_occurrence(A,C) | -occurrence_of(C,D) | -subactivity_occurrence(f9(B,D,A,C),A) | -occurrence_of(E,B) | -occurrence_of(F,D) | atomic(B) | -subactivity_occurrence(E,F).  [resolve(92,c,91,e)].
0.82/1.08	93 -occurrence_of(A,B) | subactivity_occurrence(A,C) | -subactivity(B,D) | -occurrence_of(C,D) | subactivity_occurrence(f9(B,D,A,C),C) # label(sos_32) # label(axiom).  [clausify(17)].
0.82/1.08	Derived: -occurrence_of(A,B) | subactivity_occurrence(A,C) | -occurrence_of(C,f4(D,B)) | subactivity_occurrence(f9(B,f4(D,B),A,C),C) | -atocc(D,B).  [resolve(93,c,88,b)].
0.82/1.08	Derived: -occurrence_of(A,f1(B,C,D)) | subactivity_occurrence(A,E) | -occurrence_of(E,B) | subactivity_occurrence(f9(f1(B,C,D),B,A,E),E) | -min_precedes(C,D,B).  [resolve(93,c,89,b)].
0.82/1.08	Derived: -occurrence_of(A,f2(B,C,D)) | subactivity_occurrence(A,E) | -occurrence_of(E,B) | subactivity_occurrence(f9(f2(B,C,D),B,A,E),E) | -min_precedes(C,D,B).  [resolve(93,c,90,b)].
0.82/1.08	Derived: -occurrence_of(A,B) | subactivity_occurrence(A,C) | -occurrence_of(C,D) | subactivity_occurrence(f9(B,D,A,C),C) | -occurrence_of(E,B) | -occurrence_of(F,D) | atomic(B) | -subactivity_occurrence(E,F).  [resolve(93,c,91,e)].
0.82/1.08	94 subactivity(tptp0,tptp0).  [resolve(38,a,39,a)].
0.82/1.08	Derived: atocc(A,tptp0) | -occurrence_of(A,tptp0) | -atomic(tptp0).  [resolve(94,a,87,b)].
0.82/1.08	Derived: -occurrence_of(A,tptp0) | subactivity_occurrence(A,B) | -occurrence_of(B,tptp0) | -subactivity_occurrence(f9(tptp0,tptp0,A,B),A).  [resolve(94,a,92,c)].
0.82/1.08	Derived: -occurrence_of(A,tptp0) | subactivity_occurrence(A,B) | -occurrence_of(B,tptp0) | subactivity_occurrence(f9(tptp0,tptp0,A,B),B).  [resolve(94,a,93,c)].
0.82/1.08	95 subactivity(A,A) | -occurrence_of(B,A).  [resolve(38,a,40,b)].
0.82/1.08	Derived: -occurrence_of(A,B) | atocc(C,B) | -occurrence_of(C,B) | -atomic(B).  [resolve(95,a,87,b)].
0.82/1.08	Derived: -occurrence_of(A,B) | -occurrence_of(C,B) | subactivity_occurrence(C,D) | -occurrence_of(D,B) | -subactivity_occurrence(f9(B,B,C,D),C).  [resolve(95,a,92,c)].
0.82/1.08	Derived: -occurrence_of(A,B) | -occurrence_of(C,B) | subactivity_occurrence(C,D) | -occurrence_of(D,B) | subactivity_occurrence(f9(B,B,C,D),D).  [resolve(95,a,93,c)].
0.82/1.08	96 subactivity(f10(f8(A,B),A),f8(A,B)) | -root_occ(A,B).  [resolve(45,a,42,b)].
0.82/1.08	Derived: -root_occ(A,B) | atocc(C,f10(f8(A,B),A)) | -occurrence_of(C,f8(A,B)) | -atomic(f8(A,B)).  [resolve(96,a,87,b)].
0.82/1.08	Derived: -root_occ(A,B) | -occurrence_of(C,f10(f8(A,B),A)) | subactivity_occurrence(C,D) | -occurrence_of(D,f8(A,B)) | -subactivity_occurrence(f9(f10(f8(A,B),A),f8(A,B),C,D),C).  [resolve(96,a,92,c)].
0.82/1.08	Derived: -root_occ(A,B) | -occurrence_of(C,f10(f8(A,B),A)) | subactivity_occurrence(C,D) | -occurrence_of(D,f8(A,B)) | subactivity_occurrence(f9(f10(f8(A,B),A),f8(A,B),C,D),D).  [resolve(96,a,93,c)].
0.82/1.08	97 -atocc(A,B) | -legal(A) | subactivity(f10(B,A),B).  [resolve(47,c,45,a)].
0.82/1.08	Derived: -atocc(A,B) | -legal(A) | atocc(C,f10(B,A)) | -occurrence_of(C,B) | -atomic(B).  [resolve(97,c,87,b)].
0.82/1.08	Derived: -atocc(A,B) | -legal(A) | -occurrence_of(C,f10(B,A)) | subactivity_occurrence(C,D) | -occurrence_of(D,B) | -subactivity_occurrence(f9(f10(B,A),B,C,D),C).  [resolve(97,c,92,c)].
0.82/1.08	Derived: -atocc(A,B) | -legal(A) | -occurrence_of(C,f10(B,A)) | subactivity_occurrence(C,D) | -occurrence_of(D,B) | subactivity_occurrence(f9(f10(B,A),B,C,D),D).  [resolve(97,c,93,c)].
0.82/1.08	98 -min_precedes(A,B,C) | subactivity(f10(C,f16(A,B,C)),C).  [resolve(50,b,45,a)].
0.82/1.08	Derived: -min_precedes(A,B,C) | atocc(D,f10(C,f16(A,B,C))) | -occurrence_of(D,C) | -atomic(C).  [resolve(98,b,87,b)].
0.82/1.08	Derived: -min_precedes(A,B,C) | -occurrence_of(D,f10(C,f16(A,B,C))) | subactivity_occurrence(D,E) | -occurrence_of(E,C) | -subactivity_occurrence(f9(f10(C,f16(A,B,C)),C,D,E),D).  [resolve(98,b,92,c)].
0.82/1.08	Derived: -min_precedes(A,B,C) | -occurrence_of(D,f10(C,f16(A,B,C))) | subactivity_occurrence(D,E) | -occurrence_of(E,C) | subactivity_occurrence(f9(f10(C,f16(A,B,C)),C,D,E),E).  [resolve(98,b,93,c)].
0.82/1.08	99 -occurrence_of(A,B) | atomic(B) | subactivity(f10(B,f18(B,A)),B).  [resolve(51,c,45,a)].
3.52/3.88	Derived: -occurrence_of(A,B) | atomic(B) | -occurrence_of(C,f10(B,f18(B,A))) | subactivity_occurrence(C,D) | -occurrence_of(D,B) | -subactivity_occurrence(f9(f10(B,f18(B,A)),B,C,D),C).  [resolve(99,c,92,c)].
3.52/3.88	Derived: -occurrence_of(A,B) | atomic(B) | -occurrence_of(C,f10(B,f18(B,A))) | subactivity_occurrence(C,D) | -occurrence_of(D,B) | subactivity_occurrence(f9(f10(B,f18(B,A)),B,C,D),D).  [resolve(99,c,93,c)].
3.52/3.88	100 min_precedes(f7(A,f5(A,B)),A,f5(A,B)) | subactivity(f10(f5(A,B),A),f5(A,B)) | -leaf_occ(A,B).  [resolve(65,b,55,b)].
3.52/3.88	Derived: min_precedes(f7(A,f5(A,B)),A,f5(A,B)) | -leaf_occ(A,B) | atocc(C,f10(f5(A,B),A)) | -occurrence_of(C,f5(A,B)) | -atomic(f5(A,B)).  [resolve(100,b,87,b)].
3.52/3.88	Derived: min_precedes(f7(A,f5(A,B)),A,f5(A,B)) | -leaf_occ(A,B) | -occurrence_of(C,f10(f5(A,B),A)) | subactivity_occurrence(C,D) | -occurrence_of(D,f5(A,B)) | -subactivity_occurrence(f9(f10(f5(A,B),A),f5(A,B),C,D),C).  [resolve(100,b,92,c)].
3.52/3.88	Derived: min_precedes(f7(A,f5(A,B)),A,f5(A,B)) | -leaf_occ(A,B) | -occurrence_of(C,f10(f5(A,B),A)) | subactivity_occurrence(C,D) | -occurrence_of(D,f5(A,B)) | subactivity_occurrence(f9(f10(f5(A,B),A),f5(A,B),C,D),D).  [resolve(100,b,93,c)].
3.52/3.88	101 min_precedes(f7(A,f8(A,B)),A,f8(A,B)) | subactivity(f10(f8(A,B),A),f8(A,B)) | min_precedes(A,f6(A,f8(A,B)),f8(A,B)) | -root_occ(A,B).  [resolve(65,b,59,b)].
3.52/3.88	102 min_precedes(f7(A,B),A,B) | subactivity(f10(B,A),B) | min_precedes(A,f6(A,B),B) | -atocc(A,B) | -legal(A).  [resolve(65,b,60,b)].
3.52/3.88	103 min_precedes(f7(f16(A,B,C),C),f16(A,B,C),C) | subactivity(f10(C,f16(A,B,C)),C) | min_precedes(f16(A,B,C),f6(f16(A,B,C),C),C) | -min_precedes(A,B,C).  [resolve(65,b,61,b)].
3.52/3.88	104 min_precedes(f7(f18(A,B),A),f18(A,B),A) | subactivity(f10(A,f18(A,B)),A) | min_precedes(f18(A,B),f6(f18(A,B),A),A) | -occurrence_of(B,A) | atomic(A).  [resolve(65,b,62,b)].
3.52/3.88	105 subactivity(f17(A),f17(A)) | -occurrence_of(A,B).  [resolve(80,a,77,b)].
3.52/3.88	106 subactivity(f17(A),f17(A)) | -subactivity_occurrence(B,A).  [resolve(80,a,78,b)].
3.52/3.88	107 subactivity(f17(A),f17(A)) | -subactivity_occurrence(A,B).  [resolve(80,a,79,b)].
3.52/3.88	
3.52/3.88	============================== end predicate elimination =============
3.52/3.88	
3.52/3.88	Auto_denials:  (non-Horn, no changes).
3.52/3.88	
3.52/3.88	Term ordering decisions:
3.52/3.88	Function symbol KB weights:  tptp0=1. tptp1=1. tptp2=1. tptp3=1. tptp4=1. c1=1. f4=1. f5=1. f6=1. f7=1. f8=1. f10=1. f12=1. f18=1. f13=1. f14=1. f15=1. f17=1. f1=1. f2=1. f3=1. f11=1. f16=1. f9=1.
3.52/3.88	
3.52/3.88	============================== end of process initial clauses ========
3.52/3.88	
3.52/3.88	============================== CLAUSES FOR SEARCH ====================
3.52/3.88	
3.52/3.88	============================== end of clauses for search =============
3.52/3.88	
3.52/3.88	============================== SEARCH ================================
3.52/3.88	
3.52/3.88	% Starting search at 0.05 seconds.
3.52/3.88	
3.52/3.88	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 32 (0.00 of 0.25 sec).
3.52/3.88	
3.52/3.88	Low Water (keep): wt=53.000, iters=4089
3.52/3.88	
3.52/3.88	Low Water (keep): wt=48.000, iters=3862
3.52/3.88	
3.52/3.88	Low Water (keep): wt=45.000, iters=3642
3.52/3.88	
3.52/3.88	Low Water (keep): wt=41.000, iters=3791
3.52/3.88	
3.52/3.88	Low Water (keep): wt=39.000, iters=3606
3.52/3.88	
3.52/3.88	Low Water (keep): wt=37.000, iters=3381
3.52/3.88	
3.52/3.88	Low Water (keep): wt=36.000, iters=3353
3.52/3.88	
3.52/3.88	Low Water (keep): wt=35.000, iters=3362
3.52/3.88	
3.52/3.88	Low Water (keep): wt=33.000, iters=3359
3.52/3.88	
3.52/3.88	Low Water (keep): wt=32.000, iters=3432
3.52/3.88	
3.52/3.88	Low Water (keep): wt=31.000, iters=3366
3.52/3.88	
3.52/3.88	Low Water (keep): wt=30.000, iters=3375
3.52/3.88	
3.52/3.88	Low Water (keep): wt=29.000, iters=3346
3.52/3.88	
3.52/3.88	Low Water (keep): wt=28.000, iters=3682
3.52/3.88	
3.52/3.88	Low Water (keep): wt=27.000, iters=3457
3.52/3.88	
3.52/3.88	Low Water (keep): wt=26.000, iters=3363
3.52/3.88	
3.52/3.88	Low Water (keep): wt=25.000, iters=3340
3.52/3.88	
3.52/3.88	Low Water (keep): wt=24.000, iters=3528
3.52/3.88	
3.52/3.88	============================== PROOF =================================
3.52/3.88	% SZS status Theorem
3.52/3.88	% SZS output start Refutation
3.52/3.88	
3.52/3.88	% Proof 1 at 2.77 (+ 0.06) seconds.
3.52/3.88	% Length of proof is 104.
3.52/3.88	% Level of proof is 15.
3.52/3.88	% Maximum clause weight is 24.000.
3.52/3.88	% Given clauses 3230.
3.52/3.88	
3.52/3.88	3 (all X35 all X36 all X37 (min_precedes(X35,X36,X37) -> -root(X36,X37))) # label(sos_14) # label(axiom) # label(non_clause).  [assumption].
3.52/3.88	5 (all X64 all X65 (atocc(X64,X65) <-> (exists X66 (subactivity(X65,X66) & occurrence_of(X64,X66) & atomic(X66))))) # label(sos_23) # label(axiom) # label(non_clause).  [assumption].
3.52/3.88	6 (all X16 all X17 (occurrence_of(X16,X17) -> (atomic(X17) <-> arboreal(X16)))) # label(sos_07) # label(axiom) # label(non_clause).  [assumption].
3.52/3.88	7 (all X102 all X103 (leaf_occ(X102,X103) <-> (exists X104 (occurrence_of(X103,X104) & leaf(X102,X104) & subactivity_occurrence(X102,X103))))) # label(sos_34) # label(axiom) # label(non_clause).  [assumption].
3.52/3.88	10 (all X0 all X1 (occurrence_of(X1,X0) -> activity_occurrence(X1) & activity(X0))) # label(sos) # label(axiom) # label(non_clause).  [assumption].
3.52/3.88	12 (all X79 all X80 all X81 all X82 (occurrence_of(X80,X79) & arboreal(X81) & arboreal(X82) & subactivity_occurrence(X82,X80) & subactivity_occurrence(X81,X80) -> min_precedes(X81,X82,X79) | min_precedes(X82,X81,X79) | X82 = X81)) # label(sos_28) # label(axiom) # label(non_clause).  [assumption].
3.52/3.88	15 (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].
3.52/3.88	19 (all X38 all X39 all X40 (min_precedes(X38,X39,X40) -> precedes(X38,X39))) # label(sos_15) # label(axiom) # label(non_clause).  [assumption].
3.52/3.88	20 (all X60 all X61 all X62 (next_subocc(X60,X61,X62) <-> -(exists X63 (min_precedes(X60,X63,X62) & min_precedes(X63,X61,X62))) & min_precedes(X60,X61,X62))) # label(sos_22) # label(axiom) # label(non_clause).  [assumption].
3.52/3.88	23 (all X105 (occurrence_of(X105,tptp0) -> (exists X106 exists X107 exists X108 (occurrence_of(X106,tptp3) & occurrence_of(X107,tptp4) & (occurrence_of(X108,tptp2) | occurrence_of(X108,tptp1)) & leaf_occ(X108,X105) & next_subocc(X107,X108,tptp0) & next_subocc(X106,X107,tptp0) & root_occ(X106,X105))))) # label(sos_35) # label(axiom) # label(non_clause).  [assumption].
3.52/3.88	26 (all X18 (legal(X18) -> arboreal(X18))) # label(sos_08) # label(axiom) # label(non_clause).  [assumption].
3.52/3.88	27 (all X21 all X22 (precedes(X21,X22) <-> legal(X22) & earlier(X21,X22))) # label(sos_10) # label(axiom) # label(non_clause).  [assumption].
3.52/3.88	29 (all X7 (activity(X7) -> subactivity(X7,X7))) # label(sos_03) # label(axiom) # label(non_clause).  [assumption].
3.52/3.88	31 (all X2 (activity_occurrence(X2) -> (exists X3 (activity(X3) & occurrence_of(X2,X3))))) # label(sos_01) # label(axiom) # label(non_clause).  [assumption].
3.52/3.88	33 (all X67 all X68 (subactivity_occurrence(X67,X68) -> activity_occurrence(X68) & activity_occurrence(X67))) # label(sos_24) # label(axiom) # label(non_clause).  [assumption].
3.52/3.88	35 (all X4 all X5 all X6 (occurrence_of(X4,X6) & occurrence_of(X4,X5) -> X6 = X5)) # label(sos_02) # label(axiom) # label(non_clause).  [assumption].
3.52/3.88	37 -(all X109 (occurrence_of(X109,tptp0) -> (exists X110 exists X111 (root_occ(X110,X109) & (occurrence_of(X111,tptp1) | occurrence_of(X111,tptp2)) & min_precedes(X110,X111,tptp0) & leaf_occ(X111,X109) & occurrence_of(X110,tptp3))))) # label(goals) # label(negated_conjecture) # label(non_clause).  [assumption].
3.52/3.88	38 -activity(A) | subactivity(A,A) # label(sos_03) # label(axiom).  [clausify(29)].
3.52/3.88	40 -occurrence_of(A,B) | activity(B) # label(sos) # label(axiom).  [clausify(10)].
3.52/3.88	42 -root_occ(A,B) | root(A,f8(A,B)) # label(sos_33) # label(axiom).  [clausify(15)].
3.52/3.88	43 -min_precedes(A,B,C) | -root(B,C) # label(sos_14) # label(axiom).  [clausify(3)].
3.52/3.88	70 -occurrence_of(A,tptp0) | next_subocc(f14(A),f15(A),tptp0) # label(sos_35) # label(axiom).  [clausify(23)].
3.52/3.88	72 -next_subocc(A,B,C) | min_precedes(A,B,C) # label(sos_22) # label(axiom).  [clausify(20)].
3.52/3.88	76 -activity_occurrence(A) | occurrence_of(A,f17(A)) # label(sos_01) # label(axiom).  [clausify(31)].
3.52/3.88	77 -occurrence_of(A,B) | activity_occurrence(A) # label(sos) # label(axiom).  [clausify(10)].
3.52/3.88	79 -subactivity_occurrence(A,B) | activity_occurrence(A) # label(sos_24) # label(axiom).  [clausify(33)].
3.52/3.88	81 -min_precedes(A,B,C) | precedes(A,B) # label(sos_15) # label(axiom).  [clausify(19)].
3.52/3.88	82 -precedes(A,B) | legal(B) # label(sos_10) # label(axiom).  [clausify(27)].
3.52/3.88	87 atocc(A,B) | -subactivity(B,C) | -occurrence_of(A,C) | -atomic(C) # label(sos_23) # label(axiom).  [clausify(5)].
3.52/3.88	95 subactivity(A,A) | -occurrence_of(B,A).  [resolve(38,a,40,b)].
3.52/3.88	108 atomic(tptp3) # label(sos_41) # label(axiom).  [assumption].
3.52/3.88	109 atomic(tptp2) # label(sos_39) # label(axiom).  [assumption].
3.52/3.88	112 occurrence_of(c1,tptp0) # label(goals) # label(negated_conjecture).  [clausify(37)].
3.52/3.88	118 tptp3 != tptp1 # label(sos_46) # label(axiom).  [assumption].
3.52/3.88	119 tptp2 != tptp3 # label(sos_45) # label(axiom).  [assumption].
3.52/3.88	120 tptp3 != tptp2.  [copy(119),flip(a)].
3.52/3.88	125 -root_occ(A,c1) | -occurrence_of(B,tptp1) | -min_precedes(A,B,tptp0) | -leaf_occ(B,c1) | -occurrence_of(A,tptp3) # label(goals) # label(negated_conjecture).  [clausify(37)].
3.52/3.88	126 -root_occ(A,c1) | -occurrence_of(B,tptp2) | -min_precedes(A,B,tptp0) | -leaf_occ(B,c1) | -occurrence_of(A,tptp3) # label(goals) # label(negated_conjecture).  [clausify(37)].
3.52/3.88	127 -legal(A) | arboreal(A) # label(sos_08) # label(axiom).  [clausify(26)].
3.52/3.88	128 -leaf_occ(A,B) | subactivity_occurrence(A,B) # label(sos_34) # label(axiom).  [clausify(7)].
3.52/3.88	129 -root_occ(A,B) | subactivity_occurrence(A,B) # label(sos_33) # label(axiom).  [clausify(15)].
3.52/3.88	130 -atocc(A,B) | atomic(f4(A,B)) # label(sos_23) # label(axiom).  [clausify(5)].
3.52/3.88	131 -occurrence_of(A,B) | -atomic(B) | arboreal(A) # label(sos_07) # label(axiom).  [clausify(6)].
3.52/3.88	132 -occurrence_of(A,B) | atomic(B) | -arboreal(A) # label(sos_07) # label(axiom).  [clausify(6)].
3.52/3.88	133 -occurrence_of(A,tptp0) | occurrence_of(f13(A),tptp3) # label(sos_35) # label(axiom).  [clausify(23)].
3.52/3.88	135 -occurrence_of(A,tptp0) | leaf_occ(f15(A),A) # label(sos_35) # label(axiom).  [clausify(23)].
3.52/3.88	136 -occurrence_of(A,tptp0) | root_occ(f13(A),A) # label(sos_35) # label(axiom).  [clausify(23)].
3.52/3.88	138 -atocc(A,B) | occurrence_of(A,f4(A,B)) # label(sos_23) # label(axiom).  [clausify(5)].
3.52/3.88	140 -root_occ(A,B) | occurrence_of(B,f8(A,B)) # label(sos_33) # label(axiom).  [clausify(15)].
3.52/3.88	143 -occurrence_of(A,B) | -occurrence_of(A,C) | B = C # label(sos_02) # label(axiom).  [clausify(35)].
3.52/3.88	150 -occurrence_of(A,tptp0) | occurrence_of(f15(A),tptp2) | occurrence_of(f15(A),tptp1) # label(sos_35) # label(axiom).  [clausify(23)].
3.52/3.88	154 -occurrence_of(A,B) | -arboreal(C) | -arboreal(D) | -subactivity_occurrence(D,A) | -subactivity_occurrence(C,A) | min_precedes(C,D,B) | min_precedes(D,C,B) | D = C # label(sos_28) # label(axiom).  [clausify(12)].
3.52/3.88	155 -root_occ(A,B) | -min_precedes(C,A,f8(A,B)).  [resolve(42,b,43,b)].
3.52/3.88	202 -occurrence_of(A,tptp0) | min_precedes(f14(A),f15(A),tptp0).  [resolve(70,b,72,a)].
3.52/3.88	207 occurrence_of(A,f17(A)) | -occurrence_of(A,B).  [resolve(76,a,77,b)].
3.52/3.88	209 occurrence_of(A,f17(A)) | -subactivity_occurrence(A,B).  [resolve(76,a,79,b)].
3.52/3.88	210 -min_precedes(A,B,C) | legal(B).  [resolve(81,b,82,a)].
3.52/3.88	228 -occurrence_of(A,B) | atocc(C,B) | -occurrence_of(C,B) | -atomic(B).  [resolve(95,a,87,b)].
3.52/3.88	265 -occurrence_of(A,B) | atocc(A,B) | -atomic(B).  [factor(228,a,c)].
3.52/3.88	274 occurrence_of(f13(c1),tptp3).  [resolve(133,a,112,a)].
3.52/3.88	276 leaf_occ(f15(c1),c1).  [resolve(135,a,112,a)].
3.52/3.88	277 root_occ(f13(c1),c1).  [resolve(136,a,112,a)].
3.52/3.88	278 -occurrence_of(c1,A) | tptp0 = A.  [resolve(143,a,112,a)].
3.52/3.88	280 occurrence_of(f15(c1),tptp2) | occurrence_of(f15(c1),tptp1).  [resolve(150,a,112,a)].
3.52/3.88	285 min_precedes(f14(c1),f15(c1),tptp0).  [resolve(202,a,112,a)].
3.52/3.88	296 occurrence_of(f13(c1),f17(f13(c1))).  [resolve(274,a,207,b)].
3.52/3.88	297 -occurrence_of(f13(c1),A) | tptp3 = A.  [resolve(274,a,143,b),flip(b)].
3.52/3.88	298 arboreal(f13(c1)).  [resolve(274,a,131,a),unit_del(a,108)].
3.52/3.88	316 subactivity_occurrence(f15(c1),c1).  [resolve(276,a,128,a)].
3.52/3.88	326 occurrence_of(c1,f8(f13(c1),c1)).  [resolve(277,a,140,a)].
3.52/3.88	327 subactivity_occurrence(f13(c1),c1).  [resolve(277,a,129,a)].
3.52/3.88	380 occurrence_of(f15(c1),f17(f15(c1))).  [resolve(316,a,209,b)].
3.52/3.88	392 -occurrence_of(c1,A) | -arboreal(B) | -subactivity_occurrence(B,c1) | min_precedes(f13(c1),B,A) | min_precedes(B,f13(c1),A) | f13(c1) = B.  [resolve(327,a,154,e),flip(g),unit_del(b,298)].
3.52/3.88	412 occurrence_of(f15(c1),tptp1) | atocc(f15(c1),tptp2).  [resolve(280,a,265,a),unit_del(c,109)].
3.52/3.88	448 legal(f15(c1)).  [resolve(285,a,210,a)].
3.52/3.88	480 arboreal(f15(c1)).  [resolve(448,a,127,a)].
3.52/3.88	628 f8(f13(c1),c1) = tptp0.  [resolve(326,a,278,a),flip(a)].
3.52/3.88	639 atocc(f15(c1),f17(f15(c1))) | -atomic(f17(f15(c1))).  [resolve(380,a,265,a)].
3.52/3.88	646 -occurrence_of(f15(c1),A) | f17(f15(c1)) = A.  [resolve(380,a,143,b),flip(b)].
3.52/3.88	647 atomic(f17(f15(c1))).  [resolve(380,a,132,a),unit_del(b,480)].
3.52/3.88	648 atocc(f15(c1),f17(f15(c1))).  [back_unit_del(639),unit_del(b,647)].
3.52/3.88	678 -min_precedes(A,f13(c1),tptp0).  [para(628(a,1),155(b,3)),unit_del(a,277)].
3.52/3.88	715 f17(f13(c1)) = tptp3.  [resolve(297,a,296,a),flip(a)].
3.52/3.88	882 occurrence_of(f15(c1),tptp1) | atomic(f4(f15(c1),tptp2)).  [resolve(412,b,130,a)].
3.52/3.88	1206 f17(f15(c1)) = tptp2 | occurrence_of(f15(c1),tptp1).  [resolve(646,a,280,a)].
3.52/3.88	1232 atomic(f4(f15(c1),tptp2)) | f17(f15(c1)) = tptp1.  [resolve(882,a,646,a)].
3.52/3.88	1323 f17(f15(c1)) = tptp2 | f17(f15(c1)) = tptp1.  [resolve(1206,b,646,a)].
3.52/3.88	1600 -occurrence_of(c1,A) | min_precedes(f13(c1),f15(c1),A) | min_precedes(f15(c1),f13(c1),A) | f15(c1) = f13(c1).  [resolve(392,c,316,a),flip(e),unit_del(b,480)].
3.52/3.88	1899 f17(f15(c1)) = tptp1 | occurrence_of(f15(c1),tptp2).  [para(1323(a,1),380(a,2))].
3.52/3.88	1900 f17(f15(c1)) = tptp1 | atocc(f15(c1),tptp2).  [para(1323(a,1),648(a,2))].
3.52/3.88	1916 f17(f15(c1)) = tptp1 | -occurrence_of(f15(c1),A) | tptp2 = A.  [resolve(1899,b,143,b),flip(c)].
3.52/3.88	1942 f17(f15(c1)) = tptp1 | occurrence_of(f15(c1),f4(f15(c1),tptp2)).  [resolve(1900,b,138,a)].
3.52/3.88	3790 f17(f15(c1)) = tptp1 | atocc(f15(c1),f4(f15(c1),tptp2)) | -atomic(f4(f15(c1),tptp2)).  [resolve(1942,b,265,a)].
3.52/3.88	12982 f17(f15(c1)) = tptp1 | atocc(f15(c1),f4(f15(c1),tptp2)).  [resolve(3790,c,1232,a),merge(c)].
3.52/3.88	12988 f17(f15(c1)) = tptp1 | occurrence_of(f15(c1),f4(f15(c1),f4(f15(c1),tptp2))).  [resolve(12982,b,138,a)].
3.52/3.88	12999 f17(f15(c1)) = tptp1 | f4(f15(c1),f4(f15(c1),tptp2)) = tptp2.  [resolve(12988,b,1916,b),flip(c),merge(b)].
3.52/3.88	13002 f17(f15(c1)) = tptp1 | f4(f15(c1),f4(f15(c1),tptp2)) = f17(f15(c1)).  [resolve(12988,b,646,a),flip(b)].
3.52/3.88	14762 min_precedes(f13(c1),f15(c1),tptp0) | f15(c1) = f13(c1).  [resolve(1600,a,112,a),unit_del(b,678)].
3.52/3.88	14793 f15(c1) = f13(c1) | -occurrence_of(f15(c1),tptp2).  [resolve(14762,a,126,c),unit_del(b,277),unit_del(d,276),unit_del(e,274)].
3.52/3.88	14794 f15(c1) = f13(c1) | -occurrence_of(f15(c1),tptp1).  [resolve(14762,a,125,c),unit_del(b,277),unit_del(d,276),unit_del(e,274)].
3.52/3.88	14796 f15(c1) = f13(c1) | occurrence_of(f15(c1),tptp1).  [resolve(14793,b,280,a)].
3.52/3.88	14807 f15(c1) = f13(c1).  [resolve(14796,b,14794,b),merge(b)].
3.52/3.88	15379 f4(f13(c1),f4(f13(c1),tptp2)) = tptp3.  [back_rewrite(13002),rewrite([14807(2),715(3),14807(5),14807(7),14807(12),715(13)]),unit_del(a,118)].
3.52/3.88	15380 $F.  [back_rewrite(12999),rewrite([14807(2),715(3),14807(5),14807(7),15379(10)]),unit_del(a,118),unit_del(b,120)].
3.52/3.88	
3.52/3.88	% SZS output end Refutation
3.52/3.88	============================== end of proof ==========================
3.52/3.88	
3.52/3.88	============================== STATISTICS ============================
3.52/3.88	
3.52/3.88	Given=3230. Generated=63780. Kept=15265. proofs=1.
3.52/3.88	Usable=2790. Sos=8413. Demods=106. Limbo=573, Disabled=3711. Hints=0.
3.52/3.88	Megabytes=26.29.
3.52/3.88	User_CPU=2.77, System_CPU=0.06, Wall_clock=3.
3.52/3.88	
3.52/3.88	============================== end of statistics =====================
3.52/3.88	
3.52/3.88	============================== end of search =========================
3.52/3.88	
3.52/3.88	THEOREM PROVED
3.52/3.88	% SZS status Theorem
3.52/3.88	
3.52/3.88	Exiting with 1 proof.
3.52/3.88	
3.52/3.88	Process 17840 exit (max_proofs) Tue Aug  9 03:03:31 2022
3.52/3.88	Prover9 interrupted
3.63/3.88	EOF