0.03/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s 0.12/0.33 % Computer : n028.cluster.edu 0.12/0.33 % Model : x86_64 x86_64 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 % Memory : 8042.1875MB 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 1440 0.12/0.33 % WCLimit : 180 0.12/0.33 % DateTime : Mon Jul 3 08:27:28 EDT 2023 0.12/0.33 % CPUTime : 0.40/1.00 ============================== Prover9 =============================== 0.40/1.00 Prover9 (32) version 2009-11A, November 2009. 0.40/1.00 Process 30543 was started by sandbox2 on n028.cluster.edu, 0.40/1.00 Mon Jul 3 08:27:29 2023 0.40/1.00 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1440 -f /tmp/Prover9_30350_n028.cluster.edu". 0.40/1.00 ============================== end of head =========================== 0.40/1.00 0.40/1.00 ============================== INPUT ================================= 0.40/1.00 0.40/1.00 % Reading from file /tmp/Prover9_30350_n028.cluster.edu 0.40/1.00 0.40/1.00 set(prolog_style_variables). 0.40/1.00 set(auto2). 0.40/1.00 % set(auto2) -> set(auto). 0.40/1.00 % set(auto) -> set(auto_inference). 0.40/1.00 % set(auto) -> set(auto_setup). 0.40/1.00 % set(auto_setup) -> set(predicate_elim). 0.40/1.00 % set(auto_setup) -> assign(eq_defs, unfold). 0.40/1.00 % set(auto) -> set(auto_limits). 0.40/1.00 % set(auto_limits) -> assign(max_weight, "100.000"). 0.40/1.00 % set(auto_limits) -> assign(sos_limit, 20000). 0.40/1.00 % set(auto) -> set(auto_denials). 0.40/1.00 % set(auto) -> set(auto_process). 0.40/1.00 % set(auto2) -> assign(new_constants, 1). 0.40/1.00 % set(auto2) -> assign(fold_denial_max, 3). 0.40/1.00 % set(auto2) -> assign(max_weight, "200.000"). 0.40/1.00 % set(auto2) -> assign(max_hours, 1). 0.40/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.40/1.00 % set(auto2) -> assign(max_seconds, 0). 0.40/1.00 % set(auto2) -> assign(max_minutes, 5). 0.40/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.40/1.00 % set(auto2) -> set(sort_initial_sos). 0.40/1.00 % set(auto2) -> assign(sos_limit, -1). 0.40/1.00 % set(auto2) -> assign(lrs_ticks, 3000). 0.40/1.00 % set(auto2) -> assign(max_megs, 400). 0.40/1.00 % set(auto2) -> assign(stats, some). 0.40/1.00 % set(auto2) -> clear(echo_input). 0.40/1.00 % set(auto2) -> set(quiet). 0.40/1.00 % set(auto2) -> clear(print_initial_clauses). 0.40/1.00 % set(auto2) -> clear(print_given). 0.40/1.00 assign(lrs_ticks,-1). 0.40/1.00 assign(sos_limit,10000). 0.40/1.00 assign(order,kbo). 0.40/1.00 set(lex_order_vars). 0.40/1.00 clear(print_given). 0.40/1.00 0.40/1.00 % formulas(sos). % not echoed (46 formulas) 0.40/1.00 0.40/1.00 ============================== end of input ========================== 0.40/1.00 0.40/1.00 % From the command line: assign(max_seconds, 1440). 0.40/1.00 0.40/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.40/1.00 0.40/1.00 % Formulas that are not ordinary clauses: 0.40/1.00 1 (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.40/1.00 2 (all X8 all X9 all X10 all X11 (occurrence_of(X9,X8) & -min_precedes(X10,X11,X8) & arboreal(X10) & leaf_occ(X11,X9) & subactivity_occurrence(X10,X9) -> X11 = X10)) # label(sos_02) # label(axiom) # label(non_clause). [assumption]. 0.40/1.00 3 (all X90 all X91 all X92 all X93 (occurrence_of(X92,X93) & root_occ(X91,X92) & root_occ(X90,X92) -> X90 = X91)) # label(sos_29) # label(axiom) # label(non_clause). [assumption]. 0.40/1.00 4 (all X39 all X40 (subactivity_occurrence(X39,X40) -> activity_occurrence(X40) & activity_occurrence(X39))) # label(sos_11) # label(axiom) # label(non_clause). [assumption]. 0.40/1.00 5 (all X14 all X15 all X16 all X17 (arboreal(X16) & arboreal(X17) & subactivity_occurrence(X17,X15) & subactivity_occurrence(X16,X15) & occurrence_of(X15,X14) -> X16 = X17 | min_precedes(X17,X16,X14) | min_precedes(X16,X17,X14))) # label(sos_04) # label(axiom) # label(non_clause). [assumption]. 0.40/1.00 6 (all X51 all X52 (occurrence_of(X51,X52) -> (atomic(X52) <-> arboreal(X51)))) # label(sos_16) # label(axiom) # label(non_clause). [assumption]. 0.40/1.00 7 (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.40/1.00 8 (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.40/1.00 9 (all X78 all X79 all X80 (-(exists X81 (min_precedes(X78,X81,X80) & min_precedes(X81,X79,X80))) & min_precedes(X78,X79,X80) <-> next_subocc(X78,X79,X80))) # label(sos_26) # label(axiom) # label(non_clause). [assumption]. 0.40/1.00 10 (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.40/1.00 11 (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.40/1.00 12 (all X3 all X4 all X5 all X6 all X7 (X7 != X5 & 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.40/1.00 13 (all X28 all X29 all X30 (occurrence_of(X28,X29) & occurrence_of(X28,X30) -> X30 = X29)) # label(sos_08) # label(axiom) # label(non_clause). [assumption]. 0.40/1.00 14 (all X75 all X76 all X77 (next_subocc(X75,X76,X77) -> arboreal(X76) & arboreal(X75))) # label(sos_25) # label(axiom) # label(non_clause). [assumption]. 0.40/1.00 15 (all X86 all X87 all X88 all X89 (leaf_occ(X87,X88) & leaf_occ(X86,X88) & -atomic(X89) & occurrence_of(X88,X89) -> X86 = X87)) # label(sos_28) # label(axiom) # label(non_clause). [assumption]. 0.40/1.00 16 (all X63 all X64 (precedes(X63,X64) <-> earlier(X63,X64) & legal(X64))) # label(sos_21) # label(axiom) # label(non_clause). [assumption]. 0.40/1.00 17 (all X43 (legal(X43) -> arboreal(X43))) # label(sos_13) # label(axiom) # label(non_clause). [assumption]. 0.40/1.00 18 (all X97 all X98 all X99 all X100 (precedes(X98,X99) & min_precedes(X97,X99,X100) & min_precedes(X97,X98,X100) -> min_precedes(X98,X99,X100))) # label(sos_31) # label(axiom) # label(non_clause). [assumption]. 0.40/1.00 19 (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.40/1.00 20 (all X61 all X62 (earlier(X61,X62) -> -earlier(X62,X61))) # label(sos_20) # label(axiom) # label(non_clause). [assumption]. 0.40/1.00 21 (all X35 all X36 all X37 (occurrence_of(X35,X37) & root_occ(X36,X35) -> -(exists X38 min_precedes(X38,X36,X37)))) # label(sos_10) # label(axiom) # label(non_clause). [assumption]. 0.40/1.00 22 (all X53 all X54 (root(X53,X54) -> legal(X53))) # label(sos_17) # label(axiom) # label(non_clause). [assumption]. 0.40/1.00 23 (all X65 all X66 all X67 (min_precedes(X65,X66,X67) -> -root(X66,X67))) # label(sos_22) # label(axiom) # label(non_clause). [assumption]. 0.40/1.00 24 (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.40/1.00 25 (all X101 (occurrence_of(X101,tptp0) -> (exists X102 exists X103 exists X104 (occurrence_of(X102,tptp3) & root_occ(X102,X101) & leaf_occ(X104,X101) & next_subocc(X103,X104,tptp0) & (occurrence_of(X104,tptp2) | occurrence_of(X104,tptp1)) & next_subocc(X102,X103,tptp0) & occurrence_of(X103,tptp4))))) # label(sos_32) # label(axiom) # label(non_clause). [assumption]. 0.40/1.00 26 (all X44 all X45 (atocc(X44,X45) <-> (exists X46 (occurrence_of(X44,X46) & atomic(X46) & subactivity(X45,X46))))) # label(sos_14) # label(axiom) # label(non_clause). [assumption]. 0.40/1.00 27 (all X72 all X73 all X74 (min_precedes(X72,X73,X74) -> precedes(X72,X73))) # label(sos_24) # label(axiom) # label(non_clause). [assumption]. 0.40/1.00 28 (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.40/1.00 29 (all X31 all X32 all X33 (leaf_occ(X32,X31) & occurrence_of(X31,X33) -> -(exists X34 min_precedes(X32,X34,X33)))) # label(sos_09) # label(axiom) # label(non_clause). [assumption]. 0.40/1.00 30 (all X58 all X59 (root_occ(X58,X59) <-> (exists X60 (occurrence_of(X59,X60) & subactivity_occurrence(X58,X59) & root(X58,X60))))) # label(sos_19) # label(axiom) # label(non_clause). [assumption]. 0.40/1.00 31 (all X12 all X13 (occurrence_of(X13,X12) -> activity(X12) & activity_occurrence(X13))) # label(sos_03) # label(axiom) # label(non_clause). [assumption]. 0.40/1.00 32 (all X41 (activity_occurrence(X41) -> (exists X42 (occurrence_of(X41,X42) & activity(X42))))) # label(sos_12) # label(axiom) # label(non_clause). [assumption]. 0.40/1.00 33 (all X47 all X48 (leaf(X47,X48) <-> (root(X47,X48) | (exists X49 min_precedes(X49,X47,X48))) & -(exists X50 min_precedes(X47,X50,X48)))) # label(sos_15) # label(axiom) # label(non_clause). [assumption]. 0.40/1.00 34 -(all X105 (occurrence_of(X105,tptp0) -> (exists X106 exists X107 (root_occ(X106,X105) & leaf_occ(X107,X105) & (occurrence_of(X107,tptp2) -> -(exists X109 (occurrence_of(X109,tptp1) & subactivity_occurrence(X109,X105) & min_precedes(X106,X109,tptp0)))) & (occurrence_of(X107,tptp1) -> -(exists X108 (subactivity_occurrence(X108,X105) & min_precedes(X106,X108,tptp0) & occurrence_of(X108,tptp2)))) & min_precedes(X106,X107,tptp0) & (occurrence_of(X107,tptp2) | occurrence_of(X107,tptp1)) & occurrence_of(X106,tptp3))))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption]. 0.40/1.00 0.40/1.00 ============================== end of process non-clausal formulas === 0.40/1.00 0.40/1.00 ============================== PROCESS INITIAL CLAUSES =============== 0.40/1.00 0.40/1.00 ============================== PREDICATE ELIMINATION ================= 0.40/1.00 35 -min_precedes(A,B,C) | root(f5(A,B,C),C) # label(sos_23) # label(axiom). [clausify(11)]. 0.40/1.00 36 -root(A,B) | atocc(A,f1(B,A)) # label(sos_05) # label(axiom). [clausify(1)]. 0.40/1.00 37 -root(A,B) | subactivity(f1(B,A),B) # label(sos_05) # label(axiom). [clausify(1)]. 0.40/1.00 Derived: -min_precedes(A,B,C) | atocc(f5(A,B,C),f1(C,f5(A,B,C))). [resolve(35,b,36,a)]. 0.40/1.00 Derived: -min_precedes(A,B,C) | subactivity(f1(C,f5(A,B,C)),C). [resolve(35,b,37,a)]. 0.40/1.00 38 -root(A,B) | legal(A) # label(sos_17) # label(axiom). [clausify(22)]. 0.40/1.00 Derived: legal(f5(A,B,C)) | -min_precedes(A,B,C). [resolve(38,a,35,b)]. 0.40/1.00 39 -min_precedes(A,B,C) | -root(B,C) # label(sos_22) # label(axiom). [clausify(23)]. 0.40/1.00 Derived: -min_precedes(A,f5(B,C,D),D) | -min_precedes(B,C,D). [resolve(39,b,35,b)]. 0.40/1.00 40 -occurrence_of(A,B) | atomic(B) | root(f11(B,A),B) # label(sos) # label(axiom). [clausify(28)]. 0.40/1.00 Derived: -occurrence_of(A,B) | atomic(B) | atocc(f11(B,A),f1(B,f11(B,A))). [resolve(40,c,36,a)]. 0.40/1.00 Derived: -occurrence_of(A,B) | atomic(B) | subactivity(f1(B,f11(B,A)),B). [resolve(40,c,37,a)]. 0.40/1.00 Derived: -occurrence_of(A,B) | atomic(B) | legal(f11(B,A)). [resolve(40,c,38,a)]. 0.40/1.00 Derived: -occurrence_of(A,B) | atomic(B) | -min_precedes(C,f11(B,A),B). [resolve(40,c,39,b)]. 0.40/1.00 41 -root_occ(A,B) | root(A,f12(A,B)) # label(sos_19) # label(axiom). [clausify(30)]. 0.40/1.00 Derived: -root_occ(A,B) | atocc(A,f1(f12(A,B),A)). [resolve(41,b,36,a)]. 0.40/1.00 Derived: -root_occ(A,B) | subactivity(f1(f12(A,B),A),f12(A,B)). [resolve(41,b,37,a)]. 0.40/1.00 Derived: -root_occ(A,B) | legal(A). [resolve(41,b,38,a)]. 0.40/1.00 Derived: -root_occ(A,B) | -min_precedes(C,A,f12(A,B)). [resolve(41,b,39,b)]. 0.40/1.00 42 root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -root(A,C) # label(sos_19) # label(axiom). [clausify(30)]. 0.40/1.00 Derived: root_occ(f5(A,B,C),D) | -occurrence_of(D,C) | -subactivity_occurrence(f5(A,B,C),D) | -min_precedes(A,B,C). [resolve(42,d,35,b)]. 0.40/1.00 Derived: root_occ(f11(A,B),C) | -occurrence_of(C,A) | -subactivity_occurrence(f11(A,B),C) | -occurrence_of(B,A) | atomic(A). [resolve(42,d,40,c)]. 0.40/1.00 Derived: root_occ(A,B) | -occurrence_of(B,f12(A,C)) | -subactivity_occurrence(A,B) | -root_occ(A,C). [resolve(42,d,41,b)]. 0.40/1.00 43 -leaf(A,B) | root(A,B) | min_precedes(f14(A,B),A,B) # label(sos_15) # label(axiom). [clausify(33)]. 0.40/1.00 Derived: -leaf(A,B) | min_precedes(f14(A,B),A,B) | atocc(A,f1(B,A)). [resolve(43,b,36,a)]. 0.40/1.00 Derived: -leaf(A,B) | min_precedes(f14(A,B),A,B) | subactivity(f1(B,A),B). [resolve(43,b,37,a)]. 0.40/1.00 Derived: -leaf(A,B) | min_precedes(f14(A,B),A,B) | legal(A). [resolve(43,b,38,a)]. 0.40/1.00 Derived: -leaf(A,B) | min_precedes(f14(A,B),A,B) | -min_precedes(C,A,B). [resolve(43,b,39,b)]. 0.40/1.00 Derived: -leaf(A,B) | min_precedes(f14(A,B),A,B) | root_occ(A,C) | -occurrence_of(C,B) | -subactivity_occurrence(A,C). [resolve(43,b,42,d)]. 0.40/1.00 44 leaf(A,B) | -root(A,B) | min_precedes(A,f15(A,B),B) # label(sos_15) # label(axiom). [clausify(33)]. 0.40/1.00 Derived: leaf(f5(A,B,C),C) | min_precedes(f5(A,B,C),f15(f5(A,B,C),C),C) | -min_precedes(A,B,C). [resolve(44,b,35,b)]. 0.40/1.00 Derived: leaf(f11(A,B),A) | min_precedes(f11(A,B),f15(f11(A,B),A),A) | -occurrence_of(B,A) | atomic(A). [resolve(44,b,40,c)]. 0.40/1.00 Derived: leaf(A,f12(A,B)) | min_precedes(A,f15(A,f12(A,B)),f12(A,B)) | -root_occ(A,B). [resolve(44,b,41,b)]. 0.40/1.00 45 -activity_occurrence(A) | occurrence_of(A,f13(A)) # label(sos_12) # label(axiom). [clausify(32)]. 0.40/1.00 46 -subactivity_occurrence(A,B) | activity_occurrence(B) # label(sos_11) # label(axiom). [clausify(4)]. 0.40/1.00 47 -subactivity_occurrence(A,B) | activity_occurrence(A) # label(sos_11) # label(axiom). [clausify(4)]. 0.40/1.00 48 -occurrence_of(A,B) | activity_occurrence(A) # label(sos_03) # label(axiom). [clausify(31)]. 0.40/1.00 Derived: occurrence_of(A,f13(A)) | -subactivity_occurrence(B,A). [resolve(45,a,46,b)]. 0.40/1.00 Derived: occurrence_of(A,f13(A)) | -subactivity_occurrence(A,B). [resolve(45,a,47,b)]. 0.40/1.00 Derived: occurrence_of(A,f13(A)) | -occurrence_of(A,B). [resolve(45,a,48,b)]. 0.40/1.00 49 -activity_occurrence(A) | activity(f13(A)) # label(sos_12) # label(axiom). [clausify(32)]. 0.40/1.00 Derived: activity(f13(A)) | -subactivity_occurrence(B,A). [resolve(49,a,46,b)]. 0.40/1.00 Derived: activity(f13(A)) | -subactivity_occurrence(A,B). [resolve(49,a,47,b)]. 0.40/1.00 Derived: activity(f13(A)) | -occurrence_of(A,B). [resolve(49,a,48,b)]. 0.40/1.00 50 leaf(A,f2(A,B)) | -leaf_occ(A,B) # label(sos_18) # label(axiom). [clausify(7)]. 0.40/1.00 51 -occurrence_of(A,B) | -leaf(C,B) | -subactivity_occurrence(C,A) | leaf_occ(C,A) # label(sos_18) # label(axiom). [clausify(7)]. 0.40/1.00 Derived: -leaf_occ(A,B) | -occurrence_of(C,f2(A,B)) | -subactivity_occurrence(A,C) | leaf_occ(A,C). [resolve(50,a,51,b)]. 0.40/1.00 52 -leaf(A,B) | atomic(B) | occurrence_of(f6(A,B),B) # label(sos_07) # label(axiom). [clausify(24)]. 0.40/1.00 Derived: atomic(f2(A,B)) | occurrence_of(f6(A,f2(A,B)),f2(A,B)) | -leaf_occ(A,B). [resolve(52,a,50,a)]. 0.40/1.00 53 -leaf(A,B) | atomic(B) | leaf_occ(A,f6(A,B)) # label(sos_07) # label(axiom). [clausify(24)]. 0.40/1.00 Derived: atomic(f2(A,B)) | leaf_occ(A,f6(A,f2(A,B))) | -leaf_occ(A,B). [resolve(53,a,50,a)]. 0.40/1.00 54 -leaf(A,B) | -min_precedes(A,C,B) # label(sos_15) # label(axiom). [clausify(33)]. 0.40/1.00 Derived: -min_precedes(A,B,f2(A,C)) | -leaf_occ(A,C). [resolve(54,a,50,a)]. 0.40/1.00 55 leaf(A,B) | -min_precedes(C,A,B) | min_precedes(A,f15(A,B),B) # label(sos_15) # label(axiom). [clausify(33)]. 0.40/1.00 Derived: -min_precedes(A,B,C) | min_precedes(B,f15(B,C),C) | -occurrence_of(D,C) | -subactivity_occurrence(B,D) | leaf_occ(B,D). [resolve(55,a,51,b)]. 0.40/1.00 Derived: -min_precedes(A,B,C) | min_precedes(B,f15(B,C),C) | atomic(C) | occurrence_of(f6(B,C),C). [resolve(55,a,52,a)]. 0.40/1.00 Derived: -min_precedes(A,B,C) | min_precedes(B,f15(B,C),C) | atomic(C) | leaf_occ(B,f6(B,C)). [resolve(55,a,53,a)]. 0.40/1.00 Derived: -min_precedes(A,B,C) | min_precedes(B,f15(B,C),C) | -min_precedes(B,D,C). [resolve(55,a,54,a)]. 0.40/1.00 56 -leaf(A,B) | min_precedes(f14(A,B),A,B) | atocc(A,f1(B,A)). [resolve(43,b,36,a)]. 0.40/1.00 Derived: min_precedes(f14(A,f2(A,B)),A,f2(A,B)) | atocc(A,f1(f2(A,B),A)) | -leaf_occ(A,B). [resolve(56,a,50,a)]. 0.40/1.00 Derived: min_precedes(f14(A,B),A,B) | atocc(A,f1(B,A)) | -min_precedes(C,A,B) | min_precedes(A,f15(A,B),B). [resolve(56,a,55,a)]. 0.40/1.00 57 -leaf(A,B) | min_precedes(f14(A,B),A,B) | subactivity(f1(B,A),B). [resolve(43,b,37,a)]. 0.40/1.00 Derived: min_precedes(f14(A,f2(A,B)),A,f2(A,B)) | subactivity(f1(f2(A,B),A),f2(A,B)) | -leaf_occ(A,B). [resolve(57,a,50,a)]. 0.40/1.00 Derived: min_precedes(f14(A,B),A,B) | subactivity(f1(B,A),B) | -min_precedes(C,A,B) | min_precedes(A,f15(A,B),B). [resolve(57,a,55,a)]. 0.40/1.00 58 -leaf(A,B) | min_precedes(f14(A,B),A,B) | legal(A). [resolve(43,b,38,a)]. 0.40/1.00 Derived: min_precedes(f14(A,f2(A,B)),A,f2(A,B)) | legal(A) | -leaf_occ(A,B). [resolve(58,a,50,a)]. 0.40/1.00 Derived: min_precedes(f14(A,B),A,B) | legal(A) | -min_precedes(C,A,B) | min_precedes(A,f15(A,B),B). [resolve(58,a,55,a)]. 0.40/1.00 59 -leaf(A,B) | min_precedes(f14(A,B),A,B) | -min_precedes(C,A,B). [resolve(43,b,39,b)]. 0.40/1.00 Derived: min_precedes(f14(A,f2(A,B)),A,f2(A,B)) | -min_precedes(C,A,f2(A,B)) | -leaf_occ(A,B). [resolve(59,a,50,a)]. 0.40/1.00 Derived: min_precedes(f14(A,B),A,B) | -min_precedes(C,A,B) | -min_precedes(D,A,B) | min_precedes(A,f15(A,B),B). [resolve(59,a,55,a)]. 0.40/1.00 60 -leaf(A,B) | min_precedes(f14(A,B),A,B) | root_occ(A,C) | -occurrence_of(C,B) | -subactivity_occurrence(A,C). [resolve(43,b,42,d)]. 0.40/1.00 Derived: min_precedes(f14(A,f2(A,B)),A,f2(A,B)) | root_occ(A,C) | -occurrence_of(C,f2(A,B)) | -subactivity_occurrence(A,C) | -leaf_occ(A,B). [resolve(60,a,50,a)]. 0.40/1.00 61 leaf(f5(A,B,C),C) | min_precedes(f5(A,B,C),f15(f5(A,B,C),C),C) | -min_precedes(A,B,C). [resolve(44,b,35,b)]. 0.40/1.00 Derived: min_precedes(f5(A,B,C),f15(f5(A,B,C),C),C) | -min_precedes(A,B,C) | -occurrence_of(D,C) | -subactivity_occurrence(f5(A,B,C),D) | leaf_occ(f5(A,B,C),D). [resolve(61,a,51,b)]. 0.40/1.00 Derived: min_precedes(f5(A,B,C),f15(f5(A,B,C),C),C) | -min_precedes(A,B,C) | atomic(C) | occurrence_of(f6(f5(A,B,C),C),C). [resolve(61,a,52,a)]. 0.40/1.00 Derived: min_precedes(f5(A,B,C),f15(f5(A,B,C),C),C) | -min_precedes(A,B,C) | atomic(C) | leaf_occ(f5(A,B,C),f6(f5(A,B,C),C)). [resolve(61,a,53,a)]. 0.40/1.00 Derived: min_precedes(f5(A,B,C),f15(f5(A,B,C),C),C) | -min_precedes(A,B,C) | -min_precedes(f5(A,B,C),D,C). [resolve(61,a,54,a)]. 0.40/1.00 Derived: min_precedes(f5(A,B,C),f15(f5(A,B,C),C),C) | -min_precedes(A,B,C) | min_precedes(f14(f5(A,B,C),C),f5(A,B,C),C) | atocc(f5(A,B,C),f1(C,f5(A,B,C))). [resolve(61,a,56,a)]. 0.40/1.00 Derived: min_precedes(f5(A,B,C),f15(f5(A,B,C),C),C) | -min_precedes(A,B,C) | min_precedes(f14(f5(A,B,C),C),f5(A,B,C),C) | subactivity(f1(C,f5(A,B,C)),C). [resolve(61,a,57,a)]. 0.40/1.00 Derived: min_precedes(f5(A,B,C),f15(f5(A,B,C),C),C) | -min_precedes(A,B,C) | min_precedes(f14(f5(A,B,C),C),f5(A,B,C),C) | legal(f5(A,B,C)). [resolve(61,a,58,a)]. 0.40/1.00 Derived: min_precedes(f5(A,B,C),f15(f5(A,B,C),C),C) | -min_precedes(A,B,C) | min_precedes(f14(f5(A,B,C),C),f5(A,B,C),C) | root_occ(f5(A,B,C),D) | -occurrence_of(D,C) | -subactivity_occurrence(f5(A,B,C),D). [resolve(61,a,60,a)]. 0.40/1.00 62 leaf(f11(A,B),A) | min_precedes(f11(A,B),f15(f11(A,B),A),A) | -occurrence_of(B,A) | atomic(A). [resolve(44,b,40,c)]. 0.40/1.00 Derived: min_precedes(f11(A,B),f15(f11(A,B),A),A) | -occurrence_of(B,A) | atomic(A) | -occurrence_of(C,A) | -subactivity_occurrence(f11(A,B),C) | leaf_occ(f11(A,B),C). [resolve(62,a,51,b)]. 0.40/1.00 Derived: min_precedes(f11(A,B),f15(f11(A,B),A),A) | -occurrence_of(B,A) | atomic(A) | atomic(A) | occurrence_of(f6(f11(A,B),A),A). [resolve(62,a,52,a)]. 0.40/1.00 Derived: min_precedes(f11(A,B),f15(f11(A,B),A),A) | -occurrence_of(B,A) | atomic(A) | atomic(A) | leaf_occ(f11(A,B),f6(f11(A,B),A)). [resolve(62,a,53,a)]. 0.40/1.00 Derived: min_precedes(f11(A,B),f15(f11(A,B),A),A) | -occurrence_of(B,A) | atomic(A) | -min_precedes(f11(A,B),C,A). [resolve(62,a,54,a)]. 0.40/1.00 Derived: min_precedes(f11(A,B),f15(f11(A,B),A),A) | -occurrence_of(B,A) | atomic(A) | min_precedes(f14(f11(A,B),A),f11(A,B),A) | atocc(f11(A,B),f1(A,f11(A,B))). [resolve(62,a,56,a)]. 0.40/1.00 Derived: min_precedes(f11(A,B),f15(f11(A,B),A),A) | -occurrence_of(B,A) | atomic(A) | min_precedes(f14(f11(A,B),A),f11(A,B),A) | subactivity(f1(A,f11(A,B)),A). [resolve(62,a,57,a)]. 0.40/1.00 Derived: min_precedes(f11(A,B),f15(f11(A,B),A),A) | -occurrence_of(B,A) | atomic(A) | min_precedes(f14(f11(A,B),A),f11(A,B),A) | legal(f11(A,B)). [resolve(62,a,58,a)]. 0.40/1.00 Derived: min_precedes(f11(A,B),f15(f11(A,B),A),A) | -occurrence_of(B,A) | atomic(A) | min_precedes(f14(f11(A,B),A),f11(A,B),A) | root_occ(f11(A,B),C) | -occurrence_of(C,A) | -subactivity_occurrence(f11(A,B),C). [resolve(62,a,60,a)]. 0.40/1.00 63 leaf(A,f12(A,B)) | min_precedes(A,f15(A,f12(A,B)),f12(A,B)) | -root_occ(A,B). [resolve(44,b,41,b)]. 0.40/1.00 Derived: min_precedes(A,f15(A,f12(A,B)),f12(A,B)) | -root_occ(A,B) | -occurrence_of(C,f12(A,B)) | -subactivity_occurrence(A,C) | leaf_occ(A,C). [resolve(63,a,51,b)]. 0.40/1.00 Derived: min_precedes(A,f15(A,f12(A,B)),f12(A,B)) | -root_occ(A,B) | atomic(f12(A,B)) | occurrence_of(f6(A,f12(A,B)),f12(A,B)). [resolve(63,a,52,a)]. 0.40/1.00 Derived: min_precedes(A,f15(A,f12(A,B)),f12(A,B)) | -root_occ(A,B) | atomic(f12(A,B)) | leaf_occ(A,f6(A,f12(A,B))). [resolve(63,a,53,a)]. 0.40/1.00 Derived: min_precedes(A,f15(A,f12(A,B)),f12(A,B)) | -root_occ(A,B) | -min_precedes(A,C,f12(A,B)). [resolve(63,a,54,a)]. 0.40/1.00 Derived: min_precedes(A,f15(A,f12(A,B)),f12(A,B)) | -root_occ(A,B) | min_precedes(f14(A,f12(A,B)),A,f12(A,B)) | atocc(A,f1(f12(A,B),A)). [resolve(63,a,56,a)]. 0.40/1.00 Derived: min_precedes(A,f15(A,f12(A,B)),f12(A,B)) | -root_occ(A,B) | min_precedes(f14(A,f12(A,B)),A,f12(A,B)) | subactivity(f1(f12(A,B),A),f12(A,B)). [resolve(63,a,57,a)]. 0.40/1.01 Derived: min_precedes(A,f15(A,f12(A,B)),f12(A,B)) | -root_occ(A,B) | min_precedes(f14(A,f12(A,B)),A,f12(A,B)) | legal(A). [resolve(63,a,58,a)]. 0.40/1.01 Derived: min_precedes(A,f15(A,f12(A,B)),f12(A,B)) | -root_occ(A,B) | min_precedes(f14(A,f12(A,B)),A,f12(A,B)) | root_occ(A,C) | -occurrence_of(C,f12(A,B)) | -subactivity_occurrence(A,C). [resolve(63,a,60,a)]. 0.40/1.01 64 -min_precedes(A,B,C) | -min_precedes(B,D,C) | -next_subocc(A,D,C) # label(sos_26) # label(axiom). [clausify(9)]. 0.40/1.01 65 min_precedes(A,f4(A,B,C),C) | -min_precedes(A,B,C) | next_subocc(A,B,C) # label(sos_26) # label(axiom). [clausify(9)]. 0.40/1.01 66 min_precedes(f4(A,B,C),B,C) | -min_precedes(A,B,C) | next_subocc(A,B,C) # label(sos_26) # label(axiom). [clausify(9)]. 0.40/1.01 Derived: -min_precedes(A,B,C) | -min_precedes(B,D,C) | min_precedes(A,f4(A,D,C),C) | -min_precedes(A,D,C). [resolve(64,c,65,c)]. 0.40/1.01 Derived: -min_precedes(A,B,C) | -min_precedes(B,D,C) | min_precedes(f4(A,D,C),D,C) | -min_precedes(A,D,C). [resolve(64,c,66,c)]. 0.40/1.01 67 min_precedes(A,B,C) | -next_subocc(A,B,C) # label(sos_26) # label(axiom). [clausify(9)]. 0.40/1.01 68 -next_subocc(A,B,C) | arboreal(B) # label(sos_25) # label(axiom). [clausify(14)]. 0.40/1.01 Derived: arboreal(A) | min_precedes(B,f4(B,A,C),C) | -min_precedes(B,A,C). [resolve(68,a,65,c)]. 0.40/1.01 Derived: arboreal(A) | min_precedes(f4(B,A,C),A,C) | -min_precedes(B,A,C). [resolve(68,a,66,c)]. 0.40/1.01 69 -next_subocc(A,B,C) | arboreal(A) # label(sos_25) # label(axiom). [clausify(14)]. 0.40/1.01 Derived: arboreal(A) | min_precedes(A,f4(A,B,C),C) | -min_precedes(A,B,C). [resolve(69,a,65,c)]. 0.40/1.01 Derived: arboreal(A) | min_precedes(f4(A,B,C),B,C) | -min_precedes(A,B,C). [resolve(69,a,66,c)]. 0.40/1.01 70 -occurrence_of(A,tptp0) | next_subocc(f8(A),f9(A),tptp0) # label(sos_32) # label(axiom). [clausify(25)]. 0.40/1.01 Derived: -occurrence_of(A,tptp0) | -min_precedes(f8(A),B,tptp0) | -min_precedes(B,f9(A),tptp0). [resolve(70,b,64,c)]. 0.40/1.01 Derived: -occurrence_of(A,tptp0) | min_precedes(f8(A),f9(A),tptp0). [resolve(70,b,67,b)]. 0.40/1.01 Derived: -occurrence_of(A,tptp0) | arboreal(f9(A)). [resolve(70,b,68,a)]. 0.40/1.01 Derived: -occurrence_of(A,tptp0) | arboreal(f8(A)). [resolve(70,b,69,a)]. 0.40/1.01 71 -occurrence_of(A,tptp0) | next_subocc(f7(A),f8(A),tptp0) # label(sos_32) # label(axiom). [clausify(25)]. 0.40/1.01 Derived: -occurrence_of(A,tptp0) | -min_precedes(f7(A),B,tptp0) | -min_precedes(B,f8(A),tptp0). [resolve(71,b,64,c)]. 0.40/1.01 Derived: -occurrence_of(A,tptp0) | min_precedes(f7(A),f8(A),tptp0). [resolve(71,b,67,b)]. 0.40/1.01 Derived: -occurrence_of(A,tptp0) | arboreal(f7(A)). [resolve(71,b,69,a)]. 0.40/1.01 72 precedes(A,B) | -earlier(A,B) | -legal(B) # label(sos_21) # label(axiom). [clausify(16)]. 0.40/1.01 73 -precedes(A,B) | earlier(A,B) # label(sos_21) # label(axiom). [clausify(16)]. 0.40/1.01 74 -precedes(A,B) | legal(B) # label(sos_21) # label(axiom). [clausify(16)]. 0.40/1.01 75 -precedes(A,B) | -min_precedes(C,B,D) | -min_precedes(C,A,D) | min_precedes(A,B,D) # label(sos_31) # label(axiom). [clausify(18)]. 0.40/1.01 Derived: -min_precedes(A,B,C) | -min_precedes(A,D,C) | min_precedes(D,B,C) | -earlier(D,B) | -legal(B). [resolve(75,a,72,a)]. 0.40/1.01 76 -min_precedes(A,B,C) | precedes(A,B) # label(sos_24) # label(axiom). [clausify(27)]. 0.40/1.01 Derived: -min_precedes(A,B,C) | earlier(A,B). [resolve(76,b,73,a)]. 0.40/1.01 Derived: -min_precedes(A,B,C) | legal(B). [resolve(76,b,74,a)]. 0.40/1.01 Derived: -min_precedes(A,B,C) | -min_precedes(D,B,E) | -min_precedes(D,A,E) | min_precedes(A,B,E). [resolve(76,b,75,a)]. 0.40/1.01 77 legal(f5(A,B,C)) | -min_precedes(A,B,C). [resolve(38,a,35,b)]. 0.40/1.01 78 -legal(A) | arboreal(A) # label(sos_13) # label(axiom). [clausify(17)]. 0.40/1.01 Derived: -min_precedes(A,B,C) | arboreal(f5(A,B,C)). [resolve(77,a,78,a)]. 0.40/1.01 79 -occurrence_of(A,B) | atomic(B) | legal(f11(B,A)). [resolve(40,c,38,a)]. 0.40/1.01 Derived: -occurrence_of(A,B) | atomic(B) | arboreal(f11(B,A)). [resolve(79,c,78,a)]. 0.40/1.01 80 -root_occ(A,B) | legal(A). [resolve(41,b,38,a)]. 0.40/1.01 Derived: -root_occ(A,B) | arboreal(A). [resolve(80,b,78,a)]. 0.40/1.01 81 min_precedes(f14(A,f2(A,B)),A,f2(A,B)) | legal(A) | -leaf_occ(A,B). [resolve(58,a,50,a)]. 0.40/1.01 Derived: min_precedes(f14(A,f2(A,B)),A,f2(A,B)) | -leaf_occ(A,B) | arboreal(A). [resolve(81,b,78,a)]. 0.40/1.01 82 min_precedes(f14(A,B),A,B) | legal(A) | -min_precedes(C,A,B) | min_precedes(A,f15(A,B),B). [resolve(58,a,55,a)]. 0.40/1.01 83 min_precedes(f5(A,B,C),f15(f5(A,B,C),C),C) | -min_precedes(A,B,C) | min_precedes(f14(f5(A,B,C),C),f5(A,B,C),C) | legal(f5(A,B,C)). [resolve(61,a,58,a)]. 0.40/1.01 84 min_precedes(f11(A,B),f15(f11(A,B),A),A) | -occurrence_of(B,A) | atomic(A) | min_precedes(f14(f11(A,B),A),f11(A,B),A) | legal(f11(A,B)). [resolve(62,a,58,a)]. 0.40/1.01 85 min_precedes(A,f15(A,f12(A,B)),f12(A,B)) | -root_occ(A,B) | min_precedes(f14(A,f12(A,B)),A,f12(A,B)) | legal(A). [resolve(63,a,58,a)]. 0.40/1.01 86 -min_precedes(A,B,C) | -min_precedes(A,D,C) | min_precedes(D,B,C) | -earlier(D,B) | -legal(B). [resolve(75,a,72,a)]. 0.40/1.01 Derived: -min_precedes(A,f5(B,C,D),E) | -min_precedes(A,F,E) | min_precedes(F,f5(B,C,D),E) | -earlier(F,f5(B,C,D)) | -min_precedes(B,C,D). [resolve(86,e,77,a)]. 0.40/1.01 Derived: -min_precedes(A,f11(B,C),D) | -min_precedes(A,E,D) | min_precedes(E,f11(B,C),D) | -earlier(E,f11(B,C)) | -occurrence_of(C,B) | atomic(B). [resolve(86,e,79,c)]. 0.40/1.01 Derived: -min_precedes(A,B,C) | -min_precedes(A,D,C) | min_precedes(D,B,C) | -earlier(D,B) | -root_occ(B,E). [resolve(86,e,80,b)]. 0.40/1.01 Derived: -min_precedes(A,B,C) | -min_precedes(A,D,C) | min_precedes(D,B,C) | -earlier(D,B) | min_precedes(f14(B,f2(B,E)),B,f2(B,E)) | -leaf_occ(B,E). [resolve(86,e,81,b)]. 0.40/1.01 Derived: -min_precedes(A,B,C) | -min_precedes(A,D,C) | min_precedes(D,B,C) | -earlier(D,B) | min_precedes(f14(B,E),B,E) | -min_precedes(F,B,E) | min_precedes(B,f15(B,E),E). [resolve(86,e,82,b)]. 0.40/1.01 87 -min_precedes(A,B,C) | legal(B). [resolve(76,b,74,a)]. 0.40/1.01 Derived: -min_precedes(A,B,C) | arboreal(B). [resolve(87,b,78,a)]. 0.40/1.01 Derived: -min_precedes(A,B,C) | -min_precedes(D,B,E) | -min_precedes(D,F,E) | min_precedes(F,B,E) | -earlier(F,B). [resolve(87,b,86,e)]. 0.40/1.01 88 atocc(A,B) | -occurrence_of(A,C) | -atomic(C) | -subactivity(B,C) # label(sos_14) # label(axiom). [clausify(26)]. 0.40/1.01 89 -atocc(A,B) | occurrence_of(A,f10(A,B)) # label(sos_14) # label(axiom). [clausify(26)]. 0.40/1.01 90 -atocc(A,B) | atomic(f10(A,B)) # label(sos_14) # label(axiom). [clausify(26)]. 0.40/1.01 91 -atocc(A,B) | subactivity(B,f10(A,B)) # label(sos_14) # label(axiom). [clausify(26)]. 0.40/1.01 Derived: -occurrence_of(A,B) | -atomic(B) | -subactivity(C,B) | occurrence_of(A,f10(A,C)). [resolve(88,a,89,a)]. 0.40/1.01 Derived: -occurrence_of(A,B) | -atomic(B) | -subactivity(C,B) | atomic(f10(A,C)). [resolve(88,a,90,a)]. 0.40/1.01 Derived: -occurrence_of(A,B) | -atomic(B) | -subactivity(C,B) | subactivity(C,f10(A,C)). [resolve(88,a,91,a)]. 0.40/1.01 92 -min_precedes(A,B,C) | atocc(f5(A,B,C),f1(C,f5(A,B,C))). [resolve(35,b,36,a)]. 0.40/1.01 Derived: -min_precedes(A,B,C) | occurrence_of(f5(A,B,C),f10(f5(A,B,C),f1(C,f5(A,B,C)))). [resolve(92,b,89,a)]. 0.40/1.01 Derived: -min_precedes(A,B,C) | atomic(f10(f5(A,B,C),f1(C,f5(A,B,C)))). [resolve(92,b,90,a)]. 0.40/1.01 Derived: -min_precedes(A,B,C) | subactivity(f1(C,f5(A,B,C)),f10(f5(A,B,C),f1(C,f5(A,B,C)))). [resolve(92,b,91,a)]. 0.40/1.01 93 -occurrence_of(A,B) | atomic(B) | atocc(f11(B,A),f1(B,f11(B,A))). [resolve(40,c,36,a)]. 0.40/1.01 Derived: -occurrence_of(A,B) | atomic(B) | occurrence_of(f11(B,A),f10(f11(B,A),f1(B,f11(B,A)))). [resolve(93,c,89,a)]. 0.40/1.01 Derived: -occurrence_of(A,B) | atomic(B) | atomic(f10(f11(B,A),f1(B,f11(B,A)))). [resolve(93,c,90,a)]. 0.40/1.01 Derived: -occurrence_of(A,B) | atomic(B) | subactivity(f1(B,f11(B,A)),f10(f11(B,A),f1(B,f11(B,A)))). [resolve(93,c,91,a)]. 0.40/1.01 94 -root_occ(A,B) | atocc(A,f1(f12(A,B),A)). [resolve(41,b,36,a)]. 0.40/1.01 Derived: -root_occ(A,B) | occurrence_of(A,f10(A,f1(f12(A,B),A))). [resolve(94,b,89,a)]. 0.40/1.01 Derived: -root_occ(A,B) | atomic(f10(A,f1(f12(A,B),A))). [resolve(94,b,90,a)]. 0.40/1.01 Derived: -root_occ(A,B) | subactivity(f1(f12(A,B),A),f10(A,f1(f12(A,B),A))). [resolve(94,b,91,a)]. 0.40/1.01 95 min_precedes(f14(A,f2(A,B)),A,f2(A,B)) | atocc(A,f1(f2(A,B),A)) | -leaf_occ(A,B). [resolve(56,a,50,a)]. 0.40/1.01 Derived: min_precedes(f14(A,f2(A,B)),A,f2(A,B)) | -leaf_occ(A,B) | occurrence_of(A,f10(A,f1(f2(A,B),A))). [resolve(95,b,89,a)]. 0.40/1.01 Derived: min_precedes(f14(A,f2(A,B)),A,f2(A,B)) | -leaf_occ(A,B) | atomic(f10(A,f1(f2(A,B),A))). [resolve(95,b,90,a)]. 0.40/1.01 Derived: min_precedes(f14(A,f2(A,B)),A,f2(AAlarm clock 179.62/180.03 Prover9 interrupted 179.62/180.04 EOF