0.13/0.12	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.13/0.13	% Command  : tptp2X_and_run_prover9 %d %s
0.13/0.33	% Computer : n017.cluster.edu
0.13/0.33	% Model    : x86_64 x86_64
0.13/0.33	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.33	% Memory   : 8042.1875MB
0.13/0.33	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.33	% CPULimit : 1440
0.13/0.33	% WCLimit  : 180
0.13/0.33	% DateTime : Mon Jul  3 05:57:38 EDT 2023
0.13/0.33	% CPUTime  : 
0.75/1.02	============================== Prover9 ===============================
0.75/1.02	Prover9 (32) version 2009-11A, November 2009.
0.75/1.02	Process 28422 was started by sandbox on n017.cluster.edu,
0.75/1.02	Mon Jul  3 05:57:39 2023
0.75/1.02	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1440 -f /tmp/Prover9_28000_n017.cluster.edu".
0.75/1.02	============================== end of head ===========================
0.75/1.02	
0.75/1.02	============================== INPUT =================================
0.75/1.02	
0.75/1.02	% Reading from file /tmp/Prover9_28000_n017.cluster.edu
0.75/1.02	
0.75/1.02	set(prolog_style_variables).
0.75/1.02	set(auto2).
0.75/1.02	    % set(auto2) -> set(auto).
0.75/1.02	    % set(auto) -> set(auto_inference).
0.75/1.02	    % set(auto) -> set(auto_setup).
0.75/1.02	    % set(auto_setup) -> set(predicate_elim).
0.75/1.02	    % set(auto_setup) -> assign(eq_defs, unfold).
0.75/1.02	    % set(auto) -> set(auto_limits).
0.75/1.02	    % set(auto_limits) -> assign(max_weight, "100.000").
0.75/1.02	    % set(auto_limits) -> assign(sos_limit, 20000).
0.75/1.02	    % set(auto) -> set(auto_denials).
0.75/1.02	    % set(auto) -> set(auto_process).
0.75/1.02	    % set(auto2) -> assign(new_constants, 1).
0.75/1.02	    % set(auto2) -> assign(fold_denial_max, 3).
0.75/1.02	    % set(auto2) -> assign(max_weight, "200.000").
0.75/1.02	    % set(auto2) -> assign(max_hours, 1).
0.75/1.02	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.75/1.02	    % set(auto2) -> assign(max_seconds, 0).
0.75/1.02	    % set(auto2) -> assign(max_minutes, 5).
0.75/1.02	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.75/1.02	    % set(auto2) -> set(sort_initial_sos).
0.75/1.02	    % set(auto2) -> assign(sos_limit, -1).
0.75/1.02	    % set(auto2) -> assign(lrs_ticks, 3000).
0.75/1.02	    % set(auto2) -> assign(max_megs, 400).
0.75/1.02	    % set(auto2) -> assign(stats, some).
0.75/1.02	    % set(auto2) -> clear(echo_input).
0.75/1.02	    % set(auto2) -> set(quiet).
0.75/1.02	    % set(auto2) -> clear(print_initial_clauses).
0.75/1.02	    % set(auto2) -> clear(print_given).
0.75/1.02	assign(lrs_ticks,-1).
0.75/1.02	assign(sos_limit,10000).
0.75/1.02	assign(order,kbo).
0.75/1.02	set(lex_order_vars).
0.75/1.02	clear(print_given).
0.75/1.02	
0.75/1.02	% formulas(sos).  % not echoed (49 formulas)
0.75/1.02	
0.75/1.02	============================== end of input ==========================
0.75/1.02	
0.75/1.02	% From the command line: assign(max_seconds, 1440).
0.75/1.02	
0.75/1.02	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.75/1.02	
0.75/1.02	% Formulas that are not ordinary clauses:
0.75/1.02	1 (all X8 all X9 all X10 all X11 (subactivity_occurrence(X10,X9) & -min_precedes(X10,X11,X8) & arboreal(X10) & leaf_occ(X11,X9) & occurrence_of(X9,X8) -> X10 = X11)) # label(sos_02) # label(axiom) # label(non_clause).  [assumption].
0.75/1.02	2 (all X28 all X29 all X30 (occurrence_of(X28,X30) & occurrence_of(X28,X29) -> X30 = X29)) # label(sos_08) # label(axiom) # label(non_clause).  [assumption].
0.75/1.02	3 (all X12 all X13 (occurrence_of(X13,X12) -> activity(X12) & activity_occurrence(X13))) # label(sos_03) # label(axiom) # label(non_clause).  [assumption].
0.75/1.02	4 (all X75 all X76 all X77 (next_subocc(X75,X76,X77) -> arboreal(X75) & arboreal(X76))) # label(sos_25) # label(axiom) # label(non_clause).  [assumption].
0.75/1.02	5 (all X65 all X66 all X67 (min_precedes(X65,X66,X67) -> -root(X66,X67))) # label(sos_22) # label(axiom) # label(non_clause).  [assumption].
0.75/1.02	6 (all X31 all X32 all X33 (leaf_occ(X32,X31) & occurrence_of(X31,X33) -> -(exists X34 min_precedes(X32,X34,X33)))) # label(sos_09) # label(axiom) # label(non_clause).  [assumption].
0.75/1.02	7 (all X86 all X87 all X88 all X89 (occurrence_of(X88,X89) & -atomic(X89) & leaf_occ(X86,X88) & leaf_occ(X87,X88) -> X87 = X86)) # label(sos_28) # label(axiom) # label(non_clause).  [assumption].
0.75/1.02	8 (all X108 all X109 (occurrence_of(X109,tptp0) & subactivity_occurrence(X108,X109) & -leaf_occ(X108,X109) & arboreal(X108) -> (exists X110 (next_subocc(X108,X110,tptp0) & occurrence_of(X110,tptp1))))) # label(sos_47) # label(axiom) # label(non_clause).  [assumption].
0.75/1.02	9 (all X53 all X54 (root(X53,X54) -> legal(X53))) # label(sos_17) # label(axiom) # label(non_clause).  [assumption].
0.75/1.02	10 (all X68 all X69 all X70 (min_precedes(X68,X69,X70) -> (exists X71 (min_precedes(X71,X69,X70) & root(X71,X70))))) # label(sos_23) # label(axiom) # label(non_clause).  [assumption].
0.75/1.02	11 (all X94 all X95 all X96 (earlier(X94,X95) & earlier(X95,X96) -> earlier(X94,X96))) # label(sos_30) # label(axiom) # label(non_clause).  [assumption].
0.75/1.02	12 (all X61 all X62 (earlier(X61,X62) -> -earlier(X62,X61))) # label(sos_20) # label(axiom) # label(non_clause).  [assumption].
0.75/1.02	13 (all X43 (legal(X43) -> arboreal(X43))) # label(sos_13) # label(axiom) # label(non_clause).  [assumption].
0.75/1.02	14 (all X82 all X83 all X84 all X85 (subactivity_occurrence(X83,X85) & occurrence_of(X85,X84) & min_precedes(X82,X83,X84) -> subactivity_occurrence(X82,X85))) # label(sos_27) # label(axiom) # label(non_clause).  [assumption].
0.75/1.02	15 (all X101 (occurrence_of(X101,tptp0) -> (exists X102 exists X103 (root_occ(X102,X101) & next_subocc(X102,X103,tptp0) & leaf_occ(X103,X101) & occurrence_of(X103,tptp3) & occurrence_of(X102,tptp4))))) # label(sos_32) # label(axiom) # label(non_clause).  [assumption].
0.75/1.02	16 (all X3 all X4 all X5 all X6 all X7 (occurrence_of(X4,X3) & leaf_occ(X7,X4) & subactivity_occurrence(X5,X4) & min_precedes(X6,X5,X3) & X5 != X7 & root_occ(X6,X4) -> min_precedes(X5,X7,X3))) # label(sos_01) # label(axiom) # label(non_clause).  [assumption].
0.75/1.02	17 (all X35 all X36 all X37 (root_occ(X36,X35) & occurrence_of(X35,X37) -> -(exists X38 min_precedes(X38,X36,X37)))) # label(sos_10) # label(axiom) # label(non_clause).  [assumption].
0.75/1.02	18 (all X51 all X52 (occurrence_of(X51,X52) -> (atomic(X52) <-> arboreal(X51)))) # label(sos_16) # label(axiom) # label(non_clause).  [assumption].
0.75/1.02	19 (all X106 all X107 (subactivity_occurrence(X106,X107) & arboreal(X106) & -leaf_occ(X106,X107) & occurrence_of(X107,tptp0) -> root_occ(X106,X107))) # label(sos_46) # label(axiom) # label(non_clause).  [assumption].
0.75/1.02	20 (all X41 (activity_occurrence(X41) -> (exists X42 (occurrence_of(X41,X42) & activity(X42))))) # label(sos_12) # label(axiom) # label(non_clause).  [assumption].
0.75/1.02	21 (all X78 all X79 all X80 (next_subocc(X78,X79,X80) <-> -(exists X81 (min_precedes(X78,X81,X80) & min_precedes(X81,X79,X80))) & min_precedes(X78,X79,X80))) # label(sos_26) # label(axiom) # label(non_clause).  [assumption].
0.75/1.02	22 (all X72 all X73 all X74 (min_precedes(X72,X73,X74) -> precedes(X72,X73))) # label(sos_24) # label(axiom) # label(non_clause).  [assumption].
0.75/1.02	23 (all X14 all X15 all X16 all X17 (subactivity_occurrence(X16,X15) & subactivity_occurrence(X17,X15) & arboreal(X17) & arboreal(X16) & occurrence_of(X15,X14) -> min_precedes(X17,X16,X14) | X16 = X17 | min_precedes(X16,X17,X14))) # label(sos_04) # label(axiom) # label(non_clause).  [assumption].
0.75/1.02	24 (all X18 all X19 (root(X19,X18) -> (exists X20 (subactivity(X20,X18) & atocc(X19,X20))))) # label(sos_05) # label(axiom) # label(non_clause).  [assumption].
0.75/1.02	25 (all X97 all X98 all X99 all X100 (min_precedes(X97,X98,X100) & min_precedes(X97,X99,X100) & precedes(X98,X99) -> min_precedes(X98,X99,X100))) # label(sos_31) # label(axiom) # label(non_clause).  [assumption].
0.75/1.02	26 (all X63 all X64 (legal(X64) & earlier(X63,X64) <-> precedes(X63,X64))) # label(sos_21) # label(axiom) # label(non_clause).  [assumption].
0.75/1.02	27 (all X25 all X26 (leaf(X25,X26) & -atomic(X26) -> (exists X27 (occurrence_of(X27,X26) & leaf_occ(X25,X27))))) # label(sos_07) # label(axiom) # label(non_clause).  [assumption].
0.75/1.02	28 (all X58 all X59 (root_occ(X58,X59) <-> (exists X60 (occurrence_of(X59,X60) & root(X58,X60) & subactivity_occurrence(X58,X59))))) # label(sos_19) # label(axiom) # label(non_clause).  [assumption].
0.75/1.02	29 (all X44 all X45 ((exists X46 (atomic(X46) & occurrence_of(X44,X46) & subactivity(X45,X46))) <-> atocc(X44,X45))) # label(sos_14) # label(axiom) # label(non_clause).  [assumption].
0.75/1.02	30 (all X90 all X91 all X92 all X93 (root_occ(X90,X92) & root_occ(X91,X92) & occurrence_of(X92,X93) -> X91 = X90)) # label(sos_29) # label(axiom) # label(non_clause).  [assumption].
0.75/1.02	31 (all X21 all X22 all X23 (min_precedes(X22,X23,X21) -> (exists X24 (subactivity_occurrence(X22,X24) & subactivity_occurrence(X23,X24) & occurrence_of(X24,X21))))) # label(sos_06) # label(axiom) # label(non_clause).  [assumption].
0.75/1.02	32 (all X39 all X40 (subactivity_occurrence(X39,X40) -> activity_occurrence(X39) & activity_occurrence(X40))) # label(sos_11) # label(axiom) # label(non_clause).  [assumption].
0.75/1.02	33 (all X47 all X48 ((root(X47,X48) | (exists X49 min_precedes(X49,X47,X48))) & -(exists X50 min_precedes(X47,X50,X48)) <-> leaf(X47,X48))) # label(sos_15) # label(axiom) # label(non_clause).  [assumption].
0.75/1.02	34 (all X55 all X56 ((exists X57 (occurrence_of(X56,X57) & subactivity_occurrence(X55,X56) & leaf(X55,X57))) <-> leaf_occ(X55,X56))) # label(sos_18) # label(axiom) # label(non_clause).  [assumption].
0.75/1.02	35 (all X0 all X1 (-atomic(X0) & occurrence_of(X1,X0) -> (exists X2 (root(X2,X0) & subactivity_occurrence(X2,X1))))) # label(sos) # label(axiom) # label(non_clause).  [assumption].
0.75/1.02	36 (all X104 all X105 (-leaf_occ(X104,X105) & arboreal(X104) & subactivity_occurrence(X104,X105) & occurrence_of(X105,tptp0) -> root_occ(X104,X105))) # label(sos_45) # label(axiom) # label(non_clause).  [assumption].
0.75/1.02	37 --(exists X111 occurrence_of(X111,tptp0)) # label(goals) # label(negated_conjecture) # label(non_clause).  [assumption].
0.75/1.02	
0.75/1.02	============================== end of process non-clausal formulas ===
0.75/1.02	
0.75/1.02	============================== PROCESS INITIAL CLAUSES ===============
0.75/1.02	
0.75/1.02	============================== PREDICATE ELIMINATION =================
0.75/1.02	38 -root_occ(A,B) | root(A,f9(A,B)) # label(sos_19) # label(axiom).  [clausify(28)].
0.75/1.02	39 -min_precedes(A,B,C) | -root(B,C) # label(sos_22) # label(axiom).  [clausify(5)].
0.75/1.02	40 -root(A,B) | legal(A) # label(sos_17) # label(axiom).  [clausify(9)].
0.75/1.02	41 -root(A,B) | subactivity(f7(B,A),B) # label(sos_05) # label(axiom).  [clausify(24)].
0.75/1.02	42 -root(A,B) | atocc(A,f7(B,A)) # label(sos_05) # label(axiom).  [clausify(24)].
0.75/1.02	Derived: -root_occ(A,B) | -min_precedes(C,A,f9(A,B)).  [resolve(38,b,39,b)].
0.75/1.02	Derived: -root_occ(A,B) | legal(A).  [resolve(38,b,40,a)].
0.75/1.02	Derived: -root_occ(A,B) | subactivity(f7(f9(A,B),A),f9(A,B)).  [resolve(38,b,41,a)].
0.75/1.02	Derived: -root_occ(A,B) | atocc(A,f7(f9(A,B),A)).  [resolve(38,b,42,a)].
0.75/1.02	43 -min_precedes(A,B,C) | root(f2(A,B,C),C) # label(sos_23) # label(axiom).  [clausify(10)].
0.75/1.02	Derived: -min_precedes(A,B,C) | -min_precedes(D,f2(A,B,C),C).  [resolve(43,b,39,b)].
0.75/1.02	Derived: -min_precedes(A,B,C) | legal(f2(A,B,C)).  [resolve(43,b,40,a)].
0.75/1.02	Derived: -min_precedes(A,B,C) | subactivity(f7(C,f2(A,B,C)),C).  [resolve(43,b,41,a)].
0.75/1.02	Derived: -min_precedes(A,B,C) | atocc(f2(A,B,C),f7(C,f2(A,B,C))).  [resolve(43,b,42,a)].
0.75/1.02	44 atomic(A) | -occurrence_of(B,A) | root(f15(A,B),A) # label(sos) # label(axiom).  [clausify(35)].
0.75/1.02	Derived: atomic(A) | -occurrence_of(B,A) | -min_precedes(C,f15(A,B),A).  [resolve(44,c,39,b)].
0.75/1.02	Derived: atomic(A) | -occurrence_of(B,A) | legal(f15(A,B)).  [resolve(44,c,40,a)].
0.75/1.02	Derived: atomic(A) | -occurrence_of(B,A) | subactivity(f7(A,f15(A,B)),A).  [resolve(44,c,41,a)].
0.75/1.02	Derived: atomic(A) | -occurrence_of(B,A) | atocc(f15(A,B),f7(A,f15(A,B))).  [resolve(44,c,42,a)].
0.75/1.02	45 root_occ(A,B) | -occurrence_of(B,C) | -root(A,C) | -subactivity_occurrence(A,B) # label(sos_19) # label(axiom).  [clausify(28)].
0.75/1.02	Derived: root_occ(A,B) | -occurrence_of(B,f9(A,C)) | -subactivity_occurrence(A,B) | -root_occ(A,C).  [resolve(45,c,38,b)].
0.75/1.02	Derived: root_occ(f2(A,B,C),D) | -occurrence_of(D,C) | -subactivity_occurrence(f2(A,B,C),D) | -min_precedes(A,B,C).  [resolve(45,c,43,b)].
0.75/1.02	Derived: root_occ(f15(A,B),C) | -occurrence_of(C,A) | -subactivity_occurrence(f15(A,B),C) | atomic(A) | -occurrence_of(B,A).  [resolve(45,c,44,c)].
0.75/1.02	46 -root(A,B) | min_precedes(A,f12(A,B),B) | leaf(A,B) # label(sos_15) # label(axiom).  [clausify(33)].
0.75/1.02	Derived: min_precedes(A,f12(A,f9(A,B)),f9(A,B)) | leaf(A,f9(A,B)) | -root_occ(A,B).  [resolve(46,a,38,b)].
0.75/1.02	Derived: min_precedes(f2(A,B,C),f12(f2(A,B,C),C),C) | leaf(f2(A,B,C),C) | -min_precedes(A,B,C).  [resolve(46,a,43,b)].
0.75/1.02	Derived: min_precedes(f15(A,B),f12(f15(A,B),A),A) | leaf(f15(A,B),A) | atomic(A) | -occurrence_of(B,A).  [resolve(46,a,44,c)].
0.75/1.02	47 root(A,B) | min_precedes(f13(A,B),A,B) | -leaf(A,B) # label(sos_15) # label(axiom).  [clausify(33)].
0.75/1.02	Derived: min_precedes(f13(A,B),A,B) | -leaf(A,B) | -min_precedes(C,A,B).  [resolve(47,a,39,b)].
0.75/1.02	Derived: min_precedes(f13(A,B),A,B) | -leaf(A,B) | legal(A).  [resolve(47,a,40,a)].
0.75/1.02	Derived: min_precedes(f13(A,B),A,B) | -leaf(A,B) | subactivity(f7(B,A),B).  [resolve(47,a,41,a)].
0.75/1.02	Derived: min_precedes(f13(A,B),A,B) | -leaf(A,B) | atocc(A,f7(B,A)).  [resolve(47,a,42,a)].
0.75/1.02	Derived: min_precedes(f13(A,B),A,B) | -leaf(A,B) | root_occ(A,C) | -occurrence_of(C,B) | -subactivity_occurrence(A,C).  [resolve(47,a,45,c)].
0.75/1.02	48 leaf(A,f14(A,B)) | -leaf_occ(A,B) # label(sos_18) # label(axiom).  [clausify(34)].
0.75/1.02	49 -min_precedes(A,B,C) | -leaf(A,C) # label(sos_15) # label(axiom).  [clausify(33)].
0.75/1.02	Derived: -leaf_occ(A,B) | -min_precedes(A,C,f14(A,B)).  [resolve(48,a,49,b)].
0.75/1.02	50 -leaf(A,B) | atomic(B) | occurrence_of(f8(A,B),B) # label(sos_07) # label(axiom).  [clausify(27)].
0.75/1.02	Derived: atomic(f14(A,B)) | occurrence_of(f8(A,f14(A,B)),f14(A,B)) | -leaf_occ(A,B).  [resolve(50,a,48,a)].
0.75/1.02	51 -leaf(A,B) | atomic(B) | leaf_occ(A,f8(A,B)) # label(sos_07) # label(axiom).  [clausify(27)].
0.75/1.02	Derived: atomic(f14(A,B)) | leaf_occ(A,f8(A,f14(A,B))) | -leaf_occ(A,B).  [resolve(51,a,48,a)].
0.75/1.02	52 -occurrence_of(A,B) | -subactivity_occurrence(C,A) | -leaf(C,B) | leaf_occ(C,A) # label(sos_18) # label(axiom).  [clausify(34)].
0.75/1.02	Derived: -occurrence_of(A,f14(B,C)) | -subactivity_occurrence(B,A) | leaf_occ(B,A) | -leaf_occ(B,C).  [resolve(52,c,48,a)].
0.75/1.02	53 -min_precedes(A,B,C) | min_precedes(B,f12(B,C),C) | leaf(B,C) # label(sos_15) # label(axiom).  [clausify(33)].
0.75/1.02	Derived: -min_precedes(A,B,C) | min_precedes(B,f12(B,C),C) | -min_precedes(B,D,C).  [resolve(53,c,49,b)].
0.75/1.02	Derived: -min_precedes(A,B,C) | min_precedes(B,f12(B,C),C) | atomic(C) | occurrence_of(f8(B,C),C).  [resolve(53,c,50,a)].
0.75/1.02	Derived: -min_precedes(A,B,C) | min_precedes(B,f12(B,C),C) | atomic(C) | leaf_occ(B,f8(B,C)).  [resolve(53,c,51,a)].
0.75/1.02	Derived: -min_precedes(A,B,C) | min_precedes(B,f12(B,C),C) | -occurrence_of(D,C) | -subactivity_occurrence(B,D) | leaf_occ(B,D).  [resolve(53,c,52,c)].
0.75/1.02	54 min_precedes(A,f12(A,f9(A,B)),f9(A,B)) | leaf(A,f9(A,B)) | -root_occ(A,B).  [resolve(46,a,38,b)].
0.75/1.02	Derived: min_precedes(A,f12(A,f9(A,B)),f9(A,B)) | -root_occ(A,B) | -min_precedes(A,C,f9(A,B)).  [resolve(54,b,49,b)].
0.75/1.02	Derived: min_precedes(A,f12(A,f9(A,B)),f9(A,B)) | -root_occ(A,B) | atomic(f9(A,B)) | occurrence_of(f8(A,f9(A,B)),f9(A,B)).  [resolve(54,b,50,a)].
0.75/1.02	Derived: min_precedes(A,f12(A,f9(A,B)),f9(A,B)) | -root_occ(A,B) | atomic(f9(A,B)) | leaf_occ(A,f8(A,f9(A,B))).  [resolve(54,b,51,a)].
0.75/1.02	Derived: min_precedes(A,f12(A,f9(A,B)),f9(A,B)) | -root_occ(A,B) | -occurrence_of(C,f9(A,B)) | -subactivity_occurrence(A,C) | leaf_occ(A,C).  [resolve(54,b,52,c)].
0.75/1.02	55 min_precedes(f2(A,B,C),f12(f2(A,B,C),C),C) | leaf(f2(A,B,C),C) | -min_precedes(A,B,C).  [resolve(46,a,43,b)].
0.75/1.02	Derived: min_precedes(f2(A,B,C),f12(f2(A,B,C),C),C) | -min_precedes(A,B,C) | -min_precedes(f2(A,B,C),D,C).  [resolve(55,b,49,b)].
0.75/1.02	Derived: min_precedes(f2(A,B,C),f12(f2(A,B,C),C),C) | -min_precedes(A,B,C) | atomic(C) | occurrence_of(f8(f2(A,B,C),C),C).  [resolve(55,b,50,a)].
0.75/1.02	Derived: min_precedes(f2(A,B,C),f12(f2(A,B,C),C),C) | -min_precedes(A,B,C) | atomic(C) | leaf_occ(f2(A,B,C),f8(f2(A,B,C),C)).  [resolve(55,b,51,a)].
0.75/1.02	Derived: min_precedes(f2(A,B,C),f12(f2(A,B,C),C),C) | -min_precedes(A,B,C) | -occurrence_of(D,C) | -subactivity_occurrence(f2(A,B,C),D) | leaf_occ(f2(A,B,C),D).  [resolve(55,b,52,c)].
0.75/1.02	56 min_precedes(f15(A,B),f12(f15(A,B),A),A) | leaf(f15(A,B),A) | atomic(A) | -occurrence_of(B,A).  [resolve(46,a,44,c)].
0.75/1.02	Derived: min_precedes(f15(A,B),f12(f15(A,B),A),A) | atomic(A) | -occurrence_of(B,A) | -min_precedes(f15(A,B),C,A).  [resolve(56,b,49,b)].
0.75/1.02	Derived: min_precedes(f15(A,B),f12(f15(A,B),A),A) | atomic(A) | -occurrence_of(B,A) | atomic(A) | occurrence_of(f8(f15(A,B),A),A).  [resolve(56,b,50,a)].
0.75/1.02	Derived: min_precedes(f15(A,B),f12(f15(A,B),A),A) | atomic(A) | -occurrence_of(B,A) | atomic(A) | leaf_occ(f15(A,B),f8(f15(A,B),A)).  [resolve(56,b,51,a)].
0.75/1.02	Derived: min_precedes(f15(A,B),f12(f15(A,B),A),A) | atomic(A) | -occurrence_of(B,A) | -occurrence_of(C,A) | -subactivity_occurrence(f15(A,B),C) | leaf_occ(f15(A,B),C).  [resolve(56,b,52,c)].
0.75/1.02	57 min_precedes(f13(A,B),A,B) | -leaf(A,B) | -min_precedes(C,A,B).  [resolve(47,a,39,b)].
0.75/1.02	Derived: min_precedes(f13(A,f14(A,B)),A,f14(A,B)) | -min_precedes(C,A,f14(A,B)) | -leaf_occ(A,B).  [resolve(57,b,48,a)].
0.75/1.02	Derived: min_precedes(f13(A,B),A,B) | -min_precedes(C,A,B) | -min_precedes(D,A,B) | min_precedes(A,f12(A,B),B).  [resolve(57,b,53,c)].
0.75/1.03	58 min_precedes(f13(A,B),A,B) | -leaf(A,B) | legal(A).  [resolve(47,a,40,a)].
0.75/1.03	Derived: min_precedes(f13(A,f14(A,B)),A,f14(A,B)) | legal(A) | -leaf_occ(A,B).  [resolve(58,b,48,a)].
0.75/1.03	Derived: min_precedes(f13(A,f9(A,B)),A,f9(A,B)) | legal(A) | min_precedes(A,f12(A,f9(A,B)),f9(A,B)) | -root_occ(A,B).  [resolve(58,b,54,b)].
0.75/1.03	Derived: min_precedes(f13(f2(A,B,C),C),f2(A,B,C),C) | legal(f2(A,B,C)) | min_precedes(f2(A,B,C),f12(f2(A,B,C),C),C) | -min_precedes(A,B,C).  [resolve(58,b,55,b)].
0.75/1.03	Derived: min_precedes(f13(f15(A,B),A),f15(A,B),A) | legal(f15(A,B)) | min_precedes(f15(A,B),f12(f15(A,B),A),A) | atomic(A) | -occurrence_of(B,A).  [resolve(58,b,56,b)].
0.75/1.03	59 min_precedes(f13(A,B),A,B) | -leaf(A,B) | subactivity(f7(B,A),B).  [resolve(47,a,41,a)].
0.75/1.03	Derived: min_precedes(f13(A,f14(A,B)),A,f14(A,B)) | subactivity(f7(f14(A,B),A),f14(A,B)) | -leaf_occ(A,B).  [resolve(59,b,48,a)].
0.75/1.03	Derived: min_precedes(f13(A,f9(A,B)),A,f9(A,B)) | subactivity(f7(f9(A,B),A),f9(A,B)) | min_precedes(A,f12(A,f9(A,B)),f9(A,B)) | -root_occ(A,B).  [resolve(59,b,54,b)].
0.75/1.03	Derived: min_precedes(f13(f2(A,B,C),C),f2(A,B,C),C) | subactivity(f7(C,f2(A,B,C)),C) | min_precedes(f2(A,B,C),f12(f2(A,B,C),C),C) | -min_precedes(A,B,C).  [resolve(59,b,55,b)].
0.75/1.03	Derived: min_precedes(f13(f15(A,B),A),f15(A,B),A) | subactivity(f7(A,f15(A,B)),A) | min_precedes(f15(A,B),f12(f15(A,B),A),A) | atomic(A) | -occurrence_of(B,A).  [resolve(59,b,56,b)].
0.75/1.03	60 min_precedes(f13(A,B),A,B) | -leaf(A,B) | atocc(A,f7(B,A)).  [resolve(47,a,42,a)].
0.75/1.03	Derived: min_precedes(f13(A,f14(A,B)),A,f14(A,B)) | atocc(A,f7(f14(A,B),A)) | -leaf_occ(A,B).  [resolve(60,b,48,a)].
0.75/1.03	Derived: min_precedes(f13(A,f9(A,B)),A,f9(A,B)) | atocc(A,f7(f9(A,B),A)) | min_precedes(A,f12(A,f9(A,B)),f9(A,B)) | -root_occ(A,B).  [resolve(60,b,54,b)].
0.75/1.03	Derived: min_precedes(f13(f2(A,B,C),C),f2(A,B,C),C) | atocc(f2(A,B,C),f7(C,f2(A,B,C))) | min_precedes(f2(A,B,C),f12(f2(A,B,C),C),C) | -min_precedes(A,B,C).  [resolve(60,b,55,b)].
0.75/1.03	Derived: min_precedes(f13(f15(A,B),A),f15(A,B),A) | atocc(f15(A,B),f7(A,f15(A,B))) | min_precedes(f15(A,B),f12(f15(A,B),A),A) | atomic(A) | -occurrence_of(B,A).  [resolve(60,b,56,b)].
0.75/1.03	61 min_precedes(f13(A,B),A,B) | -leaf(A,B) | root_occ(A,C) | -occurrence_of(C,B) | -subactivity_occurrence(A,C).  [resolve(47,a,45,c)].
0.75/1.03	Derived: min_precedes(f13(A,f14(A,B)),A,f14(A,B)) | root_occ(A,C) | -occurrence_of(C,f14(A,B)) | -subactivity_occurrence(A,C) | -leaf_occ(A,B).  [resolve(61,b,48,a)].
0.75/1.03	Derived: min_precedes(f13(A,f9(A,B)),A,f9(A,B)) | root_occ(A,C) | -occurrence_of(C,f9(A,B)) | -subactivity_occurrence(A,C) | min_precedes(A,f12(A,f9(A,B)),f9(A,B)) | -root_occ(A,B).  [resolve(61,b,54,b)].
0.75/1.03	Derived: min_precedes(f13(f2(A,B,C),C),f2(A,B,C),C) | root_occ(f2(A,B,C),D) | -occurrence_of(D,C) | -subactivity_occurrence(f2(A,B,C),D) | min_precedes(f2(A,B,C),f12(f2(A,B,C),C),C) | -min_precedes(A,B,C).  [resolve(61,b,55,b)].
0.75/1.03	Derived: min_precedes(f13(f15(A,B),A),f15(A,B),A) | root_occ(f15(A,B),C) | -occurrence_of(C,A) | -subactivity_occurrence(f15(A,B),C) | min_precedes(f15(A,B),f12(f15(A,B),A),A) | atomic(A) | -occurrence_of(B,A).  [resolve(61,b,56,b)].
0.75/1.03	62 -occurrence_of(A,tptp0) | next_subocc(f3(A),f4(A),tptp0) # label(sos_32) # label(axiom).  [clausify(15)].
0.75/1.03	63 -next_subocc(A,B,C) | -min_precedes(A,D,C) | -min_precedes(D,B,C) # label(sos_26) # label(axiom).  [clausify(21)].
0.75/1.03	64 -next_subocc(A,B,C) | arboreal(A) # label(sos_25) # label(axiom).  [clausify(4)].
0.75/1.03	65 -next_subocc(A,B,C) | arboreal(B) # label(sos_25) # label(axiom).  [clausify(4)].
0.75/1.03	66 -next_subocc(A,B,C) | min_precedes(A,B,C) # label(sos_26) # label(axiom).  [clausify(21)].
0.75/1.03	Derived: -occurrence_of(A,tptp0) | -min_precedes(f3(A),B,tptp0) | -min_precedes(B,f4(A),tptp0).  [resolve(62,b,63,a)].
0.75/1.03	Derived: -occurrence_of(A,tptp0) | arboreal(f3(A)).  [resolve(62,b,64,a)].
0.75/1.03	Derived: -occurrence_of(A,tptp0) | arboreal(f4(A)).  [resolve(62,b,65,a)].
0.75/1.03	Derived: -occurrence_of(A,tptp0) | min_precedes(f3(A),f4(A),tptp0).  [resolve(62,b,66,a)].
0.75/1.03	67 next_subocc(A,B,C) | min_precedes(A,f6(A,B,C),C) | -min_precedes(A,B,C) # label(sos_26) # label(axiom).  [clausify(21)].
0.75/1.03	Derived: min_precedes(A,f6(A,B,C),C) | -min_precedes(A,B,C) | -min_precedes(A,D,C) | -min_precedes(D,B,C).  [resolve(67,a,63,a)].
0.75/1.03	Derived: min_precedes(A,f6(A,B,C),C) | -min_precedes(A,B,C) | arboreal(A).  [resolve(67,a,64,a)].
0.75/1.03	Derived: min_precedes(A,f6(A,B,C),C) | -min_precedes(A,B,C) | arboreal(B).  [resolve(67,a,65,a)].
0.75/1.03	68 next_subocc(A,B,C) | min_precedes(f6(A,B,C),B,C) | -min_precedes(A,B,C) # label(sos_26) # label(axiom).  [clausify(21)].
0.75/1.03	Derived: min_precedes(f6(A,B,C),B,C) | -min_precedes(A,B,C) | -min_precedes(A,D,C) | -min_precedes(D,B,C).  [resolve(68,a,63,a)].
0.75/1.03	Derived: min_precedes(f6(A,B,C),B,C) | -min_precedes(A,B,C) | arboreal(A).  [resolve(68,a,64,a)].
0.75/1.03	Derived: min_precedes(f6(A,B,C),B,C) | -min_precedes(A,B,C) | arboreal(B).  [resolve(68,a,65,a)].
0.75/1.03	69 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | leaf_occ(B,A) | -arboreal(B) | next_subocc(B,f1(B,A),tptp0) # label(sos_47) # label(axiom).  [clausify(8)].
0.75/1.03	Derived: -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | leaf_occ(B,A) | -arboreal(B) | -min_precedes(B,C,tptp0) | -min_precedes(C,f1(B,A),tptp0).  [resolve(69,e,63,a)].
0.75/1.03	Derived: -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | leaf_occ(B,A) | -arboreal(B) | arboreal(f1(B,A)).  [resolve(69,e,65,a)].
0.75/1.03	Derived: -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | leaf_occ(B,A) | -arboreal(B) | min_precedes(B,f1(B,A),tptp0).  [resolve(69,e,66,a)].
0.75/1.03	70 legal(A) | -precedes(B,A) # label(sos_21) # label(axiom).  [clausify(26)].
0.75/1.03	71 -legal(A) | arboreal(A) # label(sos_13) # label(axiom).  [clausify(13)].
0.75/1.03	Derived: -precedes(A,B) | arboreal(B).  [resolve(70,a,71,a)].
0.75/1.03	72 -legal(A) | -earlier(B,A) | precedes(B,A) # label(sos_21) # label(axiom).  [clausify(26)].
0.75/1.03	Derived: -earlier(A,B) | precedes(A,B) | -precedes(C,B).  [resolve(72,a,70,a)].
0.75/1.03	73 -root_occ(A,B) | legal(A).  [resolve(38,b,40,a)].
0.75/1.03	Derived: -root_occ(A,B) | arboreal(A).  [resolve(73,b,71,a)].
0.75/1.03	Derived: -root_occ(A,B) | -earlier(C,A) | precedes(C,A).  [resolve(73,b,72,a)].
0.75/1.03	74 -min_precedes(A,B,C) | legal(f2(A,B,C)).  [resolve(43,b,40,a)].
0.75/1.03	Derived: -min_precedes(A,B,C) | arboreal(f2(A,B,C)).  [resolve(74,b,71,a)].
0.75/1.03	Derived: -min_precedes(A,B,C) | -earlier(D,f2(A,B,C)) | precedes(D,f2(A,B,C)).  [resolve(74,b,72,a)].
0.75/1.03	75 atomic(A) | -occurrence_of(B,A) | legal(f15(A,B)).  [resolve(44,c,40,a)].
0.75/1.03	Derived: atomic(A) | -occurrence_of(B,A) | arboreal(f15(A,B)).  [resolve(75,c,71,a)].
0.75/1.03	Derived: atomic(A) | -occurrence_of(B,A) | -earlier(C,f15(A,B)) | precedes(C,f15(A,B)).  [resolve(75,c,72,a)].
0.75/1.03	76 min_precedes(f13(A,f14(A,B)),A,f14(A,B)) | legal(A) | -leaf_occ(A,B).  [resolve(58,b,48,a)].
0.75/1.03	Derived: min_precedes(f13(A,f14(A,B)),A,f14(A,B)) | -leaf_occ(A,B) | arboreal(A).  [resolve(76,b,71,a)].
0.75/1.03	Derived: min_precedes(f13(A,f14(A,B)),A,f14(A,B)) | -leaf_occ(A,B) | -earlier(C,A) | precedes(C,A).  [resolve(76,b,72,a)].
0.75/1.03	77 min_precedes(f13(A,f9(A,B)),A,f9(A,B)) | legal(A) | min_precedes(A,f12(A,f9(A,B)),f9(A,B)) | -root_occ(A,B).  [resolve(58,b,54,b)].
0.75/1.03	78 min_precedes(f13(f2(A,B,C),C),f2(A,B,C),C) | legal(f2(A,B,C)) | min_precedes(f2(A,B,C),f12(f2(A,B,C),C),C) | -min_precedes(A,B,C).  [resolve(58,b,55,b)].
0.75/1.03	79 min_precedes(f13(f15(A,B),A),f15(A,B),A) | legal(f15(A,B)) | min_precedes(f15(A,B),f12(f15(A,B),A),A) | atomic(A) | -occurrence_of(B,A).  [resolve(58,b,56,b)].
0.75/1.03	80 -activity_occurrence(A) | occurrence_of(A,f5(A)) # label(sos_12) # label(axiom).  [clausify(20)].
0.75/1.03	81 -occurrence_of(A,B) | activity_occurrence(A) # label(sos_03) # label(axiom).  [clausify(3)].
0.75/1.03	82 -subactivity_occurrence(A,B) | activity_occurrence(A) # label(sos_11) # label(axiom).  [clausify(32)].
0.75/1.03	83 -subactivity_occurrence(A,B) | activity_occurrence(B) # label(sos_11) # label(axiom).  [clausify(32)].
0.75/1.03	Derived: occurrence_of(A,f5(A)) | -occurrence_of(A,B).  [resolve(80,a,81,b)].
0.75/1.03	Derived: occurrence_of(A,f5(A)) | -subactivity_occurrence(A,B).  [resolve(80,a,82,b)].
0.75/1.03	Derived: occurrence_of(A,f5(A)) | -subactivity_occurrence(B,A).  [resolve(80,a,83,b)].
0.75/1.03	84 -atomic(A) | -occurrence_of(B,A) | -subactivity(C,A) | atocc(B,C) # label(sos_14) # label(axiom).  [clausify(29)].
2.86/3.13	85 atomic(f10(A,B)) | -atocc(A,B) # label(sos_14) # label(axiom).  [clausify(29)].
2.86/3.13	86 occurrence_of(A,f10(A,B)) | -atocc(A,B) # label(sos_14) # label(axiom).  [clausify(29)].
2.86/3.13	87 subactivity(A,f10(B,A)) | -atocc(B,A) # label(sos_14) # label(axiom).  [clausify(29)].
2.86/3.13	Derived: -atomic(A) | -occurrence_of(B,A) | -subactivity(C,A) | atomic(f10(B,C)).  [resolve(84,d,85,b)].
2.86/3.13	Derived: -atomic(A) | -occurrence_of(B,A) | -subactivity(C,A) | occurrence_of(B,f10(B,C)).  [resolve(84,d,86,b)].
2.86/3.13	Derived: -atomic(A) | -occurrence_of(B,A) | -subactivity(C,A) | subactivity(C,f10(B,C)).  [resolve(84,d,87,b)].
2.86/3.13	88 -root_occ(A,B) | atocc(A,f7(f9(A,B),A)).  [resolve(38,b,42,a)].
2.86/3.13	Derived: -root_occ(A,B) | atomic(f10(A,f7(f9(A,B),A))).  [resolve(88,b,85,b)].
2.86/3.13	Derived: -root_occ(A,B) | occurrence_of(A,f10(A,f7(f9(A,B),A))).  [resolve(88,b,86,b)].
2.86/3.13	Derived: -root_occ(A,B) | subactivity(f7(f9(A,B),A),f10(A,f7(f9(A,B),A))).  [resolve(88,b,87,b)].
2.86/3.13	89 -min_precedes(A,B,C) | atocc(f2(A,B,C),f7(C,f2(A,B,C))).  [resolve(43,b,42,a)].
2.86/3.13	Derived: -min_precedes(A,B,C) | atomic(f10(f2(A,B,C),f7(C,f2(A,B,C)))).  [resolve(89,b,85,b)].
2.86/3.13	Derived: -min_precedes(A,B,C) | occurrence_of(f2(A,B,C),f10(f2(A,B,C),f7(C,f2(A,B,C)))).  [resolve(89,b,86,b)].
2.86/3.13	Derived: -min_precedes(A,B,C) | subactivity(f7(C,f2(A,B,C)),f10(f2(A,B,C),f7(C,f2(A,B,C)))).  [resolve(89,b,87,b)].
2.86/3.13	90 atomic(A) | -occurrence_of(B,A) | atocc(f15(A,B),f7(A,f15(A,B))).  [resolve(44,c,42,a)].
2.86/3.13	Derived: atomic(A) | -occurrence_of(B,A) | atomic(f10(f15(A,B),f7(A,f15(A,B)))).  [resolve(90,c,85,b)].
2.86/3.13	Derived: atomic(A) | -occurrence_of(B,A) | occurrence_of(f15(A,B),f10(f15(A,B),f7(A,f15(A,B)))).  [resolve(90,c,86,b)].
2.86/3.13	Derived: atomic(A) | -occurrence_of(B,A) | subactivity(f7(A,f15(A,B)),f10(f15(A,B),f7(A,f15(A,B)))).  [resolve(90,c,87,b)].
2.86/3.13	91 min_precedes(f13(A,f14(A,B)),A,f14(A,B)) | atocc(A,f7(f14(A,B),A)) | -leaf_occ(A,B).  [resolve(60,b,48,a)].
2.86/3.13	Derived: min_precedes(f13(A,f14(A,B)),A,f14(A,B)) | -leaf_occ(A,B) | atomic(f10(A,f7(f14(A,B),A))).  [resolve(91,b,85,b)].
2.86/3.13	Derived: min_precedes(f13(A,f14(A,B)),A,f14(A,B)) | -leaf_occ(A,B) | occurrence_of(A,f10(A,f7(f14(A,B),A))).  [resolve(91,b,86,b)].
2.86/3.13	Derived: min_precedes(f13(A,f14(A,B)),A,f14(A,B)) | -leaf_occ(A,B) | subactivity(f7(f14(A,B),A),f10(A,f7(f14(A,B),A))).  [resolve(91,b,87,b)].
2.86/3.13	92 min_precedes(f13(A,f9(A,B)),A,f9(A,B)) | atocc(A,f7(f9(A,B),A)) | min_precedes(A,f12(A,f9(A,B)),f9(A,B)) | -root_occ(A,B).  [resolve(60,b,54,b)].
2.86/3.13	93 min_precedes(f13(f2(A,B,C),C),f2(A,B,C),C) | atocc(f2(A,B,C),f7(C,f2(A,B,C))) | min_precedes(f2(A,B,C),f12(f2(A,B,C),C),C) | -min_precedes(A,B,C).  [resolve(60,b,55,b)].
2.86/3.13	94 min_precedes(f13(f15(A,B),A),f15(A,B),A) | atocc(f15(A,B),f7(A,f15(A,B))) | min_precedes(f15(A,B),f12(f15(A,B),A),A) | atomic(A) | -occurrence_of(B,A).  [resolve(60,b,56,b)].
2.86/3.13	
2.86/3.13	============================== end predicate elimination =============
2.86/3.13	
2.86/3.13	Auto_denials:  (non-Horn, no changes).
2.86/3.13	
2.86/3.13	Term ordering decisions:
2.86/3.13	Function symbol KB weights:  tptp0=1. tptp1=1. tptp3=1. tptp4=1. tptp2=1. c1=1. f1=1. f7=1. f8=1. f9=1. f10=1. f12=1. f13=1. f14=1. f15=1. f3=1. f4=1. f5=1. f2=1. f6=1. f11=1.
2.86/3.13	
2.86/3.13	============================== end of process initial clauses ========
2.86/3.13	
2.86/3.13	============================== CLAUSES FOR SEARCH ====================
2.86/3.13	
2.86/3.13	============================== end of clauses for search =============
2.86/3.13	
2.86/3.13	============================== SEARCH ================================
2.86/3.13	
2.86/3.13	% Starting search at 0.04 seconds.
2.86/3.13	
2.86/3.13	Low Water (keep): wt=107.000, iters=3519
2.86/3.13	
2.86/3.13	Low Water (keep): wt=103.000, iters=3466
2.86/3.13	
2.86/3.13	Low Water (keep): wt=94.000, iters=3424
2.86/3.13	
2.86/3.13	Low Water (keep): wt=93.000, iters=3498
2.86/3.13	
2.86/3.13	Low Water (keep): wt=87.000, iters=3379
2.86/3.13	
2.86/3.13	Low Water (keep): wt=85.000, iters=3387
2.86/3.13	
2.86/3.13	Low Water (keep): wt=83.000, iters=3344
2.86/3.13	
2.86/3.13	============================== PROOF =================================
2.86/3.13	% SZS status Theorem
2.86/3.13	% SZS output start Refutation
2.86/3.13	
2.86/3.13	% Proof 1 at 2.10 (+ 0.02) seconds.
2.86/3.13	% Length of proof is 94.
2.86/3.13	% Level of proof is 18.
2.86/3.13	% Maximum clause weight is 52.000.
2.86/3.13	% Given clauses 2905.
2.86/3.13	
2.86/3.13	2 (all X28 all X29 all X30 (occurrence_of(X28,X30) & occurrence_of(X28,X29) -> X30 = X29)) # label(sos_08) # label(axiom) # label(non_clause).  [assumption].
2.86/3.13	3 (all X12 all X13 (occurrence_of(X13,X12) -> activity(X12) & activity_occurrence(X13))) # label(sos_03) # label(axiom) # label(non_clause).  [assumption].
2.86/3.13	4 (all X75 all X76 all X77 (next_subocc(X75,X76,X77) -> arboreal(X75) & arboreal(X76))) # label(sos_25) # label(axiom) # label(non_clause).  [assumption].
2.86/3.13	6 (all X31 all X32 all X33 (leaf_occ(X32,X31) & occurrence_of(X31,X33) -> -(exists X34 min_precedes(X32,X34,X33)))) # label(sos_09) # label(axiom) # label(non_clause).  [assumption].
2.86/3.13	7 (all X86 all X87 all X88 all X89 (occurrence_of(X88,X89) & -atomic(X89) & leaf_occ(X86,X88) & leaf_occ(X87,X88) -> X87 = X86)) # label(sos_28) # label(axiom) # label(non_clause).  [assumption].
2.86/3.13	8 (all X108 all X109 (occurrence_of(X109,tptp0) & subactivity_occurrence(X108,X109) & -leaf_occ(X108,X109) & arboreal(X108) -> (exists X110 (next_subocc(X108,X110,tptp0) & occurrence_of(X110,tptp1))))) # label(sos_47) # label(axiom) # label(non_clause).  [assumption].
2.86/3.13	15 (all X101 (occurrence_of(X101,tptp0) -> (exists X102 exists X103 (root_occ(X102,X101) & next_subocc(X102,X103,tptp0) & leaf_occ(X103,X101) & occurrence_of(X103,tptp3) & occurrence_of(X102,tptp4))))) # label(sos_32) # label(axiom) # label(non_clause).  [assumption].
2.86/3.13	17 (all X35 all X36 all X37 (root_occ(X36,X35) & occurrence_of(X35,X37) -> -(exists X38 min_precedes(X38,X36,X37)))) # label(sos_10) # label(axiom) # label(non_clause).  [assumption].
2.86/3.13	19 (all X106 all X107 (subactivity_occurrence(X106,X107) & arboreal(X106) & -leaf_occ(X106,X107) & occurrence_of(X107,tptp0) -> root_occ(X106,X107))) # label(sos_46) # label(axiom) # label(non_clause).  [assumption].
2.86/3.13	20 (all X41 (activity_occurrence(X41) -> (exists X42 (occurrence_of(X41,X42) & activity(X42))))) # label(sos_12) # label(axiom) # label(non_clause).  [assumption].
2.86/3.13	21 (all X78 all X79 all X80 (next_subocc(X78,X79,X80) <-> -(exists X81 (min_precedes(X78,X81,X80) & min_precedes(X81,X79,X80))) & min_precedes(X78,X79,X80))) # label(sos_26) # label(axiom) # label(non_clause).  [assumption].
2.86/3.13	27 (all X25 all X26 (leaf(X25,X26) & -atomic(X26) -> (exists X27 (occurrence_of(X27,X26) & leaf_occ(X25,X27))))) # label(sos_07) # label(axiom) # label(non_clause).  [assumption].
2.86/3.13	28 (all X58 all X59 (root_occ(X58,X59) <-> (exists X60 (occurrence_of(X59,X60) & root(X58,X60) & subactivity_occurrence(X58,X59))))) # label(sos_19) # label(axiom) # label(non_clause).  [assumption].
2.86/3.13	31 (all X21 all X22 all X23 (min_precedes(X22,X23,X21) -> (exists X24 (subactivity_occurrence(X22,X24) & subactivity_occurrence(X23,X24) & occurrence_of(X24,X21))))) # label(sos_06) # label(axiom) # label(non_clause).  [assumption].
2.86/3.13	33 (all X47 all X48 ((root(X47,X48) | (exists X49 min_precedes(X49,X47,X48))) & -(exists X50 min_precedes(X47,X50,X48)) <-> leaf(X47,X48))) # label(sos_15) # label(axiom) # label(non_clause).  [assumption].
2.86/3.13	34 (all X55 all X56 ((exists X57 (occurrence_of(X56,X57) & subactivity_occurrence(X55,X56) & leaf(X55,X57))) <-> leaf_occ(X55,X56))) # label(sos_18) # label(axiom) # label(non_clause).  [assumption].
2.86/3.13	37 --(exists X111 occurrence_of(X111,tptp0)) # label(goals) # label(negated_conjecture) # label(non_clause).  [assumption].
2.86/3.13	48 leaf(A,f14(A,B)) | -leaf_occ(A,B) # label(sos_18) # label(axiom).  [clausify(34)].
2.86/3.13	50 -leaf(A,B) | atomic(B) | occurrence_of(f8(A,B),B) # label(sos_07) # label(axiom).  [clausify(27)].
2.86/3.13	51 -leaf(A,B) | atomic(B) | leaf_occ(A,f8(A,B)) # label(sos_07) # label(axiom).  [clausify(27)].
2.86/3.13	53 -min_precedes(A,B,C) | min_precedes(B,f12(B,C),C) | leaf(B,C) # label(sos_15) # label(axiom).  [clausify(33)].
2.86/3.13	62 -occurrence_of(A,tptp0) | next_subocc(f3(A),f4(A),tptp0) # label(sos_32) # label(axiom).  [clausify(15)].
2.86/3.13	64 -next_subocc(A,B,C) | arboreal(A) # label(sos_25) # label(axiom).  [clausify(4)].
2.86/3.13	65 -next_subocc(A,B,C) | arboreal(B) # label(sos_25) # label(axiom).  [clausify(4)].
2.86/3.13	66 -next_subocc(A,B,C) | min_precedes(A,B,C) # label(sos_26) # label(axiom).  [clausify(21)].
2.86/3.13	69 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | leaf_occ(B,A) | -arboreal(B) | next_subocc(B,f1(B,A),tptp0) # label(sos_47) # label(axiom).  [clausify(8)].
2.86/3.13	80 -activity_occurrence(A) | occurrence_of(A,f5(A)) # label(sos_12) # label(axiom).  [clausify(20)].
2.86/3.13	81 -occurrence_of(A,B) | activity_occurrence(A) # label(sos_03) # label(axiom).  [clausify(3)].
2.86/3.13	99 occurrence_of(c1,tptp0) # label(goals) # label(negated_conjecture).  [clausify(37)].
2.86/3.13	100 -atomic(tptp0) # label(sos_34) # label(axiom).  [assumption].
2.86/3.13	107 tptp1 != tptp3 # label(sos_42) # label(axiom).  [assumption].
2.86/3.13	108 tptp3 != tptp1.  [copy(107),flip(a)].
2.86/3.13	111 -leaf_occ(A,B) | -occurrence_of(B,C) | -min_precedes(A,D,C) # label(sos_09) # label(axiom).  [clausify(6)].
2.86/3.13	112 -root_occ(A,B) | -occurrence_of(B,C) | -min_precedes(D,A,C) # label(sos_10) # label(axiom).  [clausify(17)].
2.86/3.13	114 -root_occ(A,B) | subactivity_occurrence(A,B) # label(sos_19) # label(axiom).  [clausify(28)].
2.86/3.13	116 -occurrence_of(A,tptp0) | root_occ(f3(A),A) # label(sos_32) # label(axiom).  [clausify(15)].
2.86/3.13	117 -occurrence_of(A,tptp0) | leaf_occ(f4(A),A) # label(sos_32) # label(axiom).  [clausify(15)].
2.86/3.13	118 -occurrence_of(A,tptp0) | occurrence_of(f4(A),tptp3) # label(sos_32) # label(axiom).  [clausify(15)].
2.86/3.13	124 occurrence_of(A,f14(B,A)) | -leaf_occ(B,A) # label(sos_18) # label(axiom).  [clausify(34)].
2.86/3.13	125 -occurrence_of(A,B) | -occurrence_of(A,C) | B = C # label(sos_08) # label(axiom).  [clausify(2)].
2.86/3.13	128 -min_precedes(A,B,C) | subactivity_occurrence(B,f11(C,A,B)) # label(sos_06) # label(axiom).  [clausify(31)].
2.86/3.13	129 -min_precedes(A,B,C) | occurrence_of(f11(C,A,B),C) # label(sos_06) # label(axiom).  [clausify(31)].
2.86/3.13	134 -occurrence_of(A,B) | atomic(B) | -leaf_occ(C,A) | -leaf_occ(D,A) | D = C # label(sos_28) # label(axiom).  [clausify(7)].
2.86/3.13	135 -subactivity_occurrence(A,B) | -arboreal(A) | leaf_occ(A,B) | -occurrence_of(B,tptp0) | root_occ(A,B) # label(sos_46) # label(axiom).  [clausify(19)].
2.86/3.13	137 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | leaf_occ(B,A) | -arboreal(B) | occurrence_of(f1(B,A),tptp1) # label(sos_47) # label(axiom).  [clausify(8)].
2.86/3.13	151 atomic(f14(A,B)) | occurrence_of(f8(A,f14(A,B)),f14(A,B)) | -leaf_occ(A,B).  [resolve(50,a,48,a)].
2.86/3.13	155 -min_precedes(A,B,C) | min_precedes(B,f12(B,C),C) | atomic(C) | occurrence_of(f8(B,C),C).  [resolve(53,c,50,a)].
2.86/3.13	156 -min_precedes(A,B,C) | min_precedes(B,f12(B,C),C) | atomic(C) | leaf_occ(B,f8(B,C)).  [resolve(53,c,51,a)].
2.86/3.13	177 -occurrence_of(A,tptp0) | arboreal(f3(A)).  [resolve(62,b,64,a)].
2.86/3.13	179 -occurrence_of(A,tptp0) | min_precedes(f3(A),f4(A),tptp0).  [resolve(62,b,66,a)].
2.86/3.13	187 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | leaf_occ(B,A) | -arboreal(B) | arboreal(f1(B,A)).  [resolve(69,e,65,a)].
2.86/3.13	188 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | leaf_occ(B,A) | -arboreal(B) | min_precedes(B,f1(B,A),tptp0).  [resolve(69,e,66,a)].
2.86/3.13	199 occurrence_of(A,f5(A)) | -occurrence_of(A,B).  [resolve(80,a,81,b)].
2.86/3.13	229 root_occ(f3(c1),c1).  [resolve(116,a,99,a)].
2.86/3.13	239 arboreal(f3(c1)).  [resolve(177,a,99,a)].
2.86/3.13	241 min_precedes(f3(c1),f4(c1),tptp0).  [resolve(179,a,99,a)].
2.86/3.13	257 subactivity_occurrence(f3(c1),c1).  [resolve(229,a,114,a)].
2.86/3.13	289 leaf_occ(f3(c1),c1) | min_precedes(f3(c1),f1(f3(c1),c1),tptp0).  [resolve(257,a,188,b),unit_del(a,99),unit_del(c,239)].
2.86/3.13	290 leaf_occ(f3(c1),c1) | arboreal(f1(f3(c1),c1)).  [resolve(257,a,187,b),unit_del(a,99),unit_del(c,239)].
2.86/3.13	294 leaf_occ(f3(c1),c1) | occurrence_of(f1(f3(c1),c1),tptp1).  [resolve(257,a,137,b),unit_del(a,99),unit_del(c,239)].
2.86/3.13	357 -leaf_occ(f3(c1),A) | -occurrence_of(A,tptp0).  [resolve(241,a,111,c)].
2.86/3.13	578 leaf_occ(f3(c1),c1) | min_precedes(f1(f3(c1),c1),f12(f1(f3(c1),c1),tptp0),tptp0) | leaf_occ(f1(f3(c1),c1),f8(f1(f3(c1),c1),tptp0)).  [resolve(289,b,156,a),unit_del(c,100)].
2.86/3.13	579 leaf_occ(f3(c1),c1) | min_precedes(f1(f3(c1),c1),f12(f1(f3(c1),c1),tptp0),tptp0) | occurrence_of(f8(f1(f3(c1),c1),tptp0),tptp0).  [resolve(289,b,155,a),unit_del(c,100)].
2.86/3.13	588 leaf_occ(f3(c1),c1) | occurrence_of(f11(tptp0,f3(c1),f1(f3(c1),c1)),tptp0).  [resolve(289,b,129,a)].
2.86/3.13	589 leaf_occ(f3(c1),c1) | subactivity_occurrence(f1(f3(c1),c1),f11(tptp0,f3(c1),f1(f3(c1),c1))).  [resolve(289,b,128,a)].
2.86/3.13	592 leaf_occ(f3(c1),c1) | -root_occ(f1(f3(c1),c1),A) | -occurrence_of(A,tptp0).  [resolve(289,b,112,c)].
2.86/3.13	627 arboreal(f1(f3(c1),c1)).  [resolve(290,a,357,a),unit_del(b,99)].
2.86/3.13	729 occurrence_of(f1(f3(c1),c1),tptp1).  [resolve(294,a,357,a),unit_del(b,99)].
2.86/3.13	730 occurrence_of(f1(f3(c1),c1),f5(f1(f3(c1),c1))).  [resolve(729,a,199,b)].
2.86/3.13	731 -occurrence_of(f1(f3(c1),c1),A) | tptp1 = A.  [resolve(729,a,125,b),flip(b)].
2.86/3.13	815 f5(f1(f3(c1),c1)) = tptp1.  [resolve(730,a,731,a),flip(a)].
2.86/3.13	1681 occurrence_of(f11(tptp0,f3(c1),f1(f3(c1),c1)),tptp0).  [resolve(588,a,357,a),unit_del(b,99)].
2.86/3.13	1994 leaf_occ(f3(c1),c1) | leaf_occ(f1(f3(c1),c1),f8(f1(f3(c1),c1),tptp0)) | -leaf_occ(f1(f3(c1),c1),A) | -occurrence_of(A,tptp0).  [resolve(578,b,111,c)].
2.86/3.13	2054 leaf_occ(f3(c1),c1) | occurrence_of(f8(f1(f3(c1),c1),tptp0),tptp0) | -leaf_occ(f1(f3(c1),c1),A) | -occurrence_of(A,tptp0).  [resolve(579,b,111,c)].
2.86/3.13	2280 leaf_occ(f3(c1),c1) | leaf_occ(f1(f3(c1),c1),f11(tptp0,f3(c1),f1(f3(c1),c1))) | root_occ(f1(f3(c1),c1),f11(tptp0,f3(c1),f1(f3(c1),c1))).  [resolve(589,b,135,a),unit_del(b,627),unit_del(d,1681)].
2.86/3.13	9961 leaf_occ(f3(c1),c1) | leaf_occ(f1(f3(c1),c1),f11(tptp0,f3(c1),f1(f3(c1),c1))).  [resolve(2280,c,592,b),merge(c),unit_del(c,1681)].
2.86/3.13	9966 leaf_occ(f3(c1),c1) | occurrence_of(f8(f1(f3(c1),c1),tptp0),tptp0).  [resolve(9961,b,2054,c),merge(b),unit_del(c,1681)].
2.86/3.13	9967 leaf_occ(f3(c1),c1) | leaf_occ(f1(f3(c1),c1),f8(f1(f3(c1),c1),tptp0)).  [resolve(9961,b,1994,c),merge(b),unit_del(c,1681)].
2.86/3.13	9983 occurrence_of(f8(f1(f3(c1),c1),tptp0),tptp0).  [resolve(9966,a,357,a),unit_del(b,99)].
2.86/3.13	10011 -occurrence_of(f8(f1(f3(c1),c1),tptp0),A) | tptp0 = A.  [resolve(9983,a,125,b),flip(b)].
2.86/3.13	10015 leaf_occ(f4(f8(f1(f3(c1),c1),tptp0)),f8(f1(f3(c1),c1),tptp0)).  [resolve(9983,a,117,a)].
2.86/3.13	10058 atomic(f14(f4(f8(f1(f3(c1),c1),tptp0)),f8(f1(f3(c1),c1),tptp0))) | occurrence_of(f8(f4(f8(f1(f3(c1),c1),tptp0)),f14(f4(f8(f1(f3(c1),c1),tptp0)),f8(f1(f3(c1),c1),tptp0))),f14(f4(f8(f1(f3(c1),c1),tptp0)),f8(f1(f3(c1),c1),tptp0))).  [resolve(10015,a,151,c)].
2.86/3.13	10059 -occurrence_of(f8(f1(f3(c1),c1),tptp0),A) | atomic(A) | -leaf_occ(B,f8(f1(f3(c1),c1),tptp0)) | f4(f8(f1(f3(c1),c1),tptp0)) = B.  [resolve(10015,a,134,d)].
2.86/3.13	10060 occurrence_of(f8(f1(f3(c1),c1),tptp0),f14(f4(f8(f1(f3(c1),c1),tptp0)),f8(f1(f3(c1),c1),tptp0))).  [resolve(10015,a,124,b)].
2.86/3.13	10416 f14(f4(f8(f1(f3(c1),c1),tptp0)),f8(f1(f3(c1),c1),tptp0)) = tptp0.  [resolve(10060,a,10011,a),flip(a)].
2.86/3.13	10417 occurrence_of(f8(f4(f8(f1(f3(c1),c1),tptp0)),tptp0),tptp0).  [back_rewrite(10058),rewrite([10416(14),10416(23),10416(25)]),unit_del(a,100)].
2.86/3.13	10438 occurrence_of(f4(f8(f4(f8(f1(f3(c1),c1),tptp0)),tptp0)),tptp3).  [resolve(10417,a,118,a)].
2.86/3.13	10451 occurrence_of(f4(f8(f4(f8(f1(f3(c1),c1),tptp0)),tptp0)),f5(f4(f8(f4(f8(f1(f3(c1),c1),tptp0)),tptp0)))).  [resolve(10438,a,199,b)].
2.86/3.13	10452 -occurrence_of(f4(f8(f4(f8(f1(f3(c1),c1),tptp0)),tptp0)),A) | tptp3 = A.  [resolve(10438,a,125,b),flip(b)].
2.86/3.13	10905 f5(f4(f8(f4(f8(f1(f3(c1),c1),tptp0)),tptp0))) = tptp3.  [resolve(10451,a,10452,a),flip(a)].
2.86/3.13	12752 -occurrence_of(f8(f1(f3(c1),c1),tptp0),A) | atomic(A) | f4(f8(f1(f3(c1),c1),tptp0)) = f1(f3(c1),c1) | leaf_occ(f3(c1),c1).  [resolve(10059,c,9967,b)].
2.86/3.13	12753 f4(f8(f1(f3(c1),c1),tptp0)) = f1(f3(c1),c1) | leaf_occ(f3(c1),c1).  [resolve(12752,a,9983,a),unit_del(a,100)].
2.86/3.13	12762 f4(f8(f1(f3(c1),c1),tptp0)) = f1(f3(c1),c1).  [resolve(12753,b,357,a),unit_del(b,99)].
2.86/3.13	12887 $F.  [back_rewrite(10905),rewrite([12762(7),12762(7),815(5)]),flip(a),unit_del(a,108)].
2.86/3.13	
2.86/3.13	% SZS output end Refutation
2.86/3.13	============================== end of proof ==========================
2.86/3.13	
2.86/3.13	============================== STATISTICS ============================
2.86/3.13	
2.86/3.13	Given=2905. Generated=26315. Kept=12787. proofs=1.
2.86/3.13	Usable=1329. Sos=3274. Demods=78. Limbo=125, Disabled=8243. Hints=0.
2.86/3.13	Megabytes=28.53.
2.86/3.13	User_CPU=2.10, System_CPU=0.02, Wall_clock=2.
2.86/3.13	
2.86/3.13	============================== end of statistics =====================
2.86/3.13	
2.86/3.13	============================== end of search =========================
2.86/3.13	
2.86/3.13	THEOREM PROVED
2.86/3.13	% SZS status Theorem
2.86/3.13	
2.86/3.13	Exiting with 1 proof.
2.86/3.13	
2.86/3.13	Process 28422 exit (max_proofs) Mon Jul  3 05:57:41 2023
2.86/3.13	Prover9 interrupted
2.86/3.13	EOF