0.00/0.06 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.06 % Command : tptp2X_and_run_prover9 %d %s 0.03/0.28 % Computer : n136.star.cs.uiowa.edu 0.03/0.28 % Model : x86_64 x86_64 0.03/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.03/0.28 % Memory : 32218.625MB 0.03/0.28 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.03/0.28 % CPULimit : 300 0.03/0.28 % DateTime : Sat Jul 14 05:20:55 CDT 2018 0.03/0.28 % CPUTime : 0.07/0.51 ============================== Prover9 =============================== 0.07/0.51 Prover9 (32) version 2009-11A, November 2009. 0.07/0.51 Process 18687 was started by sandbox2 on n136.star.cs.uiowa.edu, 0.07/0.51 Sat Jul 14 05:20:55 2018 0.07/0.51 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_18655_n136.star.cs.uiowa.edu". 0.07/0.51 ============================== end of head =========================== 0.07/0.51 0.07/0.51 ============================== INPUT ================================= 0.07/0.51 0.07/0.51 % Reading from file /tmp/Prover9_18655_n136.star.cs.uiowa.edu 0.07/0.51 0.07/0.51 set(prolog_style_variables). 0.07/0.51 set(auto2). 0.07/0.51 % set(auto2) -> set(auto). 0.07/0.51 % set(auto) -> set(auto_inference). 0.07/0.51 % set(auto) -> set(auto_setup). 0.07/0.51 % set(auto_setup) -> set(predicate_elim). 0.07/0.51 % set(auto_setup) -> assign(eq_defs, unfold). 0.07/0.51 % set(auto) -> set(auto_limits). 0.07/0.51 % set(auto_limits) -> assign(max_weight, "100.000"). 0.07/0.51 % set(auto_limits) -> assign(sos_limit, 20000). 0.07/0.51 % set(auto) -> set(auto_denials). 0.07/0.51 % set(auto) -> set(auto_process). 0.07/0.51 % set(auto2) -> assign(new_constants, 1). 0.07/0.51 % set(auto2) -> assign(fold_denial_max, 3). 0.07/0.51 % set(auto2) -> assign(max_weight, "200.000"). 0.07/0.51 % set(auto2) -> assign(max_hours, 1). 0.07/0.51 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.07/0.51 % set(auto2) -> assign(max_seconds, 0). 0.07/0.51 % set(auto2) -> assign(max_minutes, 5). 0.07/0.51 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.07/0.51 % set(auto2) -> set(sort_initial_sos). 0.07/0.51 % set(auto2) -> assign(sos_limit, -1). 0.07/0.51 % set(auto2) -> assign(lrs_ticks, 3000). 0.07/0.51 % set(auto2) -> assign(max_megs, 400). 0.07/0.51 % set(auto2) -> assign(stats, some). 0.07/0.51 % set(auto2) -> clear(echo_input). 0.07/0.51 % set(auto2) -> set(quiet). 0.07/0.51 % set(auto2) -> clear(print_initial_clauses). 0.07/0.51 % set(auto2) -> clear(print_given). 0.07/0.51 assign(lrs_ticks,-1). 0.07/0.51 assign(sos_limit,10000). 0.07/0.51 assign(order,kbo). 0.07/0.51 set(lex_order_vars). 0.07/0.51 clear(print_given). 0.07/0.51 0.07/0.51 % formulas(sos). % not echoed (46 formulas) 0.07/0.51 0.07/0.51 ============================== end of input ========================== 0.07/0.51 0.07/0.51 % From the command line: assign(max_seconds, 300). 0.07/0.51 0.07/0.51 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.07/0.51 0.07/0.51 % Formulas that are not ordinary clauses: 0.07/0.51 1 (all X68 all X69 all X70 (min_precedes(X68,X69,X70) -> (exists X71 (min_precedes(X71,X69,X70) & root(X71,X70))))) # label(sos_23) # label(axiom) # label(non_clause). [assumption]. 0.07/0.51 2 (all X75 all X76 all X77 (next_subocc(X75,X76,X77) -> arboreal(X76) & arboreal(X75))) # label(sos_25) # label(axiom) # label(non_clause). [assumption]. 0.07/0.51 3 (all X31 all X32 all X33 (leaf_occ(X32,X31) & occurrence_of(X31,X33) -> -(exists X34 min_precedes(X32,X34,X33)))) # label(sos_09) # label(axiom) # label(non_clause). [assumption]. 0.07/0.51 4 (all X25 all X26 (-atomic(X26) & leaf(X25,X26) -> (exists X27 (occurrence_of(X27,X26) & leaf_occ(X25,X27))))) # label(sos_07) # label(axiom) # label(non_clause). [assumption]. 0.07/0.51 5 (all X28 all X29 all X30 (occurrence_of(X28,X29) & occurrence_of(X28,X30) -> X29 = X30)) # label(sos_08) # label(axiom) # label(non_clause). [assumption]. 0.07/0.51 6 (all X47 all X48 (leaf(X47,X48) <-> -(exists X50 min_precedes(X47,X50,X48)) & ((exists X49 min_precedes(X49,X47,X48)) | root(X47,X48)))) # label(sos_15) # label(axiom) # label(non_clause). [assumption]. 0.07/0.51 7 (all X35 all X36 all X37 (occurrence_of(X35,X37) & root_occ(X36,X35) -> -(exists X38 min_precedes(X38,X36,X37)))) # label(sos_10) # label(axiom) # label(non_clause). [assumption]. 0.07/0.51 8 (all X101 (occurrence_of(X101,tptp0) -> (exists X102 exists X103 exists X104 (root_occ(X102,X101) & leaf_occ(X104,X101) & next_subocc(X103,X104,tptp0) & (occurrence_of(X104,tptp1) | occurrence_of(X104,tptp2)) & next_subocc(X102,X103,tptp0) & occurrence_of(X103,tptp4) & occurrence_of(X102,tptp3))))) # label(sos_32) # label(axiom) # label(non_clause). [assumption]. 0.07/0.51 9 (all X43 (legal(X43) -> arboreal(X43))) # label(sos_13) # label(axiom) # label(non_clause). [assumption]. 0.07/0.51 10 (all X12 all X13 (occurrence_of(X13,X12) -> activity_occurrence(X13) & activity(X12))) # label(sos_03) # label(axiom) # label(non_clause). [assumption]. 0.07/0.51 11 (all X55 all X56 (leaf_occ(X55,X56) <-> (exists X57 (occurrence_of(X56,X57) & subactivity_occurrence(X55,X56) & leaf(X55,X57))))) # label(sos_18) # label(axiom) # label(non_clause). [assumption]. 0.07/0.51 12 (all X3 all X4 all X5 all X6 all X7 (subactivity_occurrence(X5,X4) & min_precedes(X6,X5,X3) & X5 != X7 & leaf_occ(X7,X4) & root_occ(X6,X4) & occurrence_of(X4,X3) -> min_precedes(X5,X7,X3))) # label(sos_01) # label(axiom) # label(non_clause). [assumption]. 0.07/0.51 13 (all X65 all X66 all X67 (min_precedes(X65,X66,X67) -> -root(X66,X67))) # label(sos_22) # label(axiom) # label(non_clause). [assumption]. 0.07/0.51 14 (all X97 all X98 all X99 all X100 (min_precedes(X97,X98,X100) & min_precedes(X97,X99,X100) & precedes(X98,X99) -> min_precedes(X98,X99,X100))) # label(sos_31) # label(axiom) # label(non_clause). [assumption]. 0.07/0.51 15 (all X63 all X64 (precedes(X63,X64) <-> legal(X64) & earlier(X63,X64))) # label(sos_21) # label(axiom) # label(non_clause). [assumption]. 0.07/0.51 16 (all X78 all X79 all X80 (next_subocc(X78,X79,X80) <-> min_precedes(X78,X79,X80) & -(exists X81 (min_precedes(X81,X79,X80) & min_precedes(X78,X81,X80))))) # label(sos_26) # label(axiom) # label(non_clause). [assumption]. 0.07/0.51 17 (all X61 all X62 (earlier(X61,X62) -> -earlier(X62,X61))) # label(sos_20) # label(axiom) # label(non_clause). [assumption]. 0.07/0.51 18 (all X18 all X19 (root(X19,X18) -> (exists X20 (subactivity(X20,X18) & atocc(X19,X20))))) # label(sos_05) # label(axiom) # label(non_clause). [assumption]. 0.07/0.51 19 (all X72 all X73 all X74 (min_precedes(X72,X73,X74) -> precedes(X72,X73))) # label(sos_24) # label(axiom) # label(non_clause). [assumption]. 0.07/0.51 20 (all X94 all X95 all X96 (earlier(X94,X95) & earlier(X95,X96) -> earlier(X94,X96))) # label(sos_30) # label(axiom) # label(non_clause). [assumption]. 0.07/0.51 21 (all X41 (activity_occurrence(X41) -> (exists X42 (activity(X42) & occurrence_of(X41,X42))))) # label(sos_12) # label(axiom) # label(non_clause). [assumption]. 0.07/0.51 22 (all X14 all X15 all X16 all X17 (arboreal(X16) & subactivity_occurrence(X17,X15) & subactivity_occurrence(X16,X15) & arboreal(X17) & occurrence_of(X15,X14) -> X16 = X17 | min_precedes(X17,X16,X14) | min_precedes(X16,X17,X14))) # label(sos_04) # label(axiom) # label(non_clause). [assumption]. 0.07/0.51 23 (all X8 all X9 all X10 all X11 (occurrence_of(X9,X8) & subactivity_occurrence(X10,X9) & leaf_occ(X11,X9) & -min_precedes(X10,X11,X8) & arboreal(X10) -> X11 = X10)) # label(sos_02) # label(axiom) # label(non_clause). [assumption]. 0.07/0.51 24 (all X51 all X52 (occurrence_of(X51,X52) -> (arboreal(X51) <-> atomic(X52)))) # label(sos_16) # label(axiom) # label(non_clause). [assumption]. 0.07/0.51 25 (all X53 all X54 (root(X53,X54) -> legal(X53))) # label(sos_17) # label(axiom) # label(non_clause). [assumption]. 0.07/0.51 26 (all X86 all X87 all X88 all X89 (occurrence_of(X88,X89) & leaf_occ(X86,X88) & leaf_occ(X87,X88) & -atomic(X89) -> X87 = X86)) # label(sos_28) # label(axiom) # label(non_clause). [assumption]. 0.07/0.51 27 (all X82 all X83 all X84 all X85 (occurrence_of(X85,X84) & subactivity_occurrence(X83,X85) & min_precedes(X82,X83,X84) -> subactivity_occurrence(X82,X85))) # label(sos_27) # label(axiom) # label(non_clause). [assumption]. 0.07/0.51 28 (all X39 all X40 (subactivity_occurrence(X39,X40) -> activity_occurrence(X39) & activity_occurrence(X40))) # label(sos_11) # label(axiom) # label(non_clause). [assumption]. 0.07/0.51 29 (all X90 all X91 all X92 all X93 (occurrence_of(X92,X93) & root_occ(X90,X92) & root_occ(X91,X92) -> X91 = X90)) # label(sos_29) # label(axiom) # label(non_clause). [assumption]. 0.07/0.51 30 (all X0 all X1 (occurrence_of(X1,X0) & -atomic(X0) -> (exists X2 (root(X2,X0) & subactivity_occurrence(X2,X1))))) # label(sos) # label(axiom) # label(non_clause). [assumption]. 0.07/0.51 31 (all X21 all X22 all X23 (min_precedes(X22,X23,X21) -> (exists X24 (occurrence_of(X24,X21) & subactivity_occurrence(X23,X24) & subactivity_occurrence(X22,X24))))) # label(sos_06) # label(axiom) # label(non_clause). [assumption]. 0.07/0.51 32 (all X58 all X59 ((exists X60 (occurrence_of(X59,X60) & subactivity_occurrence(X58,X59) & root(X58,X60))) <-> root_occ(X58,X59))) # label(sos_19) # label(axiom) # label(non_clause). [assumption]. 0.07/0.51 33 (all X44 all X45 ((exists X46 (atomic(X46) & occurrence_of(X44,X46) & subactivity(X45,X46))) <-> atocc(X44,X45))) # label(sos_14) # label(axiom) # label(non_clause). [assumption]. 0.07/0.52 34 -(all X105 (occurrence_of(X105,tptp0) -> (exists X106 exists X107 (root_occ(X106,X105) & (occurrence_of(X107,tptp1) | occurrence_of(X107,tptp2)) & min_precedes(X106,X107,tptp0) & (occurrence_of(X107,tptp2) -> -(exists X109 (occurrence_of(X109,tptp1) & min_precedes(X106,X109,tptp0) & subactivity_occurrence(X109,X105)))) & (occurrence_of(X107,tptp1) -> -(exists X108 (occurrence_of(X108,tptp2) & min_precedes(X106,X108,tptp0) & subactivity_occurrence(X108,X105)))) & leaf_occ(X107,X105) & occurrence_of(X106,tptp3))))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption]. 0.07/0.52 0.07/0.52 ============================== end of process non-clausal formulas === 0.07/0.52 0.07/0.52 ============================== PROCESS INITIAL CLAUSES =============== 0.07/0.52 0.07/0.52 ============================== PREDICATE ELIMINATION ================= 0.07/0.52 35 leaf(A,B) | min_precedes(A,f4(A,B),B) | -root(A,B) # label(sos_15) # label(axiom). [clausify(6)]. 0.07/0.52 36 -min_precedes(A,B,C) | root(f1(A,B,C),C) # label(sos_23) # label(axiom). [clausify(1)]. 0.07/0.52 37 -leaf(A,B) | min_precedes(f3(A,B),A,B) | root(A,B) # label(sos_15) # label(axiom). [clausify(6)]. 0.07/0.52 Derived: leaf(f1(A,B,C),C) | min_precedes(f1(A,B,C),f4(f1(A,B,C),C),C) | -min_precedes(A,B,C). [resolve(35,c,36,b)]. 0.07/0.52 38 -min_precedes(A,B,C) | -root(B,C) # label(sos_22) # label(axiom). [clausify(13)]. 0.07/0.52 Derived: -min_precedes(A,f1(B,C,D),D) | -min_precedes(B,C,D). [resolve(38,b,36,b)]. 0.07/0.52 Derived: -min_precedes(A,B,C) | -leaf(B,C) | min_precedes(f3(B,C),B,C). [resolve(38,b,37,c)]. 0.07/0.52 39 -root(A,B) | subactivity(f10(B,A),B) # label(sos_05) # label(axiom). [clausify(18)]. 0.07/0.52 Derived: subactivity(f10(A,f1(B,C,A)),A) | -min_precedes(B,C,A). [resolve(39,a,36,b)]. 0.07/0.52 Derived: subactivity(f10(A,B),A) | -leaf(B,A) | min_precedes(f3(B,A),B,A). [resolve(39,a,37,c)]. 0.07/0.52 40 -root(A,B) | atocc(A,f10(B,A)) # label(sos_05) # label(axiom). [clausify(18)]. 0.07/0.52 Derived: atocc(f1(A,B,C),f10(C,f1(A,B,C))) | -min_precedes(A,B,C). [resolve(40,a,36,b)]. 0.07/0.52 Derived: atocc(A,f10(B,A)) | -leaf(A,B) | min_precedes(f3(A,B),A,B). [resolve(40,a,37,c)]. 0.07/0.52 41 -root(A,B) | legal(A) # label(sos_17) # label(axiom). [clausify(25)]. 0.07/0.52 Derived: legal(f1(A,B,C)) | -min_precedes(A,B,C). [resolve(41,a,36,b)]. 0.07/0.52 Derived: legal(A) | -leaf(A,B) | min_precedes(f3(A,B),A,B). [resolve(41,a,37,c)]. 0.07/0.52 42 -occurrence_of(A,B) | atomic(B) | root(f12(B,A),B) # label(sos) # label(axiom). [clausify(30)]. 0.07/0.52 Derived: -occurrence_of(A,B) | atomic(B) | leaf(f12(B,A),B) | min_precedes(f12(B,A),f4(f12(B,A),B),B). [resolve(42,c,35,c)]. 0.07/0.52 Derived: -occurrence_of(A,B) | atomic(B) | -min_precedes(C,f12(B,A),B). [resolve(42,c,38,b)]. 0.07/0.52 Derived: -occurrence_of(A,B) | atomic(B) | subactivity(f10(B,f12(B,A)),B). [resolve(42,c,39,a)]. 0.07/0.52 Derived: -occurrence_of(A,B) | atomic(B) | atocc(f12(B,A),f10(B,f12(B,A))). [resolve(42,c,40,a)]. 0.07/0.52 Derived: -occurrence_of(A,B) | atomic(B) | legal(f12(B,A)). [resolve(42,c,41,a)]. 0.07/0.52 43 -occurrence_of(A,B) | -subactivity_occurrence(C,A) | -root(C,B) | root_occ(C,A) # label(sos_19) # label(axiom). [clausify(32)]. 0.07/0.52 Derived: -occurrence_of(A,B) | -subactivity_occurrence(f1(C,D,B),A) | root_occ(f1(C,D,B),A) | -min_precedes(C,D,B). [resolve(43,c,36,b)]. 0.07/0.52 Derived: -occurrence_of(A,B) | -subactivity_occurrence(C,A) | root_occ(C,A) | -leaf(C,B) | min_precedes(f3(C,B),C,B). [resolve(43,c,37,c)]. 0.07/0.52 Derived: -occurrence_of(A,B) | -subactivity_occurrence(f12(B,C),A) | root_occ(f12(B,C),A) | -occurrence_of(C,B) | atomic(B). [resolve(43,c,42,c)]. 0.07/0.52 44 root(A,f14(A,B)) | -root_occ(A,B) # label(sos_19) # label(axiom). [clausify(32)]. 0.07/0.52 Derived: -root_occ(A,B) | leaf(A,f14(A,B)) | min_precedes(A,f4(A,f14(A,B)),f14(A,B)). [resolve(44,a,35,c)]. 0.07/0.52 Derived: -root_occ(A,B) | -min_precedes(C,A,f14(A,B)). [resolve(44,a,38,b)]. 0.07/0.52 Derived: -root_occ(A,B) | subactivity(f10(f14(A,B),A),f14(A,B)). [resolve(44,a,39,a)]. 0.07/0.52 Derived: -root_occ(A,B) | atocc(A,f10(f14(A,B),A)). [resolve(44,a,40,a)]. 0.07/0.52 Derived: -root_occ(A,B) | legal(A). [resolve(44,a,41,a)]. 0.07/0.52 Derived: -root_occ(A,B) | -occurrence_of(C,f14(A,B)) | -subactivity_occurrence(A,C) | root_occ(A,C). [resolve(44,a,43,c)]. 0.07/0.52 45 -occurrence_of(A,tptp0) | next_subocc(f6(A),f7(A),tptp0) # label(sos_32) # label(axiom). [clausify(8)]. 0.07/0.52 46 -next_subocc(A,B,C) | arboreal(B) # label(sos_25) # label(axiom). [clausify(2)]. 0.07/0.52 47 -next_subocc(A,B,C) | arboreal(A) # label(sos_25) # label(axiom). [clausify(2)]. 0.07/0.52 Derived: -occurrence_of(A,tptp0) | arboreal(f7(A)). [resolve(45,b,46,a)]. 0.07/0.52 Derived: -occurrence_of(A,tptp0) | arboreal(f6(A)). [resolve(45,b,47,a)]. 0.07/0.52 48 -occurrence_of(A,tptp0) | next_subocc(f5(A),f6(A),tptp0) # label(sos_32) # label(axiom). [clausify(8)]. 0.07/0.52 Derived: -occurrence_of(A,tptp0) | arboreal(f5(A)). [resolve(48,b,47,a)]. 0.07/0.52 49 -next_subocc(A,B,C) | min_precedes(A,B,C) # label(sos_26) # label(axiom). [clausify(16)]. 0.07/0.52 Derived: min_precedes(f6(A),f7(A),tptp0) | -occurrence_of(A,tptp0). [resolve(49,a,45,b)]. 0.07/0.52 Derived: min_precedes(f5(A),f6(A),tptp0) | -occurrence_of(A,tptp0). [resolve(49,a,48,b)]. 0.07/0.52 50 -next_subocc(A,B,C) | -min_precedes(D,B,C) | -min_precedes(A,D,C) # label(sos_26) # label(axiom). [clausify(16)]. 0.07/0.52 Derived: -min_precedes(A,f7(B),tptp0) | -min_precedes(f6(B),A,tptp0) | -occurrence_of(B,tptp0). [resolve(50,a,45,b)]. 0.07/0.52 Derived: -min_precedes(A,f6(B),tptp0) | -min_precedes(f5(B),A,tptp0) | -occurrence_of(B,tptp0). [resolve(50,a,48,b)]. 0.07/0.52 51 next_subocc(A,B,C) | -min_precedes(A,B,C) | min_precedes(f9(A,B,C),B,C) # label(sos_26) # label(axiom). [clausify(16)]. 0.07/0.52 Derived: -min_precedes(A,B,C) | min_precedes(f9(A,B,C),B,C) | arboreal(B). [resolve(51,a,46,a)]. 0.07/0.52 Derived: -min_precedes(A,B,C) | min_precedes(f9(A,B,C),B,C) | arboreal(A). [resolve(51,a,47,a)]. 0.07/0.52 Derived: -min_precedes(A,B,C) | min_precedes(f9(A,B,C),B,C) | -min_precedes(D,B,C) | -min_precedes(A,D,C). [resolve(51,a,50,a)]. 0.07/0.52 52 next_subocc(A,B,C) | -min_precedes(A,B,C) | min_precedes(A,f9(A,B,C),C) # label(sos_26) # label(axiom). [clausify(16)]. 0.07/0.52 Derived: -min_precedes(A,B,C) | min_precedes(A,f9(A,B,C),C) | arboreal(B). [resolve(52,a,46,a)]. 0.07/0.52 Derived: -min_precedes(A,B,C) | min_precedes(A,f9(A,B,C),C) | arboreal(A). [resolve(52,a,47,a)]. 0.07/0.52 Derived: -min_precedes(A,B,C) | min_precedes(A,f9(A,B,C),C) | -min_precedes(D,B,C) | -min_precedes(A,D,C). [resolve(52,a,50,a)]. 0.07/0.52 53 leaf(A,B) | min_precedes(A,f4(A,B),B) | -min_precedes(C,A,B) # label(sos_15) # label(axiom). [clausify(6)]. 0.07/0.52 54 atomic(A) | -leaf(B,A) | occurrence_of(f2(B,A),A) # label(sos_07) # label(axiom). [clausify(4)]. 0.07/0.52 55 atomic(A) | -leaf(B,A) | leaf_occ(B,f2(B,A)) # label(sos_07) # label(axiom). [clausify(4)]. 0.07/0.52 56 -leaf(A,B) | -min_precedes(A,C,B) # label(sos_15) # label(axiom). [clausify(6)]. 0.07/0.52 Derived: min_precedes(A,f4(A,B),B) | -min_precedes(C,A,B) | atomic(B) | occurrence_of(f2(A,B),B). [resolve(53,a,54,b)]. 0.07/0.52 Derived: min_precedes(A,f4(A,B),B) | -min_precedes(C,A,B) | atomic(B) | leaf_occ(A,f2(A,B)). [resolve(53,a,55,b)]. 0.07/0.52 Derived: min_precedes(A,f4(A,B),B) | -min_precedes(C,A,B) | -min_precedes(A,D,B). [resolve(53,a,56,a)]. 0.07/0.52 57 -leaf_occ(A,B) | leaf(A,f8(A,B)) # label(sos_18) # label(axiom). [clausify(11)]. 0.07/0.52 Derived: -leaf_occ(A,B) | atomic(f8(A,B)) | occurrence_of(f2(A,f8(A,B)),f8(A,B)). [resolve(57,b,54,b)]. 0.07/0.52 Derived: -leaf_occ(A,B) | atomic(f8(A,B)) | leaf_occ(A,f2(A,f8(A,B))). [resolve(57,b,55,b)]. 0.07/0.52 Derived: -leaf_occ(A,B) | -min_precedes(A,C,f8(A,B)). [resolve(57,b,56,a)]. 0.07/0.52 58 leaf_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -leaf(A,C) # label(sos_18) # label(axiom). [clausify(11)]. 0.07/0.52 Derived: leaf_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | min_precedes(A,f4(A,C),C) | -min_precedes(D,A,C). [resolve(58,d,53,a)]. 0.07/0.52 Derived: leaf_occ(A,B) | -occurrence_of(B,f8(A,C)) | -subactivity_occurrence(A,B) | -leaf_occ(A,C). [resolve(58,d,57,b)]. 0.07/0.52 59 leaf(f1(A,B,C),C) | min_precedes(f1(A,B,C),f4(f1(A,B,C),C),C) | -min_precedes(A,B,C). [resolve(35,c,36,b)]. 0.07/0.52 Derived: min_precedes(f1(A,B,C),f4(f1(A,B,C),C),C) | -min_precedes(A,B,C) | atomic(C) | occurrence_of(f2(f1(A,B,C),C),C). [resolve(59,a,54,b)]. 0.07/0.52 Derived: min_precedes(f1(A,B,C),f4(f1(A,B,C),C),C) | -min_precedes(A,B,C) | atomic(C) | leaf_occ(f1(A,B,C),f2(f1(A,B,C),C)). [resolve(59,a,55,b)]. 0.07/0.52 Derived: min_precedes(f1(A,B,C),f4(f1(A,B,C),C),C) | -min_precedes(A,B,C) | -min_precedes(f1(A,B,C),D,C). [resolve(59,a,56,a)]. 0.07/0.52 Derived: min_precedes(f1(A,B,C),f4(f1(A,B,C),C),C) | -min_precedes(A,B,C) | leaf_occ(f1(A,B,C),D) | -occurrence_of(D,C) | -subactivity_occurrence(f1(A,B,C),D). [resolve(59,a,58,d)]. 0.07/0.52 60 -min_precedes(A,B,C) | -leaf(B,C) | min_precedes(f3(B,C),B,C). [resolve(38,b,37,c)]. 0.07/0.52 Derived: -min_precedes(A,B,C) | min_precedes(f3(B,C),B,C) | min_precedes(B,f4(B,C),C) | -min_precedes(D,B,C). [resolve(60,b,53,a)]. 0.07/0.52 Derived: -min_precedes(A,B,f8(B,C)) | min_precedes(f3(B,f8(B,C)),B,f8(B,C)) | -leaf_occ(B,C). [resolve(60,b,57,b)]. 0.07/0.52 61 subactivity(f10(A,B),A) | -leaf(B,A) | min_precedes(f3(B,A),B,A). [resolve(39,a,37,c)]. 0.07/0.52 Derived: subactivity(f10(f8(A,B),A),f8(A,B)) | min_precedes(f3(A,f8(A,B)),A,f8(A,B)) | -leaf_occ(A,B). [resolve(61,b,57,b)]. 0.07/0.52 Derived: subactivity(f10(A,f1(B,C,A)),A) | min_precedes(f3(f1(B,C,A),A),f1(B,C,A),A) | min_precedes(f1(B,C,A),f4(f1(B,C,A),A),A) | -min_precedes(B,C,A). [resolve(61,b,59,a)]. 0.07/0.52 62 atocc(A,f10(B,A)) | -leaf(A,B) | min_precedes(f3(A,B),A,B). [resolve(40,a,37,c)]. 0.07/0.52 Derived: atocc(A,f10(f8(A,B),A)) | min_precedes(f3(A,f8(A,B)),A,f8(A,B)) | -leaf_occ(A,B). [resolve(62,b,57,b)]. 0.07/0.52 Derived: atocc(f1(A,B,C),f10(C,f1(A,B,C))) | min_precedes(f3(f1(A,B,C),C),f1(A,B,C),C) | min_precedes(f1(A,B,C),f4(f1(A,B,C),C),C) | -min_precedes(A,B,C). [resolve(62,b,59,a)]. 0.07/0.52 63 legal(A) | -leaf(A,B) | min_precedes(f3(A,B),A,B). [resolve(41,a,37,c)]. 0.07/0.52 Derived: legal(A) | min_precedes(f3(A,f8(A,B)),A,f8(A,B)) | -leaf_occ(A,B). [resolve(63,b,57,b)]. 0.07/0.52 Derived: legal(f1(A,B,C)) | min_precedes(f3(f1(A,B,C),C),f1(A,B,C),C) | min_precedes(f1(A,B,C),f4(f1(A,B,C),C),C) | -min_precedes(A,B,C). [resolve(63,b,59,a)]. 0.07/0.52 64 -occurrence_of(A,B) | atomic(B) | leaf(f12(B,A),B) | min_precedes(f12(B,A),f4(f12(B,A),B),B). [resolve(42,c,35,c)]. 0.07/0.52 Derived: -occurrence_of(A,B) | atomic(B) | min_precedes(f12(B,A),f4(f12(B,A),B),B) | atomic(B) | occurrence_of(f2(f12(B,A),B),B). [resolve(64,c,54,b)]. 0.07/0.52 Derived: -occurrence_of(A,B) | atomic(B) | min_precedes(f12(B,A),f4(f12(B,A),B),B) | atomic(B) | leaf_occ(f12(B,A),f2(f12(B,A),B)). [resolve(64,c,55,b)]. 0.07/0.52 Derived: -occurrence_of(A,B) | atomic(B) | min_precedes(f12(B,A),f4(f12(B,A),B),B) | -min_precedes(f12(B,A),C,B). [resolve(64,c,56,a)]. 0.07/0.52 Derived: -occurrence_of(A,B) | atomic(B) | min_precedes(f12(B,A),f4(f12(B,A),B),B) | leaf_occ(f12(B,A),C) | -occurrence_of(C,B) | -subactivity_occurrence(f12(B,A),C). [resolve(64,c,58,d)]. 0.07/0.52 65 -occurrence_of(A,B) | -subactivity_occurrence(C,A) | root_occ(C,A) | -leaf(C,B) | min_precedes(f3(C,B),C,B). [resolve(43,c,37,c)]. 0.07/0.52 Derived: -occurrence_of(A,f8(B,C)) | -subactivity_occurrence(B,A) | root_occ(B,A) | min_precedes(f3(B,f8(B,C)),B,f8(B,C)) | -leaf_occ(B,C). [resolve(65,d,57,b)]. 0.07/0.52 Derived: -occurrence_of(A,B) | -subactivity_occurrence(f1(C,D,B),A) | root_occ(f1(C,D,B),A) | min_precedes(f3(f1(C,D,B),B),f1(C,D,B),B) | min_precedes(f1(C,D,B),f4(f1(C,D,B),B),B) | -min_precedes(C,D,B). [resolve(65,d,59,a)]. 0.07/0.52 66 -root_occ(A,B) | leaf(A,f14(A,B)) | min_precedes(A,f4(A,f14(A,B)),f14(A,B)). [resolve(44,a,35,c)]. 0.07/0.52 Derived: -root_occ(A,B) | min_precedes(A,f4(A,f14(A,B)),f14(A,B)) | atomic(f14(A,B)) | occurrence_of(f2(A,f14(A,B)),f14(A,B)). [resolve(66,b,54,b)]. 0.07/0.52 Derived: -root_occ(A,B) | min_precedes(A,f4(A,f14(A,B)),f14(A,B)) | atomic(f14(A,B)) | leaf_occ(A,f2(A,f14(A,B))). [resolve(66,b,55,b)]. 0.07/0.52 Derived: -root_occ(A,B) | min_precedes(A,f4(A,f14(A,B)),f14(A,B)) | -min_precedes(A,C,f14(A,B)). [resolve(66,b,56,a)]. 0.07/0.52 Derived: -root_occ(A,B) | min_precedes(A,f4(A,f14(A,B)),f14(A,B)) | leaf_occ(A,C) | -occurrence_of(C,f14(A,B)) | -subactivity_occurrence(A,C). [resolve(66,b,58,d)]. 0.07/0.52 67 -precedes(A,B) | legal(B) # label(sos_21) # label(axiom). [clausify(15)]. 0.07/0.52 68 -legal(A) | arboreal(A) # label(sos_13) # label(axiom). [clausify(9)]. 0.07/0.52 Derived: -precedes(A,B) | arboreal(B). [resolve(67,b,68,a)]. 0.07/0.52 69 precedes(A,B) | -legal(B) | -earlier(A,B) # label(sos_21) # label(axiom). [clausify(15)]. 0.07/0.52 Derived: precedes(A,B) | -earlier(A,B) | -precedes(C,B). [resolve(69,b,67,b)]. 0.07/0.53 70 legal(f1(A,B,C)) | -min_precedes(A,B,C). [resolve(41,a,36,b)]. 0.07/0.53 Derived: -min_precedes(A,B,C) | arboreal(f1(A,B,C)). [resolve(70,a,68,a)]. 0.07/0.53 Derived: -min_precedes(A,B,C) | precedes(D,f1(A,B,C)) | -earlier(D,f1(A,B,C)). [resolve(70,a,69,b)]. 0.07/0.53 71 -occurrence_of(A,B) | atomic(B) | legal(f12(B,A)). [resolve(42,c,41,a)]. 0.07/0.53 Derived: -occurrence_of(A,B) | atomic(B) | arboreal(f12(B,A)). [resolve(71,c,68,a)]. 0.07/0.53 Derived: -occurrence_of(A,B) | atomic(B) | precedes(C,f12(B,A)) | -earlier(C,f12(B,A)). [resolve(71,c,69,b)]. 0.07/0.53 72 -root_occ(A,B) | legal(A). [resolve(44,a,41,a)]. 0.07/0.53 Derived: -root_occ(A,B) | arboreal(A). [resolve(72,b,68,a)]. 0.07/0.53 Derived: -root_occ(A,B) | precedes(C,A) | -earlier(C,A). [resolve(72,b,69,b)]. 0.07/0.53 73 legal(A) | min_precedes(f3(A,f8(A,B)),A,f8(A,B)) | -leaf_occ(A,B). [resolve(63,b,57,b)]. 0.07/0.53 Derived: min_precedes(f3(A,f8(A,B)),A,f8(A,B)) | -leaf_occ(A,B) | arboreal(A). [resolve(73,a,68,a)]. 0.07/0.53 Derived: min_precedes(f3(A,f8(A,B)),A,f8(A,B)) | -leaf_occ(A,B) | precedes(C,A) | -earlier(C,A). [resolve(73,a,69,b)]. 0.07/0.53 74 legal(f1(A,B,C)) | min_precedes(f3(f1(A,B,C),C),f1(A,B,C),C) | min_precedes(f1(A,B,C),f4(f1(A,B,C),C),C) | -min_precedes(A,B,C). [resolve(63,b,59,a)]. 0.07/0.53 75 -activity_occurrence(A) | activity(f11(A)) # label(sos_12) # label(axiom). [clausify(21)]. 0.07/0.53 76 -occurrence_of(A,B) | activity_occurrence(A) # label(sos_03) # label(axiom). [clausify(10)]. 0.07/0.53 Derived: activity(f11(A)) | -occurrence_of(A,B). [resolve(75,a,76,b)]. 0.07/0.53 77 -activity_occurrence(A) | occurrence_of(A,f11(A)) # label(sos_12) # label(axiom). [clausify(21)]. 0.07/0.53 Derived: occurrence_of(A,f11(A)) | -occurrence_of(A,B). [resolve(77,a,76,b)]. 0.07/0.53 78 -subactivity_occurrence(A,B) | activity_occurrence(A) # label(sos_11) # label(axiom). [clausify(28)]. 0.07/0.53 Derived: -subactivity_occurrence(A,B) | activity(f11(A)). [resolve(78,b,75,a)]. 0.07/0.53 Derived: -subactivity_occurrence(A,B) | occurrence_of(A,f11(A)). [resolve(78,b,77,a)]. 0.07/0.53 79 -subactivity_occurrence(A,B) | activity_occurrence(B) # label(sos_11) # label(axiom). [clausify(28)]. 0.07/0.53 Derived: -subactivity_occurrence(A,B) | activity(f11(B)). [resolve(79,b,75,a)]. 0.07/0.53 Derived: -subactivity_occurrence(A,B) | occurrence_of(B,f11(B)). [resolve(79,b,77,a)]. 0.07/0.53 80 subactivity(A,f15(B,A)) | -atocc(B,A) # label(sos_14) # label(axiom). [clausify(33)]. 0.07/0.53 81 -atomic(A) | -occurrence_of(B,A) | -subactivity(C,A) | atocc(B,C) # label(sos_14) # label(axiom). [clausify(33)]. 0.07/0.53 Derived: -atocc(A,B) | -atomic(f15(A,B)) | -occurrence_of(C,f15(A,B)) | atocc(C,B). [resolve(80,a,81,c)]. 0.07/0.53 82 subactivity(f10(A,f1(B,C,A)),A) | -min_precedes(B,C,A). [resolve(39,a,36,b)]. 0.07/0.53 Derived: -min_precedes(A,B,C) | -atomic(C) | -occurrence_of(D,C) | atocc(D,f10(C,f1(A,B,C))). [resolve(82,a,81,c)]. 0.07/0.53 83 -occurrence_of(A,B) | atomic(B) | subactivity(f10(B,f12(B,A)),B). [resolve(42,c,39,a)]. 0.07/0.53 84 -root_occ(A,B) | subactivity(f10(f14(A,B),A),f14(A,B)). [resolve(44,a,39,a)]. 0.07/0.53 Derived: -root_occ(A,B) | -atomic(f14(A,B)) | -occurrence_of(C,f14(A,B)) | atocc(C,f10(f14(A,B),A)). [resolve(84,b,81,c)]. 0.07/0.53 85 subactivity(f10(f8(A,B),A),f8(A,B)) | min_precedes(f3(A,f8(A,B)),A,f8(A,B)) | -leaf_occ(A,B). [resolve(61,b,57,b)]. 0.07/0.53 Derived: min_precedes(f3(A,f8(A,B)),A,f8(A,B)) | -leaf_occ(A,B) | -atomic(f8(A,B)) | -occurrence_of(C,f8(A,B)) | atocc(C,f10(f8(A,B),A)). [resolve(85,a,81,c)]. 0.07/0.53 86 subactivity(f10(A,f1(B,C,A)),A) | min_precedes(f3(f1(B,C,A),A),f1(B,C,A),A) | min_precedes(f1(B,C,A),f4(f1(B,C,A),A),A) | -min_precedes(B,C,A). [resolve(61,b,59,a)]. 0.07/0.53 0.07/0.53 ============================== end predicate elimination ============= 0.07/0.53 0.07/0.53 Auto_denials: (non-Horn, no changes). 0.07/0.53 0.07/0.53 Term ordering decisions: 0.07/0.53 Function symbol KB weights: tptp0=1. tptp3=1. tptp1=1. tptp2=1. tptp4=1. c1=1. f2=1. f3=1. f4=1. f8=1. f10=1. f12=1. f14=1. f15=1. f16=1. f17=1. f5=1. f6=1. f7=1. f11=1. f1=1. f9=1. f13=1. 0.07/0.53 0.07/0.53 ============================== end of process initial clauses ======== 0.07/0.53 0.07/0.53 ============================== CLAUSES FOR SEARCH ==================== 0.07/0.53 0.07/0.53 ============================== end of clauses for search ============= 0.07/0.53 0.07/0.53 ============================== SEARCH ================================ 268.54/268.85 268.54/268.85 % Starting search at 0.03 seconds. 268.54/268.85 268.54/268.85 Low Water (keep): wt=79.000, iters=3457 268.54/268.85 268.54/268.85 Low Water (keep): wt=73.000, iters=3367 268.54/268.85 268.54/268.85 Low Water (keep): wt=67.000, iters=3367 268.54/268.85 268.54/268.85 Low Water (keep): wt=66.000, iters=3337 268.54/268.85 268.54/268.85 Low Water (keep): wt=65.000, iters=3427 268.54/268.85 268.54/268.85 Low Water (keep): wt=62.000, iters=3421 268.54/268.85 268.54/268.85 Low Water (keep): wt=57.000, iters=3638 268.54/268.85 268.54/268.85 Low Water (keep): wt=53.000, iters=3403 268.54/268.85 268.54/268.85 Low Water (keep): wt=50.000, iters=3730 268.54/268.85 268.54/268.85 Low Water (keep): wt=47.000, iters=3596 268.54/268.85 268.54/268.85 Low Water (keep): wt=46.000, iters=3480 268.54/268.85 268.54/268.85 Low Water (keep): wt=43.000, iters=3454 268.54/268.85 268.54/268.85 Low Water (keep): wt=42.000, iters=3351 268.54/268.85 268.54/268.85 Low Water (keep): wt=41.000, iters=3346 268.54/268.85 268.54/268.85 Low Water (keep): wt=40.000, iters=3407 268.54/268.85 268.54/268.85 Low Water (keep): wt=39.000, iters=3368 268.54/268.85 268.54/268.85 Low Water (keep): wt=38.000, iters=3699 268.54/268.85 268.54/268.85 Low Water (keep): wt=37.000, iters=3364 268.54/268.85 268.54/268.85 Low Water (keep): wt=36.000, iters=3703 268.54/268.85 268.54/268.85 Low Water (keep): wt=35.000, iters=3411 268.54/268.85 268.54/268.85 Low Water (keep): wt=34.000, iters=3470 268.54/268.85 268.54/268.85 ============================== PROOF ================================= 268.54/268.85 % SZS status Theorem 268.54/268.85 % SZS output start Refutation 268.54/268.85 268.54/268.85 % Proof 1 at 267.43 (+ 0.91) seconds. 268.54/268.85 % Length of proof is 224. 268.54/268.85 % Level of proof is 27. 268.54/268.85 % Maximum clause weight is 44.000. 268.54/268.85 % Given clauses 42108. 268.54/268.85 268.54/268.85 1 (all X68 all X69 all X70 (min_precedes(X68,X69,X70) -> (exists X71 (min_precedes(X71,X69,X70) & root(X71,X70))))) # label(sos_23) # label(axiom) # label(non_clause). [assumption]. 268.54/268.85 2 (all X75 all X76 all X77 (next_subocc(X75,X76,X77) -> arboreal(X76) & arboreal(X75))) # label(sos_25) # label(axiom) # label(non_clause). [assumption]. 268.54/268.85 4 (all X25 all X26 (-atomic(X26) & leaf(X25,X26) -> (exists X27 (occurrence_of(X27,X26) & leaf_occ(X25,X27))))) # label(sos_07) # label(axiom) # label(non_clause). [assumption]. 268.54/268.85 5 (all X28 all X29 all X30 (occurrence_of(X28,X29) & occurrence_of(X28,X30) -> X29 = X30)) # label(sos_08) # label(axiom) # label(non_clause). [assumption]. 268.54/268.85 8 (all X101 (occurrence_of(X101,tptp0) -> (exists X102 exists X103 exists X104 (root_occ(X102,X101) & leaf_occ(X104,X101) & next_subocc(X103,X104,tptp0) & (occurrence_of(X104,tptp1) | occurrence_of(X104,tptp2)) & next_subocc(X102,X103,tptp0) & occurrence_of(X103,tptp4) & occurrence_of(X102,tptp3))))) # label(sos_32) # label(axiom) # label(non_clause). [assumption]. 268.54/268.85 10 (all X12 all X13 (occurrence_of(X13,X12) -> activity_occurrence(X13) & activity(X12))) # label(sos_03) # label(axiom) # label(non_clause). [assumption]. 268.54/268.85 11 (all X55 all X56 (leaf_occ(X55,X56) <-> (exists X57 (occurrence_of(X56,X57) & subactivity_occurrence(X55,X56) & leaf(X55,X57))))) # label(sos_18) # label(axiom) # label(non_clause). [assumption]. 268.54/268.85 12 (all X3 all X4 all X5 all X6 all X7 (subactivity_occurrence(X5,X4) & min_precedes(X6,X5,X3) & X5 != X7 & leaf_occ(X7,X4) & root_occ(X6,X4) & occurrence_of(X4,X3) -> min_precedes(X5,X7,X3))) # label(sos_01) # label(axiom) # label(non_clause). [assumption]. 268.54/268.85 16 (all X78 all X79 all X80 (next_subocc(X78,X79,X80) <-> min_precedes(X78,X79,X80) & -(exists X81 (min_precedes(X81,X79,X80) & min_precedes(X78,X81,X80))))) # label(sos_26) # label(axiom) # label(non_clause). [assumption]. 268.54/268.85 21 (all X41 (activity_occurrence(X41) -> (exists X42 (activity(X42) & occurrence_of(X41,X42))))) # label(sos_12) # label(axiom) # label(non_clause). [assumption]. 268.54/268.85 22 (all X14 all X15 all X16 all X17 (arboreal(X16) & subactivity_occurrence(X17,X15) & subactivity_occurrence(X16,X15) & arboreal(X17) & occurrence_of(X15,X14) -> X16 = X17 | min_precedes(X17,X16,X14) | min_precedes(X16,X17,X14))) # label(sos_04) # label(axiom) # label(non_clause). [assumption]. 268.54/268.85 24 (all X51 all X52 (occurrence_of(X51,X52) -> (arboreal(X51) <-> atomic(X52)))) # label(sos_16) # label(axiom) # label(non_clause). [assumption]. 268.54/268.85 26 (all X86 all X87 all X88 all X89 (occurrence_of(X88,X89) & leaf_occ(X86,X88) & leaf_occ(X87,X88) & -atomic(X89) -> X87 = X86)) # label(sos_28) # label(axiom) # label(non_clause). [assumption]. 268.54/268.85 27 (all X82 all X83 all X84 all X85 (occurrence_of(X85,X84) & subactivity_occurrence(X83,X85) & min_precedes(X82,X83,X84) -> subactivity_occurrence(X82,X85))) # label(sos_27) # label(axiom) # label(non_clause). [assumption]. 268.54/268.85 28 (all X39 all X40 (subactivity_occurrence(X39,X40) -> activity_occurrence(X39) & activity_occurrence(X40))) # label(sos_11) # label(axiom) # label(non_clause). [assumption]. 268.54/268.85 29 (all X90 all X91 all X92 all X93 (occurrence_of(X92,X93) & root_occ(X90,X92) & root_occ(X91,X92) -> X91 = X90)) # label(sos_29) # label(axiom) # label(non_clause). [assumption]. 268.54/268.85 30 (all X0 all X1 (occurrence_of(X1,X0) & -atomic(X0) -> (exists X2 (root(X2,X0) & subactivity_occurrence(X2,X1))))) # label(sos) # label(axiom) # label(non_clause). [assumption]. 268.54/268.85 31 (all X21 all X22 all X23 (min_precedes(X22,X23,X21) -> (exists X24 (occurrence_of(X24,X21) & subactivity_occurrence(X23,X24) & subactivity_occurrence(X22,X24))))) # label(sos_06) # label(axiom) # label(non_clause). [assumption]. 268.54/268.85 32 (all X58 all X59 ((exists X60 (occurrence_of(X59,X60) & subactivity_occurrence(X58,X59) & root(X58,X60))) <-> root_occ(X58,X59))) # label(sos_19) # label(axiom) # label(non_clause). [assumption]. 268.54/268.85 34 -(all X105 (occurrence_of(X105,tptp0) -> (exists X106 exists X107 (root_occ(X106,X105) & (occurrence_of(X107,tptp1) | occurrence_of(X107,tptp2)) & min_precedes(X106,X107,tptp0) & (occurrence_of(X107,tptp2) -> -(exists X109 (occurrence_of(X109,tptp1) & min_precedes(X106,X109,tptp0) & subactivity_occurrence(X109,X105)))) & (occurrence_of(X107,tptp1) -> -(exists X108 (occurrence_of(X108,tptp2) & min_precedes(X106,X108,tptp0) & subactivity_occurrence(X108,X105)))) & leaf_occ(X107,X105) & occurrence_of(X106,tptp3))))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption]. 268.54/268.85 36 -min_precedes(A,B,C) | root(f1(A,B,C),C) # label(sos_23) # label(axiom). [clausify(1)]. 268.54/268.85 42 -occurrence_of(A,B) | atomic(B) | root(f12(B,A),B) # label(sos) # label(axiom). [clausify(30)]. 268.54/268.85 43 -occurrence_of(A,B) | -subactivity_occurrence(C,A) | -root(C,B) | root_occ(C,A) # label(sos_19) # label(axiom). [clausify(32)]. 268.54/268.85 45 -occurrence_of(A,tptp0) | next_subocc(f6(A),f7(A),tptp0) # label(sos_32) # label(axiom). [clausify(8)]. 268.54/268.85 47 -next_subocc(A,B,C) | arboreal(A) # label(sos_25) # label(axiom). [clausify(2)]. 268.54/268.85 48 -occurrence_of(A,tptp0) | next_subocc(f5(A),f6(A),tptp0) # label(sos_32) # label(axiom). [clausify(8)]. 268.54/268.85 49 -next_subocc(A,B,C) | min_precedes(A,B,C) # label(sos_26) # label(axiom). [clausify(16)]. 268.54/268.85 50 -next_subocc(A,B,C) | -min_precedes(D,B,C) | -min_precedes(A,D,C) # label(sos_26) # label(axiom). [clausify(16)]. 268.54/268.85 54 atomic(A) | -leaf(B,A) | occurrence_of(f2(B,A),A) # label(sos_07) # label(axiom). [clausify(4)]. 268.54/268.85 55 atomic(A) | -leaf(B,A) | leaf_occ(B,f2(B,A)) # label(sos_07) # label(axiom). [clausify(4)]. 268.54/268.85 57 -leaf_occ(A,B) | leaf(A,f8(A,B)) # label(sos_18) # label(axiom). [clausify(11)]. 268.54/268.85 76 -occurrence_of(A,B) | activity_occurrence(A) # label(sos_03) # label(axiom). [clausify(10)]. 268.54/268.85 77 -activity_occurrence(A) | occurrence_of(A,f11(A)) # label(sos_12) # label(axiom). [clausify(21)]. 268.54/268.85 78 -subactivity_occurrence(A,B) | activity_occurrence(A) # label(sos_11) # label(axiom). [clausify(28)]. 268.54/268.85 87 -min_precedes(A,B,C) | min_precedes(f1(A,B,C),B,C) # label(sos_23) # label(axiom). [clausify(1)]. 268.54/268.85 89 -occurrence_of(A,B) | -occurrence_of(A,C) | C = B # label(sos_08) # label(axiom). [clausify(5)]. 268.54/268.85 90 tptp1 != tptp2 # label(sos_44) # label(axiom). [assumption]. 268.54/268.85 91 tptp2 != tptp1. [copy(90),flip(a)]. 268.54/268.85 92 tptp4 != tptp2 # label(sos_41) # label(axiom). [assumption]. 268.54/268.85 94 -occurrence_of(A,tptp0) | root_occ(f5(A),A) # label(sos_32) # label(axiom). [clausify(8)]. 268.54/268.85 95 -occurrence_of(A,tptp0) | leaf_occ(f7(A),A) # label(sos_32) # label(axiom). [clausify(8)]. 268.54/268.85 96 -occurrence_of(A,tptp0) | occurrence_of(f7(A),tptp1) | occurrence_of(f7(A),tptp2) # label(sos_32) # label(axiom). [clausify(8)]. 268.54/268.85 97 -occurrence_of(A,tptp0) | occurrence_of(f6(A),tptp4) # label(sos_32) # label(axiom). [clausify(8)]. 268.54/268.85 98 -occurrence_of(A,tptp0) | occurrence_of(f5(A),tptp3) # label(sos_32) # label(axiom). [clausify(8)]. 268.54/268.85 100 -leaf_occ(A,B) | occurrence_of(B,f8(A,B)) # label(sos_18) # label(axiom). [clausify(11)]. 268.54/268.85 101 -leaf_occ(A,B) | subactivity_occurrence(A,B) # label(sos_18) # label(axiom). [clausify(11)]. 268.54/268.85 103 -subactivity_occurrence(A,B) | -min_precedes(C,A,D) | E = A | -leaf_occ(E,B) | -root_occ(C,B) | -occurrence_of(B,D) | min_precedes(A,E,D) # label(sos_01) # label(axiom). [clausify(12)]. 268.54/268.85 109 -arboreal(A) | -subactivity_occurrence(B,C) | -subactivity_occurrence(A,C) | -arboreal(B) | -occurrence_of(C,D) | B = A | min_precedes(B,A,D) | min_precedes(A,B,D) # label(sos_04) # label(axiom). [clausify(22)]. 268.54/268.85 113 -occurrence_of(A,B) | arboreal(A) | -atomic(B) # label(sos_16) # label(axiom). [clausify(24)]. 268.54/268.85 114 tptp4 != tptp1 # label(sos_40) # label(axiom). [assumption]. 268.54/268.85 115 -atomic(tptp0) # label(sos_34) # label(axiom). [assumption]. 268.54/268.85 116 -occurrence_of(A,B) | -leaf_occ(C,A) | -leaf_occ(D,A) | atomic(B) | D = C # label(sos_28) # label(axiom). [clausify(26)]. 268.54/268.85 117 -occurrence_of(A,B) | -subactivity_occurrence(C,A) | -min_precedes(D,C,B) | subactivity_occurrence(D,A) # label(sos_27) # label(axiom). [clausify(27)]. 268.54/268.85 118 -occurrence_of(A,B) | -root_occ(C,A) | -root_occ(D,A) | D = C # label(sos_29) # label(axiom). [clausify(29)]. 268.54/268.85 119 atomic(tptp1) # label(sos_36) # label(axiom). [assumption]. 268.54/268.85 120 -occurrence_of(A,B) | atomic(B) | subactivity_occurrence(f12(B,A),A) # label(sos) # label(axiom). [clausify(30)]. 268.54/268.85 124 -min_precedes(A,B,C) | occurrence_of(f13(C,A,B),C) # label(sos_06) # label(axiom). [clausify(31)]. 268.54/268.85 125 -min_precedes(A,B,C) | subactivity_occurrence(B,f13(C,A,B)) # label(sos_06) # label(axiom). [clausify(31)]. 268.54/268.85 126 -min_precedes(A,B,C) | subactivity_occurrence(A,f13(C,A,B)) # label(sos_06) # label(axiom). [clausify(31)]. 268.54/268.85 127 atomic(tptp2) # label(sos_37) # label(axiom). [assumption]. 268.54/268.85 132 occurrence_of(c1,tptp0) # label(goals) # label(negated_conjecture). [clausify(34)]. 268.54/268.85 133 -root_occ(A,c1) | -occurrence_of(B,tptp1) | -min_precedes(A,B,tptp0) | occurrence_of(B,tptp2) | occurrence_of(f17(A,B),tptp2) | -leaf_occ(B,c1) | -occurrence_of(A,tptp3) # label(goals) # label(negated_conjecture). [clausify(34)]. 268.54/268.85 134 -root_occ(A,c1) | -occurrence_of(B,tptp1) | -min_precedes(A,B,tptp0) | occurrence_of(B,tptp2) | min_precedes(A,f17(A,B),tptp0) | -leaf_occ(B,c1) | -occurrence_of(A,tptp3) # label(goals) # label(negated_conjecture). [clausify(34)]. 268.54/268.85 135 -root_occ(A,c1) | -occurrence_of(B,tptp1) | -min_precedes(A,B,tptp0) | occurrence_of(B,tptp2) | subactivity_occurrence(f17(A,B),c1) | -leaf_occ(B,c1) | -occurrence_of(A,tptp3) # label(goals) # label(negated_conjecture). [clausify(34)]. 268.54/268.85 145 -root_occ(A,c1) | -occurrence_of(B,tptp2) | -min_precedes(A,B,tptp0) | occurrence_of(f16(A,B),tptp1) | occurrence_of(B,tptp1) | -leaf_occ(B,c1) | -occurrence_of(A,tptp3) # label(goals) # label(negated_conjecture). [clausify(34)]. 268.54/268.85 149 -root_occ(A,c1) | -occurrence_of(B,tptp2) | -min_precedes(A,B,tptp0) | min_precedes(A,f16(A,B),tptp0) | occurrence_of(B,tptp1) | -leaf_occ(B,c1) | -occurrence_of(A,tptp3) # label(goals) # label(negated_conjecture). [clausify(34)]. 268.54/268.85 153 -root_occ(A,c1) | -occurrence_of(B,tptp2) | -min_precedes(A,B,tptp0) | subactivity_occurrence(f16(A,B),c1) | occurrence_of(B,tptp1) | -leaf_occ(B,c1) | -occurrence_of(A,tptp3) # label(goals) # label(negated_conjecture). [clausify(34)]. 268.54/268.85 161 -occurrence_of(A,B) | -subactivity_occurrence(f1(C,D,B),A) | root_occ(f1(C,D,B),A) | -min_precedes(C,D,B). [resolve(43,c,36,b)]. 268.54/268.85 162 -occurrence_of(A,B) | -subactivity_occurrence(f12(B,C),A) | root_occ(f12(B,C),A) | -occurrence_of(C,B) | atomic(B). [resolve(43,c,42,c)]. 268.54/268.85 167 -occurrence_of(A,tptp0) | arboreal(f6(A)). [resolve(45,b,47,a)]. 268.54/268.85 169 min_precedes(f6(A),f7(A),tptp0) | -occurrence_of(A,tptp0). [resolve(49,a,45,b)]. 268.54/268.85 170 min_precedes(f5(A),f6(A),tptp0) | -occurrence_of(A,tptp0). [resolve(49,a,48,b)]. 268.54/268.85 171 -min_precedes(A,f7(B),tptp0) | -min_precedes(f6(B),A,tptp0) | -occurrence_of(B,tptp0). [resolve(50,a,45,b)]. 268.54/268.85 172 -min_precedes(A,f6(B),tptp0) | -min_precedes(f5(B),A,tptp0) | -occurrence_of(B,tptp0). [resolve(50,a,48,b)]. 268.54/268.85 182 -leaf_occ(A,B) | atomic(f8(A,B)) | occurrence_of(f2(A,f8(A,B)),f8(A,B)). [resolve(57,b,54,b)]. 268.54/268.85 183 -leaf_occ(A,B) | atomic(f8(A,B)) | leaf_occ(A,f2(A,f8(A,B))). [resolve(57,b,55,b)]. 268.54/268.85 215 occurrence_of(A,f11(A)) | -occurrence_of(A,B). [resolve(77,a,76,b)]. 268.54/268.85 216 -subactivity_occurrence(A,B) | occurrence_of(A,f11(A)). [resolve(78,b,77,a)]. 268.54/268.85 224 -occurrence_of(A,B) | -subactivity_occurrence(f12(B,A),A) | root_occ(f12(B,A),A) | atomic(B). [factor(162,a,d)]. 268.54/268.85 234 subactivity_occurrence(f12(tptp0,c1),c1). [resolve(132,a,120,a),unit_del(a,115)]. 268.54/268.85 236 occurrence_of(f5(c1),tptp3). [resolve(132,a,98,a)]. 268.54/268.85 237 occurrence_of(f6(c1),tptp4). [resolve(132,a,97,a)]. 268.54/268.85 238 occurrence_of(f7(c1),tptp1) | occurrence_of(f7(c1),tptp2). [resolve(132,a,96,a)]. 268.54/268.85 239 leaf_occ(f7(c1),c1). [resolve(132,a,95,a)]. 268.54/268.85 240 root_occ(f5(c1),c1). [resolve(132,a,94,a)]. 268.54/268.85 241 -occurrence_of(c1,A) | tptp0 = A. [resolve(132,a,89,b)]. 268.54/268.85 244 arboreal(f6(c1)). [resolve(167,a,132,a)]. 268.54/268.85 246 min_precedes(f6(c1),f7(c1),tptp0). [resolve(169,b,132,a)]. 268.54/268.85 247 min_precedes(f5(c1),f6(c1),tptp0). [resolve(170,b,132,a)]. 268.54/268.85 253 root_occ(f12(tptp0,c1),c1). [resolve(234,a,224,b),unit_del(a,132),unit_del(c,115)]. 268.54/268.85 261 occurrence_of(f6(c1),f11(f6(c1))). [resolve(237,a,215,b)]. 268.54/268.85 262 -occurrence_of(f6(c1),A) | tptp4 = A. [resolve(237,a,89,b)]. 268.54/268.85 265 atomic(f8(f7(c1),c1)) | leaf_occ(f7(c1),f2(f7(c1),f8(f7(c1),c1))). [resolve(239,a,183,a)]. 268.54/268.85 266 atomic(f8(f7(c1),c1)) | occurrence_of(f2(f7(c1),f8(f7(c1),c1)),f8(f7(c1),c1)). [resolve(239,a,182,a)]. 268.54/268.85 268 subactivity_occurrence(f7(c1),c1). [resolve(239,a,101,a)]. 268.54/268.85 269 occurrence_of(c1,f8(f7(c1),c1)). [resolve(239,a,100,a)]. 268.54/268.85 276 -occurrence_of(c1,A) | -root_occ(B,c1) | f5(c1) = B. [resolve(240,a,118,c)]. 268.54/268.85 290 occurrence_of(f7(c1),tptp1) | -occurrence_of(f7(c1),A) | tptp2 = A. [resolve(238,b,89,b)]. 268.54/268.85 291 occurrence_of(f7(c1),f11(f7(c1))). [resolve(268,a,216,a)]. 268.54/268.85 331 -occurrence_of(A,tptp0) | -subactivity_occurrence(f1(f6(c1),f7(c1),tptp0),A) | root_occ(f1(f6(c1),f7(c1),tptp0),A). [resolve(246,a,161,d)]. 268.54/268.85 357 subactivity_occurrence(f6(c1),f13(tptp0,f6(c1),f7(c1))). [resolve(246,a,126,a)]. 268.54/268.85 358 subactivity_occurrence(f7(c1),f13(tptp0,f6(c1),f7(c1))). [resolve(246,a,125,a)]. 268.54/268.85 359 occurrence_of(f13(tptp0,f6(c1),f7(c1)),tptp0). [resolve(246,a,124,a)]. 268.54/268.85 360 -occurrence_of(A,tptp0) | -subactivity_occurrence(f7(c1),A) | subactivity_occurrence(f6(c1),A). [resolve(246,a,117,c)]. 268.54/268.85 367 min_precedes(f1(f6(c1),f7(c1),tptp0),f7(c1),tptp0). [resolve(246,a,87,a)]. 268.54/268.85 427 -occurrence_of(A,tptp0) | -subactivity_occurrence(f6(c1),A) | subactivity_occurrence(f5(c1),A). [resolve(247,a,117,c)]. 268.54/268.85 513 f8(f7(c1),c1) = tptp0. [resolve(269,a,241,a),flip(a)]. 268.54/268.85 514 occurrence_of(f2(f7(c1),tptp0),tptp0). [back_rewrite(266),rewrite([513(4),513(8),513(10)]),unit_del(a,115)]. 268.54/268.85 515 leaf_occ(f7(c1),f2(f7(c1),tptp0)). [back_rewrite(265),rewrite([513(4),513(10)]),unit_del(a,115)]. 268.54/268.85 587 -occurrence_of(f7(c1),A) | f11(f7(c1)) = A. [resolve(291,a,89,b)]. 268.54/268.85 657 min_precedes(f5(f2(f7(c1),tptp0)),f6(f2(f7(c1),tptp0)),tptp0). [resolve(514,a,170,b)]. 268.54/268.85 658 min_precedes(f6(f2(f7(c1),tptp0)),f7(f2(f7(c1),tptp0)),tptp0). [resolve(514,a,169,b)]. 268.54/268.85 660 arboreal(f6(f2(f7(c1),tptp0))). [resolve(514,a,167,a)]. 268.54/268.85 668 leaf_occ(f7(f2(f7(c1),tptp0)),f2(f7(c1),tptp0)). [resolve(514,a,95,a)]. 268.54/268.85 669 root_occ(f5(f2(f7(c1),tptp0)),f2(f7(c1),tptp0)). [resolve(514,a,94,a)]. 268.54/268.85 670 -occurrence_of(f2(f7(c1),tptp0),A) | tptp0 = A. [resolve(514,a,89,b)]. 268.54/268.85 682 f11(f6(c1)) = tptp4. [resolve(262,a,261,a),flip(a)]. 268.54/268.85 688 -occurrence_of(f2(f7(c1),tptp0),A) | -leaf_occ(B,f2(f7(c1),tptp0)) | atomic(A) | f7(c1) = B. [resolve(515,a,116,c)]. 268.54/268.85 689 subactivity_occurrence(f7(c1),f2(f7(c1),tptp0)). [resolve(515,a,101,a)]. 268.54/268.85 801 -occurrence_of(c1,A) | f12(tptp0,c1) = f5(c1). [resolve(276,b,253,a),flip(b)]. 268.54/268.85 806 occurrence_of(f7(c1),tptp1) | f11(f7(c1)) = tptp2. [resolve(290,b,291,a),flip(b)]. 268.54/268.85 813 -subactivity_occurrence(A,f13(tptp0,f6(c1),f7(c1))) | -arboreal(A) | -occurrence_of(f13(tptp0,f6(c1),f7(c1)),B) | f6(c1) = A | min_precedes(A,f6(c1),B) | min_precedes(f6(c1),A,B). [resolve(357,a,109,c),flip(e),unit_del(a,244)]. 268.54/268.85 843 f12(tptp0,c1) = f5(c1). [resolve(801,a,132,a)]. 268.54/268.85 1010 -occurrence_of(A,tptp0) | -subactivity_occurrence(f5(c1),A) | root_occ(f5(c1),A). [para(843(a,1),162(b,1)),rewrite([843(8)]),unit_del(d,132),unit_del(e,115)]. 268.54/268.85 1013 f11(f7(c1)) = tptp2 | f11(f7(c1)) = tptp1. [resolve(806,a,587,a)]. 268.54/268.85 1014 f11(f7(c1)) = tptp2 | -occurrence_of(f7(c1),A) | tptp1 = A. [resolve(806,a,89,b)]. 268.54/268.85 1033 -root_occ(f1(f6(c1),f7(c1),tptp0),c1) | -occurrence_of(f7(c1),tptp2) | subactivity_occurrence(f16(f1(f6(c1),f7(c1),tptp0),f7(c1)),c1) | occurrence_of(f7(c1),tptp1) | -occurrence_of(f1(f6(c1),f7(c1),tptp0),tptp3). [resolve(367,a,153,c),unit_del(e,239)]. 268.54/268.85 1037 -root_occ(f1(f6(c1),f7(c1),tptp0),c1) | -occurrence_of(f7(c1),tptp2) | min_precedes(f1(f6(c1),f7(c1),tptp0),f16(f1(f6(c1),f7(c1),tptp0),f7(c1)),tptp0) | occurrence_of(f7(c1),tptp1) | -occurrence_of(f1(f6(c1),f7(c1),tptp0),tptp3). [resolve(367,a,149,c),unit_del(e,239)]. 268.54/268.85 1041 -root_occ(f1(f6(c1),f7(c1),tptp0),c1) | -occurrence_of(f7(c1),tptp2) | occurrence_of(f16(f1(f6(c1),f7(c1),tptp0),f7(c1)),tptp1) | occurrence_of(f7(c1),tptp1) | -occurrence_of(f1(f6(c1),f7(c1),tptp0),tptp3). [resolve(367,a,145,c),unit_del(e,239)]. 268.54/268.85 1051 -root_occ(f1(f6(c1),f7(c1),tptp0),c1) | -occurrence_of(f7(c1),tptp1) | occurrence_of(f7(c1),tptp2) | subactivity_occurrence(f17(f1(f6(c1),f7(c1),tptp0),f7(c1)),c1) | -occurrence_of(f1(f6(c1),f7(c1),tptp0),tptp3). [resolve(367,a,135,c),unit_del(e,239)]. 268.54/268.85 1052 -root_occ(f1(f6(c1),f7(c1),tptp0),c1) | -occurrence_of(f7(c1),tptp1) | occurrence_of(f7(c1),tptp2) | min_precedes(f1(f6(c1),f7(c1),tptp0),f17(f1(f6(c1),f7(c1),tptp0),f7(c1)),tptp0) | -occurrence_of(f1(f6(c1),f7(c1),tptp0),tptp3). [resolve(367,a,134,c),unit_del(e,239)]. 268.54/268.85 1053 -root_occ(f1(f6(c1),f7(c1),tptp0),c1) | -occurrence_of(f7(c1),tptp1) | occurrence_of(f7(c1),tptp2) | occurrence_of(f17(f1(f6(c1),f7(c1),tptp0),f7(c1)),tptp2) | -occurrence_of(f1(f6(c1),f7(c1),tptp0),tptp3). [resolve(367,a,133,c),unit_del(e,239)]. 268.54/268.85 1057 -occurrence_of(A,tptp0) | -subactivity_occurrence(f7(c1),A) | subactivity_occurrence(f1(f6(c1),f7(c1),tptp0),A). [resolve(367,a,117,c)]. 268.54/268.85 1134 atomic(f8(f7(f2(f7(c1),tptp0)),f2(f7(c1),tptp0))) | occurrence_of(f2(f7(f2(f7(c1),tptp0)),f8(f7(f2(f7(c1),tptp0)),f2(f7(c1),tptp0))),f8(f7(f2(f7(c1),tptp0)),f2(f7(c1),tptp0))). [resolve(668,a,182,a)]. 268.54/268.85 1137 occurrence_of(f2(f7(c1),tptp0),f8(f7(f2(f7(c1),tptp0)),f2(f7(c1),tptp0))). [resolve(668,a,100,a)]. 268.54/268.85 1243 f11(f7(c1)) = tptp1 | occurrence_of(f7(c1),tptp2). [para(1013(a,1),291(a,2))]. 268.54/268.85 1244 f11(f7(c1)) = tptp1 | -occurrence_of(f7(c1),A) | tptp2 = A. [resolve(1243,b,89,b)]. 268.54/268.85 1281 subactivity_occurrence(f6(c1),f2(f7(c1),tptp0)). [resolve(360,b,689,a),unit_del(a,514)]. 268.54/268.85 1282 subactivity_occurrence(f6(c1),c1). [resolve(360,b,268,a),unit_del(a,132)]. 268.54/268.85 1290 -subactivity_occurrence(A,c1) | -arboreal(A) | -occurrence_of(c1,B) | f6(c1) = A | min_precedes(A,f6(c1),B) | min_precedes(f6(c1),A,B). [resolve(1282,a,109,c),flip(e),unit_del(a,244)]. 268.54/268.85 1297 subactivity_occurrence(f5(c1),f2(f7(c1),tptp0)). [resolve(427,b,1281,a),unit_del(a,514)]. 268.54/268.85 1336 root_occ(f5(c1),f2(f7(c1),tptp0)). [resolve(1010,b,1297,a),unit_del(a,514)]. 268.54/268.85 1344 -occurrence_of(f2(f7(c1),tptp0),A) | -root_occ(B,f2(f7(c1),tptp0)) | f5(c1) = B. [resolve(1336,a,118,c)]. 268.54/268.85 1545 -occurrence_of(A,tptp0) | -subactivity_occurrence(f7(f2(f7(c1),tptp0)),A) | subactivity_occurrence(f6(f2(f7(c1),tptp0)),A). [resolve(658,a,117,c)]. 268.54/268.85 2443 subactivity_occurrence(f1(f6(c1),f7(c1),tptp0),c1). [resolve(1057,b,268,a),unit_del(a,132)]. 268.54/268.85 2444 root_occ(f1(f6(c1),f7(c1),tptp0),c1). [resolve(2443,a,331,b),unit_del(a,132)]. 268.54/268.85 2452 -occurrence_of(f7(c1),tptp1) | occurrence_of(f7(c1),tptp2) | occurrence_of(f17(f1(f6(c1),f7(c1),tptp0),f7(c1)),tptp2) | -occurrence_of(f1(f6(c1),f7(c1),tptp0),tptp3). [back_unit_del(1053),unit_del(a,2444)]. 268.54/268.85 2453 -occurrence_of(f7(c1),tptp1) | occurrence_of(f7(c1),tptp2) | min_precedes(f1(f6(c1),f7(c1),tptp0),f17(f1(f6(c1),f7(c1),tptp0),f7(c1)),tptp0) | -occurrence_of(f1(f6(c1),f7(c1),tptp0),tptp3). [back_unit_del(1052),unit_del(a,2444)]. 268.54/268.85 2454 -occurrence_of(f7(c1),tptp1) | occurrence_of(f7(c1),tptp2) | subactivity_occurrence(f17(f1(f6(c1),f7(c1),tptp0),f7(c1)),c1) | -occurrence_of(f1(f6(c1),f7(c1),tptp0),tptp3). [back_unit_del(1051),unit_del(a,2444)]. 268.54/268.85 2464 -occurrence_of(f7(c1),tptp2) | occurrence_of(f16(f1(f6(c1),f7(c1),tptp0),f7(c1)),tptp1) | occurrence_of(f7(c1),tptp1) | -occurrence_of(f1(f6(c1),f7(c1),tptp0),tptp3). [back_unit_del(1041),unit_del(a,2444)]. 268.54/268.85 2468 -occurrence_of(f7(c1),tptp2) | min_precedes(f1(f6(c1),f7(c1),tptp0),f16(f1(f6(c1),f7(c1),tptp0),f7(c1)),tptp0) | occurrence_of(f7(c1),tptp1) | -occurrence_of(f1(f6(c1),f7(c1),tptp0),tptp3). [back_unit_del(1037),unit_del(a,2444)]. 268.54/268.85 2472 -occurrence_of(f7(c1),tptp2) | subactivity_occurrence(f16(f1(f6(c1),f7(c1),tptp0),f7(c1)),c1) | occurrence_of(f7(c1),tptp1) | -occurrence_of(f1(f6(c1),f7(c1),tptp0),tptp3). [back_unit_del(1033),unit_del(a,2444)]. 268.54/268.85 2476 -occurrence_of(c1,A) | f1(f6(c1),f7(c1),tptp0) = f5(c1). [resolve(2444,a,276,b),flip(b)]. 268.54/268.85 2557 -occurrence_of(f2(f7(c1),tptp0),A) | atomic(A) | f7(f2(f7(c1),tptp0)) = f7(c1). [resolve(688,b,668,a),flip(c)]. 268.54/268.85 2558 f1(f6(c1),f7(c1),tptp0) = f5(c1). [resolve(2476,a,132,a)]. 268.54/268.85 2562 -occurrence_of(f7(c1),tptp2) | subactivity_occurrence(f16(f5(c1),f7(c1)),c1) | occurrence_of(f7(c1),tptp1). [back_rewrite(2472),rewrite([2558(10),2558(21)]),unit_del(d,236)]. 268.54/268.85 2566 -occurrence_of(f7(c1),tptp2) | min_precedes(f5(c1),f16(f5(c1),f7(c1)),tptp0) | occurrence_of(f7(c1),tptp1). [back_rewrite(2468),rewrite([2558(10),2558(12),2558(23)]),unit_del(d,236)]. 268.54/268.85 2570 -occurrence_of(f7(c1),tptp2) | occurrence_of(f16(f5(c1),f7(c1)),tptp1) | occurrence_of(f7(c1),tptp1). [back_rewrite(2464),rewrite([2558(10),2558(21)]),unit_del(d,236)]. 268.54/268.85 2580 -occurrence_of(f7(c1),tptp1) | occurrence_of(f7(c1),tptp2) | subactivity_occurrence(f17(f5(c1),f7(c1)),c1). [back_rewrite(2454),rewrite([2558(14),2558(21)]),unit_del(d,236)]. 268.54/268.85 2581 -occurrence_of(f7(c1),tptp1) | occurrence_of(f7(c1),tptp2) | min_precedes(f5(c1),f17(f5(c1),f7(c1)),tptp0). [back_rewrite(2453),rewrite([2558(14),2558(16),2558(23)]),unit_del(d,236)]. 268.54/268.85 2582 -occurrence_of(f7(c1),tptp1) | occurrence_of(f7(c1),tptp2) | occurrence_of(f17(f5(c1),f7(c1)),tptp2). [back_rewrite(2452),rewrite([2558(14),2558(21)]),unit_del(d,236)]. 268.54/268.85 3734 f8(f7(f2(f7(c1),tptp0)),f2(f7(c1),tptp0)) = tptp0. [resolve(1137,a,670,a),flip(a)]. 268.54/268.85 3735 occurrence_of(f2(f7(f2(f7(c1),tptp0)),tptp0),tptp0). [back_rewrite(1134),rewrite([3734(10),3734(17),3734(19)]),unit_del(a,115)]. 268.54/268.85 3743 min_precedes(f6(f2(f7(f2(f7(c1),tptp0)),tptp0)),f7(f2(f7(f2(f7(c1),tptp0)),tptp0)),tptp0). [resolve(3735,a,169,b)]. 268.54/268.85 3951 subactivity_occurrence(f16(f5(c1),f7(c1)),c1) | occurrence_of(f7(c1),tptp1). [resolve(2562,a,238,b),merge(c)]. 268.54/268.85 3954 occurrence_of(f7(c1),tptp1) | occurrence_of(f16(f5(c1),f7(c1)),f11(f16(f5(c1),f7(c1)))). [resolve(3951,a,216,a)]. 268.54/268.85 3962 occurrence_of(f16(f5(c1),f7(c1)),tptp1) | occurrence_of(f7(c1),tptp1). [resolve(2570,a,238,b),merge(c)]. 268.54/268.85 3963 occurrence_of(f7(c1),tptp1) | arboreal(f16(f5(c1),f7(c1))). [resolve(3962,a,113,a),unit_del(c,119)]. 268.54/268.85 3964 occurrence_of(f7(c1),tptp1) | -occurrence_of(f16(f5(c1),f7(c1)),A) | tptp1 = A. [resolve(3962,a,89,b)]. 268.54/268.85 3965 arboreal(f16(f5(c1),f7(c1))) | f11(f7(c1)) = tptp1. [resolve(3963,a,1244,b),unit_del(c,91)]. 268.54/268.85 3968 occurrence_of(f7(c1),tptp2) | subactivity_occurrence(f17(f5(c1),f7(c1)),c1) | f11(f7(c1)) = tptp2. [resolve(2580,a,806,a)]. 268.54/268.85 3970 occurrence_of(f7(c1),tptp2) | occurrence_of(f17(f5(c1),f7(c1)),tptp2) | f11(f7(c1)) = tptp2. [resolve(2582,a,806,a)]. 268.54/268.85 4152 -occurrence_of(f2(f7(c1),tptp0),A) | f5(f2(f7(c1),tptp0)) = f5(c1). [resolve(1344,b,669,a),flip(b)]. 268.54/268.85 4153 f5(f2(f7(c1),tptp0)) = f5(c1). [resolve(4152,a,514,a)]. 268.54/268.85 4232 min_precedes(f5(c1),f6(f2(f7(c1),tptp0)),tptp0). [back_rewrite(657),rewrite([4153(5)])]. 268.54/268.85 4248 -min_precedes(f6(f2(f7(c1),tptp0)),f6(c1),tptp0). [resolve(4232,a,172,b),unit_del(b,132)]. 268.54/268.85 4412 f7(f2(f7(c1),tptp0)) = f7(c1). [resolve(2557,a,514,a),unit_del(a,115)]. 268.54/268.85 4420 min_precedes(f6(f2(f7(c1),tptp0)),f7(c1),tptp0). [back_rewrite(3743),rewrite([4412(5),4412(10),4412(10)])]. 268.54/268.85 4446 -occurrence_of(A,tptp0) | -subactivity_occurrence(f7(c1),A) | subactivity_occurrence(f6(f2(f7(c1),tptp0)),A). [back_rewrite(1545),rewrite([4412(7)])]. 268.54/268.85 4485 -min_precedes(A,f7(c1),tptp0) | -min_precedes(f6(f2(f7(c1),tptp0)),A,tptp0). [para(4412(a,1),171(a,2)),unit_del(c,514)]. 268.54/268.85 4488 -min_precedes(f6(c1),f6(f2(f7(c1),tptp0)),tptp0). [resolve(4420,a,171,a),unit_del(b,132)]. 268.54/268.85 4597 subactivity_occurrence(f6(f2(f7(c1),tptp0)),f13(tptp0,f6(c1),f7(c1))). [resolve(4446,b,358,a),unit_del(a,359)]. 268.54/268.85 4621 -occurrence_of(f13(tptp0,f6(c1),f7(c1)),A) | f6(f2(f7(c1),tptp0)) = f6(c1) | min_precedes(f6(f2(f7(c1),tptp0)),f6(c1),A) | min_precedes(f6(c1),f6(f2(f7(c1),tptp0)),A). [resolve(4597,a,813,a),flip(c),unit_del(a,660)]. 268.54/268.85 5099 occurrence_of(f7(c1),tptp1) | f11(f16(f5(c1),f7(c1))) = tptp1. [resolve(3954,b,3964,b),flip(c),merge(b)]. 268.54/268.85 5111 f11(f16(f5(c1),f7(c1))) = tptp1 | f11(f7(c1)) = tptp1. [resolve(5099,a,1244,b),unit_del(c,91)]. 268.54/268.85 5115 occurrence_of(f7(c1),tptp2) | f11(f7(c1)) = tptp2 | occurrence_of(f17(f5(c1),f7(c1)),f11(f17(f5(c1),f7(c1)))). [resolve(3968,b,216,a)]. 268.54/268.85 5124 occurrence_of(f7(c1),tptp2) | f11(f7(c1)) = tptp2 | arboreal(f17(f5(c1),f7(c1))). [resolve(3970,b,113,a),unit_del(d,127)]. 268.54/268.85 5125 occurrence_of(f7(c1),tptp2) | f11(f7(c1)) = tptp2 | -occurrence_of(f17(f5(c1),f7(c1)),A) | tptp2 = A. [resolve(3970,b,89,b)]. 268.54/268.85 5128 f11(f7(c1)) = tptp2 | arboreal(f17(f5(c1),f7(c1))). [resolve(5124,a,1014,b),flip(d),merge(c),unit_del(c,91)]. 268.54/268.85 5354 min_precedes(f5(c1),f16(f5(c1),f7(c1)),tptp0) | occurrence_of(f7(c1),tptp1). [resolve(2566,a,238,b),merge(c)]. 268.54/268.85 5378 occurrence_of(f7(c1),tptp1) | -min_precedes(f16(f5(c1),f7(c1)),f6(c1),tptp0). [resolve(5354,a,172,b),unit_del(c,132)]. 268.54/268.85 5409 occurrence_of(f7(c1),tptp1) | -subactivity_occurrence(f16(f5(c1),f7(c1)),A) | f16(f5(c1),f7(c1)) = B | -leaf_occ(B,A) | -root_occ(f5(c1),A) | -occurrence_of(A,tptp0) | min_precedes(f16(f5(c1),f7(c1)),B,tptp0). [resolve(5354,a,103,b),flip(c)]. 268.54/268.85 5473 occurrence_of(f7(c1),tptp2) | min_precedes(f5(c1),f17(f5(c1),f7(c1)),tptp0) | f11(f7(c1)) = tptp2. [resolve(2581,a,806,a)]. 268.54/268.85 6543 -arboreal(f17(f5(c1),f7(c1))) | -occurrence_of(c1,A) | f17(f5(c1),f7(c1)) = f6(c1) | min_precedes(f17(f5(c1),f7(c1)),f6(c1),A) | min_precedes(f6(c1),f17(f5(c1),f7(c1)),A) | occurrence_of(f7(c1),tptp2) | f11(f7(c1)) = tptp2. [resolve(1290,a,3968,b),flip(c)]. 268.54/268.85 6545 -arboreal(f16(f5(c1),f7(c1))) | -occurrence_of(c1,A) | f16(f5(c1),f7(c1)) = f6(c1) | min_precedes(f16(f5(c1),f7(c1)),f6(c1),A) | min_precedes(f6(c1),f16(f5(c1),f7(c1)),A) | occurrence_of(f7(c1),tptp1). [resolve(1290,a,3951,a),flip(c)]. 268.54/268.85 7535 occurrence_of(f7(c1),tptp2) | f11(f7(c1)) = tptp2 | -min_precedes(f17(f5(c1),f7(c1)),f6(c1),tptp0). [resolve(5473,b,172,b),unit_del(d,132)]. 268.54/268.85 7566 occurrence_of(f7(c1),tptp2) | f11(f7(c1)) = tptp2 | -subactivity_occurrence(f17(f5(c1),f7(c1)),A) | f17(f5(c1),f7(c1)) = B | -leaf_occ(B,A) | -root_occ(f5(c1),A) | -occurrence_of(A,tptp0) | min_precedes(f17(f5(c1),f7(c1)),B,tptp0). [resolve(5473,b,103,b),flip(d)]. 268.54/268.85 11557 occurrence_of(f7(c1),tptp2) | f11(f7(c1)) = tptp2 | f11(f17(f5(c1),f7(c1))) = tptp2. [resolve(5115,c,5125,c),flip(e),merge(c),merge(d)]. 268.54/268.85 11572 f11(f7(c1)) = tptp2 | f11(f17(f5(c1),f7(c1))) = tptp2. [resolve(11557,a,1014,b),flip(d),merge(c),unit_del(c,91)]. 268.54/268.85 20052 f6(f2(f7(c1),tptp0)) = f6(c1). [resolve(4621,a,359,a),unit_del(b,4248),unit_del(c,4488)]. 268.54/268.85 20053 -min_precedes(A,f7(c1),tptp0) | -min_precedes(f6(c1),A,tptp0). [back_rewrite(4485),rewrite([20052(9)])]. 268.54/268.85 22462 occurrence_of(f7(c1),tptp1) | f16(f5(c1),f7(c1)) = A | -leaf_occ(A,c1) | min_precedes(f16(f5(c1),f7(c1)),A,tptp0). [resolve(5409,b,3951,a),merge(g),unit_del(d,240),unit_del(e,132)]. 268.54/268.85 22463 occurrence_of(f7(c1),tptp1) | f16(f5(c1),f7(c1)) = f7(c1) | min_precedes(f16(f5(c1),f7(c1)),f7(c1),tptp0). [resolve(22462,c,239,a)]. 268.54/268.85 22464 occurrence_of(f7(c1),tptp1) | f16(f5(c1),f7(c1)) = f7(c1) | -min_precedes(f6(c1),f16(f5(c1),f7(c1)),tptp0). [resolve(22463,c,20053,a)]. 268.54/268.85 24449 -arboreal(f17(f5(c1),f7(c1))) | f17(f5(c1),f7(c1)) = f6(c1) | min_precedes(f17(f5(c1),f7(c1)),f6(c1),tptp0) | min_precedes(f6(c1),f17(f5(c1),f7(c1)),tptp0) | occurrence_of(f7(c1),tptp2) | f11(f7(c1)) = tptp2. [resolve(6543,b,132,a)]. 268.54/268.85 24450 -arboreal(f16(f5(c1),f7(c1))) | f16(f5(c1),f7(c1)) = f6(c1) | min_precedes(f16(f5(c1),f7(c1)),f6(c1),tptp0) | min_precedes(f6(c1),f16(f5(c1),f7(c1)),tptp0) | occurrence_of(f7(c1),tptp1). [resolve(6545,b,132,a)]. 268.54/268.85 26262 occurrence_of(f7(c1),tptp2) | f11(f7(c1)) = tptp2 | f17(f5(c1),f7(c1)) = A | -leaf_occ(A,c1) | min_precedes(f17(f5(c1),f7(c1)),A,tptp0). [resolve(7566,c,3968,b),merge(h),merge(i),unit_del(e,240),unit_del(f,132)]. 268.54/268.85 28205 occurrence_of(f7(c1),tptp2) | f11(f7(c1)) = tptp2 | f17(f5(c1),f7(c1)) = f7(c1) | min_precedes(f17(f5(c1),f7(c1)),f7(c1),tptp0). [resolve(26262,d,239,a)]. 268.54/268.85 28206 occurrence_of(f7(c1),tptp2) | f11(f7(c1)) = tptp2 | f17(f5(c1),f7(c1)) = f7(c1) | -min_precedes(f6(c1),f17(f5(c1),f7(c1)),tptp0). [resolve(28205,d,20053,a)]. 268.54/268.85 51126 f17(f5(c1),f7(c1)) = f6(c1) | min_precedes(f17(f5(c1),f7(c1)),f6(c1),tptp0) | min_precedes(f6(c1),f17(f5(c1),f7(c1)),tptp0) | occurrence_of(f7(c1),tptp2) | f11(f7(c1)) = tptp2. [resolve(24449,a,5128,b),merge(f)]. 268.54/268.85 51157 f16(f5(c1),f7(c1)) = f6(c1) | min_precedes(f16(f5(c1),f7(c1)),f6(c1),tptp0) | min_precedes(f6(c1),f16(f5(c1),f7(c1)),tptp0) | occurrence_of(f7(c1),tptp1) | f11(f7(c1)) = tptp1. [resolve(24450,a,3965,a)]. 268.54/268.85 68392 f17(f5(c1),f7(c1)) = f6(c1) | min_precedes(f6(c1),f17(f5(c1),f7(c1)),tptp0) | occurrence_of(f7(c1),tptp2) | f11(f7(c1)) = tptp2. [resolve(51126,b,7535,c),merge(e),merge(f)]. 268.54/268.85 68404 f17(f5(c1),f7(c1)) = f6(c1) | occurrence_of(f7(c1),tptp2) | f11(f7(c1)) = tptp2 | f17(f5(c1),f7(c1)) = f7(c1). [resolve(68392,b,28206,d),merge(d),merge(e)]. 268.54/268.85 68456 f17(f5(c1),f7(c1)) = f6(c1) | f11(f7(c1)) = tptp2 | f17(f5(c1),f7(c1)) = f7(c1). [resolve(68404,b,1014,b),flip(e),merge(d),unit_del(d,91)]. 268.54/268.85 68458 f17(f5(c1),f7(c1)) = f6(c1) | f11(f7(c1)) = tptp2. [para(68456(c,1),11572(b,1,1)),merge(c),merge(d)]. 268.54/268.85 68464 f11(f7(c1)) = tptp2. [para(68458(a,1),11572(b,1,1)),rewrite([682(13)]),merge(b),unit_del(b,92)]. 268.54/268.85 69968 f16(f5(c1),f7(c1)) = f6(c1) | min_precedes(f16(f5(c1),f7(c1)),f6(c1),tptp0) | min_precedes(f6(c1),f16(f5(c1),f7(c1)),tptp0) | occurrence_of(f7(c1),tptp1). [back_rewrite(51157),rewrite([68464(33)]),unit_del(e,91)]. 268.54/268.85 71416 f11(f16(f5(c1),f7(c1))) = tptp1. [back_rewrite(5111),rewrite([68464(11)]),unit_del(b,91)]. 268.54/268.85 71418 -occurrence_of(f7(c1),A) | tptp2 = A. [back_rewrite(1244),rewrite([68464(3)]),unit_del(a,91)]. 268.54/268.85 77216 f16(f5(c1),f7(c1)) = f6(c1) | min_precedes(f6(c1),f16(f5(c1),f7(c1)),tptp0) | occurrence_of(f7(c1),tptp1). [resolve(69968,b,5378,b),merge(d)]. 268.54/268.85 77222 f16(f5(c1),f7(c1)) = f6(c1) | occurrence_of(f7(c1),tptp1) | f16(f5(c1),f7(c1)) = f7(c1). [resolve(77216,b,22464,c),merge(c)]. 268.54/268.85 77247 f16(f5(c1),f7(c1)) = f6(c1) | f16(f5(c1),f7(c1)) = f7(c1). [resolve(77222,b,71418,a),unit_del(c,91)]. 268.54/268.85 77249 f16(f5(c1),f7(c1)) = f6(c1). [para(77247(b,1),71416(a,1,1)),rewrite([68464(11)]),unit_del(b,91)]. 268.54/268.85 77811 $F. [back_rewrite(71416),rewrite([77249(5),682(3)]),unit_del(a,114)]. 268.54/268.85 268.54/268.85 % SZS output end Refutation 268.54/268.85 ============================== end of proof ========================== 268.54/268.85 268.54/268.85 ============================== STATISTICS ============================ 268.54/268.85 268.54/268.85 Given=42108. Generated=1418087. Kept=77720. proofs=1. 268.54/268.85 Usable=11919. Sos=3258. Demods=222. Limbo=562, Disabled=62171. Hints=0. 268.54/268.85 Megabytes=121.78. 268.54/268.85 User_CPU=267.43, System_CPU=0.91, Wall_clock=268. 268.54/268.85 268.54/268.85 ============================== end of statistics ===================== 268.54/268.85 268.54/268.85 ============================== end of search ========================= 268.54/268.85 268.54/268.85 THEOREM PROVED 268.54/268.85 % SZS status Theorem 268.54/268.85 268.54/268.85 Exiting with 1 proof. 268.54/268.85 268.54/268.85 Process 18687 exit (max_proofs) Sat Jul 14 05:25:23 2018 268.54/268.85 Prover9 interrupted 268.54/268.86 EOF