0.03/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.12	% Command    : tptp2X_and_run_prover9 %d %s
0.12/0.34	% Computer   : n008.cluster.edu
0.12/0.34	% Model      : x86_64 x86_64
0.12/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.34	% Memory     : 8042.1875MB
0.12/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.34	% CPULimit   : 180
0.12/0.34	% DateTime   : Thu Aug 29 11:45:38 EDT 2019
0.12/0.34	% CPUTime    : 
0.44/1.04	============================== Prover9 ===============================
0.44/1.04	Prover9 (32) version 2009-11A, November 2009.
0.44/1.04	Process 26525 was started by sandbox on n008.cluster.edu,
0.44/1.04	Thu Aug 29 11:45:39 2019
0.44/1.04	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 180 -f /tmp/Prover9_26372_n008.cluster.edu".
0.44/1.04	============================== end of head ===========================
0.44/1.04	
0.44/1.04	============================== INPUT =================================
0.44/1.04	
0.44/1.04	% Reading from file /tmp/Prover9_26372_n008.cluster.edu
0.44/1.04	
0.44/1.04	set(prolog_style_variables).
0.44/1.04	set(auto2).
0.44/1.04	    % set(auto2) -> set(auto).
0.44/1.04	    % set(auto) -> set(auto_inference).
0.44/1.04	    % set(auto) -> set(auto_setup).
0.44/1.04	    % set(auto_setup) -> set(predicate_elim).
0.44/1.04	    % set(auto_setup) -> assign(eq_defs, unfold).
0.44/1.04	    % set(auto) -> set(auto_limits).
0.44/1.04	    % set(auto_limits) -> assign(max_weight, "100.000").
0.44/1.04	    % set(auto_limits) -> assign(sos_limit, 20000).
0.44/1.04	    % set(auto) -> set(auto_denials).
0.44/1.04	    % set(auto) -> set(auto_process).
0.44/1.04	    % set(auto2) -> assign(new_constants, 1).
0.44/1.04	    % set(auto2) -> assign(fold_denial_max, 3).
0.44/1.04	    % set(auto2) -> assign(max_weight, "200.000").
0.44/1.04	    % set(auto2) -> assign(max_hours, 1).
0.44/1.04	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.44/1.04	    % set(auto2) -> assign(max_seconds, 0).
0.44/1.04	    % set(auto2) -> assign(max_minutes, 5).
0.44/1.04	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.44/1.04	    % set(auto2) -> set(sort_initial_sos).
0.44/1.04	    % set(auto2) -> assign(sos_limit, -1).
0.44/1.04	    % set(auto2) -> assign(lrs_ticks, 3000).
0.44/1.04	    % set(auto2) -> assign(max_megs, 400).
0.44/1.04	    % set(auto2) -> assign(stats, some).
0.44/1.04	    % set(auto2) -> clear(echo_input).
0.44/1.04	    % set(auto2) -> set(quiet).
0.44/1.04	    % set(auto2) -> clear(print_initial_clauses).
0.44/1.04	    % set(auto2) -> clear(print_given).
0.44/1.04	assign(lrs_ticks,-1).
0.44/1.04	assign(sos_limit,10000).
0.44/1.04	assign(order,kbo).
0.44/1.04	set(lex_order_vars).
0.44/1.04	clear(print_given).
0.44/1.04	
0.44/1.04	% formulas(sos).  % not echoed (47 formulas)
0.44/1.04	
0.44/1.04	============================== end of input ==========================
0.44/1.04	
0.44/1.04	% From the command line: assign(max_seconds, 180).
0.44/1.04	
0.44/1.04	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.44/1.04	
0.44/1.04	% Formulas that are not ordinary clauses:
0.44/1.04	1 (all X8 all X9 all X10 all X11 (occurrence_of(X9,X8) & arboreal(X10) & -min_precedes(X10,X11,X8) & leaf_occ(X11,X9) & subactivity_occurrence(X10,X9) -> X11 = X10)) # label(sos_02) # label(axiom) # label(non_clause).  [assumption].
0.44/1.04	2 (all X75 all X76 all X77 (next_subocc(X75,X76,X77) -> arboreal(X76) & arboreal(X75))) # label(sos_25) # label(axiom) # label(non_clause).  [assumption].
0.44/1.04	3 (all X25 all X26 (-atomic(X26) & leaf(X25,X26) -> (exists X27 (leaf_occ(X25,X27) & occurrence_of(X27,X26))))) # label(sos_07) # label(axiom) # label(non_clause).  [assumption].
0.44/1.04	4 (all X28 all X29 all X30 (occurrence_of(X28,X30) & occurrence_of(X28,X29) -> X29 = X30)) # label(sos_08) # label(axiom) # label(non_clause).  [assumption].
0.44/1.04	5 (all X12 all X13 (occurrence_of(X13,X12) -> activity_occurrence(X13) & activity(X12))) # label(sos_03) # label(axiom) # label(non_clause).  [assumption].
0.44/1.04	6 (all X82 all X83 all X84 all X85 (min_precedes(X82,X83,X84) & subactivity_occurrence(X83,X85) & occurrence_of(X85,X84) -> subactivity_occurrence(X82,X85))) # label(sos_27) # label(axiom) # label(non_clause).  [assumption].
0.44/1.04	7 (all X3 all X4 all X5 all X6 all X7 (occurrence_of(X4,X3) & root_occ(X6,X4) & subactivity_occurrence(X5,X4) & min_precedes(X6,X5,X3) & X7 != X5 & leaf_occ(X7,X4) -> min_precedes(X5,X7,X3))) # label(sos_01) # label(axiom) # label(non_clause).  [assumption].
0.44/1.04	8 (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.44/1.04	9 (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.44/1.04	10 (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.44/1.04	11 (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.44/1.05	12 (all X51 all X52 (occurrence_of(X51,X52) -> (arboreal(X51) <-> atomic(X52)))) # label(sos_16) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	13 (all X44 all X45 (atocc(X44,X45) <-> (exists X46 (subactivity(X45,X46) & occurrence_of(X44,X46) & atomic(X46))))) # label(sos_14) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	14 (all X53 all X54 (root(X53,X54) -> legal(X53))) # label(sos_17) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	15 (all X97 all X98 all X99 all X100 (min_precedes(X97,X98,X100) & precedes(X98,X99) & min_precedes(X97,X99,X100) -> min_precedes(X98,X99,X100))) # label(sos_31) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	16 (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.44/1.05	17 (all X86 all X87 all X88 all X89 (leaf_occ(X87,X88) & leaf_occ(X86,X88) & -atomic(X89) & occurrence_of(X88,X89) -> X87 = X86)) # label(sos_28) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	18 (all X47 all X48 (leaf(X47,X48) <-> (root(X47,X48) | (exists X49 min_precedes(X49,X47,X48))) & -(exists X50 min_precedes(X47,X50,X48)))) # label(sos_15) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	19 (all X72 all X73 all X74 (min_precedes(X72,X73,X74) -> precedes(X72,X73))) # label(sos_24) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	20 (all X61 all X62 (earlier(X61,X62) -> -earlier(X62,X61))) # label(sos_20) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	21 (all X101 (occurrence_of(X101,tptp0) -> (exists X102 exists X103 (occurrence_of(X102,tptp4) & root_occ(X102,X101) & occurrence_of(X103,tptp3) & next_subocc(X102,X103,tptp0) & leaf_occ(X103,X101))))) # label(sos_32) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	22 (all X39 all X40 (subactivity_occurrence(X39,X40) -> activity_occurrence(X39) & activity_occurrence(X40))) # label(sos_11) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	23 (all X65 all X66 all X67 (min_precedes(X65,X66,X67) -> -root(X66,X67))) # label(sos_22) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	24 (all X43 (legal(X43) -> arboreal(X43))) # label(sos_13) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	25 (all X68 all X69 all X70 (min_precedes(X68,X69,X70) -> (exists X71 (root(X71,X70) & min_precedes(X71,X69,X70))))) # label(sos_23) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	26 (all X41 (activity_occurrence(X41) -> (exists X42 (activity(X42) & occurrence_of(X41,X42))))) # label(sos_12) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	27 (all X18 all X19 (root(X19,X18) -> (exists X20 (atocc(X19,X20) & subactivity(X20,X18))))) # label(sos_05) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	28 (all X78 all X79 all X80 (min_precedes(X78,X79,X80) & -(exists X81 (min_precedes(X81,X79,X80) & min_precedes(X78,X81,X80))) <-> next_subocc(X78,X79,X80))) # label(sos_26) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	29 (all X58 all X59 (root_occ(X58,X59) <-> (exists X60 (root(X58,X60) & subactivity_occurrence(X58,X59) & occurrence_of(X59,X60))))) # label(sos_19) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	30 (all X14 all X15 all X16 all X17 (occurrence_of(X15,X14) & subactivity_occurrence(X16,X15) & subactivity_occurrence(X17,X15) & arboreal(X17) & arboreal(X16) -> X17 = X16 | min_precedes(X17,X16,X14) | min_precedes(X16,X17,X14))) # label(sos_04) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	31 (all X63 all X64 (precedes(X63,X64) <-> legal(X64) & earlier(X63,X64))) # label(sos_21) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	32 (all X104 all X105 (occurrence_of(X105,tptp0) & subactivity_occurrence(X104,X105) & -leaf_occ(X104,X105) & arboreal(X104) -> (exists X106 (next_subocc(X104,X106,tptp0) & occurrence_of(X106,tptp1))))) # label(sos_45) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	33 (all X90 all X91 all X92 all X93 (occurrence_of(X92,X93) & root_occ(X91,X92) & root_occ(X90,X92) -> X90 = X91)) # label(sos_29) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	34 (all X0 all X1 (-atomic(X0) & occurrence_of(X1,X0) -> (exists X2 (subactivity_occurrence(X2,X1) & root(X2,X0))))) # label(sos) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	35 --(exists X107 occurrence_of(X107,tptp0)) # label(goals) # label(negated_conjecture) # label(non_clause).  [assumption].
0.44/1.05	
0.44/1.05	============================== end of process non-clausal formulas ===
0.44/1.05	
0.44/1.05	============================== PROCESS INITIAL CLAUSES ===============
0.44/1.05	
0.44/1.05	============================== PREDICATE ELIMINATION =================
0.44/1.05	36 leaf(A,f2(A,B)) | -leaf_occ(A,B) # label(sos_18) # label(axiom).  [clausify(10)].
0.44/1.05	37 -leaf(A,B) | -min_precedes(A,C,B) # label(sos_15) # label(axiom).  [clausify(18)].
0.44/1.05	Derived: -leaf_occ(A,B) | -min_precedes(A,C,f2(A,B)).  [resolve(36,a,37,a)].
0.44/1.05	38 atomic(A) | -leaf(B,A) | leaf_occ(B,f1(B,A)) # label(sos_07) # label(axiom).  [clausify(3)].
0.44/1.05	Derived: atomic(f2(A,B)) | leaf_occ(A,f1(A,f2(A,B))) | -leaf_occ(A,B).  [resolve(38,b,36,a)].
0.44/1.05	39 atomic(A) | -leaf(B,A) | occurrence_of(f1(B,A),A) # label(sos_07) # label(axiom).  [clausify(3)].
0.44/1.05	Derived: atomic(f2(A,B)) | occurrence_of(f1(A,f2(A,B)),f2(A,B)) | -leaf_occ(A,B).  [resolve(39,b,36,a)].
0.44/1.05	40 -occurrence_of(A,B) | -subactivity_occurrence(C,A) | -leaf(C,B) | leaf_occ(C,A) # label(sos_18) # label(axiom).  [clausify(10)].
0.44/1.05	Derived: -occurrence_of(A,f2(B,C)) | -subactivity_occurrence(B,A) | leaf_occ(B,A) | -leaf_occ(B,C).  [resolve(40,c,36,a)].
0.44/1.05	41 -leaf(A,B) | root(A,B) | min_precedes(f5(A,B),A,B) # label(sos_15) # label(axiom).  [clausify(18)].
0.44/1.05	Derived: root(A,f2(A,B)) | min_precedes(f5(A,f2(A,B)),A,f2(A,B)) | -leaf_occ(A,B).  [resolve(41,a,36,a)].
0.44/1.05	42 leaf(A,B) | -root(A,B) | min_precedes(A,f6(A,B),B) # label(sos_15) # label(axiom).  [clausify(18)].
0.44/1.05	Derived: -root(A,B) | min_precedes(A,f6(A,B),B) | -min_precedes(A,C,B).  [resolve(42,a,37,a)].
0.44/1.05	Derived: -root(A,B) | min_precedes(A,f6(A,B),B) | atomic(B) | leaf_occ(A,f1(A,B)).  [resolve(42,a,38,b)].
0.44/1.05	Derived: -root(A,B) | min_precedes(A,f6(A,B),B) | atomic(B) | occurrence_of(f1(A,B),B).  [resolve(42,a,39,b)].
0.44/1.05	Derived: -root(A,B) | min_precedes(A,f6(A,B),B) | -occurrence_of(C,B) | -subactivity_occurrence(A,C) | leaf_occ(A,C).  [resolve(42,a,40,c)].
0.44/1.05	43 leaf(A,B) | -min_precedes(C,A,B) | min_precedes(A,f6(A,B),B) # label(sos_15) # label(axiom).  [clausify(18)].
0.44/1.05	Derived: -min_precedes(A,B,C) | min_precedes(B,f6(B,C),C) | -min_precedes(B,D,C).  [resolve(43,a,37,a)].
0.44/1.05	Derived: -min_precedes(A,B,C) | min_precedes(B,f6(B,C),C) | atomic(C) | leaf_occ(B,f1(B,C)).  [resolve(43,a,38,b)].
0.44/1.05	Derived: -min_precedes(A,B,C) | min_precedes(B,f6(B,C),C) | atomic(C) | occurrence_of(f1(B,C),C).  [resolve(43,a,39,b)].
0.44/1.05	Derived: -min_precedes(A,B,C) | min_precedes(B,f6(B,C),C) | -occurrence_of(D,C) | -subactivity_occurrence(B,D) | leaf_occ(B,D).  [resolve(43,a,40,c)].
0.44/1.05	Derived: -min_precedes(A,B,C) | min_precedes(B,f6(B,C),C) | root(B,C) | min_precedes(f5(B,C),B,C).  [resolve(43,a,41,a)].
0.44/1.05	44 -root_occ(A,B) | root(A,f13(A,B)) # label(sos_19) # label(axiom).  [clausify(29)].
0.44/1.05	45 -min_precedes(A,B,C) | -root(B,C) # label(sos_22) # label(axiom).  [clausify(23)].
0.44/1.05	46 -root(A,B) | legal(A) # label(sos_17) # label(axiom).  [clausify(14)].
0.44/1.05	47 -root(A,B) | atocc(A,f11(B,A)) # label(sos_05) # label(axiom).  [clausify(27)].
0.44/1.05	48 -root(A,B) | subactivity(f11(B,A),B) # label(sos_05) # label(axiom).  [clausify(27)].
0.44/1.05	Derived: -root_occ(A,B) | -min_precedes(C,A,f13(A,B)).  [resolve(44,b,45,b)].
0.44/1.05	Derived: -root_occ(A,B) | legal(A).  [resolve(44,b,46,a)].
0.44/1.05	Derived: -root_occ(A,B) | atocc(A,f11(f13(A,B),A)).  [resolve(44,b,47,a)].
0.44/1.05	Derived: -root_occ(A,B) | subactivity(f11(f13(A,B),A),f13(A,B)).  [resolve(44,b,48,a)].
0.44/1.05	49 -min_precedes(A,B,C) | root(f9(A,B,C),C) # label(sos_23) # label(axiom).  [clausify(25)].
0.44/1.05	Derived: -min_precedes(A,B,C) | -min_precedes(D,f9(A,B,C),C).  [resolve(49,b,45,b)].
0.44/1.05	Derived: -min_precedes(A,B,C) | legal(f9(A,B,C)).  [resolve(49,b,46,a)].
0.44/1.05	Derived: -min_precedes(A,B,C) | atocc(f9(A,B,C),f11(C,f9(A,B,C))).  [resolve(49,b,47,a)].
0.44/1.05	Derived: -min_precedes(A,B,C) | subactivity(f11(C,f9(A,B,C)),C).  [resolve(49,b,48,a)].
0.44/1.05	50 atomic(A) | -occurrence_of(B,A) | root(f15(A,B),A) # label(sos) # label(axiom).  [clausify(34)].
0.44/1.05	Derived: atomic(A) | -occurrence_of(B,A) | -min_precedes(C,f15(A,B),A).  [resolve(50,c,45,b)].
0.44/1.05	Derived: atomic(A) | -occurrence_of(B,A) | legal(f15(A,B)).  [resolve(50,c,46,a)].
0.44/1.05	Derived: atomic(A) | -occurrence_of(B,A) | atocc(f15(A,B),f11(A,f15(A,B))).  [resolve(50,c,47,a)].
0.44/1.05	Derived: atomic(A) | -occurrence_of(B,A) | subactivity(f11(A,f15(A,B)),A).  [resolve(50,c,48,a)].
0.44/1.05	51 root_occ(A,B) | -root(A,C) | -subactivity_occurrence(A,B) | -occurrence_of(B,C) # label(sos_19) # label(axiom).  [clausify(29)].
0.44/1.05	Derived: root_occ(A,B) | -subactivity_occurrence(A,B) | -occurrence_of(B,f13(A,C)) | -root_occ(A,C).  [resolve(51,b,44,b)].
0.44/1.05	Derived: root_occ(f9(A,B,C),D) | -subactivity_occurrence(f9(A,B,C),D) | -occurrence_of(D,C) | -min_precedes(A,B,C).  [resolve(51,b,49,b)].
0.44/1.05	Derived: root_occ(f15(A,B),C) | -subactivity_occurrence(f15(A,B),C) | -occurrence_of(C,A) | atomic(A) | -occurrence_of(B,A).  [resolve(51,b,50,c)].
0.44/1.05	52 root(A,f2(A,B)) | min_precedes(f5(A,f2(A,B)),A,f2(A,B)) | -leaf_occ(A,B).  [resolve(41,a,36,a)].
0.44/1.05	Derived: min_precedes(f5(A,f2(A,B)),A,f2(A,B)) | -leaf_occ(A,B) | -min_precedes(C,A,f2(A,B)).  [resolve(52,a,45,b)].
0.44/1.05	Derived: min_precedes(f5(A,f2(A,B)),A,f2(A,B)) | -leaf_occ(A,B) | legal(A).  [resolve(52,a,46,a)].
0.44/1.05	Derived: min_precedes(f5(A,f2(A,B)),A,f2(A,B)) | -leaf_occ(A,B) | atocc(A,f11(f2(A,B),A)).  [resolve(52,a,47,a)].
0.44/1.05	Derived: min_precedes(f5(A,f2(A,B)),A,f2(A,B)) | -leaf_occ(A,B) | subactivity(f11(f2(A,B),A),f2(A,B)).  [resolve(52,a,48,a)].
0.44/1.05	Derived: min_precedes(f5(A,f2(A,B)),A,f2(A,B)) | -leaf_occ(A,B) | root_occ(A,C) | -subactivity_occurrence(A,C) | -occurrence_of(C,f2(A,B)).  [resolve(52,a,51,b)].
0.44/1.05	53 -root(A,B) | min_precedes(A,f6(A,B),B) | -min_precedes(A,C,B).  [resolve(42,a,37,a)].
0.44/1.05	Derived: min_precedes(A,f6(A,f13(A,B)),f13(A,B)) | -min_precedes(A,C,f13(A,B)) | -root_occ(A,B).  [resolve(53,a,44,b)].
0.44/1.05	Derived: min_precedes(f9(A,B,C),f6(f9(A,B,C),C),C) | -min_precedes(f9(A,B,C),D,C) | -min_precedes(A,B,C).  [resolve(53,a,49,b)].
0.44/1.05	Derived: min_precedes(f15(A,B),f6(f15(A,B),A),A) | -min_precedes(f15(A,B),C,A) | atomic(A) | -occurrence_of(B,A).  [resolve(53,a,50,c)].
0.44/1.05	Derived: min_precedes(A,f6(A,f2(A,B)),f2(A,B)) | -min_precedes(A,C,f2(A,B)) | min_precedes(f5(A,f2(A,B)),A,f2(A,B)) | -leaf_occ(A,B).  [resolve(53,a,52,a)].
0.44/1.05	54 -root(A,B) | min_precedes(A,f6(A,B),B) | atomic(B) | leaf_occ(A,f1(A,B)).  [resolve(42,a,38,b)].
0.44/1.05	Derived: min_precedes(A,f6(A,f13(A,B)),f13(A,B)) | atomic(f13(A,B)) | leaf_occ(A,f1(A,f13(A,B))) | -root_occ(A,B).  [resolve(54,a,44,b)].
0.44/1.05	Derived: min_precedes(f9(A,B,C),f6(f9(A,B,C),C),C) | atomic(C) | leaf_occ(f9(A,B,C),f1(f9(A,B,C),C)) | -min_precedes(A,B,C).  [resolve(54,a,49,b)].
0.44/1.05	Derived: min_precedes(f15(A,B),f6(f15(A,B),A),A) | atomic(A) | leaf_occ(f15(A,B),f1(f15(A,B),A)) | atomic(A) | -occurrence_of(B,A).  [resolve(54,a,50,c)].
0.44/1.05	Derived: min_precedes(A,f6(A,f2(A,B)),f2(A,B)) | atomic(f2(A,B)) | leaf_occ(A,f1(A,f2(A,B))) | min_precedes(f5(A,f2(A,B)),A,f2(A,B)) | -leaf_occ(A,B).  [resolve(54,a,52,a)].
0.44/1.05	55 -root(A,B) | min_precedes(A,f6(A,B),B) | atomic(B) | occurrence_of(f1(A,B),B).  [resolve(42,a,39,b)].
0.44/1.05	Derived: min_precedes(A,f6(A,f13(A,B)),f13(A,B)) | atomic(f13(A,B)) | occurrence_of(f1(A,f13(A,B)),f13(A,B)) | -root_occ(A,B).  [resolve(55,a,44,b)].
0.44/1.05	Derived: min_precedes(f9(A,B,C),f6(f9(A,B,C),C),C) | atomic(C) | occurrence_of(f1(f9(A,B,C),C),C) | -min_precedes(A,B,C).  [resolve(55,a,49,b)].
0.44/1.05	Derived: min_precedes(f15(A,B),f6(f15(A,B),A),A) | atomic(A) | occurrence_of(f1(f15(A,B),A),A) | atomic(A) | -occurrence_of(B,A).  [resolve(55,a,50,c)].
0.44/1.05	Derived: min_precedes(A,f6(A,f2(A,B)),f2(A,B)) | atomic(f2(A,B)) | occurrence_of(f1(A,f2(A,B)),f2(A,B)) | min_precedes(f5(A,f2(A,B)),A,f2(A,B)) | -leaf_occ(A,B).  [resolve(55,a,52,a)].
0.44/1.05	56 -root(A,B) | min_precedes(A,f6(A,B),B) | -occurrence_of(C,B) | -subactivity_occurrence(A,C) | leaf_occ(A,C).  [resolve(42,a,40,c)].
0.44/1.05	Derived: min_precedes(A,f6(A,f13(A,B)),f13(A,B)) | -occurrence_of(C,f13(A,B)) | -subactivity_occurrence(A,C) | leaf_occ(A,C) | -root_occ(A,B).  [resolve(56,a,44,b)].
0.44/1.05	Derived: min_precedes(f9(A,B,C),f6(f9(A,B,C),C),C) | -occurrence_of(D,C) | -subactivity_occurrence(f9(A,B,C),D) | leaf_occ(f9(A,B,C),D) | -min_precedes(A,B,C).  [resolve(56,a,49,b)].
0.44/1.05	Derived: min_precedes(f15(A,B),f6(f15(A,B),A),A) | -occurrence_of(C,A) | -subactivity_occurrence(f15(A,B),C) | leaf_occ(f15(A,B),C) | atomic(A) | -occurrence_of(B,A).  [resolve(56,a,50,c)].
0.44/1.05	Derived: min_precedes(A,f6(A,f2(A,B)),f2(A,B)) | -occurrence_of(C,f2(A,B)) | -subactivity_occurrence(A,C) | leaf_occ(A,C) | min_precedes(f5(A,f2(A,B)),A,f2(A,B)) | -leaf_occ(A,B).  [resolve(56,a,52,a)].
0.44/1.05	57 -min_precedes(A,B,C) | min_precedes(B,f6(B,C),C) | root(B,C) | min_precedes(f5(B,C),B,C).  [resolve(43,a,41,a)].
0.44/1.05	Derived: -min_precedes(A,B,C) | min_precedes(B,f6(B,C),C) | min_precedes(f5(B,C),B,C) | -min_precedes(D,B,C).  [resolve(57,c,45,b)].
0.44/1.05	58 -occurrence_of(A,tptp0) | next_subocc(f7(A),f8(A),tptp0) # label(sos_32) # label(axiom).  [clausify(21)].
0.44/1.05	59 -min_precedes(A,B,C) | -min_precedes(D,A,C) | -next_subocc(D,B,C) # label(sos_26) # label(axiom).  [clausify(28)].
0.44/1.05	60 -next_subocc(A,B,C) | arboreal(B) # label(sos_25) # label(axiom).  [clausify(2)].
0.44/1.05	61 -next_subocc(A,B,C) | arboreal(A) # label(sos_25) # label(axiom).  [clausify(2)].
0.44/1.05	62 min_precedes(A,B,C) | -next_subocc(A,B,C) # label(sos_26) # label(axiom).  [clausify(28)].
0.44/1.05	Derived: -occurrence_of(A,tptp0) | -min_precedes(B,f8(A),tptp0) | -min_precedes(f7(A),B,tptp0).  [resolve(58,b,59,c)].
0.44/1.05	Derived: -occurrence_of(A,tptp0) | arboreal(f8(A)).  [resolve(58,b,60,a)].
0.44/1.05	Derived: -occurrence_of(A,tptp0) | arboreal(f7(A)).  [resolve(58,b,61,a)].
0.44/1.05	Derived: -occurrence_of(A,tptp0) | min_precedes(f7(A),f8(A),tptp0).  [resolve(58,b,62,b)].
0.44/1.05	63 -min_precedes(A,B,C) | min_precedes(f12(A,B,C),B,C) | next_subocc(A,B,C) # label(sos_26) # label(axiom).  [clausify(28)].
0.44/1.05	Derived: -min_precedes(A,B,C) | min_precedes(f12(A,B,C),B,C) | -min_precedes(D,B,C) | -min_precedes(A,D,C).  [resolve(63,c,59,c)].
0.44/1.05	Derived: -min_precedes(A,B,C) | min_precedes(f12(A,B,C),B,C) | arboreal(B).  [resolve(63,c,60,a)].
0.44/1.05	Derived: -min_precedes(A,B,C) | min_precedes(f12(A,B,C),B,C) | arboreal(A).  [resolve(63,c,61,a)].
0.44/1.05	64 -min_precedes(A,B,C) | min_precedes(A,f12(A,B,C),C) | next_subocc(A,B,C) # label(sos_26) # label(axiom).  [clausify(28)].
0.44/1.05	Derived: -min_precedes(A,B,C) | min_precedes(A,f12(A,B,C),C) | -min_precedes(D,B,C) | -min_precedes(A,D,C).  [resolve(64,c,59,c)].
0.44/1.05	Derived: -min_precedes(A,B,C) | min_precedes(A,f12(A,B,C),C) | arboreal(B).  [resolve(64,c,60,a)].
0.44/1.05	Derived: -min_precedes(A,B,C) | min_precedes(A,f12(A,B,C),C) | arboreal(A).  [resolve(64,c,61,a)].
0.44/1.05	65 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | leaf_occ(B,A) | -arboreal(B) | next_subocc(B,f14(B,A),tptp0) # label(sos_45) # label(axiom).  [clausify(32)].
0.44/1.05	Derived: -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | leaf_occ(B,A) | -arboreal(B) | -min_precedes(C,f14(B,A),tptp0) | -min_precedes(B,C,tptp0).  [resolve(65,e,59,c)].
0.44/1.05	Derived: -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | leaf_occ(B,A) | -arboreal(B) | arboreal(f14(B,A)).  [resolve(65,e,60,a)].
0.44/1.05	Derived: -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | leaf_occ(B,A) | -arboreal(B) | min_precedes(B,f14(B,A),tptp0).  [resolve(65,e,62,b)].
0.44/1.05	66 -precedes(A,B) | legal(B) # label(sos_21) # label(axiom).  [clausify(31)].
0.44/1.05	67 -legal(A) | arboreal(A) # label(sos_13) # label(axiom).  [clausify(24)].
0.44/1.05	Derived: -precedes(A,B) | arboreal(B).  [resolve(66,b,67,a)].
0.44/1.05	68 precedes(A,B) | -legal(B) | -earlier(A,B) # label(sos_21) # label(axiom).  [clausify(31)].
0.44/1.05	Derived: precedes(A,B) | -earlier(A,B) | -precedes(C,B).  [resolve(68,b,66,b)].
0.44/1.05	69 -root_occ(A,B) | legal(A).  [resolve(44,b,46,a)].
0.44/1.05	Derived: -root_occ(A,B) | arboreal(A).  [resolve(69,b,67,a)].
0.44/1.05	Derived: -root_occ(A,B) | precedes(C,A) | -earlier(C,A).  [resolve(69,b,68,b)].
0.44/1.05	70 -min_precedes(A,B,C) | legal(f9(A,B,C)).  [resolve(49,b,46,a)].
0.44/1.05	Derived: -min_precedes(A,B,C) | arboreal(f9(A,B,C)).  [resolve(70,b,67,a)].
0.44/1.05	Derived: -min_precedes(A,B,C) | precedes(D,f9(A,B,C)) | -earlier(D,f9(A,B,C)).  [resolve(70,b,68,b)].
0.44/1.07	71 atomic(A) | -occurrence_of(B,A) | legal(f15(A,B)).  [resolve(50,c,46,a)].
0.44/1.07	Derived: atomic(A) | -occurrence_of(B,A) | arboreal(f15(A,B)).  [resolve(71,c,67,a)].
0.44/1.07	Derived: atomic(A) | -occurrence_of(B,A) | precedes(C,f15(A,B)) | -earlier(C,f15(A,B)).  [resolve(71,c,68,b)].
0.44/1.07	72 min_precedes(f5(A,f2(A,B)),A,f2(A,B)) | -leaf_occ(A,B) | legal(A).  [resolve(52,a,46,a)].
0.44/1.07	Derived: min_precedes(f5(A,f2(A,B)),A,f2(A,B)) | -leaf_occ(A,B) | arboreal(A).  [resolve(72,c,67,a)].
0.44/1.07	Derived: min_precedes(f5(A,f2(A,B)),A,f2(A,B)) | -leaf_occ(A,B) | precedes(C,A) | -earlier(C,A).  [resolve(72,c,68,b)].
0.44/1.07	73 -activity_occurrence(A) | occurrence_of(A,f10(A)) # label(sos_12) # label(axiom).  [clausify(26)].
0.44/1.07	74 -occurrence_of(A,B) | activity_occurrence(A) # label(sos_03) # label(axiom).  [clausify(5)].
0.44/1.07	75 -subactivity_occurrence(A,B) | activity_occurrence(A) # label(sos_11) # label(axiom).  [clausify(22)].
0.44/1.07	76 -subactivity_occurrence(A,B) | activity_occurrence(B) # label(sos_11) # label(axiom).  [clausify(22)].
0.44/1.07	Derived: occurrence_of(A,f10(A)) | -occurrence_of(A,B).  [resolve(73,a,74,b)].
0.44/1.07	Derived: occurrence_of(A,f10(A)) | -subactivity_occurrence(A,B).  [resolve(73,a,75,b)].
0.44/1.07	Derived: occurrence_of(A,f10(A)) | -subactivity_occurrence(B,A).  [resolve(73,a,76,b)].
0.44/1.07	77 atocc(A,B) | -subactivity(B,C) | -occurrence_of(A,C) | -atomic(C) # label(sos_14) # label(axiom).  [clausify(13)].
0.44/1.07	78 -atocc(A,B) | atomic(f4(A,B)) # label(sos_14) # label(axiom).  [clausify(13)].
0.44/1.07	79 -atocc(A,B) | subactivity(B,f4(A,B)) # label(sos_14) # label(axiom).  [clausify(13)].
0.44/1.07	80 -atocc(A,B) | occurrence_of(A,f4(A,B)) # label(sos_14) # label(axiom).  [clausify(13)].
0.44/1.07	Derived: -subactivity(A,B) | -occurrence_of(C,B) | -atomic(B) | atomic(f4(C,A)).  [resolve(77,a,78,a)].
0.44/1.07	Derived: -subactivity(A,B) | -occurrence_of(C,B) | -atomic(B) | subactivity(A,f4(C,A)).  [resolve(77,a,79,a)].
0.44/1.07	Derived: -subactivity(A,B) | -occurrence_of(C,B) | -atomic(B) | occurrence_of(C,f4(C,A)).  [resolve(77,a,80,a)].
0.44/1.07	81 -root_occ(A,B) | atocc(A,f11(f13(A,B),A)).  [resolve(44,b,47,a)].
0.44/1.07	Derived: -root_occ(A,B) | atomic(f4(A,f11(f13(A,B),A))).  [resolve(81,b,78,a)].
0.44/1.07	Derived: -root_occ(A,B) | subactivity(f11(f13(A,B),A),f4(A,f11(f13(A,B),A))).  [resolve(81,b,79,a)].
0.44/1.07	Derived: -root_occ(A,B) | occurrence_of(A,f4(A,f11(f13(A,B),A))).  [resolve(81,b,80,a)].
0.44/1.07	82 -min_precedes(A,B,C) | atocc(f9(A,B,C),f11(C,f9(A,B,C))).  [resolve(49,b,47,a)].
0.44/1.07	Derived: -min_precedes(A,B,C) | atomic(f4(f9(A,B,C),f11(C,f9(A,B,C)))).  [resolve(82,b,78,a)].
0.44/1.07	Derived: -min_precedes(A,B,C) | subactivity(f11(C,f9(A,B,C)),f4(f9(A,B,C),f11(C,f9(A,B,C)))).  [resolve(82,b,79,a)].
0.44/1.07	Derived: -min_precedes(A,B,C) | occurrence_of(f9(A,B,C),f4(f9(A,B,C),f11(C,f9(A,B,C)))).  [resolve(82,b,80,a)].
0.44/1.07	83 atomic(A) | -occurrence_of(B,A) | atocc(f15(A,B),f11(A,f15(A,B))).  [resolve(50,c,47,a)].
0.44/1.07	Derived: atomic(A) | -occurrence_of(B,A) | atomic(f4(f15(A,B),f11(A,f15(A,B)))).  [resolve(83,c,78,a)].
0.44/1.07	Derived: atomic(A) | -occurrence_of(B,A) | subactivity(f11(A,f15(A,B)),f4(f15(A,B),f11(A,f15(A,B)))).  [resolve(83,c,79,a)].
0.44/1.07	Derived: atomic(A) | -occurrence_of(B,A) | occurrence_of(f15(A,B),f4(f15(A,B),f11(A,f15(A,B)))).  [resolve(83,c,80,a)].
0.44/1.07	84 min_precedes(f5(A,f2(A,B)),A,f2(A,B)) | -leaf_occ(A,B) | atocc(A,f11(f2(A,B),A)).  [resolve(52,a,47,a)].
0.44/1.07	Derived: min_precedes(f5(A,f2(A,B)),A,f2(A,B)) | -leaf_occ(A,B) | atomic(f4(A,f11(f2(A,B),A))).  [resolve(84,c,78,a)].
0.44/1.07	Derived: min_precedes(f5(A,f2(A,B)),A,f2(A,B)) | -leaf_occ(A,B) | subactivity(f11(f2(A,B),A),f4(A,f11(f2(A,B),A))).  [resolve(84,c,79,a)].
0.44/1.07	Derived: min_precedes(f5(A,f2(A,B)),A,f2(A,B)) | -leaf_occ(A,B) | occurrence_of(A,f4(A,f11(f2(A,B),A))).  [resolve(84,c,80,a)].
0.44/1.07	
0.44/1.07	============================== end predicate elimination =============
0.44/1.07	
0.44/1.07	Auto_denials:  (non-Horn, no changes).
0.44/1.07	
0.44/1.07	Term ordering decisions:
0.44/1.07	Function symbol KB weights:  tptp0=1. tptp1=1. tptp3=1. tptp4=1. tptp2=1. c1=1. f1=1. f2=1. f4=1. f5=1. f6=1. f11=1. f13=1. f14=1. f15=1. f7=1. f8=1. f10=1. f3=1. f9=1. f12=1.
0.44/1.07	
0.44/1.07	============================== end of process initial clauses ========
5.71/5.98	
5.71/5.98	============================== CLAUSES FOR SEARCH ====================
5.71/5.98	
5.71/5.98	============================== end of clauses for search =============
5.71/5.98	
5.71/5.98	============================== SEARCH ================================
5.71/5.98	
5.71/5.98	% Starting search at 0.04 seconds.
5.71/5.98	
5.71/5.98	Low Water (keep): wt=102.000, iters=3345
5.71/5.98	
5.71/5.98	Low Water (keep): wt=93.000, iters=3334
5.71/5.98	
5.71/5.98	Low Water (keep): wt=90.000, iters=3655
5.71/5.98	
5.71/5.98	Low Water (keep): wt=86.000, iters=3561
5.71/5.98	
5.71/5.98	Low Water (keep): wt=80.000, iters=3421
5.71/5.98	
5.71/5.98	Low Water (keep): wt=69.000, iters=3431
5.71/5.98	
5.71/5.98	Low Water (keep): wt=67.000, iters=3403
5.71/5.98	
5.71/5.98	Low Water (keep): wt=64.000, iters=3476
5.71/5.98	
5.71/5.98	Low Water (keep): wt=62.000, iters=3358
5.71/5.98	
5.71/5.98	Low Water (keep): wt=60.000, iters=3613
5.71/5.98	
5.71/5.98	Low Water (keep): wt=58.000, iters=3429
5.71/5.98	
5.71/5.98	Low Water (keep): wt=57.000, iters=3710
5.71/5.98	
5.71/5.98	Low Water (keep): wt=55.000, iters=3523
5.71/5.98	
5.71/5.98	Low Water (keep): wt=54.000, iters=3377
5.71/5.98	
5.71/5.98	============================== PROOF =================================
5.71/5.98	% SZS status Theorem
5.71/5.98	% SZS output start Refutation
5.71/5.98	
5.71/5.98	% Proof 1 at 4.90 (+ 0.05) seconds.
5.71/5.98	% Length of proof is 83.
5.71/5.98	% Level of proof is 16.
5.71/5.98	% Maximum clause weight is 40.000.
5.71/5.98	% Given clauses 5266.
5.71/5.98	
5.71/5.98	2 (all X75 all X76 all X77 (next_subocc(X75,X76,X77) -> arboreal(X76) & arboreal(X75))) # label(sos_25) # label(axiom) # label(non_clause).  [assumption].
5.71/5.98	4 (all X28 all X29 all X30 (occurrence_of(X28,X30) & occurrence_of(X28,X29) -> X29 = X30)) # label(sos_08) # label(axiom) # label(non_clause).  [assumption].
5.71/5.98	5 (all X12 all X13 (occurrence_of(X13,X12) -> activity_occurrence(X13) & activity(X12))) # label(sos_03) # label(axiom) # label(non_clause).  [assumption].
5.71/5.98	7 (all X3 all X4 all X5 all X6 all X7 (occurrence_of(X4,X3) & root_occ(X6,X4) & subactivity_occurrence(X5,X4) & min_precedes(X6,X5,X3) & X7 != X5 & leaf_occ(X7,X4) -> min_precedes(X5,X7,X3))) # label(sos_01) # label(axiom) # label(non_clause).  [assumption].
5.71/5.98	11 (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].
5.71/5.98	16 (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].
5.71/5.98	21 (all X101 (occurrence_of(X101,tptp0) -> (exists X102 exists X103 (occurrence_of(X102,tptp4) & root_occ(X102,X101) & occurrence_of(X103,tptp3) & next_subocc(X102,X103,tptp0) & leaf_occ(X103,X101))))) # label(sos_32) # label(axiom) # label(non_clause).  [assumption].
5.71/5.98	26 (all X41 (activity_occurrence(X41) -> (exists X42 (activity(X42) & occurrence_of(X41,X42))))) # label(sos_12) # label(axiom) # label(non_clause).  [assumption].
5.71/5.98	28 (all X78 all X79 all X80 (min_precedes(X78,X79,X80) & -(exists X81 (min_precedes(X81,X79,X80) & min_precedes(X78,X81,X80))) <-> next_subocc(X78,X79,X80))) # label(sos_26) # label(axiom) # label(non_clause).  [assumption].
5.71/5.98	29 (all X58 all X59 (root_occ(X58,X59) <-> (exists X60 (root(X58,X60) & subactivity_occurrence(X58,X59) & occurrence_of(X59,X60))))) # label(sos_19) # label(axiom) # label(non_clause).  [assumption].
5.71/5.98	32 (all X104 all X105 (occurrence_of(X105,tptp0) & subactivity_occurrence(X104,X105) & -leaf_occ(X104,X105) & arboreal(X104) -> (exists X106 (next_subocc(X104,X106,tptp0) & occurrence_of(X106,tptp1))))) # label(sos_45) # label(axiom) # label(non_clause).  [assumption].
5.71/5.98	33 (all X90 all X91 all X92 all X93 (occurrence_of(X92,X93) & root_occ(X91,X92) & root_occ(X90,X92) -> X90 = X91)) # label(sos_29) # label(axiom) # label(non_clause).  [assumption].
5.71/5.98	35 --(exists X107 occurrence_of(X107,tptp0)) # label(goals) # label(negated_conjecture) # label(non_clause).  [assumption].
5.71/5.98	44 -root_occ(A,B) | root(A,f13(A,B)) # label(sos_19) # label(axiom).  [clausify(29)].
5.71/5.98	51 root_occ(A,B) | -root(A,C) | -subactivity_occurrence(A,B) | -occurrence_of(B,C) # label(sos_19) # label(axiom).  [clausify(29)].
5.71/5.98	58 -occurrence_of(A,tptp0) | next_subocc(f7(A),f8(A),tptp0) # label(sos_32) # label(axiom).  [clausify(21)].
5.71/5.98	59 -min_precedes(A,B,C) | -min_precedes(D,A,C) | -next_subocc(D,B,C) # label(sos_26) # label(axiom).  [clausify(28)].
5.71/5.98	61 -next_subocc(A,B,C) | arboreal(A) # label(sos_25) # label(axiom).  [clausify(2)].
5.71/5.98	62 min_precedes(A,B,C) | -next_subocc(A,B,C) # label(sos_26) # label(axiom).  [clausify(28)].
5.71/5.98	65 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | leaf_occ(B,A) | -arboreal(B) | next_subocc(B,f14(B,A),tptp0) # label(sos_45) # label(axiom).  [clausify(32)].
5.71/5.98	73 -activity_occurrence(A) | occurrence_of(A,f10(A)) # label(sos_12) # label(axiom).  [clausify(26)].
5.71/5.98	74 -occurrence_of(A,B) | activity_occurrence(A) # label(sos_03) # label(axiom).  [clausify(5)].
5.71/5.98	89 occurrence_of(c1,tptp0) # label(goals) # label(negated_conjecture).  [clausify(35)].
5.71/5.98	93 tptp3 != tptp1 # label(sos_42) # label(axiom).  [assumption].
5.71/5.98	102 -leaf_occ(A,B) | -occurrence_of(B,C) | -min_precedes(A,D,C) # label(sos_09) # label(axiom).  [clausify(16)].
5.71/5.98	104 -root_occ(A,B) | subactivity_occurrence(A,B) # label(sos_19) # label(axiom).  [clausify(29)].
5.71/5.98	110 -occurrence_of(A,tptp0) | root_occ(f7(A),A) # label(sos_32) # label(axiom).  [clausify(21)].
5.71/5.98	111 -occurrence_of(A,tptp0) | occurrence_of(f8(A),tptp3) # label(sos_32) # label(axiom).  [clausify(21)].
5.71/5.98	112 -occurrence_of(A,tptp0) | leaf_occ(f8(A),A) # label(sos_32) # label(axiom).  [clausify(21)].
5.71/5.98	114 -root_occ(A,B) | occurrence_of(B,f13(A,B)) # label(sos_19) # label(axiom).  [clausify(29)].
5.71/5.98	115 -occurrence_of(A,B) | -occurrence_of(A,C) | B = C # label(sos_08) # label(axiom).  [clausify(4)].
5.71/5.98	117 -min_precedes(A,B,C) | subactivity_occurrence(A,f3(C,A,B)) # label(sos_06) # label(axiom).  [clausify(11)].
5.71/5.98	118 -min_precedes(A,B,C) | subactivity_occurrence(B,f3(C,A,B)) # label(sos_06) # label(axiom).  [clausify(11)].
5.71/5.98	119 -min_precedes(A,B,C) | occurrence_of(f3(C,A,B),C) # label(sos_06) # label(axiom).  [clausify(11)].
5.71/5.98	122 -occurrence_of(A,B) | -root_occ(C,A) | -root_occ(D,A) | C = D # label(sos_29) # label(axiom).  [clausify(33)].
5.71/5.98	126 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | leaf_occ(B,A) | -arboreal(B) | occurrence_of(f14(B,A),tptp1) # label(sos_45) # label(axiom).  [clausify(32)].
5.71/5.98	128 -occurrence_of(A,B) | -root_occ(C,A) | -subactivity_occurrence(D,A) | -min_precedes(C,D,B) | E = D | -leaf_occ(E,A) | min_precedes(D,E,B) # label(sos_01) # label(axiom).  [clausify(7)].
5.71/5.98	144 root_occ(A,B) | -subactivity_occurrence(A,B) | -occurrence_of(B,f13(A,C)) | -root_occ(A,C).  [resolve(51,b,44,b)].
5.71/5.98	165 -occurrence_of(A,tptp0) | -min_precedes(B,f8(A),tptp0) | -min_precedes(f7(A),B,tptp0).  [resolve(58,b,59,c)].
5.71/5.98	167 -occurrence_of(A,tptp0) | arboreal(f7(A)).  [resolve(58,b,61,a)].
5.71/5.98	168 -occurrence_of(A,tptp0) | min_precedes(f7(A),f8(A),tptp0).  [resolve(58,b,62,b)].
5.71/5.98	177 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | leaf_occ(B,A) | -arboreal(B) | min_precedes(B,f14(B,A),tptp0).  [resolve(65,e,62,b)].
5.71/5.98	188 occurrence_of(A,f10(A)) | -occurrence_of(A,B).  [resolve(73,a,74,b)].
5.71/5.98	220 root_occ(f7(c1),c1).  [resolve(110,a,89,a)].
5.71/5.98	223 -occurrence_of(c1,A) | tptp0 = A.  [resolve(115,a,89,a)].
5.71/5.98	229 arboreal(f7(c1)).  [resolve(167,a,89,a)].
5.71/5.98	230 min_precedes(f7(c1),f8(c1),tptp0).  [resolve(168,a,89,a)].
5.71/5.98	244 root_occ(f7(c1),A) | -subactivity_occurrence(f7(c1),A) | -occurrence_of(A,f13(f7(c1),c1)).  [resolve(220,a,144,d)].
5.71/5.98	247 occurrence_of(c1,f13(f7(c1),c1)).  [resolve(220,a,114,a)].
5.71/5.98	248 subactivity_occurrence(f7(c1),c1).  [resolve(220,a,104,a)].
5.71/5.98	278 leaf_occ(f7(c1),c1) | min_precedes(f7(c1),f14(f7(c1),c1),tptp0).  [resolve(248,a,177,b),unit_del(a,89),unit_del(c,229)].
5.71/5.98	283 leaf_occ(f7(c1),c1) | occurrence_of(f14(f7(c1),c1),tptp1).  [resolve(248,a,126,b),unit_del(a,89),unit_del(c,229)].
5.71/5.98	345 -leaf_occ(f7(c1),A) | -occurrence_of(A,tptp0).  [resolve(230,a,102,c)].
5.71/5.98	401 f13(f7(c1),c1) = tptp0.  [resolve(247,a,223,a),flip(a)].
5.71/5.98	403 root_occ(f7(c1),A) | -subactivity_occurrence(f7(c1),A) | -occurrence_of(A,tptp0).  [back_rewrite(244),rewrite([401(10)])].
5.71/5.98	572 leaf_occ(f7(c1),c1) | -occurrence_of(A,tptp0) | -root_occ(f7(c1),A) | -subactivity_occurrence(f14(f7(c1),c1),A) | f14(f7(c1),c1) = B | -leaf_occ(B,A) | min_precedes(f14(f7(c1),c1),B,tptp0).  [resolve(278,b,128,d),flip(e)].
5.71/5.98	577 leaf_occ(f7(c1),c1) | occurrence_of(f3(tptp0,f7(c1),f14(f7(c1),c1)),tptp0).  [resolve(278,b,119,a)].
5.71/5.98	578 leaf_occ(f7(c1),c1) | subactivity_occurrence(f14(f7(c1),c1),f3(tptp0,f7(c1),f14(f7(c1),c1))).  [resolve(278,b,118,a)].
5.71/5.98	579 leaf_occ(f7(c1),c1) | subactivity_occurrence(f7(c1),f3(tptp0,f7(c1),f14(f7(c1),c1))).  [resolve(278,b,117,a)].
5.71/5.98	717 occurrence_of(f14(f7(c1),c1),tptp1).  [resolve(283,a,345,a),unit_del(b,89)].
5.71/5.98	718 occurrence_of(f14(f7(c1),c1),f10(f14(f7(c1),c1))).  [resolve(717,a,188,b)].
5.71/5.98	719 -occurrence_of(f14(f7(c1),c1),A) | tptp1 = A.  [resolve(717,a,115,b),flip(b)].
5.71/5.98	803 f10(f14(f7(c1),c1)) = tptp1.  [resolve(718,a,719,a),flip(a)].
5.71/5.98	1662 occurrence_of(f3(tptp0,f7(c1),f14(f7(c1),c1)),tptp0).  [resolve(577,a,345,a),unit_del(b,89)].
5.71/5.98	1679 leaf_occ(f8(f3(tptp0,f7(c1),f14(f7(c1),c1))),f3(tptp0,f7(c1),f14(f7(c1),c1))).  [resolve(1662,a,112,a)].
5.71/5.98	1680 occurrence_of(f8(f3(tptp0,f7(c1),f14(f7(c1),c1))),tptp3).  [resolve(1662,a,111,a)].
5.71/5.98	1681 root_occ(f7(f3(tptp0,f7(c1),f14(f7(c1),c1))),f3(tptp0,f7(c1),f14(f7(c1),c1))).  [resolve(1662,a,110,a)].
5.71/5.98	1689 occurrence_of(f8(f3(tptp0,f7(c1),f14(f7(c1),c1))),f10(f8(f3(tptp0,f7(c1),f14(f7(c1),c1))))).  [resolve(1680,a,188,b)].
5.71/5.98	1690 -occurrence_of(f8(f3(tptp0,f7(c1),f14(f7(c1),c1))),A) | tptp3 = A.  [resolve(1680,a,115,b),flip(b)].
5.71/5.98	2009 leaf_occ(f7(c1),c1) | root_occ(f7(c1),f3(tptp0,f7(c1),f14(f7(c1),c1))).  [resolve(579,b,403,b),unit_del(c,1662)].
5.71/5.98	2257 leaf_occ(f7(c1),c1) | -subactivity_occurrence(f14(f7(c1),c1),f3(tptp0,f7(c1),f14(f7(c1),c1))) | f14(f7(c1),c1) = A | -leaf_occ(A,f3(tptp0,f7(c1),f14(f7(c1),c1))) | min_precedes(f14(f7(c1),c1),A,tptp0).  [resolve(2009,b,572,c),merge(b),unit_del(b,1662)].
5.71/5.98	2267 leaf_occ(f7(c1),c1) | -occurrence_of(f3(tptp0,f7(c1),f14(f7(c1),c1)),A) | -root_occ(B,f3(tptp0,f7(c1),f14(f7(c1),c1))) | f7(c1) = B.  [resolve(2009,b,122,c),flip(d)].
5.71/5.98	3618 f10(f8(f3(tptp0,f7(c1),f14(f7(c1),c1)))) = tptp3.  [resolve(1689,a,1690,a),flip(a)].
5.71/5.98	10129 leaf_occ(f7(c1),c1) | f14(f7(c1),c1) = A | -leaf_occ(A,f3(tptp0,f7(c1),f14(f7(c1),c1))) | min_precedes(f14(f7(c1),c1),A,tptp0).  [resolve(2257,b,578,b),merge(e)].
5.71/5.98	10138 leaf_occ(f7(c1),c1) | f8(f3(tptp0,f7(c1),f14(f7(c1),c1))) = f14(f7(c1),c1) | min_precedes(f14(f7(c1),c1),f8(f3(tptp0,f7(c1),f14(f7(c1),c1))),tptp0).  [resolve(10129,c,1679,a),flip(b)].
5.71/5.98	10141 leaf_occ(f7(c1),c1) | -occurrence_of(f3(tptp0,f7(c1),f14(f7(c1),c1)),A) | f7(f3(tptp0,f7(c1),f14(f7(c1),c1))) = f7(c1).  [resolve(2267,c,1681,a),flip(c)].
5.71/5.98	10180 leaf_occ(f7(c1),c1) | f7(f3(tptp0,f7(c1),f14(f7(c1),c1))) = f7(c1).  [resolve(10141,b,1662,a)].
5.71/5.98	10186 f7(f3(tptp0,f7(c1),f14(f7(c1),c1))) = f7(c1).  [resolve(10180,a,345,a),unit_del(b,89)].
5.71/5.98	10276 -min_precedes(A,f8(f3(tptp0,f7(c1),f14(f7(c1),c1))),tptp0) | -min_precedes(f7(c1),A,tptp0).  [para(10186(a,1),165(c,1)),unit_del(a,1662)].
5.71/5.98	21351 leaf_occ(f7(c1),c1) | f8(f3(tptp0,f7(c1),f14(f7(c1),c1))) = f14(f7(c1),c1) | -min_precedes(f7(c1),f14(f7(c1),c1),tptp0).  [resolve(10138,c,10276,a)].
5.71/5.98	21395 leaf_occ(f7(c1),c1) | f8(f3(tptp0,f7(c1),f14(f7(c1),c1))) = f14(f7(c1),c1).  [resolve(21351,c,278,b),merge(c)].
5.71/5.98	21406 f8(f3(tptp0,f7(c1),f14(f7(c1),c1))) = f14(f7(c1),c1).  [resolve(21395,a,345,a),unit_del(b,89)].
5.71/5.98	21686 $F.  [back_rewrite(3618),rewrite([21406(9),803(5)]),flip(a),unit_del(a,93)].
5.71/5.98	
5.71/5.98	% SZS output end Refutation
5.71/5.98	============================== end of proof ==========================
5.71/5.98	
5.71/5.98	============================== STATISTICS ============================
5.71/5.98	
5.71/5.98	Given=5266. Generated=51044. Kept=21596. proofs=1.
5.71/5.98	Usable=2775. Sos=6344. Demods=86. Limbo=280, Disabled=12369. Hints=0.
5.71/5.98	Megabytes=48.67.
5.71/5.98	User_CPU=4.90, System_CPU=0.05, Wall_clock=5.
5.71/5.98	
5.71/5.98	============================== end of statistics =====================
5.71/5.98	
5.71/5.98	============================== end of search =========================
5.71/5.98	
5.71/5.98	THEOREM PROVED
5.71/5.98	% SZS status Theorem
5.71/5.98	
5.71/5.98	Exiting with 1 proof.
5.71/5.98	
5.71/5.98	Process 26525 exit (max_proofs) Thu Aug 29 11:45:44 2019
5.71/5.98	Prover9 interrupted
5.71/5.98	EOF