0.08/0.13 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.08/0.14 % Command : tptp2X_and_run_prover9 %d %s 0.15/0.35 % Computer : n012.cluster.edu 0.15/0.35 % Model : x86_64 x86_64 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.15/0.35 % Memory : 8042.1875MB 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64 0.15/0.35 % CPULimit : 1200 0.15/0.35 % DateTime : Tue Jul 13 16:37:46 EDT 2021 0.15/0.35 % CPUTime : 0.91/1.21 ============================== Prover9 =============================== 0.91/1.21 Prover9 (32) version 2009-11A, November 2009. 0.91/1.21 Process 3496 was started by sandbox on n012.cluster.edu, 0.91/1.21 Tue Jul 13 16:37:47 2021 0.91/1.21 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1200 -f /tmp/Prover9_3225_n012.cluster.edu". 0.91/1.21 ============================== end of head =========================== 0.91/1.21 0.91/1.21 ============================== INPUT ================================= 0.91/1.21 0.91/1.21 % Reading from file /tmp/Prover9_3225_n012.cluster.edu 0.91/1.21 0.91/1.21 set(prolog_style_variables). 0.91/1.21 set(auto2). 0.91/1.21 % set(auto2) -> set(auto). 0.91/1.21 % set(auto) -> set(auto_inference). 0.91/1.21 % set(auto) -> set(auto_setup). 0.91/1.21 % set(auto_setup) -> set(predicate_elim). 0.91/1.21 % set(auto_setup) -> assign(eq_defs, unfold). 0.91/1.21 % set(auto) -> set(auto_limits). 0.91/1.21 % set(auto_limits) -> assign(max_weight, "100.000"). 0.91/1.21 % set(auto_limits) -> assign(sos_limit, 20000). 0.91/1.21 % set(auto) -> set(auto_denials). 0.91/1.21 % set(auto) -> set(auto_process). 0.91/1.21 % set(auto2) -> assign(new_constants, 1). 0.91/1.21 % set(auto2) -> assign(fold_denial_max, 3). 0.91/1.21 % set(auto2) -> assign(max_weight, "200.000"). 0.91/1.21 % set(auto2) -> assign(max_hours, 1). 0.91/1.21 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.91/1.21 % set(auto2) -> assign(max_seconds, 0). 0.91/1.21 % set(auto2) -> assign(max_minutes, 5). 0.91/1.21 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.91/1.21 % set(auto2) -> set(sort_initial_sos). 0.91/1.21 % set(auto2) -> assign(sos_limit, -1). 0.91/1.21 % set(auto2) -> assign(lrs_ticks, 3000). 0.91/1.21 % set(auto2) -> assign(max_megs, 400). 0.91/1.21 % set(auto2) -> assign(stats, some). 0.91/1.21 % set(auto2) -> clear(echo_input). 0.91/1.21 % set(auto2) -> set(quiet). 0.91/1.21 % set(auto2) -> clear(print_initial_clauses). 0.91/1.21 % set(auto2) -> clear(print_given). 0.91/1.21 assign(lrs_ticks,-1). 0.91/1.21 assign(sos_limit,10000). 0.91/1.21 assign(order,kbo). 0.91/1.21 set(lex_order_vars). 0.91/1.21 clear(print_given). 0.91/1.21 0.91/1.21 % formulas(sos). % not echoed (63 formulas) 0.91/1.21 0.91/1.21 ============================== end of input ========================== 0.91/1.21 0.91/1.21 % From the command line: assign(max_seconds, 1200). 0.91/1.21 0.91/1.21 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.91/1.21 0.91/1.21 % Formulas that are not ordinary clauses: 0.91/1.21 1 (all X148 all X149 all X150 (min_precedes(X148,X149,X150) -> arboreal(X148))) # label(sos_46) # label(axiom) # label(non_clause). [assumption]. 0.91/1.21 2 (all X113 all X114 all X115 (leaf_occ(X114,X113) & occurrence_of(X113,X115) -> -(exists X116 min_precedes(X114,X116,X115)))) # label(sos_37) # label(axiom) # label(non_clause). [assumption]. 0.91/1.21 3 (all X134 all X135 all X136 all X137 (-min_precedes(X137,X136,X134) & arboreal(X136) & root_occ(X137,X135) & subactivity_occurrence(X136,X135) & occurrence_of(X135,X134) -> X137 = X136)) # label(sos_42) # label(axiom) # label(non_clause). [assumption]. 0.91/1.21 4 (all X102 all X103 (leaf_occ(X102,X103) <-> (exists X104 (occurrence_of(X103,X104) & leaf(X102,X104) & subactivity_occurrence(X102,X103))))) # label(sos_34) # label(axiom) # label(non_clause). [assumption]. 0.91/1.21 5 (all X69 all X70 all X71 (min_precedes(X70,X71,X69) -> (exists X72 (subactivity_occurrence(X71,X72) & subactivity_occurrence(X70,X72) & occurrence_of(X72,X69))))) # label(sos_25) # label(axiom) # label(non_clause). [assumption]. 0.91/1.21 6 (all X76 all X77 (occurrence_of(X77,X76) & -atomic(X76) -> (exists X78 (subactivity_occurrence(X78,X77) & root(X78,X76))))) # label(sos_27) # label(axiom) # label(non_clause). [assumption]. 0.91/1.21 7 (all X19 all X20 (earlier(X20,X19) & legal(X19) -> legal(X20))) # label(sos_09) # label(axiom) # label(non_clause). [assumption]. 0.91/1.21 8 (all X10 all X11 all X12 (earlier(X11,X12) & earlier(X10,X11) -> earlier(X10,X12))) # label(sos_05) # label(axiom) # label(non_clause). [assumption]. 0.91/1.21 9 (all X121 all X122 all X123 all X124 all X125 (next_subocc(X121,X122,X124) & next_subocc(X121,X123,X124) & occurrence_of(X125,X124) & subactivity_occurrence(X122,X125) & subactivity_occurrence(X123,X125) -> X122 = X123)) # label(sos_39) # label(axiom) # label(non_clause). [assumption]. 0.91/1.21 10 (all X109 all X110 all X111 all X112 (-atomic(X112) & leaf_occ(X110,X111) & leaf_occ(X109,X111) & occurrence_of(X111,X112) -> X109 = X110)) # label(sos_36) # label(axiom) # label(non_clause). [assumption]. 0.91/1.21 11 (all X21 all X22 (earlier(X21,X22) & legal(X22) <-> precedes(X21,X22))) # label(sos_10) # label(axiom) # label(non_clause). [assumption]. 0.91/1.21 12 (all X105 all X106 all X107 all X108 (root_occ(X106,X107) & root_occ(X105,X107) & occurrence_of(X107,X108) -> X105 = X106)) # label(sos_35) # label(axiom) # label(non_clause). [assumption]. 0.91/1.21 13 (all X56 all X57 (leaf(X56,X57) <-> (root(X56,X57) | (exists X58 min_precedes(X58,X56,X57))) & -(exists X59 min_precedes(X56,X59,X57)))) # label(sos_21) # label(axiom) # label(non_clause). [assumption]. 0.91/1.21 14 (all X83 all X84 all X85 all X86 (min_precedes(X83,X84,X85) & subactivity_occurrence(X84,X86) & occurrence_of(X86,X85) -> subactivity_occurrence(X83,X86))) # label(sos_29) # label(axiom) # label(non_clause). [assumption]. 0.91/1.21 15 (all X18 (legal(X18) -> arboreal(X18))) # label(sos_08) # label(axiom) # label(non_clause). [assumption]. 0.91/1.21 16 (all X60 all X61 all X62 (next_subocc(X60,X61,X62) <-> min_precedes(X60,X61,X62) & -(exists X63 (min_precedes(X60,X63,X62) & min_precedes(X63,X61,X62))))) # label(sos_22) # label(axiom) # label(non_clause). [assumption]. 0.91/1.21 17 (all X8 all X9 (earlier(X8,X9) -> -earlier(X9,X8))) # label(sos_04) # label(axiom) # label(non_clause). [assumption]. 0.91/1.21 18 (all X145 all X146 (-atomic(X146) & leaf(X145,X146) -> (exists X147 (occurrence_of(X147,X146) & leaf_occ(X145,X147))))) # label(sos_45) # label(axiom) # label(non_clause). [assumption]. 0.91/1.21 19 (all X130 all X131 all X132 all X133 (occurrence_of(X130,X133) & X132 != X131 & root_occ(X132,X130) & leaf_occ(X131,X130) -> min_precedes(X132,X131,X133))) # label(sos_41) # label(axiom) # label(non_clause). [assumption]. 0.91/1.21 20 (all X23 all X24 all X25 (min_precedes(X24,X25,X23) -> (exists X26 exists X27 (subactivity(X26,X23) & subactivity(X27,X23) & atocc(X24,X26) & atocc(X25,X27))))) # label(sos_11) # label(axiom) # label(non_clause). [assumption]. 0.91/1.21 21 (all X52 all X53 all X54 all X55 (min_precedes(X53,X52,X55) & min_precedes(X54,X52,X55) & precedes(X53,X54) -> min_precedes(X53,X54,X55))) # label(sos_20) # label(axiom) # label(non_clause). [assumption]. 0.91/1.21 22 (all X13 all X14 all X15 (earlier(X15,X14) & earlier(X13,X14) -> earlier(X15,X13) | X13 = X15 | earlier(X13,X15))) # label(sos_06) # label(axiom) # label(non_clause). [assumption]. 0.91/1.21 23 (all X7 (activity(X7) -> subactivity(X7,X7))) # label(sos_03) # label(axiom) # label(non_clause). [assumption]. 0.91/1.21 24 (all X45 all X46 all X47 all X48 (min_precedes(X45,X46,X48) & min_precedes(X45,X47,X48) & precedes(X46,X47) -> min_precedes(X46,X47,X48))) # label(sos_18) # label(axiom) # label(non_clause). [assumption]. 0.91/1.21 25 (all X49 all X50 all X51 (min_precedes(X49,X50,X51) -> -atomic(X51))) # label(sos_19) # label(axiom) # label(non_clause). [assumption]. 0.91/1.21 26 (all X142 all X143 all X144 (next_subocc(X142,X143,X144) -> arboreal(X143) & arboreal(X142))) # label(sos_44) # label(axiom) # label(non_clause). [assumption]. 0.91/1.21 27 (all X99 all X100 ((exists X101 (root(X99,X101) & subactivity_occurrence(X99,X100) & occurrence_of(X100,X101))) <-> root_occ(X99,X100))) # label(sos_33) # label(axiom) # label(non_clause). [assumption]. 0.91/1.21 28 (all X64 all X65 (atocc(X64,X65) <-> (exists X66 (subactivity(X65,X66) & atomic(X66) & occurrence_of(X64,X66))))) # label(sos_23) # label(axiom) # label(non_clause). [assumption]. 0.91/1.21 29 (all X94 all X95 all X96 all X97 (occurrence_of(X96,X94) & occurrence_of(X97,X95) & -subactivity_occurrence(X96,X97) & subactivity(X94,X95) -> (exists X98 (subactivity_occurrence(X98,X97) & -subactivity_occurrence(X98,X96))))) # label(sos_32) # label(axiom) # label(non_clause). [assumption]. 0.91/1.21 30 (all X31 all X32 all X33 (min_precedes(X31,X32,X33) -> (exists X34 (root(X34,X33) & min_precedes(X34,X32,X33))))) # label(sos_13) # label(axiom) # label(non_clause). [assumption]. 0.91/1.21 31 (all X138 all X139 all X140 all X141 (occurrence_of(X139,X138) & subactivity_occurrence(X140,X139) & leaf_occ(X141,X139) & -min_precedes(X140,X141,X138) & arboreal(X140) -> X140 = X141)) # label(sos_43) # label(axiom) # label(non_clause). [assumption]. 0.91/1.21 32 (all X28 all X29 (root(X29,X28) -> (exists X30 (atocc(X29,X30) & subactivity(X30,X28))))) # label(sos_12) # label(axiom) # label(non_clause). [assumption]. 0.91/1.22 33 (all X126 all X127 all X128 all X129 (next_subocc(X128,X126,X129) & next_subocc(X127,X126,X129) -> X127 = X128)) # label(sos_40) # label(axiom) # label(non_clause). [assumption]. 0.91/1.22 34 (all X79 all X80 all X81 all X82 (occurrence_of(X80,X79) & arboreal(X82) & subactivity_occurrence(X82,X80) & subactivity_occurrence(X81,X80) & arboreal(X81) -> min_precedes(X82,X81,X79) | X82 = X81 | min_precedes(X81,X82,X79))) # label(sos_28) # label(axiom) # label(non_clause). [assumption]. 0.91/1.22 35 (all X38 all X39 all X40 (min_precedes(X38,X39,X40) -> precedes(X38,X39))) # label(sos_15) # label(axiom) # label(non_clause). [assumption]. 0.91/1.22 36 (all X161 all X162 (-leaf_occ(X161,X162) & arboreal(X161) & subactivity_occurrence(X161,X162) & occurrence_of(X162,tptp0) -> (exists X163 exists X164 exists X165 (next_subocc(X161,X163,tptp0) & occurrence_of(X164,tptp4) & next_subocc(X164,X165,tptp0) & leaf(X165,tptp0) & (occurrence_of(X165,tptp1) | occurrence_of(X165,tptp2)) & next_subocc(X163,X164,tptp0) & occurrence_of(X163,tptp3))))) # label(sos_49) # label(axiom) # label(non_clause). [assumption]. 0.91/1.22 37 (all X4 all X5 all X6 (occurrence_of(X4,X6) & occurrence_of(X4,X5) -> X6 = X5)) # label(sos_02) # label(axiom) # label(non_clause). [assumption]. 0.91/1.22 38 (all X156 all X157 all X158 all X159 all X160 (occurrence_of(X157,X156) & root_occ(X159,X157) & X160 != X158 & min_precedes(X159,X158,X156) & subactivity_occurrence(X158,X157) & leaf_occ(X160,X157) -> min_precedes(X158,X160,X156))) # label(sos_48) # label(axiom) # label(non_clause). [assumption]. 0.91/1.22 39 (all X151 all X152 all X153 all X154 all X155 (leaf_occ(X155,X152) & min_precedes(X153,X155,X151) & X153 != X154 & subactivity_occurrence(X153,X152) & root_occ(X154,X152) & occurrence_of(X152,X151) -> min_precedes(X154,X153,X151))) # label(sos_47) # label(axiom) # label(non_clause). [assumption]. 0.91/1.22 40 (all X35 all X36 all X37 (min_precedes(X35,X36,X37) -> -root(X36,X37))) # label(sos_14) # label(axiom) # label(non_clause). [assumption]. 0.91/1.22 41 (all X87 all X88 all X89 all X90 (occurrence_of(X89,X87) & subactivity_occurrence(X89,X90) & -atomic(X87) & occurrence_of(X90,X88) -> subactivity(X87,X88))) # label(sos_30) # label(axiom) # label(non_clause). [assumption]. 0.91/1.22 42 (all X73 all X74 (root(X74,X73) & -atomic(X73) -> (exists X75 (occurrence_of(X75,X73) & subactivity_occurrence(X74,X75))))) # label(sos_26) # label(axiom) # label(non_clause). [assumption]. 0.91/1.22 43 (all X117 all X118 all X119 (occurrence_of(X117,X119) & root_occ(X118,X117) -> -(exists X120 min_precedes(X120,X118,X119)))) # label(sos_38) # label(axiom) # label(non_clause). [assumption]. 0.91/1.22 44 (all X41 all X42 (root(X41,X42) -> legal(X41))) # label(sos_16) # label(axiom) # label(non_clause). [assumption]. 0.91/1.22 45 (all X43 all X44 (legal(X43) & atocc(X43,X44) -> root(X43,X44))) # label(sos_17) # label(axiom) # label(non_clause). [assumption]. 0.91/1.22 46 (all X67 all X68 (subactivity_occurrence(X67,X68) -> activity_occurrence(X67) & activity_occurrence(X68))) # label(sos_24) # label(axiom) # label(non_clause). [assumption]. 0.91/1.22 47 (all X16 all X17 (occurrence_of(X16,X17) -> (arboreal(X16) <-> atomic(X17)))) # label(sos_07) # label(axiom) # label(non_clause). [assumption]. 0.91/1.22 48 (all X91 all X92 all X93 (subactivity_occurrence(X92,X93) & subactivity_occurrence(X91,X92) -> subactivity_occurrence(X91,X93))) # label(sos_31) # label(axiom) # label(non_clause). [assumption]. 0.91/1.22 49 (all X2 (activity_occurrence(X2) -> (exists X3 (activity(X3) & occurrence_of(X2,X3))))) # label(sos_01) # label(axiom) # label(non_clause). [assumption]. 0.91/1.22 50 (all X0 all X1 (occurrence_of(X1,X0) -> activity(X0) & activity_occurrence(X1))) # label(sos) # label(axiom) # label(non_clause). [assumption]. 0.91/1.22 51 -(all X166 all X167 (occurrence_of(X167,tptp0) & arboreal(X166) & -leaf_occ(X166,X167) & subactivity_occurrence(X166,X167) -> (exists X168 exists X169 (occurrence_of(X168,tptp3) & leaf(X169,tptp0) & min_precedes(X168,X169,tptp0) & (occurrence_of(X169,tptp1) | occurrence_of(X169,tptp2)) & next_subocc(X166,X168,tptp0))))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption]. 0.91/1.22 0.91/1.22 ============================== end of process non-clausal formulas === 0.91/1.22 0.91/1.22 ============================== PROCESS INITIAL CLAUSES =============== 0.91/1.22 0.91/1.22 ============================== PREDICATE ELIMINATION ================= 0.91/1.22 52 leaf(A,B) | -root(A,B) | min_precedes(A,f5(A,B),B) # label(sos_21) # label(axiom). [clausify(13)]. 0.91/1.22 53 -occurrence_of(A,B) | atomic(B) | root(f3(B,A),B) # label(sos_27) # label(axiom). [clausify(6)]. 0.91/1.22 54 -leaf(A,B) | root(A,B) | min_precedes(f4(A,B),A,B) # label(sos_21) # label(axiom). [clausify(13)]. 0.91/1.22 Derived: leaf(f3(A,B),A) | min_precedes(f3(A,B),f5(f3(A,B),A),A) | -occurrence_of(B,A) | atomic(A). [resolve(52,b,53,c)]. 0.91/1.22 55 -root(A,B) | -subactivity_occurrence(A,C) | -occurrence_of(C,B) | root_occ(A,C) # label(sos_33) # label(axiom). [clausify(27)]. 0.91/1.22 Derived: -subactivity_occurrence(f3(A,B),C) | -occurrence_of(C,A) | root_occ(f3(A,B),C) | -occurrence_of(B,A) | atomic(A). [resolve(55,a,53,c)]. 0.91/1.22 Derived: -subactivity_occurrence(A,B) | -occurrence_of(B,C) | root_occ(A,B) | -leaf(A,C) | min_precedes(f4(A,C),A,C). [resolve(55,a,54,b)]. 0.91/1.22 56 root(A,f10(A,B)) | -root_occ(A,B) # label(sos_33) # label(axiom). [clausify(27)]. 0.91/1.22 Derived: -root_occ(A,B) | leaf(A,f10(A,B)) | min_precedes(A,f5(A,f10(A,B)),f10(A,B)). [resolve(56,a,52,b)]. 0.91/1.22 Derived: -root_occ(A,B) | -subactivity_occurrence(A,C) | -occurrence_of(C,f10(A,B)) | root_occ(A,C). [resolve(56,a,55,a)]. 0.91/1.22 57 -min_precedes(A,B,C) | root(f13(A,B,C),C) # label(sos_13) # label(axiom). [clausify(30)]. 0.91/1.22 Derived: -min_precedes(A,B,C) | leaf(f13(A,B,C),C) | min_precedes(f13(A,B,C),f5(f13(A,B,C),C),C). [resolve(57,b,52,b)]. 0.91/1.22 Derived: -min_precedes(A,B,C) | -subactivity_occurrence(f13(A,B,C),D) | -occurrence_of(D,C) | root_occ(f13(A,B,C),D). [resolve(57,b,55,a)]. 0.91/1.22 58 -root(A,B) | atocc(A,f14(B,A)) # label(sos_12) # label(axiom). [clausify(32)]. 0.91/1.22 Derived: atocc(f3(A,B),f14(A,f3(A,B))) | -occurrence_of(B,A) | atomic(A). [resolve(58,a,53,c)]. 0.91/1.22 Derived: atocc(A,f14(B,A)) | -leaf(A,B) | min_precedes(f4(A,B),A,B). [resolve(58,a,54,b)]. 0.91/1.22 Derived: atocc(A,f14(f10(A,B),A)) | -root_occ(A,B). [resolve(58,a,56,a)]. 0.91/1.22 Derived: atocc(f13(A,B,C),f14(C,f13(A,B,C))) | -min_precedes(A,B,C). [resolve(58,a,57,b)]. 0.91/1.22 59 -root(A,B) | subactivity(f14(B,A),B) # label(sos_12) # label(axiom). [clausify(32)]. 0.91/1.22 Derived: subactivity(f14(A,f3(A,B)),A) | -occurrence_of(B,A) | atomic(A). [resolve(59,a,53,c)]. 0.91/1.22 Derived: subactivity(f14(A,B),A) | -leaf(B,A) | min_precedes(f4(B,A),B,A). [resolve(59,a,54,b)]. 0.91/1.22 Derived: subactivity(f14(f10(A,B),A),f10(A,B)) | -root_occ(A,B). [resolve(59,a,56,a)]. 0.91/1.22 Derived: subactivity(f14(A,f13(B,C,A)),A) | -min_precedes(B,C,A). [resolve(59,a,57,b)]. 0.91/1.22 60 -min_precedes(A,B,C) | -root(B,C) # label(sos_14) # label(axiom). [clausify(40)]. 0.91/1.22 Derived: -min_precedes(A,f3(B,C),B) | -occurrence_of(C,B) | atomic(B). [resolve(60,b,53,c)]. 0.91/1.22 Derived: -min_precedes(A,B,C) | -leaf(B,C) | min_precedes(f4(B,C),B,C). [resolve(60,b,54,b)]. 0.91/1.22 Derived: -min_precedes(A,B,f10(B,C)) | -root_occ(B,C). [resolve(60,b,56,a)]. 0.91/1.22 Derived: -min_precedes(A,f13(B,C,D),D) | -min_precedes(B,C,D). [resolve(60,b,57,b)]. 0.91/1.22 61 -root(A,B) | atomic(B) | occurrence_of(f18(B,A),B) # label(sos_26) # label(axiom). [clausify(42)]. 0.91/1.22 Derived: atomic(A) | occurrence_of(f18(A,f3(A,B)),A) | -occurrence_of(B,A) | atomic(A). [resolve(61,a,53,c)]. 0.91/1.22 Derived: atomic(A) | occurrence_of(f18(A,B),A) | -leaf(B,A) | min_precedes(f4(B,A),B,A). [resolve(61,a,54,b)]. 0.91/1.22 Derived: atomic(f10(A,B)) | occurrence_of(f18(f10(A,B),A),f10(A,B)) | -root_occ(A,B). [resolve(61,a,56,a)]. 0.91/1.22 Derived: atomic(A) | occurrence_of(f18(A,f13(B,C,A)),A) | -min_precedes(B,C,A). [resolve(61,a,57,b)]. 0.91/1.22 62 -root(A,B) | atomic(B) | subactivity_occurrence(A,f18(B,A)) # label(sos_26) # label(axiom). [clausify(42)]. 0.91/1.22 Derived: atomic(A) | subactivity_occurrence(f3(A,B),f18(A,f3(A,B))) | -occurrence_of(B,A) | atomic(A). [resolve(62,a,53,c)]. 0.91/1.22 Derived: atomic(A) | subactivity_occurrence(B,f18(A,B)) | -leaf(B,A) | min_precedes(f4(B,A),B,A). [resolve(62,a,54,b)]. 0.91/1.22 Derived: atomic(f10(A,B)) | subactivity_occurrence(A,f18(f10(A,B),A)) | -root_occ(A,B). [resolve(62,a,56,a)]. 0.91/1.22 Derived: atomic(A) | subactivity_occurrence(f13(B,C,A),f18(A,f13(B,C,A))) | -min_precedes(B,C,A). [resolve(62,a,57,b)]. 0.91/1.22 63 -root(A,B) | legal(A) # label(sos_16) # label(axiom). [clausify(44)]. 0.91/1.22 Derived: legal(f3(A,B)) | -occurrence_of(B,A) | atomic(A). [resolve(63,a,53,c)]. 0.91/1.22 Derived: legal(A) | -leaf(A,B) | min_precedes(f4(A,B),A,B). [resolve(63,a,54,b)]. 0.91/1.22 Derived: legal(A) | -root_occ(A,B). [resolve(63,a,56,a)]. 0.91/1.22 Derived: legal(f13(A,B,C)) | -min_precedes(A,B,C). [resolve(63,a,57,b)]. 0.91/1.22 64 -legal(A) | -atocc(A,B) | root(A,B) # label(sos_17) # label(axiom). [clausify(45)]. 0.91/1.22 Derived: -legal(A) | -atocc(A,B) | leaf(A,B) | min_precedes(A,f5(A,B),B). [resolve(64,c,52,b)]. 0.91/1.22 Derived: -legal(A) | -atocc(A,B) | -subactivity_occurrence(A,C) | -occurrence_of(C,B) | root_occ(A,C). [resolve(64,c,55,a)]. 0.91/1.22 Derived: -legal(A) | -atocc(A,B) | atocc(A,f14(B,A)). [resolve(64,c,58,a)]. 0.91/1.22 Derived: -legal(A) | -atocc(A,B) | subactivity(f14(B,A),B). [resolve(64,c,59,a)]. 0.91/1.22 Derived: -legal(A) | -atocc(A,B) | -min_precedes(C,A,B). [resolve(64,c,60,b)]. 0.91/1.22 Derived: -legal(A) | -atocc(A,B) | atomic(B) | occurrence_of(f18(B,A),B). [resolve(64,c,61,a)]. 0.91/1.22 Derived: -legal(A) | -atocc(A,B) | atomic(B) | subactivity_occurrence(A,f18(B,A)). [resolve(64,c,62,a)]. 0.91/1.22 65 -activity(A) | subactivity(A,A) # label(sos_03) # label(axiom). [clausify(23)]. 0.91/1.22 66 activity(tptp0) # label(sos_50) # label(axiom). [assumption]. 0.91/1.22 Derived: subactivity(tptp0,tptp0). [resolve(65,a,66,a)]. 0.91/1.22 67 -activity_occurrence(A) | activity(f19(A)) # label(sos_01) # label(axiom). [clausify(49)]. 0.91/1.22 Derived: -activity_occurrence(A) | subactivity(f19(A),f19(A)). [resolve(67,b,65,a)]. 0.91/1.22 68 -occurrence_of(A,B) | activity(B) # label(sos) # label(axiom). [clausify(50)]. 0.91/1.22 Derived: -occurrence_of(A,B) | subactivity(B,B). [resolve(68,b,65,a)]. 0.91/1.22 69 earlier(A,B) | -precedes(A,B) # label(sos_10) # label(axiom). [clausify(11)]. 0.91/1.22 70 -earlier(A,B) | -legal(B) | precedes(A,B) # label(sos_10) # label(axiom). [clausify(11)]. 0.91/1.22 71 legal(A) | -precedes(B,A) # label(sos_10) # label(axiom). [clausify(11)]. 0.91/1.22 72 -min_precedes(A,B,C) | -min_precedes(D,B,C) | -precedes(A,D) | min_precedes(A,D,C) # label(sos_20) # label(axiom). [clausify(21)]. 0.91/1.22 Derived: -min_precedes(A,B,C) | -min_precedes(D,B,C) | min_precedes(A,D,C) | -earlier(A,D) | -legal(D). [resolve(72,c,70,c)]. 0.91/1.22 73 -min_precedes(A,B,C) | -min_precedes(A,D,C) | -precedes(B,D) | min_precedes(B,D,C) # label(sos_18) # label(axiom). [clausify(24)]. 0.91/1.22 Derived: -min_precedes(A,B,C) | -min_precedes(A,D,C) | min_precedes(B,D,C) | -earlier(B,D) | -legal(D). [resolve(73,c,70,c)]. 0.91/1.22 74 -min_precedes(A,B,C) | precedes(A,B) # label(sos_15) # label(axiom). [clausify(35)]. 0.91/1.22 Derived: -min_precedes(A,B,C) | earlier(A,B). [resolve(74,b,69,b)]. 0.91/1.22 Derived: -min_precedes(A,B,C) | legal(B). [resolve(74,b,71,b)]. 0.91/1.22 Derived: -min_precedes(A,B,C) | -min_precedes(A,D,E) | -min_precedes(B,D,E) | min_precedes(A,B,E). [resolve(74,b,72,c)]. 0.91/1.22 Derived: -min_precedes(A,B,C) | -min_precedes(D,A,E) | -min_precedes(D,B,E) | min_precedes(A,B,E). [resolve(74,b,73,c)]. 0.91/1.22 75 atocc(A,B) | -subactivity(B,C) | -atomic(C) | -occurrence_of(A,C) # label(sos_23) # label(axiom). [clausify(28)]. 0.91/1.22 76 -min_precedes(A,B,C) | subactivity(f8(C,A,B),C) # label(sos_11) # label(axiom). [clausify(20)]. 0.91/1.22 77 -min_precedes(A,B,C) | subactivity(f9(C,A,B),C) # label(sos_11) # label(axiom). [clausify(20)]. 0.91/1.22 78 -atocc(A,B) | subactivity(B,f11(A,B)) # label(sos_23) # label(axiom). [clausify(28)]. 0.91/1.22 Derived: atocc(A,f8(B,C,D)) | -atomic(B) | -occurrence_of(A,B) | -min_precedes(C,D,B). [resolve(75,b,76,b)]. 0.91/1.22 Derived: atocc(A,f9(B,C,D)) | -atomic(B) | -occurrence_of(A,B) | -min_precedes(C,D,B). [resolve(75,b,77,b)]. 0.91/1.22 Derived: atocc(A,B) | -atomic(f11(C,B)) | -occurrence_of(A,f11(C,B)) | -atocc(C,B). [resolve(75,b,78,b)]. 0.91/1.22 79 -occurrence_of(A,B) | -occurrence_of(C,D) | subactivity_occurrence(A,C) | -subactivity(B,D) | subactivity_occurrence(f12(B,D,A,C),C) # label(sos_32) # label(axiom). [clausify(29)]. 0.91/1.22 Derived: -occurrence_of(A,f8(B,C,D)) | -occurrence_of(E,B) | subactivity_occurrence(A,E) | subactivity_occurrence(f12(f8(B,C,D),B,A,E),E) | -min_precedes(C,D,B). [resolve(79,d,76,b)]. 0.91/1.22 Derived: -occurrence_of(A,f9(B,C,D)) | -occurrence_of(E,B) | subactivity_occurrence(A,E) | subactivity_occurrence(f12(f9(B,C,D),B,A,E),E) | -min_precedes(C,D,B). [resolve(79,d,77,b)]. 0.91/1.22 Derived: -occurrence_of(A,B) | -occurrence_of(C,f11(D,B)) | subactivity_occurrence(A,C) | subactivity_occurrence(f12(B,f11(D,B),A,C),C) | -atocc(D,B). [resolve(79,d,78,b)]. 0.91/1.22 80 -occurrence_of(A,B) | -occurrence_of(C,D) | subactivity_occurrence(A,C) | -subactivity(B,D) | -subactivity_occurrence(f12(B,D,A,C),A) # label(sos_32) # label(axiom). [clausify(29)]. 0.91/1.22 Derived: -occurrence_of(A,f8(B,C,D)) | -occurrence_of(E,B) | subactivity_occurrence(A,E) | -subactivity_occurrence(f12(f8(B,C,D),B,A,E),A) | -min_precedes(C,D,B). [resolve(80,d,76,b)]. 0.91/1.22 Derived: -occurrence_of(A,f9(B,C,D)) | -occurrence_of(E,B) | subactivity_occurrence(A,E) | -subactivity_occurrence(f12(f9(B,C,D),B,A,E),A) | -min_precedes(C,D,B). [resolve(80,d,77,b)]. 0.91/1.22 Derived: -occurrence_of(A,B) | -occurrence_of(C,f11(D,B)) | subactivity_occurrence(A,C) | -subactivity_occurrence(f12(B,f11(D,B),A,C),A) | -atocc(D,B). [resolve(80,d,78,b)]. 0.91/1.22 81 -occurrence_of(A,B) | -subactivity_occurrence(A,C) | atomic(B) | -occurrence_of(C,D) | subactivity(B,D) # label(sos_30) # label(axiom). [clausify(41)]. 0.91/1.22 Derived: -occurrence_of(A,B) | -subactivity_occurrence(A,C) | atomic(B) | -occurrence_of(C,D) | atocc(E,B) | -atomic(D) | -occurrence_of(E,D). [resolve(81,e,75,b)]. 0.91/1.22 Derived: -occurrence_of(A,B) | -subactivity_occurrence(A,C) | atomic(B) | -occurrence_of(C,D) | -occurrence_of(E,B) | -occurrence_of(F,D) | subactivity_occurrence(E,F) | subactivity_occurrence(f12(B,D,E,F),F). [resolve(81,e,79,d)]. 0.91/1.22 Derived: -occurrence_of(A,B) | -subactivity_occurrence(A,C) | atomic(B) | -occurrence_of(C,D) | -occurrence_of(E,B) | -occurrence_of(F,D) | subactivity_occurrence(E,F) | -subactivity_occurrence(f12(B,D,E,F),E). [resolve(81,e,80,d)]. 0.91/1.22 82 subactivity(f14(A,f3(A,B)),A) | -occurrence_of(B,A) | atomic(A). [resolve(59,a,53,c)]. 0.91/1.22 Derived: -occurrence_of(A,B) | atomic(B) | -occurrence_of(C,f14(B,f3(B,A))) | -occurrence_of(D,B) | subactivity_occurrence(C,D) | subactivity_occurrence(f12(f14(B,f3(B,A)),B,C,D),D). [resolve(82,a,79,d)]. 0.91/1.22 Derived: -occurrence_of(A,B) | atomic(B) | -occurrence_of(C,f14(B,f3(B,A))) | -occurrence_of(D,B) | subactivity_occurrence(C,D) | -subactivity_occurrence(f12(f14(B,f3(B,A)),B,C,D),C). [resolve(82,a,80,d)]. 0.91/1.22 83 subactivity(f14(A,B),A) | -leaf(B,A) | min_precedes(f4(B,A),B,A). [resolve(59,a,54,b)]. 0.91/1.22 Derived: -leaf(A,B) | min_precedes(f4(A,B),A,B) | atocc(C,f14(B,A)) | -atomic(B) | -occurrence_of(C,B). [resolve(83,a,75,b)]. 0.91/1.22 Derived: -leaf(A,B) | min_precedes(f4(A,B),A,B) | -occurrence_of(C,f14(B,A)) | -occurrence_of(D,B) | subactivity_occurrence(C,D) | subactivity_occurrence(f12(f14(B,A),B,C,D),D). [resolve(83,a,79,d)]. 0.91/1.22 Derived: -leaf(A,B) | min_precedes(f4(A,B),A,B) | -occurrence_of(C,f14(B,A)) | -occurrence_of(D,B) | subactivity_occurrence(C,D) | -subactivity_occurrence(f12(f14(B,A),B,C,D),C). [resolve(83,a,80,d)]. 0.91/1.22 84 subactivity(f14(f10(A,B),A),f10(A,B)) | -root_occ(A,B). [resolve(59,a,56,a)]. 0.91/1.22 Derived: -root_occ(A,B) | atocc(C,f14(f10(A,B),A)) | -atomic(f10(A,B)) | -occurrence_of(C,f10(A,B)). [resolve(84,a,75,b)]. 0.91/1.22 Derived: -root_occ(A,B) | -occurrence_of(C,f14(f10(A,B),A)) | -occurrence_of(D,f10(A,B)) | subactivity_occurrence(C,D) | subactivity_occurrence(f12(f14(f10(A,B),A),f10(A,B),C,D),D). [resolve(84,a,79,d)]. 0.91/1.22 Derived: -root_occ(A,B) | -occurrence_of(C,f14(f10(A,B),A)) | -occurrence_of(D,f10(A,B)) | subactivity_occurrence(C,D) | -subactivity_occurrence(f12(f14(f10(A,B),A),f10(A,B),C,D),C). [resolve(84,a,80,d)]. 0.91/1.22 85 subactivity(f14(A,f13(B,C,A)),A) | -min_precedes(B,C,A). [resolve(59,a,57,b)]. 0.91/1.22 Derived: -min_precedes(A,B,C) | atocc(D,f14(C,f13(A,B,C))) | -atomic(C) | -occurrence_of(D,C). [resolve(85,a,75,b)]. 0.91/1.22 Derived: -min_precedes(A,B,C) | -occurrence_of(D,f14(C,f13(A,B,C))) | -occurrence_of(E,C) | subactivity_occurrence(D,E) | subactivity_occurrence(f12(f14(C,f13(A,B,C)),C,D,E),E). [resolve(85,a,79,d)]. 0.91/1.23 Derived: -min_precedes(A,B,C) | -occurrence_of(D,f14(C,f13(A,B,C))) | -occurrence_of(E,C) | subactivity_occurrence(D,E) | -subactivity_occurrence(f12(f14(C,f13(A,B,C)),C,D,E),D). [resolve(85,a,80,d)]. 0.91/1.23 86 -legal(A) | -atocc(A,B) | subactivity(f14(B,A),B). [resolve(64,c,59,a)]. 0.91/1.23 Derived: -legal(A) | -atocc(A,B) | atocc(C,f14(B,A)) | -atomic(B) | -occurrence_of(C,B). [resolve(86,c,75,b)]. 0.91/1.23 Derived: -legal(A) | -atocc(A,B) | -occurrence_of(C,f14(B,A)) | -occurrence_of(D,B) | subactivity_occurrence(C,D) | subactivity_occurrence(f12(f14(B,A),B,C,D),D). [resolve(86,c,79,d)]. 0.91/1.23 Derived: -legal(A) | -atocc(A,B) | -occurrence_of(C,f14(B,A)) | -occurrence_of(D,B) | subactivity_occurrence(C,D) | -subactivity_occurrence(f12(f14(B,A),B,C,D),C). [resolve(86,c,80,d)]. 0.91/1.23 87 subactivity(tptp0,tptp0). [resolve(65,a,66,a)]. 0.91/1.23 Derived: atocc(A,tptp0) | -atomic(tptp0) | -occurrence_of(A,tptp0). [resolve(87,a,75,b)]. 0.91/1.23 Derived: -occurrence_of(A,tptp0) | -occurrence_of(B,tptp0) | subactivity_occurrence(A,B) | subactivity_occurrence(f12(tptp0,tptp0,A,B),B). [resolve(87,a,79,d)]. 0.91/1.23 Derived: -occurrence_of(A,tptp0) | -occurrence_of(B,tptp0) | subactivity_occurrence(A,B) | -subactivity_occurrence(f12(tptp0,tptp0,A,B),A). [resolve(87,a,80,d)]. 0.91/1.23 88 -activity_occurrence(A) | subactivity(f19(A),f19(A)). [resolve(67,b,65,a)]. 0.91/1.23 Derived: -activity_occurrence(A) | atocc(B,f19(A)) | -atomic(f19(A)) | -occurrence_of(B,f19(A)). [resolve(88,b,75,b)]. 0.91/1.23 Derived: -activity_occurrence(A) | -occurrence_of(B,f19(A)) | -occurrence_of(C,f19(A)) | subactivity_occurrence(B,C) | subactivity_occurrence(f12(f19(A),f19(A),B,C),C). [resolve(88,b,79,d)]. 0.91/1.23 Derived: -activity_occurrence(A) | -occurrence_of(B,f19(A)) | -occurrence_of(C,f19(A)) | subactivity_occurrence(B,C) | -subactivity_occurrence(f12(f19(A),f19(A),B,C),B). [resolve(88,b,80,d)]. 0.91/1.23 89 -occurrence_of(A,B) | subactivity(B,B). [resolve(68,b,65,a)]. 0.91/1.23 Derived: -occurrence_of(A,B) | atocc(C,B) | -atomic(B) | -occurrence_of(C,B). [resolve(89,b,75,b)]. 0.91/1.23 Derived: -occurrence_of(A,B) | -occurrence_of(C,B) | -occurrence_of(D,B) | subactivity_occurrence(C,D) | subactivity_occurrence(f12(B,B,C,D),D). [resolve(89,b,79,d)]. 0.91/1.23 Derived: -occurrence_of(A,B) | -occurrence_of(C,B) | -occurrence_of(D,B) | subactivity_occurrence(C,D) | -subactivity_occurrence(f12(B,B,C,D),C). [resolve(89,b,80,d)]. 0.91/1.23 90 -activity_occurrence(A) | occurrence_of(A,f19(A)) # label(sos_01) # label(axiom). [clausify(49)]. 0.91/1.23 91 -subactivity_occurrence(A,B) | activity_occurrence(A) # label(sos_24) # label(axiom). [clausify(46)]. 0.91/1.23 92 -subactivity_occurrence(A,B) | activity_occurrence(B) # label(sos_24) # label(axiom). [clausify(46)]. 0.91/1.23 Derived: occurrence_of(A,f19(A)) | -subactivity_occurrence(A,B). [resolve(90,a,91,b)]. 0.91/1.23 Derived: occurrence_of(A,f19(A)) | -subactivity_occurrence(B,A). [resolve(90,a,92,b)]. 0.91/1.23 93 -occurrence_of(A,B) | activity_occurrence(A) # label(sos) # label(axiom). [clausify(50)]. 0.91/1.23 Derived: -occurrence_of(A,B) | occurrence_of(A,f19(A)). [resolve(93,b,90,a)]. 0.91/1.23 94 -activity_occurrence(A) | atocc(B,f19(A)) | -atomic(f19(A)) | -occurrence_of(B,f19(A)). [resolve(88,b,75,b)]. 0.91/1.23 95 -activity_occurrence(A) | -occurrence_of(B,f19(A)) | -occurrence_of(C,f19(A)) | subactivity_occurrence(B,C) | subactivity_occurrence(f12(f19(A),f19(A),B,C),C). [resolve(88,b,79,d)]. 0.91/1.23 96 -activity_occurrence(A) | -occurrence_of(B,f19(A)) | -occurrence_of(C,f19(A)) | subactivity_occurrence(B,C) | -subactivity_occurrence(f12(f19(A),f19(A),B,C),B). [resolve(88,b,80,d)]. 0.91/1.23 0.91/1.23 ============================== end predicate elimination ============= 0.91/1.23 0.91/1.23 Auto_denials: (non-Horn, no changes). 0.91/1.23 0.91/1.23 Term ordering decisions: 0.91/1.23 0.91/1.23 % Assigning unary symbol f19 kb_weight 0 and highest precedence (39). 0.91/1.23 Function symbol KB weights: tptp0=1. tptp1=1. tptp2=1. tptp3=1. tptp4=1. c1=1. c2=1. f1=1. f3=1. f4=1. f5=1. f7=1. f10=1. f11=1. f14=1. f15=1. f16=1. f17=1. f18=1. f2=1. f6=1. f8=1. f9=1. f13=1. f12=1. f19=0. 0.91/1.23 0.91/1.23 ============================== end of process initial clauses ======== 0.91/1.23 0.91/1.23 ============================== CLAUSES FOR SEARCH ==================== 2.94/3.22 2.94/3.22 ============================== end of clauses for search ============= 2.94/3.22 2.94/3.22 ============================== SEARCH ================================ 2.94/3.22 2.94/3.22 % Starting search at 0.02 seconds. 2.94/3.22 2.94/3.22 Low Water (keep): wt=64.000, iters=3880 2.94/3.22 2.94/3.22 Low Water (keep): wt=48.000, iters=3373 2.94/3.22 2.94/3.22 Low Water (keep): wt=45.000, iters=3404 2.94/3.22 2.94/3.22 Low Water (keep): wt=44.000, iters=3705 2.94/3.22 2.94/3.22 Low Water (keep): wt=41.000, iters=3424 2.94/3.22 2.94/3.22 Low Water (keep): wt=40.000, iters=3384 2.94/3.22 2.94/3.22 Low Water (keep): wt=39.000, iters=3422 2.94/3.22 2.94/3.22 Low Water (keep): wt=38.000, iters=3335 2.94/3.22 2.94/3.22 Low Water (keep): wt=37.000, iters=3395 2.94/3.22 2.94/3.22 Low Water (keep): wt=36.000, iters=3615 2.94/3.22 2.94/3.22 Low Water (keep): wt=35.000, iters=3838 2.94/3.22 2.94/3.22 Low Water (keep): wt=33.000, iters=3438 2.94/3.22 2.94/3.22 Low Water (keep): wt=32.000, iters=3663 2.94/3.22 2.94/3.22 Low Water (keep): wt=31.000, iters=3550 2.94/3.22 2.94/3.22 ============================== PROOF ================================= 2.94/3.22 % SZS status Theorem 2.94/3.22 % SZS output start Refutation 2.94/3.22 2.94/3.22 % Proof 1 at 1.98 (+ 0.03) seconds. 2.94/3.22 % Length of proof is 78. 2.94/3.22 % Level of proof is 14. 2.94/3.22 % Maximum clause weight is 27.000. 2.94/3.22 % Given clauses 2438. 2.94/3.22 2.94/3.22 4 (all X102 all X103 (leaf_occ(X102,X103) <-> (exists X104 (occurrence_of(X103,X104) & leaf(X102,X104) & subactivity_occurrence(X102,X103))))) # label(sos_34) # label(axiom) # label(non_clause). [assumption]. 2.94/3.22 8 (all X10 all X11 all X12 (earlier(X11,X12) & earlier(X10,X11) -> earlier(X10,X12))) # label(sos_05) # label(axiom) # label(non_clause). [assumption]. 2.94/3.22 11 (all X21 all X22 (earlier(X21,X22) & legal(X22) <-> precedes(X21,X22))) # label(sos_10) # label(axiom) # label(non_clause). [assumption]. 2.94/3.22 14 (all X83 all X84 all X85 all X86 (min_precedes(X83,X84,X85) & subactivity_occurrence(X84,X86) & occurrence_of(X86,X85) -> subactivity_occurrence(X83,X86))) # label(sos_29) # label(axiom) # label(non_clause). [assumption]. 2.94/3.22 16 (all X60 all X61 all X62 (next_subocc(X60,X61,X62) <-> min_precedes(X60,X61,X62) & -(exists X63 (min_precedes(X60,X63,X62) & min_precedes(X63,X61,X62))))) # label(sos_22) # label(axiom) # label(non_clause). [assumption]. 2.94/3.22 17 (all X8 all X9 (earlier(X8,X9) -> -earlier(X9,X8))) # label(sos_04) # label(axiom) # label(non_clause). [assumption]. 2.94/3.22 18 (all X145 all X146 (-atomic(X146) & leaf(X145,X146) -> (exists X147 (occurrence_of(X147,X146) & leaf_occ(X145,X147))))) # label(sos_45) # label(axiom) # label(non_clause). [assumption]. 2.94/3.22 24 (all X45 all X46 all X47 all X48 (min_precedes(X45,X46,X48) & min_precedes(X45,X47,X48) & precedes(X46,X47) -> min_precedes(X46,X47,X48))) # label(sos_18) # label(axiom) # label(non_clause). [assumption]. 2.94/3.22 31 (all X138 all X139 all X140 all X141 (occurrence_of(X139,X138) & subactivity_occurrence(X140,X139) & leaf_occ(X141,X139) & -min_precedes(X140,X141,X138) & arboreal(X140) -> X140 = X141)) # label(sos_43) # label(axiom) # label(non_clause). [assumption]. 2.94/3.22 35 (all X38 all X39 all X40 (min_precedes(X38,X39,X40) -> precedes(X38,X39))) # label(sos_15) # label(axiom) # label(non_clause). [assumption]. 2.94/3.22 36 (all X161 all X162 (-leaf_occ(X161,X162) & arboreal(X161) & subactivity_occurrence(X161,X162) & occurrence_of(X162,tptp0) -> (exists X163 exists X164 exists X165 (next_subocc(X161,X163,tptp0) & occurrence_of(X164,tptp4) & next_subocc(X164,X165,tptp0) & leaf(X165,tptp0) & (occurrence_of(X165,tptp1) | occurrence_of(X165,tptp2)) & next_subocc(X163,X164,tptp0) & occurrence_of(X163,tptp3))))) # label(sos_49) # label(axiom) # label(non_clause). [assumption]. 2.94/3.22 51 -(all X166 all X167 (occurrence_of(X167,tptp0) & arboreal(X166) & -leaf_occ(X166,X167) & subactivity_occurrence(X166,X167) -> (exists X168 exists X169 (occurrence_of(X168,tptp3) & leaf(X169,tptp0) & min_precedes(X168,X169,tptp0) & (occurrence_of(X169,tptp1) | occurrence_of(X169,tptp2)) & next_subocc(X166,X168,tptp0))))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption]. 2.94/3.22 69 earlier(A,B) | -precedes(A,B) # label(sos_10) # label(axiom). [clausify(11)]. 2.94/3.22 70 -earlier(A,B) | -legal(B) | precedes(A,B) # label(sos_10) # label(axiom). [clausify(11)]. 2.94/3.22 71 legal(A) | -precedes(B,A) # label(sos_10) # label(axiom). [clausify(11)]. 2.94/3.22 73 -min_precedes(A,B,C) | -min_precedes(A,D,C) | -precedes(B,D) | min_precedes(B,D,C) # label(sos_18) # label(axiom). [clausify(24)]. 2.94/3.22 74 -min_precedes(A,B,C) | precedes(A,B) # label(sos_15) # label(axiom). [clausify(35)]. 2.94/3.22 104 -leaf_occ(A,B) | subactivity_occurrence(A,B) # label(sos_34) # label(axiom). [clausify(4)]. 2.94/3.22 109 -atomic(tptp0) # label(sos_51) # label(axiom). [assumption]. 2.94/3.22 114 -earlier(A,B) | -earlier(C,A) | earlier(C,B) # label(sos_05) # label(axiom). [clausify(8)]. 2.94/3.22 122 -min_precedes(A,B,C) | -subactivity_occurrence(B,D) | -occurrence_of(D,C) | subactivity_occurrence(A,D) # label(sos_29) # label(axiom). [clausify(14)]. 2.94/3.22 124 -next_subocc(A,B,C) | min_precedes(A,B,C) # label(sos_22) # label(axiom). [clausify(16)]. 2.94/3.22 128 -earlier(A,B) | -earlier(B,A) # label(sos_04) # label(axiom). [clausify(17)]. 2.94/3.22 129 atomic(A) | -leaf(B,A) | occurrence_of(f7(B,A),A) # label(sos_45) # label(axiom). [clausify(18)]. 2.94/3.22 130 atomic(A) | -leaf(B,A) | leaf_occ(B,f7(B,A)) # label(sos_45) # label(axiom). [clausify(18)]. 2.94/3.22 148 -occurrence_of(A,B) | -subactivity_occurrence(C,A) | -leaf_occ(D,A) | min_precedes(C,D,B) | -arboreal(C) | D = C # label(sos_43) # label(axiom). [clausify(31)]. 2.94/3.22 151 leaf_occ(A,B) | -arboreal(A) | -subactivity_occurrence(A,B) | -occurrence_of(B,tptp0) | next_subocc(A,f15(A,B),tptp0) # label(sos_49) # label(axiom). [clausify(36)]. 2.94/3.22 153 leaf_occ(A,B) | -arboreal(A) | -subactivity_occurrence(A,B) | -occurrence_of(B,tptp0) | next_subocc(f16(A,B),f17(A,B),tptp0) # label(sos_49) # label(axiom). [clausify(36)]. 2.94/3.22 154 leaf_occ(A,B) | -arboreal(A) | -subactivity_occurrence(A,B) | -occurrence_of(B,tptp0) | leaf(f17(A,B),tptp0) # label(sos_49) # label(axiom). [clausify(36)]. 2.94/3.22 155 leaf_occ(A,B) | -arboreal(A) | -subactivity_occurrence(A,B) | -occurrence_of(B,tptp0) | occurrence_of(f17(A,B),tptp1) | occurrence_of(f17(A,B),tptp2) # label(sos_49) # label(axiom). [clausify(36)]. 2.94/3.22 156 leaf_occ(A,B) | -arboreal(A) | -subactivity_occurrence(A,B) | -occurrence_of(B,tptp0) | next_subocc(f15(A,B),f16(A,B),tptp0) # label(sos_49) # label(axiom). [clausify(36)]. 2.94/3.22 157 leaf_occ(A,B) | -arboreal(A) | -subactivity_occurrence(A,B) | -occurrence_of(B,tptp0) | occurrence_of(f15(A,B),tptp3) # label(sos_49) # label(axiom). [clausify(36)]. 2.94/3.22 168 occurrence_of(c2,tptp0) # label(goals) # label(negated_conjecture). [clausify(51)]. 2.94/3.22 169 arboreal(c1) # label(goals) # label(negated_conjecture). [clausify(51)]. 2.94/3.22 170 -leaf_occ(c1,c2) # label(goals) # label(negated_conjecture). [clausify(51)]. 2.94/3.22 171 subactivity_occurrence(c1,c2) # label(goals) # label(negated_conjecture). [clausify(51)]. 2.94/3.22 172 -occurrence_of(A,tptp3) | -leaf(B,tptp0) | -min_precedes(A,B,tptp0) | -occurrence_of(B,tptp1) | -next_subocc(c1,A,tptp0) # label(goals) # label(negated_conjecture). [clausify(51)]. 2.94/3.22 173 -occurrence_of(A,tptp3) | -leaf(B,tptp0) | -min_precedes(A,B,tptp0) | -occurrence_of(B,tptp2) | -next_subocc(c1,A,tptp0) # label(goals) # label(negated_conjecture). [clausify(51)]. 2.94/3.22 210 -min_precedes(A,B,C) | -min_precedes(A,D,C) | min_precedes(B,D,C) | -earlier(B,D) | -legal(D). [resolve(73,c,70,c)]. 2.94/3.22 211 -min_precedes(A,B,C) | earlier(A,B). [resolve(74,b,69,b)]. 2.94/3.22 212 -min_precedes(A,B,C) | legal(B). [resolve(74,b,71,b)]. 2.94/3.22 272 occurrence_of(f15(c1,c2),tptp3). [resolve(171,a,157,c),unit_del(a,170),unit_del(b,169),unit_del(c,168)]. 2.94/3.22 273 next_subocc(f15(c1,c2),f16(c1,c2),tptp0). [resolve(171,a,156,c),unit_del(a,170),unit_del(b,169),unit_del(c,168)]. 2.94/3.22 274 occurrence_of(f17(c1,c2),tptp1) | occurrence_of(f17(c1,c2),tptp2). [resolve(171,a,155,c),unit_del(a,170),unit_del(b,169),unit_del(c,168)]. 2.94/3.22 275 leaf(f17(c1,c2),tptp0). [resolve(171,a,154,c),unit_del(a,170),unit_del(b,169),unit_del(c,168)]. 2.94/3.22 276 next_subocc(f16(c1,c2),f17(c1,c2),tptp0). [resolve(171,a,153,c),unit_del(a,170),unit_del(b,169),unit_del(c,168)]. 2.94/3.22 278 next_subocc(c1,f15(c1,c2),tptp0). [resolve(171,a,151,c),unit_del(a,170),unit_del(b,169),unit_del(c,168)]. 2.94/3.22 379 leaf_occ(f17(c1,c2),f7(f17(c1,c2),tptp0)). [resolve(275,a,130,b),unit_del(a,109)]. 2.94/3.22 380 occurrence_of(f7(f17(c1,c2),tptp0),tptp0). [resolve(275,a,129,b),unit_del(a,109)]. 2.94/3.22 414 min_precedes(f15(c1,c2),f16(c1,c2),tptp0). [resolve(273,a,124,a)]. 2.94/3.22 428 -leaf(A,tptp0) | -min_precedes(f15(c1,c2),A,tptp0) | -occurrence_of(A,tptp2). [resolve(278,a,173,e),unit_del(a,272)]. 2.94/3.22 429 -leaf(A,tptp0) | -min_precedes(f15(c1,c2),A,tptp0) | -occurrence_of(A,tptp1). [resolve(278,a,172,e),unit_del(a,272)]. 2.94/3.22 432 min_precedes(c1,f15(c1,c2),tptp0). [resolve(278,a,124,a)]. 2.94/3.22 462 earlier(c1,f15(c1,c2)). [resolve(432,a,211,a)]. 2.94/3.22 464 -min_precedes(c1,A,tptp0) | min_precedes(f15(c1,c2),A,tptp0) | -earlier(f15(c1,c2),A) | -legal(A). [resolve(432,a,210,a)]. 2.94/3.22 481 -subactivity_occurrence(f15(c1,c2),A) | -occurrence_of(A,tptp0) | subactivity_occurrence(c1,A). [resolve(432,a,122,a)]. 2.94/3.22 509 min_precedes(f16(c1,c2),f17(c1,c2),tptp0). [resolve(276,a,124,a)]. 2.94/3.22 718 earlier(f15(c1,c2),f16(c1,c2)). [resolve(414,a,211,a)]. 2.94/3.22 736 -subactivity_occurrence(f16(c1,c2),A) | -occurrence_of(A,tptp0) | subactivity_occurrence(f15(c1,c2),A). [resolve(414,a,122,a)]. 2.94/3.22 752 -earlier(f16(c1,c2),A) | earlier(f15(c1,c2),A). [resolve(718,a,114,b)]. 2.94/3.22 844 legal(f17(c1,c2)). [resolve(509,a,212,a)]. 2.94/3.22 845 earlier(f16(c1,c2),f17(c1,c2)). [resolve(509,a,211,a)]. 2.94/3.22 863 -subactivity_occurrence(f17(c1,c2),A) | -occurrence_of(A,tptp0) | subactivity_occurrence(f16(c1,c2),A). [resolve(509,a,122,a)]. 2.94/3.22 908 -occurrence_of(f7(f17(c1,c2),tptp0),A) | -subactivity_occurrence(B,f7(f17(c1,c2),tptp0)) | min_precedes(B,f17(c1,c2),A) | -arboreal(B) | f17(c1,c2) = B. [resolve(379,a,148,c)]. 2.94/3.22 911 subactivity_occurrence(f17(c1,c2),f7(f17(c1,c2),tptp0)). [resolve(379,a,104,a)]. 2.94/3.22 1203 earlier(f15(c1,c2),f17(c1,c2)). [resolve(752,a,845,a)]. 2.94/3.22 1205 -earlier(f17(c1,c2),f15(c1,c2)). [resolve(1203,a,128,b)]. 2.94/3.22 2516 subactivity_occurrence(f16(c1,c2),f7(f17(c1,c2),tptp0)). [resolve(863,a,911,a),unit_del(a,380)]. 2.94/3.22 2518 subactivity_occurrence(f15(c1,c2),f7(f17(c1,c2),tptp0)). [resolve(2516,a,736,a),unit_del(a,380)]. 2.94/3.22 2539 subactivity_occurrence(c1,f7(f17(c1,c2),tptp0)). [resolve(2518,a,481,a),unit_del(a,380)]. 2.94/3.22 8827 -occurrence_of(f7(f17(c1,c2),tptp0),A) | min_precedes(c1,f17(c1,c2),A) | f17(c1,c2) = c1. [resolve(908,b,2539,a),unit_del(c,169)]. 2.94/3.22 12783 min_precedes(c1,f17(c1,c2),tptp0) | f17(c1,c2) = c1. [resolve(8827,a,380,a)]. 2.94/3.22 12787 f17(c1,c2) = c1 | min_precedes(f15(c1,c2),f17(c1,c2),tptp0). [resolve(12783,a,464,a),unit_del(c,1203),unit_del(d,844)]. 2.94/3.22 12862 f17(c1,c2) = c1 | -occurrence_of(f17(c1,c2),tptp1). [resolve(12787,b,429,b),unit_del(b,275)]. 2.94/3.22 12863 f17(c1,c2) = c1 | -occurrence_of(f17(c1,c2),tptp2). [resolve(12787,b,428,b),unit_del(b,275)]. 2.94/3.22 12902 f17(c1,c2) = c1 | occurrence_of(f17(c1,c2),tptp1). [resolve(12863,b,274,b)]. 2.94/3.22 12903 f17(c1,c2) = c1. [resolve(12902,b,12862,b),merge(b)]. 2.94/3.22 15058 $F. [back_rewrite(1205),rewrite([12903(3)]),unit_del(a,462)]. 2.94/3.22 2.94/3.22 % SZS output end Refutation 2.94/3.22 ============================== end of proof ========================== 2.94/3.22 2.94/3.22 ============================== STATISTICS ============================ 2.94/3.22 2.94/3.22 Given=2438. Generated=40184. Kept=14955. proofs=1. 2.94/3.22 Usable=1838. Sos=6189. Demods=63. Limbo=2155, Disabled=4965. Hints=0. 2.94/3.22 Megabytes=27.68. 2.94/3.22 User_CPU=1.98, System_CPU=0.03, Wall_clock=2. 2.94/3.22 2.94/3.22 ============================== end of statistics ===================== 2.94/3.22 2.94/3.22 ============================== end of search ========================= 2.94/3.22 2.94/3.22 THEOREM PROVED 2.94/3.22 % SZS status Theorem 2.94/3.22 2.94/3.22 Exiting with 1 proof. 2.94/3.22 2.94/3.22 Process 3496 exit (max_proofs) Tue Jul 13 16:37:49 2021 2.97/3.22 Prover9 interrupted 2.97/3.23 EOF