TSTP Solution File: PRO006+2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PRO006+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n011.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:07 EDT 2022
% Result : Timeout 300.02s 300.30s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PRO006+2 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n011.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:39:18 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.46/1.06 ============================== Prover9 ===============================
% 0.46/1.06 Prover9 (32) version 2009-11A, November 2009.
% 0.46/1.06 Process 27638 was started by sandbox2 on n011.cluster.edu,
% 0.46/1.06 Mon Jun 13 03:39:19 2022
% 0.46/1.06 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_27485_n011.cluster.edu".
% 0.46/1.06 ============================== end of head ===========================
% 0.46/1.06
% 0.46/1.06 ============================== INPUT =================================
% 0.46/1.06
% 0.46/1.06 % Reading from file /tmp/Prover9_27485_n011.cluster.edu
% 0.46/1.06
% 0.46/1.06 set(prolog_style_variables).
% 0.46/1.06 set(auto2).
% 0.46/1.06 % set(auto2) -> set(auto).
% 0.46/1.06 % set(auto) -> set(auto_inference).
% 0.46/1.06 % set(auto) -> set(auto_setup).
% 0.46/1.06 % set(auto_setup) -> set(predicate_elim).
% 0.46/1.06 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.46/1.06 % set(auto) -> set(auto_limits).
% 0.46/1.06 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.46/1.06 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.46/1.06 % set(auto) -> set(auto_denials).
% 0.46/1.06 % set(auto) -> set(auto_process).
% 0.46/1.06 % set(auto2) -> assign(new_constants, 1).
% 0.46/1.06 % set(auto2) -> assign(fold_denial_max, 3).
% 0.46/1.06 % set(auto2) -> assign(max_weight, "200.000").
% 0.46/1.06 % set(auto2) -> assign(max_hours, 1).
% 0.46/1.06 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.46/1.06 % set(auto2) -> assign(max_seconds, 0).
% 0.46/1.06 % set(auto2) -> assign(max_minutes, 5).
% 0.46/1.06 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.46/1.06 % set(auto2) -> set(sort_initial_sos).
% 0.46/1.06 % set(auto2) -> assign(sos_limit, -1).
% 0.46/1.06 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.46/1.06 % set(auto2) -> assign(max_megs, 400).
% 0.46/1.06 % set(auto2) -> assign(stats, some).
% 0.46/1.06 % set(auto2) -> clear(echo_input).
% 0.46/1.06 % set(auto2) -> set(quiet).
% 0.46/1.06 % set(auto2) -> clear(print_initial_clauses).
% 0.46/1.06 % set(auto2) -> clear(print_given).
% 0.46/1.06 assign(lrs_ticks,-1).
% 0.46/1.06 assign(sos_limit,10000).
% 0.46/1.06 assign(order,kbo).
% 0.46/1.06 set(lex_order_vars).
% 0.46/1.06 clear(print_given).
% 0.46/1.06
% 0.46/1.06 % formulas(sos). % not echoed (47 formulas)
% 0.46/1.06
% 0.46/1.06 ============================== end of input ==========================
% 0.46/1.06
% 0.46/1.06 % From the command line: assign(max_seconds, 300).
% 0.46/1.06
% 0.46/1.06 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.46/1.06
% 0.46/1.06 % Formulas that are not ordinary clauses:
% 0.46/1.06 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.06 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.06 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.06 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.06 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.06 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.06 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.06 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.06 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.06 10 (all X30 all X31 (earlier(X30,X31) -> -earlier(X31,X30))) # label(sos_09) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.06 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.06 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.07 13 (all X38 all X39 (root(X38,X39) -> legal(X38))) # label(sos_12) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.07 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.07 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.07 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.07 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.07 18 (all X51 (legal(X51) -> arboreal(X51))) # label(sos_17) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.07 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.07 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.07 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.07 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.07 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.07 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.07 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.07 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.07 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.07 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.07 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.07 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.07 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.07 32 (all X94 (activity(X94) -> subactivity(X94,X94))) # label(sos_31) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.07 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.46/1.07 34 (all X98 all X99 (occurrence_of(X99,tptp0) & subactivity_occurrence(X98,X99) & arboreal(X98) & -leaf_occ(X98,X99) -> (exists X100 (occurrence_of(X100,tptp1) & next_subocc(X98,X100,tptp0))))) # label(sos_45) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.07 35 --(exists X101 occurrence_of(X101,tptp0)) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.46/1.07
% 0.46/1.07 ============================== end of process non-clausal formulas ===
% 0.46/1.07
% 0.46/1.07 ============================== PROCESS INITIAL CLAUSES ===============
% 0.46/1.07
% 0.46/1.07 ============================== PREDICATE ELIMINATION =================
% 0.46/1.07 36 -activity(A) | subactivity(A,A) # label(sos_31) # label(axiom). [clausify(32)].
% 0.46/1.07 37 activity(tptp0) # label(sos_33) # label(axiom). [assumption].
% 0.46/1.07 38 -activity_occurrence(A) | activity(f7(A)) # label(sos_18) # label(axiom). [clausify(19)].
% 0.46/1.07 39 -occurrence_of(A,B) | activity(B) # label(sos_29) # label(axiom). [clausify(30)].
% 0.46/1.07 Derived: subactivity(tptp0,tptp0). [resolve(36,a,37,a)].
% 0.46/1.07 Derived: subactivity(f7(A),f7(A)) | -activity_occurrence(A). [resolve(36,a,38,b)].
% 0.46/1.07 Derived: subactivity(A,A) | -occurrence_of(B,A). [resolve(36,a,39,b)].
% 0.46/1.07 40 -root_occ(A,B) | root(A,f2(A,B)) # label(sos_10) # label(axiom). [clausify(11)].
% 0.46/1.07 41 -min_precedes(A,B,C) | -root(B,C) # label(sos_07) # label(axiom). [clausify(8)].
% 0.46/1.07 42 -root(A,B) | legal(A) # label(sos_12) # label(axiom). [clausify(13)].
% 0.46/1.07 Derived: -root_occ(A,B) | -min_precedes(C,A,f2(A,B)). [resolve(40,b,41,b)].
% 0.46/1.07 Derived: -root_occ(A,B) | legal(A). [resolve(40,b,42,a)].
% 0.46/1.07 43 -atocc(A,B) | -legal(A) | root(A,B) # label(sos_16) # label(axiom). [clausify(17)].
% 0.46/1.07 Derived: -atocc(A,B) | -legal(A) | -min_precedes(C,A,B). [resolve(43,c,41,b)].
% 0.46/1.07 44 -root(A,B) | subactivity(f13(B,A),B) # label(sos_27) # label(axiom). [clausify(28)].
% 0.46/1.07 Derived: subactivity(f13(f2(A,B),A),f2(A,B)) | -root_occ(A,B). [resolve(44,a,40,b)].
% 0.46/1.07 Derived: subactivity(f13(A,B),A) | -atocc(B,A) | -legal(B). [resolve(44,a,43,c)].
% 0.46/1.07 45 -root(A,B) | atocc(A,f13(B,A)) # label(sos_27) # label(axiom). [clausify(28)].
% 0.46/1.07 Derived: atocc(A,f13(f2(A,B),A)) | -root_occ(A,B). [resolve(45,a,40,b)].
% 0.46/1.07 Derived: atocc(A,f13(B,A)) | -atocc(A,B) | -legal(A). [resolve(45,a,43,c)].
% 0.46/1.07 46 -occurrence_of(A,B) | atomic(B) | root(f14(B,A),B) # label(sos_30) # label(axiom). [clausify(31)].
% 0.46/1.07 Derived: -occurrence_of(A,B) | atomic(B) | -min_precedes(C,f14(B,A),B). [resolve(46,c,41,b)].
% 0.46/1.07 Derived: -occurrence_of(A,B) | atomic(B) | legal(f14(B,A)). [resolve(46,c,42,a)].
% 0.46/1.07 Derived: -occurrence_of(A,B) | atomic(B) | subactivity(f13(B,f14(B,A)),B). [resolve(46,c,44,a)].
% 0.46/1.07 Derived: -occurrence_of(A,B) | atomic(B) | atocc(f14(B,A),f13(B,f14(B,A))). [resolve(46,c,45,a)].
% 0.46/1.07 47 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.07 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.46/1.07 Derived: root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -atocc(A,C) | -legal(A). [resolve(47,d,43,c)].
% 0.46/1.07 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.46/1.07 48 -leaf(A,B) | root(A,B) | min_precedes(f4(A,B),A,B) # label(sos_14) # label(axiom). [clausify(15)].
% 0.46/1.07 Derived: -leaf(A,B) | min_precedes(f4(A,B),A,B) | -min_precedes(C,A,B). [resolve(48,b,41,b)].
% 0.46/1.07 Derived: -leaf(A,B) | min_precedes(f4(A,B),A,B) | legal(A). [resolve(48,b,42,a)].
% 0.46/1.07 Derived: -leaf(A,B) | min_precedes(f4(A,B),A,B) | subactivity(f13(B,A),B). [resolve(48,b,44,a)].
% 0.46/1.07 Derived: -leaf(A,B) | min_precedes(f4(A,B),A,B) | atocc(A,f13(B,A)). [resolve(48,b,45,a)].
% 0.46/1.07 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.46/1.07 49 leaf(A,B) | -root(A,B) | min_precedes(A,f5(A,B),B) # label(sos_14) # label(axiom). [clausify(15)].
% 0.46/1.07 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.46/1.07 Derived: leaf(A,B) | min_precedes(A,f5(A,B),B) | -atocc(A,B) | -legal(A). [resolve(49,b,43,c)].
% 0.46/1.07 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.46/1.07 50 -leaf_occ(A,B) | leaf(A,f3(A,B)) # label(sos_11) # label(axiom). [clausify(12)].
% 0.46/1.07 51 -leaf(A,B) | -min_precedes(A,C,B) # label(sos_14) # label(axiom). [clausify(15)].
% 0.46/1.07 Derived: -leaf_occ(A,B) | -min_precedes(A,C,f3(A,B)). [resolve(50,b,51,a)].
% 0.46/1.07 52 -leaf(A,B) | atomic(B) | occurrence_of(f8(A,B),B) # label(sos_23) # label(axiom). [clausify(24)].
% 0.46/1.07 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.46/1.07 53 -leaf(A,B) | atomic(B) | leaf_occ(A,f8(A,B)) # label(sos_23) # label(axiom). [clausify(24)].
% 0.46/1.07 Derived: atomic(f3(A,B)) | leaf_occ(A,f8(A,f3(A,B))) | -leaf_occ(A,B). [resolve(53,a,50,b)].
% 0.46/1.07 54 -leaf(A,B) | atomic(B) | occurrence_of(f10(A,B),B) # label(sos_25) # label(axiom). [clausify(26)].
% 0.46/1.07 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.46/1.07 55 -leaf(A,B) | atomic(B) | leaf_occ(A,f10(A,B)) # label(sos_25) # label(axiom). [clausify(26)].
% 0.46/1.07 Derived: atomic(f3(A,B)) | leaf_occ(A,f10(A,f3(A,B))) | -leaf_occ(A,B). [resolve(55,a,50,b)].
% 0.46/1.07 56 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.07 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.46/1.07 57 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.07 Derived: -min_precedes(A,B,C) | min_precedes(B,f5(B,C),C) | -min_precedes(B,D,C). [resolve(57,a,51,a)].
% 0.46/1.07 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.46/1.07 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.46/1.07 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.46/1.07 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.46/1.07 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.46/1.07 58 -leaf(A,B) | min_precedes(f4(A,B),A,B) | -min_precedes(C,A,B). [resolve(48,b,41,b)].
% 0.46/1.07 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.46/1.07 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.46/1.07 59 -leaf(A,B) | min_precedes(f4(A,B),A,B) | legal(A). [resolve(48,b,42,a)].
% 0.46/1.07 Derived: min_precedes(f4(A,f3(A,B)),A,f3(A,B)) | legal(A) | -leaf_occ(A,B). [resolve(59,a,50,b)].
% 0.46/1.07 60 -leaf(A,B) | min_precedes(f4(A,B),A,B) | subactivity(f13(B,A),B). [resolve(48,b,44,a)].
% 0.46/1.07 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.46/1.07 61 -leaf(A,B) | min_precedes(f4(A,B),A,B) | atocc(A,f13(B,A)). [resolve(48,b,45,a)].
% 0.46/1.07 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.46/1.07 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.46/1.07 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.46/1.07 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.46/1.07 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.46/1.07 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.46/1.07 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.46/1.07 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.46/1.07 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.46/1.07 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.46/1.07 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.46/1.07 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.46/1.07 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.46/1.07 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.46/1.07 64 leaf(A,B) | min_precedes(A,f5(A,B),B) | -atocc(A,B) | -legal(A). [resolve(49,b,43,c)].
% 0.46/1.07 Derived: min_precedes(A,f5(A,B),B) | -atocc(A,B) | -legal(A) | -min_precedes(A,C,B). [resolve(64,a,51,a)].
% 0.46/1.07 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.46/1.07 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.46/1.07 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.46/1.07 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.46/1.07 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.46/1.07 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.46/1.07 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.46/1.07 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.46/1.07 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.46/1.07 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.46/1.07 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.46/1.07 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.46/1.07 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.46/1.07 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.46/1.07 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.46/1.07 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.46/1.07 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.46/1.07 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.46/1.07 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.46/1.07 66 -occurrence_of(A,tptp0) | next_subocc(f15(A),f16(A),tptp0) # label(sos_32) # label(axiom). [clausify(33)].
% 0.46/1.07 67 -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.08 68 -next_subocc(A,B,C) | arboreal(A) # label(sos_05) # label(axiom). [clausify(6)].
% 0.46/1.08 69 -next_subocc(A,B,C) | arboreal(B) # label(sos_05) # label(axiom). [clausify(6)].
% 0.46/1.08 70 -next_subocc(A,B,C) | min_precedes(A,B,C) # label(sos_04) # label(axiom). [clausify(5)].
% 0.46/1.08 Derived: -occurrence_of(A,tptp0) | -min_precedes(f15(A),B,tptp0) | -min_precedes(B,f16(A),tptp0). [resolve(66,b,67,a)].
% 0.46/1.08 Derived: -occurrence_of(A,tptp0) | arboreal(f15(A)). [resolve(66,b,68,a)].
% 0.46/1.08 Derived: -occurrence_of(A,tptp0) | arboreal(f16(A)). [resolve(66,b,69,a)].
% 0.46/1.08 Derived: -occurrence_of(A,tptp0) | min_precedes(f15(A),f16(A),tptp0). [resolve(66,b,70,a)].
% 0.46/1.08 71 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.08 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(71,a,67,a)].
% 0.46/1.08 Derived: -min_precedes(A,B,C) | min_precedes(A,f1(A,B,C),C) | arboreal(A). [resolve(71,a,68,a)].
% 0.46/1.08 Derived: -min_precedes(A,B,C) | min_precedes(A,f1(A,B,C),C) | arboreal(B). [resolve(71,a,69,a)].
% 0.46/1.08 72 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.08 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(72,a,67,a)].
% 0.46/1.08 Derived: -min_precedes(A,B,C) | min_precedes(f1(A,B,C),B,C) | arboreal(A). [resolve(72,a,68,a)].
% 0.46/1.08 Derived: -min_precedes(A,B,C) | min_precedes(f1(A,B,C),B,C) | arboreal(B). [resolve(72,a,69,a)].
% 0.46/1.08 73 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | next_subocc(B,f17(B,A),tptp0) # label(sos_45) # label(axiom). [clausify(34)].
% 0.46/1.08 Derived: -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | -min_precedes(B,C,tptp0) | -min_precedes(C,f17(B,A),tptp0). [resolve(73,e,67,a)].
% 0.46/1.08 Derived: -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | arboreal(f17(B,A)). [resolve(73,e,69,a)].
% 0.46/1.08 Derived: -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | min_precedes(B,f17(B,A),tptp0). [resolve(73,e,70,a)].
% 0.46/1.08 74 -precedes(A,B) | legal(B) # label(sos_08) # label(axiom). [clausify(9)].
% 0.46/1.08 75 -legal(A) | arboreal(A) # label(sos_17) # label(axiom). [clausify(18)].
% 0.46/1.08 Derived: -precedes(A,B) | arboreal(B). [resolve(74,b,75,a)].
% 0.46/1.08 76 precedes(A,B) | -earlier(A,B) | -legal(B) # label(sos_08) # label(axiom). [clausify(9)].
% 0.46/1.08 Derived: precedes(A,B) | -earlier(A,B) | -precedes(C,B). [resolve(76,c,74,b)].
% 0.46/1.08 77 -root_occ(A,B) | legal(A). [resolve(40,b,42,a)].
% 0.46/1.08 Derived: -root_occ(A,B) | arboreal(A). [resolve(77,b,75,a)].
% 0.46/1.08 Derived: -root_occ(A,B) | precedes(C,A) | -earlier(C,A). [resolve(77,b,76,c)].
% 0.46/1.08 78 -atocc(A,B) | -legal(A) | -min_precedes(C,A,B). [resolve(43,c,41,b)].
% 0.46/1.08 Derived: -atocc(A,B) | -min_precedes(C,A,B) | -precedes(D,A). [resolve(78,b,74,b)].
% 0.46/1.08 Derived: -atocc(A,B) | -min_precedes(C,A,B) | -root_occ(A,D). [resolve(78,b,77,b)].
% 0.46/1.08 79 subactivity(f13(A,B),A) | -atocc(B,A) | -legal(B). [resolve(44,a,43,c)].
% 0.46/1.08 Derived: subactivity(f13(A,B),A) | -atocc(B,A) | -precedes(C,B). [resolve(79,c,74,b)].
% 0.46/1.08 Derived: subactivity(f13(A,B),A) | -atocc(B,A) | -root_occ(B,C). [resolve(79,c,77,b)].
% 0.46/1.08 80 atocc(A,f13(B,A)) | -atocc(A,B) | -legal(A). [resolve(45,a,43,c)].
% 0.46/1.08 Derived: atocc(A,f13(B,A)) | -atocc(A,B) | -precedes(C,A). [resolve(80,c,74,b)].
% 0.46/1.08 Derived: atocc(A,f13(B,A)) | -atocc(A,B) | -root_occ(A,C). [resolve(80,c,77,b)].
% 0.46/1.08 81 -occurrence_of(A,B) | atomic(B) | legal(f14(B,A)). [resolve(46,c,42,a)].
% 0.46/1.08 Derived: -occurrence_of(A,B) | atomic(B) | arboreal(f14(B,A)). [resolve(81,c,75,a)].
% 0.46/1.08 Derived: -occurrence_of(A,B) | atomic(B) | precedes(C,f14(B,A)) | -earlier(C,f14(B,A)). [resolve(81,c,76,c)].
% 0.46/1.08 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.46/1.08 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.46/1.08 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.46/1.08 82 root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -atocc(A,C) | -legal(A). [resolve(47,d,43,c)].
% 0.46/1.08 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.46/1.08 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.46/1.08 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.46/1.08 83 min_precedes(f4(A,f3(A,B)),A,f3(A,B)) | legal(A) | -leaf_occ(A,B). [resolve(59,a,50,b)].
% 0.46/1.08 Derived: min_precedes(f4(A,f3(A,B)),A,f3(A,B)) | -leaf_occ(A,B) | arboreal(A). [resolve(83,b,75,a)].
% 0.46/1.08 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.46/1.08 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.46/1.08 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.46/1.08 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.46/1.08 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.46/1.08 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.46/1.08 85 min_precedes(A,f5(A,B),B) | -atocc(A,B) | -legal(A) | -min_precedes(A,C,B). [resolve(64,a,51,a)].
% 0.46/1.08 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.46/1.08 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.46/1.08 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.46/1.08 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.46/1.08 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.46/1.08 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.46/1.08 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.46/1.08 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.46/1.08 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.46/1.08 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.46/1.08 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.46/1.08 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.46/1.08 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.46/1.08 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.46/1.08 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.46/1.08 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.46/1.08 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.46/1.08 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.46/1.09 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.46/1.09 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.46/1.09 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.46/1.09 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.46/1.09 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.46/1.09 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.46/1.09 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.46/1.09 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.46/1.09 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.46/1.09 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.46/1.09 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.46/1.09 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.46/1.09 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.46/1.09 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.46/1.09 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.46/1.09 95 -activity_occurrence(A) | occurrence_of(A,f7(A)) # label(sos_18) # label(axiom). [clausify(19)].
% 0.46/1.09 96 -subactivity_occurrence(A,B) | activity_occurrence(A) # label(sos_19) # label(axiom). [clausify(20)].
% 0.46/1.09 97 -subactivity_occurrence(A,B) | activity_occurrence(B) # label(sos_19) # label(axiom). [clausify(20)].
% 0.46/1.09 98 -occurrence_of(A,B) | activity_occurrence(A) # label(sos_29) # label(axiom). [clausify(30)].
% 0.46/1.09 Derived: occurrence_of(A,f7(A)) | -subactivity_occurrence(A,B). [resolve(95,a,96,b)].
% 0.46/1.09 Derived: occurrence_of(A,f7(A)) | -subactivity_occurrence(B,A). [resolve(95,a,97,b)].
% 0.46/1.09 Derived: occurrence_of(A,f7(A)) | -occurrence_of(A,B). [resolve(95,a,98,b)].
% 0.46/1.09 99 subactivity(f7(A),f7(A)) | -activity_occurrence(A). [resolve(36,a,38,b)].
% 0.46/1.09 Derived: subactivity(f7(A),f7(A)) | -subactivity_occurrence(A,B). [resolve(99,b,96,b)].
% 0.46/1.09 Derived: subactivity(f7(A),f7(A)) | -subactivity_occurrence(B,A). [resolve(99,b,97,b)].
% 0.46/1.09 Derived: subactivity(f7(A),f7(A)) | -occurrence_of(A,B). [resolve(99,b,98,b)].
% 0.46/1.09 100 atocc(A,B) | -subactivity(B,C) | -atomic(C) | -occurrence_of(A,C) # label(sos_15) # label(axiom). [clausify(16)].
% 0.46/1.09 101 -atocc(A,B) | subactivity(B,f6(A,B)) # label(sos_15) # label(axiom). [clausify(16)].
% 0.46/1.09 102 -min_precedes(A,B,C) | subactivity(f11(C,A,B),C) # label(sos_26) # label(axiom). [clausify(27)].
% 0.46/1.09 103 -min_precedes(A,B,C) | subactivity(f12(C,A,B),C) # label(sos_26) # label(axiom). [clausify(27)].
% 0.46/1.09 Derived: atocc(A,B) | -atomic(f6(C,B)) | -occurrence_of(A,f6(C,B)) | -atocc(C,B). [resolve(100,b,101,b)].
% 0.46/1.09 Derived: atocc(A,f11(B,C,D)) | -atomic(B) | -occurrence_of(A,B) | -min_precedes(C,D,B). [resolve(100,b,102,b)].
% 0.46/1.09 Derived: atocc(A,f12(B,C,D)) | -atomic(B) | -occurrence_of(A,B) | -min_precedes(C,D,B). [resolve(100,b,103,b)].
% 4.14/4.41 104 subactivity(tptp0,tptp0). [resolve(36,a,37,a)].
% 4.14/4.41 Derived: atocc(A,tptp0) | -atomic(tptp0) | -occurrence_of(A,tptp0). [resolve(104,a,100,b)].
% 4.14/4.41 105 subactivity(A,A) | -occurrence_of(B,A). [resolve(36,a,39,b)].
% 4.14/4.41 Derived: -occurrence_of(A,B) | atocc(C,B) | -atomic(B) | -occurrence_of(C,B). [resolve(105,a,100,b)].
% 4.14/4.41 106 subactivity(f13(f2(A,B),A),f2(A,B)) | -root_occ(A,B). [resolve(44,a,40,b)].
% 4.14/4.41 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.14/4.41 107 -occurrence_of(A,B) | atomic(B) | subactivity(f13(B,f14(B,A)),B). [resolve(46,c,44,a)].
% 4.14/4.41 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.14/4.41 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.14/4.41 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.14/4.42 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.14/4.42 111 subactivity(f13(A,B),A) | -atocc(B,A) | -precedes(C,B). [resolve(79,c,74,b)].
% 4.14/4.42 Derived: -atocc(A,B) | -precedes(C,A) | atocc(D,f13(B,A)) | -atomic(B) | -occurrence_of(D,B). [resolve(111,a,100,b)].
% 4.14/4.42 112 subactivity(f13(A,B),A) | -atocc(B,A) | -root_occ(B,C). [resolve(79,c,77,b)].
% 4.14/4.42 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.14/4.42 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.14/4.42 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.14/4.42 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.14/4.42 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.14/4.42 115 subactivity(f7(A),f7(A)) | -subactivity_occurrence(A,B). [resolve(99,b,96,b)].
% 4.14/4.42 116 subactivity(f7(A),f7(A)) | -subactivity_occurrence(B,A). [resolve(99,b,97,b)].
% 4.14/4.42 117 subactivity(f7(A),f7(A)) | -occurrence_of(A,B). [resolve(99,b,98,b)].
% 4.14/4.42
% 4.14/4.42 ============================== end predicate elimination =============
% 4.14/4.42
% 4.14/4.42 Auto_denials: (non-Horn, no changes).
% 4.14/4.42
% 4.14/4.42 Term ordering decisions:
% 4.14/4.42 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.14/4.42
% 4.14/4.42 ============================== end of process initial clauses ========
% 4.14/4.42
% 4.14/4.42 ============================== CLAUSES FOR SEARCH ====================
% 4.14/4.42
% 4.14/4.42 ============================== end of clauses for search =============
% 4.14/4.42
% 4.14/4.42 ============================== SEARCH ================================
% 4.14/4.42
% 4.14/4.42 % Starting search at 0.05 seconds.
% 4.14/4.42
% 4.14/4.42 Low Water (keep): wt=89.000, iters=3592
% 4.14/4.42
% 4.14/4.42 Low Water (keep): wt=85.000, iters=3495
% 4.14/4.42
% 4.14/4.42 Low Water (keep): wt=81.000, iters=3417
% 4.14/4.42
% 4.14/4.42 Low Water (keep): wt=79.000, iters=3848
% 4.14/4.42
% 4.14/4.42 Low Water (keep): wt=71.000, iters=3615
% 4.14/4.42
% 4.14/4.42 Low Water (keep): wt=67.000, iters=3453
% 4.14/4.42
% 4.14/4.42 Low Water (keep): wt=66.000, iters=3426
% 4.14/4.42
% 4.14/4.42 Low Water (keep): wt=60.000, iters=3393
% 4.14/4.42
% 4.14/4.42 Low Water (keep): wt=59.000, iters=3340
% 4.14/4.42
% 4.14/4.42 Low Water (keep): wt=58.000, iters=3382
% 4.14/4.42
% 4.14/4.42 Low Water (keep): wt=56.000, iters=4086
% 4.14/4.42
% 4.14/4.42 Low Water (keep): wt=48.000, iters=3543
% 4.14/4.42
% 4.14/4.42 Low Water (keep): wt=46.000, iters=3354
% 4.14/4.42
% 4.14/4.42 Low Water (keep): wt=45.000, iters=3400
% 4.14/4.42
% 4.14/4.42 Low Water (keep): wt=44.000, iters=3726
% 4.14/4.42
% 4.14/4.42 Low Water (keep): wt=40.000, iters=3366
% 4.14/4.42
% 4.14/4.42 Low Water (keep): wt=37.000, iters=5092
% 4.14/4.42
% 4.14/4.42 Low Water (keep): wt=33.000, iters=3778
% 4.14/4.42
% 4.14/4.42 Low Water (displace): id=8504, wt=160.000
% 4.14/4.42
% 4.14/4.42 Low Water (displace): id=10371, wt=158.000
% 4.14/4.42
% 4.14/4.42 Low Water (displace): id=9114, wt=138.000
% 4.14/4.42
% 4.14/4.42 Low Water (displace): id=9108, wt=135.000
% 4.14/4.42
% 4.14/4.42 Low WatCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------