TSTP Solution File: PRO012+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PRO012+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n015.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Mon Jul 18 17:52:12 EDT 2022
% Result : Theorem 28.91s 29.20s
% Output : Refutation 28.91s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : PRO012+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n015.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 13 01:14:22 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.43/1.04 ============================== Prover9 ===============================
% 0.43/1.04 Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.04 Process 5800 was started by sandbox2 on n015.cluster.edu,
% 0.43/1.04 Mon Jun 13 01:14:23 2022
% 0.43/1.04 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_5647_n015.cluster.edu".
% 0.43/1.04 ============================== end of head ===========================
% 0.43/1.04
% 0.43/1.04 ============================== INPUT =================================
% 0.43/1.04
% 0.43/1.04 % Reading from file /tmp/Prover9_5647_n015.cluster.edu
% 0.43/1.04
% 0.43/1.04 set(prolog_style_variables).
% 0.43/1.04 set(auto2).
% 0.43/1.04 % set(auto2) -> set(auto).
% 0.43/1.04 % set(auto) -> set(auto_inference).
% 0.43/1.04 % set(auto) -> set(auto_setup).
% 0.43/1.04 % set(auto_setup) -> set(predicate_elim).
% 0.43/1.04 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/1.04 % set(auto) -> set(auto_limits).
% 0.43/1.04 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/1.04 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/1.04 % set(auto) -> set(auto_denials).
% 0.43/1.04 % set(auto) -> set(auto_process).
% 0.43/1.04 % set(auto2) -> assign(new_constants, 1).
% 0.43/1.04 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/1.04 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/1.04 % set(auto2) -> assign(max_hours, 1).
% 0.43/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/1.04 % set(auto2) -> assign(max_seconds, 0).
% 0.43/1.04 % set(auto2) -> assign(max_minutes, 5).
% 0.43/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/1.04 % set(auto2) -> set(sort_initial_sos).
% 0.43/1.04 % set(auto2) -> assign(sos_limit, -1).
% 0.43/1.04 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/1.04 % set(auto2) -> assign(max_megs, 400).
% 0.43/1.04 % set(auto2) -> assign(stats, some).
% 0.43/1.04 % set(auto2) -> clear(echo_input).
% 0.43/1.04 % set(auto2) -> set(quiet).
% 0.43/1.04 % set(auto2) -> clear(print_initial_clauses).
% 0.43/1.04 % set(auto2) -> clear(print_given).
% 0.43/1.04 assign(lrs_ticks,-1).
% 0.43/1.04 assign(sos_limit,10000).
% 0.43/1.04 assign(order,kbo).
% 0.43/1.04 set(lex_order_vars).
% 0.43/1.04 clear(print_given).
% 0.43/1.04
% 0.43/1.04 % formulas(sos). % not echoed (49 formulas)
% 0.43/1.04
% 0.43/1.04 ============================== end of input ==========================
% 0.43/1.04
% 0.43/1.04 % From the command line: assign(max_seconds, 300).
% 0.43/1.04
% 0.43/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/1.04
% 0.43/1.04 % Formulas that are not ordinary clauses:
% 0.43/1.04 1 (all X0 all X1 (occurrence_of(X1,X0) -> activity(X0) & activity_occurrence(X1))) # label(sos) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.04 2 (all X2 (activity_occurrence(X2) -> (exists X3 (activity(X3) & occurrence_of(X2,X3))))) # label(sos_01) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.04 3 (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.43/1.04 4 (all X7 (activity(X7) -> subactivity(X7,X7))) # label(sos_03) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.04 5 (all X8 all X9 (earlier(X8,X9) -> -earlier(X9,X8))) # label(sos_04) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.04 6 (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.43/1.04 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.43/1.04 8 (all X16 all X17 (occurrence_of(X16,X17) -> (arboreal(X16) <-> atomic(X17)))) # label(sos_07) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.04 9 (all X18 (legal(X18) -> arboreal(X18))) # label(sos_08) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.04 10 (all X19 all X20 (legal(X19) & earlier(X20,X19) -> legal(X20))) # label(sos_09) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.04 11 (all X21 all X22 (precedes(X21,X22) <-> earlier(X21,X22) & legal(X22))) # label(sos_10) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.04 12 (all X23 all X24 all X25 (min_precedes(X24,X25,X23) -> (exists X26 exists X27 (subactivity(X26,X23) & subactivity(X27,X23) & atocc(X24,X26) & atocc(X25,X27))))) # label(sos_11) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.04 13 (all X28 all X29 (root(X29,X28) -> (exists X30 (subactivity(X30,X28) & atocc(X29,X30))))) # label(sos_12) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.04 14 (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.43/1.05 15 (all X35 all X36 all X37 (min_precedes(X35,X36,X37) -> -root(X36,X37))) # label(sos_14) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.05 16 (all X38 all X39 all X40 (min_precedes(X38,X39,X40) -> precedes(X38,X39))) # label(sos_15) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.05 17 (all X41 all X42 (root(X41,X42) -> legal(X41))) # label(sos_16) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.05 18 (all X43 all X44 (atocc(X43,X44) & legal(X43) -> root(X43,X44))) # label(sos_17) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.05 19 (all X45 all X46 all X47 all X48 (min_precedes(X45,X46,X48) & min_precedes(X45,X47,X48) & precedes(X46,X47) -> min_precedes(X46,X47,X48))) # label(sos_18) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.05 20 (all X49 all X50 all X51 (min_precedes(X49,X50,X51) -> -atomic(X51))) # label(sos_19) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.05 21 (all X52 all X53 all X54 all X55 (min_precedes(X53,X52,X55) & min_precedes(X54,X52,X55) & precedes(X53,X54) -> min_precedes(X53,X54,X55))) # label(sos_20) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.05 22 (all X56 all X57 (leaf(X56,X57) <-> (root(X56,X57) | (exists X58 min_precedes(X58,X56,X57))) & -(exists X59 min_precedes(X56,X59,X57)))) # label(sos_21) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.05 23 (all X60 all X61 all X62 (next_subocc(X60,X61,X62) <-> min_precedes(X60,X61,X62) & -(exists X63 (min_precedes(X60,X63,X62) & min_precedes(X63,X61,X62))))) # label(sos_22) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.05 24 (all X64 all X65 (atocc(X64,X65) <-> (exists X66 (subactivity(X65,X66) & atomic(X66) & occurrence_of(X64,X66))))) # label(sos_23) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.05 25 (all X67 all X68 (subactivity_occurrence(X67,X68) -> activity_occurrence(X67) & activity_occurrence(X68))) # label(sos_24) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.05 26 (all X69 all X70 all X71 (min_precedes(X70,X71,X69) -> (exists X72 (occurrence_of(X72,X69) & subactivity_occurrence(X70,X72) & subactivity_occurrence(X71,X72))))) # label(sos_25) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.05 27 (all X73 all X74 (root(X74,X73) & -atomic(X73) -> (exists X75 (occurrence_of(X75,X73) & subactivity_occurrence(X74,X75))))) # label(sos_26) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.05 28 (all X76 all X77 (occurrence_of(X77,X76) & -atomic(X76) -> (exists X78 (root(X78,X76) & subactivity_occurrence(X78,X77))))) # label(sos_27) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.05 29 (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(X81,X82,X79) | min_precedes(X82,X81,X79) | X81 = X82)) # label(sos_28) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.05 30 (all X83 all X84 all X85 all X86 (min_precedes(X83,X84,X85) & occurrence_of(X86,X85) & subactivity_occurrence(X84,X86) -> subactivity_occurrence(X83,X86))) # label(sos_29) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.05 31 (all X87 all X88 all X89 all X90 (occurrence_of(X89,X87) & occurrence_of(X90,X88) & -atomic(X87) & subactivity_occurrence(X89,X90) -> subactivity(X87,X88))) # label(sos_30) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.05 32 (all X91 all X92 all X93 (subactivity_occurrence(X91,X92) & subactivity_occurrence(X92,X93) -> subactivity_occurrence(X91,X93))) # label(sos_31) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.05 33 (all X94 all X95 all X96 all X97 (occurrence_of(X96,X94) & occurrence_of(X97,X95) & subactivity(X94,X95) & -subactivity_occurrence(X96,X97) -> (exists X98 (subactivity_occurrence(X98,X97) & -subactivity_occurrence(X98,X96))))) # label(sos_32) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.05 34 (all X99 all X100 (root_occ(X99,X100) <-> (exists X101 (occurrence_of(X100,X101) & subactivity_occurrence(X99,X100) & root(X99,X101))))) # label(sos_33) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.05 35 (all X102 all X103 (leaf_occ(X102,X103) <-> (exists X104 (occurrence_of(X103,X104) & subactivity_occurrence(X102,X103) & leaf(X102,X104))))) # label(sos_34) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.05 36 (all X105 (occurrence_of(X105,tptp0) -> (exists X106 exists X107 exists X108 (occurrence_of(X106,tptp3) & root_occ(X106,X105) & occurrence_of(X107,tptp4) & min_precedes(X106,X107,tptp0) & (occurrence_of(X108,tptp2) | occurrence_of(X108,tptp1)) & min_precedes(X107,X108,tptp0) & (all X109 (min_precedes(X106,X109,tptp0) -> X109 = X107 | X109 = X108)))))) # label(sos_35) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.05 37 -(all X110 (occurrence_of(X110,tptp0) -> (exists X111 exists X112 (occurrence_of(X111,tptp3) & root_occ(X111,X110) & (occurrence_of(X112,tptp2) | occurrence_of(X112,tptp1)) & min_precedes(X111,X112,tptp0))))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.43/1.05
% 0.43/1.05 ============================== end of process non-clausal formulas ===
% 0.43/1.05
% 0.43/1.05 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/1.05
% 0.43/1.05 ============================== PREDICATE ELIMINATION =================
% 0.43/1.05 38 -activity(A) | subactivity(A,A) # label(sos_03) # label(axiom). [clausify(4)].
% 0.43/1.05 39 activity(tptp0) # label(sos_36) # label(axiom). [assumption].
% 0.43/1.05 40 -occurrence_of(A,B) | activity(B) # label(sos) # label(axiom). [clausify(1)].
% 0.43/1.05 41 -activity_occurrence(A) | activity(f1(A)) # label(sos_01) # label(axiom). [clausify(2)].
% 0.43/1.05 Derived: subactivity(tptp0,tptp0). [resolve(38,a,39,a)].
% 0.43/1.05 Derived: subactivity(A,A) | -occurrence_of(B,A). [resolve(38,a,40,b)].
% 0.43/1.05 Derived: subactivity(f1(A),f1(A)) | -activity_occurrence(A). [resolve(38,a,41,b)].
% 0.43/1.05 42 -atocc(A,B) | -legal(A) | root(A,B) # label(sos_17) # label(axiom). [clausify(18)].
% 0.43/1.05 43 -min_precedes(A,B,C) | -root(B,C) # label(sos_14) # label(axiom). [clausify(15)].
% 0.43/1.05 44 -root(A,B) | legal(A) # label(sos_16) # label(axiom). [clausify(17)].
% 0.43/1.05 45 -root(A,B) | subactivity(f4(B,A),B) # label(sos_12) # label(axiom). [clausify(13)].
% 0.43/1.05 46 -root(A,B) | atocc(A,f4(B,A)) # label(sos_12) # label(axiom). [clausify(13)].
% 0.43/1.05 Derived: -atocc(A,B) | -legal(A) | -min_precedes(C,A,B). [resolve(42,c,43,b)].
% 0.43/1.05 Derived: -atocc(A,B) | -legal(A) | subactivity(f4(B,A),B). [resolve(42,c,45,a)].
% 0.43/1.05 Derived: -atocc(A,B) | -legal(A) | atocc(A,f4(B,A)). [resolve(42,c,46,a)].
% 0.43/1.05 47 -root_occ(A,B) | root(A,f14(A,B)) # label(sos_33) # label(axiom). [clausify(34)].
% 0.43/1.05 Derived: -root_occ(A,B) | -min_precedes(C,A,f14(A,B)). [resolve(47,b,43,b)].
% 0.43/1.05 Derived: -root_occ(A,B) | legal(A). [resolve(47,b,44,a)].
% 0.43/1.05 Derived: -root_occ(A,B) | subactivity(f4(f14(A,B),A),f14(A,B)). [resolve(47,b,45,a)].
% 0.43/1.05 Derived: -root_occ(A,B) | atocc(A,f4(f14(A,B),A)). [resolve(47,b,46,a)].
% 0.43/1.05 48 -min_precedes(A,B,C) | root(f5(A,B,C),C) # label(sos_13) # label(axiom). [clausify(14)].
% 0.43/1.05 Derived: -min_precedes(A,B,C) | -min_precedes(D,f5(A,B,C),C). [resolve(48,b,43,b)].
% 0.43/1.05 Derived: -min_precedes(A,B,C) | legal(f5(A,B,C)). [resolve(48,b,44,a)].
% 0.43/1.05 Derived: -min_precedes(A,B,C) | subactivity(f4(C,f5(A,B,C)),C). [resolve(48,b,45,a)].
% 0.43/1.05 Derived: -min_precedes(A,B,C) | atocc(f5(A,B,C),f4(C,f5(A,B,C))). [resolve(48,b,46,a)].
% 0.43/1.05 49 -root(A,B) | atomic(B) | occurrence_of(f11(B,A),B) # label(sos_26) # label(axiom). [clausify(27)].
% 0.43/1.05 Derived: atomic(A) | occurrence_of(f11(A,B),A) | -atocc(B,A) | -legal(B). [resolve(49,a,42,c)].
% 0.43/1.05 Derived: atomic(f14(A,B)) | occurrence_of(f11(f14(A,B),A),f14(A,B)) | -root_occ(A,B). [resolve(49,a,47,b)].
% 0.43/1.05 Derived: atomic(A) | occurrence_of(f11(A,f5(B,C,A)),A) | -min_precedes(B,C,A). [resolve(49,a,48,b)].
% 0.43/1.05 50 -root(A,B) | atomic(B) | subactivity_occurrence(A,f11(B,A)) # label(sos_26) # label(axiom). [clausify(27)].
% 0.43/1.05 Derived: atomic(A) | subactivity_occurrence(B,f11(A,B)) | -atocc(B,A) | -legal(B). [resolve(50,a,42,c)].
% 0.43/1.05 Derived: atomic(f14(A,B)) | subactivity_occurrence(A,f11(f14(A,B),A)) | -root_occ(A,B). [resolve(50,a,47,b)].
% 0.43/1.05 Derived: atomic(A) | subactivity_occurrence(f5(B,C,A),f11(A,f5(B,C,A))) | -min_precedes(B,C,A). [resolve(50,a,48,b)].
% 0.43/1.05 51 -occurrence_of(A,B) | atomic(B) | root(f12(B,A),B) # label(sos_27) # label(axiom). [clausify(28)].
% 0.43/1.05 Derived: -occurrence_of(A,B) | atomic(B) | -min_precedes(C,f12(B,A),B). [resolve(51,c,43,b)].
% 0.43/1.05 Derived: -occurrence_of(A,B) | atomic(B) | legal(f12(B,A)). [resolve(51,c,44,a)].
% 0.43/1.05 Derived: -occurrence_of(A,B) | atomic(B) | subactivity(f4(B,f12(B,A)),B). [resolve(51,c,45,a)].
% 0.43/1.05 Derived: -occurrence_of(A,B) | atomic(B) | atocc(f12(B,A),f4(B,f12(B,A))). [resolve(51,c,46,a)].
% 0.43/1.05 Derived: -occurrence_of(A,B) | atomic(B) | atomic(B) | occurrence_of(f11(B,f12(B,A)),B). [resolve(51,c,49,a)].
% 0.43/1.05 Derived: -occurrence_of(A,B) | atomic(B) | atomic(B) | subactivity_occurrence(f12(B,A),f11(B,f12(B,A))). [resolve(51,c,50,a)].
% 0.43/1.05 52 -leaf(A,B) | root(A,B) | min_precedes(f6(A,B),A,B) # label(sos_21) # label(axiom). [clausify(22)].
% 0.43/1.05 Derived: -leaf(A,B) | min_precedes(f6(A,B),A,B) | -min_precedes(C,A,B). [resolve(52,b,43,b)].
% 0.43/1.05 Derived: -leaf(A,B) | min_precedes(f6(A,B),A,B) | legal(A). [resolve(52,b,44,a)].
% 0.43/1.05 Derived: -leaf(A,B) | min_precedes(f6(A,B),A,B) | subactivity(f4(B,A),B). [resolve(52,b,45,a)].
% 0.43/1.05 Derived: -leaf(A,B) | min_precedes(f6(A,B),A,B) | atocc(A,f4(B,A)). [resolve(52,b,46,a)].
% 0.43/1.05 Derived: -leaf(A,B) | min_precedes(f6(A,B),A,B) | atomic(B) | occurrence_of(f11(B,A),B). [resolve(52,b,49,a)].
% 0.43/1.05 Derived: -leaf(A,B) | min_precedes(f6(A,B),A,B) | atomic(B) | subactivity_occurrence(A,f11(B,A)). [resolve(52,b,50,a)].
% 0.43/1.05 53 leaf(A,B) | -root(A,B) | min_precedes(A,f7(A,B),B) # label(sos_21) # label(axiom). [clausify(22)].
% 0.43/1.05 Derived: leaf(A,B) | min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A). [resolve(53,b,42,c)].
% 0.43/1.05 Derived: leaf(A,f14(A,B)) | min_precedes(A,f7(A,f14(A,B)),f14(A,B)) | -root_occ(A,B). [resolve(53,b,47,b)].
% 0.43/1.05 Derived: leaf(f5(A,B,C),C) | min_precedes(f5(A,B,C),f7(f5(A,B,C),C),C) | -min_precedes(A,B,C). [resolve(53,b,48,b)].
% 0.43/1.05 Derived: leaf(f12(A,B),A) | min_precedes(f12(A,B),f7(f12(A,B),A),A) | -occurrence_of(B,A) | atomic(A). [resolve(53,b,51,c)].
% 0.43/1.05 54 root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -root(A,C) # label(sos_33) # label(axiom). [clausify(34)].
% 0.43/1.05 Derived: root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -atocc(A,C) | -legal(A). [resolve(54,d,42,c)].
% 0.43/1.05 Derived: root_occ(A,B) | -occurrence_of(B,f14(A,C)) | -subactivity_occurrence(A,B) | -root_occ(A,C). [resolve(54,d,47,b)].
% 0.43/1.05 Derived: root_occ(f5(A,B,C),D) | -occurrence_of(D,C) | -subactivity_occurrence(f5(A,B,C),D) | -min_precedes(A,B,C). [resolve(54,d,48,b)].
% 0.43/1.05 Derived: root_occ(f12(A,B),C) | -occurrence_of(C,A) | -subactivity_occurrence(f12(A,B),C) | -occurrence_of(B,A) | atomic(A). [resolve(54,d,51,c)].
% 0.43/1.05 Derived: root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -leaf(A,C) | min_precedes(f6(A,C),A,C). [resolve(54,d,52,b)].
% 0.43/1.05 55 -leaf_occ(A,B) | leaf(A,f15(A,B)) # label(sos_34) # label(axiom). [clausify(35)].
% 0.43/1.05 56 -leaf(A,B) | -min_precedes(A,C,B) # label(sos_21) # label(axiom). [clausify(22)].
% 0.43/1.05 Derived: -leaf_occ(A,B) | -min_precedes(A,C,f15(A,B)). [resolve(55,b,56,a)].
% 0.43/1.05 57 leaf_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -leaf(A,C) # label(sos_34) # label(axiom). [clausify(35)].
% 0.43/1.05 Derived: leaf_occ(A,B) | -occurrence_of(B,f15(A,C)) | -subactivity_occurrence(A,B) | -leaf_occ(A,C). [resolve(57,d,55,b)].
% 0.43/1.05 58 leaf(A,B) | -min_precedes(C,A,B) | min_precedes(A,f7(A,B),B) # label(sos_21) # label(axiom). [clausify(22)].
% 0.43/1.05 Derived: -min_precedes(A,B,C) | min_precedes(B,f7(B,C),C) | -min_precedes(B,D,C). [resolve(58,a,56,a)].
% 0.43/1.05 Derived: -min_precedes(A,B,C) | min_precedes(B,f7(B,C),C) | leaf_occ(B,D) | -occurrence_of(D,C) | -subactivity_occurrence(B,D). [resolve(58,a,57,d)].
% 0.43/1.05 59 -leaf(A,B) | min_precedes(f6(A,B),A,B) | -min_precedes(C,A,B). [resolve(52,b,43,b)].
% 0.43/1.05 Derived: min_precedes(f6(A,f15(A,B)),A,f15(A,B)) | -min_precedes(C,A,f15(A,B)) | -leaf_occ(A,B). [resolve(59,a,55,b)].
% 0.43/1.05 Derived: min_precedes(f6(A,B),A,B) | -min_precedes(C,A,B) | -min_precedes(D,A,B) | min_precedes(A,f7(A,B),B). [resolve(59,a,58,a)].
% 0.43/1.05 60 -leaf(A,B) | min_precedes(f6(A,B),A,B) | legal(A). [resolve(52,b,44,a)].
% 0.43/1.05 Derived: min_precedes(f6(A,f15(A,B)),A,f15(A,B)) | legal(A) | -leaf_occ(A,B). [resolve(60,a,55,b)].
% 0.43/1.05 61 -leaf(A,B) | min_precedes(f6(A,B),A,B) | subactivity(f4(B,A),B). [resolve(52,b,45,a)].
% 0.43/1.05 Derived: min_precedes(f6(A,f15(A,B)),A,f15(A,B)) | subactivity(f4(f15(A,B),A),f15(A,B)) | -leaf_occ(A,B). [resolve(61,a,55,b)].
% 0.43/1.05 62 -leaf(A,B) | min_precedes(f6(A,B),A,B) | atocc(A,f4(B,A)). [resolve(52,b,46,a)].
% 0.43/1.05 Derived: min_precedes(f6(A,f15(A,B)),A,f15(A,B)) | atocc(A,f4(f15(A,B),A)) | -leaf_occ(A,B). [resolve(62,a,55,b)].
% 0.43/1.05 63 -leaf(A,B) | min_precedes(f6(A,B),A,B) | atomic(B) | occurrence_of(f11(B,A),B). [resolve(52,b,49,a)].
% 0.43/1.05 Derived: min_precedes(f6(A,f15(A,B)),A,f15(A,B)) | atomic(f15(A,B)) | occurrence_of(f11(f15(A,B),A),f15(A,B)) | -leaf_occ(A,B). [resolve(63,a,55,b)].
% 0.43/1.05 64 -leaf(A,B) | min_precedes(f6(A,B),A,B) | atomic(B) | subactivity_occurrence(A,f11(B,A)). [resolve(52,b,50,a)].
% 0.43/1.05 Derived: min_precedes(f6(A,f15(A,B)),A,f15(A,B)) | atomic(f15(A,B)) | subactivity_occurrence(A,f11(f15(A,B),A)) | -leaf_occ(A,B). [resolve(64,a,55,b)].
% 0.43/1.05 65 leaf(A,B) | min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A). [resolve(53,b,42,c)].
% 0.43/1.05 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A) | -min_precedes(A,C,B). [resolve(65,a,56,a)].
% 0.43/1.05 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A) | leaf_occ(A,C) | -occurrence_of(C,B) | -subactivity_occurrence(A,C). [resolve(65,a,57,d)].
% 0.43/1.05 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A) | min_precedes(f6(A,B),A,B) | subactivity(f4(B,A),B). [resolve(65,a,61,a)].
% 0.43/1.05 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A) | min_precedes(f6(A,B),A,B) | atocc(A,f4(B,A)). [resolve(65,a,62,a)].
% 0.43/1.05 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A) | min_precedes(f6(A,B),A,B) | atomic(B) | occurrence_of(f11(B,A),B). [resolve(65,a,63,a)].
% 0.43/1.05 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A) | min_precedes(f6(A,B),A,B) | atomic(B) | subactivity_occurrence(A,f11(B,A)). [resolve(65,a,64,a)].
% 0.43/1.05 66 leaf(A,f14(A,B)) | min_precedes(A,f7(A,f14(A,B)),f14(A,B)) | -root_occ(A,B). [resolve(53,b,47,b)].
% 0.43/1.05 Derived: min_precedes(A,f7(A,f14(A,B)),f14(A,B)) | -root_occ(A,B) | -min_precedes(A,C,f14(A,B)). [resolve(66,a,56,a)].
% 0.43/1.05 Derived: min_precedes(A,f7(A,f14(A,B)),f14(A,B)) | -root_occ(A,B) | leaf_occ(A,C) | -occurrence_of(C,f14(A,B)) | -subactivity_occurrence(A,C). [resolve(66,a,57,d)].
% 0.43/1.05 Derived: min_precedes(A,f7(A,f14(A,B)),f14(A,B)) | -root_occ(A,B) | min_precedes(f6(A,f14(A,B)),A,f14(A,B)) | legal(A). [resolve(66,a,60,a)].
% 0.43/1.05 Derived: min_precedes(A,f7(A,f14(A,B)),f14(A,B)) | -root_occ(A,B) | min_precedes(f6(A,f14(A,B)),A,f14(A,B)) | subactivity(f4(f14(A,B),A),f14(A,B)). [resolve(66,a,61,a)].
% 0.43/1.05 Derived: min_precedes(A,f7(A,f14(A,B)),f14(A,B)) | -root_occ(A,B) | min_precedes(f6(A,f14(A,B)),A,f14(A,B)) | atocc(A,f4(f14(A,B),A)). [resolve(66,a,62,a)].
% 0.43/1.05 Derived: min_precedes(A,f7(A,f14(A,B)),f14(A,B)) | -root_occ(A,B) | min_precedes(f6(A,f14(A,B)),A,f14(A,B)) | atomic(f14(A,B)) | occurrence_of(f11(f14(A,B),A),f14(A,B)). [resolve(66,a,63,a)].
% 0.43/1.05 Derived: min_precedes(A,f7(A,f14(A,B)),f14(A,B)) | -root_occ(A,B) | min_precedes(f6(A,f14(A,B)),A,f14(A,B)) | atomic(f14(A,B)) | subactivity_occurrence(A,f11(f14(A,B),A)). [resolve(66,a,64,a)].
% 0.43/1.05 67 leaf(f5(A,B,C),C) | min_precedes(f5(A,B,C),f7(f5(A,B,C),C),C) | -min_precedes(A,B,C). [resolve(53,b,48,b)].
% 0.43/1.05 Derived: min_precedes(f5(A,B,C),f7(f5(A,B,C),C),C) | -min_precedes(A,B,C) | -min_precedes(f5(A,B,C),D,C). [resolve(67,a,56,a)].
% 0.43/1.05 Derived: min_precedes(f5(A,B,C),f7(f5(A,B,C),C),C) | -min_precedes(A,B,C) | leaf_occ(f5(A,B,C),D) | -occurrence_of(D,C) | -subactivity_occurrence(f5(A,B,C),D). [resolve(67,a,57,d)].
% 0.43/1.05 Derived: min_precedes(f5(A,B,C),f7(f5(A,B,C),C),C) | -min_precedes(A,B,C) | min_precedes(f6(f5(A,B,C),C),f5(A,B,C),C) | legal(f5(A,B,C)). [resolve(67,a,60,a)].
% 0.43/1.05 Derived: min_precedes(f5(A,B,C),f7(f5(A,B,C),C),C) | -min_precedes(A,B,C) | min_precedes(f6(f5(A,B,C),C),f5(A,B,C),C) | subactivity(f4(C,f5(A,B,C)),C). [resolve(67,a,61,a)].
% 0.43/1.05 Derived: min_precedes(f5(A,B,C),f7(f5(A,B,C),C),C) | -min_precedes(A,B,C) | min_precedes(f6(f5(A,B,C),C),f5(A,B,C),C) | atocc(f5(A,B,C),f4(C,f5(A,B,C))). [resolve(67,a,62,a)].
% 0.43/1.06 Derived: min_precedes(f5(A,B,C),f7(f5(A,B,C),C),C) | -min_precedes(A,B,C) | min_precedes(f6(f5(A,B,C),C),f5(A,B,C),C) | atomic(C) | occurrence_of(f11(C,f5(A,B,C)),C). [resolve(67,a,63,a)].
% 0.43/1.06 Derived: min_precedes(f5(A,B,C),f7(f5(A,B,C),C),C) | -min_precedes(A,B,C) | min_precedes(f6(f5(A,B,C),C),f5(A,B,C),C) | atomic(C) | subactivity_occurrence(f5(A,B,C),f11(C,f5(A,B,C))). [resolve(67,a,64,a)].
% 0.43/1.06 68 leaf(f12(A,B),A) | min_precedes(f12(A,B),f7(f12(A,B),A),A) | -occurrence_of(B,A) | atomic(A). [resolve(53,b,51,c)].
% 0.43/1.06 Derived: min_precedes(f12(A,B),f7(f12(A,B),A),A) | -occurrence_of(B,A) | atomic(A) | -min_precedes(f12(A,B),C,A). [resolve(68,a,56,a)].
% 0.43/1.06 Derived: min_precedes(f12(A,B),f7(f12(A,B),A),A) | -occurrence_of(B,A) | atomic(A) | leaf_occ(f12(A,B),C) | -occurrence_of(C,A) | -subactivity_occurrence(f12(A,B),C). [resolve(68,a,57,d)].
% 0.43/1.06 Derived: min_precedes(f12(A,B),f7(f12(A,B),A),A) | -occurrence_of(B,A) | atomic(A) | min_precedes(f6(f12(A,B),A),f12(A,B),A) | legal(f12(A,B)). [resolve(68,a,60,a)].
% 0.43/1.06 Derived: min_precedes(f12(A,B),f7(f12(A,B),A),A) | -occurrence_of(B,A) | atomic(A) | min_precedes(f6(f12(A,B),A),f12(A,B),A) | subactivity(f4(A,f12(A,B)),A). [resolve(68,a,61,a)].
% 0.43/1.06 Derived: min_precedes(f12(A,B),f7(f12(A,B),A),A) | -occurrence_of(B,A) | atomic(A) | min_precedes(f6(f12(A,B),A),f12(A,B),A) | atocc(f12(A,B),f4(A,f12(A,B))). [resolve(68,a,62,a)].
% 0.43/1.06 Derived: min_precedes(f12(A,B),f7(f12(A,B),A),A) | -occurrence_of(B,A) | atomic(A) | min_precedes(f6(f12(A,B),A),f12(A,B),A) | atomic(A) | occurrence_of(f11(A,f12(A,B)),A). [resolve(68,a,63,a)].
% 0.43/1.06 Derived: min_precedes(f12(A,B),f7(f12(A,B),A),A) | -occurrence_of(B,A) | atomic(A) | min_precedes(f6(f12(A,B),A),f12(A,B),A) | atomic(A) | subactivity_occurrence(f12(A,B),f11(A,f12(A,B))). [resolve(68,a,64,a)].
% 0.43/1.06 69 root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -leaf(A,C) | min_precedes(f6(A,C),A,C). [resolve(54,d,52,b)].
% 0.43/1.06 Derived: root_occ(A,B) | -occurrence_of(B,f15(A,C)) | -subactivity_occurrence(A,B) | min_precedes(f6(A,f15(A,C)),A,f15(A,C)) | -leaf_occ(A,C). [resolve(69,d,55,b)].
% 0.43/1.06 Derived: root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | min_precedes(f6(A,C),A,C) | min_precedes(A,f7(A,C),C) | -atocc(A,C) | -legal(A). [resolve(69,d,65,a)].
% 0.43/1.06 Derived: root_occ(A,B) | -occurrence_of(B,f14(A,C)) | -subactivity_occurrence(A,B) | min_precedes(f6(A,f14(A,C)),A,f14(A,C)) | min_precedes(A,f7(A,f14(A,C)),f14(A,C)) | -root_occ(A,C). [resolve(69,d,66,a)].
% 0.43/1.06 Derived: root_occ(f5(A,B,C),D) | -occurrence_of(D,C) | -subactivity_occurrence(f5(A,B,C),D) | min_precedes(f6(f5(A,B,C),C),f5(A,B,C),C) | min_precedes(f5(A,B,C),f7(f5(A,B,C),C),C) | -min_precedes(A,B,C). [resolve(69,d,67,a)].
% 0.43/1.06 Derived: root_occ(f12(A,B),C) | -occurrence_of(C,A) | -subactivity_occurrence(f12(A,B),C) | min_precedes(f6(f12(A,B),A),f12(A,B),A) | min_precedes(f12(A,B),f7(f12(A,B),A),A) | -occurrence_of(B,A) | atomic(A). [resolve(69,d,68,a)].
% 0.43/1.06 70 next_subocc(A,B,C) | -min_precedes(A,B,C) | min_precedes(A,f8(A,B,C),C) # label(sos_22) # label(axiom). [clausify(23)].
% 0.43/1.06 71 -next_subocc(A,B,C) | -min_precedes(A,D,C) | -min_precedes(D,B,C) # label(sos_22) # label(axiom). [clausify(23)].
% 0.43/1.06 72 -next_subocc(A,B,C) | min_precedes(A,B,C) # label(sos_22) # label(axiom). [clausify(23)].
% 0.43/1.06 Derived: -min_precedes(A,B,C) | min_precedes(A,f8(A,B,C),C) | -min_precedes(A,D,C) | -min_precedes(D,B,C). [resolve(70,a,71,a)].
% 0.43/1.06 73 next_subocc(A,B,C) | -min_precedes(A,B,C) | min_precedes(f8(A,B,C),B,C) # label(sos_22) # label(axiom). [clausify(23)].
% 0.43/1.06 Derived: -min_precedes(A,B,C) | min_precedes(f8(A,B,C),B,C) | -min_precedes(A,D,C) | -min_precedes(D,B,C). [resolve(73,a,71,a)].
% 0.43/1.06 74 -activity_occurrence(A) | occurrence_of(A,f1(A)) # label(sos_01) # label(axiom). [clausify(2)].
% 0.43/1.06 75 -occurrence_of(A,B) | activity_occurrence(A) # label(sos) # label(axiom). [clausify(1)].
% 0.43/1.06 76 -subactivity_occurrence(A,B) | activity_occurrence(A) # label(sos_24) # label(axiom). [clausify(25)].
% 0.43/1.06 77 -subactivity_occurrence(A,B) | activity_occurrence(B) # label(sos_24) # label(axiom). [clausify(25)].
% 0.43/1.06 Derived: occurrence_of(A,f1(A)) | -occurrence_of(A,B). [resolve(74,a,75,b)].
% 0.43/1.06 Derived: occurrence_of(A,f1(A)) | -subactivity_occurrence(A,B). [resolve(74,a,76,b)].
% 0.43/1.06 Derived: occurrence_of(A,f1(A)) | -subactivity_occurrence(B,A). [resolve(74,a,77,b)].
% 0.43/1.06 78 subactivity(f1(A),f1(A)) | -activity_occurrence(A). [resolve(38,a,41,b)].
% 0.43/1.06 Derived: subactivity(f1(A),f1(A)) | -occurrence_of(A,B). [resolve(78,b,75,b)].
% 0.43/1.06 Derived: subactivity(f1(A),f1(A)) | -subactivity_occurrence(A,B). [resolve(78,b,76,b)].
% 0.43/1.06 Derived: subactivity(f1(A),f1(A)) | -subactivity_occurrence(B,A). [resolve(78,b,77,b)].
% 0.43/1.06 79 -min_precedes(A,B,C) | precedes(A,B) # label(sos_15) # label(axiom). [clausify(16)].
% 0.43/1.06 80 -precedes(A,B) | legal(B) # label(sos_10) # label(axiom). [clausify(11)].
% 0.43/1.06 81 -precedes(A,B) | earlier(A,B) # label(sos_10) # label(axiom). [clausify(11)].
% 0.43/1.06 Derived: -min_precedes(A,B,C) | legal(B). [resolve(79,b,80,a)].
% 0.43/1.06 Derived: -min_precedes(A,B,C) | earlier(A,B). [resolve(79,b,81,a)].
% 0.43/1.06 82 precedes(A,B) | -earlier(A,B) | -legal(B) # label(sos_10) # label(axiom). [clausify(11)].
% 0.43/1.06 83 -min_precedes(A,B,C) | -min_precedes(A,D,C) | -precedes(B,D) | min_precedes(B,D,C) # label(sos_18) # label(axiom). [clausify(19)].
% 0.43/1.06 Derived: -min_precedes(A,B,C) | -min_precedes(A,D,C) | min_precedes(B,D,C) | -min_precedes(B,D,E). [resolve(83,c,79,b)].
% 0.43/1.06 Derived: -min_precedes(A,B,C) | -min_precedes(A,D,C) | min_precedes(B,D,C) | -earlier(B,D) | -legal(D). [resolve(83,c,82,a)].
% 0.43/1.06 84 -min_precedes(A,B,C) | -min_precedes(D,B,C) | -precedes(A,D) | min_precedes(A,D,C) # label(sos_20) # label(axiom). [clausify(21)].
% 0.43/1.06 Derived: -min_precedes(A,B,C) | -min_precedes(D,B,C) | min_precedes(A,D,C) | -min_precedes(A,D,E). [resolve(84,c,79,b)].
% 0.43/1.06 Derived: -min_precedes(A,B,C) | -min_precedes(D,B,C) | min_precedes(A,D,C) | -earlier(A,D) | -legal(D). [resolve(84,c,82,a)].
% 0.43/1.06 85 atocc(A,B) | -subactivity(B,C) | -atomic(C) | -occurrence_of(A,C) # label(sos_23) # label(axiom). [clausify(24)].
% 0.43/1.06 86 -atocc(A,B) | subactivity(B,f9(A,B)) # label(sos_23) # label(axiom). [clausify(24)].
% 0.43/1.06 87 -min_precedes(A,B,C) | subactivity(f2(C,A,B),C) # label(sos_11) # label(axiom). [clausify(12)].
% 0.43/1.06 88 -min_precedes(A,B,C) | subactivity(f3(C,A,B),C) # label(sos_11) # label(axiom). [clausify(12)].
% 0.43/1.06 Derived: atocc(A,B) | -atomic(f9(C,B)) | -occurrence_of(A,f9(C,B)) | -atocc(C,B). [resolve(85,b,86,b)].
% 0.43/1.06 Derived: atocc(A,f2(B,C,D)) | -atomic(B) | -occurrence_of(A,B) | -min_precedes(C,D,B). [resolve(85,b,87,b)].
% 0.43/1.06 Derived: atocc(A,f3(B,C,D)) | -atomic(B) | -occurrence_of(A,B) | -min_precedes(C,D,B). [resolve(85,b,88,b)].
% 0.43/1.06 89 -occurrence_of(A,B) | -occurrence_of(C,D) | atomic(B) | -subactivity_occurrence(A,C) | subactivity(B,D) # label(sos_30) # label(axiom). [clausify(31)].
% 0.43/1.06 Derived: -occurrence_of(A,B) | -occurrence_of(C,D) | atomic(B) | -subactivity_occurrence(A,C) | atocc(E,B) | -atomic(D) | -occurrence_of(E,D). [resolve(89,e,85,b)].
% 0.43/1.06 90 -occurrence_of(A,B) | -occurrence_of(C,D) | -subactivity(B,D) | subactivity_occurrence(A,C) | subactivity_occurrence(f13(B,D,A,C),C) # label(sos_32) # label(axiom). [clausify(33)].
% 0.43/1.06 Derived: -occurrence_of(A,B) | -occurrence_of(C,f9(D,B)) | subactivity_occurrence(A,C) | subactivity_occurrence(f13(B,f9(D,B),A,C),C) | -atocc(D,B). [resolve(90,c,86,b)].
% 0.43/1.06 Derived: -occurrence_of(A,f2(B,C,D)) | -occurrence_of(E,B) | subactivity_occurrence(A,E) | subactivity_occurrence(f13(f2(B,C,D),B,A,E),E) | -min_precedes(C,D,B). [resolve(90,c,87,b)].
% 0.43/1.06 Derived: -occurrence_of(A,f3(B,C,D)) | -occurrence_of(E,B) | subactivity_occurrence(A,E) | subactivity_occurrence(f13(f3(B,C,D),B,A,E),E) | -min_precedes(C,D,B). [resolve(90,c,88,b)].
% 0.43/1.06 Derived: -occurrence_of(A,B) | -occurrence_of(C,D) | subactivity_occurrence(A,C) | subactivity_occurrence(f13(B,D,A,C),C) | -occurrence_of(E,B) | -occurrence_of(F,D) | atomic(B) | -subactivity_occurrence(E,F). [resolve(90,c,89,e)].
% 0.43/1.06 91 -occurrence_of(A,B) | -occurrence_of(C,D) | -subactivity(B,D) | subactivity_occurrence(A,C) | -subactivity_occurrence(f13(B,D,A,C),A) # label(sos_32) # label(axiom). [clausify(33)].
% 0.43/1.06 Derived: -occurrence_of(A,B) | -occurrence_of(C,f9(D,B)) | subactivity_occurrence(A,C) | -subactivity_occurrence(f13(B,f9(D,B),A,C),A) | -atocc(D,B). [resolve(91,c,86,b)].
% 0.43/1.06 Derived: -occurrence_of(A,f2(B,C,D)) | -occurrence_of(E,B) | subactivity_occurrence(A,E) | -subactivity_occurrence(f13(f2(B,C,D),B,A,E),A) | -min_precedes(C,D,B). [resolve(91,c,87,b)].
% 0.43/1.06 Derived: -occurrence_of(A,f3(B,C,D)) | -occurrence_of(E,B) | subactivity_occurrence(A,E) | -subactivity_occurrence(f13(f3(B,C,D),B,A,E),A) | -min_precedes(C,D,B). [resolve(91,c,88,b)].
% 0.43/1.06 Derived: -occurrence_of(A,B) | -occurrence_of(C,D) | subactivity_occurrence(A,C) | -subactivity_occurrence(f13(B,D,A,C),A) | -occurrence_of(E,B) | -occurrence_of(F,D) | atomic(B) | -subactivity_occurrence(E,F). [resolve(91,c,89,e)].
% 0.43/1.06 92 subactivity(tptp0,tptp0). [resolve(38,a,39,a)].
% 0.43/1.06 Derived: atocc(A,tptp0) | -atomic(tptp0) | -occurrence_of(A,tptp0). [resolve(92,a,85,b)].
% 0.43/1.06 Derived: -occurrence_of(A,tptp0) | -occurrence_of(B,tptp0) | subactivity_occurrence(A,B) | subactivity_occurrence(f13(tptp0,tptp0,A,B),B). [resolve(92,a,90,c)].
% 0.43/1.06 Derived: -occurrence_of(A,tptp0) | -occurrence_of(B,tptp0) | subactivity_occurrence(A,B) | -subactivity_occurrence(f13(tptp0,tptp0,A,B),A). [resolve(92,a,91,c)].
% 0.43/1.07 93 subactivity(A,A) | -occurrence_of(B,A). [resolve(38,a,40,b)].
% 0.43/1.07 Derived: -occurrence_of(A,B) | atocc(C,B) | -atomic(B) | -occurrence_of(C,B). [resolve(93,a,85,b)].
% 0.43/1.07 Derived: -occurrence_of(A,B) | -occurrence_of(C,B) | -occurrence_of(D,B) | subactivity_occurrence(C,D) | subactivity_occurrence(f13(B,B,C,D),D). [resolve(93,a,90,c)].
% 0.43/1.07 Derived: -occurrence_of(A,B) | -occurrence_of(C,B) | -occurrence_of(D,B) | subactivity_occurrence(C,D) | -subactivity_occurrence(f13(B,B,C,D),C). [resolve(93,a,91,c)].
% 0.43/1.07 94 -atocc(A,B) | -legal(A) | subactivity(f4(B,A),B). [resolve(42,c,45,a)].
% 0.43/1.07 Derived: -atocc(A,B) | -legal(A) | atocc(C,f4(B,A)) | -atomic(B) | -occurrence_of(C,B). [resolve(94,c,85,b)].
% 0.43/1.07 Derived: -atocc(A,B) | -legal(A) | -occurrence_of(C,f4(B,A)) | -occurrence_of(D,B) | subactivity_occurrence(C,D) | subactivity_occurrence(f13(f4(B,A),B,C,D),D). [resolve(94,c,90,c)].
% 0.43/1.07 Derived: -atocc(A,B) | -legal(A) | -occurrence_of(C,f4(B,A)) | -occurrence_of(D,B) | subactivity_occurrence(C,D) | -subactivity_occurrence(f13(f4(B,A),B,C,D),C). [resolve(94,c,91,c)].
% 0.43/1.07 95 -root_occ(A,B) | subactivity(f4(f14(A,B),A),f14(A,B)). [resolve(47,b,45,a)].
% 0.43/1.07 Derived: -root_occ(A,B) | atocc(C,f4(f14(A,B),A)) | -atomic(f14(A,B)) | -occurrence_of(C,f14(A,B)). [resolve(95,b,85,b)].
% 0.43/1.07 Derived: -root_occ(A,B) | -occurrence_of(C,f4(f14(A,B),A)) | -occurrence_of(D,f14(A,B)) | subactivity_occurrence(C,D) | subactivity_occurrence(f13(f4(f14(A,B),A),f14(A,B),C,D),D). [resolve(95,b,90,c)].
% 0.43/1.07 Derived: -root_occ(A,B) | -occurrence_of(C,f4(f14(A,B),A)) | -occurrence_of(D,f14(A,B)) | subactivity_occurrence(C,D) | -subactivity_occurrence(f13(f4(f14(A,B),A),f14(A,B),C,D),C). [resolve(95,b,91,c)].
% 0.43/1.07 96 -min_precedes(A,B,C) | subactivity(f4(C,f5(A,B,C)),C). [resolve(48,b,45,a)].
% 0.43/1.07 Derived: -min_precedes(A,B,C) | atocc(D,f4(C,f5(A,B,C))) | -atomic(C) | -occurrence_of(D,C). [resolve(96,b,85,b)].
% 0.43/1.07 Derived: -min_precedes(A,B,C) | -occurrence_of(D,f4(C,f5(A,B,C))) | -occurrence_of(E,C) | subactivity_occurrence(D,E) | subactivity_occurrence(f13(f4(C,f5(A,B,C)),C,D,E),E). [resolve(96,b,90,c)].
% 0.43/1.07 Derived: -min_precedes(A,B,C) | -occurrence_of(D,f4(C,f5(A,B,C))) | -occurrence_of(E,C) | subactivity_occurrence(D,E) | -subactivity_occurrence(f13(f4(C,f5(A,B,C)),C,D,E),D). [resolve(96,b,91,c)].
% 0.43/1.07 97 -occurrence_of(A,B) | atomic(B) | subactivity(f4(B,f12(B,A)),B). [resolve(51,c,45,a)].
% 0.43/1.07 Derived: -occurrence_of(A,B) | atomic(B) | -occurrence_of(C,f4(B,f12(B,A))) | -occurrence_of(D,B) | subactivity_occurrence(C,D) | subactivity_occurrence(f13(f4(B,f12(B,A)),B,C,D),D). [resolve(97,c,90,c)].
% 0.43/1.07 Derived: -occurrence_of(A,B) | atomic(B) | -occurrence_of(C,f4(B,f12(B,A))) | -occurrence_of(D,B) | subactivity_occurrence(C,D) | -subactivity_occurrence(f13(f4(B,f12(B,A)),B,C,D),C). [resolve(97,c,91,c)].
% 0.43/1.07 98 min_precedes(f6(A,f15(A,B)),A,f15(A,B)) | subactivity(f4(f15(A,B),A),f15(A,B)) | -leaf_occ(A,B). [resolve(61,a,55,b)].
% 0.43/1.07 Derived: min_precedes(f6(A,f15(A,B)),A,f15(A,B)) | -leaf_occ(A,B) | atocc(C,f4(f15(A,B),A)) | -atomic(f15(A,B)) | -occurrence_of(C,f15(A,B)). [resolve(98,b,85,b)].
% 28.91/29.20 Derived: min_precedes(f6(A,f15(A,B)),A,f15(A,B)) | -leaf_occ(A,B) | -occurrence_of(C,f4(f15(A,B),A)) | -occurrence_of(D,f15(A,B)) | subactivity_occurrence(C,D) | subactivity_occurrence(f13(f4(f15(A,B),A),f15(A,B),C,D),D). [resolve(98,b,90,c)].
% 28.91/29.20 Derived: min_precedes(f6(A,f15(A,B)),A,f15(A,B)) | -leaf_occ(A,B) | -occurrence_of(C,f4(f15(A,B),A)) | -occurrence_of(D,f15(A,B)) | subactivity_occurrence(C,D) | -subactivity_occurrence(f13(f4(f15(A,B),A),f15(A,B),C,D),C). [resolve(98,b,91,c)].
% 28.91/29.20 99 min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A) | min_precedes(f6(A,B),A,B) | subactivity(f4(B,A),B). [resolve(65,a,61,a)].
% 28.91/29.20 100 min_precedes(A,f7(A,f14(A,B)),f14(A,B)) | -root_occ(A,B) | min_precedes(f6(A,f14(A,B)),A,f14(A,B)) | subactivity(f4(f14(A,B),A),f14(A,B)). [resolve(66,a,61,a)].
% 28.91/29.20 101 min_precedes(f5(A,B,C),f7(f5(A,B,C),C),C) | -min_precedes(A,B,C) | min_precedes(f6(f5(A,B,C),C),f5(A,B,C),C) | subactivity(f4(C,f5(A,B,C)),C). [resolve(67,a,61,a)].
% 28.91/29.20 102 min_precedes(f12(A,B),f7(f12(A,B),A),A) | -occurrence_of(B,A) | atomic(A) | min_precedes(f6(f12(A,B),A),f12(A,B),A) | subactivity(f4(A,f12(A,B)),A). [resolve(68,a,61,a)].
% 28.91/29.20 103 subactivity(f1(A),f1(A)) | -occurrence_of(A,B). [resolve(78,b,75,b)].
% 28.91/29.20 104 subactivity(f1(A),f1(A)) | -subactivity_occurrence(A,B). [resolve(78,b,76,b)].
% 28.91/29.20 105 subactivity(f1(A),f1(A)) | -subactivity_occurrence(B,A). [resolve(78,b,77,b)].
% 28.91/29.20
% 28.91/29.20 ============================== end predicate elimination =============
% 28.91/29.20
% 28.91/29.20 Auto_denials: (non-Horn, no changes).
% 28.91/29.20
% 28.91/29.20 Term ordering decisions:
% 28.91/29.20 Function symbol KB weights: tptp0=1. tptp1=1. tptp2=1. tptp3=1. tptp4=1. c1=1. f4=1. f6=1. f7=1. f9=1. f11=1. f12=1. f14=1. f15=1. f1=1. f16=1. f17=1. f18=1. f2=1. f3=1. f5=1. f8=1. f10=1. f13=1.
% 28.91/29.20
% 28.91/29.20 ============================== end of process initial clauses ========
% 28.91/29.20
% 28.91/29.20 ============================== CLAUSES FOR SEARCH ====================
% 28.91/29.20
% 28.91/29.20 ============================== end of clauses for search =============
% 28.91/29.20
% 28.91/29.20 ============================== SEARCH ================================
% 28.91/29.20
% 28.91/29.20 % Starting search at 0.05 seconds.
% 28.91/29.20
% 28.91/29.20 Low Water (keep): wt=51.000, iters=3844
% 28.91/29.20
% 28.91/29.20 Low Water (keep): wt=48.000, iters=3679
% 28.91/29.20
% 28.91/29.20 Low Water (keep): wt=44.000, iters=3431
% 28.91/29.20
% 28.91/29.20 Low Water (keep): wt=43.000, iters=3381
% 28.91/29.20
% 28.91/29.20 Low Water (keep): wt=41.000, iters=3430
% 28.91/29.20
% 28.91/29.20 Low Water (keep): wt=40.000, iters=3379
% 28.91/29.20
% 28.91/29.20 Low Water (keep): wt=39.000, iters=3367
% 28.91/29.20
% 28.91/29.20 Low Water (keep): wt=37.000, iters=3359
% 28.91/29.20
% 28.91/29.20 Low Water (keep): wt=36.000, iters=3541
% 28.91/29.20
% 28.91/29.20 Low Water (keep): wt=35.000, iters=3381
% 28.91/29.20
% 28.91/29.20 Low Water (keep): wt=34.000, iters=3483
% 28.91/29.20
% 28.91/29.20 Low Water (keep): wt=33.000, iters=3897
% 28.91/29.20
% 28.91/29.20 Low Water (keep): wt=31.000, iters=3702
% 28.91/29.20
% 28.91/29.20 Low Water (keep): wt=30.000, iters=3587
% 28.91/29.20
% 28.91/29.20 Low Water (keep): wt=29.000, iters=3382
% 28.91/29.20
% 28.91/29.20 Low Water (keep): wt=28.000, iters=3333
% 28.91/29.20
% 28.91/29.20 Low Water (keep): wt=27.000, iters=3672
% 28.91/29.20
% 28.91/29.20 Low Water (keep): wt=26.000, iters=3439
% 28.91/29.20
% 28.91/29.20 Low Water (keep): wt=25.000, iters=3387
% 28.91/29.20
% 28.91/29.20 ============================== PROOF =================================
% 28.91/29.20 % SZS status Theorem
% 28.91/29.20 % SZS output start Refutation
% 28.91/29.20
% 28.91/29.20 % Proof 1 at 27.81 (+ 0.36) seconds.
% 28.91/29.20 % Length of proof is 117.
% 28.91/29.20 % Level of proof is 20.
% 28.91/29.20 % Maximum clause weight is 32.000.
% 28.91/29.20 % Given clauses 14258.
% 28.91/29.20
% 28.91/29.20 1 (all X0 all X1 (occurrence_of(X1,X0) -> activity(X0) & activity_occurrence(X1))) # label(sos) # label(axiom) # label(non_clause). [assumption].
% 28.91/29.20 2 (all X2 (activity_occurrence(X2) -> (exists X3 (activity(X3) & occurrence_of(X2,X3))))) # label(sos_01) # label(axiom) # label(non_clause). [assumption].
% 28.91/29.20 3 (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].
% 28.91/29.20 4 (all X7 (activity(X7) -> subactivity(X7,X7))) # label(sos_03) # label(axiom) # label(non_clause). [assumption].
% 28.91/29.20 8 (all X16 all X17 (occurrence_of(X16,X17) -> (arboreal(X16) <-> atomic(X17)))) # label(sos_07) # label(axiom) # label(non_clause). [assumption].
% 28.91/29.20 9 (all X18 (legal(X18) -> arboreal(X18))) # label(sos_08) # label(axiom) # label(non_clause). [assumption].
% 28.91/29.20 11 (all X21 all X22 (precedes(X21,X22) <-> earlier(X21,X22) & legal(X22))) # label(sos_10) # label(axiom) # label(non_clause). [assumption].
% 28.91/29.20 13 (all X28 all X29 (root(X29,X28) -> (exists X30 (subactivity(X30,X28) & atocc(X29,X30))))) # label(sos_12) # label(axiom) # label(non_clause). [assumption].
% 28.91/29.20 15 (all X35 all X36 all X37 (min_precedes(X35,X36,X37) -> -root(X36,X37))) # label(sos_14) # label(axiom) # label(non_clause). [assumption].
% 28.91/29.20 16 (all X38 all X39 all X40 (min_precedes(X38,X39,X40) -> precedes(X38,X39))) # label(sos_15) # label(axiom) # label(non_clause). [assumption].
% 28.91/29.20 18 (all X43 all X44 (atocc(X43,X44) & legal(X43) -> root(X43,X44))) # label(sos_17) # label(axiom) # label(non_clause). [assumption].
% 28.91/29.20 24 (all X64 all X65 (atocc(X64,X65) <-> (exists X66 (subactivity(X65,X66) & atomic(X66) & occurrence_of(X64,X66))))) # label(sos_23) # label(axiom) # label(non_clause). [assumption].
% 28.91/29.20 25 (all X67 all X68 (subactivity_occurrence(X67,X68) -> activity_occurrence(X67) & activity_occurrence(X68))) # label(sos_24) # label(axiom) # label(non_clause). [assumption].
% 28.91/29.20 26 (all X69 all X70 all X71 (min_precedes(X70,X71,X69) -> (exists X72 (occurrence_of(X72,X69) & subactivity_occurrence(X70,X72) & subactivity_occurrence(X71,X72))))) # label(sos_25) # label(axiom) # label(non_clause). [assumption].
% 28.91/29.20 29 (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(X81,X82,X79) | min_precedes(X82,X81,X79) | X81 = X82)) # label(sos_28) # label(axiom) # label(non_clause). [assumption].
% 28.91/29.20 30 (all X83 all X84 all X85 all X86 (min_precedes(X83,X84,X85) & occurrence_of(X86,X85) & subactivity_occurrence(X84,X86) -> subactivity_occurrence(X83,X86))) # label(sos_29) # label(axiom) # label(non_clause). [assumption].
% 28.91/29.20 34 (all X99 all X100 (root_occ(X99,X100) <-> (exists X101 (occurrence_of(X100,X101) & subactivity_occurrence(X99,X100) & root(X99,X101))))) # label(sos_33) # label(axiom) # label(non_clause). [assumption].
% 28.91/29.20 36 (all X105 (occurrence_of(X105,tptp0) -> (exists X106 exists X107 exists X108 (occurrence_of(X106,tptp3) & root_occ(X106,X105) & occurrence_of(X107,tptp4) & min_precedes(X106,X107,tptp0) & (occurrence_of(X108,tptp2) | occurrence_of(X108,tptp1)) & min_precedes(X107,X108,tptp0) & (all X109 (min_precedes(X106,X109,tptp0) -> X109 = X107 | X109 = X108)))))) # label(sos_35) # label(axiom) # label(non_clause). [assumption].
% 28.91/29.20 37 -(all X110 (occurrence_of(X110,tptp0) -> (exists X111 exists X112 (occurrence_of(X111,tptp3) & root_occ(X111,X110) & (occurrence_of(X112,tptp2) | occurrence_of(X112,tptp1)) & min_precedes(X111,X112,tptp0))))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 28.91/29.20 38 -activity(A) | subactivity(A,A) # label(sos_03) # label(axiom). [clausify(4)].
% 28.91/29.20 40 -occurrence_of(A,B) | activity(B) # label(sos) # label(axiom). [clausify(1)].
% 28.91/29.20 42 -atocc(A,B) | -legal(A) | root(A,B) # label(sos_17) # label(axiom). [clausify(18)].
% 28.91/29.20 43 -min_precedes(A,B,C) | -root(B,C) # label(sos_14) # label(axiom). [clausify(15)].
% 28.91/29.20 46 -root(A,B) | atocc(A,f4(B,A)) # label(sos_12) # label(axiom). [clausify(13)].
% 28.91/29.20 47 -root_occ(A,B) | root(A,f14(A,B)) # label(sos_33) # label(axiom). [clausify(34)].
% 28.91/29.20 74 -activity_occurrence(A) | occurrence_of(A,f1(A)) # label(sos_01) # label(axiom). [clausify(2)].
% 28.91/29.20 75 -occurrence_of(A,B) | activity_occurrence(A) # label(sos) # label(axiom). [clausify(1)].
% 28.91/29.20 76 -subactivity_occurrence(A,B) | activity_occurrence(A) # label(sos_24) # label(axiom). [clausify(25)].
% 28.91/29.20 79 -min_precedes(A,B,C) | precedes(A,B) # label(sos_15) # label(axiom). [clausify(16)].
% 28.91/29.20 80 -precedes(A,B) | legal(B) # label(sos_10) # label(axiom). [clausify(11)].
% 28.91/29.20 85 atocc(A,B) | -subactivity(B,C) | -atomic(C) | -occurrence_of(A,C) # label(sos_23) # label(axiom). [clausify(24)].
% 28.91/29.20 93 subactivity(A,A) | -occurrence_of(B,A). [resolve(38,a,40,b)].
% 28.91/29.20 107 atomic(tptp2) # label(sos_39) # label(axiom). [assumption].
% 28.91/29.20 109 atomic(tptp3) # label(sos_41) # label(axiom). [assumption].
% 28.91/29.20 110 occurrence_of(c1,tptp0) # label(goals) # label(negated_conjecture). [clausify(37)].
% 28.91/29.20 115 tptp3 != tptp2 # label(sos_45) # label(axiom). [assumption].
% 28.91/29.20 116 tptp3 != tptp1 # label(sos_46) # label(axiom). [assumption].
% 28.91/29.20 120 -occurrence_of(A,tptp3) | -root_occ(A,c1) | -occurrence_of(B,tptp2) | -min_precedes(A,B,tptp0) # label(goals) # label(negated_conjecture). [clausify(37)].
% 28.91/29.20 121 -occurrence_of(A,tptp3) | -root_occ(A,c1) | -occurrence_of(B,tptp1) | -min_precedes(A,B,tptp0) # label(goals) # label(negated_conjecture). [clausify(37)].
% 28.91/29.20 122 -legal(A) | arboreal(A) # label(sos_08) # label(axiom). [clausify(9)].
% 28.91/29.20 125 -occurrence_of(A,B) | -arboreal(A) | atomic(B) # label(sos_07) # label(axiom). [clausify(8)].
% 28.91/29.20 126 -occurrence_of(A,B) | arboreal(A) | -atomic(B) # label(sos_07) # label(axiom). [clausify(8)].
% 28.91/29.20 128 -atocc(A,B) | atomic(f9(A,B)) # label(sos_23) # label(axiom). [clausify(24)].
% 28.91/29.20 129 -occurrence_of(A,tptp0) | occurrence_of(f16(A),tptp3) # label(sos_35) # label(axiom). [clausify(36)].
% 28.91/29.20 130 -occurrence_of(A,tptp0) | root_occ(f16(A),A) # label(sos_35) # label(axiom). [clausify(36)].
% 28.91/29.20 132 -atocc(A,B) | occurrence_of(A,f9(A,B)) # label(sos_23) # label(axiom). [clausify(24)].
% 28.91/29.20 133 -root_occ(A,B) | occurrence_of(B,f14(A,B)) # label(sos_33) # label(axiom). [clausify(34)].
% 28.91/29.20 135 -occurrence_of(A,B) | -occurrence_of(A,C) | C = B # label(sos_02) # label(axiom). [clausify(3)].
% 28.91/29.20 138 -occurrence_of(A,tptp0) | min_precedes(f16(A),f17(A),tptp0) # label(sos_35) # label(axiom). [clausify(36)].
% 28.91/29.20 139 -occurrence_of(A,tptp0) | min_precedes(f17(A),f18(A),tptp0) # label(sos_35) # label(axiom). [clausify(36)].
% 28.91/29.20 142 -min_precedes(A,B,C) | occurrence_of(f10(C,A,B),C) # label(sos_25) # label(axiom). [clausify(26)].
% 28.91/29.20 143 -min_precedes(A,B,C) | subactivity_occurrence(A,f10(C,A,B)) # label(sos_25) # label(axiom). [clausify(26)].
% 28.91/29.20 144 -min_precedes(A,B,C) | subactivity_occurrence(B,f10(C,A,B)) # label(sos_25) # label(axiom). [clausify(26)].
% 28.91/29.20 147 -occurrence_of(A,tptp0) | occurrence_of(f18(A),tptp2) | occurrence_of(f18(A),tptp1) # label(sos_35) # label(axiom). [clausify(36)].
% 28.91/29.20 148 -min_precedes(A,B,C) | -occurrence_of(D,C) | -subactivity_occurrence(B,D) | subactivity_occurrence(A,D) # label(sos_29) # label(axiom). [clausify(30)].
% 28.91/29.20 152 -occurrence_of(A,B) | -arboreal(C) | -arboreal(D) | -subactivity_occurrence(C,A) | -subactivity_occurrence(D,A) | min_precedes(C,D,B) | min_precedes(D,C,B) | D = C # label(sos_28) # label(axiom). [clausify(29)].
% 28.91/29.20 154 -atocc(A,B) | -legal(A) | atocc(A,f4(B,A)). [resolve(42,c,46,a)].
% 28.91/29.20 155 -root_occ(A,B) | -min_precedes(C,A,f14(A,B)). [resolve(47,b,43,b)].
% 28.91/29.20 201 occurrence_of(A,f1(A)) | -occurrence_of(A,B). [resolve(74,a,75,b)].
% 28.91/29.20 202 occurrence_of(A,f1(A)) | -subactivity_occurrence(A,B). [resolve(74,a,76,b)].
% 28.91/29.20 204 -min_precedes(A,B,C) | legal(B). [resolve(79,b,80,a)].
% 28.91/29.20 222 -occurrence_of(A,B) | atocc(C,B) | -atomic(B) | -occurrence_of(C,B). [resolve(93,a,85,b)].
% 28.91/29.20 259 -occurrence_of(A,B) | atocc(A,B) | -atomic(B). [factor(222,a,d)].
% 28.91/29.20 268 occurrence_of(f16(c1),tptp3). [resolve(129,a,110,a)].
% 28.91/29.20 269 root_occ(f16(c1),c1). [resolve(130,a,110,a)].
% 28.91/29.20 271 -occurrence_of(c1,A) | tptp0 = A. [resolve(135,a,110,a),flip(b)].
% 28.91/29.20 272 min_precedes(f16(c1),f17(c1),tptp0). [resolve(138,a,110,a)].
% 28.91/29.20 273 min_precedes(f17(c1),f18(c1),tptp0). [resolve(139,a,110,a)].
% 28.91/29.20 275 occurrence_of(f18(c1),tptp2) | occurrence_of(f18(c1),tptp1). [resolve(147,a,110,a)].
% 28.91/29.20 289 occurrence_of(f16(c1),f1(f16(c1))). [resolve(268,a,201,b)].
% 28.91/29.20 290 -occurrence_of(f16(c1),A) | tptp3 = A. [resolve(268,a,135,b)].
% 28.91/29.20 291 arboreal(f16(c1)). [resolve(268,a,126,a),unit_del(b,109)].
% 28.91/29.20 301 occurrence_of(c1,f14(f16(c1),c1)). [resolve(269,a,133,a)].
% 28.91/29.20 407 -occurrence_of(A,tptp0) | -subactivity_occurrence(f17(c1),A) | subactivity_occurrence(f16(c1),A). [resolve(272,a,148,a)].
% 28.91/29.20 460 legal(f18(c1)). [resolve(273,a,204,a)].
% 28.91/29.20 479 subactivity_occurrence(f18(c1),f10(tptp0,f17(c1),f18(c1))). [resolve(273,a,144,a)].
% 28.91/29.20 480 subactivity_occurrence(f17(c1),f10(tptp0,f17(c1),f18(c1))). [resolve(273,a,143,a)].
% 28.91/29.20 481 occurrence_of(f10(tptp0,f17(c1),f18(c1)),tptp0). [resolve(273,a,142,a)].
% 28.91/29.20 487 arboreal(f18(c1)). [resolve(460,a,122,a)].
% 28.91/29.20 504 occurrence_of(f18(c1),tptp1) | atocc(f18(c1),tptp2). [resolve(275,a,259,a),unit_del(c,107)].
% 28.91/29.20 524 f14(f16(c1),c1) = tptp0. [resolve(301,a,271,a),flip(a)].
% 28.91/29.20 571 -min_precedes(A,f16(c1),tptp0). [para(524(a,1),155(b,3)),unit_del(a,269)].
% 28.91/29.20 624 f1(f16(c1)) = tptp3. [resolve(290,a,289,a),flip(a)].
% 28.91/29.20 850 occurrence_of(f18(c1),tptp1) | atomic(f9(f18(c1),tptp2)). [resolve(504,b,128,a)].
% 28.91/29.20 990 occurrence_of(f18(c1),f1(f18(c1))). [resolve(479,a,202,b)].
% 28.91/29.20 991 -occurrence_of(f10(tptp0,f17(c1),f18(c1)),A) | -arboreal(B) | -subactivity_occurrence(B,f10(tptp0,f17(c1),f18(c1))) | min_precedes(B,f18(c1),A) | min_precedes(f18(c1),B,A) | f18(c1) = B. [resolve(479,a,152,e),unit_del(c,487)].
% 28.91/29.20 997 atocc(f18(c1),f1(f18(c1))) | -atomic(f1(f18(c1))). [resolve(990,a,259,a)].
% 28.91/29.20 1004 -occurrence_of(f18(c1),A) | f1(f18(c1)) = A. [resolve(990,a,135,b)].
% 28.91/29.20 1005 atomic(f1(f18(c1))). [resolve(990,a,125,a),unit_del(a,487)].
% 28.91/29.20 1006 atocc(f18(c1),f1(f18(c1))). [back_unit_del(997),unit_del(b,1005)].
% 28.91/29.20 1163 f1(f18(c1)) = tptp1 | atomic(f9(f18(c1),tptp2)). [resolve(1004,a,850,a)].
% 28.91/29.20 1164 f1(f18(c1)) = tptp2 | occurrence_of(f18(c1),tptp1). [resolve(1004,a,275,a)].
% 28.91/29.20 1256 f1(f18(c1)) = tptp2 | f1(f18(c1)) = tptp1. [resolve(1164,b,1004,a)].
% 28.91/29.20 1615 f1(f18(c1)) = tptp1 | occurrence_of(f18(c1),tptp2). [para(1256(a,1),990(a,2))].
% 28.91/29.20 1616 f1(f18(c1)) = tptp1 | atocc(f18(c1),tptp2). [para(1256(a,1),1006(a,2))].
% 28.91/29.20 1627 f1(f18(c1)) = tptp1 | -occurrence_of(f18(c1),A) | tptp2 = A. [resolve(1615,b,135,b)].
% 28.91/29.20 1638 f1(f18(c1)) = tptp1 | occurrence_of(f18(c1),f9(f18(c1),tptp2)). [resolve(1616,b,132,a)].
% 28.91/29.20 1665 subactivity_occurrence(f16(c1),f10(tptp0,f17(c1),f18(c1))). [resolve(407,b,480,a),unit_del(a,481)].
% 28.91/29.20 3153 f1(f18(c1)) = tptp1 | atocc(f18(c1),f9(f18(c1),tptp2)) | -atomic(f9(f18(c1),tptp2)). [resolve(1638,b,259,a)].
% 28.91/29.20 11635 -occurrence_of(f10(tptp0,f17(c1),f18(c1)),A) | min_precedes(f16(c1),f18(c1),A) | min_precedes(f18(c1),f16(c1),A) | f18(c1) = f16(c1). [resolve(991,c,1665,a),unit_del(b,291)].
% 28.91/29.20 13441 f1(f18(c1)) = tptp1 | atocc(f18(c1),f9(f18(c1),tptp2)). [resolve(3153,c,1163,b),merge(c)].
% 28.91/29.20 13451 f1(f18(c1)) = tptp1 | occurrence_of(f18(c1),f9(f18(c1),f9(f18(c1),tptp2))). [resolve(13441,b,132,a)].
% 28.91/29.20 13452 f1(f18(c1)) = tptp1 | atomic(f9(f18(c1),f9(f18(c1),tptp2))). [resolve(13441,b,128,a)].
% 28.91/29.20 13498 f1(f18(c1)) = tptp1 | atocc(f18(c1),f9(f18(c1),f9(f18(c1),tptp2))) | -atomic(f9(f18(c1),f9(f18(c1),tptp2))). [resolve(13451,b,259,a)].
% 28.91/29.20 25935 f1(f18(c1)) = tptp1 | atocc(f18(c1),f9(f18(c1),f9(f18(c1),tptp2))). [resolve(13498,c,13452,b),merge(c)].
% 28.91/29.20 25937 f1(f18(c1)) = tptp1 | atocc(f18(c1),f4(f9(f18(c1),f9(f18(c1),tptp2)),f18(c1))). [resolve(25935,b,154,a),unit_del(b,460)].
% 28.91/29.20 25941 f1(f18(c1)) = tptp1 | atocc(f18(c1),f4(f4(f9(f18(c1),f9(f18(c1),tptp2)),f18(c1)),f18(c1))). [resolve(25937,b,154,a),unit_del(b,460)].
% 28.91/29.20 25957 f1(f18(c1)) = tptp1 | occurrence_of(f18(c1),f9(f18(c1),f4(f4(f9(f18(c1),f9(f18(c1),tptp2)),f18(c1)),f18(c1)))). [resolve(25941,b,132,a)].
% 28.91/29.20 31717 f1(f18(c1)) = tptp1 | f9(f18(c1),f4(f4(f9(f18(c1),f9(f18(c1),tptp2)),f18(c1)),f18(c1))) = tptp2. [resolve(25957,b,1627,b),flip(c),merge(b)].
% 28.91/29.20 31718 f1(f18(c1)) = tptp1 | f9(f18(c1),f4(f4(f9(f18(c1),f9(f18(c1),tptp2)),f18(c1)),f18(c1))) = f1(f18(c1)). [resolve(25957,b,1004,a),flip(b)].
% 28.91/29.20 32680 min_precedes(f16(c1),f18(c1),tptp0) | f18(c1) = f16(c1). [resolve(11635,a,481,a),unit_del(b,571)].
% 28.91/29.20 32717 f18(c1) = f16(c1) | -occurrence_of(f18(c1),tptp1). [resolve(32680,a,121,d),unit_del(b,268),unit_del(c,269)].
% 28.91/29.20 32718 f18(c1) = f16(c1) | -occurrence_of(f18(c1),tptp2). [resolve(32680,a,120,d),unit_del(b,268),unit_del(c,269)].
% 28.91/29.20 32764 f18(c1) = f16(c1) | occurrence_of(f18(c1),tptp1). [resolve(32718,b,275,a)].
% 28.91/29.20 32765 f18(c1) = f16(c1). [resolve(32764,b,32717,b),merge(b)].
% 28.91/29.20 33118 f9(f16(c1),f4(f4(f9(f16(c1),f9(f16(c1),tptp2)),f16(c1)),f16(c1))) = tptp3. [back_rewrite(31718),rewrite([32765(2),624(3),32765(5),32765(7),32765(9),32765(14),32765(17),32765(21),624(22)]),unit_del(a,116)].
% 28.91/29.20 33119 $F. [back_rewrite(31717),rewrite([32765(2),624(3),32765(5),32765(7),32765(9),32765(14),32765(17),33118(19)]),unit_del(a,116),unit_del(b,115)].
% 28.91/29.20
% 28.91/29.20 % SZS output end Refutation
% 28.91/29.20 ============================== end of proof ==========================
% 28.91/29.20
% 28.91/29.20 ============================== STATISTICS ============================
% 28.91/29.20
% 28.91/29.20 Given=14258. Generated=639398. Kept=33008. proofs=1.
% 28.91/29.20 Usable=9792. Sos=5921. Demods=268. Limbo=354, Disabled=17159. Hints=0.
% 28.91/29.20 Megabytes=45.73.
% 28.91/29.20 User_CPU=27.81, System_CPU=0.36, Wall_clock=28.
% 28.91/29.20
% 28.91/29.20 ============================== end of statistics =====================
% 28.91/29.20
% 28.91/29.20 ============================== end of search =========================
% 28.91/29.20
% 28.91/29.20 THEOREM PROVED
% 28.91/29.20 % SZS status Theorem
% 28.91/29.20
% 28.91/29.20 Exiting with 1 proof.
% 28.91/29.20
% 28.91/29.20 Process 5800 exit (max_proofs) Mon Jun 13 01:14:51 2022
% 28.91/29.20 Prover9 interrupted
%------------------------------------------------------------------------------