0.03/0.13 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s 0.13/0.34 % Computer : n027.cluster.edu 0.13/0.34 % Model : x86_64 x86_64 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 % Memory : 8042.1875MB 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 960 0.13/0.34 % WCLimit : 120 0.13/0.34 % DateTime : Tue Aug 9 04:05:06 EDT 2022 0.13/0.34 % CPUTime : 0.45/1.01 ============================== Prover9 =============================== 0.45/1.01 Prover9 (32) version 2009-11A, November 2009. 0.45/1.01 Process 14679 was started by sandbox2 on n027.cluster.edu, 0.45/1.01 Tue Aug 9 04:05:07 2022 0.45/1.01 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_14440_n027.cluster.edu". 0.45/1.01 ============================== end of head =========================== 0.45/1.01 0.45/1.01 ============================== INPUT ================================= 0.45/1.01 0.45/1.01 % Reading from file /tmp/Prover9_14440_n027.cluster.edu 0.45/1.01 0.45/1.01 set(prolog_style_variables). 0.45/1.01 set(auto2). 0.45/1.01 % set(auto2) -> set(auto). 0.45/1.01 % set(auto) -> set(auto_inference). 0.45/1.01 % set(auto) -> set(auto_setup). 0.45/1.01 % set(auto_setup) -> set(predicate_elim). 0.45/1.01 % set(auto_setup) -> assign(eq_defs, unfold). 0.45/1.01 % set(auto) -> set(auto_limits). 0.45/1.01 % set(auto_limits) -> assign(max_weight, "100.000"). 0.45/1.01 % set(auto_limits) -> assign(sos_limit, 20000). 0.45/1.01 % set(auto) -> set(auto_denials). 0.45/1.01 % set(auto) -> set(auto_process). 0.45/1.01 % set(auto2) -> assign(new_constants, 1). 0.45/1.01 % set(auto2) -> assign(fold_denial_max, 3). 0.45/1.01 % set(auto2) -> assign(max_weight, "200.000"). 0.45/1.01 % set(auto2) -> assign(max_hours, 1). 0.45/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.45/1.01 % set(auto2) -> assign(max_seconds, 0). 0.45/1.01 % set(auto2) -> assign(max_minutes, 5). 0.45/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.45/1.01 % set(auto2) -> set(sort_initial_sos). 0.45/1.01 % set(auto2) -> assign(sos_limit, -1). 0.45/1.01 % set(auto2) -> assign(lrs_ticks, 3000). 0.45/1.01 % set(auto2) -> assign(max_megs, 400). 0.45/1.01 % set(auto2) -> assign(stats, some). 0.45/1.01 % set(auto2) -> clear(echo_input). 0.45/1.01 % set(auto2) -> set(quiet). 0.45/1.01 % set(auto2) -> clear(print_initial_clauses). 0.45/1.01 % set(auto2) -> clear(print_given). 0.45/1.01 assign(lrs_ticks,-1). 0.45/1.01 assign(sos_limit,10000). 0.45/1.01 assign(order,kbo). 0.45/1.01 set(lex_order_vars). 0.45/1.01 clear(print_given). 0.45/1.01 0.45/1.01 % formulas(sos). % not echoed (46 formulas) 0.45/1.01 0.45/1.01 ============================== end of input ========================== 0.45/1.01 0.45/1.01 % From the command line: assign(max_seconds, 960). 0.45/1.01 0.45/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.45/1.01 0.45/1.01 % Formulas that are not ordinary clauses: 0.45/1.01 1 (all X54 all X55 (subactivity_occurrence(X54,X55) -> activity_occurrence(X55) & activity_occurrence(X54))) # label(sos_19) # label(axiom) # label(non_clause). [assumption]. 0.45/1.01 2 (all X4 all X5 all X6 (earlier(X5,X6) & earlier(X4,X5) -> earlier(X4,X6))) # label(sos_01) # label(axiom) # label(non_clause). [assumption]. 0.45/1.01 3 (all X35 all X36 (leaf_occ(X35,X36) <-> (exists X37 (occurrence_of(X36,X37) & leaf(X35,X37) & subactivity_occurrence(X35,X36))))) # label(sos_11) # label(axiom) # label(non_clause). [assumption]. 0.45/1.01 4 (all X82 all X83 (root(X83,X82) -> (exists X84 (subactivity(X84,X82) & atocc(X83,X84))))) # label(sos_27) # label(axiom) # label(non_clause). [assumption]. 0.45/1.01 5 (all X95 all X96 (occurrence_of(X96,tptp0) & subactivity_occurrence(X95,X96) & arboreal(X95) & -leaf_occ(X95,X96) -> (exists X97 exists X98 exists X99 (min_precedes(X97,X98,tptp0) & (all X100 (min_precedes(X97,X100,tptp0) -> X100 = X98 | X99 = X100)) & min_precedes(X98,X99,tptp0) & (occurrence_of(X99,tptp2) | occurrence_of(X99,tptp1)) & occurrence_of(X98,tptp4) & next_subocc(X95,X97,tptp0) & occurrence_of(X97,tptp3))))) # label(sos_32) # label(axiom) # label(non_clause). [assumption]. 0.45/1.01 6 (all X60 all X61 all X62 (leaf_occ(X61,X60) & occurrence_of(X60,X62) -> -(exists X63 min_precedes(X61,X63,X62)))) # label(sos_21) # label(axiom) # label(non_clause). [assumption]. 0.45/1.01 7 (all X7 all X8 all X9 all X10 (root_occ(X7,X9) & root_occ(X8,X9) & occurrence_of(X9,X10) -> X8 = X7)) # label(sos_02) # label(axiom) # label(non_clause). [assumption]. 0.45/1.01 8 (all X89 all X90 (occurrence_of(X90,X89) -> activity_occurrence(X90) & activity(X89))) # label(sos_29) # label(axiom) # label(non_clause). [assumption]. 0.45/1.01 9 (all X19 all X20 all X21 (next_subocc(X19,X20,X21) -> arboreal(X20) & arboreal(X19))) # label(sos_05) # label(axiom) # label(non_clause). [assumption]. 0.45/1.01 10 (all X38 all X39 (root(X38,X39) -> legal(X38))) # label(sos_12) # label(axiom) # label(non_clause). [assumption]. 0.45/1.01 11 (all X91 all X92 (-atomic(X91) & occurrence_of(X92,X91) -> (exists X93 (subactivity_occurrence(X93,X92) & root(X93,X91))))) # label(sos_30) # label(axiom) # label(non_clause). [assumption]. 0.45/1.01 12 (all X94 (activity(X94) -> subactivity(X94,X94))) # label(sos_31) # label(axiom) # label(non_clause). [assumption]. 0.45/1.01 13 (all X77 all X78 all X79 (min_precedes(X78,X79,X77) -> (exists X80 exists X81 (subactivity(X81,X77) & atocc(X79,X81) & atocc(X78,X80) & subactivity(X80,X77))))) # label(sos_26) # label(axiom) # label(non_clause). [assumption]. 0.45/1.01 14 (all X51 (legal(X51) -> arboreal(X51))) # label(sos_17) # label(axiom) # label(non_clause). [assumption]. 0.45/1.01 15 (all X0 all X1 all X2 all X3 (min_precedes(X1,X2,X3) & min_precedes(X0,X1,X3) -> min_precedes(X0,X2,X3))) # label(sos) # label(axiom) # label(non_clause). [assumption]. 0.45/1.01 16 (all X42 all X43 ((root(X42,X43) | (exists X44 min_precedes(X44,X42,X43))) & -(exists X45 min_precedes(X42,X45,X43)) <-> leaf(X42,X43))) # label(sos_14) # label(axiom) # label(non_clause). [assumption]. 0.45/1.01 17 (all X52 (activity_occurrence(X52) -> (exists X53 (activity(X53) & occurrence_of(X52,X53))))) # label(sos_18) # label(axiom) # label(non_clause). [assumption]. 0.45/1.01 18 (all X67 all X68 (leaf(X67,X68) & -atomic(X68) -> (exists X69 (occurrence_of(X69,X68) & leaf_occ(X67,X69))))) # label(sos_23) # label(axiom) # label(non_clause). [assumption]. 0.45/1.01 19 (all X40 all X41 (occurrence_of(X40,X41) -> (atomic(X41) <-> arboreal(X40)))) # label(sos_13) # label(axiom) # label(non_clause). [assumption]. 0.45/1.01 20 (all X25 all X26 all X27 (min_precedes(X25,X26,X27) -> -root(X26,X27))) # label(sos_07) # label(axiom) # label(non_clause). [assumption]. 0.45/1.01 21 (all X85 all X86 all X87 all X88 (arboreal(X88) & subactivity_occurrence(X87,X86) & subactivity_occurrence(X88,X86) & arboreal(X87) & occurrence_of(X86,X85) -> min_precedes(X87,X88,X85) | min_precedes(X88,X87,X85) | X87 = X88)) # label(sos_28) # label(axiom) # label(non_clause). [assumption]. 0.45/1.01 22 (all X56 all X57 all X58 (root_occ(X57,X56) & occurrence_of(X56,X58) -> -(exists X59 min_precedes(X59,X57,X58)))) # label(sos_20) # label(axiom) # label(non_clause). [assumption]. 0.45/1.01 23 (all X64 all X65 all X66 (occurrence_of(X64,X65) & occurrence_of(X64,X66) -> X65 = X66)) # label(sos_22) # label(axiom) # label(non_clause). [assumption]. 0.45/1.01 24 (all X28 all X29 (earlier(X28,X29) & legal(X29) <-> precedes(X28,X29))) # label(sos_08) # label(axiom) # label(non_clause). [assumption]. 0.45/1.01 25 (all X32 all X33 ((exists X34 (subactivity_occurrence(X32,X33) & root(X32,X34) & occurrence_of(X33,X34))) <-> root_occ(X32,X33))) # label(sos_10) # label(axiom) # label(non_clause). [assumption]. 0.45/1.01 26 (all X49 all X50 (atocc(X49,X50) & legal(X49) -> root(X49,X50))) # label(sos_16) # label(axiom) # label(non_clause). [assumption]. 0.45/1.01 27 (all X22 all X23 all X24 (min_precedes(X22,X23,X24) -> precedes(X22,X23))) # label(sos_06) # label(axiom) # label(non_clause). [assumption]. 0.45/1.01 28 (all X15 all X16 all X17 (min_precedes(X15,X16,X17) & -(exists X18 (min_precedes(X15,X18,X17) & min_precedes(X18,X16,X17))) <-> next_subocc(X15,X16,X17))) # label(sos_04) # label(axiom) # label(non_clause). [assumption]. 0.45/1.01 29 (all X70 all X71 all X72 (min_precedes(X71,X72,X70) -> (exists X73 (subactivity_occurrence(X72,X73) & subactivity_occurrence(X71,X73) & occurrence_of(X73,X70))))) # label(sos_24) # label(axiom) # label(non_clause). [assumption]. 0.45/1.01 30 (all X30 all X31 (earlier(X30,X31) -> -earlier(X31,X30))) # label(sos_09) # label(axiom) # label(non_clause). [assumption]. 0.45/1.01 31 (all X46 all X47 ((exists X48 (subactivity(X47,X48) & occurrence_of(X46,X48) & atomic(X48))) <-> atocc(X46,X47))) # label(sos_15) # label(axiom) # label(non_clause). [assumption]. 0.45/1.01 32 (all X11 all X12 all X13 all X14 (-atomic(X14) & leaf_occ(X11,X13) & leaf_occ(X12,X13) & occurrence_of(X13,X14) -> X12 = X11)) # label(sos_03) # label(axiom) # label(non_clause). [assumption]. 0.45/1.01 33 (all X74 all X75 (leaf(X74,X75) & -atomic(X75) -> (exists X76 (leaf_occ(X74,X76) & occurrence_of(X76,X75))))) # label(sos_25) # label(axiom) # label(non_clause). [assumption]. 0.45/1.01 34 -(all X101 all X102 (subactivity_occurrence(X101,X102) & arboreal(X101) & -leaf_occ(X101,X102) & occurrence_of(X102,tptp0) -> (exists X103 exists X104 ((occurrence_of(X104,tptp1) -> -(exists X105 (min_precedes(X103,X105,tptp0) & occurrence_of(X105,tptp2)))) & (occurrence_of(X104,tptp2) -> -(exists X106 (min_precedes(X103,X106,tptp0) & occurrence_of(X106,tptp1)))) & leaf_occ(X104,X102) & min_precedes(X103,X104,tptp0) & (occurrence_of(X104,tptp2) | occurrence_of(X104,tptp1)) & next_subocc(X101,X103,tptp0) & occurrence_of(X103,tptp3))))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption]. 0.45/1.01 0.45/1.01 ============================== end of process non-clausal formulas === 0.45/1.01 0.45/1.01 ============================== PROCESS INITIAL CLAUSES =============== 0.45/1.01 0.45/1.01 ============================== PREDICATE ELIMINATION ================= 0.45/1.01 35 -activity(A) | subactivity(A,A) # label(sos_31) # label(axiom). [clausify(12)]. 0.45/1.01 36 activity(tptp0) # label(sos_33) # label(axiom). [assumption]. 0.45/1.01 37 -occurrence_of(A,B) | activity(B) # label(sos_29) # label(axiom). [clausify(8)]. 0.45/1.01 Derived: subactivity(tptp0,tptp0). [resolve(35,a,36,a)]. 0.45/1.01 Derived: subactivity(A,A) | -occurrence_of(B,A). [resolve(35,a,37,b)]. 0.45/1.01 38 -activity_occurrence(A) | activity(f11(A)) # label(sos_18) # label(axiom). [clausify(17)]. 0.45/1.01 Derived: -activity_occurrence(A) | subactivity(f11(A),f11(A)). [resolve(38,b,35,a)]. 0.45/1.01 39 -leaf_occ(A,B) | leaf(A,f1(A,B)) # label(sos_11) # label(axiom). [clausify(3)]. 0.45/1.01 40 -min_precedes(A,B,C) | -leaf(A,C) # label(sos_14) # label(axiom). [clausify(16)]. 0.45/1.01 Derived: -leaf_occ(A,B) | -min_precedes(A,C,f1(A,B)). [resolve(39,b,40,b)]. 0.45/1.01 41 -leaf(A,B) | atomic(B) | occurrence_of(f12(A,B),B) # label(sos_23) # label(axiom). [clausify(18)]. 0.45/1.01 Derived: atomic(f1(A,B)) | occurrence_of(f12(A,f1(A,B)),f1(A,B)) | -leaf_occ(A,B). [resolve(41,a,39,b)]. 0.45/1.01 42 -leaf(A,B) | atomic(B) | leaf_occ(A,f12(A,B)) # label(sos_23) # label(axiom). [clausify(18)]. 0.45/1.01 Derived: atomic(f1(A,B)) | leaf_occ(A,f12(A,f1(A,B))) | -leaf_occ(A,B). [resolve(42,a,39,b)]. 0.45/1.01 43 -leaf(A,B) | atomic(B) | leaf_occ(A,f17(A,B)) # label(sos_25) # label(axiom). [clausify(33)]. 0.45/1.01 Derived: atomic(f1(A,B)) | leaf_occ(A,f17(A,f1(A,B))) | -leaf_occ(A,B). [resolve(43,a,39,b)]. 0.45/1.01 44 -leaf(A,B) | atomic(B) | occurrence_of(f17(A,B),B) # label(sos_25) # label(axiom). [clausify(33)]. 0.45/1.01 Derived: atomic(f1(A,B)) | occurrence_of(f17(A,f1(A,B)),f1(A,B)) | -leaf_occ(A,B). [resolve(44,a,39,b)]. 0.45/1.01 45 leaf_occ(A,B) | -occurrence_of(B,C) | -leaf(A,C) | -subactivity_occurrence(A,B) # label(sos_11) # label(axiom). [clausify(3)]. 0.45/1.01 Derived: leaf_occ(A,B) | -occurrence_of(B,f1(A,C)) | -subactivity_occurrence(A,B) | -leaf_occ(A,C). [resolve(45,c,39,b)]. 0.45/1.01 46 -root(A,B) | min_precedes(A,f9(A,B),B) | leaf(A,B) # label(sos_14) # label(axiom). [clausify(16)]. 0.45/1.01 Derived: -root(A,B) | min_precedes(A,f9(A,B),B) | -min_precedes(A,C,B). [resolve(46,c,40,b)]. 0.45/1.01 Derived: -root(A,B) | min_precedes(A,f9(A,B),B) | atomic(B) | occurrence_of(f12(A,B),B). [resolve(46,c,41,a)]. 0.45/1.01 Derived: -root(A,B) | min_precedes(A,f9(A,B),B) | atomic(B) | leaf_occ(A,f12(A,B)). [resolve(46,c,42,a)]. 0.45/1.01 Derived: -root(A,B) | min_precedes(A,f9(A,B),B) | atomic(B) | leaf_occ(A,f17(A,B)). [resolve(46,c,43,a)]. 0.45/1.01 Derived: -root(A,B) | min_precedes(A,f9(A,B),B) | atomic(B) | occurrence_of(f17(A,B),B). [resolve(46,c,44,a)]. 0.45/1.01 Derived: -root(A,B) | min_precedes(A,f9(A,B),B) | leaf_occ(A,C) | -occurrence_of(C,B) | -subactivity_occurrence(A,C). [resolve(46,c,45,c)]. 0.45/1.01 47 root(A,B) | min_precedes(f10(A,B),A,B) | -leaf(A,B) # label(sos_14) # label(axiom). [clausify(16)]. 0.45/1.01 Derived: root(A,f1(A,B)) | min_precedes(f10(A,f1(A,B)),A,f1(A,B)) | -leaf_occ(A,B). [resolve(47,c,39,b)]. 0.45/1.01 48 -min_precedes(A,B,C) | min_precedes(B,f9(B,C),C) | leaf(B,C) # label(sos_14) # label(axiom). [clausify(16)]. 0.45/1.01 Derived: -min_precedes(A,B,C) | min_precedes(B,f9(B,C),C) | -min_precedes(B,D,C). [resolve(48,c,40,b)]. 0.45/1.01 Derived: -min_precedes(A,B,C) | min_precedes(B,f9(B,C),C) | atomic(C) | occurrence_of(f12(B,C),C). [resolve(48,c,41,a)]. 0.45/1.01 Derived: -min_precedes(A,B,C) | min_precedes(B,f9(B,C),C) | atomic(C) | leaf_occ(B,f12(B,C)). [resolve(48,c,42,a)]. 0.45/1.01 Derived: -min_precedes(A,B,C) | min_precedes(B,f9(B,C),C) | atomic(C) | leaf_occ(B,f17(B,C)). [resolve(48,c,43,a)]. 0.45/1.01 Derived: -min_precedes(A,B,C) | min_precedes(B,f9(B,C),C) | atomic(C) | occurrence_of(f17(B,C),C). [resolve(48,c,44,a)]. 0.45/1.01 Derived: -min_precedes(A,B,C) | min_precedes(B,f9(B,C),C) | leaf_occ(B,D) | -occurrence_of(D,C) | -subactivity_occurrence(B,D). [resolve(48,c,45,c)]. 0.45/1.01 Derived: -min_precedes(A,B,C) | min_precedes(B,f9(B,C),C) | root(B,C) | min_precedes(f10(B,C),B,C). [resolve(48,c,47,c)]. 0.45/1.01 49 root(A,f13(A,B)) | -root_occ(A,B) # label(sos_10) # label(axiom). [clausify(25)]. 0.45/1.01 50 -min_precedes(A,B,C) | -root(B,C) # label(sos_07) # label(axiom). [clausify(20)]. 0.45/1.01 51 -root(A,B) | legal(A) # label(sos_12) # label(axiom). [clausify(10)]. 0.45/1.01 52 -root(A,B) | subactivity(f2(B,A),B) # label(sos_27) # label(axiom). [clausify(4)]. 0.45/1.01 53 -root(A,B) | atocc(A,f2(B,A)) # label(sos_27) # label(axiom). [clausify(4)]. 0.45/1.01 Derived: -root_occ(A,B) | -min_precedes(C,A,f13(A,B)). [resolve(49,a,50,b)]. 0.45/1.01 Derived: -root_occ(A,B) | legal(A). [resolve(49,a,51,a)]. 0.45/1.01 Derived: -root_occ(A,B) | subactivity(f2(f13(A,B),A),f13(A,B)). [resolve(49,a,52,a)]. 0.45/1.01 Derived: -root_occ(A,B) | atocc(A,f2(f13(A,B),A)). [resolve(49,a,53,a)]. 0.45/1.01 54 -atocc(A,B) | -legal(A) | root(A,B) # label(sos_16) # label(axiom). [clausify(26)]. 0.45/1.01 Derived: -atocc(A,B) | -legal(A) | -min_precedes(C,A,B). [resolve(54,c,50,b)]. 0.45/1.01 Derived: -atocc(A,B) | -legal(A) | subactivity(f2(B,A),B). [resolve(54,c,52,a)]. 0.45/1.01 Derived: -atocc(A,B) | -legal(A) | atocc(A,f2(B,A)). [resolve(54,c,53,a)]. 0.45/1.01 55 atomic(A) | -occurrence_of(B,A) | root(f6(A,B),A) # label(sos_30) # label(axiom). [clausify(11)]. 0.45/1.01 Derived: atomic(A) | -occurrence_of(B,A) | -min_precedes(C,f6(A,B),A). [resolve(55,c,50,b)]. 0.45/1.01 Derived: atomic(A) | -occurrence_of(B,A) | legal(f6(A,B)). [resolve(55,c,51,a)]. 0.45/1.01 Derived: atomic(A) | -occurrence_of(B,A) | subactivity(f2(A,f6(A,B)),A). [resolve(55,c,52,a)]. 0.45/1.01 Derived: atomic(A) | -occurrence_of(B,A) | atocc(f6(A,B),f2(A,f6(A,B))). [resolve(55,c,53,a)]. 0.45/1.01 56 -subactivity_occurrence(A,B) | -root(A,C) | -occurrence_of(B,C) | root_occ(A,B) # label(sos_10) # label(axiom). [clausify(25)]. 0.45/1.01 Derived: -subactivity_occurrence(A,B) | -occurrence_of(B,f13(A,C)) | root_occ(A,B) | -root_occ(A,C). [resolve(56,b,49,a)]. 0.45/1.01 Derived: -subactivity_occurrence(A,B) | -occurrence_of(B,C) | root_occ(A,B) | -atocc(A,C) | -legal(A). [resolve(56,b,54,c)]. 0.45/1.01 Derived: -subactivity_occurrence(f6(A,B),C) | -occurrence_of(C,A) | root_occ(f6(A,B),C) | atomic(A) | -occurrence_of(B,A). [resolve(56,b,55,c)]. 0.45/1.01 57 -root(A,B) | min_precedes(A,f9(A,B),B) | -min_precedes(A,C,B). [resolve(46,c,40,b)]. 0.45/1.01 Derived: min_precedes(A,f9(A,f13(A,B)),f13(A,B)) | -min_precedes(A,C,f13(A,B)) | -root_occ(A,B). [resolve(57,a,49,a)]. 0.45/1.01 Derived: min_precedes(A,f9(A,B),B) | -min_precedes(A,C,B) | -atocc(A,B) | -legal(A). [resolve(57,a,54,c)]. 0.45/1.01 Derived: min_precedes(f6(A,B),f9(f6(A,B),A),A) | -min_precedes(f6(A,B),C,A) | atomic(A) | -occurrence_of(B,A). [resolve(57,a,55,c)]. 0.45/1.01 58 -root(A,B) | min_precedes(A,f9(A,B),B) | atomic(B) | occurrence_of(f12(A,B),B). [resolve(46,c,41,a)]. 0.45/1.02 Derived: min_precedes(A,f9(A,f13(A,B)),f13(A,B)) | atomic(f13(A,B)) | occurrence_of(f12(A,f13(A,B)),f13(A,B)) | -root_occ(A,B). [resolve(58,a,49,a)]. 0.45/1.02 Derived: min_precedes(A,f9(A,B),B) | atomic(B) | occurrence_of(f12(A,B),B) | -atocc(A,B) | -legal(A). [resolve(58,a,54,c)]. 0.45/1.02 Derived: min_precedes(f6(A,B),f9(f6(A,B),A),A) | atomic(A) | occurrence_of(f12(f6(A,B),A),A) | atomic(A) | -occurrence_of(B,A). [resolve(58,a,55,c)]. 0.45/1.02 59 -root(A,B) | min_precedes(A,f9(A,B),B) | atomic(B) | leaf_occ(A,f12(A,B)). [resolve(46,c,42,a)]. 0.45/1.02 Derived: min_precedes(A,f9(A,f13(A,B)),f13(A,B)) | atomic(f13(A,B)) | leaf_occ(A,f12(A,f13(A,B))) | -root_occ(A,B). [resolve(59,a,49,a)]. 0.45/1.02 Derived: min_precedes(A,f9(A,B),B) | atomic(B) | leaf_occ(A,f12(A,B)) | -atocc(A,B) | -legal(A). [resolve(59,a,54,c)]. 0.45/1.02 Derived: min_precedes(f6(A,B),f9(f6(A,B),A),A) | atomic(A) | leaf_occ(f6(A,B),f12(f6(A,B),A)) | atomic(A) | -occurrence_of(B,A). [resolve(59,a,55,c)]. 0.45/1.02 60 -root(A,B) | min_precedes(A,f9(A,B),B) | atomic(B) | leaf_occ(A,f17(A,B)). [resolve(46,c,43,a)]. 0.75/1.02 Derived: min_precedes(A,f9(A,f13(A,B)),f13(A,B)) | atomic(f13(A,B)) | leaf_occ(A,f17(A,f13(A,B))) | -root_occ(A,B). [resolve(60,a,49,a)]. 0.75/1.02 Derived: min_precedes(A,f9(A,B),B) | atomic(B) | leaf_occ(A,f17(A,B)) | -atocc(A,B) | -legal(A). [resolve(60,a,54,c)]. 0.75/1.02 Derived: min_precedes(f6(A,B),f9(f6(A,B),A),A) | atomic(A) | leaf_occ(f6(A,B),f17(f6(A,B),A)) | atomic(A) | -occurrence_of(B,A). [resolve(60,a,55,c)]. 0.75/1.02 61 -root(A,B) | min_precedes(A,f9(A,B),B) | atomic(B) | occurrence_of(f17(A,B),B). [resolve(46,c,44,a)]. 0.75/1.02 Derived: min_precedes(A,f9(A,f13(A,B)),f13(A,B)) | atomic(f13(A,B)) | occurrence_of(f17(A,f13(A,B)),f13(A,B)) | -root_occ(A,B). [resolve(61,a,49,a)]. 0.75/1.02 Derived: min_precedes(A,f9(A,B),B) | atomic(B) | occurrence_of(f17(A,B),B) | -atocc(A,B) | -legal(A). [resolve(61,a,54,c)]. 0.75/1.02 Derived: min_precedes(f6(A,B),f9(f6(A,B),A),A) | atomic(A) | occurrence_of(f17(f6(A,B),A),A) | atomic(A) | -occurrence_of(B,A). [resolve(61,a,55,c)]. 0.75/1.02 62 -root(A,B) | min_precedes(A,f9(A,B),B) | leaf_occ(A,C) | -occurrence_of(C,B) | -subactivity_occurrence(A,C). [resolve(46,c,45,c)]. 0.75/1.02 Derived: min_precedes(A,f9(A,f13(A,B)),f13(A,B)) | leaf_occ(A,C) | -occurrence_of(C,f13(A,B)) | -subactivity_occurrence(A,C) | -root_occ(A,B). [resolve(62,a,49,a)]. 0.75/1.02 Derived: min_precedes(A,f9(A,B),B) | leaf_occ(A,C) | -occurrence_of(C,B) | -subactivity_occurrence(A,C) | -atocc(A,B) | -legal(A). [resolve(62,a,54,c)]. 0.75/1.02 Derived: min_precedes(f6(A,B),f9(f6(A,B),A),A) | leaf_occ(f6(A,B),C) | -occurrence_of(C,A) | -subactivity_occurrence(f6(A,B),C) | atomic(A) | -occurrence_of(B,A). [resolve(62,a,55,c)]. 0.75/1.02 63 root(A,f1(A,B)) | min_precedes(f10(A,f1(A,B)),A,f1(A,B)) | -leaf_occ(A,B). [resolve(47,c,39,b)]. 0.75/1.02 Derived: min_precedes(f10(A,f1(A,B)),A,f1(A,B)) | -leaf_occ(A,B) | -min_precedes(C,A,f1(A,B)). [resolve(63,a,50,b)]. 0.75/1.02 Derived: min_precedes(f10(A,f1(A,B)),A,f1(A,B)) | -leaf_occ(A,B) | legal(A). [resolve(63,a,51,a)]. 0.75/1.02 Derived: min_precedes(f10(A,f1(A,B)),A,f1(A,B)) | -leaf_occ(A,B) | subactivity(f2(f1(A,B),A),f1(A,B)). [resolve(63,a,52,a)]. 0.75/1.02 Derived: min_precedes(f10(A,f1(A,B)),A,f1(A,B)) | -leaf_occ(A,B) | atocc(A,f2(f1(A,B),A)). [resolve(63,a,53,a)]. 0.75/1.02 Derived: min_precedes(f10(A,f1(A,B)),A,f1(A,B)) | -leaf_occ(A,B) | -subactivity_occurrence(A,C) | -occurrence_of(C,f1(A,B)) | root_occ(A,C). [resolve(63,a,56,b)]. 0.75/1.02 Derived: min_precedes(f10(A,f1(A,B)),A,f1(A,B)) | -leaf_occ(A,B) | min_precedes(A,f9(A,f1(A,B)),f1(A,B)) | -min_precedes(A,C,f1(A,B)). [resolve(63,a,57,a)]. 0.75/1.02 Derived: min_precedes(f10(A,f1(A,B)),A,f1(A,B)) | -leaf_occ(A,B) | min_precedes(A,f9(A,f1(A,B)),f1(A,B)) | atomic(f1(A,B)) | occurrence_of(f12(A,f1(A,B)),f1(A,B)). [resolve(63,a,58,a)]. 0.75/1.02 Derived: min_precedes(f10(A,f1(A,B)),A,f1(A,B)) | -leaf_occ(A,B) | min_precedes(A,f9(A,f1(A,B)),f1(A,B)) | atomic(f1(A,B)) | leaf_occ(A,f12(A,f1(A,B))). [resolve(63,a,59,a)]. 0.75/1.02 Derived: min_precedes(f10(A,f1(A,B)),A,f1(A,B)) | -leaf_occ(A,B) | min_precedes(A,f9(A,f1(A,B)),f1(A,B)) | atomic(f1(A,B)) | leaf_occ(A,f17(A,f1(A,B))). [resolve(63,a,60,a)]. 0.75/1.02 Derived: min_precedes(f10(A,f1(A,B)),A,f1(A,B)) | -leaf_occ(A,B) | min_precedes(A,f9(A,f1(A,B)),f1(A,B)) | atomic(f1(A,B)) | occurrence_of(f17(A,f1(A,B)),f1(A,B)). [resolve(63,a,61,a)]. 0.75/1.02 Derived: min_precedes(f10(A,f1(A,B)),A,f1(A,B)) | -leaf_occ(A,B) | min_precedes(A,f9(A,f1(A,B)),f1(A,B)) | leaf_occ(A,C) | -occurrence_of(C,f1(A,B)) | -subactivity_occurrence(A,C). [resolve(63,a,62,a)]. 0.75/1.02 64 -min_precedes(A,B,C) | min_precedes(B,f9(B,C),C) | root(B,C) | min_precedes(f10(B,C),B,C). [resolve(48,c,47,c)]. 0.75/1.02 Derived: -min_precedes(A,B,C) | min_precedes(B,f9(B,C),C) | min_precedes(f10(B,C),B,C) | -min_precedes(D,B,C). [resolve(64,c,50,b)]. 0.75/1.02 65 legal(A) | -precedes(B,A) # label(sos_08) # label(axiom). [clausify(24)]. 0.75/1.02 66 -legal(A) | arboreal(A) # label(sos_17) # label(axiom). [clausify(14)]. 0.75/1.02 Derived: -precedes(A,B) | arboreal(B). [resolve(65,a,66,a)]. 0.75/1.02 67 -earlier(A,B) | -legal(B) | precedes(A,B) # label(sos_08) # label(axiom). [clausify(24)]. 0.75/1.02 Derived: -earlier(A,B) | precedes(A,B) | -precedes(C,B). [resolve(67,b,65,a)]. 0.75/1.02 68 -root_occ(A,B) | legal(A). [resolve(49,a,51,a)]. 0.75/1.02 Derived: -root_occ(A,B) | arboreal(A). [resolve(68,b,66,a)]. 0.75/1.02 Derived: -root_occ(A,B) | -earlier(C,A) | precedes(C,A). [resolve(68,b,67,b)]. 0.75/1.02 69 -atocc(A,B) | -legal(A) | -min_precedes(C,A,B). [resolve(54,c,50,b)]. 0.75/1.02 Derived: -atocc(A,B) | -min_precedes(C,A,B) | -precedes(D,A). [resolve(69,b,65,a)]. 0.75/1.02 Derived: -atocc(A,B) | -min_precedes(C,A,B) | -root_occ(A,D). [resolve(69,b,68,b)]. 0.75/1.02 70 -atocc(A,B) | -legal(A) | subactivity(f2(B,A),B). [resolve(54,c,52,a)]. 0.75/1.02 Derived: -atocc(A,B) | subactivity(f2(B,A),B) | -precedes(C,A). [resolve(70,b,65,a)]. 0.75/1.02 Derived: -atocc(A,B) | subactivity(f2(B,A),B) | -root_occ(A,C). [resolve(70,b,68,b)]. 0.75/1.02 71 -atocc(A,B) | -legal(A) | atocc(A,f2(B,A)). [resolve(54,c,53,a)]. 0.75/1.02 Derived: -atocc(A,B) | atocc(A,f2(B,A)) | -precedes(C,A). [resolve(71,b,65,a)]. 0.75/1.02 Derived: -atocc(A,B) | atocc(A,f2(B,A)) | -root_occ(A,C). [resolve(71,b,68,b)]. 0.75/1.02 72 atomic(A) | -occurrence_of(B,A) | legal(f6(A,B)). [resolve(55,c,51,a)]. 0.75/1.02 Derived: atomic(A) | -occurrence_of(B,A) | arboreal(f6(A,B)). [resolve(72,c,66,a)]. 0.75/1.02 Derived: atomic(A) | -occurrence_of(B,A) | -earlier(C,f6(A,B)) | precedes(C,f6(A,B)). [resolve(72,c,67,b)]. 0.75/1.02 Derived: atomic(A) | -occurrence_of(B,A) | -atocc(f6(A,B),C) | -min_precedes(D,f6(A,B),C). [resolve(72,c,69,b)]. 0.75/1.02 Derived: atomic(A) | -occurrence_of(B,A) | -atocc(f6(A,B),C) | subactivity(f2(C,f6(A,B)),C). [resolve(72,c,70,b)]. 0.75/1.02 Derived: atomic(A) | -occurrence_of(B,A) | -atocc(f6(A,B),C) | atocc(f6(A,B),f2(C,f6(A,B))). [resolve(72,c,71,b)]. 0.75/1.02 73 -subactivity_occurrence(A,B) | -occurrence_of(B,C) | root_occ(A,B) | -atocc(A,C) | -legal(A). [resolve(56,b,54,c)]. 0.75/1.02 Derived: -subactivity_occurrence(A,B) | -occurrence_of(B,C) | root_occ(A,B) | -atocc(A,C) | -precedes(D,A). [resolve(73,e,65,a)]. 0.75/1.02 Derived: -subactivity_occurrence(A,B) | -occurrence_of(B,C) | root_occ(A,B) | -atocc(A,C) | -root_occ(A,D). [resolve(73,e,68,b)]. 0.75/1.02 Derived: -subactivity_occurrence(f6(A,B),C) | -occurrence_of(C,D) | root_occ(f6(A,B),C) | -atocc(f6(A,B),D) | atomic(A) | -occurrence_of(B,A). [resolve(73,e,72,c)]. 0.75/1.02 74 min_precedes(A,f9(A,B),B) | -min_precedes(A,C,B) | -atocc(A,B) | -legal(A). [resolve(57,a,54,c)]. 0.75/1.02 Derived: min_precedes(A,f9(A,B),B) | -min_precedes(A,C,B) | -atocc(A,B) | -precedes(D,A). [resolve(74,d,65,a)]. 0.75/1.02 Derived: min_precedes(A,f9(A,B),B) | -min_precedes(A,C,B) | -atocc(A,B) | -root_occ(A,D). [resolve(74,d,68,b)]. 0.75/1.02 Derived: min_precedes(f6(A,B),f9(f6(A,B),C),C) | -min_precedes(f6(A,B),D,C) | -atocc(f6(A,B),C) | atomic(A) | -occurrence_of(B,A). [resolve(74,d,72,c)]. 0.75/1.02 75 min_precedes(A,f9(A,B),B) | atomic(B) | occurrence_of(f12(A,B),B) | -atocc(A,B) | -legal(A). [resolve(58,a,54,c)]. 0.75/1.02 Derived: min_precedes(A,f9(A,B),B) | atomic(B) | occurrence_of(f12(A,B),B) | -atocc(A,B) | -precedes(C,A). [resolve(75,e,65,a)]. 0.75/1.02 Derived: min_precedes(A,f9(A,B),B) | atomic(B) | occurrence_of(f12(A,B),B) | -atocc(A,B) | -root_occ(A,C). [resolve(75,e,68,b)]. 0.75/1.02 Derived: min_precedes(f6(A,B),f9(f6(A,B),C),C) | atomic(C) | occurrence_of(f12(f6(A,B),C),C) | -atocc(f6(A,B),C) | atomic(A) | -occurrence_of(B,A). [resolve(75,e,72,c)]. 0.75/1.02 76 min_precedes(A,f9(A,B),B) | atomic(B) | leaf_occ(A,f12(A,B)) | -atocc(A,B) | -legal(A). [resolve(59,a,54,c)]. 0.75/1.02 Derived: min_precedes(A,f9(A,B),B) | atomic(B) | leaf_occ(A,f12(A,B)) | -atocc(A,B) | -precedes(C,A). [resolve(76,e,65,a)]. 0.75/1.02 Derived: min_precedes(A,f9(A,B),B) | atomic(B) | leaf_occ(A,f12(A,B)) | -atocc(A,B) | -root_occ(A,C). [resolve(76,e,68,b)]. 0.75/1.02 Derived: min_precedes(f6(A,B),f9(f6(A,B),C),C) | atomic(C) | leaf_occ(f6(A,B),f12(f6(A,B),C)) | -atocc(f6(A,B),C) | atomic(A) | -occurrence_of(B,A). [resolve(76,e,72,c)]. 0.75/1.02 77 min_precedes(A,f9(A,B),B) | atomic(B) | leaf_occ(A,f17(A,B)) | -atocc(A,B) | -legal(A). [resolve(60,a,54,c)]. 0.75/1.02 Derived: min_precedes(A,f9(A,B),B) | atomic(B) | leaf_occ(A,f17(A,B)) | -atocc(A,B) | -precedes(C,A). [resolve(77,e,65,a)]. 0.75/1.02 Derived: min_precedes(A,f9(A,B),B) | atomic(B) | leaf_occ(A,f17(A,B)) | -atocc(A,B) | -root_occ(A,C). [resolve(77,e,68,b)]. 0.75/1.02 Derived: min_precedes(f6(A,B),f9(f6(A,B),C),C) | atomic(C) | leaf_occ(f6(A,B),f17(f6(A,B),C)) | -atocc(f6(A,B),C) | atomic(A) | -occurrence_of(B,A). [resolve(77,e,72,c)]. 0.75/1.02 78 min_precedes(A,f9(A,B),B) | atomic(B) | occurrence_of(f17(A,B),B) | -atocc(A,B) | -legal(A). [resolve(61,a,54,c)]. 0.75/1.02 Derived: min_precedes(A,f9(A,B),B) | atomic(B) | occurrence_of(f17(A,B),B) | -atocc(A,B) | -precedes(C,A). [resolve(78,e,65,a)]. 0.75/1.02 Derived: min_precedes(A,f9(A,B),B) | atomic(B) | occurrence_of(f17(A,B),B) | -atocc(A,B) | -root_occ(A,C). [resolve(78,e,68,b)]. 0.75/1.02 Derived: min_precedes(f6(A,B),f9(f6(A,B),C),C) | atomic(C) | occurrence_of(f17(f6(A,B),C),C) | -atocc(f6(A,B),C) | atomic(A) | -occurrence_of(B,A). [resolve(78,e,72,c)]. 0.75/1.02 79 min_precedes(A,f9(A,B),B) | leaf_occ(A,C) | -occurrence_of(C,B) | -subactivity_occurrence(A,C) | -atocc(A,B) | -legal(A). [resolve(62,a,54,c)]. 0.75/1.02 Derived: min_precedes(A,f9(A,B),B) | leaf_occ(A,C) | -occurrence_of(C,B) | -subactivity_occurrence(A,C) | -atocc(A,B) | -precedes(D,A). [resolve(79,f,65,a)]. 0.75/1.02 Derived: min_precedes(A,f9(A,B),B) | leaf_occ(A,C) | -occurrence_of(C,B) | -subactivity_occurrence(A,C) | -atocc(A,B) | -root_occ(A,D). [resolve(79,f,68,b)]. 0.75/1.02 Derived: min_precedes(f6(A,B),f9(f6(A,B),C),C) | leaf_occ(f6(A,B),D) | -occurrence_of(D,C) | -subactivity_occurrence(f6(A,B),D) | -atocc(f6(A,B),C) | atomic(A) | -occurrence_of(B,A). [resolve(79,f,72,c)]. 0.75/1.02 80 min_precedes(f10(A,f1(A,B)),A,f1(A,B)) | -leaf_occ(A,B) | legal(A). [resolve(63,a,51,a)]. 0.75/1.02 Derived: min_precedes(f10(A,f1(A,B)),A,f1(A,B)) | -leaf_occ(A,B) | arboreal(A). [resolve(80,c,66,a)]. 0.75/1.02 Derived: min_precedes(f10(A,f1(A,B)),A,f1(A,B)) | -leaf_occ(A,B) | -earlier(C,A) | precedes(C,A). [resolve(80,c,67,b)]. 0.75/1.02 Derived: min_precedes(f10(A,f1(A,B)),A,f1(A,B)) | -leaf_occ(A,B) | -atocc(A,C) | -min_precedes(D,A,C). [resolve(80,c,69,b)]. 0.75/1.02 Derived: min_precedes(f10(A,f1(A,B)),A,f1(A,B)) | -leaf_occ(A,B) | -atocc(A,C) | subactivity(f2(C,A),C). [resolve(80,c,70,b)]. 0.75/1.02 Derived: min_precedes(f10(A,f1(A,B)),A,f1(A,B)) | -leaf_occ(A,B) | -atocc(A,C) | atocc(A,f2(C,A)). [resolve(80,c,71,b)]. 0.75/1.02 Derived: min_precedes(f10(A,f1(A,B)),A,f1(A,B)) | -leaf_occ(A,B) | -subactivity_occurrence(A,C) | -occurrence_of(C,D) | root_occ(A,C) | -atocc(A,D). [resolve(80,c,73,e)]. 0.75/1.02 Derived: min_precedes(f10(A,f1(A,B)),A,f1(A,B)) | -leaf_occ(A,B) | min_precedes(A,f9(A,C),C) | -min_precedes(A,D,C) | -atocc(A,C). [resolve(80,c,74,d)]. 0.75/1.02 Derived: min_precedes(f10(A,f1(A,B)),A,f1(A,B)) | -leaf_occ(A,B) | min_precedes(A,f9(A,C),C) | atomic(C) | occurrence_of(f12(A,C),C) | -atocc(A,C). [resolve(80,c,75,e)]. 0.75/1.02 Derived: min_precedes(f10(A,f1(A,B)),A,f1(A,B)) | -leaf_occ(A,B) | min_precedes(A,f9(A,C),C) | atomic(C) | leaf_occ(A,f12(A,C)) | -atocc(A,C). [resolve(80,c,76,e)]. 0.75/1.02 Derived: min_precedes(f10(A,f1(A,B)),A,f1(A,B)) | -leaf_occ(A,B) | min_precedes(A,f9(A,C),C) | atomic(C) | leaf_occ(A,f17(A,C)) | -atocc(A,C). [resolve(80,c,77,e)]. 0.75/1.02 Derived: min_precedes(f10(A,f1(A,B)),A,f1(A,B)) | -leaf_occ(A,B) | min_precedes(A,f9(A,C),C) | atomic(C) | occurrence_of(f17(A,C),C) | -atocc(A,C). [resolve(80,c,78,e)]. 0.75/1.02 Derived: min_precedes(f10(A,f1(A,B)),A,f1(A,B)) | -leaf_occ(A,B) | min_precedes(A,f9(A,C),C) | leaf_occ(A,D) | -occurrence_of(D,C) | -subactivity_occurrence(A,D) | -atocc(A,C). [resolve(80,c,79,f)]. 0.75/1.02 81 -activity_occurrence(A) | occurrence_of(A,f11(A)) # label(sos_18) # label(axiom). [clausify(17)]. 0.75/1.02 82 -subactivity_occurrence(A,B) | activity_occurrence(B) # label(sos_19) # label(axiom). [clausify(1)]. 0.75/1.02 83 -subactivity_occurrence(A,B) | activity_occurrence(A) # label(sos_19) # label(axiom). [clausify(1)]. 0.75/1.02 84 -occurrence_of(A,B) | activity_occurrence(A) # label(sos_29) # label(axiom). [clausify(8)]. 0.75/1.02 Derived: occurrence_of(A,f11(A)) | -subactivity_occurrence(B,A). [resolve(81,a,82,b)]. 0.75/1.02 Derived: occurrence_of(A,f11(A)) | -subactivity_occurrence(A,B). [resolve(81,a,83,b)]. 0.75/1.02 Derived: occurrence_of(A,f11(A)) | -occurrence_of(A,B). [resolve(81,a,84,b)]. 0.75/1.02 85 -activity_occurrence(A) | subactivity(f11(A),f11(A)). [resolve(38,b,35,a)]. 0.75/1.02 Derived: subactivity(f11(A),f11(A)) | -subactivity_occurrence(B,A). [resolve(85,a,82,b)]. 0.75/1.02 Derived: subactivity(f11(A),f11(A)) | -subactivity_occurrence(A,B). [resolve(85,a,83,b)]. 3.59/3.88 Derived: subactivity(f11(A),f11(A)) | -occurrence_of(A,B). [resolve(85,a,84,b)]. 3.59/3.88 86 -subactivity(A,B) | -occurrence_of(C,B) | -atomic(B) | atocc(C,A) # label(sos_15) # label(axiom). [clausify(31)]. 3.59/3.88 87 subactivity(A,f16(B,A)) | -atocc(B,A) # label(sos_15) # label(axiom). [clausify(31)]. 3.59/3.88 88 -min_precedes(A,B,C) | subactivity(f8(C,A,B),C) # label(sos_26) # label(axiom). [clausify(13)]. 3.59/3.88 89 -min_precedes(A,B,C) | subactivity(f7(C,A,B),C) # label(sos_26) # label(axiom). [clausify(13)]. 3.59/3.88 Derived: -occurrence_of(A,f16(B,C)) | -atomic(f16(B,C)) | atocc(A,C) | -atocc(B,C). [resolve(86,a,87,a)]. 3.59/3.88 Derived: -occurrence_of(A,B) | -atomic(B) | atocc(A,f8(B,C,D)) | -min_precedes(C,D,B). [resolve(86,a,88,b)]. 3.59/3.88 Derived: -occurrence_of(A,B) | -atomic(B) | atocc(A,f7(B,C,D)) | -min_precedes(C,D,B). [resolve(86,a,89,b)]. 3.59/3.88 90 subactivity(tptp0,tptp0). [resolve(35,a,36,a)]. 3.59/3.88 Derived: -occurrence_of(A,tptp0) | -atomic(tptp0) | atocc(A,tptp0). [resolve(90,a,86,a)]. 3.59/3.88 91 subactivity(A,A) | -occurrence_of(B,A). [resolve(35,a,37,b)]. 3.59/3.88 Derived: -occurrence_of(A,B) | -occurrence_of(C,B) | -atomic(B) | atocc(C,B). [resolve(91,a,86,a)]. 3.59/3.88 92 -root_occ(A,B) | subactivity(f2(f13(A,B),A),f13(A,B)). [resolve(49,a,52,a)]. 3.59/3.88 Derived: -root_occ(A,B) | -occurrence_of(C,f13(A,B)) | -atomic(f13(A,B)) | atocc(C,f2(f13(A,B),A)). [resolve(92,b,86,a)]. 3.59/3.88 93 atomic(A) | -occurrence_of(B,A) | subactivity(f2(A,f6(A,B)),A). [resolve(55,c,52,a)]. 3.59/3.88 94 min_precedes(f10(A,f1(A,B)),A,f1(A,B)) | -leaf_occ(A,B) | subactivity(f2(f1(A,B),A),f1(A,B)). [resolve(63,a,52,a)]. 3.59/3.88 Derived: min_precedes(f10(A,f1(A,B)),A,f1(A,B)) | -leaf_occ(A,B) | -occurrence_of(C,f1(A,B)) | -atomic(f1(A,B)) | atocc(C,f2(f1(A,B),A)). [resolve(94,c,86,a)]. 3.59/3.88 95 -atocc(A,B) | subactivity(f2(B,A),B) | -precedes(C,A). [resolve(70,b,65,a)]. 3.59/3.88 Derived: -atocc(A,B) | -precedes(C,A) | -occurrence_of(D,B) | -atomic(B) | atocc(D,f2(B,A)). [resolve(95,b,86,a)]. 3.59/3.88 96 -atocc(A,B) | subactivity(f2(B,A),B) | -root_occ(A,C). [resolve(70,b,68,b)]. 3.59/3.88 Derived: -atocc(A,B) | -root_occ(A,C) | -occurrence_of(D,B) | -atomic(B) | atocc(D,f2(B,A)). [resolve(96,b,86,a)]. 3.59/3.88 97 atomic(A) | -occurrence_of(B,A) | -atocc(f6(A,B),C) | subactivity(f2(C,f6(A,B)),C). [resolve(72,c,70,b)]. 3.59/3.88 Derived: atomic(A) | -occurrence_of(B,A) | -atocc(f6(A,B),C) | -occurrence_of(D,C) | -atomic(C) | atocc(D,f2(C,f6(A,B))). [resolve(97,d,86,a)]. 3.59/3.88 98 min_precedes(f10(A,f1(A,B)),A,f1(A,B)) | -leaf_occ(A,B) | -atocc(A,C) | subactivity(f2(C,A),C). [resolve(80,c,70,b)]. 3.59/3.88 Derived: min_precedes(f10(A,f1(A,B)),A,f1(A,B)) | -leaf_occ(A,B) | -atocc(A,C) | -occurrence_of(D,C) | -atomic(C) | atocc(D,f2(C,A)). [resolve(98,d,86,a)]. 3.59/3.88 99 subactivity(f11(A),f11(A)) | -subactivity_occurrence(B,A). [resolve(85,a,82,b)]. 3.59/3.88 100 subactivity(f11(A),f11(A)) | -subactivity_occurrence(A,B). [resolve(85,a,83,b)]. 3.59/3.88 101 subactivity(f11(A),f11(A)) | -occurrence_of(A,B). [resolve(85,a,84,b)]. 3.59/3.88 3.59/3.88 ============================== end predicate elimination ============= 3.59/3.88 3.59/3.88 Auto_denials: (non-Horn, no changes). 3.59/3.88 3.59/3.88 Term ordering decisions: 3.59/3.88 3.59/3.88 % Assigning unary symbol f11 kb_weight 0 and highest precedence (38). 3.59/3.88 Function symbol KB weights: tptp0=1. tptp1=1. tptp2=1. tptp3=1. tptp4=1. c1=1. c2=1. f1=1. f2=1. f3=1. f4=1. f5=1. f6=1. f9=1. f10=1. f12=1. f13=1. f16=1. f17=1. f18=1. f19=1. f7=1. f8=1. f14=1. f15=1. f11=0. 3.59/3.88 3.59/3.88 ============================== end of process initial clauses ======== 3.59/3.88 3.59/3.88 ============================== CLAUSES FOR SEARCH ==================== 3.59/3.88 3.59/3.88 ============================== end of clauses for search ============= 3.59/3.88 3.59/3.88 ============================== SEARCH ================================ 3.59/3.88 3.59/3.88 % Starting search at 0.05 seconds. 3.59/3.88 3.59/3.88 Low Water (keep): wt=43.000, iters=3406 3.59/3.88 3.59/3.88 Low Water (keep): wt=33.000, iters=3996 3.59/3.88 3.59/3.88 Low Water (keep): wt=32.000, iters=3789 3.59/3.88 3.59/3.88 Low Water (keep): wt=30.000, iters=3334 3.59/3.88 3.59/3.88 Low Water (displace): id=6942, wt=127.000 3.59/3.88 3.59/3.88 Low Water (displace): id=7242, wt=125.000 3.59/3.88 3.59/3.88 Low Water (displace): id=6943, wt=123.000 3.59/3.88 3.59/3.88 Low Water (displace): id=7370, wt=122.000 3.59/3.88 3.59/3.88 Low Water (displace): id=7369, wt=121.000 3.59/3.88 3.59/3.88 Low Water (displace): id=7793, wt=118.000 3.59/3.88 3.59/3.88 Low WatAlarm clock 119.84/120.10 Prover9 interrupted 119.84/120.10 EOF