TSTP Solution File: PRO002+2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PRO002+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n014.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:03 EDT 2022
% Result : Theorem 21.15s 21.49s
% Output : Refutation 21.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : PRO002+2 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 13 03:27:52 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.46/1.03 ============================== Prover9 ===============================
% 0.46/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.46/1.03 Process 12055 was started by sandbox on n014.cluster.edu,
% 0.46/1.03 Mon Jun 13 03:27:53 2022
% 0.46/1.03 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_11901_n014.cluster.edu".
% 0.46/1.03 ============================== end of head ===========================
% 0.46/1.03
% 0.46/1.03 ============================== INPUT =================================
% 0.46/1.03
% 0.46/1.03 % Reading from file /tmp/Prover9_11901_n014.cluster.edu
% 0.46/1.03
% 0.46/1.03 set(prolog_style_variables).
% 0.46/1.03 set(auto2).
% 0.46/1.03 % set(auto2) -> set(auto).
% 0.46/1.03 % set(auto) -> set(auto_inference).
% 0.46/1.03 % set(auto) -> set(auto_setup).
% 0.46/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.46/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.46/1.03 % set(auto) -> set(auto_limits).
% 0.46/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.46/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.46/1.03 % set(auto) -> set(auto_denials).
% 0.46/1.03 % set(auto) -> set(auto_process).
% 0.46/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.46/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.46/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.46/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.46/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.46/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.46/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.46/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.46/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.46/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.46/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.46/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.46/1.03 % set(auto2) -> assign(stats, some).
% 0.46/1.03 % set(auto2) -> clear(echo_input).
% 0.46/1.03 % set(auto2) -> set(quiet).
% 0.46/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.46/1.03 % set(auto2) -> clear(print_given).
% 0.46/1.03 assign(lrs_ticks,-1).
% 0.46/1.03 assign(sos_limit,10000).
% 0.46/1.03 assign(order,kbo).
% 0.46/1.03 set(lex_order_vars).
% 0.46/1.03 clear(print_given).
% 0.46/1.03
% 0.46/1.03 % formulas(sos). % not echoed (52 formulas)
% 0.46/1.03
% 0.46/1.03 ============================== end of input ==========================
% 0.46/1.03
% 0.46/1.03 % From the command line: assign(max_seconds, 300).
% 0.46/1.03
% 0.46/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.46/1.03
% 0.46/1.03 % Formulas that are not ordinary clauses:
% 0.46/1.03 1 (all X0 all X1 all X2 all X3 (min_precedes(X0,X1,X3) & min_precedes(X1,X2,X3) -> min_precedes(X0,X2,X3))) # label(sos) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 2 (all X4 all X5 all X6 (earlier(X4,X5) & earlier(X5,X6) -> earlier(X4,X6))) # label(sos_01) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 3 (all X7 all X8 all X9 all X10 (occurrence_of(X9,X10) & root_occ(X7,X9) & root_occ(X8,X9) -> X7 = X8)) # label(sos_02) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 4 (all X11 all X12 all X13 all X14 (occurrence_of(X13,X14) & -atomic(X14) & leaf_occ(X11,X13) & leaf_occ(X12,X13) -> X11 = X12)) # label(sos_03) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 5 (all X15 all X16 all X17 (next_subocc(X15,X16,X17) <-> min_precedes(X15,X16,X17) & -(exists X18 (min_precedes(X15,X18,X17) & min_precedes(X18,X16,X17))))) # label(sos_04) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 6 (all X19 all X20 all X21 (next_subocc(X19,X20,X21) -> arboreal(X19) & arboreal(X20))) # label(sos_05) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 7 (all X22 all X23 all X24 (min_precedes(X22,X23,X24) -> precedes(X22,X23))) # label(sos_06) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 8 (all X25 all X26 all X27 (min_precedes(X25,X26,X27) -> -root(X26,X27))) # label(sos_07) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 9 (all X28 all X29 (precedes(X28,X29) <-> earlier(X28,X29) & legal(X29))) # label(sos_08) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 10 (all X30 all X31 (earlier(X30,X31) -> -earlier(X31,X30))) # label(sos_09) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 11 (all X32 all X33 (root_occ(X32,X33) <-> (exists X34 (occurrence_of(X33,X34) & subactivity_occurrence(X32,X33) & root(X32,X34))))) # label(sos_10) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 12 (all X35 all X36 (leaf_occ(X35,X36) <-> (exists X37 (occurrence_of(X36,X37) & subactivity_occurrence(X35,X36) & leaf(X35,X37))))) # label(sos_11) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 13 (all X38 all X39 (root(X38,X39) -> legal(X38))) # label(sos_12) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 14 (all X40 all X41 (occurrence_of(X40,X41) -> (arboreal(X40) <-> atomic(X41)))) # label(sos_13) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 15 (all X42 all X43 (leaf(X42,X43) <-> (root(X42,X43) | (exists X44 min_precedes(X44,X42,X43))) & -(exists X45 min_precedes(X42,X45,X43)))) # label(sos_14) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 16 (all X46 all X47 (atocc(X46,X47) <-> (exists X48 (subactivity(X47,X48) & atomic(X48) & occurrence_of(X46,X48))))) # label(sos_15) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 17 (all X49 all X50 (atocc(X49,X50) & legal(X49) -> root(X49,X50))) # label(sos_16) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 18 (all X51 (legal(X51) -> arboreal(X51))) # label(sos_17) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 19 (all X52 (activity_occurrence(X52) -> (exists X53 (activity(X53) & occurrence_of(X52,X53))))) # label(sos_18) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 20 (all X54 all X55 (subactivity_occurrence(X54,X55) -> activity_occurrence(X54) & activity_occurrence(X55))) # label(sos_19) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 21 (all X56 all X57 all X58 (occurrence_of(X56,X58) & root_occ(X57,X56) -> -(exists X59 min_precedes(X59,X57,X58)))) # label(sos_20) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 22 (all X60 all X61 all X62 (occurrence_of(X60,X62) & leaf_occ(X61,X60) -> -(exists X63 min_precedes(X61,X63,X62)))) # label(sos_21) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 23 (all X64 all X65 all X66 (occurrence_of(X64,X65) & occurrence_of(X64,X66) -> X65 = X66)) # label(sos_22) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 24 (all X67 all X68 (leaf(X67,X68) & -atomic(X68) -> (exists X69 (occurrence_of(X69,X68) & leaf_occ(X67,X69))))) # label(sos_23) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 25 (all X70 all X71 all X72 (min_precedes(X71,X72,X70) -> (exists X73 (occurrence_of(X73,X70) & subactivity_occurrence(X71,X73) & subactivity_occurrence(X72,X73))))) # label(sos_24) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 26 (all X74 all X75 (leaf(X74,X75) & -atomic(X75) -> (exists X76 (occurrence_of(X76,X75) & leaf_occ(X74,X76))))) # label(sos_25) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 27 (all X77 all X78 all X79 (min_precedes(X78,X79,X77) -> (exists X80 exists X81 (subactivity(X80,X77) & subactivity(X81,X77) & atocc(X78,X80) & atocc(X79,X81))))) # label(sos_26) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 28 (all X82 all X83 (root(X83,X82) -> (exists X84 (subactivity(X84,X82) & atocc(X83,X84))))) # label(sos_27) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 29 (all X85 all X86 all X87 all X88 (occurrence_of(X86,X85) & arboreal(X87) & arboreal(X88) & subactivity_occurrence(X87,X86) & subactivity_occurrence(X88,X86) -> min_precedes(X87,X88,X85) | min_precedes(X88,X87,X85) | X87 = X88)) # label(sos_28) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 30 (all X89 all X90 (occurrence_of(X90,X89) -> activity(X89) & activity_occurrence(X90))) # label(sos_29) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 31 (all X91 all X92 (occurrence_of(X92,X91) & -atomic(X91) -> (exists X93 (root(X93,X91) & subactivity_occurrence(X93,X92))))) # label(sos_30) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 32 (all X94 (activity(X94) -> subactivity(X94,X94))) # label(sos_31) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 33 (all X95 (occurrence_of(X95,tptp0) -> (exists X96 exists X97 (occurrence_of(X96,tptp4) & root_occ(X96,X95) & (occurrence_of(X97,tptp3) | occurrence_of(X97,tptp2)) & leaf_occ(X97,X95) & next_subocc(X96,X97,tptp0))))) # label(sos_32) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 34 (all X98 all X99 all X100 all X101 all X102 (send_message(X98,X99,X100,X101,X102) -> activity(X98) & atomic(X98) & root(X99,X100) & root(X101,X102))) # label(sos_45) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 35 (all X103 all X104 all X105 all X106 all X107 (send_message(X103,X104,X105,X106,X107) -> X103 != tptp4 & X103 != tptp3 & X103 != tptp2)) # label(sos_46) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 36 (all X108 all X109 all X110 all X111 all X112 all X113 (send_message(X108,X109,X110,X111,X112) & occurrence_of(X113,X108) -> min_precedes(X111,X113,X112))) # label(sos_47) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 37 (all X114 all X115 all X116 (tptp1(X114,X115,X116) -> activity(X114) & -atomic(X114) & -atomic(X115) & root(X116,X115))) # label(sos_48) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 38 (all X117 all X118 all X119 all X120 (tptp1(X117,X118,X119) & occurrence_of(X120,X117) -> (exists X121 exists X122 exists X123 exists X124 (send_message(X121,X122,X123,X119,X118) & occurrence_of(X124,X121) & root_occ(X124,X120))))) # label(sos_49) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 39 (all X125 all X126 -tptp1(tptp0,X125,X126)) # label(sos_50) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 40 --(exists X127 exists X128 exists X129 (tptp1(X127,tptp0,X128) & occurrence_of(X129,X127))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.46/1.03
% 0.46/1.03 ============================== end of process non-clausal formulas ===
% 0.46/1.03
% 0.46/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.46/1.03
% 0.46/1.03 ============================== PREDICATE ELIMINATION =================
% 0.46/1.03 41 -activity(A) | subactivity(A,A) # label(sos_31) # label(axiom). [clausify(32)].
% 0.46/1.03 42 activity(tptp0) # label(sos_33) # label(axiom). [assumption].
% 0.46/1.03 43 -activity_occurrence(A) | activity(f7(A)) # label(sos_18) # label(axiom). [clausify(19)].
% 0.46/1.03 44 -occurrence_of(A,B) | activity(B) # label(sos_29) # label(axiom). [clausify(30)].
% 0.46/1.03 Derived: subactivity(tptp0,tptp0). [resolve(41,a,42,a)].
% 0.46/1.03 Derived: subactivity(f7(A),f7(A)) | -activity_occurrence(A). [resolve(41,a,43,b)].
% 0.46/1.03 Derived: subactivity(A,A) | -occurrence_of(B,A). [resolve(41,a,44,b)].
% 0.46/1.03 45 -tptp1(A,B,C) | activity(A) # label(sos_48) # label(axiom). [clausify(37)].
% 0.46/1.03 Derived: -tptp1(A,B,C) | subactivity(A,A). [resolve(45,b,41,a)].
% 0.46/1.03 46 -send_message(A,B,C,D,E) | activity(A) # label(sos_45) # label(axiom). [clausify(34)].
% 0.46/1.03 Derived: -send_message(A,B,C,D,E) | subactivity(A,A). [resolve(46,b,41,a)].
% 0.46/1.03 47 -tptp1(A,B,C) | root(C,B) # label(sos_48) # label(axiom). [clausify(37)].
% 0.46/1.03 48 -min_precedes(A,B,C) | -root(B,C) # label(sos_07) # label(axiom). [clausify(8)].
% 0.46/1.03 49 -root(A,B) | legal(A) # label(sos_12) # label(axiom). [clausify(13)].
% 0.46/1.03 Derived: -tptp1(A,B,C) | -min_precedes(D,C,B). [resolve(47,b,48,b)].
% 0.46/1.03 Derived: -tptp1(A,B,C) | legal(C). [resolve(47,b,49,a)].
% 0.46/1.03 50 -root_occ(A,B) | root(A,f2(A,B)) # label(sos_10) # label(axiom). [clausify(11)].
% 0.46/1.03 Derived: -root_occ(A,B) | -min_precedes(C,A,f2(A,B)). [resolve(50,b,48,b)].
% 0.46/1.03 Derived: -root_occ(A,B) | legal(A). [resolve(50,b,49,a)].
% 0.46/1.03 51 -atocc(A,B) | -legal(A) | root(A,B) # label(sos_16) # label(axiom). [clausify(17)].
% 0.46/1.03 Derived: -atocc(A,B) | -legal(A) | -min_precedes(C,A,B). [resolve(51,c,48,b)].
% 0.46/1.03 52 -root(A,B) | subactivity(f13(B,A),B) # label(sos_27) # label(axiom). [clausify(28)].
% 0.46/1.03 Derived: subactivity(f13(A,B),A) | -tptp1(C,A,B). [resolve(52,a,47,b)].
% 0.46/1.03 Derived: subactivity(f13(f2(A,B),A),f2(A,B)) | -root_occ(A,B). [resolve(52,a,50,b)].
% 0.46/1.03 Derived: subactivity(f13(A,B),A) | -atocc(B,A) | -legal(B). [resolve(52,a,51,c)].
% 0.46/1.03 53 -root(A,B) | atocc(A,f13(B,A)) # label(sos_27) # label(axiom). [clausify(28)].
% 0.46/1.03 Derived: atocc(A,f13(B,A)) | -tptp1(C,B,A). [resolve(53,a,47,b)].
% 0.46/1.03 Derived: atocc(A,f13(f2(A,B),A)) | -root_occ(A,B). [resolve(53,a,50,b)].
% 0.46/1.03 Derived: atocc(A,f13(B,A)) | -atocc(A,B) | -legal(A). [resolve(53,a,51,c)].
% 0.46/1.03 54 -send_message(A,B,C,D,E) | root(B,C) # label(sos_45) # label(axiom). [clausify(34)].
% 0.46/1.03 Derived: -send_message(A,B,C,D,E) | -min_precedes(F,B,C). [resolve(54,b,48,b)].
% 0.46/1.03 Derived: -send_message(A,B,C,D,E) | legal(B). [resolve(54,b,49,a)].
% 0.46/1.03 Derived: -send_message(A,B,C,D,E) | subactivity(f13(C,B),C). [resolve(54,b,52,a)].
% 0.46/1.03 Derived: -send_message(A,B,C,D,E) | atocc(B,f13(C,B)). [resolve(54,b,53,a)].
% 0.46/1.03 55 -send_message(A,B,C,D,E) | root(D,E) # label(sos_45) # label(axiom). [clausify(34)].
% 0.46/1.03 Derived: -send_message(A,B,C,D,E) | -min_precedes(F,D,E). [resolve(55,b,48,b)].
% 0.46/1.03 Derived: -send_message(A,B,C,D,E) | legal(D). [resolve(55,b,49,a)].
% 0.46/1.03 Derived: -send_message(A,B,C,D,E) | subactivity(f13(E,D),E). [resolve(55,b,52,a)].
% 0.46/1.03 Derived: -send_message(A,B,C,D,E) | atocc(D,f13(E,D)). [resolve(55,b,53,a)].
% 0.46/1.03 56 -occurrence_of(A,B) | atomic(B) | root(f14(B,A),B) # label(sos_30) # label(axiom). [clausify(31)].
% 0.46/1.03 Derived: -occurrence_of(A,B) | atomic(B) | -min_precedes(C,f14(B,A),B). [resolve(56,c,48,b)].
% 0.46/1.03 Derived: -occurrence_of(A,B) | atomic(B) | legal(f14(B,A)). [resolve(56,c,49,a)].
% 0.46/1.03 Derived: -occurrence_of(A,B) | atomic(B) | subactivity(f13(B,f14(B,A)),B). [resolve(56,c,52,a)].
% 0.46/1.03 Derived: -occurrence_of(A,B) | atomic(B) | atocc(f14(B,A),f13(B,f14(B,A))). [resolve(56,c,53,a)].
% 0.46/1.03 57 root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -root(A,C) # label(sos_10) # label(axiom). [clausify(11)].
% 0.46/1.03 Derived: root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -tptp1(D,C,A). [resolve(57,d,47,b)].
% 0.46/1.03 Derived: root_occ(A,B) | -occurrence_of(B,f2(A,C)) | -subactivity_occurrence(A,B) | -root_occ(A,C). [resolve(57,d,50,b)].
% 0.46/1.03 Derived: root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -atocc(A,C) | -legal(A). [resolve(57,d,51,c)].
% 0.46/1.03 Derived: root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -send_message(D,A,C,E,F). [resolve(57,d,54,b)].
% 0.46/1.03 Derived: root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -send_message(D,E,F,A,C). [resolve(57,d,55,b)].
% 0.46/1.03 Derived: root_occ(f14(A,B),C) | -occurrence_of(C,A) | -subactivity_occurrence(f14(A,B),C) | -occurrence_of(B,A) | atomic(A). [resolve(57,d,56,c)].
% 0.46/1.03 58 -leaf(A,B) | root(A,B) | min_precedes(f4(A,B),A,B) # label(sos_14) # label(axiom). [clausify(15)].
% 0.46/1.03 Derived: -leaf(A,B) | min_precedes(f4(A,B),A,B) | -min_precedes(C,A,B). [resolve(58,b,48,b)].
% 0.46/1.03 Derived: -leaf(A,B) | min_precedes(f4(A,B),A,B) | legal(A). [resolve(58,b,49,a)].
% 0.46/1.03 Derived: -leaf(A,B) | min_precedes(f4(A,B),A,B) | subactivity(f13(B,A),B). [resolve(58,b,52,a)].
% 0.46/1.03 Derived: -leaf(A,B) | min_precedes(f4(A,B),A,B) | atocc(A,f13(B,A)). [resolve(58,b,53,a)].
% 0.46/1.03 Derived: -leaf(A,B) | min_precedes(f4(A,B),A,B) | root_occ(A,C) | -occurrence_of(C,B) | -subactivity_occurrence(A,C). [resolve(58,b,57,d)].
% 0.46/1.03 59 leaf(A,B) | -root(A,B) | min_precedes(A,f5(A,B),B) # label(sos_14) # label(axiom). [clausify(15)].
% 0.46/1.03 Derived: leaf(A,B) | min_precedes(A,f5(A,B),B) | -tptp1(C,B,A). [resolve(59,b,47,b)].
% 0.46/1.03 Derived: leaf(A,f2(A,B)) | min_precedes(A,f5(A,f2(A,B)),f2(A,B)) | -root_occ(A,B). [resolve(59,b,50,b)].
% 0.46/1.03 Derived: leaf(A,B) | min_precedes(A,f5(A,B),B) | -atocc(A,B) | -legal(A). [resolve(59,b,51,c)].
% 0.46/1.03 Derived: leaf(A,B) | min_precedes(A,f5(A,B),B) | -send_message(C,A,B,D,E). [resolve(59,b,54,b)].
% 0.46/1.03 Derived: leaf(A,B) | min_precedes(A,f5(A,B),B) | -send_message(C,D,E,A,B). [resolve(59,b,55,b)].
% 0.46/1.03 Derived: leaf(f14(A,B),A) | min_precedes(f14(A,B),f5(f14(A,B),A),A) | -occurrence_of(B,A) | atomic(A). [resolve(59,b,56,c)].
% 0.46/1.03 60 -leaf_occ(A,B) | leaf(A,f3(A,B)) # label(sos_11) # label(axiom). [clausify(12)].
% 0.46/1.03 61 -leaf(A,B) | -min_precedes(A,C,B) # label(sos_14) # label(axiom). [clausify(15)].
% 0.46/1.03 Derived: -leaf_occ(A,B) | -min_precedes(A,C,f3(A,B)). [resolve(60,b,61,a)].
% 0.46/1.03 62 -leaf(A,B) | atomic(B) | occurrence_of(f8(A,B),B) # label(sos_23) # label(axiom). [clausify(24)].
% 0.46/1.03 Derived: atomic(f3(A,B)) | occurrence_of(f8(A,f3(A,B)),f3(A,B)) | -leaf_occ(A,B). [resolve(62,a,60,b)].
% 0.46/1.03 63 -leaf(A,B) | atomic(B) | leaf_occ(A,f8(A,B)) # label(sos_23) # label(axiom). [clausify(24)].
% 0.46/1.03 Derived: atomic(f3(A,B)) | leaf_occ(A,f8(A,f3(A,B))) | -leaf_occ(A,B). [resolve(63,a,60,b)].
% 0.46/1.03 64 -leaf(A,B) | atomic(B) | occurrence_of(f10(A,B),B) # label(sos_25) # label(axiom). [clausify(26)].
% 0.46/1.03 Derived: atomic(f3(A,B)) | occurrence_of(f10(A,f3(A,B)),f3(A,B)) | -leaf_occ(A,B). [resolve(64,a,60,b)].
% 0.46/1.03 65 -leaf(A,B) | atomic(B) | leaf_occ(A,f10(A,B)) # label(sos_25) # label(axiom). [clausify(26)].
% 0.46/1.03 Derived: atomic(f3(A,B)) | leaf_occ(A,f10(A,f3(A,B))) | -leaf_occ(A,B). [resolve(65,a,60,b)].
% 0.46/1.04 66 leaf_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -leaf(A,C) # label(sos_11) # label(axiom). [clausify(12)].
% 0.46/1.04 Derived: leaf_occ(A,B) | -occurrence_of(B,f3(A,C)) | -subactivity_occurrence(A,B) | -leaf_occ(A,C). [resolve(66,d,60,b)].
% 0.46/1.04 67 leaf(A,B) | -min_precedes(C,A,B) | min_precedes(A,f5(A,B),B) # label(sos_14) # label(axiom). [clausify(15)].
% 0.46/1.04 Derived: -min_precedes(A,B,C) | min_precedes(B,f5(B,C),C) | -min_precedes(B,D,C). [resolve(67,a,61,a)].
% 0.46/1.04 Derived: -min_precedes(A,B,C) | min_precedes(B,f5(B,C),C) | atomic(C) | occurrence_of(f8(B,C),C). [resolve(67,a,62,a)].
% 0.46/1.04 Derived: -min_precedes(A,B,C) | min_precedes(B,f5(B,C),C) | atomic(C) | leaf_occ(B,f8(B,C)). [resolve(67,a,63,a)].
% 0.46/1.04 Derived: -min_precedes(A,B,C) | min_precedes(B,f5(B,C),C) | atomic(C) | occurrence_of(f10(B,C),C). [resolve(67,a,64,a)].
% 0.46/1.04 Derived: -min_precedes(A,B,C) | min_precedes(B,f5(B,C),C) | atomic(C) | leaf_occ(B,f10(B,C)). [resolve(67,a,65,a)].
% 0.46/1.04 Derived: -min_precedes(A,B,C) | min_precedes(B,f5(B,C),C) | leaf_occ(B,D) | -occurrence_of(D,C) | -subactivity_occurrence(B,D). [resolve(67,a,66,d)].
% 0.46/1.04 68 -leaf(A,B) | min_precedes(f4(A,B),A,B) | -min_precedes(C,A,B). [resolve(58,b,48,b)].
% 0.46/1.04 Derived: min_precedes(f4(A,f3(A,B)),A,f3(A,B)) | -min_precedes(C,A,f3(A,B)) | -leaf_occ(A,B). [resolve(68,a,60,b)].
% 0.46/1.04 Derived: min_precedes(f4(A,B),A,B) | -min_precedes(C,A,B) | -min_precedes(D,A,B) | min_precedes(A,f5(A,B),B). [resolve(68,a,67,a)].
% 0.46/1.04 69 -leaf(A,B) | min_precedes(f4(A,B),A,B) | legal(A). [resolve(58,b,49,a)].
% 0.46/1.04 Derived: min_precedes(f4(A,f3(A,B)),A,f3(A,B)) | legal(A) | -leaf_occ(A,B). [resolve(69,a,60,b)].
% 0.46/1.04 70 -leaf(A,B) | min_precedes(f4(A,B),A,B) | subactivity(f13(B,A),B). [resolve(58,b,52,a)].
% 0.46/1.04 Derived: min_precedes(f4(A,f3(A,B)),A,f3(A,B)) | subactivity(f13(f3(A,B),A),f3(A,B)) | -leaf_occ(A,B). [resolve(70,a,60,b)].
% 0.46/1.04 71 -leaf(A,B) | min_precedes(f4(A,B),A,B) | atocc(A,f13(B,A)). [resolve(58,b,53,a)].
% 0.46/1.04 Derived: min_precedes(f4(A,f3(A,B)),A,f3(A,B)) | atocc(A,f13(f3(A,B),A)) | -leaf_occ(A,B). [resolve(71,a,60,b)].
% 0.46/1.04 72 -leaf(A,B) | min_precedes(f4(A,B),A,B) | root_occ(A,C) | -occurrence_of(C,B) | -subactivity_occurrence(A,C). [resolve(58,b,57,d)].
% 0.46/1.04 Derived: min_precedes(f4(A,f3(A,B)),A,f3(A,B)) | root_occ(A,C) | -occurrence_of(C,f3(A,B)) | -subactivity_occurrence(A,C) | -leaf_occ(A,B). [resolve(72,a,60,b)].
% 0.46/1.04 73 leaf(A,B) | min_precedes(A,f5(A,B),B) | -tptp1(C,B,A). [resolve(59,b,47,b)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,B),B) | -tptp1(C,B,A) | -min_precedes(A,D,B). [resolve(73,a,61,a)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,B),B) | -tptp1(C,B,A) | atomic(B) | occurrence_of(f8(A,B),B). [resolve(73,a,62,a)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,B),B) | -tptp1(C,B,A) | atomic(B) | leaf_occ(A,f8(A,B)). [resolve(73,a,63,a)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,B),B) | -tptp1(C,B,A) | atomic(B) | occurrence_of(f10(A,B),B). [resolve(73,a,64,a)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,B),B) | -tptp1(C,B,A) | atomic(B) | leaf_occ(A,f10(A,B)). [resolve(73,a,65,a)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,B),B) | -tptp1(C,B,A) | leaf_occ(A,D) | -occurrence_of(D,B) | -subactivity_occurrence(A,D). [resolve(73,a,66,d)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,B),B) | -tptp1(C,B,A) | min_precedes(f4(A,B),A,B) | legal(A). [resolve(73,a,69,a)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,B),B) | -tptp1(C,B,A) | min_precedes(f4(A,B),A,B) | subactivity(f13(B,A),B). [resolve(73,a,70,a)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,B),B) | -tptp1(C,B,A) | min_precedes(f4(A,B),A,B) | atocc(A,f13(B,A)). [resolve(73,a,71,a)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,B),B) | -tptp1(C,B,A) | min_precedes(f4(A,B),A,B) | root_occ(A,D) | -occurrence_of(D,B) | -subactivity_occurrence(A,D). [resolve(73,a,72,a)].
% 0.46/1.04 74 leaf(A,f2(A,B)) | min_precedes(A,f5(A,f2(A,B)),f2(A,B)) | -root_occ(A,B). [resolve(59,b,50,b)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,f2(A,B)),f2(A,B)) | -root_occ(A,B) | -min_precedes(A,C,f2(A,B)). [resolve(74,a,61,a)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,f2(A,B)),f2(A,B)) | -root_occ(A,B) | atomic(f2(A,B)) | occurrence_of(f8(A,f2(A,B)),f2(A,B)). [resolve(74,a,62,a)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,f2(A,B)),f2(A,B)) | -root_occ(A,B) | atomic(f2(A,B)) | leaf_occ(A,f8(A,f2(A,B))). [resolve(74,a,63,a)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,f2(A,B)),f2(A,B)) | -root_occ(A,B) | atomic(f2(A,B)) | occurrence_of(f10(A,f2(A,B)),f2(A,B)). [resolve(74,a,64,a)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,f2(A,B)),f2(A,B)) | -root_occ(A,B) | atomic(f2(A,B)) | leaf_occ(A,f10(A,f2(A,B))). [resolve(74,a,65,a)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,f2(A,B)),f2(A,B)) | -root_occ(A,B) | leaf_occ(A,C) | -occurrence_of(C,f2(A,B)) | -subactivity_occurrence(A,C). [resolve(74,a,66,d)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,f2(A,B)),f2(A,B)) | -root_occ(A,B) | min_precedes(f4(A,f2(A,B)),A,f2(A,B)) | legal(A). [resolve(74,a,69,a)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,f2(A,B)),f2(A,B)) | -root_occ(A,B) | min_precedes(f4(A,f2(A,B)),A,f2(A,B)) | subactivity(f13(f2(A,B),A),f2(A,B)). [resolve(74,a,70,a)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,f2(A,B)),f2(A,B)) | -root_occ(A,B) | min_precedes(f4(A,f2(A,B)),A,f2(A,B)) | atocc(A,f13(f2(A,B),A)). [resolve(74,a,71,a)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,f2(A,B)),f2(A,B)) | -root_occ(A,B) | min_precedes(f4(A,f2(A,B)),A,f2(A,B)) | root_occ(A,C) | -occurrence_of(C,f2(A,B)) | -subactivity_occurrence(A,C). [resolve(74,a,72,a)].
% 0.46/1.04 75 leaf(A,B) | min_precedes(A,f5(A,B),B) | -atocc(A,B) | -legal(A). [resolve(59,b,51,c)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | -legal(A) | -min_precedes(A,C,B). [resolve(75,a,61,a)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | -legal(A) | atomic(B) | occurrence_of(f8(A,B),B). [resolve(75,a,62,a)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | -legal(A) | atomic(B) | leaf_occ(A,f8(A,B)). [resolve(75,a,63,a)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | -legal(A) | atomic(B) | occurrence_of(f10(A,B),B). [resolve(75,a,64,a)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | -legal(A) | atomic(B) | leaf_occ(A,f10(A,B)). [resolve(75,a,65,a)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | -legal(A) | leaf_occ(A,C) | -occurrence_of(C,B) | -subactivity_occurrence(A,C). [resolve(75,a,66,d)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | -legal(A) | min_precedes(f4(A,B),A,B) | subactivity(f13(B,A),B). [resolve(75,a,70,a)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | -legal(A) | min_precedes(f4(A,B),A,B) | atocc(A,f13(B,A)). [resolve(75,a,71,a)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | -legal(A) | min_precedes(f4(A,B),A,B) | root_occ(A,C) | -occurrence_of(C,B) | -subactivity_occurrence(A,C). [resolve(75,a,72,a)].
% 0.46/1.04 76 leaf(A,B) | min_precedes(A,f5(A,B),B) | -send_message(C,A,B,D,E). [resolve(59,b,54,b)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,B),B) | -send_message(C,A,B,D,E) | -min_precedes(A,F,B). [resolve(76,a,61,a)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,B),B) | -send_message(C,A,B,D,E) | atomic(B) | occurrence_of(f8(A,B),B). [resolve(76,a,62,a)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,B),B) | -send_message(C,A,B,D,E) | atomic(B) | leaf_occ(A,f8(A,B)). [resolve(76,a,63,a)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,B),B) | -send_message(C,A,B,D,E) | atomic(B) | occurrence_of(f10(A,B),B). [resolve(76,a,64,a)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,B),B) | -send_message(C,A,B,D,E) | atomic(B) | leaf_occ(A,f10(A,B)). [resolve(76,a,65,a)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,B),B) | -send_message(C,A,B,D,E) | leaf_occ(A,F) | -occurrence_of(F,B) | -subactivity_occurrence(A,F). [resolve(76,a,66,d)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,B),B) | -send_message(C,A,B,D,E) | min_precedes(f4(A,B),A,B) | legal(A). [resolve(76,a,69,a)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,B),B) | -send_message(C,A,B,D,E) | min_precedes(f4(A,B),A,B) | subactivity(f13(B,A),B). [resolve(76,a,70,a)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,B),B) | -send_message(C,A,B,D,E) | min_precedes(f4(A,B),A,B) | atocc(A,f13(B,A)). [resolve(76,a,71,a)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,B),B) | -send_message(C,A,B,D,E) | min_precedes(f4(A,B),A,B) | root_occ(A,F) | -occurrence_of(F,B) | -subactivity_occurrence(A,F). [resolve(76,a,72,a)].
% 0.46/1.04 77 leaf(A,B) | min_precedes(A,f5(A,B),B) | -send_message(C,D,E,A,B). [resolve(59,b,55,b)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,B),B) | -send_message(C,D,E,A,B) | -min_precedes(A,F,B). [resolve(77,a,61,a)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,B),B) | -send_message(C,D,E,A,B) | atomic(B) | occurrence_of(f8(A,B),B). [resolve(77,a,62,a)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,B),B) | -send_message(C,D,E,A,B) | atomic(B) | leaf_occ(A,f8(A,B)). [resolve(77,a,63,a)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,B),B) | -send_message(C,D,E,A,B) | atomic(B) | occurrence_of(f10(A,B),B). [resolve(77,a,64,a)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,B),B) | -send_message(C,D,E,A,B) | atomic(B) | leaf_occ(A,f10(A,B)). [resolve(77,a,65,a)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,B),B) | -send_message(C,D,E,A,B) | leaf_occ(A,F) | -occurrence_of(F,B) | -subactivity_occurrence(A,F). [resolve(77,a,66,d)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,B),B) | -send_message(C,D,E,A,B) | min_precedes(f4(A,B),A,B) | legal(A). [resolve(77,a,69,a)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,B),B) | -send_message(C,D,E,A,B) | min_precedes(f4(A,B),A,B) | subactivity(f13(B,A),B). [resolve(77,a,70,a)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,B),B) | -send_message(C,D,E,A,B) | min_precedes(f4(A,B),A,B) | atocc(A,f13(B,A)). [resolve(77,a,71,a)].
% 0.46/1.04 Derived: min_precedes(A,f5(A,B),B) | -send_message(C,D,E,A,B) | min_precedes(f4(A,B),A,B) | root_occ(A,F) | -occurrence_of(F,B) | -subactivity_occurrence(A,F). [resolve(77,a,72,a)].
% 0.46/1.04 78 leaf(f14(A,B),A) | min_precedes(f14(A,B),f5(f14(A,B),A),A) | -occurrence_of(B,A) | atomic(A). [resolve(59,b,56,c)].
% 0.46/1.04 Derived: min_precedes(f14(A,B),f5(f14(A,B),A),A) | -occurrence_of(B,A) | atomic(A) | -min_precedes(f14(A,B),C,A). [resolve(78,a,61,a)].
% 0.46/1.04 Derived: min_precedes(f14(A,B),f5(f14(A,B),A),A) | -occurrence_of(B,A) | atomic(A) | atomic(A) | occurrence_of(f8(f14(A,B),A),A). [resolve(78,a,62,a)].
% 0.46/1.04 Derived: min_precedes(f14(A,B),f5(f14(A,B),A),A) | -occurrence_of(B,A) | atomic(A) | atomic(A) | leaf_occ(f14(A,B),f8(f14(A,B),A)). [resolve(78,a,63,a)].
% 0.46/1.04 Derived: min_precedes(f14(A,B),f5(f14(A,B),A),A) | -occurrence_of(B,A) | atomic(A) | atomic(A) | occurrence_of(f10(f14(A,B),A),A). [resolve(78,a,64,a)].
% 0.46/1.04 Derived: min_precedes(f14(A,B),f5(f14(A,B),A),A) | -occurrence_of(B,A) | atomic(A) | atomic(A) | leaf_occ(f14(A,B),f10(f14(A,B),A)). [resolve(78,a,65,a)].
% 0.46/1.04 Derived: min_precedes(f14(A,B),f5(f14(A,B),A),A) | -occurrence_of(B,A) | atomic(A) | leaf_occ(f14(A,B),C) | -occurrence_of(C,A) | -subactivity_occurrence(f14(A,B),C). [resolve(78,a,66,d)].
% 0.46/1.04 Derived: min_precedes(f14(A,B),f5(f14(A,B),A),A) | -occurrence_of(B,A) | atomic(A) | min_precedes(f4(f14(A,B),A),f14(A,B),A) | legal(f14(A,B)). [resolve(78,a,69,a)].
% 0.46/1.04 Derived: min_precedes(f14(A,B),f5(f14(A,B),A),A) | -occurrence_of(B,A) | atomic(A) | min_precedes(f4(f14(A,B),A),f14(A,B),A) | subactivity(f13(A,f14(A,B)),A). [resolve(78,a,70,a)].
% 0.46/1.04 Derived: min_precedes(f14(A,B),f5(f14(A,B),A),A) | -occurrence_of(B,A) | atomic(A) | min_precedes(f4(f14(A,B),A),f14(A,B),A) | atocc(f14(A,B),f13(A,f14(A,B))). [resolve(78,a,71,a)].
% 0.46/1.04 Derived: min_precedes(f14(A,B),f5(f14(A,B),A),A) | -occurrence_of(B,A) | atomic(A) | min_precedes(f4(f14(A,B),A),f14(A,B),A) | root_occ(f14(A,B),C) | -occurrence_of(C,A) | -subactivity_occurrence(f14(A,B),C). [resolve(78,a,72,a)].
% 0.46/1.04 79 -tptp1(A,B,C) | -occurrence_of(D,A) | send_message(f17(A,B,C,D),f18(A,B,C,D),f19(A,B,C,D),C,B) # label(sos_49) # label(axiom). [clausify(38)].
% 0.46/1.04 80 -send_message(A,B,C,D,E) | A != tptp4 # label(sos_46) # label(axiom). [clausify(35)].
% 0.46/1.04 81 -send_message(A,B,C,D,E) | A != tptp3 # label(sos_46) # label(axiom). [clausify(35)].
% 0.46/1.04 82 -send_message(A,B,C,D,E) | A != tptp2 # label(sos_46) # label(axiom). [clausify(35)].
% 0.46/1.04 83 -send_message(A,B,C,D,E) | atomic(A) # label(sos_45) # label(axiom). [clausify(34)].
% 0.46/1.04 84 -send_message(A,B,C,D,E) | -occurrence_of(F,A) | min_precedes(D,F,E) # label(sos_47) # label(axiom). [clausify(36)].
% 0.46/1.04 Derived: -tptp1(A,B,C) | -occurrence_of(D,A) | f17(A,B,C,D) != tptp4. [resolve(79,c,80,a)].
% 0.46/1.04 Derived: -tptp1(A,B,C) | -occurrence_of(D,A) | f17(A,B,C,D) != tptp3. [resolve(79,c,81,a)].
% 0.46/1.04 Derived: -tptp1(A,B,C) | -occurrence_of(D,A) | f17(A,B,C,D) != tptp2. [resolve(79,c,82,a)].
% 0.46/1.04 Derived: -tptp1(A,B,C) | -occurrence_of(D,A) | atomic(f17(A,B,C,D)). [resolve(79,c,83,a)].
% 0.46/1.04 Derived: -tptp1(A,B,C) | -occurrence_of(D,A) | -occurrence_of(E,f17(A,B,C,D)) | min_precedes(C,E,B). [resolve(79,c,84,a)].
% 0.46/1.04 85 -send_message(A,B,C,D,E) | subactivity(A,A). [resolve(46,b,41,a)].
% 0.46/1.04 Derived: subactivity(f17(A,B,C,D),f17(A,B,C,D)) | -tptp1(A,B,C) | -occurrence_of(D,A). [resolve(85,a,79,c)].
% 0.46/1.04 86 -send_message(A,B,C,D,E) | -min_precedes(F,B,C). [resolve(54,b,48,b)].
% 0.46/1.04 Derived: -min_precedes(A,f18(B,C,D,E),f19(B,C,D,E)) | -tptp1(B,C,D) | -occurrence_of(E,B). [resolve(86,a,79,c)].
% 0.46/1.04 87 -send_message(A,B,C,D,E) | legal(B). [resolve(54,b,49,a)].
% 0.46/1.04 Derived: legal(f18(A,B,C,D)) | -tptp1(A,B,C) | -occurrence_of(D,A). [resolve(87,a,79,c)].
% 0.46/1.04 88 -send_message(A,B,C,D,E) | subactivity(f13(C,B),C). [resolve(54,b,52,a)].
% 0.46/1.04 Derived: subactivity(f13(f19(A,B,C,D),f18(A,B,C,D)),f19(A,B,C,D)) | -tptp1(A,B,C) | -occurrence_of(D,A). [resolve(88,a,79,c)].
% 0.46/1.04 89 -send_message(A,B,C,D,E) | atocc(B,f13(C,B)). [resolve(54,b,53,a)].
% 0.46/1.04 Derived: atocc(f18(A,B,C,D),f13(f19(A,B,C,D),f18(A,B,C,D))) | -tptp1(A,B,C) | -occurrence_of(D,A). [resolve(89,a,79,c)].
% 0.46/1.04 90 -send_message(A,B,C,D,E) | -min_precedes(F,D,E). [resolve(55,b,48,b)].
% 0.46/1.04 Derived: -min_precedes(A,B,C) | -tptp1(D,C,B) | -occurrence_of(E,D). [resolve(90,a,79,c)].
% 0.46/1.04 91 -send_message(A,B,C,D,E) | legal(D). [resolve(55,b,49,a)].
% 0.46/1.04 Derived: legal(A) | -tptp1(B,C,A) | -occurrence_of(D,B). [resolve(91,a,79,c)].
% 0.46/1.04 92 -send_message(A,B,C,D,E) | subactivity(f13(E,D),E). [resolve(55,b,52,a)].
% 0.46/1.04 Derived: subactivity(f13(A,B),A) | -tptp1(C,A,B) | -occurrence_of(D,C). [resolve(92,a,79,c)].
% 0.46/1.04 93 -send_message(A,B,C,D,E) | atocc(D,f13(E,D)). [resolve(55,b,53,a)].
% 0.46/1.04 Derived: atocc(A,f13(B,A)) | -tptp1(C,B,A) | -occurrence_of(D,C). [resolve(93,a,79,c)].
% 0.46/1.04 94 root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -send_message(D,A,C,E,F). [resolve(57,d,54,b)].
% 0.46/1.04 Derived: root_occ(f18(A,B,C,D),E) | -occurrence_of(E,f19(A,B,C,D)) | -subactivity_occurrence(f18(A,B,C,D),E) | -tptp1(A,B,C) | -occurrence_of(D,A). [resolve(94,d,79,c)].
% 0.46/1.04 95 root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -send_message(D,E,F,A,C). [resolve(57,d,55,b)].
% 0.46/1.04 Derived: root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -tptp1(D,C,A) | -occurrence_of(E,D). [resolve(95,d,79,c)].
% 0.46/1.04 96 min_precedes(A,f5(A,B),B) | -send_message(C,A,B,D,E) | -min_precedes(A,F,B). [resolve(76,a,61,a)].
% 0.46/1.04 Derived: min_precedes(f18(A,B,C,D),f5(f18(A,B,C,D),f19(A,B,C,D)),f19(A,B,C,D)) | -min_precedes(f18(A,B,C,D),E,f19(A,B,C,D)) | -tptp1(A,B,C) | -occurrence_of(D,A). [resolve(96,b,79,c)].
% 0.46/1.04 97 min_precedes(A,f5(A,B),B) | -send_message(C,A,B,D,E) | atomic(B) | occurrence_of(f8(A,B),B). [resolve(76,a,62,a)].
% 0.46/1.04 Derived: min_precedes(f18(A,B,C,D),f5(f18(A,B,C,D),f19(A,B,C,D)),f19(A,B,C,D)) | atomic(f19(A,B,C,D)) | occurrence_of(f8(f18(A,B,C,D),f19(A,B,C,D)),f19(A,B,C,D)) | -tptp1(A,B,C) | -occurrence_of(D,A). [resolve(97,b,79,c)].
% 0.46/1.04 98 min_precedes(A,f5(A,B),B) | -send_message(C,A,B,D,E) | atomic(B) | leaf_occ(A,f8(A,B)). [resolve(76,a,63,a)].
% 0.46/1.04 Derived: min_precedes(f18(A,B,C,D),f5(f18(A,B,C,D),f19(A,B,C,D)),f19(A,B,C,D)) | atomic(f19(A,B,C,D)) | leaf_occ(f18(A,B,C,D),f8(f18(A,B,C,D),f19(A,B,C,D))) | -tptp1(A,B,C) | -occurrence_of(D,A). [resolve(98,b,79,c)].
% 0.46/1.04 99 min_precedes(A,f5(A,B),B) | -send_message(C,A,B,D,E) | atomic(B) | occurrence_of(f10(A,B),B). [resolve(76,a,64,a)].
% 0.46/1.04 Derived: min_precedes(f18(A,B,C,D),f5(f18(A,B,C,D),f19(A,B,C,D)),f19(A,B,C,D)) | atomic(f19(A,B,C,D)) | occurrence_of(f10(f18(A,B,C,D),f19(A,B,C,D)),f19(A,B,C,D)) | -tptp1(A,B,C) | -occurrence_of(D,A). [resolve(99,b,79,c)].
% 0.46/1.04 100 min_precedes(A,f5(A,B),B) | -send_message(C,A,B,D,E) | atomic(B) | leaf_occ(A,f10(A,B)). [resolve(76,a,65,a)].
% 0.46/1.04 Derived: min_precedes(f18(A,B,C,D),f5(f18(A,B,C,D),f19(A,B,C,D)),f19(A,B,C,D)) | atomic(f19(A,B,C,D)) | leaf_occ(f18(A,B,C,D),f10(f18(A,B,C,D),f19(A,B,C,D))) | -tptp1(A,B,C) | -occurrence_of(D,A). [resolve(100,b,79,c)].
% 0.46/1.04 101 min_precedes(A,f5(A,B),B) | -send_message(C,A,B,D,E) | leaf_occ(A,F) | -occurrence_of(F,B) | -subactivity_occurrence(A,F). [resolve(76,a,66,d)].
% 0.46/1.04 Derived: min_precedes(f18(A,B,C,D),f5(f18(A,B,C,D),f19(A,B,C,D)),f19(A,B,C,D)) | leaf_occ(f18(A,B,C,D),E) | -occurrence_of(E,f19(A,B,C,D)) | -subactivity_occurrence(f18(A,B,C,D),E) | -tptp1(A,B,C) | -occurrence_of(D,A). [resolve(101,b,79,c)].
% 0.46/1.05 102 min_precedes(A,f5(A,B),B) | -send_message(C,A,B,D,E) | min_precedes(f4(A,B),A,B) | legal(A). [resolve(76,a,69,a)].
% 0.46/1.05 103 min_precedes(A,f5(A,B),B) | -send_message(C,A,B,D,E) | min_precedes(f4(A,B),A,B) | subactivity(f13(B,A),B). [resolve(76,a,70,a)].
% 0.46/1.05 104 min_precedes(A,f5(A,B),B) | -send_message(C,A,B,D,E) | min_precedes(f4(A,B),A,B) | atocc(A,f13(B,A)). [resolve(76,a,71,a)].
% 0.46/1.05 105 min_precedes(A,f5(A,B),B) | -send_message(C,A,B,D,E) | min_precedes(f4(A,B),A,B) | root_occ(A,F) | -occurrence_of(F,B) | -subactivity_occurrence(A,F). [resolve(76,a,72,a)].
% 0.46/1.05 106 min_precedes(A,f5(A,B),B) | -send_message(C,D,E,A,B) | -min_precedes(A,F,B). [resolve(77,a,61,a)].
% 0.46/1.05 Derived: min_precedes(A,f5(A,B),B) | -min_precedes(A,C,B) | -tptp1(D,B,A) | -occurrence_of(E,D). [resolve(106,b,79,c)].
% 0.46/1.05 107 min_precedes(A,f5(A,B),B) | -send_message(C,D,E,A,B) | atomic(B) | occurrence_of(f8(A,B),B). [resolve(77,a,62,a)].
% 0.46/1.05 Derived: min_precedes(A,f5(A,B),B) | atomic(B) | occurrence_of(f8(A,B),B) | -tptp1(C,B,A) | -occurrence_of(D,C). [resolve(107,b,79,c)].
% 0.46/1.05 108 min_precedes(A,f5(A,B),B) | -send_message(C,D,E,A,B) | atomic(B) | leaf_occ(A,f8(A,B)). [resolve(77,a,63,a)].
% 0.46/1.05 Derived: min_precedes(A,f5(A,B),B) | atomic(B) | leaf_occ(A,f8(A,B)) | -tptp1(C,B,A) | -occurrence_of(D,C). [resolve(108,b,79,c)].
% 0.46/1.05 109 min_precedes(A,f5(A,B),B) | -send_message(C,D,E,A,B) | atomic(B) | occurrence_of(f10(A,B),B). [resolve(77,a,64,a)].
% 0.46/1.05 Derived: min_precedes(A,f5(A,B),B) | atomic(B) | occurrence_of(f10(A,B),B) | -tptp1(C,B,A) | -occurrence_of(D,C). [resolve(109,b,79,c)].
% 0.46/1.05 110 min_precedes(A,f5(A,B),B) | -send_message(C,D,E,A,B) | atomic(B) | leaf_occ(A,f10(A,B)). [resolve(77,a,65,a)].
% 0.46/1.05 Derived: min_precedes(A,f5(A,B),B) | atomic(B) | leaf_occ(A,f10(A,B)) | -tptp1(C,B,A) | -occurrence_of(D,C). [resolve(110,b,79,c)].
% 0.46/1.05 111 min_precedes(A,f5(A,B),B) | -send_message(C,D,E,A,B) | leaf_occ(A,F) | -occurrence_of(F,B) | -subactivity_occurrence(A,F). [resolve(77,a,66,d)].
% 0.46/1.05 Derived: min_precedes(A,f5(A,B),B) | leaf_occ(A,C) | -occurrence_of(C,B) | -subactivity_occurrence(A,C) | -tptp1(D,B,A) | -occurrence_of(E,D). [resolve(111,b,79,c)].
% 0.46/1.05 112 min_precedes(A,f5(A,B),B) | -send_message(C,D,E,A,B) | min_precedes(f4(A,B),A,B) | legal(A). [resolve(77,a,69,a)].
% 0.46/1.05 113 min_precedes(A,f5(A,B),B) | -send_message(C,D,E,A,B) | min_precedes(f4(A,B),A,B) | subactivity(f13(B,A),B). [resolve(77,a,70,a)].
% 0.46/1.05 114 min_precedes(A,f5(A,B),B) | -send_message(C,D,E,A,B) | min_precedes(f4(A,B),A,B) | atocc(A,f13(B,A)). [resolve(77,a,71,a)].
% 0.46/1.05 115 min_precedes(A,f5(A,B),B) | -send_message(C,D,E,A,B) | min_precedes(f4(A,B),A,B) | root_occ(A,F) | -occurrence_of(F,B) | -subactivity_occurrence(A,F). [resolve(77,a,72,a)].
% 0.46/1.05 116 -occurrence_of(A,tptp0) | next_subocc(f15(A),f16(A),tptp0) # label(sos_32) # label(axiom). [clausify(33)].
% 0.46/1.05 117 -next_subocc(A,B,C) | -min_precedes(A,D,C) | -min_precedes(D,B,C) # label(sos_04) # label(axiom). [clausify(5)].
% 0.46/1.05 118 -next_subocc(A,B,C) | arboreal(A) # label(sos_05) # label(axiom). [clausify(6)].
% 0.46/1.05 119 -next_subocc(A,B,C) | arboreal(B) # label(sos_05) # label(axiom). [clausify(6)].
% 0.46/1.05 120 -next_subocc(A,B,C) | min_precedes(A,B,C) # label(sos_04) # label(axiom). [clausify(5)].
% 0.46/1.05 Derived: -occurrence_of(A,tptp0) | -min_precedes(f15(A),B,tptp0) | -min_precedes(B,f16(A),tptp0). [resolve(116,b,117,a)].
% 0.46/1.05 Derived: -occurrence_of(A,tptp0) | arboreal(f15(A)). [resolve(116,b,118,a)].
% 0.46/1.05 Derived: -occurrence_of(A,tptp0) | arboreal(f16(A)). [resolve(116,b,119,a)].
% 0.46/1.05 Derived: -occurrence_of(A,tptp0) | min_precedes(f15(A),f16(A),tptp0). [resolve(116,b,120,a)].
% 0.46/1.05 121 next_subocc(A,B,C) | -min_precedes(A,B,C) | min_precedes(A,f1(A,B,C),C) # label(sos_04) # label(axiom). [clausify(5)].
% 0.46/1.05 Derived: -min_precedes(A,B,C) | min_precedes(A,f1(A,B,C),C) | -min_precedes(A,D,C) | -min_precedes(D,B,C). [resolve(121,a,117,a)].
% 0.46/1.05 Derived: -min_precedes(A,B,C) | min_precedes(A,f1(A,B,C),C) | arboreal(A). [resolve(121,a,118,a)].
% 0.46/1.05 Derived: -min_precedes(A,B,C) | min_precedes(A,f1(A,B,C),C) | arboreal(B). [resolve(121,a,119,a)].
% 0.46/1.05 122 next_subocc(A,B,C) | -min_precedes(A,B,C) | min_precedes(f1(A,B,C),B,C) # label(sos_04) # label(axiom). [clausify(5)].
% 0.46/1.05 Derived: -min_precedes(A,B,C) | min_precedes(f1(A,B,C),B,C) | -min_precedes(A,D,C) | -min_precedes(D,B,C). [resolve(122,a,117,a)].
% 0.46/1.05 Derived: -min_precedes(A,B,C) | min_precedes(f1(A,B,C),B,C) | arboreal(A). [resolve(122,a,118,a)].
% 0.46/1.05 Derived: -min_precedes(A,B,C) | min_precedes(f1(A,B,C),B,C) | arboreal(B). [resolve(122,a,119,a)].
% 0.46/1.05 123 -precedes(A,B) | legal(B) # label(sos_08) # label(axiom). [clausify(9)].
% 0.46/1.05 124 -legal(A) | arboreal(A) # label(sos_17) # label(axiom). [clausify(18)].
% 0.46/1.05 Derived: -precedes(A,B) | arboreal(B). [resolve(123,b,124,a)].
% 0.46/1.05 125 precedes(A,B) | -earlier(A,B) | -legal(B) # label(sos_08) # label(axiom). [clausify(9)].
% 0.46/1.05 Derived: precedes(A,B) | -earlier(A,B) | -precedes(C,B). [resolve(125,c,123,b)].
% 0.46/1.05 126 -tptp1(A,B,C) | legal(C). [resolve(47,b,49,a)].
% 0.46/1.05 Derived: -tptp1(A,B,C) | arboreal(C). [resolve(126,b,124,a)].
% 0.46/1.05 Derived: -tptp1(A,B,C) | precedes(D,C) | -earlier(D,C). [resolve(126,b,125,c)].
% 0.46/1.05 127 -root_occ(A,B) | legal(A). [resolve(50,b,49,a)].
% 0.46/1.05 Derived: -root_occ(A,B) | arboreal(A). [resolve(127,b,124,a)].
% 0.46/1.05 Derived: -root_occ(A,B) | precedes(C,A) | -earlier(C,A). [resolve(127,b,125,c)].
% 0.46/1.05 128 -atocc(A,B) | -legal(A) | -min_precedes(C,A,B). [resolve(51,c,48,b)].
% 0.46/1.05 Derived: -atocc(A,B) | -min_precedes(C,A,B) | -precedes(D,A). [resolve(128,b,123,b)].
% 0.46/1.05 Derived: -atocc(A,B) | -min_precedes(C,A,B) | -tptp1(D,E,A). [resolve(128,b,126,b)].
% 0.46/1.05 Derived: -atocc(A,B) | -min_precedes(C,A,B) | -root_occ(A,D). [resolve(128,b,127,b)].
% 0.46/1.05 129 subactivity(f13(A,B),A) | -atocc(B,A) | -legal(B). [resolve(52,a,51,c)].
% 0.46/1.05 Derived: subactivity(f13(A,B),A) | -atocc(B,A) | -precedes(C,B). [resolve(129,c,123,b)].
% 0.46/1.05 Derived: subactivity(f13(A,B),A) | -atocc(B,A) | -tptp1(C,D,B). [resolve(129,c,126,b)].
% 0.46/1.05 Derived: subactivity(f13(A,B),A) | -atocc(B,A) | -root_occ(B,C). [resolve(129,c,127,b)].
% 0.46/1.05 130 atocc(A,f13(B,A)) | -atocc(A,B) | -legal(A). [resolve(53,a,51,c)].
% 0.46/1.05 Derived: atocc(A,f13(B,A)) | -atocc(A,B) | -precedes(C,A). [resolve(130,c,123,b)].
% 0.46/1.05 Derived: atocc(A,f13(B,A)) | -atocc(A,B) | -tptp1(C,D,A). [resolve(130,c,126,b)].
% 0.46/1.05 Derived: atocc(A,f13(B,A)) | -atocc(A,B) | -root_occ(A,C). [resolve(130,c,127,b)].
% 0.46/1.05 131 -occurrence_of(A,B) | atomic(B) | legal(f14(B,A)). [resolve(56,c,49,a)].
% 0.46/1.05 Derived: -occurrence_of(A,B) | atomic(B) | arboreal(f14(B,A)). [resolve(131,c,124,a)].
% 0.46/1.05 Derived: -occurrence_of(A,B) | atomic(B) | precedes(C,f14(B,A)) | -earlier(C,f14(B,A)). [resolve(131,c,125,c)].
% 0.46/1.05 Derived: -occurrence_of(A,B) | atomic(B) | -atocc(f14(B,A),C) | -min_precedes(D,f14(B,A),C). [resolve(131,c,128,b)].
% 0.46/1.05 Derived: -occurrence_of(A,B) | atomic(B) | subactivity(f13(C,f14(B,A)),C) | -atocc(f14(B,A),C). [resolve(131,c,129,c)].
% 0.46/1.05 Derived: -occurrence_of(A,B) | atomic(B) | atocc(f14(B,A),f13(C,f14(B,A))) | -atocc(f14(B,A),C). [resolve(131,c,130,c)].
% 0.46/1.05 132 root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -atocc(A,C) | -legal(A). [resolve(57,d,51,c)].
% 0.46/1.05 Derived: root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -atocc(A,C) | -precedes(D,A). [resolve(132,e,123,b)].
% 0.46/1.05 Derived: root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -atocc(A,C) | -tptp1(D,E,A). [resolve(132,e,126,b)].
% 0.46/1.05 Derived: root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -atocc(A,C) | -root_occ(A,D). [resolve(132,e,127,b)].
% 0.46/1.05 Derived: root_occ(f14(A,B),C) | -occurrence_of(C,D) | -subactivity_occurrence(f14(A,B),C) | -atocc(f14(A,B),D) | -occurrence_of(B,A) | atomic(A). [resolve(132,e,131,c)].
% 0.46/1.05 133 min_precedes(f4(A,f3(A,B)),A,f3(A,B)) | legal(A) | -leaf_occ(A,B). [resolve(69,a,60,b)].
% 0.46/1.05 Derived: min_precedes(f4(A,f3(A,B)),A,f3(A,B)) | -leaf_occ(A,B) | arboreal(A). [resolve(133,b,124,a)].
% 0.46/1.05 Derived: min_precedes(f4(A,f3(A,B)),A,f3(A,B)) | -leaf_occ(A,B) | precedes(C,A) | -earlier(C,A). [resolve(133,b,125,c)].
% 0.46/1.05 Derived: min_precedes(f4(A,f3(A,B)),A,f3(A,B)) | -leaf_occ(A,B) | -atocc(A,C) | -min_precedes(D,A,C). [resolve(133,b,128,b)].
% 0.46/1.05 Derived: min_precedes(f4(A,f3(A,B)),A,f3(A,B)) | -leaf_occ(A,B) | subactivity(f13(C,A),C) | -atocc(A,C). [resolve(133,b,129,c)].
% 0.46/1.06 Derived: min_precedes(f4(A,f3(A,B)),A,f3(A,B)) | -leaf_occ(A,B) | atocc(A,f13(C,A)) | -atocc(A,C). [resolve(133,b,130,c)].
% 0.46/1.06 Derived: min_precedes(f4(A,f3(A,B)),A,f3(A,B)) | -leaf_occ(A,B) | root_occ(A,C) | -occurrence_of(C,D) | -subactivity_occurrence(A,C) | -atocc(A,D). [resolve(133,b,132,e)].
% 0.46/1.06 134 min_precedes(A,f5(A,B),B) | -tptp1(C,B,A) | min_precedes(f4(A,B),A,B) | legal(A). [resolve(73,a,69,a)].
% 0.46/1.06 135 min_precedes(A,f5(A,f2(A,B)),f2(A,B)) | -root_occ(A,B) | min_precedes(f4(A,f2(A,B)),A,f2(A,B)) | legal(A). [resolve(74,a,69,a)].
% 0.46/1.06 136 min_precedes(A,f5(A,B),B) | -atocc(A,B) | -legal(A) | -min_precedes(A,C,B). [resolve(75,a,61,a)].
% 0.46/1.06 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | -min_precedes(A,C,B) | -precedes(D,A). [resolve(136,c,123,b)].
% 0.46/1.06 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | -min_precedes(A,C,B) | -tptp1(D,E,A). [resolve(136,c,126,b)].
% 0.46/1.06 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | -min_precedes(A,C,B) | -root_occ(A,D). [resolve(136,c,127,b)].
% 0.46/1.06 Derived: min_precedes(f14(A,B),f5(f14(A,B),C),C) | -atocc(f14(A,B),C) | -min_precedes(f14(A,B),D,C) | -occurrence_of(B,A) | atomic(A). [resolve(136,c,131,c)].
% 0.46/1.06 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | -min_precedes(A,C,B) | min_precedes(f4(A,f3(A,D)),A,f3(A,D)) | -leaf_occ(A,D). [resolve(136,c,133,b)].
% 0.46/1.06 137 min_precedes(A,f5(A,B),B) | -atocc(A,B) | -legal(A) | atomic(B) | occurrence_of(f8(A,B),B). [resolve(75,a,62,a)].
% 0.46/1.06 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | atomic(B) | occurrence_of(f8(A,B),B) | -precedes(C,A). [resolve(137,c,123,b)].
% 0.46/1.06 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | atomic(B) | occurrence_of(f8(A,B),B) | -tptp1(C,D,A). [resolve(137,c,126,b)].
% 0.46/1.06 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | atomic(B) | occurrence_of(f8(A,B),B) | -root_occ(A,C). [resolve(137,c,127,b)].
% 0.46/1.06 Derived: min_precedes(f14(A,B),f5(f14(A,B),C),C) | -atocc(f14(A,B),C) | atomic(C) | occurrence_of(f8(f14(A,B),C),C) | -occurrence_of(B,A) | atomic(A). [resolve(137,c,131,c)].
% 0.46/1.06 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | atomic(B) | occurrence_of(f8(A,B),B) | min_precedes(f4(A,f3(A,C)),A,f3(A,C)) | -leaf_occ(A,C). [resolve(137,c,133,b)].
% 0.46/1.06 138 min_precedes(A,f5(A,B),B) | -atocc(A,B) | -legal(A) | atomic(B) | leaf_occ(A,f8(A,B)). [resolve(75,a,63,a)].
% 0.46/1.06 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | atomic(B) | leaf_occ(A,f8(A,B)) | -precedes(C,A). [resolve(138,c,123,b)].
% 0.46/1.06 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | atomic(B) | leaf_occ(A,f8(A,B)) | -tptp1(C,D,A). [resolve(138,c,126,b)].
% 0.46/1.06 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | atomic(B) | leaf_occ(A,f8(A,B)) | -root_occ(A,C). [resolve(138,c,127,b)].
% 0.46/1.06 Derived: min_precedes(f14(A,B),f5(f14(A,B),C),C) | -atocc(f14(A,B),C) | atomic(C) | leaf_occ(f14(A,B),f8(f14(A,B),C)) | -occurrence_of(B,A) | atomic(A). [resolve(138,c,131,c)].
% 0.46/1.06 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | atomic(B) | leaf_occ(A,f8(A,B)) | min_precedes(f4(A,f3(A,C)),A,f3(A,C)) | -leaf_occ(A,C). [resolve(138,c,133,b)].
% 0.46/1.06 139 min_precedes(A,f5(A,B),B) | -atocc(A,B) | -legal(A) | atomic(B) | occurrence_of(f10(A,B),B). [resolve(75,a,64,a)].
% 0.46/1.06 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | atomic(B) | occurrence_of(f10(A,B),B) | -precedes(C,A). [resolve(139,c,123,b)].
% 0.46/1.06 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | atomic(B) | occurrence_of(f10(A,B),B) | -tptp1(C,D,A). [resolve(139,c,126,b)].
% 0.46/1.06 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | atomic(B) | occurrence_of(f10(A,B),B) | -root_occ(A,C). [resolve(139,c,127,b)].
% 0.46/1.06 Derived: min_precedes(f14(A,B),f5(f14(A,B),C),C) | -atocc(f14(A,B),C) | atomic(C) | occurrence_of(f10(f14(A,B),C),C) | -occurrence_of(B,A) | atomic(A). [resolve(139,c,131,c)].
% 0.46/1.06 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | atomic(B) | occurrence_of(f10(A,B),B) | min_precedes(f4(A,f3(A,C)),A,f3(A,C)) | -leaf_occ(A,C). [resolve(139,c,133,b)].
% 0.46/1.06 140 min_precedes(A,f5(A,B),B) | -atocc(A,B) | -legal(A) | atomic(B) | leaf_occ(A,f10(A,B)). [resolve(75,a,65,a)].
% 0.46/1.06 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | atomic(B) | leaf_occ(A,f10(A,B)) | -precedes(C,A). [resolve(140,c,123,b)].
% 0.46/1.06 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | atomic(B) | leaf_occ(A,f10(A,B)) | -tptp1(C,D,A). [resolve(140,c,126,b)].
% 0.46/1.06 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | atomic(B) | leaf_occ(A,f10(A,B)) | -root_occ(A,C). [resolve(140,c,127,b)].
% 0.46/1.06 Derived: min_precedes(f14(A,B),f5(f14(A,B),C),C) | -atocc(f14(A,B),C) | atomic(C) | leaf_occ(f14(A,B),f10(f14(A,B),C)) | -occurrence_of(B,A) | atomic(A). [resolve(140,c,131,c)].
% 0.46/1.06 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | atomic(B) | leaf_occ(A,f10(A,B)) | min_precedes(f4(A,f3(A,C)),A,f3(A,C)) | -leaf_occ(A,C). [resolve(140,c,133,b)].
% 0.46/1.06 141 min_precedes(A,f5(A,B),B) | -atocc(A,B) | -legal(A) | leaf_occ(A,C) | -occurrence_of(C,B) | -subactivity_occurrence(A,C). [resolve(75,a,66,d)].
% 0.46/1.06 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | leaf_occ(A,C) | -occurrence_of(C,B) | -subactivity_occurrence(A,C) | -precedes(D,A). [resolve(141,c,123,b)].
% 0.46/1.06 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | leaf_occ(A,C) | -occurrence_of(C,B) | -subactivity_occurrence(A,C) | -tptp1(D,E,A). [resolve(141,c,126,b)].
% 0.46/1.06 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | leaf_occ(A,C) | -occurrence_of(C,B) | -subactivity_occurrence(A,C) | -root_occ(A,D). [resolve(141,c,127,b)].
% 0.46/1.06 Derived: min_precedes(f14(A,B),f5(f14(A,B),C),C) | -atocc(f14(A,B),C) | leaf_occ(f14(A,B),D) | -occurrence_of(D,C) | -subactivity_occurrence(f14(A,B),D) | -occurrence_of(B,A) | atomic(A). [resolve(141,c,131,c)].
% 0.46/1.06 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | leaf_occ(A,C) | -occurrence_of(C,B) | -subactivity_occurrence(A,C) | min_precedes(f4(A,f3(A,D)),A,f3(A,D)) | -leaf_occ(A,D). [resolve(141,c,133,b)].
% 0.46/1.06 142 min_precedes(A,f5(A,B),B) | -atocc(A,B) | -legal(A) | min_precedes(f4(A,B),A,B) | subactivity(f13(B,A),B). [resolve(75,a,70,a)].
% 0.46/1.06 143 min_precedes(A,f5(A,B),B) | -atocc(A,B) | -legal(A) | min_precedes(f4(A,B),A,B) | atocc(A,f13(B,A)). [resolve(75,a,71,a)].
% 0.46/1.06 144 min_precedes(A,f5(A,B),B) | -atocc(A,B) | -legal(A) | min_precedes(f4(A,B),A,B) | root_occ(A,C) | -occurrence_of(C,B) | -subactivity_occurrence(A,C). [resolve(75,a,72,a)].
% 0.46/1.06 145 min_precedes(f14(A,B),f5(f14(A,B),A),A) | -occurrence_of(B,A) | atomic(A) | min_precedes(f4(f14(A,B),A),f14(A,B),A) | legal(f14(A,B)). [resolve(78,a,69,a)].
% 0.46/1.06 146 legal(f18(A,B,C,D)) | -tptp1(A,B,C) | -occurrence_of(D,A). [resolve(87,a,79,c)].
% 0.46/1.06 Derived: -tptp1(A,B,C) | -occurrence_of(D,A) | arboreal(f18(A,B,C,D)). [resolve(146,a,124,a)].
% 0.46/1.06 Derived: -tptp1(A,B,C) | -occurrence_of(D,A) | precedes(E,f18(A,B,C,D)) | -earlier(E,f18(A,B,C,D)). [resolve(146,a,125,c)].
% 0.46/1.06 Derived: -tptp1(A,B,C) | -occurrence_of(D,A) | -atocc(f18(A,B,C,D),E) | -min_precedes(F,f18(A,B,C,D),E). [resolve(146,a,128,b)].
% 0.46/1.06 Derived: -tptp1(A,B,C) | -occurrence_of(D,A) | subactivity(f13(E,f18(A,B,C,D)),E) | -atocc(f18(A,B,C,D),E). [resolve(146,a,129,c)].
% 0.46/1.06 Derived: -tptp1(A,B,C) | -occurrence_of(D,A) | atocc(f18(A,B,C,D),f13(E,f18(A,B,C,D))) | -atocc(f18(A,B,C,D),E). [resolve(146,a,130,c)].
% 0.46/1.06 Derived: -tptp1(A,B,C) | -occurrence_of(D,A) | root_occ(f18(A,B,C,D),E) | -occurrence_of(E,F) | -subactivity_occurrence(f18(A,B,C,D),E) | -atocc(f18(A,B,C,D),F). [resolve(146,a,132,e)].
% 0.46/1.06 Derived: -tptp1(A,B,C) | -occurrence_of(D,A) | min_precedes(f18(A,B,C,D),f5(f18(A,B,C,D),E),E) | -atocc(f18(A,B,C,D),E) | -min_precedes(f18(A,B,C,D),F,E). [resolve(146,a,136,c)].
% 0.46/1.06 Derived: -tptp1(A,B,C) | -occurrence_of(D,A) | min_precedes(f18(A,B,C,D),f5(f18(A,B,C,D),E),E) | -atocc(f18(A,B,C,D),E) | atomic(E) | occurrence_of(f8(f18(A,B,C,D),E),E). [resolve(146,a,137,c)].
% 0.46/1.06 Derived: -tptp1(A,B,C) | -occurrence_of(D,A) | min_precedes(f18(A,B,C,D),f5(f18(A,B,C,D),E),E) | -atocc(f18(A,B,C,D),E) | atomic(E) | leaf_occ(f18(A,B,C,D),f8(f18(A,B,C,D),E)). [resolve(146,a,138,c)].
% 0.46/1.06 Derived: -tptp1(A,B,C) | -occurrence_of(D,A) | min_precedes(f18(A,B,C,D),f5(f18(A,B,C,D),E),E) | -atocc(f18(A,B,C,D),E) | atomic(E) | occurrence_of(f10(f18(A,B,C,D),E),E). [resolve(146,a,139,c)].
% 0.46/1.06 Derived: -tptp1(A,B,C) | -occurrence_of(D,A) | min_precedes(f18(A,B,C,D),f5(f18(A,B,C,D),E),E) | -atocc(f18(A,B,C,D),E) | atomic(E) | leaf_occ(f18(A,B,C,D),f10(f18(A,B,C,D),E)). [resolve(146,a,140,c)].
% 0.46/1.07 Derived: -tptp1(A,B,C) | -occurrence_of(D,A) | min_precedes(f18(A,B,C,D),f5(f18(A,B,C,D),E),E) | -atocc(f18(A,B,C,D),E) | leaf_occ(f18(A,B,C,D),F) | -occurrence_of(F,E) | -subactivity_occurrence(f18(A,B,C,D),F). [resolve(146,a,141,c)].
% 0.46/1.07 147 legal(A) | -tptp1(B,C,A) | -occurrence_of(D,B). [resolve(91,a,79,c)].
% 0.46/1.07 148 -activity_occurrence(A) | occurrence_of(A,f7(A)) # label(sos_18) # label(axiom). [clausify(19)].
% 0.46/1.07 149 -subactivity_occurrence(A,B) | activity_occurrence(A) # label(sos_19) # label(axiom). [clausify(20)].
% 0.46/1.07 150 -subactivity_occurrence(A,B) | activity_occurrence(B) # label(sos_19) # label(axiom). [clausify(20)].
% 0.46/1.07 151 -occurrence_of(A,B) | activity_occurrence(A) # label(sos_29) # label(axiom). [clausify(30)].
% 0.46/1.07 Derived: occurrence_of(A,f7(A)) | -subactivity_occurrence(A,B). [resolve(148,a,149,b)].
% 0.46/1.07 Derived: occurrence_of(A,f7(A)) | -subactivity_occurrence(B,A). [resolve(148,a,150,b)].
% 0.46/1.07 Derived: occurrence_of(A,f7(A)) | -occurrence_of(A,B). [resolve(148,a,151,b)].
% 0.46/1.07 152 subactivity(f7(A),f7(A)) | -activity_occurrence(A). [resolve(41,a,43,b)].
% 0.46/1.07 Derived: subactivity(f7(A),f7(A)) | -subactivity_occurrence(A,B). [resolve(152,b,149,b)].
% 0.46/1.07 Derived: subactivity(f7(A),f7(A)) | -subactivity_occurrence(B,A). [resolve(152,b,150,b)].
% 0.46/1.07 Derived: subactivity(f7(A),f7(A)) | -occurrence_of(A,B). [resolve(152,b,151,b)].
% 0.46/1.07 153 atocc(A,B) | -subactivity(B,C) | -atomic(C) | -occurrence_of(A,C) # label(sos_15) # label(axiom). [clausify(16)].
% 0.46/1.07 154 -atocc(A,B) | subactivity(B,f6(A,B)) # label(sos_15) # label(axiom). [clausify(16)].
% 0.46/1.07 155 -min_precedes(A,B,C) | subactivity(f11(C,A,B),C) # label(sos_26) # label(axiom). [clausify(27)].
% 0.46/1.07 156 -min_precedes(A,B,C) | subactivity(f12(C,A,B),C) # label(sos_26) # label(axiom). [clausify(27)].
% 0.46/1.07 Derived: atocc(A,B) | -atomic(f6(C,B)) | -occurrence_of(A,f6(C,B)) | -atocc(C,B). [resolve(153,b,154,b)].
% 0.46/1.07 Derived: atocc(A,f11(B,C,D)) | -atomic(B) | -occurrence_of(A,B) | -min_precedes(C,D,B). [resolve(153,b,155,b)].
% 0.46/1.07 Derived: atocc(A,f12(B,C,D)) | -atomic(B) | -occurrence_of(A,B) | -min_precedes(C,D,B). [resolve(153,b,156,b)].
% 0.46/1.07 157 subactivity(tptp0,tptp0). [resolve(41,a,42,a)].
% 0.46/1.07 Derived: atocc(A,tptp0) | -atomic(tptp0) | -occurrence_of(A,tptp0). [resolve(157,a,153,b)].
% 0.46/1.07 158 subactivity(A,A) | -occurrence_of(B,A). [resolve(41,a,44,b)].
% 0.46/1.07 Derived: -occurrence_of(A,B) | atocc(C,B) | -atomic(B) | -occurrence_of(C,B). [resolve(158,a,153,b)].
% 0.46/1.07 159 -tptp1(A,B,C) | subactivity(A,A). [resolve(45,b,41,a)].
% 0.46/1.07 160 subactivity(f13(A,B),A) | -tptp1(C,A,B). [resolve(52,a,47,b)].
% 0.46/1.07 Derived: -tptp1(A,B,C) | atocc(D,f13(B,C)) | -atomic(B) | -occurrence_of(D,B). [resolve(160,a,153,b)].
% 0.46/1.07 161 subactivity(f13(f2(A,B),A),f2(A,B)) | -root_occ(A,B). [resolve(52,a,50,b)].
% 0.46/1.07 Derived: -root_occ(A,B) | atocc(C,f13(f2(A,B),A)) | -atomic(f2(A,B)) | -occurrence_of(C,f2(A,B)). [resolve(161,a,153,b)].
% 0.46/1.07 162 -occurrence_of(A,B) | atomic(B) | subactivity(f13(B,f14(B,A)),B). [resolve(56,c,52,a)].
% 0.46/1.07 163 min_precedes(f4(A,f3(A,B)),A,f3(A,B)) | subactivity(f13(f3(A,B),A),f3(A,B)) | -leaf_occ(A,B). [resolve(70,a,60,b)].
% 0.46/1.07 Derived: min_precedes(f4(A,f3(A,B)),A,f3(A,B)) | -leaf_occ(A,B) | atocc(C,f13(f3(A,B),A)) | -atomic(f3(A,B)) | -occurrence_of(C,f3(A,B)). [resolve(163,b,153,b)].
% 0.46/1.07 164 min_precedes(A,f5(A,B),B) | -tptp1(C,B,A) | min_precedes(f4(A,B),A,B) | subactivity(f13(B,A),B). [resolve(73,a,70,a)].
% 0.46/1.07 165 min_precedes(A,f5(A,f2(A,B)),f2(A,B)) | -root_occ(A,B) | min_precedes(f4(A,f2(A,B)),A,f2(A,B)) | subactivity(f13(f2(A,B),A),f2(A,B)). [resolve(74,a,70,a)].
% 0.46/1.07 166 min_precedes(f14(A,B),f5(f14(A,B),A),A) | -occurrence_of(B,A) | atomic(A) | min_precedes(f4(f14(A,B),A),f14(A,B),A) | subactivity(f13(A,f14(A,B)),A). [resolve(78,a,70,a)].
% 0.46/1.07 167 subactivity(f17(A,B,C,D),f17(A,B,C,D)) | -tptp1(A,B,C) | -occurrence_of(D,A). [resolve(85,a,79,c)].
% 0.46/1.07 168 subactivity(f13(f19(A,B,C,D),f18(A,B,C,D)),f19(A,B,C,D)) | -tptp1(A,B,C) | -occurrence_of(D,A). [resolve(88,a,79,c)].
% 0.46/1.07 Derived: -tptp1(A,B,C) | -occurrence_of(D,A) | atocc(E,f13(f19(A,B,C,D),f18(A,B,C,D))) | -atomic(f19(A,B,C,D)) | -occurrence_of(E,f19(A,B,C,D)). [resolve(168,a,153,b)].
% 21.15/21.49 169 subactivity(f13(A,B),A) | -tptp1(C,A,B) | -occurrence_of(D,C). [resolve(92,a,79,c)].
% 21.15/21.49 170 subactivity(f13(A,B),A) | -atocc(B,A) | -precedes(C,B). [resolve(129,c,123,b)].
% 21.15/21.49 Derived: -atocc(A,B) | -precedes(C,A) | atocc(D,f13(B,A)) | -atomic(B) | -occurrence_of(D,B). [resolve(170,a,153,b)].
% 21.15/21.49 171 subactivity(f13(A,B),A) | -atocc(B,A) | -tptp1(C,D,B). [resolve(129,c,126,b)].
% 21.15/21.49 Derived: -atocc(A,B) | -tptp1(C,D,A) | atocc(E,f13(B,A)) | -atomic(B) | -occurrence_of(E,B). [resolve(171,a,153,b)].
% 21.15/21.49 172 subactivity(f13(A,B),A) | -atocc(B,A) | -root_occ(B,C). [resolve(129,c,127,b)].
% 21.15/21.49 Derived: -atocc(A,B) | -root_occ(A,C) | atocc(D,f13(B,A)) | -atomic(B) | -occurrence_of(D,B). [resolve(172,a,153,b)].
% 21.15/21.49 173 -occurrence_of(A,B) | atomic(B) | subactivity(f13(C,f14(B,A)),C) | -atocc(f14(B,A),C). [resolve(131,c,129,c)].
% 21.15/21.49 Derived: -occurrence_of(A,B) | atomic(B) | -atocc(f14(B,A),C) | atocc(D,f13(C,f14(B,A))) | -atomic(C) | -occurrence_of(D,C). [resolve(173,c,153,b)].
% 21.15/21.49 174 min_precedes(f4(A,f3(A,B)),A,f3(A,B)) | -leaf_occ(A,B) | subactivity(f13(C,A),C) | -atocc(A,C). [resolve(133,b,129,c)].
% 21.15/21.49 Derived: min_precedes(f4(A,f3(A,B)),A,f3(A,B)) | -leaf_occ(A,B) | -atocc(A,C) | atocc(D,f13(C,A)) | -atomic(C) | -occurrence_of(D,C). [resolve(174,c,153,b)].
% 21.15/21.49 175 -tptp1(A,B,C) | -occurrence_of(D,A) | subactivity(f13(E,f18(A,B,C,D)),E) | -atocc(f18(A,B,C,D),E). [resolve(146,a,129,c)].
% 21.15/21.49 Derived: -tptp1(A,B,C) | -occurrence_of(D,A) | -atocc(f18(A,B,C,D),E) | atocc(F,f13(E,f18(A,B,C,D))) | -atomic(E) | -occurrence_of(F,E). [resolve(175,c,153,b)].
% 21.15/21.49 176 subactivity(f7(A),f7(A)) | -subactivity_occurrence(A,B). [resolve(152,b,149,b)].
% 21.15/21.49 177 subactivity(f7(A),f7(A)) | -subactivity_occurrence(B,A). [resolve(152,b,150,b)].
% 21.15/21.49 178 subactivity(f7(A),f7(A)) | -occurrence_of(A,B). [resolve(152,b,151,b)].
% 21.15/21.49
% 21.15/21.49 ============================== end predicate elimination =============
% 21.15/21.49
% 21.15/21.49 Auto_denials: (non-Horn, no changes).
% 21.15/21.49
% 21.15/21.49 Term ordering decisions:
% 21.15/21.49 Function symbol KB weights: tptp0=1. tptp2=1. tptp3=1. tptp4=1. tptp5=1. c1=1. c2=1. c3=1. f2=1. f3=1. f4=1. f5=1. f6=1. f8=1. f10=1. f13=1. f14=1. f7=1. f15=1. f16=1. f1=1. f9=1. f11=1. f12=1. f17=1. f18=1. f19=1. f20=1.
% 21.15/21.49
% 21.15/21.49 ============================== end of process initial clauses ========
% 21.15/21.49
% 21.15/21.49 ============================== CLAUSES FOR SEARCH ====================
% 21.15/21.49
% 21.15/21.49 ============================== end of clauses for search =============
% 21.15/21.49
% 21.15/21.49 ============================== SEARCH ================================
% 21.15/21.49
% 21.15/21.49 % Starting search at 0.08 seconds.
% 21.15/21.49
% 21.15/21.49 Low Water (keep): wt=57.000, iters=3447
% 21.15/21.49
% 21.15/21.49 Low Water (keep): wt=42.000, iters=3764
% 21.15/21.49
% 21.15/21.49 Low Water (keep): wt=40.000, iters=3676
% 21.15/21.49
% 21.15/21.49 Low Water (keep): wt=38.000, iters=4736
% 21.15/21.49
% 21.15/21.49 Low Water (keep): wt=37.000, iters=3379
% 21.15/21.49
% 21.15/21.49 Low Water (keep): wt=36.000, iters=3355
% 21.15/21.49
% 21.15/21.49 Low Water (keep): wt=35.000, iters=3336
% 21.15/21.49
% 21.15/21.49 Low Water (keep): wt=31.000, iters=4389
% 21.15/21.49
% 21.15/21.49 Low Water (keep): wt=29.000, iters=3567
% 21.15/21.49
% 21.15/21.49 Low Water (displace): id=8243, wt=126.000
% 21.15/21.49
% 21.15/21.49 Low Water (displace): id=8244, wt=125.000
% 21.15/21.49
% 21.15/21.49 Low Water (displace): id=7740, wt=124.000
% 21.15/21.49
% 21.15/21.49 Low Water (displace): id=15486, wt=31.000
% 21.15/21.49
% 21.15/21.49 Low Water (displace): id=15491, wt=26.000
% 21.15/21.49
% 21.15/21.49 Low Water (displace): id=15514, wt=24.000
% 21.15/21.49
% 21.15/21.49 Low Water (displace): id=18289, wt=23.000
% 21.15/21.49
% 21.15/21.49 Low Water (keep): wt=27.000, iters=3609
% 21.15/21.49
% 21.15/21.49 ============================== PROOF =================================
% 21.15/21.49 % SZS status Theorem
% 21.15/21.49 % SZS output start Refutation
% 21.15/21.49
% 21.15/21.49 % Proof 1 at 20.36 (+ 0.12) seconds.
% 21.15/21.49 % Length of proof is 152.
% 21.15/21.49 % Level of proof is 18.
% 21.15/21.49 % Maximum clause weight is 43.000.
% 21.15/21.49 % Given clauses 14295.
% 21.15/21.49
% 21.15/21.49 3 (all X7 all X8 all X9 all X10 (occurrence_of(X9,X10) & root_occ(X7,X9) & root_occ(X8,X9) -> X7 = X8)) # label(sos_02) # label(axiom) # label(non_clause). [assumption].
% 21.15/21.49 5 (all X15 all X16 all X17 (next_subocc(X15,X16,X17) <-> min_precedes(X15,X16,X17) & -(exists X18 (min_precedes(X15,X18,X17) & min_precedes(X18,X16,X17))))) # label(sos_04) # label(axiom) # label(non_clause). [assumption].
% 21.15/21.49 6 (all X19 all X20 all X21 (next_subocc(X19,X20,X21) -> arboreal(X19) & arboreal(X20))) # label(sos_05) # label(axiom) # label(non_clause). [assumption].
% 21.15/21.49 11 (all X32 all X33 (root_occ(X32,X33) <-> (exists X34 (occurrence_of(X33,X34) & subactivity_occurrence(X32,X33) & root(X32,X34))))) # label(sos_10) # label(axiom) # label(non_clause). [assumption].
% 21.15/21.49 12 (all X35 all X36 (leaf_occ(X35,X36) <-> (exists X37 (occurrence_of(X36,X37) & subactivity_occurrence(X35,X36) & leaf(X35,X37))))) # label(sos_11) # label(axiom) # label(non_clause). [assumption].
% 21.15/21.49 13 (all X38 all X39 (root(X38,X39) -> legal(X38))) # label(sos_12) # label(axiom) # label(non_clause). [assumption].
% 21.15/21.49 14 (all X40 all X41 (occurrence_of(X40,X41) -> (arboreal(X40) <-> atomic(X41)))) # label(sos_13) # label(axiom) # label(non_clause). [assumption].
% 21.15/21.49 15 (all X42 all X43 (leaf(X42,X43) <-> (root(X42,X43) | (exists X44 min_precedes(X44,X42,X43))) & -(exists X45 min_precedes(X42,X45,X43)))) # label(sos_14) # label(axiom) # label(non_clause). [assumption].
% 21.15/21.49 16 (all X46 all X47 (atocc(X46,X47) <-> (exists X48 (subactivity(X47,X48) & atomic(X48) & occurrence_of(X46,X48))))) # label(sos_15) # label(axiom) # label(non_clause). [assumption].
% 21.15/21.49 18 (all X51 (legal(X51) -> arboreal(X51))) # label(sos_17) # label(axiom) # label(non_clause). [assumption].
% 21.15/21.49 19 (all X52 (activity_occurrence(X52) -> (exists X53 (activity(X53) & occurrence_of(X52,X53))))) # label(sos_18) # label(axiom) # label(non_clause). [assumption].
% 21.15/21.49 20 (all X54 all X55 (subactivity_occurrence(X54,X55) -> activity_occurrence(X54) & activity_occurrence(X55))) # label(sos_19) # label(axiom) # label(non_clause). [assumption].
% 21.15/21.49 23 (all X64 all X65 all X66 (occurrence_of(X64,X65) & occurrence_of(X64,X66) -> X65 = X66)) # label(sos_22) # label(axiom) # label(non_clause). [assumption].
% 21.15/21.49 25 (all X70 all X71 all X72 (min_precedes(X71,X72,X70) -> (exists X73 (occurrence_of(X73,X70) & subactivity_occurrence(X71,X73) & subactivity_occurrence(X72,X73))))) # label(sos_24) # label(axiom) # label(non_clause). [assumption].
% 21.15/21.49 29 (all X85 all X86 all X87 all X88 (occurrence_of(X86,X85) & arboreal(X87) & arboreal(X88) & subactivity_occurrence(X87,X86) & subactivity_occurrence(X88,X86) -> min_precedes(X87,X88,X85) | min_precedes(X88,X87,X85) | X87 = X88)) # label(sos_28) # label(axiom) # label(non_clause). [assumption].
% 21.15/21.49 30 (all X89 all X90 (occurrence_of(X90,X89) -> activity(X89) & activity_occurrence(X90))) # label(sos_29) # label(axiom) # label(non_clause). [assumption].
% 21.15/21.49 31 (all X91 all X92 (occurrence_of(X92,X91) & -atomic(X91) -> (exists X93 (root(X93,X91) & subactivity_occurrence(X93,X92))))) # label(sos_30) # label(axiom) # label(non_clause). [assumption].
% 21.15/21.49 32 (all X94 (activity(X94) -> subactivity(X94,X94))) # label(sos_31) # label(axiom) # label(non_clause). [assumption].
% 21.15/21.49 33 (all X95 (occurrence_of(X95,tptp0) -> (exists X96 exists X97 (occurrence_of(X96,tptp4) & root_occ(X96,X95) & (occurrence_of(X97,tptp3) | occurrence_of(X97,tptp2)) & leaf_occ(X97,X95) & next_subocc(X96,X97,tptp0))))) # label(sos_32) # label(axiom) # label(non_clause). [assumption].
% 21.15/21.49 35 (all X103 all X104 all X105 all X106 all X107 (send_message(X103,X104,X105,X106,X107) -> X103 != tptp4 & X103 != tptp3 & X103 != tptp2)) # label(sos_46) # label(axiom) # label(non_clause). [assumption].
% 21.15/21.49 36 (all X108 all X109 all X110 all X111 all X112 all X113 (send_message(X108,X109,X110,X111,X112) & occurrence_of(X113,X108) -> min_precedes(X111,X113,X112))) # label(sos_47) # label(axiom) # label(non_clause). [assumption].
% 21.15/21.49 37 (all X114 all X115 all X116 (tptp1(X114,X115,X116) -> activity(X114) & -atomic(X114) & -atomic(X115) & root(X116,X115))) # label(sos_48) # label(axiom) # label(non_clause). [assumption].
% 21.15/21.49 38 (all X117 all X118 all X119 all X120 (tptp1(X117,X118,X119) & occurrence_of(X120,X117) -> (exists X121 exists X122 exists X123 exists X124 (send_message(X121,X122,X123,X119,X118) & occurrence_of(X124,X121) & root_occ(X124,X120))))) # label(sos_49) # label(axiom) # label(non_clause). [assumption].
% 21.15/21.49 40 --(exists X127 exists X128 exists X129 (tptp1(X127,tptp0,X128) & occurrence_of(X129,X127))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 21.15/21.49 41 -activity(A) | subactivity(A,A) # label(sos_31) # label(axiom). [clausify(32)].
% 21.15/21.49 44 -occurrence_of(A,B) | activity(B) # label(sos_29) # label(axiom). [clausify(30)].
% 21.15/21.49 47 -tptp1(A,B,C) | root(C,B) # label(sos_48) # label(axiom). [clausify(37)].
% 21.15/21.49 49 -root(A,B) | legal(A) # label(sos_12) # label(axiom). [clausify(13)].
% 21.15/21.49 56 -occurrence_of(A,B) | atomic(B) | root(f14(B,A),B) # label(sos_30) # label(axiom). [clausify(31)].
% 21.15/21.49 57 root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -root(A,C) # label(sos_10) # label(axiom). [clausify(11)].
% 21.15/21.49 60 -leaf_occ(A,B) | leaf(A,f3(A,B)) # label(sos_11) # label(axiom). [clausify(12)].
% 21.15/21.49 61 -leaf(A,B) | -min_precedes(A,C,B) # label(sos_14) # label(axiom). [clausify(15)].
% 21.15/21.49 79 -tptp1(A,B,C) | -occurrence_of(D,A) | send_message(f17(A,B,C,D),f18(A,B,C,D),f19(A,B,C,D),C,B) # label(sos_49) # label(axiom). [clausify(38)].
% 21.15/21.49 81 -send_message(A,B,C,D,E) | A != tptp3 # label(sos_46) # label(axiom). [clausify(35)].
% 21.15/21.49 82 -send_message(A,B,C,D,E) | A != tptp2 # label(sos_46) # label(axiom). [clausify(35)].
% 21.15/21.49 84 -send_message(A,B,C,D,E) | -occurrence_of(F,A) | min_precedes(D,F,E) # label(sos_47) # label(axiom). [clausify(36)].
% 21.15/21.49 116 -occurrence_of(A,tptp0) | next_subocc(f15(A),f16(A),tptp0) # label(sos_32) # label(axiom). [clausify(33)].
% 21.15/21.49 117 -next_subocc(A,B,C) | -min_precedes(A,D,C) | -min_precedes(D,B,C) # label(sos_04) # label(axiom). [clausify(5)].
% 21.15/21.49 119 -next_subocc(A,B,C) | arboreal(B) # label(sos_05) # label(axiom). [clausify(6)].
% 21.15/21.49 124 -legal(A) | arboreal(A) # label(sos_17) # label(axiom). [clausify(18)].
% 21.15/21.49 131 -occurrence_of(A,B) | atomic(B) | legal(f14(B,A)). [resolve(56,c,49,a)].
% 21.15/21.49 148 -activity_occurrence(A) | occurrence_of(A,f7(A)) # label(sos_18) # label(axiom). [clausify(19)].
% 21.15/21.49 149 -subactivity_occurrence(A,B) | activity_occurrence(A) # label(sos_19) # label(axiom). [clausify(20)].
% 21.15/21.49 153 atocc(A,B) | -subactivity(B,C) | -atomic(C) | -occurrence_of(A,C) # label(sos_15) # label(axiom). [clausify(16)].
% 21.15/21.49 158 subactivity(A,A) | -occurrence_of(B,A). [resolve(41,a,44,b)].
% 21.15/21.49 180 atomic(tptp3) # label(sos_36) # label(axiom). [assumption].
% 21.15/21.49 183 occurrence_of(c3,c1) # label(goals) # label(negated_conjecture). [clausify(40)].
% 21.15/21.49 184 tptp1(c1,tptp0,c2) # label(goals) # label(negated_conjecture). [clausify(40)].
% 21.15/21.49 192 tptp3 != tptp2 # label(sos_44) # label(axiom). [assumption].
% 21.15/21.49 195 -tptp1(A,B,C) | -atomic(A) # label(sos_48) # label(axiom). [clausify(37)].
% 21.15/21.49 201 -leaf_occ(A,B) | subactivity_occurrence(A,B) # label(sos_11) # label(axiom). [clausify(12)].
% 21.15/21.49 203 -occurrence_of(A,B) | -arboreal(A) | atomic(B) # label(sos_13) # label(axiom). [clausify(14)].
% 21.15/21.49 207 -occurrence_of(A,tptp0) | root_occ(f15(A),A) # label(sos_32) # label(axiom). [clausify(33)].
% 21.15/21.49 208 -occurrence_of(A,tptp0) | leaf_occ(f16(A),A) # label(sos_32) # label(axiom). [clausify(33)].
% 21.15/21.49 210 -leaf_occ(A,B) | occurrence_of(B,f3(A,B)) # label(sos_11) # label(axiom). [clausify(12)].
% 21.15/21.49 211 -atocc(A,B) | occurrence_of(A,f6(A,B)) # label(sos_15) # label(axiom). [clausify(16)].
% 21.15/21.49 213 -occurrence_of(A,B) | -occurrence_of(A,C) | C = B # label(sos_22) # label(axiom). [clausify(23)].
% 21.15/21.49 214 -min_precedes(A,B,C) | occurrence_of(f9(C,A,B),C) # label(sos_24) # label(axiom). [clausify(25)].
% 21.15/21.49 215 -min_precedes(A,B,C) | subactivity_occurrence(A,f9(C,A,B)) # label(sos_24) # label(axiom). [clausify(25)].
% 21.15/21.49 216 -min_precedes(A,B,C) | subactivity_occurrence(B,f9(C,A,B)) # label(sos_24) # label(axiom). [clausify(25)].
% 21.15/21.49 219 -occurrence_of(A,B) | atomic(B) | subactivity_occurrence(f14(B,A),A) # label(sos_30) # label(axiom). [clausify(31)].
% 21.15/21.49 220 -occurrence_of(A,tptp0) | occurrence_of(f16(A),tptp3) | occurrence_of(f16(A),tptp2) # label(sos_32) # label(axiom). [clausify(33)].
% 21.15/21.49 222 -occurrence_of(A,B) | -root_occ(C,A) | -root_occ(D,A) | D = C # label(sos_02) # label(axiom). [clausify(3)].
% 21.15/21.49 224 -tptp1(A,B,C) | -occurrence_of(D,A) | root_occ(f20(A,B,C,D),D) # label(sos_49) # label(axiom). [clausify(38)].
% 21.15/21.49 225 -tptp1(A,B,C) | -occurrence_of(D,A) | occurrence_of(f20(A,B,C,D),f17(A,B,C,D)) # label(sos_49) # label(axiom). [clausify(38)].
% 21.15/21.49 226 -occurrence_of(A,B) | -arboreal(C) | -arboreal(D) | -subactivity_occurrence(C,A) | -subactivity_occurrence(D,A) | min_precedes(C,D,B) | min_precedes(D,C,B) | D = C # label(sos_28) # label(axiom). [clausify(29)].
% 21.15/21.49 233 root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -tptp1(D,C,A). [resolve(57,d,47,b)].
% 21.15/21.49 235 root_occ(f14(A,B),C) | -occurrence_of(C,A) | -subactivity_occurrence(f14(A,B),C) | -occurrence_of(B,A) | atomic(A). [resolve(57,d,56,c)].
% 21.15/21.49 236 -leaf_occ(A,B) | -min_precedes(A,C,f3(A,B)). [resolve(60,b,61,a)].
% 21.15/21.49 275 -tptp1(A,B,C) | -occurrence_of(D,A) | f17(A,B,C,D) != tptp3. [resolve(79,c,81,a)].
% 21.15/21.49 276 -tptp1(A,B,C) | -occurrence_of(D,A) | f17(A,B,C,D) != tptp2. [resolve(79,c,82,a)].
% 21.15/21.49 278 -tptp1(A,B,C) | -occurrence_of(D,A) | -occurrence_of(E,f17(A,B,C,D)) | min_precedes(C,E,B). [resolve(79,c,84,a)].
% 21.15/21.49 288 -occurrence_of(A,tptp0) | -min_precedes(f15(A),B,tptp0) | -min_precedes(B,f16(A),tptp0). [resolve(116,b,117,a)].
% 21.15/21.49 290 -occurrence_of(A,tptp0) | arboreal(f16(A)). [resolve(116,b,119,a)].
% 21.15/21.49 310 -occurrence_of(A,B) | atomic(B) | arboreal(f14(B,A)). [resolve(131,c,124,a)].
% 21.15/21.49 364 occurrence_of(A,f7(A)) | -subactivity_occurrence(A,B). [resolve(148,a,149,b)].
% 21.15/21.49 370 -occurrence_of(A,B) | atocc(C,B) | -atomic(B) | -occurrence_of(C,B). [resolve(158,a,153,b)].
% 21.15/21.49 381 root_occ(f14(A,B),B) | -occurrence_of(B,A) | -subactivity_occurrence(f14(A,B),B) | atomic(A). [factor(235,b,d)].
% 21.15/21.49 393 -occurrence_of(A,B) | atocc(A,B) | -atomic(B). [factor(370,a,d)].
% 21.15/21.49 394 -atomic(c1). [resolve(195,a,184,a)].
% 21.15/21.49 397 subactivity_occurrence(f14(c1,c3),c3). [resolve(219,a,183,a),unit_del(a,394)].
% 21.15/21.49 398 -occurrence_of(A,c1) | root_occ(f20(c1,tptp0,c2,A),A). [resolve(224,a,184,a)].
% 21.15/21.49 399 -occurrence_of(A,c1) | occurrence_of(f20(c1,tptp0,c2,A),f17(c1,tptp0,c2,A)). [resolve(225,a,184,a)].
% 21.15/21.49 403 root_occ(c2,A) | -occurrence_of(A,tptp0) | -subactivity_occurrence(c2,A). [resolve(233,d,184,a)].
% 21.15/21.49 415 -occurrence_of(A,c1) | f17(c1,tptp0,c2,A) != tptp3. [resolve(275,a,184,a)].
% 21.15/21.49 416 -occurrence_of(A,c1) | f17(c1,tptp0,c2,A) != tptp2. [resolve(276,a,184,a)].
% 21.15/21.49 418 -occurrence_of(A,c1) | -occurrence_of(B,f17(c1,tptp0,c2,A)) | min_precedes(c2,B,tptp0). [resolve(278,a,184,a)].
% 21.15/21.49 432 arboreal(f14(c1,c3)). [resolve(310,a,183,a),unit_del(a,394)].
% 21.15/21.49 476 root_occ(f14(c1,c3),c3). [resolve(397,a,381,c),unit_del(b,183),unit_del(c,394)].
% 21.15/21.49 477 occurrence_of(f14(c1,c3),f7(f14(c1,c3))). [resolve(397,a,364,b)].
% 21.15/21.49 484 f17(c1,tptp0,c2,c3) != tptp3. [resolve(415,a,183,a)].
% 21.15/21.49 485 f17(c1,tptp0,c2,c3) != tptp2. [resolve(416,a,183,a)].
% 21.15/21.49 502 -occurrence_of(c3,A) | -root_occ(B,c3) | f14(c1,c3) = B. [resolve(476,a,222,c)].
% 21.15/21.49 504 root_occ(f20(c1,tptp0,c2,c3),c3). [resolve(398,a,183,a)].
% 21.15/21.49 519 occurrence_of(f20(c1,tptp0,c2,c3),f17(c1,tptp0,c2,c3)). [resolve(399,a,183,a)].
% 21.15/21.49 620 -occurrence_of(f14(c1,c3),A) | f7(f14(c1,c3)) = A. [resolve(477,a,213,b)].
% 21.15/21.49 980 -occurrence_of(c3,A) | f20(c1,tptp0,c2,c3) = f14(c1,c3). [resolve(502,b,504,a),flip(b)].
% 21.15/21.49 981 min_precedes(c2,f20(c1,tptp0,c2,c3),tptp0). [resolve(519,a,418,b),unit_del(a,183)].
% 21.15/21.49 1004 subactivity_occurrence(f20(c1,tptp0,c2,c3),f9(tptp0,c2,f20(c1,tptp0,c2,c3))). [resolve(981,a,216,a)].
% 21.15/21.49 1005 subactivity_occurrence(c2,f9(tptp0,c2,f20(c1,tptp0,c2,c3))). [resolve(981,a,215,a)].
% 21.15/21.49 1006 occurrence_of(f9(tptp0,c2,f20(c1,tptp0,c2,c3)),tptp0). [resolve(981,a,214,a)].
% 21.15/21.49 1111 root_occ(c2,f9(tptp0,c2,f20(c1,tptp0,c2,c3))). [resolve(1005,a,403,c),unit_del(b,1006)].
% 21.15/21.49 1120 arboreal(f16(f9(tptp0,c2,f20(c1,tptp0,c2,c3)))). [resolve(1006,a,290,a)].
% 21.15/21.49 1127 occurrence_of(f16(f9(tptp0,c2,f20(c1,tptp0,c2,c3))),tptp3) | occurrence_of(f16(f9(tptp0,c2,f20(c1,tptp0,c2,c3))),tptp2). [resolve(1006,a,220,a)].
% 21.15/21.49 1129 -occurrence_of(f9(tptp0,c2,f20(c1,tptp0,c2,c3)),A) | tptp0 = A. [resolve(1006,a,213,b)].
% 21.15/21.49 1130 leaf_occ(f16(f9(tptp0,c2,f20(c1,tptp0,c2,c3))),f9(tptp0,c2,f20(c1,tptp0,c2,c3))). [resolve(1006,a,208,a)].
% 21.15/21.49 1131 root_occ(f15(f9(tptp0,c2,f20(c1,tptp0,c2,c3))),f9(tptp0,c2,f20(c1,tptp0,c2,c3))). [resolve(1006,a,207,a)].
% 21.15/21.49 1212 -occurrence_of(f9(tptp0,c2,f20(c1,tptp0,c2,c3)),A) | -root_occ(B,f9(tptp0,c2,f20(c1,tptp0,c2,c3))) | c2 = B. [resolve(1111,a,222,c)].
% 21.15/21.49 1272 f20(c1,tptp0,c2,c3) = f14(c1,c3). [resolve(980,a,183,a)].
% 21.15/21.49 1284 -occurrence_of(f9(tptp0,c2,f14(c1,c3)),A) | -root_occ(B,f9(tptp0,c2,f14(c1,c3))) | c2 = B. [back_rewrite(1212),rewrite([1272(7),1272(14)])].
% 21.15/21.49 1297 root_occ(f15(f9(tptp0,c2,f14(c1,c3))),f9(tptp0,c2,f14(c1,c3))). [back_rewrite(1131),rewrite([1272(7),1272(14)])].
% 21.15/21.49 1298 leaf_occ(f16(f9(tptp0,c2,f14(c1,c3))),f9(tptp0,c2,f14(c1,c3))). [back_rewrite(1130),rewrite([1272(7),1272(14)])].
% 21.15/21.49 1299 -occurrence_of(f9(tptp0,c2,f14(c1,c3)),A) | tptp0 = A. [back_rewrite(1129),rewrite([1272(7)])].
% 21.15/21.49 1301 occurrence_of(f16(f9(tptp0,c2,f14(c1,c3))),tptp3) | occurrence_of(f16(f9(tptp0,c2,f14(c1,c3))),tptp2). [back_rewrite(1127),rewrite([1272(7),1272(16)])].
% 21.15/21.49 1308 arboreal(f16(f9(tptp0,c2,f14(c1,c3)))). [back_rewrite(1120),rewrite([1272(7)])].
% 21.15/21.49 1329 occurrence_of(f9(tptp0,c2,f14(c1,c3)),tptp0). [back_rewrite(1006),rewrite([1272(7)])].
% 21.15/21.49 1331 subactivity_occurrence(f14(c1,c3),f9(tptp0,c2,f14(c1,c3))). [back_rewrite(1004),rewrite([1272(5),1272(10)])].
% 21.15/21.49 1350 min_precedes(c2,f14(c1,c3),tptp0). [back_rewrite(981),rewrite([1272(6)])].
% 21.15/21.49 1351 occurrence_of(f14(c1,c3),f17(c1,tptp0,c2,c3)). [back_rewrite(519),rewrite([1272(5)])].
% 21.15/21.49 1354 f17(c1,tptp0,c2,c3) = f7(f14(c1,c3)). [resolve(1351,a,620,a),flip(a)].
% 21.15/21.49 1355 f7(f14(c1,c3)) != tptp2. [back_rewrite(485),rewrite([1354(5)])].
% 21.15/21.49 1356 f7(f14(c1,c3)) != tptp3. [back_rewrite(484),rewrite([1354(5)])].
% 21.15/21.49 1379 -occurrence_of(f9(tptp0,c2,f14(c1,c3)),A) | -arboreal(B) | -subactivity_occurrence(B,f9(tptp0,c2,f14(c1,c3))) | min_precedes(B,f14(c1,c3),A) | min_precedes(f14(c1,c3),B,A) | f14(c1,c3) = B. [resolve(1331,a,226,e),unit_del(c,432)].
% 21.15/21.49 1585 occurrence_of(f9(tptp0,c2,f14(c1,c3)),f3(f16(f9(tptp0,c2,f14(c1,c3))),f9(tptp0,c2,f14(c1,c3)))). [resolve(1298,a,210,a)].
% 21.15/21.49 1586 subactivity_occurrence(f16(f9(tptp0,c2,f14(c1,c3))),f9(tptp0,c2,f14(c1,c3))). [resolve(1298,a,201,a)].
% 21.15/21.49 1827 occurrence_of(f16(f9(tptp0,c2,f14(c1,c3))),f7(f16(f9(tptp0,c2,f14(c1,c3))))). [resolve(1586,a,364,b)].
% 21.15/21.49 2310 atocc(f16(f9(tptp0,c2,f14(c1,c3))),f7(f16(f9(tptp0,c2,f14(c1,c3))))) | -atomic(f7(f16(f9(tptp0,c2,f14(c1,c3))))). [resolve(1827,a,393,a)].
% 21.15/21.49 2318 -occurrence_of(f16(f9(tptp0,c2,f14(c1,c3))),A) | f7(f16(f9(tptp0,c2,f14(c1,c3)))) = A. [resolve(1827,a,213,b)].
% 21.15/21.49 2319 atomic(f7(f16(f9(tptp0,c2,f14(c1,c3))))). [resolve(1827,a,203,a),unit_del(a,1308)].
% 21.15/21.49 2320 atocc(f16(f9(tptp0,c2,f14(c1,c3))),f7(f16(f9(tptp0,c2,f14(c1,c3))))). [back_unit_del(2310),unit_del(b,2319)].
% 21.15/21.49 2389 occurrence_of(f16(f9(tptp0,c2,f14(c1,c3))),f6(f16(f9(tptp0,c2,f14(c1,c3))),f7(f16(f9(tptp0,c2,f14(c1,c3)))))). [resolve(2320,a,211,a)].
% 21.15/21.49 3592 occurrence_of(f16(f9(tptp0,c2,f14(c1,c3))),tptp2) | atocc(f16(f9(tptp0,c2,f14(c1,c3))),tptp3). [resolve(1301,a,393,a),unit_del(c,180)].
% 21.15/21.49 3593 occurrence_of(f16(f9(tptp0,c2,f14(c1,c3))),tptp2) | -occurrence_of(f16(f9(tptp0,c2,f14(c1,c3))),A) | tptp3 = A. [resolve(1301,a,213,b)].
% 21.15/21.49 4371 occurrence_of(f16(f9(tptp0,c2,f14(c1,c3))),tptp2) | occurrence_of(f16(f9(tptp0,c2,f14(c1,c3))),f6(f16(f9(tptp0,c2,f14(c1,c3))),tptp3)). [resolve(3592,b,211,a)].
% 21.15/21.49 6578 -occurrence_of(f9(tptp0,c2,f14(c1,c3)),A) | f15(f9(tptp0,c2,f14(c1,c3))) = c2. [resolve(1284,b,1297,a),flip(b)].
% 21.15/21.49 6584 f15(f9(tptp0,c2,f14(c1,c3))) = c2. [resolve(6578,a,1329,a)].
% 21.15/21.49 6618 -min_precedes(c2,A,tptp0) | -min_precedes(A,f16(f9(tptp0,c2,f14(c1,c3))),tptp0). [para(6584(a,1),288(b,1)),unit_del(a,1329)].
% 21.15/21.49 7546 f7(f16(f9(tptp0,c2,f14(c1,c3)))) = tptp3 | occurrence_of(f16(f9(tptp0,c2,f14(c1,c3))),tptp2). [resolve(2318,a,1301,a)].
% 21.15/21.49 7673 -occurrence_of(f9(tptp0,c2,f14(c1,c3)),A) | min_precedes(f16(f9(tptp0,c2,f14(c1,c3))),f14(c1,c3),A) | min_precedes(f14(c1,c3),f16(f9(tptp0,c2,f14(c1,c3))),A) | f16(f9(tptp0,c2,f14(c1,c3))) = f14(c1,c3). [resolve(1379,c,1586,a),flip(e),unit_del(b,1308)].
% 21.15/21.49 9043 f7(f16(f9(tptp0,c2,f14(c1,c3)))) = tptp3 | f7(f16(f9(tptp0,c2,f14(c1,c3)))) = tptp2. [resolve(7546,b,2318,a)].
% 21.15/21.49 9647 f3(f16(f9(tptp0,c2,f14(c1,c3))),f9(tptp0,c2,f14(c1,c3))) = tptp0. [resolve(1585,a,1299,a),flip(a)].
% 21.15/21.49 9783 -min_precedes(f16(f9(tptp0,c2,f14(c1,c3))),A,tptp0). [para(9647(a,1),236(b,3)),unit_del(a,1298)].
% 21.15/21.49 11292 f7(f16(f9(tptp0,c2,f14(c1,c3)))) = tptp2 | occurrence_of(f16(f9(tptp0,c2,f14(c1,c3))),tptp3). [para(9043(a,1),1827(a,2))].
% 21.15/21.49 11294 f7(f16(f9(tptp0,c2,f14(c1,c3)))) = tptp2 | -occurrence_of(f16(f9(tptp0,c2,f14(c1,c3))),A) | tptp3 = A. [resolve(11292,b,213,b)].
% 21.15/21.49 16292 f6(f16(f9(tptp0,c2,f14(c1,c3))),f7(f16(f9(tptp0,c2,f14(c1,c3))))) = f7(f16(f9(tptp0,c2,f14(c1,c3)))). [resolve(2389,a,2318,a),flip(a)].
% 21.15/21.49 23229 f7(f16(f9(tptp0,c2,f14(c1,c3)))) = tptp2 | f6(f16(f9(tptp0,c2,f14(c1,c3))),tptp3) = f7(f16(f9(tptp0,c2,f14(c1,c3)))). [para(9043(a,1),16292(a,1,2))].
% 21.15/21.49 23944 occurrence_of(f16(f9(tptp0,c2,f14(c1,c3))),tptp2) | f6(f16(f9(tptp0,c2,f14(c1,c3))),tptp3) = tptp3. [resolve(4371,b,3593,b),flip(c),merge(b)].
% 21.15/21.49 23946 f6(f16(f9(tptp0,c2,f14(c1,c3))),tptp3) = tptp3 | f7(f16(f9(tptp0,c2,f14(c1,c3)))) = tptp2. [resolve(23944,a,11294,b),unit_del(c,192)].
% 21.15/21.49 31920 min_precedes(f14(c1,c3),f16(f9(tptp0,c2,f14(c1,c3))),tptp0) | f16(f9(tptp0,c2,f14(c1,c3))) = f14(c1,c3). [resolve(7673,a,1329,a),unit_del(a,9783)].
% 21.15/21.49 31921 f16(f9(tptp0,c2,f14(c1,c3))) = f14(c1,c3). [resolve(31920,a,6618,b),unit_del(b,1350)].
% 21.15/21.49 32066 f6(f14(c1,c3),tptp3) = tptp3. [back_rewrite(23946),rewrite([31921(7),31921(14)]),unit_del(b,1355)].
% 21.15/21.49 32068 $F. [back_rewrite(23229),rewrite([31921(7),31921(13),32066(11),31921(14)]),flip(b),unit_del(a,1355),unit_del(b,1356)].
% 21.15/21.49
% 21.15/21.49 % SZS output end Refutation
% 21.15/21.49 ============================== end of proof ==========================
% 21.15/21.49
% 21.15/21.49 ============================== STATISTICS ============================
% 21.15/21.49
% 21.15/21.49 Given=14295. Generated=193025. Kept=31884. proofs=1.
% 21.15/21.49 Usable=8816. Sos=7068. Demods=208. Limbo=147, Disabled=16204. Hints=0.
% 21.15/21.49 Megabytes=51.53.
% 21.15/21.49 User_CPU=20.36, System_CPU=0.12, Wall_clock=20.
% 21.15/21.49
% 21.15/21.49 ============================== end of statistics =====================
% 21.15/21.49
% 21.15/21.49 ============================== end of search =========================
% 21.15/21.49
% 21.15/21.49 THEOREM PROVED
% 21.15/21.49 % SZS status Theorem
% 21.15/21.49
% 21.15/21.49 Exiting with 1 proof.
% 21.15/21.49
% 21.15/21.49 Process 12055 exit (max_proofs) Mon Jun 13 03:28:13 2022
% 21.15/21.49 Prover9 interrupted
%------------------------------------------------------------------------------