0.00/0.04	% 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.24	% Computer   : n003.star.cs.uiowa.edu
0.02/0.24	% Model      : x86_64 x86_64
0.02/0.24	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.02/0.24	% Memory     : 32218.625MB
0.02/0.24	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.02/0.24	% CPULimit   : 300
0.02/0.24	% DateTime   : Sat Jul 14 05:01:10 CDT 2018
0.02/0.24	% CPUTime    : 
0.06/0.48	============================== Prover9 ===============================
0.06/0.48	Prover9 (32) version 2009-11A, November 2009.
0.06/0.48	Process 9709 was started by sandbox on n003.star.cs.uiowa.edu,
0.06/0.48	Sat Jul 14 05:01:10 2018
0.06/0.48	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_9677_n003.star.cs.uiowa.edu".
0.06/0.48	============================== end of head ===========================
0.06/0.48	
0.06/0.48	============================== INPUT =================================
0.06/0.48	
0.06/0.48	% Reading from file /tmp/Prover9_9677_n003.star.cs.uiowa.edu
0.06/0.48	
0.06/0.48	set(prolog_style_variables).
0.06/0.48	set(auto2).
0.06/0.48	    % set(auto2) -> set(auto).
0.06/0.48	    % set(auto) -> set(auto_inference).
0.06/0.48	    % set(auto) -> set(auto_setup).
0.06/0.48	    % set(auto_setup) -> set(predicate_elim).
0.06/0.48	    % set(auto_setup) -> assign(eq_defs, unfold).
0.06/0.48	    % set(auto) -> set(auto_limits).
0.06/0.48	    % set(auto_limits) -> assign(max_weight, "100.000").
0.06/0.48	    % set(auto_limits) -> assign(sos_limit, 20000).
0.06/0.48	    % set(auto) -> set(auto_denials).
0.06/0.48	    % set(auto) -> set(auto_process).
0.06/0.48	    % set(auto2) -> assign(new_constants, 1).
0.06/0.48	    % set(auto2) -> assign(fold_denial_max, 3).
0.06/0.48	    % set(auto2) -> assign(max_weight, "200.000").
0.06/0.48	    % set(auto2) -> assign(max_hours, 1).
0.06/0.48	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.06/0.48	    % set(auto2) -> assign(max_seconds, 0).
0.06/0.48	    % set(auto2) -> assign(max_minutes, 5).
0.06/0.48	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.06/0.48	    % set(auto2) -> set(sort_initial_sos).
0.06/0.48	    % set(auto2) -> assign(sos_limit, -1).
0.06/0.48	    % set(auto2) -> assign(lrs_ticks, 3000).
0.06/0.48	    % set(auto2) -> assign(max_megs, 400).
0.06/0.48	    % set(auto2) -> assign(stats, some).
0.06/0.48	    % set(auto2) -> clear(echo_input).
0.06/0.48	    % set(auto2) -> set(quiet).
0.06/0.48	    % set(auto2) -> clear(print_initial_clauses).
0.06/0.48	    % set(auto2) -> clear(print_given).
0.06/0.48	assign(lrs_ticks,-1).
0.06/0.48	assign(sos_limit,10000).
0.06/0.48	assign(order,kbo).
0.06/0.48	set(lex_order_vars).
0.06/0.48	clear(print_given).
0.06/0.48	
0.06/0.48	% formulas(sos).  % not echoed (47 formulas)
0.06/0.48	
0.06/0.48	============================== end of input ==========================
0.06/0.48	
0.06/0.48	% From the command line: assign(max_seconds, 300).
0.06/0.48	
0.06/0.48	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.06/0.48	
0.06/0.48	% Formulas that are not ordinary clauses:
0.06/0.48	1 (all X104 all X105 (occurrence_of(X105,tptp0) & root_occ(X104,X105) -> (exists X106 (occurrence_of(X106,tptp1) & next_subocc(X104,X106,tptp0))))) # label(sos_45) # label(axiom) # label(non_clause).  [assumption].
0.06/0.48	2 (all X39 all X40 (subactivity_occurrence(X39,X40) -> activity_occurrence(X40) & activity_occurrence(X39))) # label(sos_11) # label(axiom) # label(non_clause).  [assumption].
0.06/0.48	3 (all X97 all X98 all X99 all X100 (min_precedes(X97,X99,X100) & precedes(X98,X99) & min_precedes(X97,X98,X100) -> min_precedes(X98,X99,X100))) # label(sos_31) # label(axiom) # label(non_clause).  [assumption].
0.06/0.48	4 (all X61 all X62 (earlier(X61,X62) -> -earlier(X62,X61))) # label(sos_20) # label(axiom) # label(non_clause).  [assumption].
0.06/0.48	5 (all X55 all X56 ((exists X57 (occurrence_of(X56,X57) & leaf(X55,X57) & subactivity_occurrence(X55,X56))) <-> leaf_occ(X55,X56))) # label(sos_18) # label(axiom) # label(non_clause).  [assumption].
0.06/0.48	6 (all X63 all X64 (precedes(X63,X64) <-> legal(X64) & earlier(X63,X64))) # label(sos_21) # label(axiom) # label(non_clause).  [assumption].
0.06/0.48	7 (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.06/0.48	8 (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.06/0.48	9 (all X3 all X4 all X5 all X6 all X7 (occurrence_of(X4,X3) & subactivity_occurrence(X5,X4) & X7 != X5 & min_precedes(X6,X5,X3) & leaf_occ(X7,X4) & root_occ(X6,X4) -> min_precedes(X5,X7,X3))) # label(sos_01) # label(axiom) # label(non_clause).  [assumption].
0.06/0.48	10 (all X65 all X66 all X67 (min_precedes(X65,X66,X67) -> -root(X66,X67))) # label(sos_22) # label(axiom) # label(non_clause).  [assumption].
0.06/0.48	11 (all X58 all X59 ((exists X60 (occurrence_of(X59,X60) & subactivity_occurrence(X58,X59) & root(X58,X60))) <-> root_occ(X58,X59))) # label(sos_19) # label(axiom) # label(non_clause).  [assumption].
0.06/0.48	12 (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.06/0.48	13 (all X28 all X29 all X30 (occurrence_of(X28,X29) & occurrence_of(X28,X30) -> X29 = X30)) # label(sos_08) # label(axiom) # label(non_clause).  [assumption].
0.06/0.48	14 (all X8 all X9 all X10 all X11 (occurrence_of(X9,X8) & leaf_occ(X11,X9) & -min_precedes(X10,X11,X8) & arboreal(X10) & subactivity_occurrence(X10,X9) -> X10 = X11)) # label(sos_02) # label(axiom) # label(non_clause).  [assumption].
0.06/0.48	15 (all X44 all X45 ((exists X46 (atomic(X46) & occurrence_of(X44,X46) & subactivity(X45,X46))) <-> atocc(X44,X45))) # label(sos_14) # label(axiom) # label(non_clause).  [assumption].
0.06/0.48	16 (all X14 all X15 all X16 all X17 (occurrence_of(X15,X14) & arboreal(X16) & arboreal(X17) & subactivity_occurrence(X16,X15) & subactivity_occurrence(X17,X15) -> X17 = X16 | min_precedes(X17,X16,X14) | min_precedes(X16,X17,X14))) # label(sos_04) # label(axiom) # label(non_clause).  [assumption].
0.06/0.48	17 (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.06/0.48	18 (all X41 (activity_occurrence(X41) -> (exists X42 (occurrence_of(X41,X42) & activity(X42))))) # label(sos_12) # label(axiom) # label(non_clause).  [assumption].
0.06/0.48	19 (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.06/0.48	20 (all X72 all X73 all X74 (min_precedes(X72,X73,X74) -> precedes(X72,X73))) # label(sos_24) # label(axiom) # label(non_clause).  [assumption].
0.06/0.48	21 (all X101 (occurrence_of(X101,tptp0) -> (exists X102 exists X103 (occurrence_of(X103,tptp3) & leaf_occ(X103,X101) & next_subocc(X102,X103,tptp0) & root_occ(X102,X101) & occurrence_of(X102,tptp4))))) # label(sos_32) # label(axiom) # label(non_clause).  [assumption].
0.06/0.48	22 (all X21 all X22 all X23 (min_precedes(X22,X23,X21) -> (exists X24 (occurrence_of(X24,X21) & subactivity_occurrence(X22,X24) & subactivity_occurrence(X23,X24))))) # label(sos_06) # label(axiom) # label(non_clause).  [assumption].
0.06/0.48	23 (all X47 all X48 ((root(X47,X48) | (exists X49 min_precedes(X49,X47,X48))) & -(exists X50 min_precedes(X47,X50,X48)) <-> leaf(X47,X48))) # label(sos_15) # label(axiom) # label(non_clause).  [assumption].
0.06/0.48	24 (all X0 all X1 (occurrence_of(X1,X0) & -atomic(X0) -> (exists X2 (subactivity_occurrence(X2,X1) & root(X2,X0))))) # label(sos) # label(axiom) # label(non_clause).  [assumption].
0.06/0.48	25 (all X51 all X52 (occurrence_of(X51,X52) -> (atomic(X52) <-> arboreal(X51)))) # label(sos_16) # label(axiom) # label(non_clause).  [assumption].
0.06/0.48	26 (all X94 all X95 all X96 (earlier(X95,X96) & earlier(X94,X95) -> earlier(X94,X96))) # label(sos_30) # label(axiom) # label(non_clause).  [assumption].
0.06/0.48	27 (all X25 all X26 (leaf(X25,X26) & -atomic(X26) -> (exists X27 (occurrence_of(X27,X26) & leaf_occ(X25,X27))))) # label(sos_07) # label(axiom) # label(non_clause).  [assumption].
0.06/0.48	28 (all X53 all X54 (root(X53,X54) -> legal(X53))) # label(sos_17) # label(axiom) # label(non_clause).  [assumption].
0.06/0.48	29 (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.06/0.48	30 (all X12 all X13 (occurrence_of(X13,X12) -> activity_occurrence(X13) & activity(X12))) # label(sos_03) # label(axiom) # label(non_clause).  [assumption].
0.06/0.48	31 (all X43 (legal(X43) -> arboreal(X43))) # label(sos_13) # label(axiom) # label(non_clause).  [assumption].
0.06/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.06/0.48	33 (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.06/0.48	34 (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.06/0.48	35 --(exists X107 occurrence_of(X107,tptp0)) # label(goals) # label(negated_conjecture) # label(non_clause).  [assumption].
0.06/0.48	
0.06/0.48	============================== end of process non-clausal formulas ===
0.06/0.48	
0.06/0.48	============================== PROCESS INITIAL CLAUSES ===============
0.06/0.48	
0.06/0.48	============================== PREDICATE ELIMINATION =================
0.06/0.48	36 root(A,f3(A,B)) | -root_occ(A,B) # label(sos_19) # label(axiom).  [clausify(11)].
0.06/0.48	37 -min_precedes(A,B,C) | -root(B,C) # label(sos_22) # label(axiom).  [clausify(10)].
0.06/0.48	38 -root(A,B) | legal(A) # label(sos_17) # label(axiom).  [clausify(28)].
0.06/0.48	Derived: -root_occ(A,B) | -min_precedes(C,A,f3(A,B)).  [resolve(36,a,37,b)].
0.06/0.48	Derived: -root_occ(A,B) | legal(A).  [resolve(36,a,38,a)].
0.06/0.48	39 -root(A,B) | atocc(A,f14(B,A)) # label(sos_05) # label(axiom).  [clausify(32)].
0.06/0.48	Derived: atocc(A,f14(f3(A,B),A)) | -root_occ(A,B).  [resolve(39,a,36,a)].
0.06/0.48	40 -root(A,B) | subactivity(f14(B,A),B) # label(sos_05) # label(axiom).  [clausify(32)].
0.06/0.48	Derived: subactivity(f14(f3(A,B),A),f3(A,B)) | -root_occ(A,B).  [resolve(40,a,36,a)].
0.06/0.48	41 -min_precedes(A,B,C) | root(f6(A,B,C),C) # label(sos_23) # label(axiom).  [clausify(19)].
0.06/0.48	Derived: -min_precedes(A,B,C) | -min_precedes(D,f6(A,B,C),C).  [resolve(41,b,37,b)].
0.06/0.48	Derived: -min_precedes(A,B,C) | legal(f6(A,B,C)).  [resolve(41,b,38,a)].
0.06/0.48	Derived: -min_precedes(A,B,C) | atocc(f6(A,B,C),f14(C,f6(A,B,C))).  [resolve(41,b,39,a)].
0.06/0.48	Derived: -min_precedes(A,B,C) | subactivity(f14(C,f6(A,B,C)),C).  [resolve(41,b,40,a)].
0.06/0.48	42 -occurrence_of(A,B) | atomic(B) | root(f12(B,A),B) # label(sos) # label(axiom).  [clausify(24)].
0.06/0.48	Derived: -occurrence_of(A,B) | atomic(B) | -min_precedes(C,f12(B,A),B).  [resolve(42,c,37,b)].
0.06/0.48	Derived: -occurrence_of(A,B) | atomic(B) | legal(f12(B,A)).  [resolve(42,c,38,a)].
0.06/0.48	Derived: -occurrence_of(A,B) | atomic(B) | atocc(f12(B,A),f14(B,f12(B,A))).  [resolve(42,c,39,a)].
0.06/0.48	Derived: -occurrence_of(A,B) | atomic(B) | subactivity(f14(B,f12(B,A)),B).  [resolve(42,c,40,a)].
0.06/0.48	43 -occurrence_of(A,B) | -subactivity_occurrence(C,A) | -root(C,B) | root_occ(C,A) # label(sos_19) # label(axiom).  [clausify(11)].
0.06/0.48	Derived: -occurrence_of(A,f3(B,C)) | -subactivity_occurrence(B,A) | root_occ(B,A) | -root_occ(B,C).  [resolve(43,c,36,a)].
0.06/0.48	Derived: -occurrence_of(A,B) | -subactivity_occurrence(f6(C,D,B),A) | root_occ(f6(C,D,B),A) | -min_precedes(C,D,B).  [resolve(43,c,41,b)].
0.06/0.48	Derived: -occurrence_of(A,B) | -subactivity_occurrence(f12(B,C),A) | root_occ(f12(B,C),A) | -occurrence_of(C,B) | atomic(B).  [resolve(43,c,42,c)].
0.06/0.48	44 -root(A,B) | min_precedes(A,f10(A,B),B) | leaf(A,B) # label(sos_15) # label(axiom).  [clausify(23)].
0.06/0.48	Derived: min_precedes(A,f10(A,f3(A,B)),f3(A,B)) | leaf(A,f3(A,B)) | -root_occ(A,B).  [resolve(44,a,36,a)].
0.06/0.48	Derived: min_precedes(f6(A,B,C),f10(f6(A,B,C),C),C) | leaf(f6(A,B,C),C) | -min_precedes(A,B,C).  [resolve(44,a,41,b)].
0.06/0.48	Derived: min_precedes(f12(A,B),f10(f12(A,B),A),A) | leaf(f12(A,B),A) | -occurrence_of(B,A) | atomic(A).  [resolve(44,a,42,c)].
0.06/0.48	45 root(A,B) | min_precedes(f11(A,B),A,B) | -leaf(A,B) # label(sos_15) # label(axiom).  [clausify(23)].
0.06/0.48	Derived: min_precedes(f11(A,B),A,B) | -leaf(A,B) | -min_precedes(C,A,B).  [resolve(45,a,37,b)].
0.06/0.48	Derived: min_precedes(f11(A,B),A,B) | -leaf(A,B) | legal(A).  [resolve(45,a,38,a)].
0.06/0.48	Derived: min_precedes(f11(A,B),A,B) | -leaf(A,B) | atocc(A,f14(B,A)).  [resolve(45,a,39,a)].
0.06/0.48	Derived: min_precedes(f11(A,B),A,B) | -leaf(A,B) | subactivity(f14(B,A),B).  [resolve(45,a,40,a)].
0.06/0.48	Derived: min_precedes(f11(A,B),A,B) | -leaf(A,B) | -occurrence_of(C,B) | -subactivity_occurrence(A,C) | root_occ(A,C).  [resolve(45,a,43,c)].
0.06/0.48	46 leaf(A,f2(A,B)) | -leaf_occ(A,B) # label(sos_18) # label(axiom).  [clausify(5)].
0.06/0.48	47 -min_precedes(A,B,C) | -leaf(A,C) # label(sos_15) # label(axiom).  [clausify(23)].
0.06/0.48	Derived: -leaf_occ(A,B) | -min_precedes(A,C,f2(A,B)).  [resolve(46,a,47,b)].
0.06/0.48	48 -leaf(A,B) | atomic(B) | occurrence_of(f13(A,B),B) # label(sos_07) # label(axiom).  [clausify(27)].
0.06/0.48	Derived: atomic(f2(A,B)) | occurrence_of(f13(A,f2(A,B)),f2(A,B)) | -leaf_occ(A,B).  [resolve(48,a,46,a)].
0.06/0.48	49 -leaf(A,B) | atomic(B) | leaf_occ(A,f13(A,B)) # label(sos_07) # label(axiom).  [clausify(27)].
0.06/0.48	Derived: atomic(f2(A,B)) | leaf_occ(A,f13(A,f2(A,B))) | -leaf_occ(A,B).  [resolve(49,a,46,a)].
0.06/0.48	50 -occurrence_of(A,B) | -leaf(C,B) | -subactivity_occurrence(C,A) | leaf_occ(C,A) # label(sos_18) # label(axiom).  [clausify(5)].
0.06/0.48	Derived: -occurrence_of(A,f2(B,C)) | -subactivity_occurrence(B,A) | leaf_occ(B,A) | -leaf_occ(B,C).  [resolve(50,b,46,a)].
0.06/0.48	51 -min_precedes(A,B,C) | min_precedes(B,f10(B,C),C) | leaf(B,C) # label(sos_15) # label(axiom).  [clausify(23)].
0.06/0.48	Derived: -min_precedes(A,B,C) | min_precedes(B,f10(B,C),C) | -min_precedes(B,D,C).  [resolve(51,c,47,b)].
0.06/0.48	Derived: -min_precedes(A,B,C) | min_precedes(B,f10(B,C),C) | atomic(C) | occurrence_of(f13(B,C),C).  [resolve(51,c,48,a)].
0.06/0.48	Derived: -min_precedes(A,B,C) | min_precedes(B,f10(B,C),C) | atomic(C) | leaf_occ(B,f13(B,C)).  [resolve(51,c,49,a)].
0.06/0.48	Derived: -min_precedes(A,B,C) | min_precedes(B,f10(B,C),C) | -occurrence_of(D,C) | -subactivity_occurrence(B,D) | leaf_occ(B,D).  [resolve(51,c,50,b)].
0.06/0.48	52 min_precedes(A,f10(A,f3(A,B)),f3(A,B)) | leaf(A,f3(A,B)) | -root_occ(A,B).  [resolve(44,a,36,a)].
0.06/0.48	Derived: min_precedes(A,f10(A,f3(A,B)),f3(A,B)) | -root_occ(A,B) | -min_precedes(A,C,f3(A,B)).  [resolve(52,b,47,b)].
0.06/0.48	Derived: min_precedes(A,f10(A,f3(A,B)),f3(A,B)) | -root_occ(A,B) | atomic(f3(A,B)) | occurrence_of(f13(A,f3(A,B)),f3(A,B)).  [resolve(52,b,48,a)].
0.06/0.48	Derived: min_precedes(A,f10(A,f3(A,B)),f3(A,B)) | -root_occ(A,B) | atomic(f3(A,B)) | leaf_occ(A,f13(A,f3(A,B))).  [resolve(52,b,49,a)].
0.06/0.48	Derived: min_precedes(A,f10(A,f3(A,B)),f3(A,B)) | -root_occ(A,B) | -occurrence_of(C,f3(A,B)) | -subactivity_occurrence(A,C) | leaf_occ(A,C).  [resolve(52,b,50,b)].
0.06/0.48	53 min_precedes(f6(A,B,C),f10(f6(A,B,C),C),C) | leaf(f6(A,B,C),C) | -min_precedes(A,B,C).  [resolve(44,a,41,b)].
0.06/0.48	Derived: min_precedes(f6(A,B,C),f10(f6(A,B,C),C),C) | -min_precedes(A,B,C) | -min_precedes(f6(A,B,C),D,C).  [resolve(53,b,47,b)].
0.06/0.48	Derived: min_precedes(f6(A,B,C),f10(f6(A,B,C),C),C) | -min_precedes(A,B,C) | atomic(C) | occurrence_of(f13(f6(A,B,C),C),C).  [resolve(53,b,48,a)].
0.06/0.48	Derived: min_precedes(f6(A,B,C),f10(f6(A,B,C),C),C) | -min_precedes(A,B,C) | atomic(C) | leaf_occ(f6(A,B,C),f13(f6(A,B,C),C)).  [resolve(53,b,49,a)].
0.06/0.48	Derived: min_precedes(f6(A,B,C),f10(f6(A,B,C),C),C) | -min_precedes(A,B,C) | -occurrence_of(D,C) | -subactivity_occurrence(f6(A,B,C),D) | leaf_occ(f6(A,B,C),D).  [resolve(53,b,50,b)].
0.06/0.48	54 min_precedes(f12(A,B),f10(f12(A,B),A),A) | leaf(f12(A,B),A) | -occurrence_of(B,A) | atomic(A).  [resolve(44,a,42,c)].
0.06/0.48	Derived: min_precedes(f12(A,B),f10(f12(A,B),A),A) | -occurrence_of(B,A) | atomic(A) | -min_precedes(f12(A,B),C,A).  [resolve(54,b,47,b)].
0.06/0.48	Derived: min_precedes(f12(A,B),f10(f12(A,B),A),A) | -occurrence_of(B,A) | atomic(A) | atomic(A) | occurrence_of(f13(f12(A,B),A),A).  [resolve(54,b,48,a)].
0.06/0.48	Derived: min_precedes(f12(A,B),f10(f12(A,B),A),A) | -occurrence_of(B,A) | atomic(A) | atomic(A) | leaf_occ(f12(A,B),f13(f12(A,B),A)).  [resolve(54,b,49,a)].
0.06/0.48	Derived: min_precedes(f12(A,B),f10(f12(A,B),A),A) | -occurrence_of(B,A) | atomic(A) | -occurrence_of(C,A) | -subactivity_occurrence(f12(A,B),C) | leaf_occ(f12(A,B),C).  [resolve(54,b,50,b)].
0.06/0.48	55 min_precedes(f11(A,B),A,B) | -leaf(A,B) | -min_precedes(C,A,B).  [resolve(45,a,37,b)].
0.06/0.48	Derived: min_precedes(f11(A,f2(A,B)),A,f2(A,B)) | -min_precedes(C,A,f2(A,B)) | -leaf_occ(A,B).  [resolve(55,b,46,a)].
0.06/0.48	Derived: min_precedes(f11(A,B),A,B) | -min_precedes(C,A,B) | -min_precedes(D,A,B) | min_precedes(A,f10(A,B),B).  [resolve(55,b,51,c)].
0.06/0.48	56 min_precedes(f11(A,B),A,B) | -leaf(A,B) | legal(A).  [resolve(45,a,38,a)].
0.06/0.48	Derived: min_precedes(f11(A,f2(A,B)),A,f2(A,B)) | legal(A) | -leaf_occ(A,B).  [resolve(56,b,46,a)].
0.06/0.48	Derived: min_precedes(f11(A,f3(A,B)),A,f3(A,B)) | legal(A) | min_precedes(A,f10(A,f3(A,B)),f3(A,B)) | -root_occ(A,B).  [resolve(56,b,52,b)].
0.06/0.48	Derived: min_precedes(f11(f6(A,B,C),C),f6(A,B,C),C) | legal(f6(A,B,C)) | min_precedes(f6(A,B,C),f10(f6(A,B,C),C),C) | -min_precedes(A,B,C).  [resolve(56,b,53,b)].
0.06/0.48	Derived: min_precedes(f11(f12(A,B),A),f12(A,B),A) | legal(f12(A,B)) | min_precedes(f12(A,B),f10(f12(A,B),A),A) | -occurrence_of(B,A) | atomic(A).  [resolve(56,b,54,b)].
0.06/0.48	57 min_precedes(f11(A,B),A,B) | -leaf(A,B) | atocc(A,f14(B,A)).  [resolve(45,a,39,a)].
0.06/0.48	Derived: min_precedes(f11(A,f2(A,B)),A,f2(A,B)) | atocc(A,f14(f2(A,B),A)) | -leaf_occ(A,B).  [resolve(57,b,46,a)].
0.06/0.48	Derived: min_precedes(f11(A,f3(A,B)),A,f3(A,B)) | atocc(A,f14(f3(A,B),A)) | min_precedes(A,f10(A,f3(A,B)),f3(A,B)) | -root_occ(A,B).  [resolve(57,b,52,b)].
0.06/0.48	Derived: min_precedes(f11(f6(A,B,C),C),f6(A,B,C),C) | atocc(f6(A,B,C),f14(C,f6(A,B,C))) | min_precedes(f6(A,B,C),f10(f6(A,B,C),C),C) | -min_precedes(A,B,C).  [resolve(57,b,53,b)].
0.06/0.48	Derived: min_precedes(f11(f12(A,B),A),f12(A,B),A) | atocc(f12(A,B),f14(A,f12(A,B))) | min_precedes(f12(A,B),f10(f12(A,B),A),A) | -occurrence_of(B,A) | atomic(A).  [resolve(57,b,54,b)].
0.06/0.48	58 min_precedes(f11(A,B),A,B) | -leaf(A,B) | subactivity(f14(B,A),B).  [resolve(45,a,40,a)].
0.06/0.48	Derived: min_precedes(f11(A,f2(A,B)),A,f2(A,B)) | subactivity(f14(f2(A,B),A),f2(A,B)) | -leaf_occ(A,B).  [resolve(58,b,46,a)].
0.06/0.48	Derived: min_precedes(f11(A,f3(A,B)),A,f3(A,B)) | subactivity(f14(f3(A,B),A),f3(A,B)) | min_precedes(A,f10(A,f3(A,B)),f3(A,B)) | -root_occ(A,B).  [resolve(58,b,52,b)].
0.06/0.48	Derived: min_precedes(f11(f6(A,B,C),C),f6(A,B,C),C) | subactivity(f14(C,f6(A,B,C)),C) | min_precedes(f6(A,B,C),f10(f6(A,B,C),C),C) | -min_precedes(A,B,C).  [resolve(58,b,53,b)].
0.06/0.48	Derived: min_precedes(f11(f12(A,B),A),f12(A,B),A) | subactivity(f14(A,f12(A,B)),A) | min_precedes(f12(A,B),f10(f12(A,B),A),A) | -occurrence_of(B,A) | atomic(A).  [resolve(58,b,54,b)].
0.06/0.48	59 min_precedes(f11(A,B),A,B) | -leaf(A,B) | -occurrence_of(C,B) | -subactivity_occurrence(A,C) | root_occ(A,C).  [resolve(45,a,43,c)].
0.06/0.48	Derived: min_precedes(f11(A,f2(A,B)),A,f2(A,B)) | -occurrence_of(C,f2(A,B)) | -subactivity_occurrence(A,C) | root_occ(A,C) | -leaf_occ(A,B).  [resolve(59,b,46,a)].
0.06/0.48	Derived: min_precedes(f11(A,f3(A,B)),A,f3(A,B)) | -occurrence_of(C,f3(A,B)) | -subactivity_occurrence(A,C) | root_occ(A,C) | min_precedes(A,f10(A,f3(A,B)),f3(A,B)) | -root_occ(A,B).  [resolve(59,b,52,b)].
0.06/0.48	Derived: min_precedes(f11(f6(A,B,C),C),f6(A,B,C),C) | -occurrence_of(D,C) | -subactivity_occurrence(f6(A,B,C),D) | root_occ(f6(A,B,C),D) | min_precedes(f6(A,B,C),f10(f6(A,B,C),C),C) | -min_precedes(A,B,C).  [resolve(59,b,53,b)].
0.06/0.48	Derived: min_precedes(f11(f12(A,B),A),f12(A,B),A) | -occurrence_of(C,A) | -subactivity_occurrence(f12(A,B),C) | root_occ(f12(A,B),C) | min_precedes(f12(A,B),f10(f12(A,B),A),A) | -occurrence_of(B,A) | atomic(A).  [resolve(59,b,54,b)].
0.06/0.48	60 -occurrence_of(A,tptp0) | next_subocc(f7(A),f8(A),tptp0) # label(sos_32) # label(axiom).  [clausify(21)].
0.06/0.48	61 -next_subocc(A,B,C) | -min_precedes(D,B,C) | -min_precedes(A,D,C) # label(sos_26) # label(axiom).  [clausify(34)].
0.06/0.48	62 -next_subocc(A,B,C) | arboreal(A) # label(sos_25) # label(axiom).  [clausify(12)].
0.06/0.48	63 -next_subocc(A,B,C) | arboreal(B) # label(sos_25) # label(axiom).  [clausify(12)].
0.06/0.48	64 -next_subocc(A,B,C) | min_precedes(A,B,C) # label(sos_26) # label(axiom).  [clausify(34)].
0.06/0.48	Derived: -occurrence_of(A,tptp0) | -min_precedes(B,f8(A),tptp0) | -min_precedes(f7(A),B,tptp0).  [resolve(60,b,61,a)].
0.06/0.48	Derived: -occurrence_of(A,tptp0) | arboreal(f7(A)).  [resolve(60,b,62,a)].
0.06/0.48	Derived: -occurrence_of(A,tptp0) | arboreal(f8(A)).  [resolve(60,b,63,a)].
0.06/0.48	Derived: -occurrence_of(A,tptp0) | min_precedes(f7(A),f8(A),tptp0).  [resolve(60,b,64,a)].
0.06/0.48	65 -occurrence_of(A,tptp0) | -root_occ(B,A) | next_subocc(B,f1(B,A),tptp0) # label(sos_45) # label(axiom).  [clausify(1)].
0.06/0.48	Derived: -occurrence_of(A,tptp0) | -root_occ(B,A) | -min_precedes(C,f1(B,A),tptp0) | -min_precedes(B,C,tptp0).  [resolve(65,c,61,a)].
0.06/0.48	Derived: -occurrence_of(A,tptp0) | -root_occ(B,A) | arboreal(B).  [resolve(65,c,62,a)].
0.06/0.48	Derived: -occurrence_of(A,tptp0) | -root_occ(B,A) | arboreal(f1(B,A)).  [resolve(65,c,63,a)].
0.06/0.48	Derived: -occurrence_of(A,tptp0) | -root_occ(B,A) | min_precedes(B,f1(B,A),tptp0).  [resolve(65,c,64,a)].
0.06/0.48	66 next_subocc(A,B,C) | min_precedes(f15(A,B,C),B,C) | -min_precedes(A,B,C) # label(sos_26) # label(axiom).  [clausify(34)].
0.06/0.48	Derived: min_precedes(f15(A,B,C),B,C) | -min_precedes(A,B,C) | -min_precedes(D,B,C) | -min_precedes(A,D,C).  [resolve(66,a,61,a)].
0.06/0.48	Derived: min_precedes(f15(A,B,C),B,C) | -min_precedes(A,B,C) | arboreal(A).  [resolve(66,a,62,a)].
0.06/0.48	Derived: min_precedes(f15(A,B,C),B,C) | -min_precedes(A,B,C) | arboreal(B).  [resolve(66,a,63,a)].
0.06/0.48	67 next_subocc(A,B,C) | min_precedes(A,f15(A,B,C),C) | -min_precedes(A,B,C) # label(sos_26) # label(axiom).  [clausify(34)].
0.06/0.48	Derived: min_precedes(A,f15(A,B,C),C) | -min_precedes(A,B,C) | -min_precedes(D,B,C) | -min_precedes(A,D,C).  [resolve(67,a,61,a)].
0.06/0.48	Derived: min_precedes(A,f15(A,B,C),C) | -min_precedes(A,B,C) | arboreal(A).  [resolve(67,a,62,a)].
0.06/0.48	Derived: min_precedes(A,f15(A,B,C),C) | -min_precedes(A,B,C) | arboreal(B).  [resolve(67,a,63,a)].
0.06/0.48	68 -precedes(A,B) | legal(B) # label(sos_21) # label(axiom).  [clausify(6)].
0.06/0.48	69 -legal(A) | arboreal(A) # label(sos_13) # label(axiom).  [clausify(31)].
0.06/0.48	Derived: -precedes(A,B) | arboreal(B).  [resolve(68,b,69,a)].
0.06/0.48	70 precedes(A,B) | -legal(B) | -earlier(A,B) # label(sos_21) # label(axiom).  [clausify(6)].
0.06/0.48	Derived: precedes(A,B) | -earlier(A,B) | -precedes(C,B).  [resolve(70,b,68,b)].
0.06/0.48	71 -root_occ(A,B) | legal(A).  [resolve(36,a,38,a)].
0.06/0.48	Derived: -root_occ(A,B) | arboreal(A).  [resolve(71,b,69,a)].
0.06/0.48	Derived: -root_occ(A,B) | precedes(C,A) | -earlier(C,A).  [resolve(71,b,70,b)].
0.06/0.48	72 -min_precedes(A,B,C) | legal(f6(A,B,C)).  [resolve(41,b,38,a)].
0.06/0.48	Derived: -min_precedes(A,B,C) | arboreal(f6(A,B,C)).  [resolve(72,b,69,a)].
0.06/0.48	Derived: -min_precedes(A,B,C) | precedes(D,f6(A,B,C)) | -earlier(D,f6(A,B,C)).  [resolve(72,b,70,b)].
0.06/0.48	73 -occurrence_of(A,B) | atomic(B) | legal(f12(B,A)).  [resolve(42,c,38,a)].
0.06/0.48	Derived: -occurrence_of(A,B) | atomic(B) | arboreal(f12(B,A)).  [resolve(73,c,69,a)].
0.06/0.48	Derived: -occurrence_of(A,B) | atomic(B) | precedes(C,f12(B,A)) | -earlier(C,f12(B,A)).  [resolve(73,c,70,b)].
0.06/0.48	74 min_precedes(f11(A,f2(A,B)),A,f2(A,B)) | legal(A) | -leaf_occ(A,B).  [resolve(56,b,46,a)].
0.06/0.48	Derived: min_precedes(f11(A,f2(A,B)),A,f2(A,B)) | -leaf_occ(A,B) | arboreal(A).  [resolve(74,b,69,a)].
0.06/0.48	Derived: min_precedes(f11(A,f2(A,B)),A,f2(A,B)) | -leaf_occ(A,B) | precedes(C,A) | -earlier(C,A).  [resolve(74,b,70,b)].
0.06/0.48	75 min_precedes(f11(A,f3(A,B)),A,f3(A,B)) | legal(A) | min_precedes(A,f10(A,f3(A,B)),f3(A,B)) | -root_occ(A,B).  [resolve(56,b,52,b)].
0.06/0.48	76 min_precedes(f11(f6(A,B,C),C),f6(A,B,C),C) | legal(f6(A,B,C)) | min_precedes(f6(A,B,C),f10(f6(A,B,C),C),C) | -min_precedes(A,B,C).  [resolve(56,b,53,b)].
0.06/0.48	77 min_precedes(f11(f12(A,B),A),f12(A,B),A) | legal(f12(A,B)) | min_precedes(f12(A,B),f10(f12(A,B),A),A) | -occurrence_of(B,A) | atomic(A).  [resolve(56,b,54,b)].
0.06/0.48	78 -activity_occurrence(A) | occurrence_of(A,f5(A)) # label(sos_12) # label(axiom).  [clausify(18)].
0.06/0.48	79 -subactivity_occurrence(A,B) | activity_occurrence(B) # label(sos_11) # label(axiom).  [clausify(2)].
0.06/0.48	80 -subactivity_occurrence(A,B) | activity_occurrence(A) # label(sos_11) # label(axiom).  [clausify(2)].
0.06/0.48	81 -occurrence_of(A,B) | activity_occurrence(A) # label(sos_03) # label(axiom).  [clausify(30)].
0.06/0.48	Derived: occurrence_of(A,f5(A)) | -subactivity_occurrence(B,A).  [resolve(78,a,79,b)].
0.06/0.48	Derived: occurrence_of(A,f5(A)) | -subactivity_occurrence(A,B).  [resolve(78,a,80,b)].
0.06/0.48	Derived: occurrence_of(A,f5(A)) | -occurrence_of(A,B).  [resolve(78,a,81,b)].
0.06/0.48	82 -atomic(A) | -occurrence_of(B,A) | -subactivity(C,A) | atocc(B,C) # label(sos_14) # label(axiom).  [clausify(15)].
0.06/0.48	83 atomic(f4(A,B)) | -atocc(A,B) # label(sos_14) # label(axiom).  [clausify(15)].
0.06/0.48	84 occurrence_of(A,f4(A,B)) | -atocc(A,B) # label(sos_14) # label(axiom).  [clausify(15)].
0.06/0.48	85 subactivity(A,f4(B,A)) | -atocc(B,A) # label(sos_14) # label(axiom).  [clausify(15)].
0.06/0.48	Derived: -atomic(A) | -occurrence_of(B,A) | -subactivity(C,A) | atomic(f4(B,C)).  [resolve(82,d,83,b)].
0.06/0.48	Derived: -atomic(A) | -occurrence_of(B,A) | -subactivity(C,A) | occurrence_of(B,f4(B,C)).  [resolve(82,d,84,b)].
0.06/0.48	Derived: -atomic(A) | -occurrence_of(B,A) | -subactivity(C,A) | subactivity(C,f4(B,C)).  [resolve(82,d,85,b)].
4.44/4.66	86 atocc(A,f14(f3(A,B),A)) | -root_occ(A,B).  [resolve(39,a,36,a)].
4.44/4.66	Derived: -root_occ(A,B) | atomic(f4(A,f14(f3(A,B),A))).  [resolve(86,a,83,b)].
4.44/4.66	Derived: -root_occ(A,B) | occurrence_of(A,f4(A,f14(f3(A,B),A))).  [resolve(86,a,84,b)].
4.44/4.66	Derived: -root_occ(A,B) | subactivity(f14(f3(A,B),A),f4(A,f14(f3(A,B),A))).  [resolve(86,a,85,b)].
4.44/4.66	87 -min_precedes(A,B,C) | atocc(f6(A,B,C),f14(C,f6(A,B,C))).  [resolve(41,b,39,a)].
4.44/4.66	Derived: -min_precedes(A,B,C) | atomic(f4(f6(A,B,C),f14(C,f6(A,B,C)))).  [resolve(87,b,83,b)].
4.44/4.66	Derived: -min_precedes(A,B,C) | occurrence_of(f6(A,B,C),f4(f6(A,B,C),f14(C,f6(A,B,C)))).  [resolve(87,b,84,b)].
4.44/4.66	Derived: -min_precedes(A,B,C) | subactivity(f14(C,f6(A,B,C)),f4(f6(A,B,C),f14(C,f6(A,B,C)))).  [resolve(87,b,85,b)].
4.44/4.66	88 -occurrence_of(A,B) | atomic(B) | atocc(f12(B,A),f14(B,f12(B,A))).  [resolve(42,c,39,a)].
4.44/4.66	Derived: -occurrence_of(A,B) | atomic(B) | atomic(f4(f12(B,A),f14(B,f12(B,A)))).  [resolve(88,c,83,b)].
4.44/4.66	Derived: -occurrence_of(A,B) | atomic(B) | occurrence_of(f12(B,A),f4(f12(B,A),f14(B,f12(B,A)))).  [resolve(88,c,84,b)].
4.44/4.66	Derived: -occurrence_of(A,B) | atomic(B) | subactivity(f14(B,f12(B,A)),f4(f12(B,A),f14(B,f12(B,A)))).  [resolve(88,c,85,b)].
4.44/4.66	89 min_precedes(f11(A,f2(A,B)),A,f2(A,B)) | atocc(A,f14(f2(A,B),A)) | -leaf_occ(A,B).  [resolve(57,b,46,a)].
4.44/4.66	Derived: min_precedes(f11(A,f2(A,B)),A,f2(A,B)) | -leaf_occ(A,B) | atomic(f4(A,f14(f2(A,B),A))).  [resolve(89,b,83,b)].
4.44/4.66	Derived: min_precedes(f11(A,f2(A,B)),A,f2(A,B)) | -leaf_occ(A,B) | occurrence_of(A,f4(A,f14(f2(A,B),A))).  [resolve(89,b,84,b)].
4.44/4.66	Derived: min_precedes(f11(A,f2(A,B)),A,f2(A,B)) | -leaf_occ(A,B) | subactivity(f14(f2(A,B),A),f4(A,f14(f2(A,B),A))).  [resolve(89,b,85,b)].
4.44/4.66	90 min_precedes(f11(A,f3(A,B)),A,f3(A,B)) | atocc(A,f14(f3(A,B),A)) | min_precedes(A,f10(A,f3(A,B)),f3(A,B)) | -root_occ(A,B).  [resolve(57,b,52,b)].
4.44/4.66	91 min_precedes(f11(f6(A,B,C),C),f6(A,B,C),C) | atocc(f6(A,B,C),f14(C,f6(A,B,C))) | min_precedes(f6(A,B,C),f10(f6(A,B,C),C),C) | -min_precedes(A,B,C).  [resolve(57,b,53,b)].
4.44/4.66	92 min_precedes(f11(f12(A,B),A),f12(A,B),A) | atocc(f12(A,B),f14(A,f12(A,B))) | min_precedes(f12(A,B),f10(f12(A,B),A),A) | -occurrence_of(B,A) | atomic(A).  [resolve(57,b,54,b)].
4.44/4.66	
4.44/4.66	============================== end predicate elimination =============
4.44/4.66	
4.44/4.66	Auto_denials:  (non-Horn, no changes).
4.44/4.66	
4.44/4.66	Term ordering decisions:
4.44/4.66	Function symbol KB weights:  tptp0=1. tptp1=1. tptp3=1. tptp4=1. tptp2=1. c1=1. f1=1. f2=1. f3=1. f4=1. f10=1. f11=1. f12=1. f13=1. f14=1. f5=1. f7=1. f8=1. f6=1. f9=1. f15=1.
4.44/4.66	
4.44/4.66	============================== end of process initial clauses ========
4.44/4.66	
4.44/4.66	============================== CLAUSES FOR SEARCH ====================
4.44/4.66	
4.44/4.66	============================== end of clauses for search =============
4.44/4.66	
4.44/4.66	============================== SEARCH ================================
4.44/4.66	
4.44/4.66	% Starting search at 0.02 seconds.
4.44/4.66	
4.44/4.66	Low Water (keep): wt=76.000, iters=3344
4.44/4.66	
4.44/4.66	Low Water (keep): wt=75.000, iters=3683
4.44/4.66	
4.44/4.66	Low Water (keep): wt=73.000, iters=3607
4.44/4.66	
4.44/4.66	Low Water (keep): wt=69.000, iters=3427
4.44/4.66	
4.44/4.66	Low Water (keep): wt=68.000, iters=3394
4.44/4.66	
4.44/4.66	Low Water (keep): wt=63.000, iters=3537
4.44/4.66	
4.44/4.66	Low Water (keep): wt=62.000, iters=3472
4.44/4.66	
4.44/4.66	Low Water (keep): wt=61.000, iters=3420
4.44/4.66	
4.44/4.66	Low Water (keep): wt=60.000, iters=3359
4.44/4.66	
4.44/4.66	Low Water (keep): wt=59.000, iters=3358
4.44/4.66	
4.44/4.66	Low Water (keep): wt=57.000, iters=3333
4.44/4.66	
4.44/4.66	Low Water (keep): wt=55.000, iters=3395
4.44/4.66	
4.44/4.66	Low Water (keep): wt=53.000, iters=3453
4.44/4.66	
4.44/4.66	Low Water (keep): wt=52.000, iters=3336
4.44/4.66	
4.44/4.66	Low Water (keep): wt=51.000, iters=3433
4.44/4.66	
4.44/4.66	Low Water (keep): wt=50.000, iters=3614
4.44/4.66	
4.44/4.66	Low Water (keep): wt=48.000, iters=3363
4.44/4.66	
4.44/4.66	============================== PROOF =================================
4.44/4.66	% SZS status Theorem
4.44/4.66	% SZS output start Refutation
4.44/4.66	
4.44/4.66	% Proof 1 at 4.14 (+ 0.05) seconds.
4.44/4.66	% Length of proof is 71.
4.44/4.66	% Level of proof is 14.
4.44/4.66	% Maximum clause weight is 29.000.
4.44/4.66	% Given clauses 3989.
4.44/4.66	
4.44/4.66	1 (all X104 all X105 (occurrence_of(X105,tptp0) & root_occ(X104,X105) -> (exists X106 (occurrence_of(X106,tptp1) & next_subocc(X104,X106,tptp0))))) # label(sos_45) # label(axiom) # label(non_clause).  [assumption].
4.44/4.66	9 (all X3 all X4 all X5 all X6 all X7 (occurrence_of(X4,X3) & subactivity_occurrence(X5,X4) & X7 != X5 & min_precedes(X6,X5,X3) & leaf_occ(X7,X4) & root_occ(X6,X4) -> min_precedes(X5,X7,X3))) # label(sos_01) # label(axiom) # label(non_clause).  [assumption].
4.44/4.66	11 (all X58 all X59 ((exists X60 (occurrence_of(X59,X60) & subactivity_occurrence(X58,X59) & root(X58,X60))) <-> root_occ(X58,X59))) # label(sos_19) # label(axiom) # label(non_clause).  [assumption].
4.44/4.66	13 (all X28 all X29 all X30 (occurrence_of(X28,X29) & occurrence_of(X28,X30) -> X29 = X30)) # label(sos_08) # label(axiom) # label(non_clause).  [assumption].
4.44/4.66	17 (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].
4.44/4.66	18 (all X41 (activity_occurrence(X41) -> (exists X42 (occurrence_of(X41,X42) & activity(X42))))) # label(sos_12) # label(axiom) # label(non_clause).  [assumption].
4.44/4.66	21 (all X101 (occurrence_of(X101,tptp0) -> (exists X102 exists X103 (occurrence_of(X103,tptp3) & leaf_occ(X103,X101) & next_subocc(X102,X103,tptp0) & root_occ(X102,X101) & occurrence_of(X102,tptp4))))) # label(sos_32) # label(axiom) # label(non_clause).  [assumption].
4.44/4.66	22 (all X21 all X22 all X23 (min_precedes(X22,X23,X21) -> (exists X24 (occurrence_of(X24,X21) & subactivity_occurrence(X22,X24) & subactivity_occurrence(X23,X24))))) # label(sos_06) # label(axiom) # label(non_clause).  [assumption].
4.44/4.66	24 (all X0 all X1 (occurrence_of(X1,X0) & -atomic(X0) -> (exists X2 (subactivity_occurrence(X2,X1) & root(X2,X0))))) # label(sos) # label(axiom) # label(non_clause).  [assumption].
4.44/4.66	30 (all X12 all X13 (occurrence_of(X13,X12) -> activity_occurrence(X13) & activity(X12))) # label(sos_03) # label(axiom) # label(non_clause).  [assumption].
4.44/4.66	34 (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].
4.44/4.66	35 --(exists X107 occurrence_of(X107,tptp0)) # label(goals) # label(negated_conjecture) # label(non_clause).  [assumption].
4.44/4.66	42 -occurrence_of(A,B) | atomic(B) | root(f12(B,A),B) # label(sos) # label(axiom).  [clausify(24)].
4.44/4.66	43 -occurrence_of(A,B) | -subactivity_occurrence(C,A) | -root(C,B) | root_occ(C,A) # label(sos_19) # label(axiom).  [clausify(11)].
4.44/4.66	60 -occurrence_of(A,tptp0) | next_subocc(f7(A),f8(A),tptp0) # label(sos_32) # label(axiom).  [clausify(21)].
4.44/4.66	61 -next_subocc(A,B,C) | -min_precedes(D,B,C) | -min_precedes(A,D,C) # label(sos_26) # label(axiom).  [clausify(34)].
4.44/4.66	64 -next_subocc(A,B,C) | min_precedes(A,B,C) # label(sos_26) # label(axiom).  [clausify(34)].
4.44/4.66	65 -occurrence_of(A,tptp0) | -root_occ(B,A) | next_subocc(B,f1(B,A),tptp0) # label(sos_45) # label(axiom).  [clausify(1)].
4.44/4.66	78 -activity_occurrence(A) | occurrence_of(A,f5(A)) # label(sos_12) # label(axiom).  [clausify(18)].
4.44/4.66	81 -occurrence_of(A,B) | activity_occurrence(A) # label(sos_03) # label(axiom).  [clausify(30)].
4.44/4.66	97 occurrence_of(c1,tptp0) # label(goals) # label(negated_conjecture).  [clausify(35)].
4.44/4.66	98 -atomic(tptp0) # label(sos_34) # label(axiom).  [assumption].
4.44/4.66	101 tptp1 != tptp3 # label(sos_42) # label(axiom).  [assumption].
4.44/4.66	102 tptp3 != tptp1.  [copy(101),flip(a)].
4.44/4.66	113 -occurrence_of(A,tptp0) | occurrence_of(f8(A),tptp3) # label(sos_32) # label(axiom).  [clausify(21)].
4.44/4.66	114 -occurrence_of(A,tptp0) | leaf_occ(f8(A),A) # label(sos_32) # label(axiom).  [clausify(21)].
4.44/4.66	115 -occurrence_of(A,tptp0) | root_occ(f7(A),A) # label(sos_32) # label(axiom).  [clausify(21)].
4.44/4.66	121 -occurrence_of(A,B) | -occurrence_of(A,C) | C = B # label(sos_08) # label(axiom).  [clausify(13)].
4.44/4.66	123 -min_precedes(A,B,C) | occurrence_of(f9(C,A,B),C) # label(sos_06) # label(axiom).  [clausify(22)].
4.44/4.66	124 -min_precedes(A,B,C) | subactivity_occurrence(A,f9(C,A,B)) # label(sos_06) # label(axiom).  [clausify(22)].
4.44/4.66	125 -min_precedes(A,B,C) | subactivity_occurrence(B,f9(C,A,B)) # label(sos_06) # label(axiom).  [clausify(22)].
4.44/4.66	126 -occurrence_of(A,B) | atomic(B) | subactivity_occurrence(f12(B,A),A) # label(sos) # label(axiom).  [clausify(24)].
4.44/4.66	127 -occurrence_of(A,tptp0) | -root_occ(B,A) | occurrence_of(f1(B,A),tptp1) # label(sos_45) # label(axiom).  [clausify(1)].
4.44/4.66	129 -root_occ(A,B) | -root_occ(C,B) | -occurrence_of(B,D) | A = C # label(sos_29) # label(axiom).  [clausify(17)].
4.44/4.66	134 -occurrence_of(A,B) | -subactivity_occurrence(C,A) | D = C | -min_precedes(E,C,B) | -leaf_occ(D,A) | -root_occ(E,A) | min_precedes(C,D,B) # label(sos_01) # label(axiom).  [clausify(9)].
4.44/4.66	144 -occurrence_of(A,B) | -subactivity_occurrence(f12(B,C),A) | root_occ(f12(B,C),A) | -occurrence_of(C,B) | atomic(B).  [resolve(43,c,42,c)].
4.44/4.66	171 -occurrence_of(A,tptp0) | -min_precedes(B,f8(A),tptp0) | -min_precedes(f7(A),B,tptp0).  [resolve(60,b,61,a)].
4.44/4.66	178 -occurrence_of(A,tptp0) | -root_occ(B,A) | min_precedes(B,f1(B,A),tptp0).  [resolve(65,c,64,a)].
4.44/4.66	197 occurrence_of(A,f5(A)) | -occurrence_of(A,B).  [resolve(78,a,81,b)].
4.44/4.66	215 -occurrence_of(A,B) | -subactivity_occurrence(f12(B,A),A) | root_occ(f12(B,A),A) | atomic(B).  [factor(144,a,d)].
4.44/4.66	227 root_occ(f7(c1),c1).  [resolve(115,a,97,a)].
4.44/4.66	231 subactivity_occurrence(f12(tptp0,c1),c1).  [resolve(126,a,97,a),unit_del(a,98)].
4.44/4.66	257 min_precedes(f7(c1),f1(f7(c1),c1),tptp0).  [resolve(227,a,178,b),unit_del(a,97)].
4.44/4.66	262 -root_occ(A,c1) | -occurrence_of(c1,B) | f7(c1) = A.  [resolve(227,a,129,b),flip(c)].
4.44/4.66	263 occurrence_of(f1(f7(c1),c1),tptp1).  [resolve(227,a,127,b),unit_del(a,97)].
4.44/4.66	296 root_occ(f12(tptp0,c1),c1).  [resolve(231,a,215,b),unit_del(a,97),unit_del(c,98)].
4.44/4.66	414 occurrence_of(f1(f7(c1),c1),f5(f1(f7(c1),c1))).  [resolve(263,a,197,b)].
4.44/4.66	415 -occurrence_of(f1(f7(c1),c1),A) | tptp1 = A.  [resolve(263,a,121,b)].
4.44/4.66	544 -occurrence_of(A,tptp0) | -subactivity_occurrence(f1(f7(c1),c1),A) | f1(f7(c1),c1) = B | -leaf_occ(B,A) | -root_occ(f7(c1),A) | min_precedes(f1(f7(c1),c1),B,tptp0).  [resolve(257,a,134,d),flip(c)].
4.44/4.66	549 subactivity_occurrence(f1(f7(c1),c1),f9(tptp0,f7(c1),f1(f7(c1),c1))).  [resolve(257,a,125,a)].
4.44/4.66	550 subactivity_occurrence(f7(c1),f9(tptp0,f7(c1),f1(f7(c1),c1))).  [resolve(257,a,124,a)].
4.44/4.66	551 occurrence_of(f9(tptp0,f7(c1),f1(f7(c1),c1)),tptp0).  [resolve(257,a,123,a)].
4.44/4.66	564 -occurrence_of(c1,A) | f12(tptp0,c1) = f7(c1).  [resolve(262,a,296,a),flip(b)].
4.44/4.66	642 f12(tptp0,c1) = f7(c1).  [resolve(564,a,97,a)].
4.44/4.66	716 -occurrence_of(A,tptp0) | -subactivity_occurrence(f7(c1),A) | root_occ(f7(c1),A).  [para(642(a,1),144(b,1)),rewrite([642(8)]),unit_del(d,97),unit_del(e,98)].
4.44/4.66	755 f5(f1(f7(c1),c1)) = tptp1.  [resolve(414,a,415,a),flip(a)].
4.44/4.66	802 root_occ(f7(f9(tptp0,f7(c1),f1(f7(c1),c1))),f9(tptp0,f7(c1),f1(f7(c1),c1))).  [resolve(551,a,115,a)].
4.44/4.66	803 leaf_occ(f8(f9(tptp0,f7(c1),f1(f7(c1),c1))),f9(tptp0,f7(c1),f1(f7(c1),c1))).  [resolve(551,a,114,a)].
4.44/4.66	804 occurrence_of(f8(f9(tptp0,f7(c1),f1(f7(c1),c1))),tptp3).  [resolve(551,a,113,a)].
4.44/4.66	872 root_occ(f7(c1),f9(tptp0,f7(c1),f1(f7(c1),c1))).  [resolve(716,b,550,a),unit_del(a,551)].
4.44/4.66	912 occurrence_of(f8(f9(tptp0,f7(c1),f1(f7(c1),c1))),f5(f8(f9(tptp0,f7(c1),f1(f7(c1),c1))))).  [resolve(804,a,197,b)].
4.44/4.66	913 -occurrence_of(f8(f9(tptp0,f7(c1),f1(f7(c1),c1))),A) | tptp3 = A.  [resolve(804,a,121,b)].
4.44/4.66	1003 -root_occ(A,f9(tptp0,f7(c1),f1(f7(c1),c1))) | -occurrence_of(f9(tptp0,f7(c1),f1(f7(c1),c1)),B) | f7(c1) = A.  [resolve(872,a,129,b),flip(c)].
4.44/4.66	1719 f1(f7(c1),c1) = A | -leaf_occ(A,f9(tptp0,f7(c1),f1(f7(c1),c1))) | min_precedes(f1(f7(c1),c1),A,tptp0).  [resolve(544,b,549,a),unit_del(a,551),unit_del(d,872)].
4.44/4.66	3405 f5(f8(f9(tptp0,f7(c1),f1(f7(c1),c1)))) = tptp3.  [resolve(912,a,913,a),flip(a)].
4.44/4.66	4035 -occurrence_of(f9(tptp0,f7(c1),f1(f7(c1),c1)),A) | f7(f9(tptp0,f7(c1),f1(f7(c1),c1))) = f7(c1).  [resolve(1003,a,802,a),flip(b)].
4.44/4.66	6216 f7(f9(tptp0,f7(c1),f1(f7(c1),c1))) = f7(c1).  [resolve(4035,a,551,a)].
4.44/4.66	6263 -min_precedes(A,f8(f9(tptp0,f7(c1),f1(f7(c1),c1))),tptp0) | -min_precedes(f7(c1),A,tptp0).  [para(6216(a,1),171(c,1)),unit_del(a,551)].
4.44/4.66	6846 f8(f9(tptp0,f7(c1),f1(f7(c1),c1))) = f1(f7(c1),c1) | min_precedes(f1(f7(c1),c1),f8(f9(tptp0,f7(c1),f1(f7(c1),c1))),tptp0).  [resolve(1719,b,803,a),flip(a)].
4.44/4.66	15804 f8(f9(tptp0,f7(c1),f1(f7(c1),c1))) = f1(f7(c1),c1).  [resolve(6846,b,6263,a),unit_del(b,257)].
4.44/4.66	16227 $F.  [back_rewrite(3405),rewrite([15804(9),755(5)]),flip(a),unit_del(a,102)].
4.44/4.66	
4.44/4.66	% SZS output end Refutation
4.44/4.66	============================== end of proof ==========================
4.44/4.66	
4.44/4.66	============================== STATISTICS ============================
4.44/4.66	
4.44/4.66	Given=3989. Generated=34059. Kept=16131. proofs=1.
4.44/4.66	Usable=2768. Sos=6729. Demods=85. Limbo=423, Disabled=6394. Hints=0.
4.44/4.66	Megabytes=37.73.
4.44/4.66	User_CPU=4.14, System_CPU=0.05, Wall_clock=4.
4.44/4.66	
4.44/4.66	============================== end of statistics =====================
4.44/4.66	
4.44/4.66	============================== end of search =========================
4.44/4.66	
4.44/4.66	THEOREM PROVED
4.44/4.66	% SZS status Theorem
4.44/4.66	
4.44/4.66	Exiting with 1 proof.
4.44/4.66	
4.44/4.66	Process 9709 exit (max_proofs) Sat Jul 14 05:01:14 2018
4.44/4.66	Prover9 interrupted
4.44/4.68	EOF