0.07/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.12	% Command    : tptp2X_and_run_prover9 %d %s
0.11/0.33	% Computer   : n025.cluster.edu
0.11/0.33	% Model      : x86_64 x86_64
0.11/0.33	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.33	% Memory     : 8042.1875MB
0.11/0.33	% OS         : Linux 3.10.0-693.el7.x86_64
0.11/0.33	% CPULimit   : 1200
0.11/0.33	% DateTime   : Thu Jul 15 06:22:13 EDT 2021
0.11/0.33	% CPUTime    : 
0.41/1.04	============================== Prover9 ===============================
0.41/1.04	Prover9 (32) version 2009-11A, November 2009.
0.41/1.04	Process 1830 was started by sandbox2 on n025.cluster.edu,
0.41/1.04	Thu Jul 15 06:22:14 2021
0.41/1.04	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1200 -f /tmp/Prover9_1462_n025.cluster.edu".
0.41/1.04	============================== end of head ===========================
0.41/1.04	
0.41/1.04	============================== INPUT =================================
0.41/1.04	
0.41/1.04	% Reading from file /tmp/Prover9_1462_n025.cluster.edu
0.41/1.04	
0.41/1.04	set(prolog_style_variables).
0.41/1.04	set(auto2).
0.41/1.04	    % set(auto2) -> set(auto).
0.41/1.04	    % set(auto) -> set(auto_inference).
0.41/1.04	    % set(auto) -> set(auto_setup).
0.41/1.04	    % set(auto_setup) -> set(predicate_elim).
0.41/1.04	    % set(auto_setup) -> assign(eq_defs, unfold).
0.41/1.04	    % set(auto) -> set(auto_limits).
0.41/1.04	    % set(auto_limits) -> assign(max_weight, "100.000").
0.41/1.04	    % set(auto_limits) -> assign(sos_limit, 20000).
0.41/1.04	    % set(auto) -> set(auto_denials).
0.41/1.04	    % set(auto) -> set(auto_process).
0.41/1.04	    % set(auto2) -> assign(new_constants, 1).
0.41/1.04	    % set(auto2) -> assign(fold_denial_max, 3).
0.41/1.04	    % set(auto2) -> assign(max_weight, "200.000").
0.41/1.04	    % set(auto2) -> assign(max_hours, 1).
0.41/1.04	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.41/1.04	    % set(auto2) -> assign(max_seconds, 0).
0.41/1.04	    % set(auto2) -> assign(max_minutes, 5).
0.41/1.04	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.41/1.04	    % set(auto2) -> set(sort_initial_sos).
0.41/1.04	    % set(auto2) -> assign(sos_limit, -1).
0.41/1.04	    % set(auto2) -> assign(lrs_ticks, 3000).
0.41/1.04	    % set(auto2) -> assign(max_megs, 400).
0.41/1.04	    % set(auto2) -> assign(stats, some).
0.41/1.04	    % set(auto2) -> clear(echo_input).
0.41/1.04	    % set(auto2) -> set(quiet).
0.41/1.04	    % set(auto2) -> clear(print_initial_clauses).
0.41/1.04	    % set(auto2) -> clear(print_given).
0.41/1.04	assign(lrs_ticks,-1).
0.41/1.04	assign(sos_limit,10000).
0.41/1.04	assign(order,kbo).
0.41/1.04	set(lex_order_vars).
0.41/1.04	clear(print_given).
0.41/1.04	
0.41/1.04	% formulas(sos).  % not echoed (47 formulas)
0.41/1.04	
0.41/1.04	============================== end of input ==========================
0.41/1.04	
0.41/1.04	% From the command line: assign(max_seconds, 1200).
0.41/1.04	
0.41/1.04	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.41/1.04	
0.41/1.04	% Formulas that are not ordinary clauses:
0.41/1.04	1 (all X72 all X73 all X74 (min_precedes(X72,X73,X74) -> precedes(X72,X73))) # label(sos_24) # label(axiom) # label(non_clause).  [assumption].
0.41/1.04	2 (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.41/1.04	3 (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.41/1.04	4 (all X53 all X54 (root(X53,X54) -> legal(X53))) # label(sos_17) # label(axiom) # label(non_clause).  [assumption].
0.41/1.04	5 (all X104 all X105 (occurrence_of(X105,tptp0) & arboreal(X104) & -leaf_occ(X104,X105) & subactivity_occurrence(X104,X105) -> (exists X106 (occurrence_of(X106,tptp1) & next_subocc(X104,X106,tptp0))))) # label(sos_45) # label(axiom) # label(non_clause).  [assumption].
0.41/1.04	6 (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.41/1.04	7 (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.41/1.04	8 (all X86 all X87 all X88 all X89 (occurrence_of(X88,X89) & -atomic(X89) & leaf_occ(X86,X88) & leaf_occ(X87,X88) -> X86 = X87)) # label(sos_28) # label(axiom) # label(non_clause).  [assumption].
0.41/1.04	9 (all X43 (legal(X43) -> arboreal(X43))) # label(sos_13) # label(axiom) # label(non_clause).  [assumption].
0.41/1.04	10 (all X31 all X32 all X33 (occurrence_of(X31,X33) & leaf_occ(X32,X31) -> -(exists X34 min_precedes(X32,X34,X33)))) # label(sos_09) # label(axiom) # label(non_clause).  [assumption].
0.41/1.04	11 (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.41/1.04	12 (all X90 all X91 all X92 all X93 (occurrence_of(X92,X93) & root_occ(X91,X92) & root_occ(X90,X92) -> X91 = X90)) # label(sos_29) # label(axiom) # label(non_clause).  [assumption].
0.41/1.04	13 (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.41/1.04	14 (all X101 (occurrence_of(X101,tptp0) -> (exists X102 exists X103 (occurrence_of(X102,tptp4) & occurrence_of(X103,tptp3) & next_subocc(X102,X103,tptp0) & leaf_occ(X103,X101) & root_occ(X102,X101))))) # label(sos_32) # label(axiom) # label(non_clause).  [assumption].
0.41/1.04	15 (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.41/1.04	16 (all X65 all X66 all X67 (min_precedes(X65,X66,X67) -> -root(X66,X67))) # label(sos_22) # label(axiom) # label(non_clause).  [assumption].
0.41/1.04	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.41/1.04	18 (all X78 all X79 all X80 (next_subocc(X78,X79,X80) <-> -(exists X81 (min_precedes(X81,X79,X80) & min_precedes(X78,X81,X80))) & min_precedes(X78,X79,X80))) # label(sos_26) # label(axiom) # label(non_clause).  [assumption].
0.41/1.04	19 (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.41/1.04	20 (all X41 (activity_occurrence(X41) -> (exists X42 (activity(X42) & occurrence_of(X41,X42))))) # label(sos_12) # label(axiom) # label(non_clause).  [assumption].
0.41/1.04	21 (all X12 all X13 (occurrence_of(X13,X12) -> activity_occurrence(X13) & activity(X12))) # label(sos_03) # label(axiom) # label(non_clause).  [assumption].
0.41/1.04	22 (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.41/1.04	23 (all X8 all X9 all X10 all X11 (occurrence_of(X9,X8) & subactivity_occurrence(X10,X9) & arboreal(X10) & -min_precedes(X10,X11,X8) & leaf_occ(X11,X9) -> X10 = X11)) # label(sos_02) # label(axiom) # label(non_clause).  [assumption].
0.41/1.04	24 (all X63 all X64 (precedes(X63,X64) <-> earlier(X63,X64) & legal(X64))) # label(sos_21) # label(axiom) # label(non_clause).  [assumption].
0.41/1.04	25 (all X47 all X48 (((exists X49 min_precedes(X49,X47,X48)) | root(X47,X48)) & -(exists X50 min_precedes(X47,X50,X48)) <-> leaf(X47,X48))) # label(sos_15) # label(axiom) # label(non_clause).  [assumption].
0.41/1.04	26 (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.41/1.04	27 (all X3 all X4 all X5 all X6 all X7 (X5 != X7 & min_precedes(X6,X5,X3) & subactivity_occurrence(X5,X4) & 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.41/1.04	28 (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.41/1.04	29 (all X61 all X62 (earlier(X61,X62) -> -earlier(X62,X61))) # label(sos_20) # label(axiom) # label(non_clause).  [assumption].
0.41/1.04	30 (all X51 all X52 (occurrence_of(X51,X52) -> (atomic(X52) <-> arboreal(X51)))) # label(sos_16) # label(axiom) # label(non_clause).  [assumption].
0.41/1.04	31 (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.41/1.04	32 (all X55 all X56 ((exists X57 (subactivity_occurrence(X55,X56) & leaf(X55,X57) & occurrence_of(X56,X57))) <-> leaf_occ(X55,X56))) # label(sos_18) # label(axiom) # label(non_clause).  [assumption].
0.41/1.04	33 (all X14 all X15 all X16 all X17 (arboreal(X16) & arboreal(X17) & subactivity_occurrence(X16,X15) & subactivity_occurrence(X17,X15) & occurrence_of(X15,X14) -> X17 = X16 | min_precedes(X17,X16,X14) | min_precedes(X16,X17,X14))) # label(sos_04) # label(axiom) # label(non_clause).  [assumption].
0.41/1.04	34 (all X39 all X40 (subactivity_occurrence(X39,X40) -> activity_occurrence(X40) & activity_occurrence(X39))) # label(sos_11) # label(axiom) # label(non_clause).  [assumption].
0.41/1.04	35 --(exists X107 occurrence_of(X107,tptp0)) # label(goals) # label(negated_conjecture) # label(non_clause).  [assumption].
0.41/1.04	
0.41/1.04	============================== end of process non-clausal formulas ===
0.41/1.04	
0.41/1.04	============================== PROCESS INITIAL CLAUSES ===============
0.41/1.04	
0.41/1.04	============================== PREDICATE ELIMINATION =================
0.41/1.04	36 root(A,f8(A,B)) | -root_occ(A,B) # label(sos_19) # label(axiom).  [clausify(19)].
0.41/1.04	37 -min_precedes(A,B,C) | -root(B,C) # label(sos_22) # label(axiom).  [clausify(16)].
0.41/1.04	38 -root(A,B) | legal(A) # label(sos_17) # label(axiom).  [clausify(4)].
0.41/1.04	Derived: -root_occ(A,B) | -min_precedes(C,A,f8(A,B)).  [resolve(36,a,37,b)].
0.41/1.04	Derived: -root_occ(A,B) | legal(A).  [resolve(36,a,38,a)].
0.41/1.04	39 -root(A,B) | subactivity(f13(B,A),B) # label(sos_05) # label(axiom).  [clausify(28)].
0.41/1.04	Derived: subactivity(f13(f8(A,B),A),f8(A,B)) | -root_occ(A,B).  [resolve(39,a,36,a)].
0.41/1.04	40 -root(A,B) | atocc(A,f13(B,A)) # label(sos_05) # label(axiom).  [clausify(28)].
0.41/1.04	Derived: atocc(A,f13(f8(A,B),A)) | -root_occ(A,B).  [resolve(40,a,36,a)].
0.41/1.04	41 -min_precedes(A,B,C) | root(f1(A,B,C),C) # label(sos_23) # label(axiom).  [clausify(2)].
0.41/1.04	Derived: -min_precedes(A,B,C) | -min_precedes(D,f1(A,B,C),C).  [resolve(41,b,37,b)].
0.41/1.04	Derived: -min_precedes(A,B,C) | legal(f1(A,B,C)).  [resolve(41,b,38,a)].
0.41/1.04	Derived: -min_precedes(A,B,C) | subactivity(f13(C,f1(A,B,C)),C).  [resolve(41,b,39,a)].
0.41/1.04	Derived: -min_precedes(A,B,C) | atocc(f1(A,B,C),f13(C,f1(A,B,C))).  [resolve(41,b,40,a)].
0.41/1.04	42 atomic(A) | -occurrence_of(B,A) | root(f3(A,B),A) # label(sos) # label(axiom).  [clausify(7)].
0.41/1.04	Derived: atomic(A) | -occurrence_of(B,A) | -min_precedes(C,f3(A,B),A).  [resolve(42,c,37,b)].
0.41/1.04	Derived: atomic(A) | -occurrence_of(B,A) | legal(f3(A,B)).  [resolve(42,c,38,a)].
0.41/1.04	Derived: atomic(A) | -occurrence_of(B,A) | subactivity(f13(A,f3(A,B)),A).  [resolve(42,c,39,a)].
0.41/1.04	Derived: atomic(A) | -occurrence_of(B,A) | atocc(f3(A,B),f13(A,f3(A,B))).  [resolve(42,c,40,a)].
0.41/1.04	43 -subactivity_occurrence(A,B) | -root(A,C) | -occurrence_of(B,C) | root_occ(A,B) # label(sos_19) # label(axiom).  [clausify(19)].
0.41/1.04	Derived: -subactivity_occurrence(A,B) | -occurrence_of(B,f8(A,C)) | root_occ(A,B) | -root_occ(A,C).  [resolve(43,b,36,a)].
0.41/1.04	Derived: -subactivity_occurrence(f1(A,B,C),D) | -occurrence_of(D,C) | root_occ(f1(A,B,C),D) | -min_precedes(A,B,C).  [resolve(43,b,41,b)].
0.41/1.04	Derived: -subactivity_occurrence(f3(A,B),C) | -occurrence_of(C,A) | root_occ(f3(A,B),C) | atomic(A) | -occurrence_of(B,A).  [resolve(43,b,42,c)].
0.41/1.04	44 -root(A,B) | min_precedes(A,f11(A,B),B) | leaf(A,B) # label(sos_15) # label(axiom).  [clausify(25)].
0.41/1.04	Derived: min_precedes(A,f11(A,f8(A,B)),f8(A,B)) | leaf(A,f8(A,B)) | -root_occ(A,B).  [resolve(44,a,36,a)].
0.41/1.04	Derived: min_precedes(f1(A,B,C),f11(f1(A,B,C),C),C) | leaf(f1(A,B,C),C) | -min_precedes(A,B,C).  [resolve(44,a,41,b)].
0.41/1.04	Derived: min_precedes(f3(A,B),f11(f3(A,B),A),A) | leaf(f3(A,B),A) | atomic(A) | -occurrence_of(B,A).  [resolve(44,a,42,c)].
0.41/1.04	45 min_precedes(f12(A,B),A,B) | root(A,B) | -leaf(A,B) # label(sos_15) # label(axiom).  [clausify(25)].
0.41/1.04	Derived: min_precedes(f12(A,B),A,B) | -leaf(A,B) | -min_precedes(C,A,B).  [resolve(45,b,37,b)].
0.41/1.04	Derived: min_precedes(f12(A,B),A,B) | -leaf(A,B) | legal(A).  [resolve(45,b,38,a)].
0.41/1.04	Derived: min_precedes(f12(A,B),A,B) | -leaf(A,B) | subactivity(f13(B,A),B).  [resolve(45,b,39,a)].
0.41/1.04	Derived: min_precedes(f12(A,B),A,B) | -leaf(A,B) | atocc(A,f13(B,A)).  [resolve(45,b,40,a)].
0.41/1.04	Derived: min_precedes(f12(A,B),A,B) | -leaf(A,B) | -subactivity_occurrence(A,C) | -occurrence_of(C,B) | root_occ(A,C).  [resolve(45,b,43,b)].
0.41/1.04	46 leaf(A,f15(A,B)) | -leaf_occ(A,B) # label(sos_18) # label(axiom).  [clausify(32)].
0.41/1.04	47 -min_precedes(A,B,C) | -leaf(A,C) # label(sos_15) # label(axiom).  [clausify(25)].
0.41/1.04	Derived: -leaf_occ(A,B) | -min_precedes(A,C,f15(A,B)).  [resolve(46,a,47,b)].
0.41/1.04	48 atomic(A) | -leaf(B,A) | leaf_occ(B,f14(B,A)) # label(sos_07) # label(axiom).  [clausify(31)].
0.41/1.04	Derived: atomic(f15(A,B)) | leaf_occ(A,f14(A,f15(A,B))) | -leaf_occ(A,B).  [resolve(48,b,46,a)].
0.41/1.04	49 atomic(A) | -leaf(B,A) | occurrence_of(f14(B,A),A) # label(sos_07) # label(axiom).  [clausify(31)].
0.41/1.04	Derived: atomic(f15(A,B)) | occurrence_of(f14(A,f15(A,B)),f15(A,B)) | -leaf_occ(A,B).  [resolve(49,b,46,a)].
0.41/1.04	50 -subactivity_occurrence(A,B) | -leaf(A,C) | -occurrence_of(B,C) | leaf_occ(A,B) # label(sos_18) # label(axiom).  [clausify(32)].
0.41/1.04	Derived: -subactivity_occurrence(A,B) | -occurrence_of(B,f15(A,C)) | leaf_occ(A,B) | -leaf_occ(A,C).  [resolve(50,b,46,a)].
0.41/1.04	51 -min_precedes(A,B,C) | min_precedes(B,f11(B,C),C) | leaf(B,C) # label(sos_15) # label(axiom).  [clausify(25)].
0.41/1.04	Derived: -min_precedes(A,B,C) | min_precedes(B,f11(B,C),C) | -min_precedes(B,D,C).  [resolve(51,c,47,b)].
0.41/1.04	Derived: -min_precedes(A,B,C) | min_precedes(B,f11(B,C),C) | atomic(C) | leaf_occ(B,f14(B,C)).  [resolve(51,c,48,b)].
0.41/1.04	Derived: -min_precedes(A,B,C) | min_precedes(B,f11(B,C),C) | atomic(C) | occurrence_of(f14(B,C),C).  [resolve(51,c,49,b)].
0.41/1.04	Derived: -min_precedes(A,B,C) | min_precedes(B,f11(B,C),C) | -subactivity_occurrence(B,D) | -occurrence_of(D,C) | leaf_occ(B,D).  [resolve(51,c,50,b)].
0.41/1.04	52 min_precedes(A,f11(A,f8(A,B)),f8(A,B)) | leaf(A,f8(A,B)) | -root_occ(A,B).  [resolve(44,a,36,a)].
0.41/1.04	Derived: min_precedes(A,f11(A,f8(A,B)),f8(A,B)) | -root_occ(A,B) | -min_precedes(A,C,f8(A,B)).  [resolve(52,b,47,b)].
0.41/1.04	Derived: min_precedes(A,f11(A,f8(A,B)),f8(A,B)) | -root_occ(A,B) | atomic(f8(A,B)) | leaf_occ(A,f14(A,f8(A,B))).  [resolve(52,b,48,b)].
0.41/1.04	Derived: min_precedes(A,f11(A,f8(A,B)),f8(A,B)) | -root_occ(A,B) | atomic(f8(A,B)) | occurrence_of(f14(A,f8(A,B)),f8(A,B)).  [resolve(52,b,49,b)].
0.41/1.04	Derived: min_precedes(A,f11(A,f8(A,B)),f8(A,B)) | -root_occ(A,B) | -subactivity_occurrence(A,C) | -occurrence_of(C,f8(A,B)) | leaf_occ(A,C).  [resolve(52,b,50,b)].
0.41/1.04	53 min_precedes(f1(A,B,C),f11(f1(A,B,C),C),C) | leaf(f1(A,B,C),C) | -min_precedes(A,B,C).  [resolve(44,a,41,b)].
0.41/1.04	Derived: min_precedes(f1(A,B,C),f11(f1(A,B,C),C),C) | -min_precedes(A,B,C) | -min_precedes(f1(A,B,C),D,C).  [resolve(53,b,47,b)].
0.41/1.04	Derived: min_precedes(f1(A,B,C),f11(f1(A,B,C),C),C) | -min_precedes(A,B,C) | atomic(C) | leaf_occ(f1(A,B,C),f14(f1(A,B,C),C)).  [resolve(53,b,48,b)].
0.41/1.04	Derived: min_precedes(f1(A,B,C),f11(f1(A,B,C),C),C) | -min_precedes(A,B,C) | atomic(C) | occurrence_of(f14(f1(A,B,C),C),C).  [resolve(53,b,49,b)].
0.41/1.04	Derived: min_precedes(f1(A,B,C),f11(f1(A,B,C),C),C) | -min_precedes(A,B,C) | -subactivity_occurrence(f1(A,B,C),D) | -occurrence_of(D,C) | leaf_occ(f1(A,B,C),D).  [resolve(53,b,50,b)].
0.41/1.04	54 min_precedes(f3(A,B),f11(f3(A,B),A),A) | leaf(f3(A,B),A) | atomic(A) | -occurrence_of(B,A).  [resolve(44,a,42,c)].
0.41/1.04	Derived: min_precedes(f3(A,B),f11(f3(A,B),A),A) | atomic(A) | -occurrence_of(B,A) | -min_precedes(f3(A,B),C,A).  [resolve(54,b,47,b)].
0.41/1.04	Derived: min_precedes(f3(A,B),f11(f3(A,B),A),A) | atomic(A) | -occurrence_of(B,A) | atomic(A) | leaf_occ(f3(A,B),f14(f3(A,B),A)).  [resolve(54,b,48,b)].
0.41/1.04	Derived: min_precedes(f3(A,B),f11(f3(A,B),A),A) | atomic(A) | -occurrence_of(B,A) | atomic(A) | occurrence_of(f14(f3(A,B),A),A).  [resolve(54,b,49,b)].
0.41/1.04	Derived: min_precedes(f3(A,B),f11(f3(A,B),A),A) | atomic(A) | -occurrence_of(B,A) | -subactivity_occurrence(f3(A,B),C) | -occurrence_of(C,A) | leaf_occ(f3(A,B),C).  [resolve(54,b,50,b)].
0.41/1.04	55 min_precedes(f12(A,B),A,B) | -leaf(A,B) | -min_precedes(C,A,B).  [resolve(45,b,37,b)].
0.41/1.04	Derived: min_precedes(f12(A,f15(A,B)),A,f15(A,B)) | -min_precedes(C,A,f15(A,B)) | -leaf_occ(A,B).  [resolve(55,b,46,a)].
0.41/1.04	Derived: min_precedes(f12(A,B),A,B) | -min_precedes(C,A,B) | -min_precedes(D,A,B) | min_precedes(A,f11(A,B),B).  [resolve(55,b,51,c)].
0.41/1.04	56 min_precedes(f12(A,B),A,B) | -leaf(A,B) | legal(A).  [resolve(45,b,38,a)].
0.41/1.04	Derived: min_precedes(f12(A,f15(A,B)),A,f15(A,B)) | legal(A) | -leaf_occ(A,B).  [resolve(56,b,46,a)].
0.41/1.04	Derived: min_precedes(f12(A,f8(A,B)),A,f8(A,B)) | legal(A) | min_precedes(A,f11(A,f8(A,B)),f8(A,B)) | -root_occ(A,B).  [resolve(56,b,52,b)].
0.41/1.05	Derived: min_precedes(f12(f1(A,B,C),C),f1(A,B,C),C) | legal(f1(A,B,C)) | min_precedes(f1(A,B,C),f11(f1(A,B,C),C),C) | -min_precedes(A,B,C).  [resolve(56,b,53,b)].
0.41/1.05	Derived: min_precedes(f12(f3(A,B),A),f3(A,B),A) | legal(f3(A,B)) | min_precedes(f3(A,B),f11(f3(A,B),A),A) | atomic(A) | -occurrence_of(B,A).  [resolve(56,b,54,b)].
0.41/1.05	57 min_precedes(f12(A,B),A,B) | -leaf(A,B) | subactivity(f13(B,A),B).  [resolve(45,b,39,a)].
0.41/1.05	Derived: min_precedes(f12(A,f15(A,B)),A,f15(A,B)) | subactivity(f13(f15(A,B),A),f15(A,B)) | -leaf_occ(A,B).  [resolve(57,b,46,a)].
0.41/1.05	Derived: min_precedes(f12(A,f8(A,B)),A,f8(A,B)) | subactivity(f13(f8(A,B),A),f8(A,B)) | min_precedes(A,f11(A,f8(A,B)),f8(A,B)) | -root_occ(A,B).  [resolve(57,b,52,b)].
0.41/1.05	Derived: min_precedes(f12(f1(A,B,C),C),f1(A,B,C),C) | subactivity(f13(C,f1(A,B,C)),C) | min_precedes(f1(A,B,C),f11(f1(A,B,C),C),C) | -min_precedes(A,B,C).  [resolve(57,b,53,b)].
0.41/1.05	Derived: min_precedes(f12(f3(A,B),A),f3(A,B),A) | subactivity(f13(A,f3(A,B)),A) | min_precedes(f3(A,B),f11(f3(A,B),A),A) | atomic(A) | -occurrence_of(B,A).  [resolve(57,b,54,b)].
0.41/1.05	58 min_precedes(f12(A,B),A,B) | -leaf(A,B) | atocc(A,f13(B,A)).  [resolve(45,b,40,a)].
0.41/1.05	Derived: min_precedes(f12(A,f15(A,B)),A,f15(A,B)) | atocc(A,f13(f15(A,B),A)) | -leaf_occ(A,B).  [resolve(58,b,46,a)].
0.41/1.05	Derived: min_precedes(f12(A,f8(A,B)),A,f8(A,B)) | atocc(A,f13(f8(A,B),A)) | min_precedes(A,f11(A,f8(A,B)),f8(A,B)) | -root_occ(A,B).  [resolve(58,b,52,b)].
0.41/1.05	Derived: min_precedes(f12(f1(A,B,C),C),f1(A,B,C),C) | atocc(f1(A,B,C),f13(C,f1(A,B,C))) | min_precedes(f1(A,B,C),f11(f1(A,B,C),C),C) | -min_precedes(A,B,C).  [resolve(58,b,53,b)].
0.41/1.05	Derived: min_precedes(f12(f3(A,B),A),f3(A,B),A) | atocc(f3(A,B),f13(A,f3(A,B))) | min_precedes(f3(A,B),f11(f3(A,B),A),A) | atomic(A) | -occurrence_of(B,A).  [resolve(58,b,54,b)].
0.41/1.05	59 min_precedes(f12(A,B),A,B) | -leaf(A,B) | -subactivity_occurrence(A,C) | -occurrence_of(C,B) | root_occ(A,C).  [resolve(45,b,43,b)].
0.41/1.05	Derived: min_precedes(f12(A,f15(A,B)),A,f15(A,B)) | -subactivity_occurrence(A,C) | -occurrence_of(C,f15(A,B)) | root_occ(A,C) | -leaf_occ(A,B).  [resolve(59,b,46,a)].
0.41/1.05	Derived: min_precedes(f12(A,f8(A,B)),A,f8(A,B)) | -subactivity_occurrence(A,C) | -occurrence_of(C,f8(A,B)) | root_occ(A,C) | min_precedes(A,f11(A,f8(A,B)),f8(A,B)) | -root_occ(A,B).  [resolve(59,b,52,b)].
0.41/1.05	Derived: min_precedes(f12(f1(A,B,C),C),f1(A,B,C),C) | -subactivity_occurrence(f1(A,B,C),D) | -occurrence_of(D,C) | root_occ(f1(A,B,C),D) | min_precedes(f1(A,B,C),f11(f1(A,B,C),C),C) | -min_precedes(A,B,C).  [resolve(59,b,53,b)].
0.41/1.05	Derived: min_precedes(f12(f3(A,B),A),f3(A,B),A) | -subactivity_occurrence(f3(A,B),C) | -occurrence_of(C,A) | root_occ(f3(A,B),C) | min_precedes(f3(A,B),f11(f3(A,B),A),A) | atomic(A) | -occurrence_of(B,A).  [resolve(59,b,54,b)].
0.41/1.05	60 -occurrence_of(A,tptp0) | next_subocc(f5(A),f6(A),tptp0) # label(sos_32) # label(axiom).  [clausify(14)].
0.41/1.05	61 -next_subocc(A,B,C) | -min_precedes(D,B,C) | -min_precedes(A,D,C) # label(sos_26) # label(axiom).  [clausify(18)].
0.41/1.05	62 -next_subocc(A,B,C) | arboreal(A) # label(sos_25) # label(axiom).  [clausify(15)].
0.41/1.05	63 -next_subocc(A,B,C) | arboreal(B) # label(sos_25) # label(axiom).  [clausify(15)].
0.41/1.05	64 -next_subocc(A,B,C) | min_precedes(A,B,C) # label(sos_26) # label(axiom).  [clausify(18)].
0.41/1.05	Derived: -occurrence_of(A,tptp0) | -min_precedes(B,f6(A),tptp0) | -min_precedes(f5(A),B,tptp0).  [resolve(60,b,61,a)].
0.41/1.05	Derived: -occurrence_of(A,tptp0) | arboreal(f5(A)).  [resolve(60,b,62,a)].
0.41/1.05	Derived: -occurrence_of(A,tptp0) | arboreal(f6(A)).  [resolve(60,b,63,a)].
0.41/1.05	Derived: -occurrence_of(A,tptp0) | min_precedes(f5(A),f6(A),tptp0).  [resolve(60,b,64,a)].
0.41/1.05	65 next_subocc(A,B,C) | min_precedes(f7(A,B,C),B,C) | -min_precedes(A,B,C) # label(sos_26) # label(axiom).  [clausify(18)].
0.41/1.05	Derived: min_precedes(f7(A,B,C),B,C) | -min_precedes(A,B,C) | -min_precedes(D,B,C) | -min_precedes(A,D,C).  [resolve(65,a,61,a)].
0.41/1.05	Derived: min_precedes(f7(A,B,C),B,C) | -min_precedes(A,B,C) | arboreal(A).  [resolve(65,a,62,a)].
0.41/1.05	Derived: min_precedes(f7(A,B,C),B,C) | -min_precedes(A,B,C) | arboreal(B).  [resolve(65,a,63,a)].
0.41/1.05	66 next_subocc(A,B,C) | min_precedes(A,f7(A,B,C),C) | -min_precedes(A,B,C) # label(sos_26) # label(axiom).  [clausify(18)].
0.41/1.05	Derived: min_precedes(A,f7(A,B,C),C) | -min_precedes(A,B,C) | -min_precedes(D,B,C) | -min_precedes(A,D,C).  [resolve(66,a,61,a)].
0.41/1.05	Derived: min_precedes(A,f7(A,B,C),C) | -min_precedes(A,B,C) | arboreal(A).  [resolve(66,a,62,a)].
0.41/1.05	Derived: min_precedes(A,f7(A,B,C),C) | -min_precedes(A,B,C) | arboreal(B).  [resolve(66,a,63,a)].
0.41/1.05	67 -occurrence_of(A,tptp0) | -arboreal(B) | leaf_occ(B,A) | -subactivity_occurrence(B,A) | next_subocc(B,f2(B,A),tptp0) # label(sos_45) # label(axiom).  [clausify(5)].
0.41/1.05	Derived: -occurrence_of(A,tptp0) | -arboreal(B) | leaf_occ(B,A) | -subactivity_occurrence(B,A) | -min_precedes(C,f2(B,A),tptp0) | -min_precedes(B,C,tptp0).  [resolve(67,e,61,a)].
0.41/1.05	Derived: -occurrence_of(A,tptp0) | -arboreal(B) | leaf_occ(B,A) | -subactivity_occurrence(B,A) | arboreal(f2(B,A)).  [resolve(67,e,63,a)].
0.41/1.05	Derived: -occurrence_of(A,tptp0) | -arboreal(B) | leaf_occ(B,A) | -subactivity_occurrence(B,A) | min_precedes(B,f2(B,A),tptp0).  [resolve(67,e,64,a)].
0.41/1.05	68 -precedes(A,B) | legal(B) # label(sos_21) # label(axiom).  [clausify(24)].
0.41/1.05	69 -legal(A) | arboreal(A) # label(sos_13) # label(axiom).  [clausify(9)].
0.41/1.05	Derived: -precedes(A,B) | arboreal(B).  [resolve(68,b,69,a)].
0.41/1.05	70 precedes(A,B) | -earlier(A,B) | -legal(B) # label(sos_21) # label(axiom).  [clausify(24)].
0.41/1.05	Derived: precedes(A,B) | -earlier(A,B) | -precedes(C,B).  [resolve(70,c,68,b)].
0.41/1.05	71 -root_occ(A,B) | legal(A).  [resolve(36,a,38,a)].
0.41/1.05	Derived: -root_occ(A,B) | arboreal(A).  [resolve(71,b,69,a)].
0.41/1.05	Derived: -root_occ(A,B) | precedes(C,A) | -earlier(C,A).  [resolve(71,b,70,c)].
0.41/1.05	72 -min_precedes(A,B,C) | legal(f1(A,B,C)).  [resolve(41,b,38,a)].
0.41/1.05	Derived: -min_precedes(A,B,C) | arboreal(f1(A,B,C)).  [resolve(72,b,69,a)].
0.41/1.05	Derived: -min_precedes(A,B,C) | precedes(D,f1(A,B,C)) | -earlier(D,f1(A,B,C)).  [resolve(72,b,70,c)].
0.41/1.05	73 atomic(A) | -occurrence_of(B,A) | legal(f3(A,B)).  [resolve(42,c,38,a)].
0.41/1.05	Derived: atomic(A) | -occurrence_of(B,A) | arboreal(f3(A,B)).  [resolve(73,c,69,a)].
0.41/1.05	Derived: atomic(A) | -occurrence_of(B,A) | precedes(C,f3(A,B)) | -earlier(C,f3(A,B)).  [resolve(73,c,70,c)].
0.41/1.05	74 min_precedes(f12(A,f15(A,B)),A,f15(A,B)) | legal(A) | -leaf_occ(A,B).  [resolve(56,b,46,a)].
0.41/1.05	Derived: min_precedes(f12(A,f15(A,B)),A,f15(A,B)) | -leaf_occ(A,B) | arboreal(A).  [resolve(74,b,69,a)].
0.41/1.05	Derived: min_precedes(f12(A,f15(A,B)),A,f15(A,B)) | -leaf_occ(A,B) | precedes(C,A) | -earlier(C,A).  [resolve(74,b,70,c)].
0.41/1.05	75 min_precedes(f12(A,f8(A,B)),A,f8(A,B)) | legal(A) | min_precedes(A,f11(A,f8(A,B)),f8(A,B)) | -root_occ(A,B).  [resolve(56,b,52,b)].
0.41/1.05	76 min_precedes(f12(f1(A,B,C),C),f1(A,B,C),C) | legal(f1(A,B,C)) | min_precedes(f1(A,B,C),f11(f1(A,B,C),C),C) | -min_precedes(A,B,C).  [resolve(56,b,53,b)].
0.41/1.05	77 min_precedes(f12(f3(A,B),A),f3(A,B),A) | legal(f3(A,B)) | min_precedes(f3(A,B),f11(f3(A,B),A),A) | atomic(A) | -occurrence_of(B,A).  [resolve(56,b,54,b)].
0.41/1.05	78 -activity_occurrence(A) | occurrence_of(A,f9(A)) # label(sos_12) # label(axiom).  [clausify(20)].
0.41/1.05	79 -occurrence_of(A,B) | activity_occurrence(A) # label(sos_03) # label(axiom).  [clausify(21)].
0.41/1.05	80 -subactivity_occurrence(A,B) | activity_occurrence(B) # label(sos_11) # label(axiom).  [clausify(34)].
0.41/1.05	81 -subactivity_occurrence(A,B) | activity_occurrence(A) # label(sos_11) # label(axiom).  [clausify(34)].
0.41/1.05	Derived: occurrence_of(A,f9(A)) | -occurrence_of(A,B).  [resolve(78,a,79,b)].
0.41/1.05	Derived: occurrence_of(A,f9(A)) | -subactivity_occurrence(B,A).  [resolve(78,a,80,b)].
0.41/1.05	Derived: occurrence_of(A,f9(A)) | -subactivity_occurrence(A,B).  [resolve(78,a,81,b)].
0.41/1.05	82 atocc(A,B) | -subactivity(B,C) | -occurrence_of(A,C) | -atomic(C) # label(sos_14) # label(axiom).  [clausify(11)].
0.41/1.05	83 -atocc(A,B) | atomic(f4(A,B)) # label(sos_14) # label(axiom).  [clausify(11)].
0.41/1.05	84 -atocc(A,B) | subactivity(B,f4(A,B)) # label(sos_14) # label(axiom).  [clausify(11)].
0.41/1.05	85 -atocc(A,B) | occurrence_of(A,f4(A,B)) # label(sos_14) # label(axiom).  [clausify(11)].
0.41/1.05	Derived: -subactivity(A,B) | -occurrence_of(C,B) | -atomic(B) | atomic(f4(C,A)).  [resolve(82,a,83,a)].
0.41/1.05	Derived: -subactivity(A,B) | -occurrence_of(C,B) | -atomic(B) | subactivity(A,f4(C,A)).  [resolve(82,a,84,a)].
5.44/5.73	Derived: -subactivity(A,B) | -occurrence_of(C,B) | -atomic(B) | occurrence_of(C,f4(C,A)).  [resolve(82,a,85,a)].
5.44/5.73	86 atocc(A,f13(f8(A,B),A)) | -root_occ(A,B).  [resolve(40,a,36,a)].
5.44/5.73	Derived: -root_occ(A,B) | atomic(f4(A,f13(f8(A,B),A))).  [resolve(86,a,83,a)].
5.44/5.73	Derived: -root_occ(A,B) | subactivity(f13(f8(A,B),A),f4(A,f13(f8(A,B),A))).  [resolve(86,a,84,a)].
5.44/5.73	Derived: -root_occ(A,B) | occurrence_of(A,f4(A,f13(f8(A,B),A))).  [resolve(86,a,85,a)].
5.44/5.73	87 -min_precedes(A,B,C) | atocc(f1(A,B,C),f13(C,f1(A,B,C))).  [resolve(41,b,40,a)].
5.44/5.73	Derived: -min_precedes(A,B,C) | atomic(f4(f1(A,B,C),f13(C,f1(A,B,C)))).  [resolve(87,b,83,a)].
5.44/5.73	Derived: -min_precedes(A,B,C) | subactivity(f13(C,f1(A,B,C)),f4(f1(A,B,C),f13(C,f1(A,B,C)))).  [resolve(87,b,84,a)].
5.44/5.73	Derived: -min_precedes(A,B,C) | occurrence_of(f1(A,B,C),f4(f1(A,B,C),f13(C,f1(A,B,C)))).  [resolve(87,b,85,a)].
5.44/5.73	88 atomic(A) | -occurrence_of(B,A) | atocc(f3(A,B),f13(A,f3(A,B))).  [resolve(42,c,40,a)].
5.44/5.73	Derived: atomic(A) | -occurrence_of(B,A) | atomic(f4(f3(A,B),f13(A,f3(A,B)))).  [resolve(88,c,83,a)].
5.44/5.73	Derived: atomic(A) | -occurrence_of(B,A) | subactivity(f13(A,f3(A,B)),f4(f3(A,B),f13(A,f3(A,B)))).  [resolve(88,c,84,a)].
5.44/5.73	Derived: atomic(A) | -occurrence_of(B,A) | occurrence_of(f3(A,B),f4(f3(A,B),f13(A,f3(A,B)))).  [resolve(88,c,85,a)].
5.44/5.73	89 min_precedes(f12(A,f15(A,B)),A,f15(A,B)) | atocc(A,f13(f15(A,B),A)) | -leaf_occ(A,B).  [resolve(58,b,46,a)].
5.44/5.73	Derived: min_precedes(f12(A,f15(A,B)),A,f15(A,B)) | -leaf_occ(A,B) | atomic(f4(A,f13(f15(A,B),A))).  [resolve(89,b,83,a)].
5.44/5.73	Derived: min_precedes(f12(A,f15(A,B)),A,f15(A,B)) | -leaf_occ(A,B) | subactivity(f13(f15(A,B),A),f4(A,f13(f15(A,B),A))).  [resolve(89,b,84,a)].
5.44/5.73	Derived: min_precedes(f12(A,f15(A,B)),A,f15(A,B)) | -leaf_occ(A,B) | occurrence_of(A,f4(A,f13(f15(A,B),A))).  [resolve(89,b,85,a)].
5.44/5.73	90 min_precedes(f12(A,f8(A,B)),A,f8(A,B)) | atocc(A,f13(f8(A,B),A)) | min_precedes(A,f11(A,f8(A,B)),f8(A,B)) | -root_occ(A,B).  [resolve(58,b,52,b)].
5.44/5.73	91 min_precedes(f12(f1(A,B,C),C),f1(A,B,C),C) | atocc(f1(A,B,C),f13(C,f1(A,B,C))) | min_precedes(f1(A,B,C),f11(f1(A,B,C),C),C) | -min_precedes(A,B,C).  [resolve(58,b,53,b)].
5.44/5.73	92 min_precedes(f12(f3(A,B),A),f3(A,B),A) | atocc(f3(A,B),f13(A,f3(A,B))) | min_precedes(f3(A,B),f11(f3(A,B),A),A) | atomic(A) | -occurrence_of(B,A).  [resolve(58,b,54,b)].
5.44/5.73	
5.44/5.73	============================== end predicate elimination =============
5.44/5.73	
5.44/5.73	Auto_denials:  (non-Horn, no changes).
5.44/5.73	
5.44/5.73	Term ordering decisions:
5.44/5.73	Function symbol KB weights:  tptp0=1. tptp1=1. tptp3=1. tptp4=1. tptp2=1. c1=1. f2=1. f3=1. f4=1. f8=1. f11=1. f12=1. f13=1. f14=1. f15=1. f5=1. f6=1. f9=1. f1=1. f7=1. f10=1.
5.44/5.73	
5.44/5.73	============================== end of process initial clauses ========
5.44/5.73	
5.44/5.73	============================== CLAUSES FOR SEARCH ====================
5.44/5.73	
5.44/5.73	============================== end of clauses for search =============
5.44/5.73	
5.44/5.73	============================== SEARCH ================================
5.44/5.73	
5.44/5.73	% Starting search at 0.04 seconds.
5.44/5.73	
5.44/5.73	Low Water (keep): wt=90.000, iters=3488
5.44/5.73	
5.44/5.73	Low Water (keep): wt=89.000, iters=3470
5.44/5.73	
5.44/5.73	Low Water (keep): wt=87.000, iters=3432
5.44/5.73	
5.44/5.73	Low Water (keep): wt=81.000, iters=3367
5.44/5.73	
5.44/5.73	Low Water (keep): wt=75.000, iters=3337
5.44/5.73	
5.44/5.73	Low Water (keep): wt=74.000, iters=3368
5.44/5.73	
5.44/5.73	Low Water (keep): wt=72.000, iters=3377
5.44/5.73	
5.44/5.73	Low Water (keep): wt=69.000, iters=3382
5.44/5.73	
5.44/5.73	Low Water (keep): wt=61.000, iters=3821
5.44/5.73	
5.44/5.73	Low Water (keep): wt=60.000, iters=3822
5.44/5.73	
5.44/5.73	Low Water (keep): wt=56.000, iters=3448
5.44/5.73	
5.44/5.73	Low Water (keep): wt=54.000, iters=3335
5.44/5.73	
5.44/5.73	============================== PROOF =================================
5.44/5.73	% SZS status Theorem
5.44/5.73	% SZS output start Refutation
5.44/5.73	
5.44/5.73	% Proof 1 at 4.66 (+ 0.05) seconds.
5.44/5.73	% Length of proof is 84.
5.44/5.73	% Level of proof is 16.
5.44/5.73	% Maximum clause weight is 40.000.
5.44/5.73	% Given clauses 5441.
5.44/5.73	
5.44/5.73	5 (all X104 all X105 (occurrence_of(X105,tptp0) & arboreal(X104) & -leaf_occ(X104,X105) & subactivity_occurrence(X104,X105) -> (exists X106 (occurrence_of(X106,tptp1) & next_subocc(X104,X106,tptp0))))) # label(sos_45) # label(axiom) # label(non_clause).  [assumption].
5.44/5.73	10 (all X31 all X32 all X33 (occurrence_of(X31,X33) & leaf_occ(X32,X31) -> -(exists X34 min_precedes(X32,X34,X33)))) # label(sos_09) # label(axiom) # label(non_clause).  [assumption].
5.44/5.73	12 (all X90 all X91 all X92 all X93 (occurrence_of(X92,X93) & root_occ(X91,X92) & root_occ(X90,X92) -> X91 = X90)) # label(sos_29) # label(axiom) # label(non_clause).  [assumption].
5.44/5.73	14 (all X101 (occurrence_of(X101,tptp0) -> (exists X102 exists X103 (occurrence_of(X102,tptp4) & occurrence_of(X103,tptp3) & next_subocc(X102,X103,tptp0) & leaf_occ(X103,X101) & root_occ(X102,X101))))) # label(sos_32) # label(axiom) # label(non_clause).  [assumption].
5.44/5.73	15 (all X75 all X76 all X77 (next_subocc(X75,X76,X77) -> arboreal(X75) & arboreal(X76))) # label(sos_25) # label(axiom) # label(non_clause).  [assumption].
5.44/5.73	18 (all X78 all X79 all X80 (next_subocc(X78,X79,X80) <-> -(exists X81 (min_precedes(X81,X79,X80) & min_precedes(X78,X81,X80))) & min_precedes(X78,X79,X80))) # label(sos_26) # label(axiom) # label(non_clause).  [assumption].
5.44/5.73	19 (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].
5.44/5.73	20 (all X41 (activity_occurrence(X41) -> (exists X42 (activity(X42) & occurrence_of(X41,X42))))) # label(sos_12) # label(axiom) # label(non_clause).  [assumption].
5.44/5.73	21 (all X12 all X13 (occurrence_of(X13,X12) -> activity_occurrence(X13) & activity(X12))) # label(sos_03) # label(axiom) # label(non_clause).  [assumption].
5.44/5.73	22 (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.44/5.73	26 (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].
5.44/5.73	27 (all X3 all X4 all X5 all X6 all X7 (X5 != X7 & min_precedes(X6,X5,X3) & subactivity_occurrence(X5,X4) & 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].
5.44/5.73	35 --(exists X107 occurrence_of(X107,tptp0)) # label(goals) # label(negated_conjecture) # label(non_clause).  [assumption].
5.44/5.73	36 root(A,f8(A,B)) | -root_occ(A,B) # label(sos_19) # label(axiom).  [clausify(19)].
5.44/5.73	43 -subactivity_occurrence(A,B) | -root(A,C) | -occurrence_of(B,C) | root_occ(A,B) # label(sos_19) # label(axiom).  [clausify(19)].
5.44/5.73	60 -occurrence_of(A,tptp0) | next_subocc(f5(A),f6(A),tptp0) # label(sos_32) # label(axiom).  [clausify(14)].
5.44/5.73	61 -next_subocc(A,B,C) | -min_precedes(D,B,C) | -min_precedes(A,D,C) # label(sos_26) # label(axiom).  [clausify(18)].
5.44/5.73	62 -next_subocc(A,B,C) | arboreal(A) # label(sos_25) # label(axiom).  [clausify(15)].
5.44/5.73	64 -next_subocc(A,B,C) | min_precedes(A,B,C) # label(sos_26) # label(axiom).  [clausify(18)].
5.44/5.73	67 -occurrence_of(A,tptp0) | -arboreal(B) | leaf_occ(B,A) | -subactivity_occurrence(B,A) | next_subocc(B,f2(B,A),tptp0) # label(sos_45) # label(axiom).  [clausify(5)].
5.44/5.73	78 -activity_occurrence(A) | occurrence_of(A,f9(A)) # label(sos_12) # label(axiom).  [clausify(20)].
5.44/5.73	79 -occurrence_of(A,B) | activity_occurrence(A) # label(sos_03) # label(axiom).  [clausify(21)].
5.44/5.73	97 occurrence_of(c1,tptp0) # label(goals) # label(negated_conjecture).  [clausify(35)].
5.44/5.73	103 tptp1 != tptp3 # label(sos_42) # label(axiom).  [assumption].
5.44/5.73	104 tptp3 != tptp1.  [copy(103),flip(a)].
5.44/5.73	109 -occurrence_of(A,B) | -leaf_occ(C,A) | -min_precedes(C,D,B) # label(sos_09) # label(axiom).  [clausify(10)].
5.44/5.73	111 subactivity_occurrence(A,B) | -root_occ(A,B) # label(sos_19) # label(axiom).  [clausify(19)].
5.44/5.73	116 -occurrence_of(A,tptp0) | occurrence_of(f6(A),tptp3) # label(sos_32) # label(axiom).  [clausify(14)].
5.44/5.73	117 -occurrence_of(A,tptp0) | leaf_occ(f6(A),A) # label(sos_32) # label(axiom).  [clausify(14)].
5.44/5.73	118 -occurrence_of(A,tptp0) | root_occ(f5(A),A) # label(sos_32) # label(axiom).  [clausify(14)].
5.44/5.73	121 occurrence_of(A,f8(B,A)) | -root_occ(B,A) # label(sos_19) # label(axiom).  [clausify(19)].
5.44/5.73	124 -occurrence_of(A,B) | -occurrence_of(A,C) | B = C # label(sos_08) # label(axiom).  [clausify(26)].
5.44/5.73	126 -min_precedes(A,B,C) | subactivity_occurrence(A,f10(C,A,B)) # label(sos_06) # label(axiom).  [clausify(22)].
5.44/5.73	127 -min_precedes(A,B,C) | subactivity_occurrence(B,f10(C,A,B)) # label(sos_06) # label(axiom).  [clausify(22)].
5.44/5.73	128 -min_precedes(A,B,C) | occurrence_of(f10(C,A,B),C) # label(sos_06) # label(axiom).  [clausify(22)].
5.44/5.73	130 -occurrence_of(A,B) | -root_occ(C,A) | -root_occ(D,A) | C = D # label(sos_29) # label(axiom).  [clausify(12)].
5.44/5.73	134 -occurrence_of(A,tptp0) | -arboreal(B) | leaf_occ(B,A) | -subactivity_occurrence(B,A) | occurrence_of(f2(B,A),tptp1) # label(sos_45) # label(axiom).  [clausify(5)].
5.44/5.73	136 A = B | -min_precedes(C,B,D) | -subactivity_occurrence(B,E) | -leaf_occ(A,E) | -root_occ(C,E) | -occurrence_of(E,D) | min_precedes(B,A,D) # label(sos_01) # label(axiom).  [clausify(27)].
5.44/5.73	144 -subactivity_occurrence(A,B) | -occurrence_of(B,f8(A,C)) | root_occ(A,B) | -root_occ(A,C).  [resolve(43,b,36,a)].
5.44/5.73	173 -occurrence_of(A,tptp0) | -min_precedes(B,f6(A),tptp0) | -min_precedes(f5(A),B,tptp0).  [resolve(60,b,61,a)].
5.44/5.73	174 -occurrence_of(A,tptp0) | arboreal(f5(A)).  [resolve(60,b,62,a)].
5.44/5.73	176 -occurrence_of(A,tptp0) | min_precedes(f5(A),f6(A),tptp0).  [resolve(60,b,64,a)].
5.44/5.73	185 -occurrence_of(A,tptp0) | -arboreal(B) | leaf_occ(B,A) | -subactivity_occurrence(B,A) | min_precedes(B,f2(B,A),tptp0).  [resolve(67,e,64,a)].
5.44/5.73	196 occurrence_of(A,f9(A)) | -occurrence_of(A,B).  [resolve(78,a,79,b)].
5.44/5.73	229 root_occ(f5(c1),c1).  [resolve(118,a,97,a)].
5.44/5.73	231 -occurrence_of(c1,A) | tptp0 = A.  [resolve(124,a,97,a)].
5.44/5.73	236 arboreal(f5(c1)).  [resolve(174,a,97,a)].
5.44/5.73	238 min_precedes(f5(c1),f6(c1),tptp0).  [resolve(176,a,97,a)].
5.44/5.73	263 -subactivity_occurrence(f5(c1),A) | -occurrence_of(A,f8(f5(c1),c1)) | root_occ(f5(c1),A).  [resolve(229,a,144,d)].
5.44/5.73	266 occurrence_of(c1,f8(f5(c1),c1)).  [resolve(229,a,121,b)].
5.44/5.73	267 subactivity_occurrence(f5(c1),c1).  [resolve(229,a,111,b)].
5.44/5.73	289 leaf_occ(f5(c1),c1) | min_precedes(f5(c1),f2(f5(c1),c1),tptp0).  [resolve(267,a,185,d),unit_del(a,97),unit_del(b,236)].
5.44/5.73	294 leaf_occ(f5(c1),c1) | occurrence_of(f2(f5(c1),c1),tptp1).  [resolve(267,a,134,d),unit_del(a,97),unit_del(b,236)].
5.44/5.73	354 -occurrence_of(A,tptp0) | -leaf_occ(f5(c1),A).  [resolve(238,a,109,c)].
5.44/5.73	426 f8(f5(c1),c1) = tptp0.  [resolve(266,a,231,a),flip(a)].
5.44/5.73	428 -subactivity_occurrence(f5(c1),A) | -occurrence_of(A,tptp0) | root_occ(f5(c1),A).  [back_rewrite(263),rewrite([426(7)])].
5.44/5.73	704 leaf_occ(f5(c1),c1) | f2(f5(c1),c1) = A | -subactivity_occurrence(f2(f5(c1),c1),B) | -leaf_occ(A,B) | -root_occ(f5(c1),B) | -occurrence_of(B,tptp0) | min_precedes(f2(f5(c1),c1),A,tptp0).  [resolve(289,b,136,b),flip(b)].
5.44/5.73	709 leaf_occ(f5(c1),c1) | occurrence_of(f10(tptp0,f5(c1),f2(f5(c1),c1)),tptp0).  [resolve(289,b,128,a)].
5.44/5.73	710 leaf_occ(f5(c1),c1) | subactivity_occurrence(f2(f5(c1),c1),f10(tptp0,f5(c1),f2(f5(c1),c1))).  [resolve(289,b,127,a)].
5.44/5.73	711 leaf_occ(f5(c1),c1) | subactivity_occurrence(f5(c1),f10(tptp0,f5(c1),f2(f5(c1),c1))).  [resolve(289,b,126,a)].
5.44/5.73	727 occurrence_of(f2(f5(c1),c1),tptp1).  [resolve(294,a,354,b),unit_del(b,97)].
5.44/5.73	728 occurrence_of(f2(f5(c1),c1),f9(f2(f5(c1),c1))).  [resolve(727,a,196,b)].
5.44/5.73	729 -occurrence_of(f2(f5(c1),c1),A) | tptp1 = A.  [resolve(727,a,124,b),flip(b)].
5.44/5.73	812 f9(f2(f5(c1),c1)) = tptp1.  [resolve(728,a,729,a),flip(a)].
5.44/5.73	1717 occurrence_of(f10(tptp0,f5(c1),f2(f5(c1),c1)),tptp0).  [resolve(709,a,354,b),unit_del(b,97)].
5.44/5.73	1732 root_occ(f5(f10(tptp0,f5(c1),f2(f5(c1),c1))),f10(tptp0,f5(c1),f2(f5(c1),c1))).  [resolve(1717,a,118,a)].
5.44/5.73	1733 leaf_occ(f6(f10(tptp0,f5(c1),f2(f5(c1),c1))),f10(tptp0,f5(c1),f2(f5(c1),c1))).  [resolve(1717,a,117,a)].
5.44/5.73	1734 occurrence_of(f6(f10(tptp0,f5(c1),f2(f5(c1),c1))),tptp3).  [resolve(1717,a,116,a)].
5.44/5.73	1736 occurrence_of(f6(f10(tptp0,f5(c1),f2(f5(c1),c1))),f9(f6(f10(tptp0,f5(c1),f2(f5(c1),c1))))).  [resolve(1734,a,196,b)].
5.44/5.73	1737 -occurrence_of(f6(f10(tptp0,f5(c1),f2(f5(c1),c1))),A) | tptp3 = A.  [resolve(1734,a,124,b),flip(b)].
5.44/5.73	2018 leaf_occ(f5(c1),c1) | root_occ(f5(c1),f10(tptp0,f5(c1),f2(f5(c1),c1))).  [resolve(711,b,428,a),unit_del(b,1717)].
5.44/5.73	2237 leaf_occ(f5(c1),c1) | -occurrence_of(f10(tptp0,f5(c1),f2(f5(c1),c1)),A) | -root_occ(B,f10(tptp0,f5(c1),f2(f5(c1),c1))) | f5(c1) = B.  [resolve(2018,b,130,c),flip(d)].
5.44/5.73	2586 leaf_occ(f5(c1),c1) | f2(f5(c1),c1) = A | -subactivity_occurrence(f2(f5(c1),c1),f10(tptp0,f5(c1),f2(f5(c1),c1))) | -leaf_occ(A,f10(tptp0,f5(c1),f2(f5(c1),c1))) | min_precedes(f2(f5(c1),c1),A,tptp0).  [resolve(704,e,2018,b),merge(g),unit_del(e,1717)].
5.44/5.73	3723 f9(f6(f10(tptp0,f5(c1),f2(f5(c1),c1)))) = tptp3.  [resolve(1736,a,1737,a),flip(a)].
5.44/5.73	7814 leaf_occ(f5(c1),c1) | -occurrence_of(f10(tptp0,f5(c1),f2(f5(c1),c1)),A) | f5(f10(tptp0,f5(c1),f2(f5(c1),c1))) = f5(c1).  [resolve(2237,c,1732,a),flip(c)].
5.44/5.73	7970 leaf_occ(f5(c1),c1) | f5(f10(tptp0,f5(c1),f2(f5(c1),c1))) = f5(c1).  [resolve(7814,b,1717,a)].
5.44/5.73	7976 f5(f10(tptp0,f5(c1),f2(f5(c1),c1))) = f5(c1).  [resolve(7970,a,354,b),unit_del(b,97)].
5.44/5.73	8042 -min_precedes(A,f6(f10(tptp0,f5(c1),f2(f5(c1),c1))),tptp0) | -min_precedes(f5(c1),A,tptp0).  [para(7976(a,1),173(c,1)),unit_del(a,1717)].
5.44/5.73	9696 leaf_occ(f5(c1),c1) | f2(f5(c1),c1) = A | -leaf_occ(A,f10(tptp0,f5(c1),f2(f5(c1),c1))) | min_precedes(f2(f5(c1),c1),A,tptp0).  [resolve(2586,c,710,b),merge(e)].
5.44/5.73	10538 leaf_occ(f5(c1),c1) | f6(f10(tptp0,f5(c1),f2(f5(c1),c1))) = f2(f5(c1),c1) | min_precedes(f2(f5(c1),c1),f6(f10(tptp0,f5(c1),f2(f5(c1),c1))),tptp0).  [resolve(9696,c,1733,a),flip(b)].
5.44/5.73	21845 leaf_occ(f5(c1),c1) | f6(f10(tptp0,f5(c1),f2(f5(c1),c1))) = f2(f5(c1),c1) | -min_precedes(f5(c1),f2(f5(c1),c1),tptp0).  [resolve(10538,c,8042,a)].
5.44/5.73	21876 leaf_occ(f5(c1),c1) | f6(f10(tptp0,f5(c1),f2(f5(c1),c1))) = f2(f5(c1),c1).  [resolve(21845,c,289,b),merge(c)].
5.44/5.73	21887 f6(f10(tptp0,f5(c1),f2(f5(c1),c1))) = f2(f5(c1),c1).  [resolve(21876,a,354,b),unit_del(b,97)].
5.44/5.73	22156 $F.  [back_rewrite(3723),rewrite([21887(9),812(5)]),flip(a),unit_del(a,104)].
5.44/5.73	
5.44/5.73	% SZS output end Refutation
5.44/5.73	============================== end of proof ==========================
5.44/5.73	
5.44/5.73	============================== STATISTICS ============================
5.44/5.73	
5.44/5.73	Given=5441. Generated=52686. Kept=22058. proofs=1.
5.44/5.73	Usable=3027. Sos=7078. Demods=86. Limbo=269, Disabled=11866. Hints=0.
5.44/5.73	Megabytes=49.74.
5.44/5.73	User_CPU=4.66, System_CPU=0.05, Wall_clock=5.
5.44/5.73	
5.44/5.73	============================== end of statistics =====================
5.44/5.73	
5.44/5.73	============================== end of search =========================
5.44/5.73	
5.44/5.73	THEOREM PROVED
5.44/5.73	% SZS status Theorem
5.44/5.73	
5.44/5.73	Exiting with 1 proof.
5.44/5.73	
5.44/5.73	Process 1830 exit (max_proofs) Thu Jul 15 06:22:19 2021
5.44/5.73	Prover9 interrupted
5.44/5.74	EOF