0.00/0.03	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.04	% Command    : tptp2X_and_run_prover9 %d %s
0.02/0.23	% Computer   : n175.star.cs.uiowa.edu
0.02/0.23	% Model      : x86_64 x86_64
0.02/0.23	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.02/0.23	% Memory     : 32218.625MB
0.02/0.23	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.02/0.23	% CPULimit   : 300
0.02/0.23	% DateTime   : Sat Jul 14 04:41:42 CDT 2018
0.02/0.23	% CPUTime    : 
0.07/0.48	============================== Prover9 ===============================
0.07/0.48	Prover9 (32) version 2009-11A, November 2009.
0.07/0.48	Process 1070 was started by sandbox2 on n175.star.cs.uiowa.edu,
0.07/0.48	Sat Jul 14 04:41:42 2018
0.07/0.48	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_1038_n175.star.cs.uiowa.edu".
0.07/0.48	============================== end of head ===========================
0.07/0.48	
0.07/0.48	============================== INPUT =================================
0.07/0.48	
0.07/0.48	% Reading from file /tmp/Prover9_1038_n175.star.cs.uiowa.edu
0.07/0.48	
0.07/0.48	set(prolog_style_variables).
0.07/0.48	set(auto2).
0.07/0.48	    % set(auto2) -> set(auto).
0.07/0.48	    % set(auto) -> set(auto_inference).
0.07/0.48	    % set(auto) -> set(auto_setup).
0.07/0.48	    % set(auto_setup) -> set(predicate_elim).
0.07/0.48	    % set(auto_setup) -> assign(eq_defs, unfold).
0.07/0.48	    % set(auto) -> set(auto_limits).
0.07/0.48	    % set(auto_limits) -> assign(max_weight, "100.000").
0.07/0.48	    % set(auto_limits) -> assign(sos_limit, 20000).
0.07/0.48	    % set(auto) -> set(auto_denials).
0.07/0.48	    % set(auto) -> set(auto_process).
0.07/0.48	    % set(auto2) -> assign(new_constants, 1).
0.07/0.48	    % set(auto2) -> assign(fold_denial_max, 3).
0.07/0.48	    % set(auto2) -> assign(max_weight, "200.000").
0.07/0.48	    % set(auto2) -> assign(max_hours, 1).
0.07/0.48	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.07/0.48	    % set(auto2) -> assign(max_seconds, 0).
0.07/0.48	    % set(auto2) -> assign(max_minutes, 5).
0.07/0.48	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.07/0.48	    % set(auto2) -> set(sort_initial_sos).
0.07/0.48	    % set(auto2) -> assign(sos_limit, -1).
0.07/0.48	    % set(auto2) -> assign(lrs_ticks, 3000).
0.07/0.48	    % set(auto2) -> assign(max_megs, 400).
0.07/0.48	    % set(auto2) -> assign(stats, some).
0.07/0.48	    % set(auto2) -> clear(echo_input).
0.07/0.48	    % set(auto2) -> set(quiet).
0.07/0.48	    % set(auto2) -> clear(print_initial_clauses).
0.07/0.48	    % set(auto2) -> clear(print_given).
0.07/0.48	assign(lrs_ticks,-1).
0.07/0.48	assign(sos_limit,10000).
0.07/0.48	assign(order,kbo).
0.07/0.48	set(lex_order_vars).
0.07/0.48	clear(print_given).
0.07/0.48	
0.07/0.48	% formulas(sos).  % not echoed (48 formulas)
0.07/0.48	
0.07/0.48	============================== end of input ==========================
0.07/0.48	
0.07/0.48	% From the command line: assign(max_seconds, 300).
0.07/0.48	
0.07/0.48	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.07/0.48	
0.07/0.48	% Formulas that are not ordinary clauses:
0.07/0.48	1 (all X63 all X64 (precedes(X63,X64) <-> earlier(X63,X64) & legal(X64))) # label(sos_21) # label(axiom) # label(non_clause).  [assumption].
0.07/0.48	2 (all X61 all X62 (earlier(X61,X62) -> -earlier(X62,X61))) # label(sos_20) # label(axiom) # label(non_clause).  [assumption].
0.07/0.48	3 (all X21 all X22 all X23 (min_precedes(X22,X23,X21) -> (exists X24 (occurrence_of(X24,X21) & subactivity_occurrence(X23,X24) & subactivity_occurrence(X22,X24))))) # label(sos_06) # label(axiom) # label(non_clause).  [assumption].
0.07/0.48	4 (all X78 all X79 all X80 (next_subocc(X78,X79,X80) <-> min_precedes(X78,X79,X80) & -(exists X81 (min_precedes(X78,X81,X80) & min_precedes(X81,X79,X80))))) # label(sos_26) # label(axiom) # label(non_clause).  [assumption].
0.07/0.48	5 (all X51 all X52 (occurrence_of(X51,X52) -> (arboreal(X51) <-> atomic(X52)))) # label(sos_16) # label(axiom) # label(non_clause).  [assumption].
0.07/0.48	6 (all X58 all X59 ((exists X60 (subactivity_occurrence(X58,X59) & root(X58,X60) & occurrence_of(X59,X60))) <-> root_occ(X58,X59))) # label(sos_19) # label(axiom) # label(non_clause).  [assumption].
0.07/0.48	7 (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.07/0.48	8 (all X55 all X56 ((exists X57 (leaf(X55,X57) & subactivity_occurrence(X55,X56) & occurrence_of(X56,X57))) <-> leaf_occ(X55,X56))) # label(sos_18) # label(axiom) # label(non_clause).  [assumption].
0.07/0.48	9 (all X3 all X4 all X5 all X6 all X7 (subactivity_occurrence(X5,X4) & X7 != X5 & min_precedes(X6,X5,X3) & leaf_occ(X7,X4) & root_occ(X6,X4) & occurrence_of(X4,X3) -> min_precedes(X5,X7,X3))) # label(sos_01) # label(axiom) # label(non_clause).  [assumption].
0.07/0.48	10 (all X106 all X107 (arboreal(X106) & -leaf_occ(X106,X107) & subactivity_occurrence(X106,X107) & occurrence_of(X107,tptp0) -> (exists X108 (next_subocc(X106,X108,tptp0) & occurrence_of(X108,tptp1))))) # label(sos_46) # label(axiom) # label(non_clause).  [assumption].
0.07/0.48	11 (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.07/0.48	12 (all X53 all X54 (root(X53,X54) -> legal(X53))) # label(sos_17) # label(axiom) # label(non_clause).  [assumption].
0.07/0.48	13 (all X86 all X87 all X88 all X89 (occurrence_of(X88,X89) & leaf_occ(X86,X88) & leaf_occ(X87,X88) & -atomic(X89) -> X87 = X86)) # label(sos_28) # label(axiom) # label(non_clause).  [assumption].
0.07/0.48	14 (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.07/0.48	15 (all X101 (occurrence_of(X101,tptp0) -> (exists X102 exists X103 (root_occ(X102,X101) & (occurrence_of(X103,tptp3) | occurrence_of(X103,tptp2)) & leaf_occ(X103,X101) & next_subocc(X102,X103,tptp0) & occurrence_of(X102,tptp4))))) # label(sos_32) # label(axiom) # label(non_clause).  [assumption].
0.07/0.48	16 (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(X16,X17,X14) | X17 = X16 | min_precedes(X17,X16,X14))) # label(sos_04) # label(axiom) # label(non_clause).  [assumption].
0.07/0.48	17 (all X47 all X48 (-(exists X50 min_precedes(X47,X50,X48)) & (root(X47,X48) | (exists X49 min_precedes(X49,X47,X48))) <-> leaf(X47,X48))) # label(sos_15) # label(axiom) # label(non_clause).  [assumption].
0.07/0.48	18 (all X43 (legal(X43) -> arboreal(X43))) # label(sos_13) # label(axiom) # label(non_clause).  [assumption].
0.07/0.48	19 (all X41 (activity_occurrence(X41) -> (exists X42 (occurrence_of(X41,X42) & activity(X42))))) # label(sos_12) # label(axiom) # label(non_clause).  [assumption].
0.07/0.48	20 (all X25 all X26 (leaf(X25,X26) & -atomic(X26) -> (exists X27 (leaf_occ(X25,X27) & occurrence_of(X27,X26))))) # label(sos_07) # label(axiom) # label(non_clause).  [assumption].
0.07/0.48	21 (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.07/0.48	22 (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.07/0.48	23 (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.07/0.48	24 (all X90 all X91 all X92 all X93 (root_occ(X91,X92) & root_occ(X90,X92) & occurrence_of(X92,X93) -> X90 = X91)) # label(sos_29) # label(axiom) # label(non_clause).  [assumption].
0.07/0.48	25 (all X44 all X45 (atocc(X44,X45) <-> (exists X46 (occurrence_of(X44,X46) & atomic(X46) & subactivity(X45,X46))))) # label(sos_14) # label(axiom) # label(non_clause).  [assumption].
0.07/0.48	26 (all X35 all X36 all X37 (occurrence_of(X35,X37) & root_occ(X36,X35) -> -(exists X38 min_precedes(X38,X36,X37)))) # label(sos_10) # label(axiom) # label(non_clause).  [assumption].
0.07/0.48	27 (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.07/0.48	28 (all X104 all X105 (occurrence_of(X105,tptp0) & subactivity_occurrence(X104,X105) & -leaf_occ(X104,X105) & arboreal(X104) -> root_occ(X104,X105))) # label(sos_45) # label(axiom) # label(non_clause).  [assumption].
0.07/0.48	29 (all X39 all X40 (subactivity_occurrence(X39,X40) -> activity_occurrence(X40) & activity_occurrence(X39))) # label(sos_11) # label(axiom) # label(non_clause).  [assumption].
0.07/0.48	30 (all X72 all X73 all X74 (min_precedes(X72,X73,X74) -> precedes(X72,X73))) # label(sos_24) # label(axiom) # label(non_clause).  [assumption].
0.07/0.48	31 (all X65 all X66 all X67 (min_precedes(X65,X66,X67) -> -root(X66,X67))) # label(sos_22) # label(axiom) # label(non_clause).  [assumption].
0.07/0.48	32 (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.07/0.48	33 (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.07/0.48	34 (all X12 all X13 (occurrence_of(X13,X12) -> activity_occurrence(X13) & activity(X12))) # label(sos_03) # label(axiom) # label(non_clause).  [assumption].
0.07/0.48	35 (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.07/0.48	36 --(exists X109 occurrence_of(X109,tptp0)) # label(goals) # label(negated_conjecture) # label(non_clause).  [assumption].
0.07/0.48	
0.07/0.48	============================== end of process non-clausal formulas ===
0.07/0.48	
0.07/0.48	============================== PROCESS INITIAL CLAUSES ===============
0.07/0.48	
0.07/0.48	============================== PREDICATE ELIMINATION =================
0.07/0.48	37 leaf(A,f4(A,B)) | -leaf_occ(A,B) # label(sos_18) # label(axiom).  [clausify(8)].
0.07/0.48	38 -min_precedes(A,B,C) | -leaf(A,C) # label(sos_15) # label(axiom).  [clausify(17)].
0.07/0.48	Derived: -leaf_occ(A,B) | -min_precedes(A,C,f4(A,B)).  [resolve(37,a,38,b)].
0.07/0.48	39 -leaf(A,B) | atomic(B) | leaf_occ(A,f11(A,B)) # label(sos_07) # label(axiom).  [clausify(20)].
0.07/0.48	Derived: atomic(f4(A,B)) | leaf_occ(A,f11(A,f4(A,B))) | -leaf_occ(A,B).  [resolve(39,a,37,a)].
0.07/0.48	40 -leaf(A,B) | atomic(B) | occurrence_of(f11(A,B),B) # label(sos_07) # label(axiom).  [clausify(20)].
0.07/0.48	Derived: atomic(f4(A,B)) | occurrence_of(f11(A,f4(A,B)),f4(A,B)) | -leaf_occ(A,B).  [resolve(40,a,37,a)].
0.07/0.48	41 -leaf(A,B) | -subactivity_occurrence(A,C) | -occurrence_of(C,B) | leaf_occ(A,C) # label(sos_18) # label(axiom).  [clausify(8)].
0.07/0.48	Derived: -subactivity_occurrence(A,B) | -occurrence_of(B,f4(A,C)) | leaf_occ(A,B) | -leaf_occ(A,C).  [resolve(41,a,37,a)].
0.07/0.48	42 min_precedes(A,f8(A,B),B) | -root(A,B) | leaf(A,B) # label(sos_15) # label(axiom).  [clausify(17)].
0.07/0.48	Derived: min_precedes(A,f8(A,B),B) | -root(A,B) | -min_precedes(A,C,B).  [resolve(42,c,38,b)].
0.07/0.48	Derived: min_precedes(A,f8(A,B),B) | -root(A,B) | atomic(B) | leaf_occ(A,f11(A,B)).  [resolve(42,c,39,a)].
0.07/0.48	Derived: min_precedes(A,f8(A,B),B) | -root(A,B) | atomic(B) | occurrence_of(f11(A,B),B).  [resolve(42,c,40,a)].
0.07/0.48	Derived: min_precedes(A,f8(A,B),B) | -root(A,B) | -subactivity_occurrence(A,C) | -occurrence_of(C,B) | leaf_occ(A,C).  [resolve(42,c,41,a)].
0.07/0.48	43 root(A,B) | min_precedes(f9(A,B),A,B) | -leaf(A,B) # label(sos_15) # label(axiom).  [clausify(17)].
0.07/0.48	Derived: root(A,f4(A,B)) | min_precedes(f9(A,f4(A,B)),A,f4(A,B)) | -leaf_occ(A,B).  [resolve(43,c,37,a)].
0.07/0.48	44 min_precedes(A,f8(A,B),B) | -min_precedes(C,A,B) | leaf(A,B) # label(sos_15) # label(axiom).  [clausify(17)].
0.07/0.48	Derived: min_precedes(A,f8(A,B),B) | -min_precedes(C,A,B) | -min_precedes(A,D,B).  [resolve(44,c,38,b)].
0.07/0.48	Derived: min_precedes(A,f8(A,B),B) | -min_precedes(C,A,B) | atomic(B) | leaf_occ(A,f11(A,B)).  [resolve(44,c,39,a)].
0.07/0.48	Derived: min_precedes(A,f8(A,B),B) | -min_precedes(C,A,B) | atomic(B) | occurrence_of(f11(A,B),B).  [resolve(44,c,40,a)].
0.07/0.48	Derived: min_precedes(A,f8(A,B),B) | -min_precedes(C,A,B) | -subactivity_occurrence(A,D) | -occurrence_of(D,B) | leaf_occ(A,D).  [resolve(44,c,41,a)].
0.07/0.48	Derived: min_precedes(A,f8(A,B),B) | -min_precedes(C,A,B) | root(A,B) | min_precedes(f9(A,B),A,B).  [resolve(44,c,43,c)].
0.07/0.48	45 root(A,f3(A,B)) | -root_occ(A,B) # label(sos_19) # label(axiom).  [clausify(6)].
0.07/0.48	46 -min_precedes(A,B,C) | -root(B,C) # label(sos_22) # label(axiom).  [clausify(31)].
0.07/0.48	47 -root(A,B) | legal(A) # label(sos_17) # label(axiom).  [clausify(12)].
0.07/0.48	Derived: -root_occ(A,B) | -min_precedes(C,A,f3(A,B)).  [resolve(45,a,46,b)].
0.07/0.48	Derived: -root_occ(A,B) | legal(A).  [resolve(45,a,47,a)].
0.07/0.48	48 -root(A,B) | atocc(A,f14(B,A)) # label(sos_05) # label(axiom).  [clausify(32)].
0.07/0.48	Derived: atocc(A,f14(f3(A,B),A)) | -root_occ(A,B).  [resolve(48,a,45,a)].
0.07/0.48	49 -root(A,B) | subactivity(f14(B,A),B) # label(sos_05) # label(axiom).  [clausify(32)].
0.07/0.48	Derived: subactivity(f14(f3(A,B),A),f3(A,B)) | -root_occ(A,B).  [resolve(49,a,45,a)].
0.07/0.48	50 atomic(A) | -occurrence_of(B,A) | root(f12(A,B),A) # label(sos) # label(axiom).  [clausify(23)].
0.07/0.48	Derived: atomic(A) | -occurrence_of(B,A) | -min_precedes(C,f12(A,B),A).  [resolve(50,c,46,b)].
0.07/0.48	Derived: atomic(A) | -occurrence_of(B,A) | legal(f12(A,B)).  [resolve(50,c,47,a)].
0.07/0.48	Derived: atomic(A) | -occurrence_of(B,A) | atocc(f12(A,B),f14(A,f12(A,B))).  [resolve(50,c,48,a)].
0.07/0.48	Derived: atomic(A) | -occurrence_of(B,A) | subactivity(f14(A,f12(A,B)),A).  [resolve(50,c,49,a)].
0.07/0.48	51 -min_precedes(A,B,C) | root(f15(A,B,C),C) # label(sos_23) # label(axiom).  [clausify(33)].
0.07/0.48	Derived: -min_precedes(A,B,C) | -min_precedes(D,f15(A,B,C),C).  [resolve(51,b,46,b)].
0.07/0.48	Derived: -min_precedes(A,B,C) | legal(f15(A,B,C)).  [resolve(51,b,47,a)].
0.07/0.48	Derived: -min_precedes(A,B,C) | atocc(f15(A,B,C),f14(C,f15(A,B,C))).  [resolve(51,b,48,a)].
0.07/0.48	Derived: -min_precedes(A,B,C) | subactivity(f14(C,f15(A,B,C)),C).  [resolve(51,b,49,a)].
0.07/0.48	52 -subactivity_occurrence(A,B) | -root(A,C) | -occurrence_of(B,C) | root_occ(A,B) # label(sos_19) # label(axiom).  [clausify(6)].
0.07/0.48	Derived: -subactivity_occurrence(A,B) | -occurrence_of(B,f3(A,C)) | root_occ(A,B) | -root_occ(A,C).  [resolve(52,b,45,a)].
0.07/0.48	Derived: -subactivity_occurrence(f12(A,B),C) | -occurrence_of(C,A) | root_occ(f12(A,B),C) | atomic(A) | -occurrence_of(B,A).  [resolve(52,b,50,c)].
0.07/0.48	Derived: -subactivity_occurrence(f15(A,B,C),D) | -occurrence_of(D,C) | root_occ(f15(A,B,C),D) | -min_precedes(A,B,C).  [resolve(52,b,51,b)].
0.07/0.48	53 min_precedes(A,f8(A,B),B) | -root(A,B) | -min_precedes(A,C,B).  [resolve(42,c,38,b)].
0.07/0.48	Derived: min_precedes(A,f8(A,f3(A,B)),f3(A,B)) | -min_precedes(A,C,f3(A,B)) | -root_occ(A,B).  [resolve(53,b,45,a)].
0.07/0.48	Derived: min_precedes(f12(A,B),f8(f12(A,B),A),A) | -min_precedes(f12(A,B),C,A) | atomic(A) | -occurrence_of(B,A).  [resolve(53,b,50,c)].
0.07/0.48	Derived: min_precedes(f15(A,B,C),f8(f15(A,B,C),C),C) | -min_precedes(f15(A,B,C),D,C) | -min_precedes(A,B,C).  [resolve(53,b,51,b)].
0.07/0.48	54 min_precedes(A,f8(A,B),B) | -root(A,B) | atomic(B) | leaf_occ(A,f11(A,B)).  [resolve(42,c,39,a)].
0.07/0.48	Derived: min_precedes(A,f8(A,f3(A,B)),f3(A,B)) | atomic(f3(A,B)) | leaf_occ(A,f11(A,f3(A,B))) | -root_occ(A,B).  [resolve(54,b,45,a)].
0.07/0.48	Derived: min_precedes(f12(A,B),f8(f12(A,B),A),A) | atomic(A) | leaf_occ(f12(A,B),f11(f12(A,B),A)) | atomic(A) | -occurrence_of(B,A).  [resolve(54,b,50,c)].
0.07/0.48	Derived: min_precedes(f15(A,B,C),f8(f15(A,B,C),C),C) | atomic(C) | leaf_occ(f15(A,B,C),f11(f15(A,B,C),C)) | -min_precedes(A,B,C).  [resolve(54,b,51,b)].
0.07/0.48	55 min_precedes(A,f8(A,B),B) | -root(A,B) | atomic(B) | occurrence_of(f11(A,B),B).  [resolve(42,c,40,a)].
0.07/0.48	Derived: min_precedes(A,f8(A,f3(A,B)),f3(A,B)) | atomic(f3(A,B)) | occurrence_of(f11(A,f3(A,B)),f3(A,B)) | -root_occ(A,B).  [resolve(55,b,45,a)].
0.07/0.48	Derived: min_precedes(f12(A,B),f8(f12(A,B),A),A) | atomic(A) | occurrence_of(f11(f12(A,B),A),A) | atomic(A) | -occurrence_of(B,A).  [resolve(55,b,50,c)].
0.07/0.48	Derived: min_precedes(f15(A,B,C),f8(f15(A,B,C),C),C) | atomic(C) | occurrence_of(f11(f15(A,B,C),C),C) | -min_precedes(A,B,C).  [resolve(55,b,51,b)].
0.07/0.48	56 min_precedes(A,f8(A,B),B) | -root(A,B) | -subactivity_occurrence(A,C) | -occurrence_of(C,B) | leaf_occ(A,C).  [resolve(42,c,41,a)].
0.07/0.48	Derived: min_precedes(A,f8(A,f3(A,B)),f3(A,B)) | -subactivity_occurrence(A,C) | -occurrence_of(C,f3(A,B)) | leaf_occ(A,C) | -root_occ(A,B).  [resolve(56,b,45,a)].
0.07/0.48	Derived: min_precedes(f12(A,B),f8(f12(A,B),A),A) | -subactivity_occurrence(f12(A,B),C) | -occurrence_of(C,A) | leaf_occ(f12(A,B),C) | atomic(A) | -occurrence_of(B,A).  [resolve(56,b,50,c)].
0.07/0.48	Derived: min_precedes(f15(A,B,C),f8(f15(A,B,C),C),C) | -subactivity_occurrence(f15(A,B,C),D) | -occurrence_of(D,C) | leaf_occ(f15(A,B,C),D) | -min_precedes(A,B,C).  [resolve(56,b,51,b)].
0.07/0.48	57 root(A,f4(A,B)) | min_precedes(f9(A,f4(A,B)),A,f4(A,B)) | -leaf_occ(A,B).  [resolve(43,c,37,a)].
0.07/0.48	Derived: min_precedes(f9(A,f4(A,B)),A,f4(A,B)) | -leaf_occ(A,B) | -min_precedes(C,A,f4(A,B)).  [resolve(57,a,46,b)].
0.07/0.48	Derived: min_precedes(f9(A,f4(A,B)),A,f4(A,B)) | -leaf_occ(A,B) | legal(A).  [resolve(57,a,47,a)].
0.07/0.48	Derived: min_precedes(f9(A,f4(A,B)),A,f4(A,B)) | -leaf_occ(A,B) | atocc(A,f14(f4(A,B),A)).  [resolve(57,a,48,a)].
0.07/0.48	Derived: min_precedes(f9(A,f4(A,B)),A,f4(A,B)) | -leaf_occ(A,B) | subactivity(f14(f4(A,B),A),f4(A,B)).  [resolve(57,a,49,a)].
0.07/0.48	Derived: min_precedes(f9(A,f4(A,B)),A,f4(A,B)) | -leaf_occ(A,B) | -subactivity_occurrence(A,C) | -occurrence_of(C,f4(A,B)) | root_occ(A,C).  [resolve(57,a,52,b)].
0.07/0.48	Derived: min_precedes(f9(A,f4(A,B)),A,f4(A,B)) | -leaf_occ(A,B) | min_precedes(A,f8(A,f4(A,B)),f4(A,B)) | -min_precedes(A,C,f4(A,B)).  [resolve(57,a,53,b)].
0.07/0.48	Derived: min_precedes(f9(A,f4(A,B)),A,f4(A,B)) | -leaf_occ(A,B) | min_precedes(A,f8(A,f4(A,B)),f4(A,B)) | atomic(f4(A,B)) | leaf_occ(A,f11(A,f4(A,B))).  [resolve(57,a,54,b)].
0.07/0.48	Derived: min_precedes(f9(A,f4(A,B)),A,f4(A,B)) | -leaf_occ(A,B) | min_precedes(A,f8(A,f4(A,B)),f4(A,B)) | atomic(f4(A,B)) | occurrence_of(f11(A,f4(A,B)),f4(A,B)).  [resolve(57,a,55,b)].
0.07/0.48	Derived: min_precedes(f9(A,f4(A,B)),A,f4(A,B)) | -leaf_occ(A,B) | min_precedes(A,f8(A,f4(A,B)),f4(A,B)) | -subactivity_occurrence(A,C) | -occurrence_of(C,f4(A,B)) | leaf_occ(A,C).  [resolve(57,a,56,b)].
0.07/0.48	58 min_precedes(A,f8(A,B),B) | -min_precedes(C,A,B) | root(A,B) | min_precedes(f9(A,B),A,B).  [resolve(44,c,43,c)].
0.07/0.48	Derived: min_precedes(A,f8(A,B),B) | -min_precedes(C,A,B) | min_precedes(f9(A,B),A,B) | -min_precedes(D,A,B).  [resolve(58,c,46,b)].
0.07/0.48	59 -occurrence_of(A,tptp0) | next_subocc(f6(A),f7(A),tptp0) # label(sos_32) # label(axiom).  [clausify(15)].
0.07/0.48	60 -next_subocc(A,B,C) | -min_precedes(A,D,C) | -min_precedes(D,B,C) # label(sos_26) # label(axiom).  [clausify(4)].
0.07/0.48	61 -next_subocc(A,B,C) | arboreal(B) # label(sos_25) # label(axiom).  [clausify(14)].
0.07/0.48	62 -next_subocc(A,B,C) | arboreal(A) # label(sos_25) # label(axiom).  [clausify(14)].
0.07/0.48	63 -next_subocc(A,B,C) | min_precedes(A,B,C) # label(sos_26) # label(axiom).  [clausify(4)].
0.07/0.48	Derived: -occurrence_of(A,tptp0) | -min_precedes(f6(A),B,tptp0) | -min_precedes(B,f7(A),tptp0).  [resolve(59,b,60,a)].
0.07/0.48	Derived: -occurrence_of(A,tptp0) | arboreal(f7(A)).  [resolve(59,b,61,a)].
0.07/0.48	Derived: -occurrence_of(A,tptp0) | arboreal(f6(A)).  [resolve(59,b,62,a)].
0.07/0.48	Derived: -occurrence_of(A,tptp0) | min_precedes(f6(A),f7(A),tptp0).  [resolve(59,b,63,a)].
0.07/0.48	64 next_subocc(A,B,C) | -min_precedes(A,B,C) | min_precedes(A,f2(A,B,C),C) # label(sos_26) # label(axiom).  [clausify(4)].
0.07/0.48	Derived: -min_precedes(A,B,C) | min_precedes(A,f2(A,B,C),C) | -min_precedes(A,D,C) | -min_precedes(D,B,C).  [resolve(64,a,60,a)].
0.07/0.48	Derived: -min_precedes(A,B,C) | min_precedes(A,f2(A,B,C),C) | arboreal(B).  [resolve(64,a,61,a)].
0.07/0.48	Derived: -min_precedes(A,B,C) | min_precedes(A,f2(A,B,C),C) | arboreal(A).  [resolve(64,a,62,a)].
0.07/0.48	65 next_subocc(A,B,C) | -min_precedes(A,B,C) | min_precedes(f2(A,B,C),B,C) # label(sos_26) # label(axiom).  [clausify(4)].
0.07/0.48	Derived: -min_precedes(A,B,C) | min_precedes(f2(A,B,C),B,C) | -min_precedes(A,D,C) | -min_precedes(D,B,C).  [resolve(65,a,60,a)].
0.07/0.48	Derived: -min_precedes(A,B,C) | min_precedes(f2(A,B,C),B,C) | arboreal(B).  [resolve(65,a,61,a)].
0.07/0.48	Derived: -min_precedes(A,B,C) | min_precedes(f2(A,B,C),B,C) | arboreal(A).  [resolve(65,a,62,a)].
0.07/0.48	66 -arboreal(A) | leaf_occ(A,B) | -subactivity_occurrence(A,B) | -occurrence_of(B,tptp0) | next_subocc(A,f5(A,B),tptp0) # label(sos_46) # label(axiom).  [clausify(10)].
0.07/0.48	Derived: -arboreal(A) | leaf_occ(A,B) | -subactivity_occurrence(A,B) | -occurrence_of(B,tptp0) | -min_precedes(A,C,tptp0) | -min_precedes(C,f5(A,B),tptp0).  [resolve(66,e,60,a)].
0.07/0.48	Derived: -arboreal(A) | leaf_occ(A,B) | -subactivity_occurrence(A,B) | -occurrence_of(B,tptp0) | arboreal(f5(A,B)).  [resolve(66,e,61,a)].
0.07/0.48	Derived: -arboreal(A) | leaf_occ(A,B) | -subactivity_occurrence(A,B) | -occurrence_of(B,tptp0) | min_precedes(A,f5(A,B),tptp0).  [resolve(66,e,63,a)].
0.07/0.48	67 -precedes(A,B) | legal(B) # label(sos_21) # label(axiom).  [clausify(1)].
0.07/0.48	68 -legal(A) | arboreal(A) # label(sos_13) # label(axiom).  [clausify(18)].
0.07/0.48	Derived: -precedes(A,B) | arboreal(B).  [resolve(67,b,68,a)].
0.07/0.48	69 precedes(A,B) | -earlier(A,B) | -legal(B) # label(sos_21) # label(axiom).  [clausify(1)].
0.07/0.48	Derived: precedes(A,B) | -earlier(A,B) | -precedes(C,B).  [resolve(69,c,67,b)].
0.07/0.48	70 -root_occ(A,B) | legal(A).  [resolve(45,a,47,a)].
0.07/0.48	Derived: -root_occ(A,B) | arboreal(A).  [resolve(70,b,68,a)].
0.07/0.49	Derived: -root_occ(A,B) | precedes(C,A) | -earlier(C,A).  [resolve(70,b,69,c)].
0.07/0.49	71 atomic(A) | -occurrence_of(B,A) | legal(f12(A,B)).  [resolve(50,c,47,a)].
0.07/0.49	Derived: atomic(A) | -occurrence_of(B,A) | arboreal(f12(A,B)).  [resolve(71,c,68,a)].
0.07/0.49	Derived: atomic(A) | -occurrence_of(B,A) | precedes(C,f12(A,B)) | -earlier(C,f12(A,B)).  [resolve(71,c,69,c)].
0.07/0.49	72 -min_precedes(A,B,C) | legal(f15(A,B,C)).  [resolve(51,b,47,a)].
0.07/0.49	Derived: -min_precedes(A,B,C) | arboreal(f15(A,B,C)).  [resolve(72,b,68,a)].
0.07/0.49	Derived: -min_precedes(A,B,C) | precedes(D,f15(A,B,C)) | -earlier(D,f15(A,B,C)).  [resolve(72,b,69,c)].
0.07/0.49	73 min_precedes(f9(A,f4(A,B)),A,f4(A,B)) | -leaf_occ(A,B) | legal(A).  [resolve(57,a,47,a)].
0.07/0.49	Derived: min_precedes(f9(A,f4(A,B)),A,f4(A,B)) | -leaf_occ(A,B) | arboreal(A).  [resolve(73,c,68,a)].
0.07/0.49	Derived: min_precedes(f9(A,f4(A,B)),A,f4(A,B)) | -leaf_occ(A,B) | precedes(C,A) | -earlier(C,A).  [resolve(73,c,69,c)].
0.07/0.49	74 -activity_occurrence(A) | occurrence_of(A,f10(A)) # label(sos_12) # label(axiom).  [clausify(19)].
0.07/0.49	75 -subactivity_occurrence(A,B) | activity_occurrence(B) # label(sos_11) # label(axiom).  [clausify(29)].
0.07/0.49	76 -subactivity_occurrence(A,B) | activity_occurrence(A) # label(sos_11) # label(axiom).  [clausify(29)].
0.07/0.49	77 -occurrence_of(A,B) | activity_occurrence(A) # label(sos_03) # label(axiom).  [clausify(34)].
0.07/0.49	Derived: occurrence_of(A,f10(A)) | -subactivity_occurrence(B,A).  [resolve(74,a,75,b)].
0.07/0.49	Derived: occurrence_of(A,f10(A)) | -subactivity_occurrence(A,B).  [resolve(74,a,76,b)].
0.07/0.49	Derived: occurrence_of(A,f10(A)) | -occurrence_of(A,B).  [resolve(74,a,77,b)].
0.07/0.49	78 atocc(A,B) | -occurrence_of(A,C) | -atomic(C) | -subactivity(B,C) # label(sos_14) # label(axiom).  [clausify(25)].
0.07/0.49	79 -atocc(A,B) | atomic(f13(A,B)) # label(sos_14) # label(axiom).  [clausify(25)].
0.07/0.49	80 -atocc(A,B) | occurrence_of(A,f13(A,B)) # label(sos_14) # label(axiom).  [clausify(25)].
0.07/0.49	81 -atocc(A,B) | subactivity(B,f13(A,B)) # label(sos_14) # label(axiom).  [clausify(25)].
0.07/0.49	Derived: -occurrence_of(A,B) | -atomic(B) | -subactivity(C,B) | atomic(f13(A,C)).  [resolve(78,a,79,a)].
0.07/0.49	Derived: -occurrence_of(A,B) | -atomic(B) | -subactivity(C,B) | occurrence_of(A,f13(A,C)).  [resolve(78,a,80,a)].
0.07/0.49	Derived: -occurrence_of(A,B) | -atomic(B) | -subactivity(C,B) | subactivity(C,f13(A,C)).  [resolve(78,a,81,a)].
0.07/0.49	82 atocc(A,f14(f3(A,B),A)) | -root_occ(A,B).  [resolve(48,a,45,a)].
0.07/0.49	Derived: -root_occ(A,B) | atomic(f13(A,f14(f3(A,B),A))).  [resolve(82,a,79,a)].
0.07/0.49	Derived: -root_occ(A,B) | occurrence_of(A,f13(A,f14(f3(A,B),A))).  [resolve(82,a,80,a)].
0.07/0.49	Derived: -root_occ(A,B) | subactivity(f14(f3(A,B),A),f13(A,f14(f3(A,B),A))).  [resolve(82,a,81,a)].
0.07/0.49	83 atomic(A) | -occurrence_of(B,A) | atocc(f12(A,B),f14(A,f12(A,B))).  [resolve(50,c,48,a)].
0.07/0.49	Derived: atomic(A) | -occurrence_of(B,A) | atomic(f13(f12(A,B),f14(A,f12(A,B)))).  [resolve(83,c,79,a)].
0.07/0.49	Derived: atomic(A) | -occurrence_of(B,A) | occurrence_of(f12(A,B),f13(f12(A,B),f14(A,f12(A,B)))).  [resolve(83,c,80,a)].
0.07/0.49	Derived: atomic(A) | -occurrence_of(B,A) | subactivity(f14(A,f12(A,B)),f13(f12(A,B),f14(A,f12(A,B)))).  [resolve(83,c,81,a)].
0.07/0.49	84 -min_precedes(A,B,C) | atocc(f15(A,B,C),f14(C,f15(A,B,C))).  [resolve(51,b,48,a)].
0.07/0.49	Derived: -min_precedes(A,B,C) | atomic(f13(f15(A,B,C),f14(C,f15(A,B,C)))).  [resolve(84,b,79,a)].
0.07/0.49	Derived: -min_precedes(A,B,C) | occurrence_of(f15(A,B,C),f13(f15(A,B,C),f14(C,f15(A,B,C)))).  [resolve(84,b,80,a)].
0.07/0.49	Derived: -min_precedes(A,B,C) | subactivity(f14(C,f15(A,B,C)),f13(f15(A,B,C),f14(C,f15(A,B,C)))).  [resolve(84,b,81,a)].
0.07/0.49	85 min_precedes(f9(A,f4(A,B)),A,f4(A,B)) | -leaf_occ(A,B) | atocc(A,f14(f4(A,B),A)).  [resolve(57,a,48,a)].
0.07/0.49	Derived: min_precedes(f9(A,f4(A,B)),A,f4(A,B)) | -leaf_occ(A,B) | atomic(f13(A,f14(f4(A,B),A))).  [resolve(85,c,79,a)].
0.07/0.49	Derived: min_precedes(f9(A,f4(A,B)),A,f4(A,B)) | -leaf_occ(A,B) | occurrence_of(A,f13(A,f14(f4(A,B),A))).  [resolve(85,c,80,a)].
0.07/0.49	Derived: min_precedes(f9(A,f4(A,B)),A,f4(A,B)) | -leaf_occ(A,B) | subactivity(f14(f4(A,B),A),f13(A,f14(f4(A,B),A))).  [resolve(85,c,81,a)].
0.07/0.49	
0.07/0.49	============================== end predicate elimination =============
0.07/0.49	
0.07/0.49	Auto_denials:  (non-Horn, no changes).
2.72/2.94	
2.72/2.94	Term ordering decisions:
2.72/2.94	Function symbol KB weights:  tptp0=1. tptp1=1. tptp2=1. tptp3=1. tptp4=1. c1=1. f3=1. f4=1. f5=1. f8=1. f9=1. f11=1. f12=1. f13=1. f14=1. f6=1. f7=1. f10=1. f1=1. f2=1. f15=1.
2.72/2.94	
2.72/2.94	============================== end of process initial clauses ========
2.72/2.94	
2.72/2.94	============================== CLAUSES FOR SEARCH ====================
2.72/2.94	
2.72/2.94	============================== end of clauses for search =============
2.72/2.94	
2.72/2.94	============================== SEARCH ================================
2.72/2.94	
2.72/2.94	% Starting search at 0.02 seconds.
2.72/2.94	
2.72/2.94	Low Water (keep): wt=96.000, iters=3448
2.72/2.94	
2.72/2.94	Low Water (keep): wt=93.000, iters=3505
2.72/2.94	
2.72/2.94	Low Water (keep): wt=89.000, iters=3369
2.72/2.94	
2.72/2.94	Low Water (keep): wt=88.000, iters=3350
2.72/2.94	
2.72/2.94	Low Water (keep): wt=84.000, iters=3560
2.72/2.94	
2.72/2.94	Low Water (keep): wt=80.000, iters=3436
2.72/2.94	
2.72/2.94	Low Water (keep): wt=78.000, iters=3366
2.72/2.94	
2.72/2.94	============================== PROOF =================================
2.72/2.94	% SZS status Theorem
2.72/2.94	% SZS output start Refutation
2.72/2.94	
2.72/2.94	% Proof 1 at 2.46 (+ 0.02) seconds.
2.72/2.94	% Length of proof is 103.
2.72/2.94	% Level of proof is 21.
2.72/2.94	% Maximum clause weight is 52.000.
2.72/2.94	% Given clauses 2830.
2.72/2.94	
2.72/2.94	3 (all X21 all X22 all X23 (min_precedes(X22,X23,X21) -> (exists X24 (occurrence_of(X24,X21) & subactivity_occurrence(X23,X24) & subactivity_occurrence(X22,X24))))) # label(sos_06) # label(axiom) # label(non_clause).  [assumption].
2.72/2.94	4 (all X78 all X79 all X80 (next_subocc(X78,X79,X80) <-> min_precedes(X78,X79,X80) & -(exists X81 (min_precedes(X78,X81,X80) & min_precedes(X81,X79,X80))))) # label(sos_26) # label(axiom) # label(non_clause).  [assumption].
2.72/2.94	6 (all X58 all X59 ((exists X60 (subactivity_occurrence(X58,X59) & root(X58,X60) & occurrence_of(X59,X60))) <-> root_occ(X58,X59))) # label(sos_19) # label(axiom) # label(non_clause).  [assumption].
2.72/2.94	8 (all X55 all X56 ((exists X57 (leaf(X55,X57) & subactivity_occurrence(X55,X56) & occurrence_of(X56,X57))) <-> leaf_occ(X55,X56))) # label(sos_18) # label(axiom) # label(non_clause).  [assumption].
2.72/2.94	10 (all X106 all X107 (arboreal(X106) & -leaf_occ(X106,X107) & subactivity_occurrence(X106,X107) & occurrence_of(X107,tptp0) -> (exists X108 (next_subocc(X106,X108,tptp0) & occurrence_of(X108,tptp1))))) # label(sos_46) # label(axiom) # label(non_clause).  [assumption].
2.72/2.94	13 (all X86 all X87 all X88 all X89 (occurrence_of(X88,X89) & leaf_occ(X86,X88) & leaf_occ(X87,X88) & -atomic(X89) -> X87 = X86)) # label(sos_28) # label(axiom) # label(non_clause).  [assumption].
2.72/2.94	14 (all X75 all X76 all X77 (next_subocc(X75,X76,X77) -> arboreal(X76) & arboreal(X75))) # label(sos_25) # label(axiom) # label(non_clause).  [assumption].
2.72/2.94	15 (all X101 (occurrence_of(X101,tptp0) -> (exists X102 exists X103 (root_occ(X102,X101) & (occurrence_of(X103,tptp3) | occurrence_of(X103,tptp2)) & leaf_occ(X103,X101) & next_subocc(X102,X103,tptp0) & occurrence_of(X102,tptp4))))) # label(sos_32) # label(axiom) # label(non_clause).  [assumption].
2.72/2.94	17 (all X47 all X48 (-(exists X50 min_precedes(X47,X50,X48)) & (root(X47,X48) | (exists X49 min_precedes(X49,X47,X48))) <-> leaf(X47,X48))) # label(sos_15) # label(axiom) # label(non_clause).  [assumption].
2.72/2.94	19 (all X41 (activity_occurrence(X41) -> (exists X42 (occurrence_of(X41,X42) & activity(X42))))) # label(sos_12) # label(axiom) # label(non_clause).  [assumption].
2.72/2.94	20 (all X25 all X26 (leaf(X25,X26) & -atomic(X26) -> (exists X27 (leaf_occ(X25,X27) & occurrence_of(X27,X26))))) # label(sos_07) # label(axiom) # label(non_clause).  [assumption].
2.72/2.94	21 (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.72/2.94	26 (all X35 all X36 all X37 (occurrence_of(X35,X37) & root_occ(X36,X35) -> -(exists X38 min_precedes(X38,X36,X37)))) # label(sos_10) # label(axiom) # label(non_clause).  [assumption].
2.72/2.94	28 (all X104 all X105 (occurrence_of(X105,tptp0) & subactivity_occurrence(X104,X105) & -leaf_occ(X104,X105) & arboreal(X104) -> root_occ(X104,X105))) # label(sos_45) # label(axiom) # label(non_clause).  [assumption].
2.72/2.94	29 (all X39 all X40 (subactivity_occurrence(X39,X40) -> activity_occurrence(X40) & activity_occurrence(X39))) # label(sos_11) # label(axiom) # label(non_clause).  [assumption].
2.72/2.94	34 (all X12 all X13 (occurrence_of(X13,X12) -> activity_occurrence(X13) & activity(X12))) # label(sos_03) # label(axiom) # label(non_clause).  [assumption].
2.72/2.94	35 (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.72/2.94	36 --(exists X109 occurrence_of(X109,tptp0)) # label(goals) # label(negated_conjecture) # label(non_clause).  [assumption].
2.72/2.94	37 leaf(A,f4(A,B)) | -leaf_occ(A,B) # label(sos_18) # label(axiom).  [clausify(8)].
2.72/2.94	39 -leaf(A,B) | atomic(B) | leaf_occ(A,f11(A,B)) # label(sos_07) # label(axiom).  [clausify(20)].
2.72/2.94	40 -leaf(A,B) | atomic(B) | occurrence_of(f11(A,B),B) # label(sos_07) # label(axiom).  [clausify(20)].
2.72/2.94	44 min_precedes(A,f8(A,B),B) | -min_precedes(C,A,B) | leaf(A,B) # label(sos_15) # label(axiom).  [clausify(17)].
2.72/2.94	59 -occurrence_of(A,tptp0) | next_subocc(f6(A),f7(A),tptp0) # label(sos_32) # label(axiom).  [clausify(15)].
2.72/2.94	61 -next_subocc(A,B,C) | arboreal(B) # label(sos_25) # label(axiom).  [clausify(14)].
2.72/2.94	62 -next_subocc(A,B,C) | arboreal(A) # label(sos_25) # label(axiom).  [clausify(14)].
2.72/2.94	63 -next_subocc(A,B,C) | min_precedes(A,B,C) # label(sos_26) # label(axiom).  [clausify(4)].
2.72/2.94	66 -arboreal(A) | leaf_occ(A,B) | -subactivity_occurrence(A,B) | -occurrence_of(B,tptp0) | next_subocc(A,f5(A,B),tptp0) # label(sos_46) # label(axiom).  [clausify(10)].
2.72/2.94	74 -activity_occurrence(A) | occurrence_of(A,f10(A)) # label(sos_12) # label(axiom).  [clausify(19)].
2.72/2.94	76 -subactivity_occurrence(A,B) | activity_occurrence(A) # label(sos_11) # label(axiom).  [clausify(29)].
2.72/2.94	77 -occurrence_of(A,B) | activity_occurrence(A) # label(sos_03) # label(axiom).  [clausify(34)].
2.72/2.94	90 occurrence_of(c1,tptp0) # label(goals) # label(negated_conjecture).  [clausify(36)].
2.72/2.94	91 -atomic(tptp0) # label(sos_34) # label(axiom).  [assumption].
2.72/2.94	97 tptp1 != tptp2 # label(sos_43) # label(axiom).  [assumption].
2.72/2.94	98 tptp2 != tptp1.  [copy(97),flip(a)].
2.72/2.94	99 tptp1 != tptp3 # label(sos_42) # label(axiom).  [assumption].
2.72/2.94	100 tptp3 != tptp1.  [copy(99),flip(a)].
2.72/2.94	103 -occurrence_of(A,B) | -root_occ(C,A) | -min_precedes(D,C,B) # label(sos_10) # label(axiom).  [clausify(26)].
2.72/2.94	104 -leaf_occ(A,B) | -occurrence_of(B,C) | -min_precedes(A,D,C) # label(sos_09) # label(axiom).  [clausify(35)].
2.72/2.94	106 subactivity_occurrence(A,B) | -root_occ(A,B) # label(sos_19) # label(axiom).  [clausify(6)].
2.72/2.94	107 subactivity_occurrence(A,B) | -leaf_occ(A,B) # label(sos_18) # label(axiom).  [clausify(8)].
2.72/2.94	110 -occurrence_of(A,tptp0) | root_occ(f6(A),A) # label(sos_32) # label(axiom).  [clausify(15)].
2.72/2.94	111 -occurrence_of(A,tptp0) | leaf_occ(f7(A),A) # label(sos_32) # label(axiom).  [clausify(15)].
2.72/2.94	115 occurrence_of(A,f4(B,A)) | -leaf_occ(B,A) # label(sos_18) # label(axiom).  [clausify(8)].
2.72/2.94	116 -occurrence_of(A,B) | -occurrence_of(A,C) | B = C # label(sos_08) # label(axiom).  [clausify(21)].
2.72/2.94	118 -min_precedes(A,B,C) | occurrence_of(f1(C,A,B),C) # label(sos_06) # label(axiom).  [clausify(3)].
2.72/2.94	119 -min_precedes(A,B,C) | subactivity_occurrence(B,f1(C,A,B)) # label(sos_06) # label(axiom).  [clausify(3)].
2.72/2.94	122 -occurrence_of(A,tptp0) | occurrence_of(f7(A),tptp3) | occurrence_of(f7(A),tptp2) # label(sos_32) # label(axiom).  [clausify(15)].
2.72/2.94	126 -occurrence_of(A,B) | -leaf_occ(C,A) | -leaf_occ(D,A) | atomic(B) | D = C # label(sos_28) # label(axiom).  [clausify(13)].
2.72/2.94	127 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | leaf_occ(B,A) | -arboreal(B) | root_occ(B,A) # label(sos_45) # label(axiom).  [clausify(28)].
2.72/2.94	129 -arboreal(A) | leaf_occ(A,B) | -subactivity_occurrence(A,B) | -occurrence_of(B,tptp0) | occurrence_of(f5(A,B),tptp1) # label(sos_46) # label(axiom).  [clausify(10)].
2.72/2.94	135 atomic(f4(A,B)) | occurrence_of(f11(A,f4(A,B)),f4(A,B)) | -leaf_occ(A,B).  [resolve(40,a,37,a)].
2.72/2.94	138 min_precedes(A,f8(A,B),B) | -min_precedes(C,A,B) | atomic(B) | leaf_occ(A,f11(A,B)).  [resolve(44,c,39,a)].
2.72/2.94	139 min_precedes(A,f8(A,B),B) | -min_precedes(C,A,B) | atomic(B) | occurrence_of(f11(A,B),B).  [resolve(44,c,40,a)].
2.72/2.94	170 -occurrence_of(A,tptp0) | arboreal(f6(A)).  [resolve(59,b,62,a)].
2.72/2.94	171 -occurrence_of(A,tptp0) | min_precedes(f6(A),f7(A),tptp0).  [resolve(59,b,63,a)].
2.72/2.94	179 -arboreal(A) | leaf_occ(A,B) | -subactivity_occurrence(A,B) | -occurrence_of(B,tptp0) | arboreal(f5(A,B)).  [resolve(66,e,61,a)].
2.72/2.94	180 -arboreal(A) | leaf_occ(A,B) | -subactivity_occurrence(A,B) | -occurrence_of(B,tptp0) | min_precedes(A,f5(A,B),tptp0).  [resolve(66,e,63,a)].
2.72/2.94	192 occurrence_of(A,f10(A)) | -subactivity_occurrence(A,B).  [resolve(74,a,76,b)].
2.72/2.94	193 occurrence_of(A,f10(A)) | -occurrence_of(A,B).  [resolve(74,a,77,b)].
2.72/2.94	222 root_occ(f6(c1),c1).  [resolve(110,a,90,a)].
2.72/2.94	232 arboreal(f6(c1)).  [resolve(170,a,90,a)].
2.72/2.94	233 min_precedes(f6(c1),f7(c1),tptp0).  [resolve(171,a,90,a)].
2.72/2.94	249 subactivity_occurrence(f6(c1),c1).  [resolve(222,a,106,b)].
2.72/2.94	279 leaf_occ(f6(c1),c1) | min_precedes(f6(c1),f5(f6(c1),c1),tptp0).  [resolve(249,a,180,c),unit_del(a,232),unit_del(c,90)].
2.72/2.94	280 leaf_occ(f6(c1),c1) | arboreal(f5(f6(c1),c1)).  [resolve(249,a,179,c),unit_del(a,232),unit_del(c,90)].
2.72/2.94	284 leaf_occ(f6(c1),c1) | occurrence_of(f5(f6(c1),c1),tptp1).  [resolve(249,a,129,c),unit_del(a,232),unit_del(c,90)].
2.72/2.94	347 -leaf_occ(f6(c1),A) | -occurrence_of(A,tptp0).  [resolve(233,a,104,c)].
2.72/2.94	582 arboreal(f5(f6(c1),c1)).  [resolve(280,a,347,a),unit_del(b,90)].
2.72/2.94	604 leaf_occ(f6(c1),c1) | min_precedes(f5(f6(c1),c1),f8(f5(f6(c1),c1),tptp0),tptp0) | occurrence_of(f11(f5(f6(c1),c1),tptp0),tptp0).  [resolve(279,b,139,b),unit_del(c,91)].
2.72/2.94	605 leaf_occ(f6(c1),c1) | min_precedes(f5(f6(c1),c1),f8(f5(f6(c1),c1),tptp0),tptp0) | leaf_occ(f5(f6(c1),c1),f11(f5(f6(c1),c1),tptp0)).  [resolve(279,b,138,b),unit_del(c,91)].
2.72/2.94	613 leaf_occ(f6(c1),c1) | subactivity_occurrence(f5(f6(c1),c1),f1(tptp0,f6(c1),f5(f6(c1),c1))).  [resolve(279,b,119,a)].
2.72/2.94	614 leaf_occ(f6(c1),c1) | occurrence_of(f1(tptp0,f6(c1),f5(f6(c1),c1)),tptp0).  [resolve(279,b,118,a)].
2.72/2.94	616 leaf_occ(f6(c1),c1) | -occurrence_of(A,tptp0) | -root_occ(f5(f6(c1),c1),A).  [resolve(279,b,103,c)].
2.72/2.94	719 occurrence_of(f5(f6(c1),c1),tptp1).  [resolve(284,a,347,a),unit_del(b,90)].
2.72/2.94	720 occurrence_of(f5(f6(c1),c1),f10(f5(f6(c1),c1))).  [resolve(719,a,193,b)].
2.72/2.94	721 -occurrence_of(f5(f6(c1),c1),A) | tptp1 = A.  [resolve(719,a,116,b),flip(b)].
2.72/2.94	807 f10(f5(f6(c1),c1)) = tptp1.  [resolve(720,a,721,a),flip(a)].
2.72/2.94	1635 occurrence_of(f1(tptp0,f6(c1),f5(f6(c1),c1)),tptp0).  [resolve(614,a,347,a),unit_del(b,90)].
2.72/2.94	2375 leaf_occ(f6(c1),c1) | occurrence_of(f11(f5(f6(c1),c1),tptp0),tptp0) | -leaf_occ(f5(f6(c1),c1),A) | -occurrence_of(A,tptp0).  [resolve(604,b,104,c)].
2.72/2.94	2424 leaf_occ(f6(c1),c1) | leaf_occ(f5(f6(c1),c1),f11(f5(f6(c1),c1),tptp0)) | -leaf_occ(f5(f6(c1),c1),A) | -occurrence_of(A,tptp0).  [resolve(605,b,104,c)].
2.72/2.94	2445 leaf_occ(f6(c1),c1) | leaf_occ(f5(f6(c1),c1),f1(tptp0,f6(c1),f5(f6(c1),c1))) | root_occ(f5(f6(c1),c1),f1(tptp0,f6(c1),f5(f6(c1),c1))).  [resolve(613,b,127,b),unit_del(b,1635),unit_del(d,582)].
2.72/2.94	9655 leaf_occ(f6(c1),c1) | leaf_occ(f5(f6(c1),c1),f1(tptp0,f6(c1),f5(f6(c1),c1))).  [resolve(2445,c,616,c),merge(c),unit_del(c,1635)].
2.72/2.94	9659 leaf_occ(f6(c1),c1) | leaf_occ(f5(f6(c1),c1),f11(f5(f6(c1),c1),tptp0)).  [resolve(9655,b,2424,c),merge(b),unit_del(c,1635)].
2.72/2.94	9660 leaf_occ(f6(c1),c1) | occurrence_of(f11(f5(f6(c1),c1),tptp0),tptp0).  [resolve(9655,b,2375,c),merge(b),unit_del(c,1635)].
2.72/2.94	9675 occurrence_of(f11(f5(f6(c1),c1),tptp0),tptp0).  [resolve(9660,a,347,a),unit_del(b,90)].
2.72/2.94	9701 -occurrence_of(f11(f5(f6(c1),c1),tptp0),A) | tptp0 = A.  [resolve(9675,a,116,b),flip(b)].
2.72/2.94	9703 leaf_occ(f7(f11(f5(f6(c1),c1),tptp0)),f11(f5(f6(c1),c1),tptp0)).  [resolve(9675,a,111,a)].
2.72/2.94	9737 atomic(f4(f7(f11(f5(f6(c1),c1),tptp0)),f11(f5(f6(c1),c1),tptp0))) | occurrence_of(f11(f7(f11(f5(f6(c1),c1),tptp0)),f4(f7(f11(f5(f6(c1),c1),tptp0)),f11(f5(f6(c1),c1),tptp0))),f4(f7(f11(f5(f6(c1),c1),tptp0)),f11(f5(f6(c1),c1),tptp0))).  [resolve(9703,a,135,c)].
2.72/2.94	9739 -occurrence_of(f11(f5(f6(c1),c1),tptp0),A) | -leaf_occ(B,f11(f5(f6(c1),c1),tptp0)) | atomic(A) | f7(f11(f5(f6(c1),c1),tptp0)) = B.  [resolve(9703,a,126,c)].
2.72/2.94	9740 occurrence_of(f11(f5(f6(c1),c1),tptp0),f4(f7(f11(f5(f6(c1),c1),tptp0)),f11(f5(f6(c1),c1),tptp0))).  [resolve(9703,a,115,b)].
2.72/2.95	9999 f4(f7(f11(f5(f6(c1),c1),tptp0)),f11(f5(f6(c1),c1),tptp0)) = tptp0.  [resolve(9740,a,9701,a),flip(a)].
2.72/2.95	10001 occurrence_of(f11(f7(f11(f5(f6(c1),c1),tptp0)),tptp0),tptp0).  [back_rewrite(9737),rewrite([9999(14),9999(23),9999(25)]),unit_del(a,91)].
2.72/2.95	10017 occurrence_of(f7(f11(f7(f11(f5(f6(c1),c1),tptp0)),tptp0)),tptp3) | occurrence_of(f7(f11(f7(f11(f5(f6(c1),c1),tptp0)),tptp0)),tptp2).  [resolve(10001,a,122,a)].
2.72/2.95	10021 leaf_occ(f7(f11(f7(f11(f5(f6(c1),c1),tptp0)),tptp0)),f11(f7(f11(f5(f6(c1),c1),tptp0)),tptp0)).  [resolve(10001,a,111,a)].
2.72/2.95	10094 subactivity_occurrence(f7(f11(f7(f11(f5(f6(c1),c1),tptp0)),tptp0)),f11(f7(f11(f5(f6(c1),c1),tptp0)),tptp0)).  [resolve(10021,a,107,b)].
2.72/2.95	10127 occurrence_of(f7(f11(f7(f11(f5(f6(c1),c1),tptp0)),tptp0)),f10(f7(f11(f7(f11(f5(f6(c1),c1),tptp0)),tptp0)))).  [resolve(10094,a,192,b)].
2.72/2.95	10456 -occurrence_of(f7(f11(f7(f11(f5(f6(c1),c1),tptp0)),tptp0)),A) | f10(f7(f11(f7(f11(f5(f6(c1),c1),tptp0)),tptp0))) = A.  [resolve(10127,a,116,b),flip(b)].
2.72/2.95	11275 f10(f7(f11(f7(f11(f5(f6(c1),c1),tptp0)),tptp0))) = tptp3 | occurrence_of(f7(f11(f7(f11(f5(f6(c1),c1),tptp0)),tptp0)),tptp2).  [resolve(10456,a,10017,a)].
2.72/2.95	11360 f10(f7(f11(f7(f11(f5(f6(c1),c1),tptp0)),tptp0))) = tptp3 | f10(f7(f11(f7(f11(f5(f6(c1),c1),tptp0)),tptp0))) = tptp2.  [resolve(11275,b,10456,a)].
2.72/2.95	12646 -occurrence_of(f11(f5(f6(c1),c1),tptp0),A) | atomic(A) | f7(f11(f5(f6(c1),c1),tptp0)) = f5(f6(c1),c1) | leaf_occ(f6(c1),c1).  [resolve(9739,b,9659,b)].
2.72/2.95	12647 f7(f11(f5(f6(c1),c1),tptp0)) = f5(f6(c1),c1) | leaf_occ(f6(c1),c1).  [resolve(12646,a,9675,a),unit_del(a,91)].
2.72/2.95	12656 f7(f11(f5(f6(c1),c1),tptp0)) = f5(f6(c1),c1).  [resolve(12647,b,347,a),unit_del(b,90)].
2.72/2.95	12733 $F.  [back_rewrite(11360),rewrite([12656(7),12656(7),807(5),12656(10),12656(10),807(8)]),flip(a),flip(b),unit_del(a,100),unit_del(b,98)].
2.72/2.95	
2.72/2.95	% SZS output end Refutation
2.72/2.95	============================== end of proof ==========================
2.72/2.95	
2.72/2.95	============================== STATISTICS ============================
2.72/2.95	
2.72/2.95	Given=2830. Generated=24790. Kept=12641. proofs=1.
2.72/2.95	Usable=1471. Sos=3824. Demods=74. Limbo=77, Disabled=7442. Hints=0.
2.72/2.95	Megabytes=28.30.
2.72/2.95	User_CPU=2.46, System_CPU=0.02, Wall_clock=2.
2.72/2.95	
2.72/2.95	============================== end of statistics =====================
2.72/2.95	
2.72/2.95	============================== end of search =========================
2.72/2.95	
2.72/2.95	THEOREM PROVED
2.72/2.95	% SZS status Theorem
2.72/2.95	
2.72/2.95	Exiting with 1 proof.
2.72/2.95	
2.72/2.95	Process 1070 exit (max_proofs) Sat Jul 14 04:41:44 2018
2.72/2.95	Prover9 interrupted
2.72/2.95	EOF