TSTP Solution File: PRO003+2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PRO003+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n027.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:04 EDT 2022
% Result : Theorem 35.71s 36.02s
% Output : Refutation 35.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : PRO003+2 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n027.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 03:36:16 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.41/1.00 ============================== Prover9 ===============================
% 0.41/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.41/1.00 Process 28728 was started by sandbox2 on n027.cluster.edu,
% 0.41/1.00 Mon Jun 13 03:36:17 2022
% 0.41/1.00 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_28573_n027.cluster.edu".
% 0.41/1.00 ============================== end of head ===========================
% 0.41/1.00
% 0.41/1.00 ============================== INPUT =================================
% 0.41/1.00
% 0.41/1.00 % Reading from file /tmp/Prover9_28573_n027.cluster.edu
% 0.41/1.00
% 0.41/1.00 set(prolog_style_variables).
% 0.41/1.00 set(auto2).
% 0.41/1.00 % set(auto2) -> set(auto).
% 0.41/1.00 % set(auto) -> set(auto_inference).
% 0.41/1.00 % set(auto) -> set(auto_setup).
% 0.41/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.41/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/1.00 % set(auto) -> set(auto_limits).
% 0.41/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/1.00 % set(auto) -> set(auto_denials).
% 0.41/1.00 % set(auto) -> set(auto_process).
% 0.41/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.41/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.41/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.41/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.41/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.41/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.41/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.41/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.41/1.00 % set(auto2) -> assign(stats, some).
% 0.41/1.00 % set(auto2) -> clear(echo_input).
% 0.41/1.00 % set(auto2) -> set(quiet).
% 0.41/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.41/1.00 % set(auto2) -> clear(print_given).
% 0.41/1.00 assign(lrs_ticks,-1).
% 0.41/1.00 assign(sos_limit,10000).
% 0.41/1.00 assign(order,kbo).
% 0.41/1.00 set(lex_order_vars).
% 0.41/1.00 clear(print_given).
% 0.41/1.00
% 0.41/1.00 % formulas(sos). % not echoed (47 formulas)
% 0.41/1.00
% 0.41/1.00 ============================== end of input ==========================
% 0.41/1.00
% 0.41/1.00 % From the command line: assign(max_seconds, 300).
% 0.41/1.00
% 0.41/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/1.00
% 0.41/1.00 % Formulas that are not ordinary clauses:
% 0.41/1.00 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.41/1.00 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.41/1.00 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.41/1.00 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.41/1.00 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.41/1.00 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.41/1.00 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.41/1.00 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.41/1.00 9 (all X28 all X29 (precedes(X28,X29) <-> earlier(X28,X29) & legal(X29))) # label(sos_08) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 10 (all X30 all X31 (earlier(X30,X31) -> -earlier(X31,X30))) # label(sos_09) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 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.41/1.00 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.41/1.00 13 (all X38 all X39 (root(X38,X39) -> legal(X38))) # label(sos_12) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 14 (all X40 all X41 (occurrence_of(X40,X41) -> (arboreal(X40) <-> atomic(X41)))) # label(sos_13) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 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.41/1.00 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.41/1.00 17 (all X49 all X50 (atocc(X49,X50) & legal(X49) -> root(X49,X50))) # label(sos_16) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 18 (all X51 (legal(X51) -> arboreal(X51))) # label(sos_17) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 19 (all X52 (activity_occurrence(X52) -> (exists X53 (activity(X53) & occurrence_of(X52,X53))))) # label(sos_18) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 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.41/1.00 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.41/1.00 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.41/1.00 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.41/1.00 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.41/1.00 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.41/1.00 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.41/1.00 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.41/1.00 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.41/1.00 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.41/1.00 30 (all X89 all X90 (occurrence_of(X90,X89) -> activity(X89) & activity_occurrence(X90))) # label(sos_29) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 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.41/1.00 32 (all X94 (activity(X94) -> subactivity(X94,X94))) # label(sos_31) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 33 (all X95 (occurrence_of(X95,tptp0) -> (exists X96 exists X97 (occurrence_of(X96,tptp4) & root_occ(X96,X95) & occurrence_of(X97,tptp3) & leaf_occ(X97,X95) & next_subocc(X96,X97,tptp0))))) # label(sos_32) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 34 (all X98 all X99 (occurrence_of(X99,tptp0) & root_occ(X98,X99) -> (exists X100 (occurrence_of(X100,tptp1) & next_subocc(X98,X100,tptp0))))) # label(sos_45) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 35 --(exists X101 occurrence_of(X101,tptp0)) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.41/1.01
% 0.41/1.01 ============================== end of process non-clausal formulas ===
% 0.41/1.01
% 0.41/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.41/1.01
% 0.41/1.01 ============================== PREDICATE ELIMINATION =================
% 0.41/1.01 36 -activity(A) | subactivity(A,A) # label(sos_31) # label(axiom). [clausify(32)].
% 0.41/1.01 37 activity(tptp0) # label(sos_33) # label(axiom). [assumption].
% 0.41/1.01 38 -activity_occurrence(A) | activity(f7(A)) # label(sos_18) # label(axiom). [clausify(19)].
% 0.41/1.01 39 -occurrence_of(A,B) | activity(B) # label(sos_29) # label(axiom). [clausify(30)].
% 0.41/1.01 Derived: subactivity(tptp0,tptp0). [resolve(36,a,37,a)].
% 0.41/1.01 Derived: subactivity(f7(A),f7(A)) | -activity_occurrence(A). [resolve(36,a,38,b)].
% 0.41/1.01 Derived: subactivity(A,A) | -occurrence_of(B,A). [resolve(36,a,39,b)].
% 0.41/1.01 40 -root_occ(A,B) | root(A,f2(A,B)) # label(sos_10) # label(axiom). [clausify(11)].
% 0.41/1.01 41 -min_precedes(A,B,C) | -root(B,C) # label(sos_07) # label(axiom). [clausify(8)].
% 0.41/1.01 42 -root(A,B) | legal(A) # label(sos_12) # label(axiom). [clausify(13)].
% 0.41/1.01 Derived: -root_occ(A,B) | -min_precedes(C,A,f2(A,B)). [resolve(40,b,41,b)].
% 0.41/1.01 Derived: -root_occ(A,B) | legal(A). [resolve(40,b,42,a)].
% 0.41/1.01 43 -atocc(A,B) | -legal(A) | root(A,B) # label(sos_16) # label(axiom). [clausify(17)].
% 0.41/1.01 Derived: -atocc(A,B) | -legal(A) | -min_precedes(C,A,B). [resolve(43,c,41,b)].
% 0.41/1.01 44 -root(A,B) | subactivity(f13(B,A),B) # label(sos_27) # label(axiom). [clausify(28)].
% 0.41/1.01 Derived: subactivity(f13(f2(A,B),A),f2(A,B)) | -root_occ(A,B). [resolve(44,a,40,b)].
% 0.41/1.01 Derived: subactivity(f13(A,B),A) | -atocc(B,A) | -legal(B). [resolve(44,a,43,c)].
% 0.41/1.01 45 -root(A,B) | atocc(A,f13(B,A)) # label(sos_27) # label(axiom). [clausify(28)].
% 0.41/1.01 Derived: atocc(A,f13(f2(A,B),A)) | -root_occ(A,B). [resolve(45,a,40,b)].
% 0.41/1.01 Derived: atocc(A,f13(B,A)) | -atocc(A,B) | -legal(A). [resolve(45,a,43,c)].
% 0.41/1.01 46 -occurrence_of(A,B) | atomic(B) | root(f14(B,A),B) # label(sos_30) # label(axiom). [clausify(31)].
% 0.41/1.01 Derived: -occurrence_of(A,B) | atomic(B) | -min_precedes(C,f14(B,A),B). [resolve(46,c,41,b)].
% 0.41/1.01 Derived: -occurrence_of(A,B) | atomic(B) | legal(f14(B,A)). [resolve(46,c,42,a)].
% 0.41/1.01 Derived: -occurrence_of(A,B) | atomic(B) | subactivity(f13(B,f14(B,A)),B). [resolve(46,c,44,a)].
% 0.41/1.01 Derived: -occurrence_of(A,B) | atomic(B) | atocc(f14(B,A),f13(B,f14(B,A))). [resolve(46,c,45,a)].
% 0.41/1.01 47 root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -root(A,C) # label(sos_10) # label(axiom). [clausify(11)].
% 0.41/1.01 Derived: root_occ(A,B) | -occurrence_of(B,f2(A,C)) | -subactivity_occurrence(A,B) | -root_occ(A,C). [resolve(47,d,40,b)].
% 0.41/1.01 Derived: root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -atocc(A,C) | -legal(A). [resolve(47,d,43,c)].
% 0.41/1.01 Derived: root_occ(f14(A,B),C) | -occurrence_of(C,A) | -subactivity_occurrence(f14(A,B),C) | -occurrence_of(B,A) | atomic(A). [resolve(47,d,46,c)].
% 0.41/1.01 48 -leaf(A,B) | root(A,B) | min_precedes(f4(A,B),A,B) # label(sos_14) # label(axiom). [clausify(15)].
% 0.41/1.01 Derived: -leaf(A,B) | min_precedes(f4(A,B),A,B) | -min_precedes(C,A,B). [resolve(48,b,41,b)].
% 0.41/1.01 Derived: -leaf(A,B) | min_precedes(f4(A,B),A,B) | legal(A). [resolve(48,b,42,a)].
% 0.41/1.01 Derived: -leaf(A,B) | min_precedes(f4(A,B),A,B) | subactivity(f13(B,A),B). [resolve(48,b,44,a)].
% 0.41/1.01 Derived: -leaf(A,B) | min_precedes(f4(A,B),A,B) | atocc(A,f13(B,A)). [resolve(48,b,45,a)].
% 0.41/1.01 Derived: -leaf(A,B) | min_precedes(f4(A,B),A,B) | root_occ(A,C) | -occurrence_of(C,B) | -subactivity_occurrence(A,C). [resolve(48,b,47,d)].
% 0.41/1.01 49 leaf(A,B) | -root(A,B) | min_precedes(A,f5(A,B),B) # label(sos_14) # label(axiom). [clausify(15)].
% 0.41/1.01 Derived: leaf(A,f2(A,B)) | min_precedes(A,f5(A,f2(A,B)),f2(A,B)) | -root_occ(A,B). [resolve(49,b,40,b)].
% 0.41/1.01 Derived: leaf(A,B) | min_precedes(A,f5(A,B),B) | -atocc(A,B) | -legal(A). [resolve(49,b,43,c)].
% 0.41/1.01 Derived: leaf(f14(A,B),A) | min_precedes(f14(A,B),f5(f14(A,B),A),A) | -occurrence_of(B,A) | atomic(A). [resolve(49,b,46,c)].
% 0.41/1.01 50 -leaf_occ(A,B) | leaf(A,f3(A,B)) # label(sos_11) # label(axiom). [clausify(12)].
% 0.41/1.01 51 -leaf(A,B) | -min_precedes(A,C,B) # label(sos_14) # label(axiom). [clausify(15)].
% 0.41/1.01 Derived: -leaf_occ(A,B) | -min_precedes(A,C,f3(A,B)). [resolve(50,b,51,a)].
% 0.41/1.01 52 -leaf(A,B) | atomic(B) | occurrence_of(f8(A,B),B) # label(sos_23) # label(axiom). [clausify(24)].
% 0.41/1.01 Derived: atomic(f3(A,B)) | occurrence_of(f8(A,f3(A,B)),f3(A,B)) | -leaf_occ(A,B). [resolve(52,a,50,b)].
% 0.41/1.01 53 -leaf(A,B) | atomic(B) | leaf_occ(A,f8(A,B)) # label(sos_23) # label(axiom). [clausify(24)].
% 0.41/1.01 Derived: atomic(f3(A,B)) | leaf_occ(A,f8(A,f3(A,B))) | -leaf_occ(A,B). [resolve(53,a,50,b)].
% 0.41/1.01 54 -leaf(A,B) | atomic(B) | occurrence_of(f10(A,B),B) # label(sos_25) # label(axiom). [clausify(26)].
% 0.41/1.01 Derived: atomic(f3(A,B)) | occurrence_of(f10(A,f3(A,B)),f3(A,B)) | -leaf_occ(A,B). [resolve(54,a,50,b)].
% 0.41/1.01 55 -leaf(A,B) | atomic(B) | leaf_occ(A,f10(A,B)) # label(sos_25) # label(axiom). [clausify(26)].
% 0.41/1.01 Derived: atomic(f3(A,B)) | leaf_occ(A,f10(A,f3(A,B))) | -leaf_occ(A,B). [resolve(55,a,50,b)].
% 0.41/1.01 56 leaf_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -leaf(A,C) # label(sos_11) # label(axiom). [clausify(12)].
% 0.41/1.01 Derived: leaf_occ(A,B) | -occurrence_of(B,f3(A,C)) | -subactivity_occurrence(A,B) | -leaf_occ(A,C). [resolve(56,d,50,b)].
% 0.41/1.01 57 leaf(A,B) | -min_precedes(C,A,B) | min_precedes(A,f5(A,B),B) # label(sos_14) # label(axiom). [clausify(15)].
% 0.41/1.01 Derived: -min_precedes(A,B,C) | min_precedes(B,f5(B,C),C) | -min_precedes(B,D,C). [resolve(57,a,51,a)].
% 0.41/1.01 Derived: -min_precedes(A,B,C) | min_precedes(B,f5(B,C),C) | atomic(C) | occurrence_of(f8(B,C),C). [resolve(57,a,52,a)].
% 0.41/1.01 Derived: -min_precedes(A,B,C) | min_precedes(B,f5(B,C),C) | atomic(C) | leaf_occ(B,f8(B,C)). [resolve(57,a,53,a)].
% 0.41/1.01 Derived: -min_precedes(A,B,C) | min_precedes(B,f5(B,C),C) | atomic(C) | occurrence_of(f10(B,C),C). [resolve(57,a,54,a)].
% 0.41/1.01 Derived: -min_precedes(A,B,C) | min_precedes(B,f5(B,C),C) | atomic(C) | leaf_occ(B,f10(B,C)). [resolve(57,a,55,a)].
% 0.41/1.01 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(57,a,56,d)].
% 0.41/1.01 58 -leaf(A,B) | min_precedes(f4(A,B),A,B) | -min_precedes(C,A,B). [resolve(48,b,41,b)].
% 0.41/1.01 Derived: min_precedes(f4(A,f3(A,B)),A,f3(A,B)) | -min_precedes(C,A,f3(A,B)) | -leaf_occ(A,B). [resolve(58,a,50,b)].
% 0.41/1.01 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(58,a,57,a)].
% 0.41/1.01 59 -leaf(A,B) | min_precedes(f4(A,B),A,B) | legal(A). [resolve(48,b,42,a)].
% 0.41/1.01 Derived: min_precedes(f4(A,f3(A,B)),A,f3(A,B)) | legal(A) | -leaf_occ(A,B). [resolve(59,a,50,b)].
% 0.41/1.01 60 -leaf(A,B) | min_precedes(f4(A,B),A,B) | subactivity(f13(B,A),B). [resolve(48,b,44,a)].
% 0.41/1.01 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(60,a,50,b)].
% 0.41/1.01 61 -leaf(A,B) | min_precedes(f4(A,B),A,B) | atocc(A,f13(B,A)). [resolve(48,b,45,a)].
% 0.41/1.01 Derived: min_precedes(f4(A,f3(A,B)),A,f3(A,B)) | atocc(A,f13(f3(A,B),A)) | -leaf_occ(A,B). [resolve(61,a,50,b)].
% 0.41/1.01 62 -leaf(A,B) | min_precedes(f4(A,B),A,B) | root_occ(A,C) | -occurrence_of(C,B) | -subactivity_occurrence(A,C). [resolve(48,b,47,d)].
% 0.41/1.01 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(62,a,50,b)].
% 0.41/1.01 63 leaf(A,f2(A,B)) | min_precedes(A,f5(A,f2(A,B)),f2(A,B)) | -root_occ(A,B). [resolve(49,b,40,b)].
% 0.41/1.01 Derived: min_precedes(A,f5(A,f2(A,B)),f2(A,B)) | -root_occ(A,B) | -min_precedes(A,C,f2(A,B)). [resolve(63,a,51,a)].
% 0.41/1.01 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(63,a,52,a)].
% 0.41/1.01 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(63,a,53,a)].
% 0.41/1.01 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(63,a,54,a)].
% 0.41/1.01 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(63,a,55,a)].
% 0.41/1.01 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(63,a,56,d)].
% 0.41/1.01 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(63,a,59,a)].
% 0.41/1.01 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(63,a,60,a)].
% 0.41/1.01 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(63,a,61,a)].
% 0.41/1.01 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(63,a,62,a)].
% 0.41/1.01 64 leaf(A,B) | min_precedes(A,f5(A,B),B) | -atocc(A,B) | -legal(A). [resolve(49,b,43,c)].
% 0.41/1.01 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | -legal(A) | -min_precedes(A,C,B). [resolve(64,a,51,a)].
% 0.41/1.01 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | -legal(A) | atomic(B) | occurrence_of(f8(A,B),B). [resolve(64,a,52,a)].
% 0.41/1.01 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | -legal(A) | atomic(B) | leaf_occ(A,f8(A,B)). [resolve(64,a,53,a)].
% 0.41/1.01 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | -legal(A) | atomic(B) | occurrence_of(f10(A,B),B). [resolve(64,a,54,a)].
% 0.41/1.01 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | -legal(A) | atomic(B) | leaf_occ(A,f10(A,B)). [resolve(64,a,55,a)].
% 0.41/1.01 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(64,a,56,d)].
% 0.41/1.01 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(64,a,60,a)].
% 0.41/1.01 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(64,a,61,a)].
% 0.41/1.01 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(64,a,62,a)].
% 0.41/1.01 65 leaf(f14(A,B),A) | min_precedes(f14(A,B),f5(f14(A,B),A),A) | -occurrence_of(B,A) | atomic(A). [resolve(49,b,46,c)].
% 0.41/1.01 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(65,a,51,a)].
% 0.41/1.01 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(65,a,52,a)].
% 0.41/1.01 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(65,a,53,a)].
% 0.41/1.01 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(65,a,54,a)].
% 0.41/1.01 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(65,a,55,a)].
% 0.41/1.01 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(65,a,56,d)].
% 0.41/1.01 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(65,a,59,a)].
% 0.41/1.01 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(65,a,60,a)].
% 0.41/1.01 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(65,a,61,a)].
% 0.41/1.01 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(65,a,62,a)].
% 0.41/1.01 66 -occurrence_of(A,tptp0) | next_subocc(f15(A),f16(A),tptp0) # label(sos_32) # label(axiom). [clausify(33)].
% 0.41/1.01 67 -next_subocc(A,B,C) | -min_precedes(A,D,C) | -min_precedes(D,B,C) # label(sos_04) # label(axiom). [clausify(5)].
% 0.41/1.01 68 -next_subocc(A,B,C) | arboreal(A) # label(sos_05) # label(axiom). [clausify(6)].
% 0.41/1.01 69 -next_subocc(A,B,C) | arboreal(B) # label(sos_05) # label(axiom). [clausify(6)].
% 0.41/1.01 70 -next_subocc(A,B,C) | min_precedes(A,B,C) # label(sos_04) # label(axiom). [clausify(5)].
% 0.41/1.01 Derived: -occurrence_of(A,tptp0) | -min_precedes(f15(A),B,tptp0) | -min_precedes(B,f16(A),tptp0). [resolve(66,b,67,a)].
% 0.41/1.01 Derived: -occurrence_of(A,tptp0) | arboreal(f15(A)). [resolve(66,b,68,a)].
% 0.41/1.01 Derived: -occurrence_of(A,tptp0) | arboreal(f16(A)). [resolve(66,b,69,a)].
% 0.41/1.01 Derived: -occurrence_of(A,tptp0) | min_precedes(f15(A),f16(A),tptp0). [resolve(66,b,70,a)].
% 0.41/1.01 71 -occurrence_of(A,tptp0) | -root_occ(B,A) | next_subocc(B,f17(B,A),tptp0) # label(sos_45) # label(axiom). [clausify(34)].
% 0.41/1.01 Derived: -occurrence_of(A,tptp0) | -root_occ(B,A) | -min_precedes(B,C,tptp0) | -min_precedes(C,f17(B,A),tptp0). [resolve(71,c,67,a)].
% 0.41/1.01 Derived: -occurrence_of(A,tptp0) | -root_occ(B,A) | arboreal(B). [resolve(71,c,68,a)].
% 0.41/1.01 Derived: -occurrence_of(A,tptp0) | -root_occ(B,A) | arboreal(f17(B,A)). [resolve(71,c,69,a)].
% 0.41/1.01 Derived: -occurrence_of(A,tptp0) | -root_occ(B,A) | min_precedes(B,f17(B,A),tptp0). [resolve(71,c,70,a)].
% 0.41/1.01 72 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.41/1.01 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(72,a,67,a)].
% 0.41/1.01 Derived: -min_precedes(A,B,C) | min_precedes(A,f1(A,B,C),C) | arboreal(A). [resolve(72,a,68,a)].
% 0.41/1.01 Derived: -min_precedes(A,B,C) | min_precedes(A,f1(A,B,C),C) | arboreal(B). [resolve(72,a,69,a)].
% 0.41/1.01 73 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.41/1.01 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(73,a,67,a)].
% 0.41/1.01 Derived: -min_precedes(A,B,C) | min_precedes(f1(A,B,C),B,C) | arboreal(A). [resolve(73,a,68,a)].
% 0.41/1.01 Derived: -min_precedes(A,B,C) | min_precedes(f1(A,B,C),B,C) | arboreal(B). [resolve(73,a,69,a)].
% 0.41/1.01 74 -precedes(A,B) | legal(B) # label(sos_08) # label(axiom). [clausify(9)].
% 0.41/1.01 75 -legal(A) | arboreal(A) # label(sos_17) # label(axiom). [clausify(18)].
% 0.41/1.01 Derived: -precedes(A,B) | arboreal(B). [resolve(74,b,75,a)].
% 0.41/1.01 76 precedes(A,B) | -earlier(A,B) | -legal(B) # label(sos_08) # label(axiom). [clausify(9)].
% 0.41/1.01 Derived: precedes(A,B) | -earlier(A,B) | -precedes(C,B). [resolve(76,c,74,b)].
% 0.41/1.01 77 -root_occ(A,B) | legal(A). [resolve(40,b,42,a)].
% 0.41/1.01 Derived: -root_occ(A,B) | arboreal(A). [resolve(77,b,75,a)].
% 0.41/1.01 Derived: -root_occ(A,B) | precedes(C,A) | -earlier(C,A). [resolve(77,b,76,c)].
% 0.41/1.01 78 -atocc(A,B) | -legal(A) | -min_precedes(C,A,B). [resolve(43,c,41,b)].
% 0.41/1.01 Derived: -atocc(A,B) | -min_precedes(C,A,B) | -precedes(D,A). [resolve(78,b,74,b)].
% 0.41/1.01 Derived: -atocc(A,B) | -min_precedes(C,A,B) | -root_occ(A,D). [resolve(78,b,77,b)].
% 0.41/1.01 79 subactivity(f13(A,B),A) | -atocc(B,A) | -legal(B). [resolve(44,a,43,c)].
% 0.41/1.01 Derived: subactivity(f13(A,B),A) | -atocc(B,A) | -precedes(C,B). [resolve(79,c,74,b)].
% 0.41/1.01 Derived: subactivity(f13(A,B),A) | -atocc(B,A) | -root_occ(B,C). [resolve(79,c,77,b)].
% 0.41/1.01 80 atocc(A,f13(B,A)) | -atocc(A,B) | -legal(A). [resolve(45,a,43,c)].
% 0.41/1.01 Derived: atocc(A,f13(B,A)) | -atocc(A,B) | -precedes(C,A). [resolve(80,c,74,b)].
% 0.41/1.01 Derived: atocc(A,f13(B,A)) | -atocc(A,B) | -root_occ(A,C). [resolve(80,c,77,b)].
% 0.41/1.01 81 -occurrence_of(A,B) | atomic(B) | legal(f14(B,A)). [resolve(46,c,42,a)].
% 0.41/1.01 Derived: -occurrence_of(A,B) | atomic(B) | arboreal(f14(B,A)). [resolve(81,c,75,a)].
% 0.41/1.01 Derived: -occurrence_of(A,B) | atomic(B) | precedes(C,f14(B,A)) | -earlier(C,f14(B,A)). [resolve(81,c,76,c)].
% 0.41/1.01 Derived: -occurrence_of(A,B) | atomic(B) | -atocc(f14(B,A),C) | -min_precedes(D,f14(B,A),C). [resolve(81,c,78,b)].
% 0.41/1.01 Derived: -occurrence_of(A,B) | atomic(B) | subactivity(f13(C,f14(B,A)),C) | -atocc(f14(B,A),C). [resolve(81,c,79,c)].
% 0.41/1.01 Derived: -occurrence_of(A,B) | atomic(B) | atocc(f14(B,A),f13(C,f14(B,A))) | -atocc(f14(B,A),C). [resolve(81,c,80,c)].
% 0.41/1.01 82 root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -atocc(A,C) | -legal(A). [resolve(47,d,43,c)].
% 0.41/1.02 Derived: root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -atocc(A,C) | -precedes(D,A). [resolve(82,e,74,b)].
% 0.41/1.02 Derived: root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -atocc(A,C) | -root_occ(A,D). [resolve(82,e,77,b)].
% 0.41/1.02 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(82,e,81,c)].
% 0.41/1.02 83 min_precedes(f4(A,f3(A,B)),A,f3(A,B)) | legal(A) | -leaf_occ(A,B). [resolve(59,a,50,b)].
% 0.41/1.02 Derived: min_precedes(f4(A,f3(A,B)),A,f3(A,B)) | -leaf_occ(A,B) | arboreal(A). [resolve(83,b,75,a)].
% 0.41/1.02 Derived: min_precedes(f4(A,f3(A,B)),A,f3(A,B)) | -leaf_occ(A,B) | precedes(C,A) | -earlier(C,A). [resolve(83,b,76,c)].
% 0.41/1.02 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(83,b,78,b)].
% 0.41/1.02 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(83,b,79,c)].
% 0.41/1.02 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(83,b,80,c)].
% 0.41/1.02 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(83,b,82,e)].
% 0.41/1.02 84 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(63,a,59,a)].
% 0.41/1.02 85 min_precedes(A,f5(A,B),B) | -atocc(A,B) | -legal(A) | -min_precedes(A,C,B). [resolve(64,a,51,a)].
% 0.41/1.02 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | -min_precedes(A,C,B) | -precedes(D,A). [resolve(85,c,74,b)].
% 0.41/1.02 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | -min_precedes(A,C,B) | -root_occ(A,D). [resolve(85,c,77,b)].
% 0.41/1.02 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(85,c,81,c)].
% 0.41/1.02 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(85,c,83,b)].
% 0.41/1.02 86 min_precedes(A,f5(A,B),B) | -atocc(A,B) | -legal(A) | atomic(B) | occurrence_of(f8(A,B),B). [resolve(64,a,52,a)].
% 0.41/1.02 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | atomic(B) | occurrence_of(f8(A,B),B) | -precedes(C,A). [resolve(86,c,74,b)].
% 0.41/1.02 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | atomic(B) | occurrence_of(f8(A,B),B) | -root_occ(A,C). [resolve(86,c,77,b)].
% 0.41/1.02 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(86,c,81,c)].
% 0.41/1.02 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(86,c,83,b)].
% 0.41/1.02 87 min_precedes(A,f5(A,B),B) | -atocc(A,B) | -legal(A) | atomic(B) | leaf_occ(A,f8(A,B)). [resolve(64,a,53,a)].
% 0.41/1.02 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | atomic(B) | leaf_occ(A,f8(A,B)) | -precedes(C,A). [resolve(87,c,74,b)].
% 0.41/1.02 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | atomic(B) | leaf_occ(A,f8(A,B)) | -root_occ(A,C). [resolve(87,c,77,b)].
% 0.41/1.02 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(87,c,81,c)].
% 0.41/1.02 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(87,c,83,b)].
% 0.41/1.02 88 min_precedes(A,f5(A,B),B) | -atocc(A,B) | -legal(A) | atomic(B) | occurrence_of(f10(A,B),B). [resolve(64,a,54,a)].
% 0.41/1.02 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | atomic(B) | occurrence_of(f10(A,B),B) | -precedes(C,A). [resolve(88,c,74,b)].
% 0.41/1.02 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | atomic(B) | occurrence_of(f10(A,B),B) | -root_occ(A,C). [resolve(88,c,77,b)].
% 0.41/1.02 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(88,c,81,c)].
% 0.41/1.02 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(88,c,83,b)].
% 0.41/1.02 89 min_precedes(A,f5(A,B),B) | -atocc(A,B) | -legal(A) | atomic(B) | leaf_occ(A,f10(A,B)). [resolve(64,a,55,a)].
% 0.41/1.02 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | atomic(B) | leaf_occ(A,f10(A,B)) | -precedes(C,A). [resolve(89,c,74,b)].
% 0.41/1.02 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | atomic(B) | leaf_occ(A,f10(A,B)) | -root_occ(A,C). [resolve(89,c,77,b)].
% 0.41/1.02 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(89,c,81,c)].
% 0.41/1.02 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(89,c,83,b)].
% 0.41/1.02 90 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(64,a,56,d)].
% 0.41/1.02 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(90,c,74,b)].
% 0.41/1.02 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(90,c,77,b)].
% 0.41/1.02 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(90,c,81,c)].
% 0.41/1.02 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(90,c,83,b)].
% 0.41/1.02 91 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(64,a,60,a)].
% 0.41/1.02 92 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(64,a,61,a)].
% 0.41/1.02 93 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(64,a,62,a)].
% 0.41/1.02 94 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(65,a,59,a)].
% 0.41/1.02 95 -activity_occurrence(A) | occurrence_of(A,f7(A)) # label(sos_18) # label(axiom). [clausify(19)].
% 0.41/1.02 96 -subactivity_occurrence(A,B) | activity_occurrence(A) # label(sos_19) # label(axiom). [clausify(20)].
% 0.41/1.02 97 -subactivity_occurrence(A,B) | activity_occurrence(B) # label(sos_19) # label(axiom). [clausify(20)].
% 0.41/1.02 98 -occurrence_of(A,B) | activity_occurrence(A) # label(sos_29) # label(axiom). [clausify(30)].
% 0.41/1.02 Derived: occurrence_of(A,f7(A)) | -subactivity_occurrence(A,B). [resolve(95,a,96,b)].
% 0.41/1.02 Derived: occurrence_of(A,f7(A)) | -subactivity_occurrence(B,A). [resolve(95,a,97,b)].
% 0.41/1.02 Derived: occurrence_of(A,f7(A)) | -occurrence_of(A,B). [resolve(95,a,98,b)].
% 0.41/1.02 99 subactivity(f7(A),f7(A)) | -activity_occurrence(A). [resolve(36,a,38,b)].
% 0.41/1.02 Derived: subactivity(f7(A),f7(A)) | -subactivity_occurrence(A,B). [resolve(99,b,96,b)].
% 0.41/1.02 Derived: subactivity(f7(A),f7(A)) | -subactivity_occurrence(B,A). [resolve(99,b,97,b)].
% 0.41/1.02 Derived: subactivity(f7(A),f7(A)) | -occurrence_of(A,B). [resolve(99,b,98,b)].
% 0.41/1.02 100 atocc(A,B) | -subactivity(B,C) | -atomic(C) | -occurrence_of(A,C) # label(sos_15) # label(axiom). [clausify(16)].
% 0.41/1.02 101 -atocc(A,B) | subactivity(B,f6(A,B)) # label(sos_15) # label(axiom). [clausify(16)].
% 0.41/1.02 102 -min_precedes(A,B,C) | subactivity(f11(C,A,B),C) # label(sos_26) # label(axiom). [clausify(27)].
% 0.41/1.02 103 -min_precedes(A,B,C) | subactivity(f12(C,A,B),C) # label(sos_26) # label(axiom). [clausify(27)].
% 0.41/1.02 Derived: atocc(A,B) | -atomic(f6(C,B)) | -occurrence_of(A,f6(C,B)) | -atocc(C,B). [resolve(100,b,101,b)].
% 0.41/1.02 Derived: atocc(A,f11(B,C,D)) | -atomic(B) | -occurrence_of(A,B) | -min_precedes(C,D,B). [resolve(100,b,102,b)].
% 0.41/1.02 Derived: atocc(A,f12(B,C,D)) | -atomic(B) | -occurrence_of(A,B) | -min_precedes(C,D,B). [resolve(100,b,103,b)].
% 0.41/1.02 104 subactivity(tptp0,tptp0). [resolve(36,a,37,a)].
% 4.48/4.78 Derived: atocc(A,tptp0) | -atomic(tptp0) | -occurrence_of(A,tptp0). [resolve(104,a,100,b)].
% 4.48/4.78 105 subactivity(A,A) | -occurrence_of(B,A). [resolve(36,a,39,b)].
% 4.48/4.78 Derived: -occurrence_of(A,B) | atocc(C,B) | -atomic(B) | -occurrence_of(C,B). [resolve(105,a,100,b)].
% 4.48/4.78 106 subactivity(f13(f2(A,B),A),f2(A,B)) | -root_occ(A,B). [resolve(44,a,40,b)].
% 4.48/4.78 Derived: -root_occ(A,B) | atocc(C,f13(f2(A,B),A)) | -atomic(f2(A,B)) | -occurrence_of(C,f2(A,B)). [resolve(106,a,100,b)].
% 4.48/4.78 107 -occurrence_of(A,B) | atomic(B) | subactivity(f13(B,f14(B,A)),B). [resolve(46,c,44,a)].
% 4.48/4.78 108 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(60,a,50,b)].
% 4.48/4.78 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(108,b,100,b)].
% 4.48/4.78 109 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(63,a,60,a)].
% 4.48/4.78 110 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(65,a,60,a)].
% 4.48/4.78 111 subactivity(f13(A,B),A) | -atocc(B,A) | -precedes(C,B). [resolve(79,c,74,b)].
% 4.48/4.78 Derived: -atocc(A,B) | -precedes(C,A) | atocc(D,f13(B,A)) | -atomic(B) | -occurrence_of(D,B). [resolve(111,a,100,b)].
% 4.48/4.78 112 subactivity(f13(A,B),A) | -atocc(B,A) | -root_occ(B,C). [resolve(79,c,77,b)].
% 4.48/4.78 Derived: -atocc(A,B) | -root_occ(A,C) | atocc(D,f13(B,A)) | -atomic(B) | -occurrence_of(D,B). [resolve(112,a,100,b)].
% 4.48/4.78 113 -occurrence_of(A,B) | atomic(B) | subactivity(f13(C,f14(B,A)),C) | -atocc(f14(B,A),C). [resolve(81,c,79,c)].
% 4.48/4.78 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(113,c,100,b)].
% 4.48/4.78 114 min_precedes(f4(A,f3(A,B)),A,f3(A,B)) | -leaf_occ(A,B) | subactivity(f13(C,A),C) | -atocc(A,C). [resolve(83,b,79,c)].
% 4.48/4.78 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(114,c,100,b)].
% 4.48/4.78 115 subactivity(f7(A),f7(A)) | -subactivity_occurrence(A,B). [resolve(99,b,96,b)].
% 4.48/4.78 116 subactivity(f7(A),f7(A)) | -subactivity_occurrence(B,A). [resolve(99,b,97,b)].
% 4.48/4.78 117 subactivity(f7(A),f7(A)) | -occurrence_of(A,B). [resolve(99,b,98,b)].
% 4.48/4.78
% 4.48/4.78 ============================== end predicate elimination =============
% 4.48/4.78
% 4.48/4.78 Auto_denials: (non-Horn, no changes).
% 4.48/4.78
% 4.48/4.78 Term ordering decisions:
% 4.48/4.78 Function symbol KB weights: tptp0=1. tptp1=1. tptp3=1. tptp4=1. tptp2=1. c1=1. f2=1. f3=1. f4=1. f5=1. f6=1. f8=1. f10=1. f13=1. f14=1. f17=1. f7=1. f15=1. f16=1. f1=1. f9=1. f11=1. f12=1.
% 4.48/4.78
% 4.48/4.78 ============================== end of process initial clauses ========
% 4.48/4.78
% 4.48/4.78 ============================== CLAUSES FOR SEARCH ====================
% 4.48/4.78
% 4.48/4.78 ============================== end of clauses for search =============
% 4.48/4.78
% 4.48/4.78 ============================== SEARCH ================================
% 4.48/4.78
% 4.48/4.78 % Starting search at 0.05 seconds.
% 4.48/4.78
% 4.48/4.78 Low Water (keep): wt=113.000, iters=4584
% 4.48/4.78
% 4.48/4.78 Low Water (keep): wt=104.000, iters=4548
% 4.48/4.78
% 4.48/4.78 Low Water (keep): wt=72.000, iters=3898
% 4.48/4.78
% 4.48/4.78 Low Water (keep): wt=71.000, iters=3870
% 4.48/4.78
% 4.48/4.78 Low Water (keep): wt=67.000, iters=3700
% 4.48/4.78
% 4.48/4.78 Low Water (keep): wt=60.000, iters=3352
% 4.48/4.78
% 4.48/4.78 Low Water (keep): wt=58.000, iters=3370
% 4.48/4.78
% 4.48/4.78 Low Water (keep): wt=57.000, iters=3756
% 4.48/4.78
% 4.48/4.78 Low Water (keep): wt=56.000, iters=3681
% 4.48/4.78
% 4.48/4.78 Low Water (keep): wt=54.000, iters=3524
% 4.48/4.78
% 4.48/4.78 Low Water (keep): wt=52.000, iters=3425
% 4.48/4.78
% 4.48/4.78 Low Water (keep): wt=50.000, iters=3470
% 4.48/4.78
% 4.48/4.78 Low Water (keep): wt=48.000, iters=5097
% 4.48/4.78
% 4.48/4.78 Low Water (keep): wt=46.000, iters=4854
% 4.48/4.78
% 4.48/4.78 Low Water (keep): wt=40.000, iters=4264
% 4.48/4.78
% 4.48/4.78 Low Water (keep): wt=35.000, iters=3613
% 4.48/4.78
% 4.48/4.78 Low Water (keep): wt=34.000, iters=3523
% 4.48/4.78
% 4.48/4.78 Low Water (keep): wt=32.000, iters=3397
% 4.48/4.78
% 4.48/4.78 Low Water (displace): id=9027, wt=160.000
% 4.48/4.78
% 4.48/4.78 Low Water (displace): id=9825, wt=158.000
% 4.48/4.78
% 4.48/4.78 Low Water (displace): id=9533, wt=130.000
% 4.48/4.78
% 4.48/4.78 Low Water (displace): id=9670, wt=125.000
% 4.48/4.78
% 4.48/4.78 Low Water (displace): id=18968, wt=32.000
% 4.48/4.78
% 4.48/4.78 Low Water (displace): id=18971, wt=29.000
% 4.48/4.78
% 4.48/4.78 Low Water (displace): id=18986, wt=28.000
% 4.48/4.78
% 4.48/4.78 Low Water (displace): id=19192, wt=26.000
% 35.71/36.02
% 35.71/36.02 Low Water (displace): id=19737, wt=23.000
% 35.71/36.02
% 35.71/36.02 Low Water (keep): wt=30.000, iters=3800
% 35.71/36.02
% 35.71/36.02 Low Water (keep): wt=29.000, iters=3460
% 35.71/36.02
% 35.71/36.02 ============================== PROOF =================================
% 35.71/36.02 % SZS status Theorem
% 35.71/36.02 % SZS output start Refutation
% 35.71/36.02
% 35.71/36.02 % Proof 1 at 34.86 (+ 0.16) seconds.
% 35.71/36.02 % Length of proof is 89.
% 35.71/36.02 % Level of proof is 14.
% 35.71/36.02 % Maximum clause weight is 54.000.
% 35.71/36.02 % Given clauses 19326.
% 35.71/36.02
% 35.71/36.02 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].
% 35.71/36.02 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].
% 35.71/36.02 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].
% 35.71/36.02 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].
% 35.71/36.02 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].
% 35.71/36.02 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].
% 35.71/36.02 19 (all X52 (activity_occurrence(X52) -> (exists X53 (activity(X53) & occurrence_of(X52,X53))))) # label(sos_18) # label(axiom) # label(non_clause). [assumption].
% 35.71/36.02 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].
% 35.71/36.02 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].
% 35.71/36.02 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].
% 35.71/36.02 30 (all X89 all X90 (occurrence_of(X90,X89) -> activity(X89) & activity_occurrence(X90))) # label(sos_29) # label(axiom) # label(non_clause). [assumption].
% 35.71/36.02 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].
% 35.71/36.02 33 (all X95 (occurrence_of(X95,tptp0) -> (exists X96 exists X97 (occurrence_of(X96,tptp4) & root_occ(X96,X95) & occurrence_of(X97,tptp3) & leaf_occ(X97,X95) & next_subocc(X96,X97,tptp0))))) # label(sos_32) # label(axiom) # label(non_clause). [assumption].
% 35.71/36.02 34 (all X98 all X99 (occurrence_of(X99,tptp0) & root_occ(X98,X99) -> (exists X100 (occurrence_of(X100,tptp1) & next_subocc(X98,X100,tptp0))))) # label(sos_45) # label(axiom) # label(non_clause). [assumption].
% 35.71/36.02 35 --(exists X101 occurrence_of(X101,tptp0)) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 35.71/36.02 46 -occurrence_of(A,B) | atomic(B) | root(f14(B,A),B) # label(sos_30) # label(axiom). [clausify(31)].
% 35.71/36.02 47 root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -root(A,C) # label(sos_10) # label(axiom). [clausify(11)].
% 35.71/36.02 50 -leaf_occ(A,B) | leaf(A,f3(A,B)) # label(sos_11) # label(axiom). [clausify(12)].
% 35.71/36.02 51 -leaf(A,B) | -min_precedes(A,C,B) # label(sos_14) # label(axiom). [clausify(15)].
% 35.71/36.02 66 -occurrence_of(A,tptp0) | next_subocc(f15(A),f16(A),tptp0) # label(sos_32) # label(axiom). [clausify(33)].
% 35.71/36.02 67 -next_subocc(A,B,C) | -min_precedes(A,D,C) | -min_precedes(D,B,C) # label(sos_04) # label(axiom). [clausify(5)].
% 35.71/36.02 69 -next_subocc(A,B,C) | arboreal(B) # label(sos_05) # label(axiom). [clausify(6)].
% 35.71/36.02 70 -next_subocc(A,B,C) | min_precedes(A,B,C) # label(sos_04) # label(axiom). [clausify(5)].
% 35.71/36.02 71 -occurrence_of(A,tptp0) | -root_occ(B,A) | next_subocc(B,f17(B,A),tptp0) # label(sos_45) # label(axiom). [clausify(34)].
% 35.71/36.02 95 -activity_occurrence(A) | occurrence_of(A,f7(A)) # label(sos_18) # label(axiom). [clausify(19)].
% 35.71/36.02 98 -occurrence_of(A,B) | activity_occurrence(A) # label(sos_29) # label(axiom). [clausify(30)].
% 35.71/36.02 122 occurrence_of(c1,tptp0) # label(goals) # label(negated_conjecture). [clausify(35)].
% 35.71/36.02 123 -atomic(tptp0) # label(sos_34) # label(axiom). [assumption].
% 35.71/36.02 128 tptp1 != tptp3 # label(sos_42) # label(axiom). [assumption].
% 35.71/36.02 129 tptp3 != tptp1. [copy(128),flip(a)].
% 35.71/36.02 139 -leaf_occ(A,B) | subactivity_occurrence(A,B) # label(sos_11) # label(axiom). [clausify(12)].
% 35.71/36.02 145 -occurrence_of(A,tptp0) | root_occ(f15(A),A) # label(sos_32) # label(axiom). [clausify(33)].
% 35.71/36.02 146 -occurrence_of(A,tptp0) | occurrence_of(f16(A),tptp3) # label(sos_32) # label(axiom). [clausify(33)].
% 35.71/36.02 147 -occurrence_of(A,tptp0) | leaf_occ(f16(A),A) # label(sos_32) # label(axiom). [clausify(33)].
% 35.71/36.02 149 -leaf_occ(A,B) | occurrence_of(B,f3(A,B)) # label(sos_11) # label(axiom). [clausify(12)].
% 35.71/36.02 152 -occurrence_of(A,B) | -occurrence_of(A,C) | C = B # label(sos_22) # label(axiom). [clausify(23)].
% 35.71/36.02 153 -min_precedes(A,B,C) | occurrence_of(f9(C,A,B),C) # label(sos_24) # label(axiom). [clausify(25)].
% 35.71/36.02 154 -min_precedes(A,B,C) | subactivity_occurrence(A,f9(C,A,B)) # label(sos_24) # label(axiom). [clausify(25)].
% 35.71/36.02 155 -min_precedes(A,B,C) | subactivity_occurrence(B,f9(C,A,B)) # label(sos_24) # label(axiom). [clausify(25)].
% 35.71/36.02 158 -occurrence_of(A,B) | atomic(B) | subactivity_occurrence(f14(B,A),A) # label(sos_30) # label(axiom). [clausify(31)].
% 35.71/36.02 159 -occurrence_of(A,tptp0) | -root_occ(B,A) | occurrence_of(f17(B,A),tptp1) # label(sos_45) # label(axiom). [clausify(34)].
% 35.71/36.02 161 -occurrence_of(A,B) | -root_occ(C,A) | -root_occ(D,A) | D = C # label(sos_02) # label(axiom). [clausify(3)].
% 35.71/36.02 163 -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)].
% 35.71/36.02 169 root_occ(f14(A,B),C) | -occurrence_of(C,A) | -subactivity_occurrence(f14(A,B),C) | -occurrence_of(B,A) | atomic(A). [resolve(47,d,46,c)].
% 35.71/36.02 170 -leaf_occ(A,B) | -min_precedes(A,C,f3(A,B)). [resolve(50,b,51,a)].
% 35.71/36.02 202 -occurrence_of(A,tptp0) | -min_precedes(f15(A),B,tptp0) | -min_precedes(B,f16(A),tptp0). [resolve(66,b,67,a)].
% 35.71/36.02 204 -occurrence_of(A,tptp0) | arboreal(f16(A)). [resolve(66,b,69,a)].
% 35.71/36.02 208 -occurrence_of(A,tptp0) | -root_occ(B,A) | arboreal(f17(B,A)). [resolve(71,c,69,a)].
% 35.71/36.02 209 -occurrence_of(A,tptp0) | -root_occ(B,A) | min_precedes(B,f17(B,A),tptp0). [resolve(71,c,70,a)].
% 35.71/36.02 262 occurrence_of(A,f7(A)) | -occurrence_of(A,B). [resolve(95,a,98,b)].
% 35.71/36.02 274 root_occ(f14(A,B),B) | -occurrence_of(B,A) | -subactivity_occurrence(f14(A,B),B) | atomic(A). [factor(169,b,d)].
% 35.71/36.02 287 root_occ(f15(c1),c1). [resolve(145,a,122,a)].
% 35.71/36.02 291 subactivity_occurrence(f14(tptp0,c1),c1). [resolve(158,a,122,a),unit_del(a,123)].
% 35.71/36.02 312 min_precedes(f15(c1),f17(f15(c1),c1),tptp0). [resolve(287,a,209,b),unit_del(a,122)].
% 35.71/36.02 313 arboreal(f17(f15(c1),c1)). [resolve(287,a,208,b),unit_del(a,122)].
% 35.71/36.02 319 -occurrence_of(c1,A) | -root_occ(B,c1) | f15(c1) = B. [resolve(287,a,161,c)].
% 35.71/36.02 320 occurrence_of(f17(f15(c1),c1),tptp1). [resolve(287,a,159,b),unit_del(a,122)].
% 35.71/36.02 378 root_occ(f14(tptp0,c1),c1). [resolve(291,a,274,c),unit_del(b,122),unit_del(c,123)].
% 35.71/36.02 504 occurrence_of(f17(f15(c1),c1),f7(f17(f15(c1),c1))). [resolve(320,a,262,b)].
% 35.71/36.02 505 -occurrence_of(f17(f15(c1),c1),A) | tptp1 = A. [resolve(320,a,152,b)].
% 35.71/36.02 770 subactivity_occurrence(f17(f15(c1),c1),f9(tptp0,f15(c1),f17(f15(c1),c1))). [resolve(312,a,155,a)].
% 35.71/36.02 771 subactivity_occurrence(f15(c1),f9(tptp0,f15(c1),f17(f15(c1),c1))). [resolve(312,a,154,a)].
% 35.71/36.02 772 occurrence_of(f9(tptp0,f15(c1),f17(f15(c1),c1)),tptp0). [resolve(312,a,153,a)].
% 35.71/36.02 797 -occurrence_of(c1,A) | f14(tptp0,c1) = f15(c1). [resolve(319,b,378,a),flip(b)].
% 35.71/36.02 909 f14(tptp0,c1) = f15(c1). [resolve(797,a,122,a)].
% 35.71/36.02 1014 root_occ(f15(c1),A) | -occurrence_of(A,tptp0) | -subactivity_occurrence(f15(c1),A). [para(909(a,1),169(c,1)),rewrite([909(3)]),unit_del(d,122),unit_del(e,123)].
% 35.71/36.02 1038 f7(f17(f15(c1),c1)) = tptp1. [resolve(504,a,505,a),flip(a)].
% 35.71/36.02 1126 arboreal(f16(f9(tptp0,f15(c1),f17(f15(c1),c1)))). [resolve(772,a,204,a)].
% 35.71/36.02 1134 -occurrence_of(f9(tptp0,f15(c1),f17(f15(c1),c1)),A) | tptp0 = A. [resolve(772,a,152,b)].
% 35.71/36.02 1135 leaf_occ(f16(f9(tptp0,f15(c1),f17(f15(c1),c1))),f9(tptp0,f15(c1),f17(f15(c1),c1))). [resolve(772,a,147,a)].
% 35.71/36.02 1136 occurrence_of(f16(f9(tptp0,f15(c1),f17(f15(c1),c1))),tptp3). [resolve(772,a,146,a)].
% 35.71/36.02 1137 root_occ(f15(f9(tptp0,f15(c1),f17(f15(c1),c1))),f9(tptp0,f15(c1),f17(f15(c1),c1))). [resolve(772,a,145,a)].
% 35.71/36.02 1320 root_occ(f15(c1),f9(tptp0,f15(c1),f17(f15(c1),c1))). [resolve(1014,c,771,a),unit_del(b,772)].
% 35.71/36.02 1339 occurrence_of(f16(f9(tptp0,f15(c1),f17(f15(c1),c1))),f7(f16(f9(tptp0,f15(c1),f17(f15(c1),c1))))). [resolve(1136,a,262,b)].
% 35.71/36.02 1340 -occurrence_of(f16(f9(tptp0,f15(c1),f17(f15(c1),c1))),A) | tptp3 = A. [resolve(1136,a,152,b)].
% 35.71/36.02 1647 -occurrence_of(f9(tptp0,f15(c1),f17(f15(c1),c1)),A) | -root_occ(B,f9(tptp0,f15(c1),f17(f15(c1),c1))) | f15(c1) = B. [resolve(1320,a,161,c)].
% 35.71/36.02 2156 -occurrence_of(f9(tptp0,f15(c1),f17(f15(c1),c1)),A) | -arboreal(B) | -subactivity_occurrence(B,f9(tptp0,f15(c1),f17(f15(c1),c1))) | min_precedes(B,f17(f15(c1),c1),A) | min_precedes(f17(f15(c1),c1),B,A) | f17(f15(c1),c1) = B. [resolve(770,a,163,e),unit_del(c,313)].
% 35.71/36.02 4593 occurrence_of(f9(tptp0,f15(c1),f17(f15(c1),c1)),f3(f16(f9(tptp0,f15(c1),f17(f15(c1),c1))),f9(tptp0,f15(c1),f17(f15(c1),c1)))). [resolve(1135,a,149,a)].
% 35.71/36.02 4594 subactivity_occurrence(f16(f9(tptp0,f15(c1),f17(f15(c1),c1))),f9(tptp0,f15(c1),f17(f15(c1),c1))). [resolve(1135,a,139,a)].
% 35.71/36.02 6729 f7(f16(f9(tptp0,f15(c1),f17(f15(c1),c1)))) = tptp3. [resolve(1339,a,1340,a),flip(a)].
% 35.71/36.02 8223 -occurrence_of(f9(tptp0,f15(c1),f17(f15(c1),c1)),A) | f15(f9(tptp0,f15(c1),f17(f15(c1),c1))) = f15(c1). [resolve(1647,b,1137,a),flip(b)].
% 35.71/36.02 12131 -occurrence_of(f9(tptp0,f15(c1),f17(f15(c1),c1)),A) | min_precedes(f16(f9(tptp0,f15(c1),f17(f15(c1),c1))),f17(f15(c1),c1),A) | min_precedes(f17(f15(c1),c1),f16(f9(tptp0,f15(c1),f17(f15(c1),c1))),A) | f16(f9(tptp0,f15(c1),f17(f15(c1),c1))) = f17(f15(c1),c1). [resolve(2156,c,4594,a),flip(e),unit_del(b,1126)].
% 35.71/36.02 15458 f15(f9(tptp0,f15(c1),f17(f15(c1),c1))) = f15(c1). [resolve(8223,a,772,a)].
% 35.71/36.02 15488 -min_precedes(f15(c1),A,tptp0) | -min_precedes(A,f16(f9(tptp0,f15(c1),f17(f15(c1),c1))),tptp0). [para(15458(a,1),202(b,1)),unit_del(a,772)].
% 35.71/36.02 22652 f3(f16(f9(tptp0,f15(c1),f17(f15(c1),c1))),f9(tptp0,f15(c1),f17(f15(c1),c1))) = tptp0. [resolve(4593,a,1134,a),flip(a)].
% 35.71/36.02 22916 -min_precedes(f16(f9(tptp0,f15(c1),f17(f15(c1),c1))),A,tptp0). [para(22652(a,1),170(b,3)),unit_del(a,1135)].
% 35.71/36.02 33032 min_precedes(f17(f15(c1),c1),f16(f9(tptp0,f15(c1),f17(f15(c1),c1))),tptp0) | f16(f9(tptp0,f15(c1),f17(f15(c1),c1))) = f17(f15(c1),c1). [resolve(12131,a,772,a),unit_del(a,22916)].
% 35.71/36.02 33754 f16(f9(tptp0,f15(c1),f17(f15(c1),c1))) = f17(f15(c1),c1). [resolve(33032,a,15488,b),unit_del(b,312)].
% 35.71/36.02 34480 $F. [back_rewrite(6729),rewrite([33754(9),1038(5)]),flip(a),unit_del(a,129)].
% 35.71/36.02
% 35.71/36.02 % SZS output end Refutation
% 35.71/36.02 ============================== end of proof ==========================
% 35.71/36.02
% 35.71/36.02 ============================== STATISTICS ============================
% 35.71/36.02
% 35.71/36.02 Given=19326. Generated=216865. Kept=34354. proofs=1.
% 35.71/36.02 Usable=15209. Sos=7227. Demods=643. Limbo=726, Disabled=11426. Hints=0.
% 35.71/36.02 Megabytes=55.68.
% 35.71/36.02 User_CPU=34.86, System_CPU=0.16, Wall_clock=35.
% 35.71/36.02
% 35.71/36.02 ============================== end of statistics =====================
% 35.71/36.02
% 35.71/36.02 ============================== end of search =========================
% 35.71/36.02
% 35.71/36.02 THEOREM PROVED
% 35.71/36.02 % SZS status Theorem
% 35.71/36.02
% 35.71/36.02 Exiting with 1 proof.
% 35.71/36.02
% 35.71/36.02 Process 28728 exit (max_proofs) Mon Jun 13 03:36:52 2022
% 35.71/36.02 Prover9 interrupted
%------------------------------------------------------------------------------