TSTP Solution File: PRO014+3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PRO014+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n008.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Mon Jul 18 17:52:14 EDT 2022
% Result : Theorem 3.17s 3.43s
% Output : Refutation 3.17s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : PRO014+3 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n008.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 : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 13 02:00:07 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.75/1.03 ============================== Prover9 ===============================
% 0.75/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.75/1.03 Process 23118 was started by sandbox on n008.cluster.edu,
% 0.75/1.03 Mon Jun 13 02:00:08 2022
% 0.75/1.03 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_22965_n008.cluster.edu".
% 0.75/1.03 ============================== end of head ===========================
% 0.75/1.03
% 0.75/1.03 ============================== INPUT =================================
% 0.75/1.03
% 0.75/1.03 % Reading from file /tmp/Prover9_22965_n008.cluster.edu
% 0.75/1.03
% 0.75/1.03 set(prolog_style_variables).
% 0.75/1.03 set(auto2).
% 0.75/1.03 % set(auto2) -> set(auto).
% 0.75/1.03 % set(auto) -> set(auto_inference).
% 0.75/1.03 % set(auto) -> set(auto_setup).
% 0.75/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.75/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.75/1.03 % set(auto) -> set(auto_limits).
% 0.75/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.75/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.75/1.03 % set(auto) -> set(auto_denials).
% 0.75/1.03 % set(auto) -> set(auto_process).
% 0.75/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.75/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.75/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.75/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.75/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.75/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.75/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.75/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.75/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.75/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.75/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.75/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.75/1.03 % set(auto2) -> assign(stats, some).
% 0.75/1.03 % set(auto2) -> clear(echo_input).
% 0.75/1.03 % set(auto2) -> set(quiet).
% 0.75/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.75/1.03 % set(auto2) -> clear(print_given).
% 0.75/1.03 assign(lrs_ticks,-1).
% 0.75/1.03 assign(sos_limit,10000).
% 0.75/1.03 assign(order,kbo).
% 0.75/1.03 set(lex_order_vars).
% 0.75/1.03 clear(print_given).
% 0.75/1.03
% 0.75/1.03 % formulas(sos). % not echoed (63 formulas)
% 0.75/1.03
% 0.75/1.03 ============================== end of input ==========================
% 0.75/1.03
% 0.75/1.03 % From the command line: assign(max_seconds, 300).
% 0.75/1.03
% 0.75/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.75/1.03
% 0.75/1.03 % Formulas that are not ordinary clauses:
% 0.75/1.03 1 (all X0 all X1 (occurrence_of(X1,X0) -> activity(X0) & activity_occurrence(X1))) # label(sos) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 2 (all X2 (activity_occurrence(X2) -> (exists X3 (activity(X3) & occurrence_of(X2,X3))))) # label(sos_01) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 3 (all X4 all X5 all X6 (occurrence_of(X4,X5) & occurrence_of(X4,X6) -> X5 = X6)) # label(sos_02) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 4 (all X7 (activity(X7) -> subactivity(X7,X7))) # label(sos_03) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 5 (all X8 all X9 (earlier(X8,X9) -> -earlier(X9,X8))) # label(sos_04) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 6 (all X10 all X11 all X12 (earlier(X10,X11) & earlier(X11,X12) -> earlier(X10,X12))) # label(sos_05) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 7 (all X13 all X14 all X15 (earlier(X13,X14) & earlier(X15,X14) -> earlier(X15,X13) | earlier(X13,X15) | X13 = X15)) # label(sos_06) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 8 (all X16 all X17 (occurrence_of(X16,X17) -> (arboreal(X16) <-> atomic(X17)))) # label(sos_07) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 9 (all X18 (legal(X18) -> arboreal(X18))) # label(sos_08) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 10 (all X19 all X20 (legal(X19) & earlier(X20,X19) -> legal(X20))) # label(sos_09) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 11 (all X21 all X22 (precedes(X21,X22) <-> earlier(X21,X22) & legal(X22))) # label(sos_10) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 12 (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.75/1.03 13 (all X28 all X29 (root(X29,X28) -> (exists X30 (subactivity(X30,X28) & atocc(X29,X30))))) # label(sos_12) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 14 (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.75/1.03 15 (all X35 all X36 all X37 (min_precedes(X35,X36,X37) -> -root(X36,X37))) # label(sos_14) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 16 (all X38 all X39 all X40 (min_precedes(X38,X39,X40) -> precedes(X38,X39))) # label(sos_15) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 17 (all X41 all X42 (root(X41,X42) -> legal(X41))) # label(sos_16) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 18 (all X43 all X44 (atocc(X43,X44) & legal(X43) -> root(X43,X44))) # label(sos_17) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 19 (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.75/1.03 20 (all X49 all X50 all X51 (min_precedes(X49,X50,X51) -> -atomic(X51))) # label(sos_19) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 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.75/1.03 22 (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.75/1.03 23 (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.75/1.03 24 (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.75/1.03 25 (all X67 all X68 (subactivity_occurrence(X67,X68) -> activity_occurrence(X67) & activity_occurrence(X68))) # label(sos_24) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 26 (all X69 all X70 all X71 (min_precedes(X70,X71,X69) -> (exists X72 (occurrence_of(X72,X69) & subactivity_occurrence(X70,X72) & subactivity_occurrence(X71,X72))))) # label(sos_25) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 27 (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.75/1.03 28 (all X76 all X77 (occurrence_of(X77,X76) & -atomic(X76) -> (exists X78 (root(X78,X76) & subactivity_occurrence(X78,X77))))) # label(sos_27) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 29 (all X79 all X80 all X81 all X82 (occurrence_of(X80,X79) & arboreal(X81) & arboreal(X82) & subactivity_occurrence(X81,X80) & subactivity_occurrence(X82,X80) -> min_precedes(X81,X82,X79) | min_precedes(X82,X81,X79) | X81 = X82)) # label(sos_28) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 30 (all X83 all X84 all X85 all X86 (min_precedes(X83,X84,X85) & occurrence_of(X86,X85) & subactivity_occurrence(X84,X86) -> subactivity_occurrence(X83,X86))) # label(sos_29) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 31 (all X87 all X88 all X89 all X90 (occurrence_of(X89,X87) & occurrence_of(X90,X88) & -atomic(X87) & subactivity_occurrence(X89,X90) -> subactivity(X87,X88))) # label(sos_30) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 32 (all X91 all X92 all X93 (subactivity_occurrence(X91,X92) & subactivity_occurrence(X92,X93) -> subactivity_occurrence(X91,X93))) # label(sos_31) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 33 (all X94 all X95 all X96 all X97 (occurrence_of(X96,X94) & occurrence_of(X97,X95) & subactivity(X94,X95) & -subactivity_occurrence(X96,X97) -> (exists X98 (subactivity_occurrence(X98,X97) & -subactivity_occurrence(X98,X96))))) # label(sos_32) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 34 (all X99 all X100 (root_occ(X99,X100) <-> (exists X101 (occurrence_of(X100,X101) & subactivity_occurrence(X99,X100) & root(X99,X101))))) # label(sos_33) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 35 (all X102 all X103 (leaf_occ(X102,X103) <-> (exists X104 (occurrence_of(X103,X104) & subactivity_occurrence(X102,X103) & leaf(X102,X104))))) # label(sos_34) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 36 (all X105 all X106 all X107 all X108 (occurrence_of(X107,X108) & root_occ(X105,X107) & root_occ(X106,X107) -> X105 = X106)) # label(sos_35) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 37 (all X109 all X110 all X111 all X112 (occurrence_of(X111,X112) & -atomic(X112) & leaf_occ(X109,X111) & leaf_occ(X110,X111) -> X109 = X110)) # label(sos_36) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 38 (all X113 all X114 all X115 (occurrence_of(X113,X115) & leaf_occ(X114,X113) -> -(exists X116 min_precedes(X114,X116,X115)))) # label(sos_37) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 39 (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.75/1.03 40 (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(X123,X125) & subactivity_occurrence(X122,X125) -> X122 = X123)) # label(sos_39) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 41 (all X126 all X127 all X128 all X129 (next_subocc(X127,X126,X129) & next_subocc(X128,X126,X129) -> X127 = X128)) # label(sos_40) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 42 (all X130 all X131 all X132 all X133 (occurrence_of(X130,X133) & leaf_occ(X131,X130) & root_occ(X132,X130) & X131 != X132 -> min_precedes(X132,X131,X133))) # label(sos_41) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 43 (all X134 all X135 all X136 all X137 (occurrence_of(X135,X134) & subactivity_occurrence(X136,X135) & root_occ(X137,X135) & arboreal(X136) & -min_precedes(X137,X136,X134) -> X137 = X136)) # label(sos_42) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 44 (all X138 all X139 all X140 all X141 (occurrence_of(X139,X138) & subactivity_occurrence(X140,X139) & leaf_occ(X141,X139) & arboreal(X140) & -min_precedes(X140,X141,X138) -> X141 = X140)) # label(sos_43) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 45 (all X142 all X143 all X144 (next_subocc(X142,X143,X144) -> arboreal(X142) & arboreal(X143))) # label(sos_44) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 46 (all X145 all X146 (leaf(X145,X146) & -atomic(X146) -> (exists X147 (occurrence_of(X147,X146) & leaf_occ(X145,X147))))) # label(sos_45) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 47 (all X148 all X149 all X150 (min_precedes(X148,X149,X150) -> arboreal(X148))) # label(sos_46) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 48 (all X151 all X152 all X153 all X154 all X155 (occurrence_of(X152,X151) & root_occ(X154,X152) & leaf_occ(X155,X152) & subactivity_occurrence(X153,X152) & min_precedes(X153,X155,X151) & X153 != X154 -> min_precedes(X154,X153,X151))) # label(sos_47) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 49 (all X156 all X157 all X158 all X159 all X160 (occurrence_of(X157,X156) & root_occ(X159,X157) & leaf_occ(X160,X157) & subactivity_occurrence(X158,X157) & min_precedes(X159,X158,X156) & X158 != X160 -> min_precedes(X158,X160,X156))) # label(sos_48) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 50 (all X161 all X162 (occurrence_of(X162,tptp0) & subactivity_occurrence(X161,X162) & arboreal(X161) & -leaf_occ(X161,X162) -> (exists X163 exists X164 exists X165 (occurrence_of(X163,tptp3) & next_subocc(X161,X163,tptp0) & occurrence_of(X164,tptp4) & next_subocc(X163,X164,tptp0) & (occurrence_of(X165,tptp2) | occurrence_of(X165,tptp1)) & next_subocc(X164,X165,tptp0) & leaf(X165,tptp0))))) # label(sos_49) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 51 -(all X166 all X167 (occurrence_of(X167,tptp0) & subactivity_occurrence(X166,X167) & arboreal(X166) & -leaf_occ(X166,X167) -> (exists X168 exists X169 (occurrence_of(X168,tptp3) & next_subocc(X166,X168,tptp0) & (occurrence_of(X169,tptp2) | occurrence_of(X169,tptp1)) & min_precedes(X168,X169,tptp0) & leaf(X169,tptp0))))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.75/1.04
% 0.75/1.04 ============================== end of process non-clausal formulas ===
% 0.75/1.04
% 0.75/1.04 ============================== PROCESS INITIAL CLAUSES ===============
% 0.75/1.04
% 0.75/1.04 ============================== PREDICATE ELIMINATION =================
% 0.75/1.04 52 -activity(A) | subactivity(A,A) # label(sos_03) # label(axiom). [clausify(4)].
% 0.75/1.04 53 -occurrence_of(A,B) | activity(B) # label(sos) # label(axiom). [clausify(1)].
% 0.75/1.04 54 -activity_occurrence(A) | activity(f1(A)) # label(sos_01) # label(axiom). [clausify(2)].
% 0.75/1.04 Derived: subactivity(A,A) | -occurrence_of(B,A). [resolve(52,a,53,b)].
% 0.75/1.04 Derived: subactivity(f1(A),f1(A)) | -activity_occurrence(A). [resolve(52,a,54,b)].
% 0.75/1.04 55 activity(tptp0) # label(sos_50) # label(axiom). [assumption].
% 0.75/1.04 Derived: subactivity(tptp0,tptp0). [resolve(55,a,52,a)].
% 0.75/1.04 56 -activity_occurrence(A) | occurrence_of(A,f1(A)) # label(sos_01) # label(axiom). [clausify(2)].
% 0.75/1.04 57 -occurrence_of(A,B) | activity_occurrence(A) # label(sos) # label(axiom). [clausify(1)].
% 0.75/1.04 Derived: occurrence_of(A,f1(A)) | -occurrence_of(A,B). [resolve(56,a,57,b)].
% 0.75/1.04 58 -subactivity_occurrence(A,B) | activity_occurrence(A) # label(sos_24) # label(axiom). [clausify(25)].
% 0.75/1.04 Derived: -subactivity_occurrence(A,B) | occurrence_of(A,f1(A)). [resolve(58,b,56,a)].
% 0.75/1.04 59 -subactivity_occurrence(A,B) | activity_occurrence(B) # label(sos_24) # label(axiom). [clausify(25)].
% 0.75/1.04 Derived: -subactivity_occurrence(A,B) | occurrence_of(B,f1(B)). [resolve(59,b,56,a)].
% 0.75/1.04 60 subactivity(f1(A),f1(A)) | -activity_occurrence(A). [resolve(52,a,54,b)].
% 0.75/1.04 Derived: subactivity(f1(A),f1(A)) | -occurrence_of(A,B). [resolve(60,b,57,b)].
% 0.75/1.04 Derived: subactivity(f1(A),f1(A)) | -subactivity_occurrence(A,B). [resolve(60,b,58,b)].
% 0.75/1.04 Derived: subactivity(f1(A),f1(A)) | -subactivity_occurrence(B,A). [resolve(60,b,59,b)].
% 0.75/1.04 61 precedes(A,B) | -earlier(A,B) | -legal(B) # label(sos_10) # label(axiom). [clausify(11)].
% 0.75/1.04 62 -precedes(A,B) | earlier(A,B) # label(sos_10) # label(axiom). [clausify(11)].
% 0.75/1.04 63 -precedes(A,B) | legal(B) # label(sos_10) # label(axiom). [clausify(11)].
% 0.75/1.04 64 -min_precedes(A,B,C) | precedes(A,B) # label(sos_15) # label(axiom). [clausify(16)].
% 0.75/1.04 Derived: -min_precedes(A,B,C) | earlier(A,B). [resolve(64,b,62,a)].
% 0.75/1.04 Derived: -min_precedes(A,B,C) | legal(B). [resolve(64,b,63,a)].
% 0.75/1.04 65 -min_precedes(A,B,C) | -min_precedes(A,D,C) | -precedes(B,D) | min_precedes(B,D,C) # label(sos_18) # label(axiom). [clausify(19)].
% 0.75/1.04 Derived: -min_precedes(A,B,C) | -min_precedes(A,D,C) | min_precedes(B,D,C) | -earlier(B,D) | -legal(D). [resolve(65,c,61,a)].
% 0.75/1.04 Derived: -min_precedes(A,B,C) | -min_precedes(A,D,C) | min_precedes(B,D,C) | -min_precedes(B,D,E). [resolve(65,c,64,b)].
% 0.75/1.04 66 -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.75/1.04 Derived: -min_precedes(A,B,C) | -min_precedes(D,B,C) | min_precedes(A,D,C) | -earlier(A,D) | -legal(D). [resolve(66,c,61,a)].
% 0.75/1.04 Derived: -min_precedes(A,B,C) | -min_precedes(D,B,C) | min_precedes(A,D,C) | -min_precedes(A,D,E). [resolve(66,c,64,b)].
% 0.75/1.04 67 atocc(A,B) | -subactivity(B,C) | -atomic(C) | -occurrence_of(A,C) # label(sos_23) # label(axiom). [clausify(24)].
% 0.75/1.04 68 -min_precedes(A,B,C) | subactivity(f2(C,A,B),C) # label(sos_11) # label(axiom). [clausify(12)].
% 0.75/1.04 69 -min_precedes(A,B,C) | subactivity(f3(C,A,B),C) # label(sos_11) # label(axiom). [clausify(12)].
% 0.75/1.04 70 -root(A,B) | subactivity(f4(B,A),B) # label(sos_12) # label(axiom). [clausify(13)].
% 0.75/1.04 71 -atocc(A,B) | subactivity(B,f9(A,B)) # label(sos_23) # label(axiom). [clausify(24)].
% 0.75/1.04 Derived: atocc(A,f2(B,C,D)) | -atomic(B) | -occurrence_of(A,B) | -min_precedes(C,D,B). [resolve(67,b,68,b)].
% 0.75/1.04 Derived: atocc(A,f3(B,C,D)) | -atomic(B) | -occurrence_of(A,B) | -min_precedes(C,D,B). [resolve(67,b,69,b)].
% 0.75/1.04 Derived: atocc(A,f4(B,C)) | -atomic(B) | -occurrence_of(A,B) | -root(C,B). [resolve(67,b,70,b)].
% 0.75/1.04 Derived: atocc(A,B) | -atomic(f9(C,B)) | -occurrence_of(A,f9(C,B)) | -atocc(C,B). [resolve(67,b,71,b)].
% 0.75/1.04 72 -occurrence_of(A,B) | -occurrence_of(C,D) | atomic(B) | -subactivity_occurrence(A,C) | subactivity(B,D) # label(sos_30) # label(axiom). [clausify(31)].
% 0.75/1.04 Derived: -occurrence_of(A,B) | -occurrence_of(C,D) | atomic(B) | -subactivity_occurrence(A,C) | atocc(E,B) | -atomic(D) | -occurrence_of(E,D). [resolve(72,e,67,b)].
% 0.75/1.04 73 -occurrence_of(A,B) | -occurrence_of(C,D) | -subactivity(B,D) | subactivity_occurrence(A,C) | subactivity_occurrence(f13(B,D,A,C),C) # label(sos_32) # label(axiom). [clausify(33)].
% 0.75/1.04 Derived: -occurrence_of(A,f2(B,C,D)) | -occurrence_of(E,B) | subactivity_occurrence(A,E) | subactivity_occurrence(f13(f2(B,C,D),B,A,E),E) | -min_precedes(C,D,B). [resolve(73,c,68,b)].
% 0.75/1.04 Derived: -occurrence_of(A,f3(B,C,D)) | -occurrence_of(E,B) | subactivity_occurrence(A,E) | subactivity_occurrence(f13(f3(B,C,D),B,A,E),E) | -min_precedes(C,D,B). [resolve(73,c,69,b)].
% 0.75/1.04 Derived: -occurrence_of(A,f4(B,C)) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | subactivity_occurrence(f13(f4(B,C),B,A,D),D) | -root(C,B). [resolve(73,c,70,b)].
% 0.75/1.04 Derived: -occurrence_of(A,B) | -occurrence_of(C,f9(D,B)) | subactivity_occurrence(A,C) | subactivity_occurrence(f13(B,f9(D,B),A,C),C) | -atocc(D,B). [resolve(73,c,71,b)].
% 0.75/1.04 Derived: -occurrence_of(A,B) | -occurrence_of(C,D) | subactivity_occurrence(A,C) | subactivity_occurrence(f13(B,D,A,C),C) | -occurrence_of(E,B) | -occurrence_of(F,D) | atomic(B) | -subactivity_occurrence(E,F). [resolve(73,c,72,e)].
% 0.75/1.04 74 -occurrence_of(A,B) | -occurrence_of(C,D) | -subactivity(B,D) | subactivity_occurrence(A,C) | -subactivity_occurrence(f13(B,D,A,C),A) # label(sos_32) # label(axiom). [clausify(33)].
% 0.75/1.04 Derived: -occurrence_of(A,f2(B,C,D)) | -occurrence_of(E,B) | subactivity_occurrence(A,E) | -subactivity_occurrence(f13(f2(B,C,D),B,A,E),A) | -min_precedes(C,D,B). [resolve(74,c,68,b)].
% 0.75/1.04 Derived: -occurrence_of(A,f3(B,C,D)) | -occurrence_of(E,B) | subactivity_occurrence(A,E) | -subactivity_occurrence(f13(f3(B,C,D),B,A,E),A) | -min_precedes(C,D,B). [resolve(74,c,69,b)].
% 0.75/1.04 Derived: -occurrence_of(A,f4(B,C)) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | -subactivity_occurrence(f13(f4(B,C),B,A,D),A) | -root(C,B). [resolve(74,c,70,b)].
% 0.75/1.04 Derived: -occurrence_of(A,B) | -occurrence_of(C,f9(D,B)) | subactivity_occurrence(A,C) | -subactivity_occurrence(f13(B,f9(D,B),A,C),A) | -atocc(D,B). [resolve(74,c,71,b)].
% 0.75/1.04 Derived: -occurrence_of(A,B) | -occurrence_of(C,D) | subactivity_occurrence(A,C) | -subactivity_occurrence(f13(B,D,A,C),A) | -occurrence_of(E,B) | -occurrence_of(F,D) | atomic(B) | -subactivity_occurrence(E,F). [resolve(74,c,72,e)].
% 0.75/1.04 75 subactivity(A,A) | -occurrence_of(B,A). [resolve(52,a,53,b)].
% 0.75/1.04 Derived: -occurrence_of(A,B) | atocc(C,B) | -atomic(B) | -occurrence_of(C,B). [resolve(75,a,67,b)].
% 0.75/1.04 Derived: -occurrence_of(A,B) | -occurrence_of(C,B) | -occurrence_of(D,B) | subactivity_occurrence(C,D) | subactivity_occurrence(f13(B,B,C,D),D). [resolve(75,a,73,c)].
% 0.75/1.04 Derived: -occurrence_of(A,B) | -occurrence_of(C,B) | -occurrence_of(D,B) | subactivity_occurrence(C,D) | -subactivity_occurrence(f13(B,B,C,D),C). [resolve(75,a,74,c)].
% 0.75/1.04 76 subactivity(tptp0,tptp0). [resolve(55,a,52,a)].
% 0.75/1.04 77 subactivity(f1(A),f1(A)) | -occurrence_of(A,B). [resolve(60,b,57,b)].
% 0.75/1.04 78 subactivity(f1(A),f1(A)) | -subactivity_occurrence(A,B). [resolve(60,b,58,b)].
% 0.75/1.04 79 subactivity(f1(A),f1(A)) | -subactivity_occurrence(B,A). [resolve(60,b,59,b)].
% 0.75/1.04 80 -min_precedes(A,B,C) | root(f5(A,B,C),C) # label(sos_13) # label(axiom). [clausify(14)].
% 0.75/1.04 81 -root(A,B) | atocc(A,f4(B,A)) # label(sos_12) # label(axiom). [clausify(13)].
% 0.75/1.04 Derived: -min_precedes(A,B,C) | atocc(f5(A,B,C),f4(C,f5(A,B,C))). [resolve(80,b,81,a)].
% 0.75/1.04 82 -min_precedes(A,B,C) | -root(B,C) # label(sos_14) # label(axiom). [clausify(15)].
% 0.75/1.04 Derived: -min_precedes(A,f5(B,C,D),D) | -min_precedes(B,C,D). [resolve(82,b,80,b)].
% 0.75/1.04 83 -root(A,B) | legal(A) # label(sos_16) # label(axiom). [clausify(17)].
% 0.75/1.04 Derived: legal(f5(A,B,C)) | -min_precedes(A,B,C). [resolve(83,a,80,b)].
% 0.75/1.04 84 -atocc(A,B) | -legal(A) | root(A,B) # label(sos_17) # label(axiom). [clausify(18)].
% 0.75/1.04 Derived: -atocc(A,B) | -legal(A) | atocc(A,f4(B,A)). [resolve(84,c,81,a)].
% 0.75/1.04 Derived: -atocc(A,B) | -legal(A) | -min_precedes(C,A,B). [resolve(84,c,82,b)].
% 0.75/1.04 85 -leaf(A,B) | root(A,B) | min_precedes(f6(A,B),A,B) # label(sos_21) # label(axiom). [clausify(22)].
% 0.75/1.04 Derived: -leaf(A,B) | min_precedes(f6(A,B),A,B) | atocc(A,f4(B,A)). [resolve(85,b,81,a)].
% 0.75/1.04 Derived: -leaf(A,B) | min_precedes(f6(A,B),A,B) | -min_precedes(C,A,B). [resolve(85,b,82,b)].
% 0.75/1.04 Derived: -leaf(A,B) | min_precedes(f6(A,B),A,B) | legal(A). [resolve(85,b,83,a)].
% 0.75/1.04 86 leaf(A,B) | -root(A,B) | min_precedes(A,f7(A,B),B) # label(sos_21) # label(axiom). [clausify(22)].
% 0.75/1.04 Derived: leaf(f5(A,B,C),C) | min_precedes(f5(A,B,C),f7(f5(A,B,C),C),C) | -min_precedes(A,B,C). [resolve(86,b,80,b)].
% 0.75/1.04 Derived: leaf(A,B) | min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A). [resolve(86,b,84,c)].
% 0.75/1.04 87 -root(A,B) | atomic(B) | occurrence_of(f11(B,A),B) # label(sos_26) # label(axiom). [clausify(27)].
% 0.75/1.04 Derived: atomic(A) | occurrence_of(f11(A,f5(B,C,A)),A) | -min_precedes(B,C,A). [resolve(87,a,80,b)].
% 0.75/1.04 Derived: atomic(A) | occurrence_of(f11(A,B),A) | -atocc(B,A) | -legal(B). [resolve(87,a,84,c)].
% 0.75/1.04 Derived: atomic(A) | occurrence_of(f11(A,B),A) | -leaf(B,A) | min_precedes(f6(B,A),B,A). [resolve(87,a,85,b)].
% 0.75/1.04 88 -root(A,B) | atomic(B) | subactivity_occurrence(A,f11(B,A)) # label(sos_26) # label(axiom). [clausify(27)].
% 0.75/1.04 Derived: atomic(A) | subactivity_occurrence(f5(B,C,A),f11(A,f5(B,C,A))) | -min_precedes(B,C,A). [resolve(88,a,80,b)].
% 0.75/1.04 Derived: atomic(A) | subactivity_occurrence(B,f11(A,B)) | -atocc(B,A) | -legal(B). [resolve(88,a,84,c)].
% 0.75/1.04 Derived: atomic(A) | subactivity_occurrence(B,f11(A,B)) | -leaf(B,A) | min_precedes(f6(B,A),B,A). [resolve(88,a,85,b)].
% 0.75/1.04 89 -occurrence_of(A,B) | atomic(B) | root(f12(B,A),B) # label(sos_27) # label(axiom). [clausify(28)].
% 0.75/1.04 Derived: -occurrence_of(A,B) | atomic(B) | atocc(f12(B,A),f4(B,f12(B,A))). [resolve(89,c,81,a)].
% 0.75/1.04 Derived: -occurrence_of(A,B) | atomic(B) | -min_precedes(C,f12(B,A),B). [resolve(89,c,82,b)].
% 0.75/1.04 Derived: -occurrence_of(A,B) | atomic(B) | legal(f12(B,A)). [resolve(89,c,83,a)].
% 0.75/1.04 Derived: -occurrence_of(A,B) | atomic(B) | leaf(f12(B,A),B) | min_precedes(f12(B,A),f7(f12(B,A),B),B). [resolve(89,c,86,b)].
% 0.75/1.04 Derived: -occurrence_of(A,B) | atomic(B) | atomic(B) | occurrence_of(f11(B,f12(B,A)),B). [resolve(89,c,87,a)].
% 0.75/1.04 Derived: -occurrence_of(A,B) | atomic(B) | atomic(B) | subactivity_occurrence(f12(B,A),f11(B,f12(B,A))). [resolve(89,c,88,a)].
% 0.75/1.04 90 -root_occ(A,B) | root(A,f14(A,B)) # label(sos_33) # label(axiom). [clausify(34)].
% 0.75/1.04 Derived: -root_occ(A,B) | atocc(A,f4(f14(A,B),A)). [resolve(90,b,81,a)].
% 0.75/1.04 Derived: -root_occ(A,B) | -min_precedes(C,A,f14(A,B)). [resolve(90,b,82,b)].
% 0.75/1.04 Derived: -root_occ(A,B) | legal(A). [resolve(90,b,83,a)].
% 0.75/1.04 Derived: -root_occ(A,B) | leaf(A,f14(A,B)) | min_precedes(A,f7(A,f14(A,B)),f14(A,B)). [resolve(90,b,86,b)].
% 0.75/1.04 Derived: -root_occ(A,B) | atomic(f14(A,B)) | occurrence_of(f11(f14(A,B),A),f14(A,B)). [resolve(90,b,87,a)].
% 0.75/1.04 Derived: -root_occ(A,B) | atomic(f14(A,B)) | subactivity_occurrence(A,f11(f14(A,B),A)). [resolve(90,b,88,a)].
% 0.75/1.04 91 root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -root(A,C) # label(sos_33) # label(axiom). [clausify(34)].
% 0.75/1.04 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(91,d,80,b)].
% 0.75/1.04 Derived: root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -atocc(A,C) | -legal(A). [resolve(91,d,84,c)].
% 0.75/1.04 Derived: root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -leaf(A,C) | min_precedes(f6(A,C),A,C). [resolve(91,d,85,b)].
% 0.75/1.04 Derived: root_occ(f12(A,B),C) | -occurrence_of(C,A) | -subactivity_occurrence(f12(A,B),C) | -occurrence_of(B,A) | atomic(A). [resolve(91,d,89,c)].
% 0.75/1.04 Derived: root_occ(A,B) | -occurrence_of(B,f14(A,C)) | -subactivity_occurrence(A,B) | -root_occ(A,C). [resolve(91,d,90,b)].
% 0.75/1.04 92 atocc(A,f4(B,C)) | -atomic(B) | -occurrence_of(A,B) | -root(C,B). [resolve(67,b,70,b)].
% 0.75/1.04 Derived: atocc(A,f4(B,f5(C,D,B))) | -atomic(B) | -occurrence_of(A,B) | -min_precedes(C,D,B). [resolve(92,d,80,b)].
% 0.75/1.04 Derived: atocc(A,f4(B,C)) | -atomic(B) | -occurrence_of(A,B) | -atocc(C,B) | -legal(C). [resolve(92,d,84,c)].
% 3.17/3.43 Derived: atocc(A,f4(B,C)) | -atomic(B) | -occurrence_of(A,B) | -leaf(C,B) | min_precedes(f6(C,B),C,B). [resolve(92,d,85,b)].
% 3.17/3.43 Derived: atocc(A,f4(f14(B,C),B)) | -atomic(f14(B,C)) | -occurrence_of(A,f14(B,C)) | -root_occ(B,C). [resolve(92,d,90,b)].
% 3.17/3.43 93 -occurrence_of(A,f4(B,C)) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | subactivity_occurrence(f13(f4(B,C),B,A,D),D) | -root(C,B). [resolve(73,c,70,b)].
% 3.17/3.43 Derived: -occurrence_of(A,f4(B,f5(C,D,B))) | -occurrence_of(E,B) | subactivity_occurrence(A,E) | subactivity_occurrence(f13(f4(B,f5(C,D,B)),B,A,E),E) | -min_precedes(C,D,B). [resolve(93,e,80,b)].
% 3.17/3.43 Derived: -occurrence_of(A,f4(B,C)) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | subactivity_occurrence(f13(f4(B,C),B,A,D),D) | -atocc(C,B) | -legal(C). [resolve(93,e,84,c)].
% 3.17/3.43 Derived: -occurrence_of(A,f4(B,C)) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | subactivity_occurrence(f13(f4(B,C),B,A,D),D) | -leaf(C,B) | min_precedes(f6(C,B),C,B). [resolve(93,e,85,b)].
% 3.17/3.43 Derived: -occurrence_of(A,f4(B,f12(B,C))) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | subactivity_occurrence(f13(f4(B,f12(B,C)),B,A,D),D) | -occurrence_of(C,B) | atomic(B). [resolve(93,e,89,c)].
% 3.17/3.43 Derived: -occurrence_of(A,f4(f14(B,C),B)) | -occurrence_of(D,f14(B,C)) | subactivity_occurrence(A,D) | subactivity_occurrence(f13(f4(f14(B,C),B),f14(B,C),A,D),D) | -root_occ(B,C). [resolve(93,e,90,b)].
% 3.17/3.43 94 -occurrence_of(A,f4(B,C)) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | -subactivity_occurrence(f13(f4(B,C),B,A,D),A) | -root(C,B). [resolve(74,c,70,b)].
% 3.17/3.43 Derived: -occurrence_of(A,f4(B,f5(C,D,B))) | -occurrence_of(E,B) | subactivity_occurrence(A,E) | -subactivity_occurrence(f13(f4(B,f5(C,D,B)),B,A,E),A) | -min_precedes(C,D,B). [resolve(94,e,80,b)].
% 3.17/3.43 Derived: -occurrence_of(A,f4(B,C)) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | -subactivity_occurrence(f13(f4(B,C),B,A,D),A) | -atocc(C,B) | -legal(C). [resolve(94,e,84,c)].
% 3.17/3.43 Derived: -occurrence_of(A,f4(B,C)) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | -subactivity_occurrence(f13(f4(B,C),B,A,D),A) | -leaf(C,B) | min_precedes(f6(C,B),C,B). [resolve(94,e,85,b)].
% 3.17/3.43 Derived: -occurrence_of(A,f4(B,f12(B,C))) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | -subactivity_occurrence(f13(f4(B,f12(B,C)),B,A,D),A) | -occurrence_of(C,B) | atomic(B). [resolve(94,e,89,c)].
% 3.17/3.43 Derived: -occurrence_of(A,f4(f14(B,C),B)) | -occurrence_of(D,f14(B,C)) | subactivity_occurrence(A,D) | -subactivity_occurrence(f13(f4(f14(B,C),B),f14(B,C),A,D),A) | -root_occ(B,C). [resolve(94,e,90,b)].
% 3.17/3.43
% 3.17/3.43 ============================== end predicate elimination =============
% 3.17/3.43
% 3.17/3.43 Auto_denials: (non-Horn, no changes).
% 3.17/3.43
% 3.17/3.43 Term ordering decisions:
% 3.17/3.43
% 3.17/3.43 % Assigning unary symbol f1 kb_weight 0 and highest precedence (39).
% 3.17/3.43 Function symbol KB weights: tptp0=1. tptp1=1. tptp2=1. tptp3=1. tptp4=1. c1=1. c2=1. f4=1. f6=1. f7=1. f9=1. f11=1. f12=1. f14=1. f15=1. f16=1. f17=1. f18=1. f19=1. f2=1. f3=1. f5=1. f8=1. f10=1. f13=1. f1=0.
% 3.17/3.43
% 3.17/3.43 ============================== end of process initial clauses ========
% 3.17/3.43
% 3.17/3.43 ============================== CLAUSES FOR SEARCH ====================
% 3.17/3.43
% 3.17/3.43 ============================== end of clauses for search =============
% 3.17/3.43
% 3.17/3.43 ============================== SEARCH ================================
% 3.17/3.43
% 3.17/3.43 % Starting search at 0.04 seconds.
% 3.17/3.43
% 3.17/3.43 Low Water (keep): wt=53.000, iters=3451
% 3.17/3.43
% 3.17/3.43 Low Water (keep): wt=51.000, iters=3408
% 3.17/3.43
% 3.17/3.43 Low Water (keep): wt=49.000, iters=3350
% 3.17/3.43
% 3.17/3.43 Low Water (keep): wt=45.000, iters=3565
% 3.17/3.43
% 3.17/3.43 Low Water (keep): wt=43.000, iters=3577
% 3.17/3.43
% 3.17/3.43 Low Water (keep): wt=42.000, iters=3474
% 3.17/3.43
% 3.17/3.43 Low Water (keep): wt=40.000, iters=3351
% 3.17/3.43
% 3.17/3.43 Low Water (keep): wt=39.000, iters=3415
% 3.17/3.43
% 3.17/3.43 Low Water (keep): wt=36.000, iters=3502
% 3.17/3.43
% 3.17/3.43 Low Water (keep): wt=35.000, iters=3454
% 3.17/3.43
% 3.17/3.43 Low Water (keep): wt=33.000, iters=3435
% 3.17/3.43
% 3.17/3.43 Low Water (keep): wt=32.000, iters=3517
% 3.17/3.43
% 3.17/3.43 Low Water (keep): wt=31.000, iters=3485
% 3.17/3.43
% 3.17/3.43 ============================== PROOF =================================
% 3.17/3.43 % SZS status Theorem
% 3.17/3.43 % SZS output start Refutation
% 3.17/3.43
% 3.17/3.43 % Proof 1 at 2.38 (+ 0.04) seconds.
% 3.17/3.43 % Length of proof is 78.
% 3.17/3.43 % Level of proof is 14.
% 3.17/3.43 % Maximum clause weight is 27.000.
% 3.17/3.43 % Given clauses 2436.
% 3.17/3.43
% 3.17/3.43 5 (all X8 all X9 (earlier(X8,X9) -> -earlier(X9,X8))) # label(sos_04) # label(axiom) # label(non_clause). [assumption].
% 3.17/3.43 6 (all X10 all X11 all X12 (earlier(X10,X11) & earlier(X11,X12) -> earlier(X10,X12))) # label(sos_05) # label(axiom) # label(non_clause). [assumption].
% 3.17/3.43 11 (all X21 all X22 (precedes(X21,X22) <-> earlier(X21,X22) & legal(X22))) # label(sos_10) # label(axiom) # label(non_clause). [assumption].
% 3.17/3.43 16 (all X38 all X39 all X40 (min_precedes(X38,X39,X40) -> precedes(X38,X39))) # label(sos_15) # label(axiom) # label(non_clause). [assumption].
% 3.17/3.43 19 (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].
% 3.17/3.43 23 (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].
% 3.17/3.43 30 (all X83 all X84 all X85 all X86 (min_precedes(X83,X84,X85) & occurrence_of(X86,X85) & subactivity_occurrence(X84,X86) -> subactivity_occurrence(X83,X86))) # label(sos_29) # label(axiom) # label(non_clause). [assumption].
% 3.17/3.43 35 (all X102 all X103 (leaf_occ(X102,X103) <-> (exists X104 (occurrence_of(X103,X104) & subactivity_occurrence(X102,X103) & leaf(X102,X104))))) # label(sos_34) # label(axiom) # label(non_clause). [assumption].
% 3.17/3.43 44 (all X138 all X139 all X140 all X141 (occurrence_of(X139,X138) & subactivity_occurrence(X140,X139) & leaf_occ(X141,X139) & arboreal(X140) & -min_precedes(X140,X141,X138) -> X141 = X140)) # label(sos_43) # label(axiom) # label(non_clause). [assumption].
% 3.17/3.43 46 (all X145 all X146 (leaf(X145,X146) & -atomic(X146) -> (exists X147 (occurrence_of(X147,X146) & leaf_occ(X145,X147))))) # label(sos_45) # label(axiom) # label(non_clause). [assumption].
% 3.17/3.43 50 (all X161 all X162 (occurrence_of(X162,tptp0) & subactivity_occurrence(X161,X162) & arboreal(X161) & -leaf_occ(X161,X162) -> (exists X163 exists X164 exists X165 (occurrence_of(X163,tptp3) & next_subocc(X161,X163,tptp0) & occurrence_of(X164,tptp4) & next_subocc(X163,X164,tptp0) & (occurrence_of(X165,tptp2) | occurrence_of(X165,tptp1)) & next_subocc(X164,X165,tptp0) & leaf(X165,tptp0))))) # label(sos_49) # label(axiom) # label(non_clause). [assumption].
% 3.17/3.43 51 -(all X166 all X167 (occurrence_of(X167,tptp0) & subactivity_occurrence(X166,X167) & arboreal(X166) & -leaf_occ(X166,X167) -> (exists X168 exists X169 (occurrence_of(X168,tptp3) & next_subocc(X166,X168,tptp0) & (occurrence_of(X169,tptp2) | occurrence_of(X169,tptp1)) & min_precedes(X168,X169,tptp0) & leaf(X169,tptp0))))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 3.17/3.43 61 precedes(A,B) | -earlier(A,B) | -legal(B) # label(sos_10) # label(axiom). [clausify(11)].
% 3.17/3.43 62 -precedes(A,B) | earlier(A,B) # label(sos_10) # label(axiom). [clausify(11)].
% 3.17/3.43 63 -precedes(A,B) | legal(B) # label(sos_10) # label(axiom). [clausify(11)].
% 3.17/3.43 64 -min_precedes(A,B,C) | precedes(A,B) # label(sos_15) # label(axiom). [clausify(16)].
% 3.17/3.43 65 -min_precedes(A,B,C) | -min_precedes(A,D,C) | -precedes(B,D) | min_precedes(B,D,C) # label(sos_18) # label(axiom). [clausify(19)].
% 3.17/3.43 96 -earlier(A,B) | -earlier(B,A) # label(sos_04) # label(axiom). [clausify(5)].
% 3.17/3.43 97 -earlier(A,B) | -earlier(B,C) | earlier(A,C) # label(sos_05) # label(axiom). [clausify(6)].
% 3.17/3.43 109 -next_subocc(A,B,C) | min_precedes(A,B,C) # label(sos_22) # label(axiom). [clausify(23)].
% 3.17/3.43 120 -min_precedes(A,B,C) | -occurrence_of(D,C) | -subactivity_occurrence(B,D) | subactivity_occurrence(A,D) # label(sos_29) # label(axiom). [clausify(30)].
% 3.17/3.43 125 -leaf_occ(A,B) | subactivity_occurrence(A,B) # label(sos_34) # label(axiom). [clausify(35)].
% 3.17/3.43 136 -occurrence_of(A,B) | -subactivity_occurrence(C,A) | -leaf_occ(D,A) | -arboreal(C) | min_precedes(C,D,B) | D = C # label(sos_43) # label(axiom). [clausify(44)].
% 3.17/3.43 139 -leaf(A,B) | atomic(B) | occurrence_of(f16(A,B),B) # label(sos_45) # label(axiom). [clausify(46)].
% 3.17/3.43 140 -leaf(A,B) | atomic(B) | leaf_occ(A,f16(A,B)) # label(sos_45) # label(axiom). [clausify(46)].
% 3.17/3.43 144 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | occurrence_of(f17(B,A),tptp3) # label(sos_49) # label(axiom). [clausify(50)].
% 3.17/3.43 145 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | next_subocc(B,f17(B,A),tptp0) # label(sos_49) # label(axiom). [clausify(50)].
% 3.17/3.43 147 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | next_subocc(f17(B,A),f18(B,A),tptp0) # label(sos_49) # label(axiom). [clausify(50)].
% 3.17/3.43 148 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | occurrence_of(f19(B,A),tptp2) | occurrence_of(f19(B,A),tptp1) # label(sos_49) # label(axiom). [clausify(50)].
% 3.17/3.43 149 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | next_subocc(f18(B,A),f19(B,A),tptp0) # label(sos_49) # label(axiom). [clausify(50)].
% 3.17/3.43 150 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | leaf(f19(B,A),tptp0) # label(sos_49) # label(axiom). [clausify(50)].
% 3.17/3.43 151 -atomic(tptp0) # label(sos_51) # label(axiom). [assumption].
% 3.17/3.43 162 occurrence_of(c2,tptp0) # label(goals) # label(negated_conjecture). [clausify(51)].
% 3.17/3.43 163 subactivity_occurrence(c1,c2) # label(goals) # label(negated_conjecture). [clausify(51)].
% 3.17/3.43 164 arboreal(c1) # label(goals) # label(negated_conjecture). [clausify(51)].
% 3.17/3.43 165 -leaf_occ(c1,c2) # label(goals) # label(negated_conjecture). [clausify(51)].
% 3.17/3.43 166 -occurrence_of(A,tptp3) | -next_subocc(c1,A,tptp0) | -occurrence_of(B,tptp2) | -min_precedes(A,B,tptp0) | -leaf(B,tptp0) # label(goals) # label(negated_conjecture). [clausify(51)].
% 3.17/3.43 167 -occurrence_of(A,tptp3) | -next_subocc(c1,A,tptp0) | -occurrence_of(B,tptp1) | -min_precedes(A,B,tptp0) | -leaf(B,tptp0) # label(goals) # label(negated_conjecture). [clausify(51)].
% 3.17/3.43 171 -min_precedes(A,B,C) | earlier(A,B). [resolve(64,b,62,a)].
% 3.17/3.43 172 -min_precedes(A,B,C) | legal(B). [resolve(64,b,63,a)].
% 3.17/3.43 173 -min_precedes(A,B,C) | -min_precedes(A,D,C) | min_precedes(B,D,C) | -earlier(B,D) | -legal(D). [resolve(65,c,61,a)].
% 3.17/3.43 260 leaf(f19(c1,c2),tptp0). [resolve(163,a,150,b),unit_del(a,162),unit_del(b,164),unit_del(c,165)].
% 3.17/3.43 261 next_subocc(f18(c1,c2),f19(c1,c2),tptp0). [resolve(163,a,149,b),unit_del(a,162),unit_del(b,164),unit_del(c,165)].
% 3.17/3.43 262 occurrence_of(f19(c1,c2),tptp2) | occurrence_of(f19(c1,c2),tptp1). [resolve(163,a,148,b),unit_del(a,162),unit_del(b,164),unit_del(c,165)].
% 3.17/3.43 263 next_subocc(f17(c1,c2),f18(c1,c2),tptp0). [resolve(163,a,147,b),unit_del(a,162),unit_del(b,164),unit_del(c,165)].
% 3.17/3.43 265 next_subocc(c1,f17(c1,c2),tptp0). [resolve(163,a,145,b),unit_del(a,162),unit_del(b,164),unit_del(c,165)].
% 3.17/3.43 266 occurrence_of(f17(c1,c2),tptp3). [resolve(163,a,144,b),unit_del(a,162),unit_del(b,164),unit_del(c,165)].
% 3.17/3.43 372 leaf_occ(f19(c1,c2),f16(f19(c1,c2),tptp0)). [resolve(260,a,140,a),unit_del(a,151)].
% 3.17/3.43 373 occurrence_of(f16(f19(c1,c2),tptp0),tptp0). [resolve(260,a,139,a),unit_del(a,151)].
% 3.17/3.43 380 min_precedes(f18(c1,c2),f19(c1,c2),tptp0). [resolve(261,a,109,a)].
% 3.17/3.43 426 min_precedes(f17(c1,c2),f18(c1,c2),tptp0). [resolve(263,a,109,a)].
% 3.17/3.43 439 -occurrence_of(A,tptp1) | -min_precedes(f17(c1,c2),A,tptp0) | -leaf(A,tptp0). [resolve(265,a,167,b),unit_del(a,266)].
% 3.17/3.43 440 -occurrence_of(A,tptp2) | -min_precedes(f17(c1,c2),A,tptp0) | -leaf(A,tptp0). [resolve(265,a,166,b),unit_del(a,266)].
% 3.17/3.43 444 min_precedes(c1,f17(c1,c2),tptp0). [resolve(265,a,109,a)].
% 3.17/3.43 477 -min_precedes(c1,A,tptp0) | min_precedes(f17(c1,c2),A,tptp0) | -earlier(f17(c1,c2),A) | -legal(A). [resolve(444,a,173,a)].
% 3.17/3.43 479 earlier(c1,f17(c1,c2)). [resolve(444,a,171,a)].
% 3.17/3.43 484 -occurrence_of(A,tptp0) | -subactivity_occurrence(f17(c1,c2),A) | subactivity_occurrence(c1,A). [resolve(444,a,120,a)].
% 3.17/3.43 651 legal(f19(c1,c2)). [resolve(380,a,172,a)].
% 3.17/3.43 652 earlier(f18(c1,c2),f19(c1,c2)). [resolve(380,a,171,a)].
% 3.17/3.43 657 -occurrence_of(A,tptp0) | -subactivity_occurrence(f19(c1,c2),A) | subactivity_occurrence(f18(c1,c2),A). [resolve(380,a,120,a)].
% 3.17/3.43 669 -earlier(A,f18(c1,c2)) | earlier(A,f19(c1,c2)). [resolve(652,a,97,b)].
% 3.17/3.43 746 earlier(f17(c1,c2),f18(c1,c2)). [resolve(426,a,171,a)].
% 3.17/3.43 749 -occurrence_of(A,tptp0) | -subactivity_occurrence(f18(c1,c2),A) | subactivity_occurrence(f17(c1,c2),A). [resolve(426,a,120,a)].
% 3.17/3.43 928 -occurrence_of(f16(f19(c1,c2),tptp0),A) | -subactivity_occurrence(B,f16(f19(c1,c2),tptp0)) | -arboreal(B) | min_precedes(B,f19(c1,c2),A) | f19(c1,c2) = B. [resolve(372,a,136,c)].
% 3.17/3.43 932 subactivity_occurrence(f19(c1,c2),f16(f19(c1,c2),tptp0)). [resolve(372,a,125,a)].
% 3.17/3.43 1239 earlier(f17(c1,c2),f19(c1,c2)). [resolve(669,a,746,a)].
% 3.17/3.43 1243 -earlier(f19(c1,c2),f17(c1,c2)). [resolve(1239,a,96,b)].
% 3.17/3.43 2287 subactivity_occurrence(f18(c1,c2),f16(f19(c1,c2),tptp0)). [resolve(657,b,932,a),unit_del(a,373)].
% 3.17/3.43 2376 subactivity_occurrence(f17(c1,c2),f16(f19(c1,c2),tptp0)). [resolve(749,b,2287,a),unit_del(a,373)].
% 3.17/3.43 2381 subactivity_occurrence(c1,f16(f19(c1,c2),tptp0)). [resolve(2376,a,484,b),unit_del(a,373)].
% 3.17/3.43 9006 -occurrence_of(f16(f19(c1,c2),tptp0),A) | min_precedes(c1,f19(c1,c2),A) | f19(c1,c2) = c1. [resolve(928,b,2381,a),unit_del(b,164)].
% 3.17/3.43 12926 min_precedes(c1,f19(c1,c2),tptp0) | f19(c1,c2) = c1. [resolve(9006,a,373,a)].
% 3.17/3.43 12931 f19(c1,c2) = c1 | min_precedes(f17(c1,c2),f19(c1,c2),tptp0). [resolve(12926,a,477,a),unit_del(c,1239),unit_del(d,651)].
% 3.17/3.43 13007 f19(c1,c2) = c1 | -occurrence_of(f19(c1,c2),tptp2). [resolve(12931,b,440,b),unit_del(c,260)].
% 3.17/3.43 13008 f19(c1,c2) = c1 | -occurrence_of(f19(c1,c2),tptp1). [resolve(12931,b,439,b),unit_del(c,260)].
% 3.17/3.43 13042 f19(c1,c2) = c1 | occurrence_of(f19(c1,c2),tptp1). [resolve(13007,b,262,a)].
% 3.17/3.43 13054 f19(c1,c2) = c1. [resolve(13042,b,13008,b),merge(b)].
% 3.17/3.43 15280 $F. [back_rewrite(1243),rewrite([13054(3)]),unit_del(a,479)].
% 3.17/3.43
% 3.17/3.43 % SZS output end Refutation
% 3.17/3.43 ============================== end of proof ==========================
% 3.17/3.43
% 3.17/3.43 ============================== STATISTICS ============================
% 3.17/3.43
% 3.17/3.43 Given=2436. Generated=40958. Kept=15183. proofs=1.
% 3.17/3.43 Usable=1864. Sos=6075. Demods=63. Limbo=2226, Disabled=5205. Hints=0.
% 3.17/3.43 Megabytes=27.84.
% 3.17/3.43 User_CPU=2.38, System_CPU=0.04, Wall_clock=2.
% 3.17/3.43
% 3.17/3.43 ============================== end of statistics =====================
% 3.17/3.43
% 3.17/3.43 ============================== end of search =========================
% 3.17/3.43
% 3.17/3.43 THEOREM PROVED
% 3.17/3.43 % SZS status Theorem
% 3.17/3.43
% 3.17/3.43 Exiting with 1 proof.
% 3.17/3.43
% 3.17/3.43 Process 23118 exit (max_proofs) Mon Jun 13 02:00:10 2022
% 3.17/3.43 Prover9 interrupted
%------------------------------------------------------------------------------