0.04/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.04/0.12 % Command : tptp2X_and_run_prover9 %d %s 0.12/0.33 % Computer : n022.cluster.edu 0.12/0.33 % Model : x86_64 x86_64 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 % Memory : 8042.1875MB 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 1440 0.12/0.33 % WCLimit : 180 0.12/0.33 % DateTime : Mon Jul 3 03:35:59 EDT 2023 0.12/0.33 % CPUTime : 0.75/1.01 ============================== Prover9 =============================== 0.75/1.01 Prover9 (32) version 2009-11A, November 2009. 0.75/1.01 Process 2425 was started by sandbox2 on n022.cluster.edu, 0.75/1.01 Mon Jul 3 03:35:59 2023 0.75/1.01 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1440 -f /tmp/Prover9_2271_n022.cluster.edu". 0.75/1.01 ============================== end of head =========================== 0.75/1.01 0.75/1.01 ============================== INPUT ================================= 0.75/1.01 0.75/1.01 % Reading from file /tmp/Prover9_2271_n022.cluster.edu 0.75/1.01 0.75/1.01 set(prolog_style_variables). 0.75/1.01 set(auto2). 0.75/1.01 % set(auto2) -> set(auto). 0.75/1.01 % set(auto) -> set(auto_inference). 0.75/1.01 % set(auto) -> set(auto_setup). 0.75/1.01 % set(auto_setup) -> set(predicate_elim). 0.75/1.01 % set(auto_setup) -> assign(eq_defs, unfold). 0.75/1.01 % set(auto) -> set(auto_limits). 0.75/1.01 % set(auto_limits) -> assign(max_weight, "100.000"). 0.75/1.01 % set(auto_limits) -> assign(sos_limit, 20000). 0.75/1.01 % set(auto) -> set(auto_denials). 0.75/1.01 % set(auto) -> set(auto_process). 0.75/1.01 % set(auto2) -> assign(new_constants, 1). 0.75/1.01 % set(auto2) -> assign(fold_denial_max, 3). 0.75/1.01 % set(auto2) -> assign(max_weight, "200.000"). 0.75/1.01 % set(auto2) -> assign(max_hours, 1). 0.75/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.75/1.01 % set(auto2) -> assign(max_seconds, 0). 0.75/1.01 % set(auto2) -> assign(max_minutes, 5). 0.75/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.75/1.01 % set(auto2) -> set(sort_initial_sos). 0.75/1.01 % set(auto2) -> assign(sos_limit, -1). 0.75/1.01 % set(auto2) -> assign(lrs_ticks, 3000). 0.75/1.01 % set(auto2) -> assign(max_megs, 400). 0.75/1.01 % set(auto2) -> assign(stats, some). 0.75/1.01 % set(auto2) -> clear(echo_input). 0.75/1.01 % set(auto2) -> set(quiet). 0.75/1.01 % set(auto2) -> clear(print_initial_clauses). 0.75/1.01 % set(auto2) -> clear(print_given). 0.75/1.01 assign(lrs_ticks,-1). 0.75/1.01 assign(sos_limit,10000). 0.75/1.01 assign(order,kbo). 0.75/1.01 set(lex_order_vars). 0.75/1.01 clear(print_given). 0.75/1.01 0.75/1.01 % formulas(sos). % not echoed (49 formulas) 0.75/1.01 0.75/1.01 ============================== end of input ========================== 0.75/1.01 0.75/1.01 % From the command line: assign(max_seconds, 1440). 0.75/1.01 0.75/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.75/1.01 0.75/1.01 % Formulas that are not ordinary clauses: 0.75/1.01 1 (all X8 all X9 (earlier(X8,X9) -> -earlier(X9,X8))) # label(sos_04) # label(axiom) # label(non_clause). [assumption]. 0.75/1.01 2 (all X31 all X32 all X33 (min_precedes(X31,X32,X33) -> (exists X34 (root(X34,X33) & min_precedes(X34,X32,X33))))) # label(sos_13) # label(axiom) # label(non_clause). [assumption]. 0.75/1.01 3 (all X21 all X22 (precedes(X21,X22) <-> legal(X22) & earlier(X21,X22))) # label(sos_10) # label(axiom) # label(non_clause). [assumption]. 0.75/1.01 4 (all X52 all X53 all X54 all X55 (min_precedes(X53,X52,X55) & precedes(X53,X54) & min_precedes(X54,X52,X55) -> min_precedes(X53,X54,X55))) # label(sos_20) # label(axiom) # label(non_clause). [assumption]. 0.75/1.01 5 (all X56 all X57 (leaf(X56,X57) <-> ((exists X58 min_precedes(X58,X56,X57)) | root(X56,X57)) & -(exists X59 min_precedes(X56,X59,X57)))) # label(sos_21) # label(axiom) # label(non_clause). [assumption]. 0.75/1.01 6 (all X69 all X70 all X71 (min_precedes(X70,X71,X69) -> (exists X72 (subactivity_occurrence(X71,X72) & subactivity_occurrence(X70,X72) & occurrence_of(X72,X69))))) # label(sos_25) # label(axiom) # label(non_clause). [assumption]. 0.75/1.01 7 (all X13 all X14 all X15 (earlier(X13,X14) & earlier(X15,X14) -> earlier(X15,X13) | earlier(X13,X15) | X13 = X15)) # label(sos_06) # label(axiom) # label(non_clause). [assumption]. 0.75/1.01 8 (all X94 all X95 all X96 all X97 (occurrence_of(X96,X94) & -subactivity_occurrence(X96,X97) & subactivity(X94,X95) & occurrence_of(X97,X95) -> (exists X98 (subactivity_occurrence(X98,X97) & -subactivity_occurrence(X98,X96))))) # label(sos_32) # label(axiom) # label(non_clause). [assumption]. 0.75/1.01 9 (all X64 all X65 ((exists X66 (subactivity(X65,X66) & occurrence_of(X64,X66) & atomic(X66))) <-> atocc(X64,X65))) # label(sos_23) # label(axiom) # label(non_clause). [assumption]. 0.75/1.01 10 (all X28 all X29 (root(X29,X28) -> (exists X30 (atocc(X29,X30) & subactivity(X30,X28))))) # label(sos_12) # label(axiom) # label(non_clause). [assumption]. 0.75/1.01 11 (all X79 all X80 all X81 all X82 (occurrence_of(X80,X79) & arboreal(X81) & arboreal(X82) & subactivity_occurrence(X81,X80) & subactivity_occurrence(X82,X80) -> min_precedes(X82,X81,X79) | X81 = X82 | min_precedes(X81,X82,X79))) # label(sos_28) # label(axiom) # label(non_clause). [assumption]. 0.75/1.01 12 (all X91 all X92 all X93 (subactivity_occurrence(X92,X93) & subactivity_occurrence(X91,X92) -> subactivity_occurrence(X91,X93))) # label(sos_31) # label(axiom) # label(non_clause). [assumption]. 0.75/1.01 13 (all X67 all X68 (subactivity_occurrence(X67,X68) -> activity_occurrence(X68) & activity_occurrence(X67))) # label(sos_24) # label(axiom) # label(non_clause). [assumption]. 0.75/1.01 14 (all X49 all X50 all X51 (min_precedes(X49,X50,X51) -> -atomic(X51))) # label(sos_19) # label(axiom) # label(non_clause). [assumption]. 0.75/1.01 15 (all X10 all X11 all X12 (earlier(X10,X11) & earlier(X11,X12) -> earlier(X10,X12))) # label(sos_05) # label(axiom) # label(non_clause). [assumption]. 0.75/1.01 16 (all X2 (activity_occurrence(X2) -> (exists X3 (activity(X3) & occurrence_of(X2,X3))))) # label(sos_01) # label(axiom) # label(non_clause). [assumption]. 0.75/1.01 17 (all X105 (occurrence_of(X105,tptp0) -> (exists X106 exists X107 exists X108 (next_subocc(X107,X108,tptp0) & leaf_occ(X108,X105) & (occurrence_of(X108,tptp2) | occurrence_of(X108,tptp1)) & next_subocc(X106,X107,tptp0) & occurrence_of(X107,tptp4) & root_occ(X106,X105) & occurrence_of(X106,tptp3))))) # label(sos_35) # label(axiom) # label(non_clause). [assumption]. 0.75/1.01 18 (all X87 all X88 all X89 all X90 (occurrence_of(X89,X87) & occurrence_of(X90,X88) & subactivity_occurrence(X89,X90) & -atomic(X87) -> subactivity(X87,X88))) # label(sos_30) # label(axiom) # label(non_clause). [assumption]. 0.75/1.01 19 (all X73 all X74 (-atomic(X73) & root(X74,X73) -> (exists X75 (subactivity_occurrence(X74,X75) & occurrence_of(X75,X73))))) # label(sos_26) # label(axiom) # label(non_clause). [assumption]. 0.75/1.01 20 (all X99 all X100 ((exists X101 (root(X99,X101) & subactivity_occurrence(X99,X100) & occurrence_of(X100,X101))) <-> root_occ(X99,X100))) # label(sos_33) # label(axiom) # label(non_clause). [assumption]. 0.75/1.01 21 (all X83 all X84 all X85 all X86 (subactivity_occurrence(X84,X86) & occurrence_of(X86,X85) & min_precedes(X83,X84,X85) -> subactivity_occurrence(X83,X86))) # label(sos_29) # label(axiom) # label(non_clause). [assumption]. 0.75/1.01 22 (all X60 all X61 all X62 (next_subocc(X60,X61,X62) <-> min_precedes(X60,X61,X62) & -(exists X63 (min_precedes(X63,X61,X62) & min_precedes(X60,X63,X62))))) # label(sos_22) # label(axiom) # label(non_clause). [assumption]. 0.75/1.01 23 (all X35 all X36 all X37 (min_precedes(X35,X36,X37) -> -root(X36,X37))) # label(sos_14) # label(axiom) # label(non_clause). [assumption]. 0.75/1.01 24 (all X19 all X20 (legal(X19) & earlier(X20,X19) -> legal(X20))) # label(sos_09) # label(axiom) # label(non_clause). [assumption]. 0.75/1.01 25 (all X23 all X24 all X25 (min_precedes(X24,X25,X23) -> (exists X26 exists X27 (atocc(X25,X27) & atocc(X24,X26) & subactivity(X27,X23) & subactivity(X26,X23))))) # label(sos_11) # label(axiom) # label(non_clause). [assumption]. 0.75/1.01 26 (all X38 all X39 all X40 (min_precedes(X38,X39,X40) -> precedes(X38,X39))) # label(sos_15) # label(axiom) # label(non_clause). [assumption]. 0.75/1.01 27 (all X45 all X46 all X47 all X48 (min_precedes(X45,X47,X48) & precedes(X46,X47) & min_precedes(X45,X46,X48) -> min_precedes(X46,X47,X48))) # label(sos_18) # label(axiom) # label(non_clause). [assumption]. 0.75/1.01 28 (all X4 all X5 all X6 (occurrence_of(X4,X5) & occurrence_of(X4,X6) -> X5 = X6)) # label(sos_02) # label(axiom) # label(non_clause). [assumption]. 0.75/1.01 29 (all X7 (activity(X7) -> subactivity(X7,X7))) # label(sos_03) # label(axiom) # label(non_clause). [assumption]. 0.75/1.01 30 (all X41 all X42 (root(X41,X42) -> legal(X41))) # label(sos_16) # label(axiom) # label(non_clause). [assumption]. 0.75/1.01 31 (all X76 all X77 (-atomic(X76) & occurrence_of(X77,X76) -> (exists X78 (root(X78,X76) & subactivity_occurrence(X78,X77))))) # label(sos_27) # label(axiom) # label(non_clause). [assumption]. 0.75/1.01 32 (all X43 all X44 (atocc(X43,X44) & legal(X43) -> root(X43,X44))) # label(sos_17) # label(axiom) # label(non_clause). [assumption]. 0.75/1.02 33 (all X18 (legal(X18) -> arboreal(X18))) # label(sos_08) # label(axiom) # label(non_clause). [assumption]. 0.75/1.02 34 (all X16 all X17 (occurrence_of(X16,X17) -> (arboreal(X16) <-> atomic(X17)))) # label(sos_07) # label(axiom) # label(non_clause). [assumption]. 0.75/1.02 35 (all X102 all X103 ((exists X104 (subactivity_occurrence(X102,X103) & leaf(X102,X104) & occurrence_of(X103,X104))) <-> leaf_occ(X102,X103))) # label(sos_34) # label(axiom) # label(non_clause). [assumption]. 0.75/1.02 36 (all X0 all X1 (occurrence_of(X1,X0) -> activity_occurrence(X1) & activity(X0))) # label(sos) # label(axiom) # label(non_clause). [assumption]. 0.75/1.02 37 -(all X109 (occurrence_of(X109,tptp0) -> (exists X110 exists X111 ((occurrence_of(X111,tptp1) -> -(exists X112 (occurrence_of(X112,tptp2) & subactivity_occurrence(X112,X109) & min_precedes(X110,X112,tptp0)))) & (occurrence_of(X111,tptp2) -> -(exists X113 (occurrence_of(X113,tptp1) & min_precedes(X110,X113,tptp0) & subactivity_occurrence(X113,X109)))) & leaf_occ(X111,X109))))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption]. 0.75/1.02 0.75/1.02 ============================== end of process non-clausal formulas === 0.75/1.02 0.75/1.02 ============================== PROCESS INITIAL CLAUSES =============== 0.75/1.02 0.75/1.02 ============================== PREDICATE ELIMINATION ================= 0.75/1.02 38 leaf(A,B) | -root(A,B) | min_precedes(A,f3(A,B),B) # label(sos_21) # label(axiom). [clausify(5)]. 0.75/1.02 39 -min_precedes(A,B,C) | root(f1(A,B,C),C) # label(sos_13) # label(axiom). [clausify(2)]. 0.75/1.02 40 -leaf(A,B) | min_precedes(f2(A,B),A,B) | root(A,B) # label(sos_21) # label(axiom). [clausify(5)]. 0.75/1.02 Derived: leaf(f1(A,B,C),C) | min_precedes(f1(A,B,C),f3(f1(A,B,C),C),C) | -min_precedes(A,B,C). [resolve(38,b,39,b)]. 0.75/1.02 41 -root(A,B) | atocc(A,f7(B,A)) # label(sos_12) # label(axiom). [clausify(10)]. 0.75/1.02 Derived: atocc(f1(A,B,C),f7(C,f1(A,B,C))) | -min_precedes(A,B,C). [resolve(41,a,39,b)]. 0.75/1.02 Derived: atocc(A,f7(B,A)) | -leaf(A,B) | min_precedes(f2(A,B),A,B). [resolve(41,a,40,c)]. 0.75/1.02 42 -root(A,B) | subactivity(f7(B,A),B) # label(sos_12) # label(axiom). [clausify(10)]. 0.75/1.02 Derived: subactivity(f7(A,f1(B,C,A)),A) | -min_precedes(B,C,A). [resolve(42,a,39,b)]. 0.75/1.02 Derived: subactivity(f7(A,B),A) | -leaf(B,A) | min_precedes(f2(B,A),B,A). [resolve(42,a,40,c)]. 0.75/1.02 43 atomic(A) | -root(B,A) | subactivity_occurrence(B,f12(A,B)) # label(sos_26) # label(axiom). [clausify(19)]. 0.75/1.02 Derived: atomic(A) | subactivity_occurrence(f1(B,C,A),f12(A,f1(B,C,A))) | -min_precedes(B,C,A). [resolve(43,b,39,b)]. 0.75/1.02 Derived: atomic(A) | subactivity_occurrence(B,f12(A,B)) | -leaf(B,A) | min_precedes(f2(B,A),B,A). [resolve(43,b,40,c)]. 0.75/1.02 44 atomic(A) | -root(B,A) | occurrence_of(f12(A,B),A) # label(sos_26) # label(axiom). [clausify(19)]. 0.75/1.02 Derived: atomic(A) | occurrence_of(f12(A,f1(B,C,A)),A) | -min_precedes(B,C,A). [resolve(44,b,39,b)]. 0.75/1.02 Derived: atomic(A) | occurrence_of(f12(A,B),A) | -leaf(B,A) | min_precedes(f2(B,A),B,A). [resolve(44,b,40,c)]. 0.75/1.02 45 -root(A,B) | -subactivity_occurrence(A,C) | -occurrence_of(C,B) | root_occ(A,C) # label(sos_33) # label(axiom). [clausify(20)]. 0.75/1.02 Derived: -subactivity_occurrence(f1(A,B,C),D) | -occurrence_of(D,C) | root_occ(f1(A,B,C),D) | -min_precedes(A,B,C). [resolve(45,a,39,b)]. 0.75/1.02 Derived: -subactivity_occurrence(A,B) | -occurrence_of(B,C) | root_occ(A,B) | -leaf(A,C) | min_precedes(f2(A,C),A,C). [resolve(45,a,40,c)]. 0.75/1.02 46 root(A,f13(A,B)) | -root_occ(A,B) # label(sos_33) # label(axiom). [clausify(20)]. 0.75/1.02 Derived: -root_occ(A,B) | leaf(A,f13(A,B)) | min_precedes(A,f3(A,f13(A,B)),f13(A,B)). [resolve(46,a,38,b)]. 0.75/1.02 Derived: -root_occ(A,B) | atocc(A,f7(f13(A,B),A)). [resolve(46,a,41,a)]. 0.75/1.02 Derived: -root_occ(A,B) | subactivity(f7(f13(A,B),A),f13(A,B)). [resolve(46,a,42,a)]. 0.75/1.02 Derived: -root_occ(A,B) | atomic(f13(A,B)) | subactivity_occurrence(A,f12(f13(A,B),A)). [resolve(46,a,43,b)]. 0.75/1.02 Derived: -root_occ(A,B) | atomic(f13(A,B)) | occurrence_of(f12(f13(A,B),A),f13(A,B)). [resolve(46,a,44,b)]. 0.75/1.02 Derived: -root_occ(A,B) | -subactivity_occurrence(A,C) | -occurrence_of(C,f13(A,B)) | root_occ(A,C). [resolve(46,a,45,a)]. 0.75/1.02 47 -min_precedes(A,B,C) | -root(B,C) # label(sos_14) # label(axiom). [clausify(23)]. 0.75/1.02 Derived: -min_precedes(A,f1(B,C,D),D) | -min_precedes(B,C,D). [resolve(47,b,39,b)]. 0.75/1.02 Derived: -min_precedes(A,B,C) | -leaf(B,C) | min_precedes(f2(B,C),B,C). [resolve(47,b,40,c)]. 0.75/1.02 Derived: -min_precedes(A,B,f13(B,C)) | -root_occ(B,C). [resolve(47,b,46,a)]. 0.75/1.02 48 -root(A,B) | legal(A) # label(sos_16) # label(axiom). [clausify(30)]. 0.75/1.02 Derived: legal(f1(A,B,C)) | -min_precedes(A,B,C). [resolve(48,a,39,b)]. 0.75/1.02 Derived: legal(A) | -leaf(A,B) | min_precedes(f2(A,B),A,B). [resolve(48,a,40,c)]. 0.75/1.02 Derived: legal(A) | -root_occ(A,B). [resolve(48,a,46,a)]. 0.75/1.02 49 atomic(A) | -occurrence_of(B,A) | root(f17(A,B),A) # label(sos_27) # label(axiom). [clausify(31)]. 0.75/1.02 Derived: atomic(A) | -occurrence_of(B,A) | leaf(f17(A,B),A) | min_precedes(f17(A,B),f3(f17(A,B),A),A). [resolve(49,c,38,b)]. 0.75/1.02 Derived: atomic(A) | -occurrence_of(B,A) | atocc(f17(A,B),f7(A,f17(A,B))). [resolve(49,c,41,a)]. 0.75/1.02 Derived: atomic(A) | -occurrence_of(B,A) | subactivity(f7(A,f17(A,B)),A). [resolve(49,c,42,a)]. 0.75/1.02 Derived: atomic(A) | -occurrence_of(B,A) | atomic(A) | subactivity_occurrence(f17(A,B),f12(A,f17(A,B))). [resolve(49,c,43,b)]. 0.75/1.02 Derived: atomic(A) | -occurrence_of(B,A) | atomic(A) | occurrence_of(f12(A,f17(A,B)),A). [resolve(49,c,44,b)]. 0.75/1.02 Derived: atomic(A) | -occurrence_of(B,A) | -subactivity_occurrence(f17(A,B),C) | -occurrence_of(C,A) | root_occ(f17(A,B),C). [resolve(49,c,45,a)]. 0.75/1.02 Derived: atomic(A) | -occurrence_of(B,A) | -min_precedes(C,f17(A,B),A). [resolve(49,c,47,b)]. 0.75/1.02 Derived: atomic(A) | -occurrence_of(B,A) | legal(f17(A,B)). [resolve(49,c,48,a)]. 0.75/1.02 50 -atocc(A,B) | -legal(A) | root(A,B) # label(sos_17) # label(axiom). [clausify(32)]. 0.75/1.02 Derived: -atocc(A,B) | -legal(A) | leaf(A,B) | min_precedes(A,f3(A,B),B). [resolve(50,c,38,b)]. 0.75/1.02 Derived: -atocc(A,B) | -legal(A) | atocc(A,f7(B,A)). [resolve(50,c,41,a)]. 0.75/1.02 Derived: -atocc(A,B) | -legal(A) | subactivity(f7(B,A),B). [resolve(50,c,42,a)]. 0.75/1.02 Derived: -atocc(A,B) | -legal(A) | atomic(B) | subactivity_occurrence(A,f12(B,A)). [resolve(50,c,43,b)]. 0.75/1.02 Derived: -atocc(A,B) | -legal(A) | atomic(B) | occurrence_of(f12(B,A),B). [resolve(50,c,44,b)]. 0.75/1.02 Derived: -atocc(A,B) | -legal(A) | -subactivity_occurrence(A,C) | -occurrence_of(C,B) | root_occ(A,C). [resolve(50,c,45,a)]. 0.75/1.02 Derived: -atocc(A,B) | -legal(A) | -min_precedes(C,A,B). [resolve(50,c,47,b)]. 0.75/1.02 51 precedes(A,B) | -legal(B) | -earlier(A,B) # label(sos_10) # label(axiom). [clausify(3)]. 0.75/1.02 52 -precedes(A,B) | legal(B) # label(sos_10) # label(axiom). [clausify(3)]. 0.75/1.02 53 -precedes(A,B) | earlier(A,B) # label(sos_10) # label(axiom). [clausify(3)]. 0.75/1.02 54 -min_precedes(A,B,C) | -precedes(A,D) | -min_precedes(D,B,C) | min_precedes(A,D,C) # label(sos_20) # label(axiom). [clausify(4)]. 0.75/1.02 Derived: -min_precedes(A,B,C) | -min_precedes(D,B,C) | min_precedes(A,D,C) | -legal(D) | -earlier(A,D). [resolve(54,b,51,a)]. 0.75/1.02 55 -min_precedes(A,B,C) | precedes(A,B) # label(sos_15) # label(axiom). [clausify(26)]. 0.75/1.02 Derived: -min_precedes(A,B,C) | legal(B). [resolve(55,b,52,a)]. 0.75/1.02 Derived: -min_precedes(A,B,C) | earlier(A,B). [resolve(55,b,53,a)]. 0.75/1.02 Derived: -min_precedes(A,B,C) | -min_precedes(A,D,E) | -min_precedes(B,D,E) | min_precedes(A,B,E). [resolve(55,b,54,b)]. 0.75/1.02 56 -min_precedes(A,B,C) | -precedes(D,B) | -min_precedes(A,D,C) | min_precedes(D,B,C) # label(sos_18) # label(axiom). [clausify(27)]. 0.75/1.02 Derived: -min_precedes(A,B,C) | -min_precedes(A,D,C) | min_precedes(D,B,C) | -legal(B) | -earlier(D,B). [resolve(56,b,51,a)]. 0.75/1.02 Derived: -min_precedes(A,B,C) | -min_precedes(A,D,C) | min_precedes(D,B,C) | -min_precedes(D,B,E). [resolve(56,b,55,b)]. 0.75/1.02 57 leaf(A,B) | -min_precedes(C,A,B) | min_precedes(A,f3(A,B),B) # label(sos_21) # label(axiom). [clausify(5)]. 0.75/1.02 58 -leaf(A,B) | -min_precedes(A,C,B) # label(sos_21) # label(axiom). [clausify(5)]. 0.75/1.02 Derived: -min_precedes(A,B,C) | min_precedes(B,f3(B,C),C) | -min_precedes(B,D,C). [resolve(57,a,58,a)]. 0.75/1.02 59 -subactivity_occurrence(A,B) | -leaf(A,C) | -occurrence_of(B,C) | leaf_occ(A,B) # label(sos_34) # label(axiom). [clausify(35)]. 0.75/1.02 Derived: -subactivity_occurrence(A,B) | -occurrence_of(B,C) | leaf_occ(A,B) | -min_precedes(D,A,C) | min_precedes(A,f3(A,C),C). [resolve(59,b,57,a)]. 0.75/1.02 60 leaf(A,f18(A,B)) | -leaf_occ(A,B) # label(sos_34) # label(axiom). [clausify(35)]. 0.75/1.02 Derived: -leaf_occ(A,B) | -min_precedes(A,C,f18(A,B)). [resolve(60,a,58,a)]. 0.75/1.02 Derived: -leaf_occ(A,B) | -subactivity_occurrence(A,C) | -occurrence_of(C,f18(A,B)) | leaf_occ(A,C). [resolve(60,a,59,b)]. 0.75/1.02 61 leaf(f1(A,B,C),C) | min_precedes(f1(A,B,C),f3(f1(A,B,C),C),C) | -min_precedes(A,B,C). [resolve(38,b,39,b)]. 0.75/1.02 Derived: min_precedes(f1(A,B,C),f3(f1(A,B,C),C),C) | -min_precedes(A,B,C) | -min_precedes(f1(A,B,C),D,C). [resolve(61,a,58,a)]. 0.75/1.02 Derived: min_precedes(f1(A,B,C),f3(f1(A,B,C),C),C) | -min_precedes(A,B,C) | -subactivity_occurrence(f1(A,B,C),D) | -occurrence_of(D,C) | leaf_occ(f1(A,B,C),D). [resolve(61,a,59,b)]. 0.75/1.02 62 atocc(A,f7(B,A)) | -leaf(A,B) | min_precedes(f2(A,B),A,B). [resolve(41,a,40,c)]. 0.75/1.02 Derived: atocc(A,f7(B,A)) | min_precedes(f2(A,B),A,B) | -min_precedes(C,A,B) | min_precedes(A,f3(A,B),B). [resolve(62,b,57,a)]. 0.75/1.02 Derived: atocc(A,f7(f18(A,B),A)) | min_precedes(f2(A,f18(A,B)),A,f18(A,B)) | -leaf_occ(A,B). [resolve(62,b,60,a)]. 0.75/1.02 Derived: atocc(f1(A,B,C),f7(C,f1(A,B,C))) | min_precedes(f2(f1(A,B,C),C),f1(A,B,C),C) | min_precedes(f1(A,B,C),f3(f1(A,B,C),C),C) | -min_precedes(A,B,C). [resolve(62,b,61,a)]. 0.75/1.02 63 subactivity(f7(A,B),A) | -leaf(B,A) | min_precedes(f2(B,A),B,A). [resolve(42,a,40,c)]. 0.75/1.02 Derived: subactivity(f7(A,B),A) | min_precedes(f2(B,A),B,A) | -min_precedes(C,B,A) | min_precedes(B,f3(B,A),A). [resolve(63,b,57,a)]. 0.75/1.02 Derived: subactivity(f7(f18(A,B),A),f18(A,B)) | min_precedes(f2(A,f18(A,B)),A,f18(A,B)) | -leaf_occ(A,B). [resolve(63,b,60,a)]. 0.75/1.02 Derived: subactivity(f7(A,f1(B,C,A)),A) | min_precedes(f2(f1(B,C,A),A),f1(B,C,A),A) | min_precedes(f1(B,C,A),f3(f1(B,C,A),A),A) | -min_precedes(B,C,A). [resolve(63,b,61,a)]. 0.75/1.02 64 atomic(A) | subactivity_occurrence(B,f12(A,B)) | -leaf(B,A) | min_precedes(f2(B,A),B,A). [resolve(43,b,40,c)]. 0.75/1.02 Derived: atomic(A) | subactivity_occurrence(B,f12(A,B)) | min_precedes(f2(B,A),B,A) | -min_precedes(C,B,A) | min_precedes(B,f3(B,A),A). [resolve(64,c,57,a)]. 0.75/1.02 Derived: atomic(f18(A,B)) | subactivity_occurrence(A,f12(f18(A,B),A)) | min_precedes(f2(A,f18(A,B)),A,f18(A,B)) | -leaf_occ(A,B). [resolve(64,c,60,a)]. 0.75/1.02 Derived: atomic(A) | subactivity_occurrence(f1(B,C,A),f12(A,f1(B,C,A))) | min_precedes(f2(f1(B,C,A),A),f1(B,C,A),A) | min_precedes(f1(B,C,A),f3(f1(B,C,A),A),A) | -min_precedes(B,C,A). [resolve(64,c,61,a)]. 0.75/1.02 65 atomic(A) | occurrence_of(f12(A,B),A) | -leaf(B,A) | min_precedes(f2(B,A),B,A). [resolve(44,b,40,c)]. 0.75/1.02 Derived: atomic(A) | occurrence_of(f12(A,B),A) | min_precedes(f2(B,A),B,A) | -min_precedes(C,B,A) | min_precedes(B,f3(B,A),A). [resolve(65,c,57,a)]. 0.75/1.02 Derived: atomic(f18(A,B)) | occurrence_of(f12(f18(A,B),A),f18(A,B)) | min_precedes(f2(A,f18(A,B)),A,f18(A,B)) | -leaf_occ(A,B). [resolve(65,c,60,a)]. 0.75/1.02 Derived: atomic(A) | occurrence_of(f12(A,f1(B,C,A)),A) | min_precedes(f2(f1(B,C,A),A),f1(B,C,A),A) | min_precedes(f1(B,C,A),f3(f1(B,C,A),A),A) | -min_precedes(B,C,A). [resolve(65,c,61,a)]. 0.75/1.02 66 -subactivity_occurrence(A,B) | -occurrence_of(B,C) | root_occ(A,B) | -leaf(A,C) | min_precedes(f2(A,C),A,C). [resolve(45,a,40,c)]. 0.75/1.02 Derived: -subactivity_occurrence(A,B) | -occurrence_of(B,C) | root_occ(A,B) | min_precedes(f2(A,C),A,C) | -min_precedes(D,A,C) | min_precedes(A,f3(A,C),C). [resolve(66,d,57,a)]. 0.75/1.02 Derived: -subactivity_occurrence(A,B) | -occurrence_of(B,f18(A,C)) | root_occ(A,B) | min_precedes(f2(A,f18(A,C)),A,f18(A,C)) | -leaf_occ(A,C). [resolve(66,d,60,a)]. 0.75/1.02 Derived: -subactivity_occurrence(f1(A,B,C),D) | -occurrence_of(D,C) | root_occ(f1(A,B,C),D) | min_precedes(f2(f1(A,B,C),C),f1(A,B,C),C) | min_precedes(f1(A,B,C),f3(f1(A,B,C),C),C) | -min_precedes(A,B,C). [resolve(66,d,61,a)]. 0.75/1.02 67 -root_occ(A,B) | leaf(A,f13(A,B)) | min_precedes(A,f3(A,f13(A,B)),f13(A,B)). [resolve(46,a,38,b)]. 0.75/1.02 Derived: -root_occ(A,B) | min_precedes(A,f3(A,f13(A,B)),f13(A,B)) | -min_precedes(A,C,f13(A,B)). [resolve(67,b,58,a)]. 0.75/1.02 Derived: -root_occ(A,B) | min_precedes(A,f3(A,f13(A,B)),f13(A,B)) | -subactivity_occurrence(A,C) | -occurrence_of(C,f13(A,B)) | leaf_occ(A,C). [resolve(67,b,59,b)]. 0.75/1.02 68 -min_precedes(A,B,C) | -leaf(B,C) | min_precedes(f2(B,C),B,C). [resolve(47,b,40,c)]. 0.75/1.02 Derived: -min_precedes(A,B,C) | min_precedes(f2(B,C),B,C) | -min_precedes(D,B,C) | min_precedes(B,f3(B,C),C). [resolve(68,b,57,a)]. 0.75/1.02 Derived: -min_precedes(A,B,f18(B,C)) | min_precedes(f2(B,f18(B,C)),B,f18(B,C)) | -leaf_occ(B,C). [resolve(68,b,60,a)]. 0.75/1.02 69 legal(A) | -leaf(A,B) | min_precedes(f2(A,B),A,B). [resolve(48,a,40,c)]. 0.75/1.02 Derived: legal(A) | min_precedes(f2(A,f18(A,B)),A,f18(A,B)) | -leaf_occ(A,B). [resolve(69,b,60,a)]. 0.75/1.02 Derived: legal(f1(A,B,C)) | min_precedes(f2(f1(A,B,C),C),f1(A,B,C),C) | min_precedes(f1(A,B,C),f3(f1(A,B,C),C),C) | -min_precedes(A,B,C). [resolve(69,b,61,a)]. 0.75/1.02 70 atomic(A) | -occurrence_of(B,A) | leaf(f17(A,B),A) | min_precedes(f17(A,B),f3(f17(A,B),A),A). [resolve(49,c,38,b)]. 0.75/1.02 Derived: atomic(A) | -occurrence_of(B,A) | min_precedes(f17(A,B),f3(f17(A,B),A),A) | -min_precedes(f17(A,B),C,A). [resolve(70,c,58,a)]. 0.75/1.02 Derived: atomic(A) | -occurrence_of(B,A) | min_precedes(f17(A,B),f3(f17(A,B),A),A) | -subactivity_occurrence(f17(A,B),C) | -occurrence_of(C,A) | leaf_occ(f17(A,B),C). [resolve(70,c,59,b)]. 0.75/1.02 71 -atocc(A,B) | -legal(A) | leaf(A,B) | min_precedes(A,f3(A,B),B). [resolve(50,c,38,b)]. 0.75/1.02 Derived: -atocc(A,B) | -legal(A) | min_precedes(A,f3(A,B),B) | -min_precedes(A,C,B). [resolve(71,c,58,a)]. 0.75/1.02 Derived: -atocc(A,B) | -legal(A) | min_precedes(A,f3(A,B),B) | -subactivity_occurrence(A,C) | -occurrence_of(C,B) | leaf_occ(A,C). [resolve(71,c,59,b)]. 0.75/1.02 72 subactivity(A,f6(B,A)) | -atocc(B,A) # label(sos_23) # label(axiom). [clausify(9)]. 0.75/1.02 73 -occurrence_of(A,B) | subactivity_occurrence(A,C) | -subactivity(B,D) | -occurrence_of(C,D) | subactivity_occurrence(f5(B,D,A,C),C) # label(sos_32) # label(axiom). [clausify(8)]. 0.75/1.02 74 -occurrence_of(A,B) | subactivity_occurrence(A,C) | -subactivity(B,D) | -occurrence_of(C,D) | -subactivity_occurrence(f5(B,D,A,C),A) # label(sos_32) # label(axiom). [clausify(8)]. 0.75/1.02 75 -subactivity(A,B) | -occurrence_of(C,B) | -atomic(B) | atocc(C,A) # label(sos_23) # label(axiom). [clausify(9)]. 0.75/1.02 Derived: -atocc(A,B) | -occurrence_of(C,B) | subactivity_occurrence(C,D) | -occurrence_of(D,f6(A,B)) | subactivity_occurrence(f5(B,f6(A,B),C,D),D). [resolve(72,a,73,c)]. 0.75/1.02 Derived: -atocc(A,B) | -occurrence_of(C,B) | subactivity_occurrence(C,D) | -occurrence_of(D,f6(A,B)) | -subactivity_occurrence(f5(B,f6(A,B),C,D),C). [resolve(72,a,74,c)]. 0.75/1.02 Derived: -atocc(A,B) | -occurrence_of(C,f6(A,B)) | -atomic(f6(A,B)) | atocc(C,B). [resolve(72,a,75,a)]. 0.75/1.02 76 -occurrence_of(A,B) | -occurrence_of(C,D) | -subactivity_occurrence(A,C) | atomic(B) | subactivity(B,D) # label(sos_30) # label(axiom). [clausify(18)]. 0.75/1.02 Derived: -occurrence_of(A,B) | -occurrence_of(C,D) | -subactivity_occurrence(A,C) | atomic(B) | -occurrence_of(E,B) | subactivity_occurrence(E,F) | -occurrence_of(F,D) | subactivity_occurrence(f5(B,D,E,F),F). [resolve(76,e,73,c)]. 0.75/1.02 Derived: -occurrence_of(A,B) | -occurrence_of(C,D) | -subactivity_occurrence(A,C) | atomic(B) | -occurrence_of(E,B) | subactivity_occurrence(E,F) | -occurrence_of(F,D) | -subactivity_occurrence(f5(B,D,E,F),E). [resolve(76,e,74,c)]. 0.75/1.03 Derived: -occurrence_of(A,B) | -occurrence_of(C,D) | -subactivity_occurrence(A,C) | atomic(B) | -occurrence_of(E,D) | -atomic(D) | atocc(E,B). [resolve(76,e,75,a)]. 0.75/1.03 77 -min_precedes(A,B,C) | subactivity(f16(C,A,B),C) # label(sos_11) # label(axiom). [clausify(25)]. 0.75/1.03 Derived: -min_precedes(A,B,C) | -occurrence_of(D,f16(C,A,B)) | subactivity_occurrence(D,E) | -occurrence_of(E,C) | subactivity_occurrence(f5(f16(C,A,B),C,D,E),E). [resolve(77,b,73,c)]. 0.75/1.03 Derived: -min_precedes(A,B,C) | -occurrence_of(D,f16(C,A,B)) | subactivity_occurrence(D,E) | -occurrence_of(E,C) | -subactivity_occurrence(f5(f16(C,A,B),C,D,E),D). [resolve(77,b,74,c)]. 0.75/1.03 Derived: -min_precedes(A,B,C) | -occurrence_of(D,C) | -atomic(C) | atocc(D,f16(C,A,B)). [resolve(77,b,75,a)]. 0.75/1.03 78 -min_precedes(A,B,C) | subactivity(f15(C,A,B),C) # label(sos_11) # label(axiom). [clausify(25)]. 0.75/1.03 Derived: -min_precedes(A,B,C) | -occurrence_of(D,f15(C,A,B)) | subactivity_occurrence(D,E) | -occurrence_of(E,C) | subactivity_occurrence(f5(f15(C,A,B),C,D,E),E). [resolve(78,b,73,c)]. 0.75/1.03 Derived: -min_precedes(A,B,C) | -occurrence_of(D,f15(C,A,B)) | subactivity_occurrence(D,E) | -occurrence_of(E,C) | -subactivity_occurrence(f5(f15(C,A,B),C,D,E),D). [resolve(78,b,74,c)]. 0.75/1.03 Derived: -min_precedes(A,B,C) | -occurrence_of(D,C) | -atomic(C) | atocc(D,f15(C,A,B)). [resolve(78,b,75,a)]. 0.75/1.03 79 -activity(A) | subactivity(A,A) # label(sos_03) # label(axiom). [clausify(29)]. 0.75/1.03 Derived: -activity(A) | -occurrence_of(B,A) | subactivity_occurrence(B,C) | -occurrence_of(C,A) | subactivity_occurrence(f5(A,A,B,C),C). [resolve(79,b,73,c)]. 0.75/1.03 Derived: -activity(A) | -occurrence_of(B,A) | subactivity_occurrence(B,C) | -occurrence_of(C,A) | -subactivity_occurrence(f5(A,A,B,C),B). [resolve(79,b,74,c)]. 0.75/1.03 Derived: -activity(A) | -occurrence_of(B,A) | -atomic(A) | atocc(B,A). [resolve(79,b,75,a)]. 0.75/1.03 80 subactivity(f7(A,f1(B,C,A)),A) | -min_precedes(B,C,A). [resolve(42,a,39,b)]. 0.75/1.03 Derived: -min_precedes(A,B,C) | -occurrence_of(D,f7(C,f1(A,B,C))) | subactivity_occurrence(D,E) | -occurrence_of(E,C) | subactivity_occurrence(f5(f7(C,f1(A,B,C)),C,D,E),E). [resolve(80,a,73,c)]. 0.75/1.03 Derived: -min_precedes(A,B,C) | -occurrence_of(D,f7(C,f1(A,B,C))) | subactivity_occurrence(D,E) | -occurrence_of(E,C) | -subactivity_occurrence(f5(f7(C,f1(A,B,C)),C,D,E),D). [resolve(80,a,74,c)]. 0.75/1.03 Derived: -min_precedes(A,B,C) | -occurrence_of(D,C) | -atomic(C) | atocc(D,f7(C,f1(A,B,C))). [resolve(80,a,75,a)]. 0.75/1.03 81 -root_occ(A,B) | subactivity(f7(f13(A,B),A),f13(A,B)). [resolve(46,a,42,a)]. 0.75/1.03 Derived: -root_occ(A,B) | -occurrence_of(C,f7(f13(A,B),A)) | subactivity_occurrence(C,D) | -occurrence_of(D,f13(A,B)) | subactivity_occurrence(f5(f7(f13(A,B),A),f13(A,B),C,D),D). [resolve(81,b,73,c)]. 0.75/1.03 Derived: -root_occ(A,B) | -occurrence_of(C,f7(f13(A,B),A)) | subactivity_occurrence(C,D) | -occurrence_of(D,f13(A,B)) | -subactivity_occurrence(f5(f7(f13(A,B),A),f13(A,B),C,D),C). [resolve(81,b,74,c)]. 0.75/1.03 Derived: -root_occ(A,B) | -occurrence_of(C,f13(A,B)) | -atomic(f13(A,B)) | atocc(C,f7(f13(A,B),A)). [resolve(81,b,75,a)]. 0.75/1.03 82 atomic(A) | -occurrence_of(B,A) | subactivity(f7(A,f17(A,B)),A). [resolve(49,c,42,a)]. 0.75/1.03 Derived: atomic(A) | -occurrence_of(B,A) | -occurrence_of(C,f7(A,f17(A,B))) | subactivity_occurrence(C,D) | -occurrence_of(D,A) | subactivity_occurrence(f5(f7(A,f17(A,B)),A,C,D),D). [resolve(82,c,73,c)]. 0.75/1.03 Derived: atomic(A) | -occurrence_of(B,A) | -occurrence_of(C,f7(A,f17(A,B))) | subactivity_occurrence(C,D) | -occurrence_of(D,A) | -subactivity_occurrence(f5(f7(A,f17(A,B)),A,C,D),C). [resolve(82,c,74,c)]. 0.75/1.03 83 -atocc(A,B) | -legal(A) | subactivity(f7(B,A),B). [resolve(50,c,42,a)]. 0.75/1.03 Derived: -atocc(A,B) | -legal(A) | -occurrence_of(C,f7(B,A)) | subactivity_occurrence(C,D) | -occurrence_of(D,B) | subactivity_occurrence(f5(f7(B,A),B,C,D),D). [resolve(83,c,73,c)]. 0.75/1.03 Derived: -atocc(A,B) | -legal(A) | -occurrence_of(C,f7(B,A)) | subactivity_occurrence(C,D) | -occurrence_of(D,B) | -subactivity_occurrence(f5(f7(B,A),B,C,D),C). [resolve(83,c,74,c)]. 0.75/1.03 Derived: -atocc(A,B) | -legal(A) | -occurrence_of(C,B) | -atomic(B) | atocc(C,f7(B,A)). [resolve(83,c,75,a)]. 0.75/1.03 84 subactivity(f7(A,B),A) | min_precedes(f2(B,A),B,A) | -min_precedes(C,B,A) | min_precedes(B,f3(B,A),A). [resolve(63,b,57,a)]. 0.75/1.03 85 subactivity(f7(f18(A,B),A),f18(A,B)) | min_precedes(f2(A,f18(A,B)),A,f18(A,B)) | -leaf_occ(A,B). [resolve(63,b,60,a)]. 0.75/1.03 Derived: min_precedes(f2(A,f18(A,B)),A,f18(A,B)) | -leaf_occ(A,B) | -occurrence_of(C,f7(f18(A,B),A)) | subactivity_occurrence(C,D) | -occurrence_of(D,f18(A,B)) | subactivity_occurrence(f5(f7(f18(A,B),A),f18(A,B),C,D),D). [resolve(85,a,73,c)]. 0.75/1.03 Derived: min_precedes(f2(A,f18(A,B)),A,f18(A,B)) | -leaf_occ(A,B) | -occurrence_of(C,f7(f18(A,B),A)) | subactivity_occurrence(C,D) | -occurrence_of(D,f18(A,B)) | -subactivity_occurrence(f5(f7(f18(A,B),A),f18(A,B),C,D),C). [resolve(85,a,74,c)]. 0.75/1.03 Derived: min_precedes(f2(A,f18(A,B)),A,f18(A,B)) | -leaf_occ(A,B) | -occurrence_of(C,f18(A,B)) | -atomic(f18(A,B)) | atocc(C,f7(f18(A,B),A)). [resolve(85,a,75,a)]. 0.75/1.03 86 subactivity(f7(A,f1(B,C,A)),A) | min_precedes(f2(f1(B,C,A),A),f1(B,C,A),A) | min_precedes(f1(B,C,A),f3(f1(B,C,A),A),A) | -min_precedes(B,C,A). [resolve(63,b,61,a)]. 0.75/1.04 87 -activity_occurrence(A) | activity(f8(A)) # label(sos_01) # label(axiom). [clausify(16)]. 0.75/1.04 88 -subactivity_occurrence(A,B) | activity_occurrence(B) # label(sos_24) # label(axiom). [clausify(13)]. 0.75/1.04 89 -subactivity_occurrence(A,B) | activity_occurrence(A) # label(sos_24) # label(axiom). [clausify(13)]. 0.75/1.04 Derived: activity(f8(A)) | -subactivity_occurrence(B,A). [resolve(87,a,88,b)]. 0.75/1.04 Derived: activity(f8(A)) | -subactivity_occurrence(A,B). [resolve(87,a,89,b)]. 0.75/1.04 90 -activity_occurrence(A) | occurrence_of(A,f8(A)) # label(sos_01) # label(axiom). [clausify(16)]. 0.75/1.04 Derived: occurrence_of(A,f8(A)) | -subactivity_occurrence(B,A). [resolve(90,a,88,b)]. 0.75/1.04 Derived: occurrence_of(A,f8(A)) | -subactivity_occurrence(A,B). [resolve(90,a,89,b)]. 0.75/1.04 91 -occurrence_of(A,B) | activity_occurrence(A) # label(sos) # label(axiom). [clausify(36)]. 0.75/1.04 Derived: -occurrence_of(A,B) | activity(f8(A)). [resolve(91,b,87,a)]. 0.75/1.04 Derived: -occurrence_of(A,B) | occurrence_of(A,f8(A)). [resolve(91,b,90,a)]. 0.75/1.04 92 -next_subocc(A,B,C) | min_precedes(A,B,C) # label(sos_22) # label(axiom). [clausify(22)]. 0.75/1.04 93 -occurrence_of(A,tptp0) | next_subocc(f10(A),f11(A),tptp0) # label(sos_35) # label(axiom). [clausify(17)]. 0.75/1.04 94 -occurrence_of(A,tptp0) | next_subocc(f9(A),f10(A),tptp0) # label(sos_35) # label(axiom). [clausify(17)]. 0.75/1.04 Derived: min_precedes(f10(A),f11(A),tptp0) | -occurrence_of(A,tptp0). [resolve(92,a,93,b)]. 0.75/1.04 Derived: min_precedes(f9(A),f10(A),tptp0) | -occurrence_of(A,tptp0). [resolve(92,a,94,b)]. 0.75/1.04 95 -next_subocc(A,B,C) | -min_precedes(D,B,C) | -min_precedes(A,D,C) # label(sos_22) # label(axiom). [clausify(22)]. 0.75/1.04 Derived: -min_precedes(A,f11(B),tptp0) | -min_precedes(f10(B),A,tptp0) | -occurrence_of(B,tptp0). [resolve(95,a,93,b)]. 0.75/1.04 Derived: -min_precedes(A,f10(B),tptp0) | -min_precedes(f9(B),A,tptp0) | -occurrence_of(B,tptp0). [resolve(95,a,94,b)]. 0.75/1.04 96 next_subocc(A,B,C) | -min_precedes(A,B,C) | min_precedes(f14(A,B,C),B,C) # label(sos_22) # label(axiom). [clausify(22)]. 0.75/1.04 Derived: -min_precedes(A,B,C) | min_precedes(f14(A,B,C),B,C) | -min_precedes(D,B,C) | -min_precedes(A,D,C). [resolve(96,a,95,a)]. 0.75/1.04 97 next_subocc(A,B,C) | -min_precedes(A,B,C) | min_precedes(A,f14(A,B,C),C) # label(sos_22) # label(axiom). [clausify(22)]. 0.75/1.04 Derived: -min_precedes(A,B,C) | min_precedes(A,f14(A,B,C),C) | -min_precedes(D,B,C) | -min_precedes(A,D,C). [resolve(97,a,95,a)]. 0.75/1.04 98 -activity(A) | -occurrence_of(B,A) | subactivity_occurrence(B,C) | -occurrence_of(C,A) | subactivity_occurrence(f5(A,A,B,C),C). [resolve(79,b,73,c)]. 0.75/1.04 99 activity(tptp0) # label(sos_36) # label(axiom). [assumption]. 0.75/1.04 100 -occurrence_of(A,B) | activity(B) # label(sos) # label(axiom). [clausify(36)]. 0.75/1.04 Derived: -occurrence_of(A,tptp0) | subactivity_occurrence(A,B) | -occurrence_of(B,tptp0) | subactivity_occurrence(f5(tptp0,tptp0,A,B),B). [resolve(98,a,99,a)]. 0.75/1.04 Derived: -occurrence_of(A,B) | subactivity_occurrence(A,C) | -occurrence_of(C,B) | subactivity_occurrence(f5(B,B,A,C),C) | -occurrence_of(D,B). [resolve(98,a,100,b)]. 0.75/1.04 101 -activity(A) | -occurrence_of(B,A) | subactivity_occurrence(B,C) | -occurrence_of(C,A) | -subactivity_occurrence(f5(A,A,B,C),B). [resolve(79,b,74,c)]. 0.75/1.04 Derived: -occurrence_of(A,tptp0) | subactivity_occurrence(A,B) | -occurrence_of(B,tptp0) | -subactivity_occurrence(f5(tptp0,tptp0,A,B),A). [resolve(101,a,99,a)]. 0.75/1.04 Derived: -occurrence_of(A,B) | subactivity_occurrence(A,C) | -occurrence_of(C,B) | -subactivity_occurrence(f5(B,B,A,C),A) | -occurrence_of(D,B). [resolve(101,a,100,b)]. 0.75/1.04 102 -activity(A) | -occurrence_of(B,A) | -atomic(A) | atocc(B,A). [resolve(79,b,75,a)]. 0.75/1.04 Derived: -occurrence_of(A,tptp0) | -atomic(tptp0) | atocc(A,tptp0). [resolve(102,a,99,a)]. 0.75/1.04 Derived: -occurrence_of(A,B) | -atomic(B) | atocc(A,B) | -occurrence_of(C,B). [resolve(102,a,100,b)]. 0.75/1.04 103 activity(f8(A)) | -subactivity_occurrence(B,A). [resolve(87,a,88,b)]. 0.75/1.04 104 activity(f8(A)) | -subactivity_occurrence(A,B). [resolve(87,a,89,b)]. 0.75/1.04 105 -occurrence_of(A,B) | activity(f8(A)). [resolve(91,b,87,a)]. 0.75/1.04 0.75/1.04 ============================== end predicate elimination ============= 0.91/1.16 0.91/1.16 Auto_denials: (non-Horn, no changes). 0.91/1.16 0.91/1.16 Term ordering decisions: 0.91/1.16 Function symbol KB weights: tptp0=1. tptp1=1. tptp2=1. tptp3=1. tptp4=1. c1=1. f2=1. f3=1. f6=1. f7=1. f12=1. f13=1. f17=1. f18=1. f19=1. f20=1. f8=1. f9=1. f10=1. f11=1. f1=1. f4=1. f14=1. f15=1. f16=1. f5=1. 0.91/1.16 0.91/1.16 ============================== end of process initial clauses ======== 0.91/1.16 0.91/1.16 ============================== CLAUSES FOR SEARCH ==================== 0.91/1.16 0.91/1.16 ============================== end of clauses for search ============= 0.91/1.16 0.91/1.16 ============================== SEARCH ================================ 0.91/1.16 0.91/1.16 % Starting search at 0.06 seconds. 0.91/1.16 0.91/1.16 ============================== PROOF ================================= 0.91/1.16 % SZS status Theorem 0.91/1.16 % SZS output start Refutation 0.91/1.16 0.91/1.16 % Proof 1 at 0.16 (+ 0.01) seconds. 0.91/1.16 % Length of proof is 20. 0.91/1.16 % Level of proof is 6. 0.91/1.16 % Maximum clause weight is 15.000. 0.91/1.16 % Given clauses 323. 0.91/1.16 0.91/1.16 5 (all X56 all X57 (leaf(X56,X57) <-> ((exists X58 min_precedes(X58,X56,X57)) | root(X56,X57)) & -(exists X59 min_precedes(X56,X59,X57)))) # label(sos_21) # label(axiom) # label(non_clause). [assumption]. 0.91/1.16 17 (all X105 (occurrence_of(X105,tptp0) -> (exists X106 exists X107 exists X108 (next_subocc(X107,X108,tptp0) & leaf_occ(X108,X105) & (occurrence_of(X108,tptp2) | occurrence_of(X108,tptp1)) & next_subocc(X106,X107,tptp0) & occurrence_of(X107,tptp4) & root_occ(X106,X105) & occurrence_of(X106,tptp3))))) # label(sos_35) # label(axiom) # label(non_clause). [assumption]. 0.91/1.16 28 (all X4 all X5 all X6 (occurrence_of(X4,X5) & occurrence_of(X4,X6) -> X5 = X6)) # label(sos_02) # label(axiom) # label(non_clause). [assumption]. 0.91/1.16 35 (all X102 all X103 ((exists X104 (subactivity_occurrence(X102,X103) & leaf(X102,X104) & occurrence_of(X103,X104))) <-> leaf_occ(X102,X103))) # label(sos_34) # label(axiom) # label(non_clause). [assumption]. 0.91/1.16 37 -(all X109 (occurrence_of(X109,tptp0) -> (exists X110 exists X111 ((occurrence_of(X111,tptp1) -> -(exists X112 (occurrence_of(X112,tptp2) & subactivity_occurrence(X112,X109) & min_precedes(X110,X112,tptp0)))) & (occurrence_of(X111,tptp2) -> -(exists X113 (occurrence_of(X113,tptp1) & min_precedes(X110,X113,tptp0) & subactivity_occurrence(X113,X109)))) & leaf_occ(X111,X109))))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption]. 0.91/1.16 58 -leaf(A,B) | -min_precedes(A,C,B) # label(sos_21) # label(axiom). [clausify(5)]. 0.91/1.16 60 leaf(A,f18(A,B)) | -leaf_occ(A,B) # label(sos_34) # label(axiom). [clausify(35)]. 0.91/1.16 126 -occurrence_of(A,tptp0) | leaf_occ(f11(A),A) # label(sos_35) # label(axiom). [clausify(17)]. 0.91/1.16 141 -occurrence_of(A,B) | -occurrence_of(A,C) | C = B # label(sos_02) # label(axiom). [clausify(28)]. 0.91/1.16 148 occurrence_of(A,f18(B,A)) | -leaf_occ(B,A) # label(sos_34) # label(axiom). [clausify(35)]. 0.91/1.16 149 occurrence_of(c1,tptp0) # label(goals) # label(negated_conjecture). [clausify(37)]. 0.91/1.16 164 min_precedes(A,f19(A,B),tptp0) | min_precedes(A,f20(A,B),tptp0) | -leaf_occ(B,c1) # label(goals) # label(negated_conjecture). [clausify(37)]. 0.91/1.16 199 -leaf_occ(A,B) | -min_precedes(A,C,f18(A,B)). [resolve(60,a,58,a)]. 0.91/1.16 290 -occurrence_of(c1,A) | tptp0 = A. [resolve(149,a,141,b)]. 0.91/1.16 295 leaf_occ(f11(c1),c1). [resolve(149,a,126,a)]. 0.91/1.16 356 min_precedes(A,f19(A,f11(c1)),tptp0) | min_precedes(A,f20(A,f11(c1)),tptp0). [resolve(295,a,164,c)]. 0.91/1.16 370 occurrence_of(c1,f18(f11(c1),c1)). [resolve(295,a,148,b)]. 0.91/1.16 636 f18(f11(c1),c1) = tptp0. [resolve(370,a,290,a),flip(a)]. 0.91/1.16 707 -min_precedes(f11(c1),A,tptp0). [para(636(a,1),199(b,3)),unit_del(a,295)]. 0.91/1.16 1214 $F. [resolve(356,b,707,a),unit_del(a,707)]. 0.91/1.16 0.91/1.16 % SZS output end Refutation 0.91/1.16 ============================== end of proof ========================== 0.91/1.16 0.91/1.16 ============================== STATISTICS ============================ 0.91/1.16 0.91/1.16 Given=323. Generated=1880. Kept=1104. proofs=1. 0.91/1.16 Usable=306. Sos=609. Demods=8. Limbo=6, Disabled=407. Hints=0. 0.91/1.16 Megabytes=1.97. 0.91/1.16 User_CPU=0.16, System_CPU=0.01, Wall_clock=1. 0.91/1.16 0.91/1.16 ============================== end of statistics ===================== 0.91/1.16 0.91/1.16 ============================== end of search ========================= 0.91/1.16 0.91/1.16 THEOREM PROVED 0.91/1.16 % SZS status Theorem 0.91/1.16 0.91/1.16 Exiting with 1 proof. 0.91/1.16 0.91/1.16 Process 2425 exit (max_proofs) Mon Jul 3 03:36:00 2023 0.91/1.16 Prover9 interrupted 0.91/1.17 EOF