TSTP Solution File: PRO005+4 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PRO005+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n019.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:06 EDT 2022
% Result : Theorem 2.72s 3.04s
% Output : Refutation 2.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : PRO005+4 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n019.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 02:42:25 EDT 2022
% 0.19/0.35 % CPUTime :
% 0.45/1.03 ============================== Prover9 ===============================
% 0.45/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.03 Process 12693 was started by sandbox2 on n019.cluster.edu,
% 0.45/1.03 Mon Jun 13 02:42:25 2022
% 0.45/1.03 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_12529_n019.cluster.edu".
% 0.45/1.03 ============================== end of head ===========================
% 0.45/1.03
% 0.45/1.03 ============================== INPUT =================================
% 0.45/1.03
% 0.45/1.03 % Reading from file /tmp/Prover9_12529_n019.cluster.edu
% 0.45/1.03
% 0.45/1.03 set(prolog_style_variables).
% 0.45/1.03 set(auto2).
% 0.45/1.03 % set(auto2) -> set(auto).
% 0.45/1.03 % set(auto) -> set(auto_inference).
% 0.45/1.03 % set(auto) -> set(auto_setup).
% 0.45/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.03 % set(auto) -> set(auto_limits).
% 0.45/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.03 % set(auto) -> set(auto_denials).
% 0.45/1.03 % set(auto) -> set(auto_process).
% 0.45/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.45/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.45/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.45/1.03 % set(auto2) -> assign(stats, some).
% 0.45/1.03 % set(auto2) -> clear(echo_input).
% 0.45/1.03 % set(auto2) -> set(quiet).
% 0.45/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.03 % set(auto2) -> clear(print_given).
% 0.45/1.03 assign(lrs_ticks,-1).
% 0.45/1.03 assign(sos_limit,10000).
% 0.45/1.03 assign(order,kbo).
% 0.45/1.03 set(lex_order_vars).
% 0.45/1.03 clear(print_given).
% 0.45/1.03
% 0.45/1.03 % formulas(sos). % not echoed (48 formulas)
% 0.45/1.03
% 0.45/1.03 ============================== end of input ==========================
% 0.45/1.03
% 0.45/1.03 % From the command line: assign(max_seconds, 300).
% 0.45/1.03
% 0.45/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.03
% 0.45/1.03 % Formulas that are not ordinary clauses:
% 0.45/1.03 1 (all X0 all X1 (occurrence_of(X1,X0) & -atomic(X0) -> (exists X2 (root(X2,X0) & subactivity_occurrence(X2,X1))))) # label(sos) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 2 (all X3 all X4 all X5 all X6 all X7 (occurrence_of(X4,X3) & root_occ(X6,X4) & leaf_occ(X7,X4) & subactivity_occurrence(X5,X4) & min_precedes(X6,X5,X3) & X5 != X7 -> min_precedes(X5,X7,X3))) # label(sos_01) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 3 (all X8 all X9 all X10 all X11 (occurrence_of(X9,X8) & subactivity_occurrence(X10,X9) & leaf_occ(X11,X9) & arboreal(X10) & -min_precedes(X10,X11,X8) -> X11 = X10)) # label(sos_02) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 4 (all X12 all X13 (occurrence_of(X13,X12) -> activity(X12) & activity_occurrence(X13))) # label(sos_03) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 5 (all X14 all X15 all X16 all X17 (occurrence_of(X15,X14) & arboreal(X16) & arboreal(X17) & subactivity_occurrence(X16,X15) & subactivity_occurrence(X17,X15) -> min_precedes(X16,X17,X14) | min_precedes(X17,X16,X14) | X16 = X17)) # label(sos_04) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 6 (all X18 all X19 (root(X19,X18) -> (exists X20 (subactivity(X20,X18) & atocc(X19,X20))))) # label(sos_05) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 7 (all X21 all X22 all X23 (min_precedes(X22,X23,X21) -> (exists X24 (occurrence_of(X24,X21) & subactivity_occurrence(X22,X24) & subactivity_occurrence(X23,X24))))) # label(sos_06) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 8 (all X25 all X26 (leaf(X25,X26) & -atomic(X26) -> (exists X27 (occurrence_of(X27,X26) & leaf_occ(X25,X27))))) # label(sos_07) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 9 (all X28 all X29 all X30 (occurrence_of(X28,X29) & occurrence_of(X28,X30) -> X29 = X30)) # label(sos_08) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 10 (all X31 all X32 all X33 (occurrence_of(X31,X33) & leaf_occ(X32,X31) -> -(exists X34 min_precedes(X32,X34,X33)))) # label(sos_09) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 11 (all X35 all X36 all X37 (occurrence_of(X35,X37) & root_occ(X36,X35) -> -(exists X38 min_precedes(X38,X36,X37)))) # label(sos_10) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 12 (all X39 all X40 (subactivity_occurrence(X39,X40) -> activity_occurrence(X39) & activity_occurrence(X40))) # label(sos_11) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 13 (all X41 (activity_occurrence(X41) -> (exists X42 (activity(X42) & occurrence_of(X41,X42))))) # label(sos_12) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 14 (all X43 (legal(X43) -> arboreal(X43))) # label(sos_13) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 15 (all X44 all X45 (atocc(X44,X45) <-> (exists X46 (subactivity(X45,X46) & atomic(X46) & occurrence_of(X44,X46))))) # label(sos_14) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 16 (all X47 all X48 (leaf(X47,X48) <-> (root(X47,X48) | (exists X49 min_precedes(X49,X47,X48))) & -(exists X50 min_precedes(X47,X50,X48)))) # label(sos_15) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 17 (all X51 all X52 (occurrence_of(X51,X52) -> (arboreal(X51) <-> atomic(X52)))) # label(sos_16) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 18 (all X53 all X54 (root(X53,X54) -> legal(X53))) # label(sos_17) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 19 (all X55 all X56 (leaf_occ(X55,X56) <-> (exists X57 (occurrence_of(X56,X57) & subactivity_occurrence(X55,X56) & leaf(X55,X57))))) # label(sos_18) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 20 (all X58 all X59 (root_occ(X58,X59) <-> (exists X60 (occurrence_of(X59,X60) & subactivity_occurrence(X58,X59) & root(X58,X60))))) # label(sos_19) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 21 (all X61 all X62 (earlier(X61,X62) -> -earlier(X62,X61))) # label(sos_20) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 22 (all X63 all X64 (precedes(X63,X64) <-> earlier(X63,X64) & legal(X64))) # label(sos_21) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 23 (all X65 all X66 all X67 (min_precedes(X65,X66,X67) -> -root(X66,X67))) # label(sos_22) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 24 (all X68 all X69 all X70 (min_precedes(X68,X69,X70) -> (exists X71 (root(X71,X70) & min_precedes(X71,X69,X70))))) # label(sos_23) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 25 (all X72 all X73 all X74 (min_precedes(X72,X73,X74) -> precedes(X72,X73))) # label(sos_24) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 26 (all X75 all X76 all X77 (next_subocc(X75,X76,X77) -> arboreal(X75) & arboreal(X76))) # label(sos_25) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 27 (all X78 all X79 all X80 (next_subocc(X78,X79,X80) <-> min_precedes(X78,X79,X80) & -(exists X81 (min_precedes(X78,X81,X80) & min_precedes(X81,X79,X80))))) # label(sos_26) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 28 (all X82 all X83 all X84 all X85 (min_precedes(X82,X83,X84) & occurrence_of(X85,X84) & subactivity_occurrence(X83,X85) -> subactivity_occurrence(X82,X85))) # label(sos_27) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 29 (all X86 all X87 all X88 all X89 (occurrence_of(X88,X89) & -atomic(X89) & leaf_occ(X86,X88) & leaf_occ(X87,X88) -> X86 = X87)) # label(sos_28) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 30 (all X90 all X91 all X92 all X93 (occurrence_of(X92,X93) & root_occ(X90,X92) & root_occ(X91,X92) -> X90 = X91)) # label(sos_29) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 31 (all X94 all X95 all X96 (earlier(X94,X95) & earlier(X95,X96) -> earlier(X94,X96))) # label(sos_30) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 32 (all X97 all X98 all X99 all X100 (min_precedes(X97,X98,X100) & min_precedes(X97,X99,X100) & precedes(X98,X99) -> min_precedes(X98,X99,X100))) # label(sos_31) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 33 (all X101 (occurrence_of(X101,tptp0) -> (exists X102 exists X103 (occurrence_of(X102,tptp4) & root_occ(X102,X101) & (occurrence_of(X103,tptp3) | occurrence_of(X103,tptp2)) & leaf_occ(X103,X101) & next_subocc(X102,X103,tptp0))))) # label(sos_32) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 34 (all X104 all X105 (occurrence_of(X105,tptp0) & subactivity_occurrence(X104,X105) & arboreal(X104) & -leaf_occ(X104,X105) -> root_occ(X104,X105))) # label(sos_45) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 35 (all X106 all X107 (occurrence_of(X107,tptp0) & subactivity_occurrence(X106,X107) & arboreal(X106) & -leaf_occ(X106,X107) -> (exists X108 (occurrence_of(X108,tptp1) & next_subocc(X106,X108,tptp0))))) # label(sos_46) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 36 --(exists X109 occurrence_of(X109,tptp0)) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.45/1.03
% 0.45/1.03 ============================== end of process non-clausal formulas ===
% 0.45/1.03
% 0.45/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.03
% 0.45/1.03 ============================== PREDICATE ELIMINATION =================
% 0.45/1.03 37 -leaf_occ(A,B) | leaf(A,f9(A,B)) # label(sos_18) # label(axiom). [clausify(19)].
% 0.45/1.03 38 -leaf(A,B) | -min_precedes(A,C,B) # label(sos_15) # label(axiom). [clausify(16)].
% 0.45/1.03 Derived: -leaf_occ(A,B) | -min_precedes(A,C,f9(A,B)). [resolve(37,b,38,a)].
% 0.45/1.03 39 -leaf(A,B) | atomic(B) | occurrence_of(f4(A,B),B) # label(sos_07) # label(axiom). [clausify(8)].
% 0.45/1.03 Derived: atomic(f9(A,B)) | occurrence_of(f4(A,f9(A,B)),f9(A,B)) | -leaf_occ(A,B). [resolve(39,a,37,b)].
% 0.45/1.03 40 -leaf(A,B) | atomic(B) | leaf_occ(A,f4(A,B)) # label(sos_07) # label(axiom). [clausify(8)].
% 0.45/1.03 Derived: atomic(f9(A,B)) | leaf_occ(A,f4(A,f9(A,B))) | -leaf_occ(A,B). [resolve(40,a,37,b)].
% 0.45/1.03 41 -leaf(A,B) | root(A,B) | min_precedes(f7(A,B),A,B) # label(sos_15) # label(axiom). [clausify(16)].
% 0.45/1.03 Derived: root(A,f9(A,B)) | min_precedes(f7(A,f9(A,B)),A,f9(A,B)) | -leaf_occ(A,B). [resolve(41,a,37,b)].
% 0.45/1.03 42 leaf(A,B) | -root(A,B) | min_precedes(A,f8(A,B),B) # label(sos_15) # label(axiom). [clausify(16)].
% 0.45/1.03 Derived: -root(A,B) | min_precedes(A,f8(A,B),B) | -min_precedes(A,C,B). [resolve(42,a,38,a)].
% 0.45/1.03 Derived: -root(A,B) | min_precedes(A,f8(A,B),B) | atomic(B) | occurrence_of(f4(A,B),B). [resolve(42,a,39,a)].
% 0.45/1.03 Derived: -root(A,B) | min_precedes(A,f8(A,B),B) | atomic(B) | leaf_occ(A,f4(A,B)). [resolve(42,a,40,a)].
% 0.45/1.03 43 leaf_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -leaf(A,C) # label(sos_18) # label(axiom). [clausify(19)].
% 0.45/1.03 Derived: leaf_occ(A,B) | -occurrence_of(B,f9(A,C)) | -subactivity_occurrence(A,B) | -leaf_occ(A,C). [resolve(43,d,37,b)].
% 0.45/1.03 Derived: leaf_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -root(A,C) | min_precedes(A,f8(A,C),C). [resolve(43,d,42,a)].
% 0.45/1.03 44 leaf(A,B) | -min_precedes(C,A,B) | min_precedes(A,f8(A,B),B) # label(sos_15) # label(axiom). [clausify(16)].
% 0.45/1.03 Derived: -min_precedes(A,B,C) | min_precedes(B,f8(B,C),C) | -min_precedes(B,D,C). [resolve(44,a,38,a)].
% 0.45/1.03 Derived: -min_precedes(A,B,C) | min_precedes(B,f8(B,C),C) | atomic(C) | occurrence_of(f4(B,C),C). [resolve(44,a,39,a)].
% 0.45/1.03 Derived: -min_precedes(A,B,C) | min_precedes(B,f8(B,C),C) | atomic(C) | leaf_occ(B,f4(B,C)). [resolve(44,a,40,a)].
% 0.45/1.03 Derived: -min_precedes(A,B,C) | min_precedes(B,f8(B,C),C) | root(B,C) | min_precedes(f7(B,C),B,C). [resolve(44,a,41,a)].
% 0.45/1.03 Derived: -min_precedes(A,B,C) | min_precedes(B,f8(B,C),C) | leaf_occ(B,D) | -occurrence_of(D,C) | -subactivity_occurrence(B,D). [resolve(44,a,43,d)].
% 0.45/1.03 45 -root_occ(A,B) | root(A,f10(A,B)) # label(sos_19) # label(axiom). [clausify(20)].
% 0.45/1.03 46 -min_precedes(A,B,C) | -root(B,C) # label(sos_22) # label(axiom). [clausify(23)].
% 0.45/1.03 47 -root(A,B) | legal(A) # label(sos_17) # label(axiom). [clausify(18)].
% 0.45/1.03 48 -root(A,B) | subactivity(f2(B,A),B) # label(sos_05) # label(axiom). [clausify(6)].
% 0.45/1.03 49 -root(A,B) | atocc(A,f2(B,A)) # label(sos_05) # label(axiom). [clausify(6)].
% 0.45/1.03 Derived: -root_occ(A,B) | -min_precedes(C,A,f10(A,B)). [resolve(45,b,46,b)].
% 0.45/1.03 Derived: -root_occ(A,B) | legal(A). [resolve(45,b,47,a)].
% 0.45/1.03 Derived: -root_occ(A,B) | subactivity(f2(f10(A,B),A),f10(A,B)). [resolve(45,b,48,a)].
% 0.45/1.03 Derived: -root_occ(A,B) | atocc(A,f2(f10(A,B),A)). [resolve(45,b,49,a)].
% 0.45/1.03 50 -occurrence_of(A,B) | atomic(B) | root(f1(B,A),B) # label(sos) # label(axiom). [clausify(1)].
% 0.45/1.03 Derived: -occurrence_of(A,B) | atomic(B) | -min_precedes(C,f1(B,A),B). [resolve(50,c,46,b)].
% 0.45/1.04 Derived: -occurrence_of(A,B) | atomic(B) | legal(f1(B,A)). [resolve(50,c,47,a)].
% 0.45/1.04 Derived: -occurrence_of(A,B) | atomic(B) | subactivity(f2(B,f1(B,A)),B). [resolve(50,c,48,a)].
% 0.45/1.04 Derived: -occurrence_of(A,B) | atomic(B) | atocc(f1(B,A),f2(B,f1(B,A))). [resolve(50,c,49,a)].
% 0.45/1.04 51 -min_precedes(A,B,C) | root(f11(A,B,C),C) # label(sos_23) # label(axiom). [clausify(24)].
% 0.45/1.04 Derived: -min_precedes(A,B,C) | -min_precedes(D,f11(A,B,C),C). [resolve(51,b,46,b)].
% 0.45/1.04 Derived: -min_precedes(A,B,C) | legal(f11(A,B,C)). [resolve(51,b,47,a)].
% 0.45/1.04 Derived: -min_precedes(A,B,C) | subactivity(f2(C,f11(A,B,C)),C). [resolve(51,b,48,a)].
% 0.45/1.04 Derived: -min_precedes(A,B,C) | atocc(f11(A,B,C),f2(C,f11(A,B,C))). [resolve(51,b,49,a)].
% 0.45/1.04 52 root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -root(A,C) # label(sos_19) # label(axiom). [clausify(20)].
% 0.45/1.04 Derived: root_occ(A,B) | -occurrence_of(B,f10(A,C)) | -subactivity_occurrence(A,B) | -root_occ(A,C). [resolve(52,d,45,b)].
% 0.45/1.04 Derived: root_occ(f1(A,B),C) | -occurrence_of(C,A) | -subactivity_occurrence(f1(A,B),C) | -occurrence_of(B,A) | atomic(A). [resolve(52,d,50,c)].
% 0.45/1.04 Derived: root_occ(f11(A,B,C),D) | -occurrence_of(D,C) | -subactivity_occurrence(f11(A,B,C),D) | -min_precedes(A,B,C). [resolve(52,d,51,b)].
% 0.45/1.04 53 root(A,f9(A,B)) | min_precedes(f7(A,f9(A,B)),A,f9(A,B)) | -leaf_occ(A,B). [resolve(41,a,37,b)].
% 0.45/1.04 Derived: min_precedes(f7(A,f9(A,B)),A,f9(A,B)) | -leaf_occ(A,B) | -min_precedes(C,A,f9(A,B)). [resolve(53,a,46,b)].
% 0.45/1.04 Derived: min_precedes(f7(A,f9(A,B)),A,f9(A,B)) | -leaf_occ(A,B) | legal(A). [resolve(53,a,47,a)].
% 0.45/1.04 Derived: min_precedes(f7(A,f9(A,B)),A,f9(A,B)) | -leaf_occ(A,B) | subactivity(f2(f9(A,B),A),f9(A,B)). [resolve(53,a,48,a)].
% 0.45/1.04 Derived: min_precedes(f7(A,f9(A,B)),A,f9(A,B)) | -leaf_occ(A,B) | atocc(A,f2(f9(A,B),A)). [resolve(53,a,49,a)].
% 0.45/1.04 Derived: min_precedes(f7(A,f9(A,B)),A,f9(A,B)) | -leaf_occ(A,B) | root_occ(A,C) | -occurrence_of(C,f9(A,B)) | -subactivity_occurrence(A,C). [resolve(53,a,52,d)].
% 0.45/1.04 54 -root(A,B) | min_precedes(A,f8(A,B),B) | -min_precedes(A,C,B). [resolve(42,a,38,a)].
% 0.45/1.04 Derived: min_precedes(A,f8(A,f10(A,B)),f10(A,B)) | -min_precedes(A,C,f10(A,B)) | -root_occ(A,B). [resolve(54,a,45,b)].
% 0.45/1.04 Derived: min_precedes(f1(A,B),f8(f1(A,B),A),A) | -min_precedes(f1(A,B),C,A) | -occurrence_of(B,A) | atomic(A). [resolve(54,a,50,c)].
% 0.45/1.04 Derived: min_precedes(f11(A,B,C),f8(f11(A,B,C),C),C) | -min_precedes(f11(A,B,C),D,C) | -min_precedes(A,B,C). [resolve(54,a,51,b)].
% 0.45/1.04 Derived: min_precedes(A,f8(A,f9(A,B)),f9(A,B)) | -min_precedes(A,C,f9(A,B)) | min_precedes(f7(A,f9(A,B)),A,f9(A,B)) | -leaf_occ(A,B). [resolve(54,a,53,a)].
% 0.45/1.04 55 -root(A,B) | min_precedes(A,f8(A,B),B) | atomic(B) | occurrence_of(f4(A,B),B). [resolve(42,a,39,a)].
% 0.45/1.04 Derived: min_precedes(A,f8(A,f10(A,B)),f10(A,B)) | atomic(f10(A,B)) | occurrence_of(f4(A,f10(A,B)),f10(A,B)) | -root_occ(A,B). [resolve(55,a,45,b)].
% 0.45/1.04 Derived: min_precedes(f1(A,B),f8(f1(A,B),A),A) | atomic(A) | occurrence_of(f4(f1(A,B),A),A) | -occurrence_of(B,A) | atomic(A). [resolve(55,a,50,c)].
% 0.45/1.04 Derived: min_precedes(f11(A,B,C),f8(f11(A,B,C),C),C) | atomic(C) | occurrence_of(f4(f11(A,B,C),C),C) | -min_precedes(A,B,C). [resolve(55,a,51,b)].
% 0.45/1.04 Derived: min_precedes(A,f8(A,f9(A,B)),f9(A,B)) | atomic(f9(A,B)) | occurrence_of(f4(A,f9(A,B)),f9(A,B)) | min_precedes(f7(A,f9(A,B)),A,f9(A,B)) | -leaf_occ(A,B). [resolve(55,a,53,a)].
% 0.45/1.04 56 -root(A,B) | min_precedes(A,f8(A,B),B) | atomic(B) | leaf_occ(A,f4(A,B)). [resolve(42,a,40,a)].
% 0.45/1.04 Derived: min_precedes(A,f8(A,f10(A,B)),f10(A,B)) | atomic(f10(A,B)) | leaf_occ(A,f4(A,f10(A,B))) | -root_occ(A,B). [resolve(56,a,45,b)].
% 0.45/1.04 Derived: min_precedes(f1(A,B),f8(f1(A,B),A),A) | atomic(A) | leaf_occ(f1(A,B),f4(f1(A,B),A)) | -occurrence_of(B,A) | atomic(A). [resolve(56,a,50,c)].
% 0.45/1.04 Derived: min_precedes(f11(A,B,C),f8(f11(A,B,C),C),C) | atomic(C) | leaf_occ(f11(A,B,C),f4(f11(A,B,C),C)) | -min_precedes(A,B,C). [resolve(56,a,51,b)].
% 0.45/1.04 Derived: min_precedes(A,f8(A,f9(A,B)),f9(A,B)) | atomic(f9(A,B)) | leaf_occ(A,f4(A,f9(A,B))) | min_precedes(f7(A,f9(A,B)),A,f9(A,B)) | -leaf_occ(A,B). [resolve(56,a,53,a)].
% 0.45/1.04 57 leaf_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -root(A,C) | min_precedes(A,f8(A,C),C). [resolve(43,d,42,a)].
% 0.45/1.04 Derived: leaf_occ(A,B) | -occurrence_of(B,f10(A,C)) | -subactivity_occurrence(A,B) | min_precedes(A,f8(A,f10(A,C)),f10(A,C)) | -root_occ(A,C). [resolve(57,d,45,b)].
% 0.45/1.04 Derived: leaf_occ(f1(A,B),C) | -occurrence_of(C,A) | -subactivity_occurrence(f1(A,B),C) | min_precedes(f1(A,B),f8(f1(A,B),A),A) | -occurrence_of(B,A) | atomic(A). [resolve(57,d,50,c)].
% 0.45/1.04 Derived: leaf_occ(f11(A,B,C),D) | -occurrence_of(D,C) | -subactivity_occurrence(f11(A,B,C),D) | min_precedes(f11(A,B,C),f8(f11(A,B,C),C),C) | -min_precedes(A,B,C). [resolve(57,d,51,b)].
% 0.45/1.04 Derived: leaf_occ(A,B) | -occurrence_of(B,f9(A,C)) | -subactivity_occurrence(A,B) | min_precedes(A,f8(A,f9(A,C)),f9(A,C)) | min_precedes(f7(A,f9(A,C)),A,f9(A,C)) | -leaf_occ(A,C). [resolve(57,d,53,a)].
% 0.45/1.04 58 -min_precedes(A,B,C) | min_precedes(B,f8(B,C),C) | root(B,C) | min_precedes(f7(B,C),B,C). [resolve(44,a,41,a)].
% 0.45/1.04 Derived: -min_precedes(A,B,C) | min_precedes(B,f8(B,C),C) | min_precedes(f7(B,C),B,C) | -min_precedes(D,B,C). [resolve(58,c,46,b)].
% 0.45/1.04 59 -occurrence_of(A,tptp0) | next_subocc(f13(A),f14(A),tptp0) # label(sos_32) # label(axiom). [clausify(33)].
% 0.45/1.04 60 -next_subocc(A,B,C) | -min_precedes(A,D,C) | -min_precedes(D,B,C) # label(sos_26) # label(axiom). [clausify(27)].
% 0.45/1.04 61 -next_subocc(A,B,C) | arboreal(A) # label(sos_25) # label(axiom). [clausify(26)].
% 0.45/1.04 62 -next_subocc(A,B,C) | arboreal(B) # label(sos_25) # label(axiom). [clausify(26)].
% 0.45/1.04 63 -next_subocc(A,B,C) | min_precedes(A,B,C) # label(sos_26) # label(axiom). [clausify(27)].
% 0.45/1.04 Derived: -occurrence_of(A,tptp0) | -min_precedes(f13(A),B,tptp0) | -min_precedes(B,f14(A),tptp0). [resolve(59,b,60,a)].
% 0.45/1.04 Derived: -occurrence_of(A,tptp0) | arboreal(f13(A)). [resolve(59,b,61,a)].
% 0.45/1.04 Derived: -occurrence_of(A,tptp0) | arboreal(f14(A)). [resolve(59,b,62,a)].
% 0.45/1.04 Derived: -occurrence_of(A,tptp0) | min_precedes(f13(A),f14(A),tptp0). [resolve(59,b,63,a)].
% 0.45/1.04 64 next_subocc(A,B,C) | -min_precedes(A,B,C) | min_precedes(A,f12(A,B,C),C) # label(sos_26) # label(axiom). [clausify(27)].
% 0.45/1.04 Derived: -min_precedes(A,B,C) | min_precedes(A,f12(A,B,C),C) | -min_precedes(A,D,C) | -min_precedes(D,B,C). [resolve(64,a,60,a)].
% 0.45/1.04 Derived: -min_precedes(A,B,C) | min_precedes(A,f12(A,B,C),C) | arboreal(A). [resolve(64,a,61,a)].
% 0.45/1.04 Derived: -min_precedes(A,B,C) | min_precedes(A,f12(A,B,C),C) | arboreal(B). [resolve(64,a,62,a)].
% 0.45/1.04 65 next_subocc(A,B,C) | -min_precedes(A,B,C) | min_precedes(f12(A,B,C),B,C) # label(sos_26) # label(axiom). [clausify(27)].
% 0.45/1.04 Derived: -min_precedes(A,B,C) | min_precedes(f12(A,B,C),B,C) | -min_precedes(A,D,C) | -min_precedes(D,B,C). [resolve(65,a,60,a)].
% 0.45/1.04 Derived: -min_precedes(A,B,C) | min_precedes(f12(A,B,C),B,C) | arboreal(A). [resolve(65,a,61,a)].
% 0.45/1.04 Derived: -min_precedes(A,B,C) | min_precedes(f12(A,B,C),B,C) | arboreal(B). [resolve(65,a,62,a)].
% 0.45/1.04 66 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | next_subocc(B,f15(B,A),tptp0) # label(sos_46) # label(axiom). [clausify(35)].
% 0.45/1.04 Derived: -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | -min_precedes(B,C,tptp0) | -min_precedes(C,f15(B,A),tptp0). [resolve(66,e,60,a)].
% 0.45/1.04 Derived: -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | arboreal(f15(B,A)). [resolve(66,e,62,a)].
% 0.45/1.04 Derived: -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | min_precedes(B,f15(B,A),tptp0). [resolve(66,e,63,a)].
% 0.45/1.04 67 -precedes(A,B) | legal(B) # label(sos_21) # label(axiom). [clausify(22)].
% 0.45/1.04 68 -legal(A) | arboreal(A) # label(sos_13) # label(axiom). [clausify(14)].
% 0.45/1.04 Derived: -precedes(A,B) | arboreal(B). [resolve(67,b,68,a)].
% 0.45/1.04 69 precedes(A,B) | -earlier(A,B) | -legal(B) # label(sos_21) # label(axiom). [clausify(22)].
% 0.45/1.04 Derived: precedes(A,B) | -earlier(A,B) | -precedes(C,B). [resolve(69,c,67,b)].
% 0.45/1.04 70 -root_occ(A,B) | legal(A). [resolve(45,b,47,a)].
% 0.45/1.04 Derived: -root_occ(A,B) | arboreal(A). [resolve(70,b,68,a)].
% 0.45/1.04 Derived: -root_occ(A,B) | precedes(C,A) | -earlier(C,A). [resolve(70,b,69,c)].
% 0.45/1.05 71 -occurrence_of(A,B) | atomic(B) | legal(f1(B,A)). [resolve(50,c,47,a)].
% 0.45/1.05 Derived: -occurrence_of(A,B) | atomic(B) | arboreal(f1(B,A)). [resolve(71,c,68,a)].
% 0.45/1.05 Derived: -occurrence_of(A,B) | atomic(B) | precedes(C,f1(B,A)) | -earlier(C,f1(B,A)). [resolve(71,c,69,c)].
% 0.45/1.05 72 -min_precedes(A,B,C) | legal(f11(A,B,C)). [resolve(51,b,47,a)].
% 0.45/1.05 Derived: -min_precedes(A,B,C) | arboreal(f11(A,B,C)). [resolve(72,b,68,a)].
% 0.45/1.05 Derived: -min_precedes(A,B,C) | precedes(D,f11(A,B,C)) | -earlier(D,f11(A,B,C)). [resolve(72,b,69,c)].
% 0.45/1.05 73 min_precedes(f7(A,f9(A,B)),A,f9(A,B)) | -leaf_occ(A,B) | legal(A). [resolve(53,a,47,a)].
% 0.45/1.05 Derived: min_precedes(f7(A,f9(A,B)),A,f9(A,B)) | -leaf_occ(A,B) | arboreal(A). [resolve(73,c,68,a)].
% 0.45/1.05 Derived: min_precedes(f7(A,f9(A,B)),A,f9(A,B)) | -leaf_occ(A,B) | precedes(C,A) | -earlier(C,A). [resolve(73,c,69,c)].
% 0.45/1.05 74 -activity_occurrence(A) | occurrence_of(A,f5(A)) # label(sos_12) # label(axiom). [clausify(13)].
% 0.45/1.05 75 -occurrence_of(A,B) | activity_occurrence(A) # label(sos_03) # label(axiom). [clausify(4)].
% 0.45/1.05 76 -subactivity_occurrence(A,B) | activity_occurrence(A) # label(sos_11) # label(axiom). [clausify(12)].
% 0.45/1.05 77 -subactivity_occurrence(A,B) | activity_occurrence(B) # label(sos_11) # label(axiom). [clausify(12)].
% 0.45/1.05 Derived: occurrence_of(A,f5(A)) | -occurrence_of(A,B). [resolve(74,a,75,b)].
% 0.45/1.05 Derived: occurrence_of(A,f5(A)) | -subactivity_occurrence(A,B). [resolve(74,a,76,b)].
% 0.45/1.05 Derived: occurrence_of(A,f5(A)) | -subactivity_occurrence(B,A). [resolve(74,a,77,b)].
% 0.45/1.05 78 atocc(A,B) | -subactivity(B,C) | -atomic(C) | -occurrence_of(A,C) # label(sos_14) # label(axiom). [clausify(15)].
% 0.45/1.05 79 -atocc(A,B) | atomic(f6(A,B)) # label(sos_14) # label(axiom). [clausify(15)].
% 0.45/1.05 80 -atocc(A,B) | subactivity(B,f6(A,B)) # label(sos_14) # label(axiom). [clausify(15)].
% 0.45/1.05 81 -atocc(A,B) | occurrence_of(A,f6(A,B)) # label(sos_14) # label(axiom). [clausify(15)].
% 0.45/1.05 Derived: -subactivity(A,B) | -atomic(B) | -occurrence_of(C,B) | atomic(f6(C,A)). [resolve(78,a,79,a)].
% 0.45/1.05 Derived: -subactivity(A,B) | -atomic(B) | -occurrence_of(C,B) | subactivity(A,f6(C,A)). [resolve(78,a,80,a)].
% 0.45/1.05 Derived: -subactivity(A,B) | -atomic(B) | -occurrence_of(C,B) | occurrence_of(C,f6(C,A)). [resolve(78,a,81,a)].
% 0.45/1.05 82 -root_occ(A,B) | atocc(A,f2(f10(A,B),A)). [resolve(45,b,49,a)].
% 0.45/1.05 Derived: -root_occ(A,B) | atomic(f6(A,f2(f10(A,B),A))). [resolve(82,b,79,a)].
% 0.45/1.05 Derived: -root_occ(A,B) | subactivity(f2(f10(A,B),A),f6(A,f2(f10(A,B),A))). [resolve(82,b,80,a)].
% 0.45/1.05 Derived: -root_occ(A,B) | occurrence_of(A,f6(A,f2(f10(A,B),A))). [resolve(82,b,81,a)].
% 0.45/1.05 83 -occurrence_of(A,B) | atomic(B) | atocc(f1(B,A),f2(B,f1(B,A))). [resolve(50,c,49,a)].
% 0.45/1.05 Derived: -occurrence_of(A,B) | atomic(B) | atomic(f6(f1(B,A),f2(B,f1(B,A)))). [resolve(83,c,79,a)].
% 0.45/1.05 Derived: -occurrence_of(A,B) | atomic(B) | subactivity(f2(B,f1(B,A)),f6(f1(B,A),f2(B,f1(B,A)))). [resolve(83,c,80,a)].
% 0.45/1.05 Derived: -occurrence_of(A,B) | atomic(B) | occurrence_of(f1(B,A),f6(f1(B,A),f2(B,f1(B,A)))). [resolve(83,c,81,a)].
% 0.45/1.05 84 -min_precedes(A,B,C) | atocc(f11(A,B,C),f2(C,f11(A,B,C))). [resolve(51,b,49,a)].
% 0.45/1.05 Derived: -min_precedes(A,B,C) | atomic(f6(f11(A,B,C),f2(C,f11(A,B,C)))). [resolve(84,b,79,a)].
% 0.45/1.05 Derived: -min_precedes(A,B,C) | subactivity(f2(C,f11(A,B,C)),f6(f11(A,B,C),f2(C,f11(A,B,C)))). [resolve(84,b,80,a)].
% 0.45/1.05 Derived: -min_precedes(A,B,C) | occurrence_of(f11(A,B,C),f6(f11(A,B,C),f2(C,f11(A,B,C)))). [resolve(84,b,81,a)].
% 0.45/1.05 85 min_precedes(f7(A,f9(A,B)),A,f9(A,B)) | -leaf_occ(A,B) | atocc(A,f2(f9(A,B),A)). [resolve(53,a,49,a)].
% 0.45/1.05 Derived: min_precedes(f7(A,f9(A,B)),A,f9(A,B)) | -leaf_occ(A,B) | atomic(f6(A,f2(f9(A,B),A))). [resolve(85,c,79,a)].
% 0.45/1.05 Derived: min_precedes(f7(A,f9(A,B)),A,f9(A,B)) | -leaf_occ(A,B) | subactivity(f2(f9(A,B),A),f6(A,f2(f9(A,B),A))). [resolve(85,c,80,a)].
% 0.45/1.05 Derived: min_precedes(f7(A,f9(A,B)),A,f9(A,B)) | -leaf_occ(A,B) | occurrence_of(A,f6(A,f2(f9(A,B),A))). [resolve(85,c,81,a)].
% 0.45/1.05
% 0.45/1.05 ============================== end predicate elimination =============
% 0.45/1.05
% 0.45/1.05 Auto_denials: (non-Horn, no changes).
% 0.45/1.05
% 0.45/1.05 Term ordering decisions:
% 0.45/1.05 Function symbol KB weights: tptp0=1. tptp1=1. tptp2=1. tptp3=1. tptp4=1. c1=1. f1=1. f2=1. f4=1. f6=1. f7=1. f8=1. f9=1. f10=1. f15=1. f5=1. f13=1. f14=1. f3=1. f11=1. f12=1.
% 2.72/3.04
% 2.72/3.04 ============================== end of process initial clauses ========
% 2.72/3.04
% 2.72/3.04 ============================== CLAUSES FOR SEARCH ====================
% 2.72/3.04
% 2.72/3.04 ============================== end of clauses for search =============
% 2.72/3.04
% 2.72/3.04 ============================== SEARCH ================================
% 2.72/3.04
% 2.72/3.04 % Starting search at 0.04 seconds.
% 2.72/3.04
% 2.72/3.04 Low Water (keep): wt=113.000, iters=3610
% 2.72/3.04
% 2.72/3.04 Low Water (keep): wt=89.000, iters=3370
% 2.72/3.04
% 2.72/3.04 Low Water (keep): wt=88.000, iters=3357
% 2.72/3.04
% 2.72/3.04 Low Water (keep): wt=86.000, iters=3336
% 2.72/3.04
% 2.72/3.04 Low Water (keep): wt=84.000, iters=3561
% 2.72/3.04
% 2.72/3.04 Low Water (keep): wt=80.000, iters=3436
% 2.72/3.04
% 2.72/3.04 Low Water (keep): wt=78.000, iters=3366
% 2.72/3.04
% 2.72/3.04 ============================== PROOF =================================
% 2.72/3.04 % SZS status Theorem
% 2.72/3.04 % SZS output start Refutation
% 2.72/3.04
% 2.72/3.04 % Proof 1 at 2.00 (+ 0.02) seconds.
% 2.72/3.04 % Length of proof is 103.
% 2.72/3.04 % Level of proof is 21.
% 2.72/3.04 % Maximum clause weight is 52.000.
% 2.72/3.04 % Given clauses 2828.
% 2.72/3.04
% 2.72/3.04 4 (all X12 all X13 (occurrence_of(X13,X12) -> activity(X12) & activity_occurrence(X13))) # label(sos_03) # label(axiom) # label(non_clause). [assumption].
% 2.72/3.04 7 (all X21 all X22 all X23 (min_precedes(X22,X23,X21) -> (exists X24 (occurrence_of(X24,X21) & subactivity_occurrence(X22,X24) & subactivity_occurrence(X23,X24))))) # label(sos_06) # label(axiom) # label(non_clause). [assumption].
% 2.72/3.04 8 (all X25 all X26 (leaf(X25,X26) & -atomic(X26) -> (exists X27 (occurrence_of(X27,X26) & leaf_occ(X25,X27))))) # label(sos_07) # label(axiom) # label(non_clause). [assumption].
% 2.72/3.04 9 (all X28 all X29 all X30 (occurrence_of(X28,X29) & occurrence_of(X28,X30) -> X29 = X30)) # label(sos_08) # label(axiom) # label(non_clause). [assumption].
% 2.72/3.04 10 (all X31 all X32 all X33 (occurrence_of(X31,X33) & leaf_occ(X32,X31) -> -(exists X34 min_precedes(X32,X34,X33)))) # label(sos_09) # label(axiom) # label(non_clause). [assumption].
% 2.72/3.04 11 (all X35 all X36 all X37 (occurrence_of(X35,X37) & root_occ(X36,X35) -> -(exists X38 min_precedes(X38,X36,X37)))) # label(sos_10) # label(axiom) # label(non_clause). [assumption].
% 2.72/3.04 12 (all X39 all X40 (subactivity_occurrence(X39,X40) -> activity_occurrence(X39) & activity_occurrence(X40))) # label(sos_11) # label(axiom) # label(non_clause). [assumption].
% 2.72/3.04 13 (all X41 (activity_occurrence(X41) -> (exists X42 (activity(X42) & occurrence_of(X41,X42))))) # label(sos_12) # label(axiom) # label(non_clause). [assumption].
% 2.72/3.04 16 (all X47 all X48 (leaf(X47,X48) <-> (root(X47,X48) | (exists X49 min_precedes(X49,X47,X48))) & -(exists X50 min_precedes(X47,X50,X48)))) # label(sos_15) # label(axiom) # label(non_clause). [assumption].
% 2.72/3.04 19 (all X55 all X56 (leaf_occ(X55,X56) <-> (exists X57 (occurrence_of(X56,X57) & subactivity_occurrence(X55,X56) & leaf(X55,X57))))) # label(sos_18) # label(axiom) # label(non_clause). [assumption].
% 2.72/3.04 20 (all X58 all X59 (root_occ(X58,X59) <-> (exists X60 (occurrence_of(X59,X60) & subactivity_occurrence(X58,X59) & root(X58,X60))))) # label(sos_19) # label(axiom) # label(non_clause). [assumption].
% 2.72/3.04 26 (all X75 all X76 all X77 (next_subocc(X75,X76,X77) -> arboreal(X75) & arboreal(X76))) # label(sos_25) # label(axiom) # label(non_clause). [assumption].
% 2.72/3.04 27 (all X78 all X79 all X80 (next_subocc(X78,X79,X80) <-> min_precedes(X78,X79,X80) & -(exists X81 (min_precedes(X78,X81,X80) & min_precedes(X81,X79,X80))))) # label(sos_26) # label(axiom) # label(non_clause). [assumption].
% 2.72/3.04 29 (all X86 all X87 all X88 all X89 (occurrence_of(X88,X89) & -atomic(X89) & leaf_occ(X86,X88) & leaf_occ(X87,X88) -> X86 = X87)) # label(sos_28) # label(axiom) # label(non_clause). [assumption].
% 2.72/3.04 33 (all X101 (occurrence_of(X101,tptp0) -> (exists X102 exists X103 (occurrence_of(X102,tptp4) & root_occ(X102,X101) & (occurrence_of(X103,tptp3) | occurrence_of(X103,tptp2)) & leaf_occ(X103,X101) & next_subocc(X102,X103,tptp0))))) # label(sos_32) # label(axiom) # label(non_clause). [assumption].
% 2.72/3.04 34 (all X104 all X105 (occurrence_of(X105,tptp0) & subactivity_occurrence(X104,X105) & arboreal(X104) & -leaf_occ(X104,X105) -> root_occ(X104,X105))) # label(sos_45) # label(axiom) # label(non_clause). [assumption].
% 2.72/3.04 35 (all X106 all X107 (occurrence_of(X107,tptp0) & subactivity_occurrence(X106,X107) & arboreal(X106) & -leaf_occ(X106,X107) -> (exists X108 (occurrence_of(X108,tptp1) & next_subocc(X106,X108,tptp0))))) # label(sos_46) # label(axiom) # label(non_clause). [assumption].
% 2.72/3.04 36 --(exists X109 occurrence_of(X109,tptp0)) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 2.72/3.04 37 -leaf_occ(A,B) | leaf(A,f9(A,B)) # label(sos_18) # label(axiom). [clausify(19)].
% 2.72/3.04 39 -leaf(A,B) | atomic(B) | occurrence_of(f4(A,B),B) # label(sos_07) # label(axiom). [clausify(8)].
% 2.72/3.04 40 -leaf(A,B) | atomic(B) | leaf_occ(A,f4(A,B)) # label(sos_07) # label(axiom). [clausify(8)].
% 2.72/3.04 44 leaf(A,B) | -min_precedes(C,A,B) | min_precedes(A,f8(A,B),B) # label(sos_15) # label(axiom). [clausify(16)].
% 2.72/3.04 59 -occurrence_of(A,tptp0) | next_subocc(f13(A),f14(A),tptp0) # label(sos_32) # label(axiom). [clausify(33)].
% 2.72/3.04 61 -next_subocc(A,B,C) | arboreal(A) # label(sos_25) # label(axiom). [clausify(26)].
% 2.72/3.04 62 -next_subocc(A,B,C) | arboreal(B) # label(sos_25) # label(axiom). [clausify(26)].
% 2.72/3.04 63 -next_subocc(A,B,C) | min_precedes(A,B,C) # label(sos_26) # label(axiom). [clausify(27)].
% 2.72/3.04 66 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | next_subocc(B,f15(B,A),tptp0) # label(sos_46) # label(axiom). [clausify(35)].
% 2.72/3.04 74 -activity_occurrence(A) | occurrence_of(A,f5(A)) # label(sos_12) # label(axiom). [clausify(13)].
% 2.72/3.04 75 -occurrence_of(A,B) | activity_occurrence(A) # label(sos_03) # label(axiom). [clausify(4)].
% 2.72/3.04 76 -subactivity_occurrence(A,B) | activity_occurrence(A) # label(sos_11) # label(axiom). [clausify(12)].
% 2.72/3.04 90 occurrence_of(c1,tptp0) # label(goals) # label(negated_conjecture). [clausify(36)].
% 2.72/3.04 91 -atomic(tptp0) # label(sos_34) # label(axiom). [assumption].
% 2.72/3.04 95 tptp1 != tptp3 # label(sos_42) # label(axiom). [assumption].
% 2.72/3.04 96 tptp3 != tptp1. [copy(95),flip(a)].
% 2.72/3.04 97 tptp1 != tptp2 # label(sos_43) # label(axiom). [assumption].
% 2.72/3.04 98 tptp2 != tptp1. [copy(97),flip(a)].
% 2.72/3.04 101 -occurrence_of(A,B) | -leaf_occ(C,A) | -min_precedes(C,D,B) # label(sos_09) # label(axiom). [clausify(10)].
% 2.72/3.04 102 -occurrence_of(A,B) | -root_occ(C,A) | -min_precedes(D,C,B) # label(sos_10) # label(axiom). [clausify(11)].
% 2.72/3.04 103 -leaf_occ(A,B) | subactivity_occurrence(A,B) # label(sos_18) # label(axiom). [clausify(19)].
% 2.72/3.04 104 -root_occ(A,B) | subactivity_occurrence(A,B) # label(sos_19) # label(axiom). [clausify(20)].
% 2.72/3.04 110 -occurrence_of(A,tptp0) | root_occ(f13(A),A) # label(sos_32) # label(axiom). [clausify(33)].
% 2.72/3.04 111 -occurrence_of(A,tptp0) | leaf_occ(f14(A),A) # label(sos_32) # label(axiom). [clausify(33)].
% 2.72/3.04 112 -leaf_occ(A,B) | occurrence_of(B,f9(A,B)) # label(sos_18) # label(axiom). [clausify(19)].
% 2.72/3.04 114 -occurrence_of(A,B) | -occurrence_of(A,C) | C = B # label(sos_08) # label(axiom). [clausify(9)].
% 2.72/3.04 117 -min_precedes(A,B,C) | occurrence_of(f3(C,A,B),C) # label(sos_06) # label(axiom). [clausify(7)].
% 2.72/3.04 119 -min_precedes(A,B,C) | subactivity_occurrence(B,f3(C,A,B)) # label(sos_06) # label(axiom). [clausify(7)].
% 2.72/3.04 121 -occurrence_of(A,tptp0) | occurrence_of(f14(A),tptp3) | occurrence_of(f14(A),tptp2) # label(sos_32) # label(axiom). [clausify(33)].
% 2.72/3.04 124 -occurrence_of(A,B) | atomic(B) | -leaf_occ(C,A) | -leaf_occ(D,A) | D = C # label(sos_28) # label(axiom). [clausify(29)].
% 2.72/3.04 125 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | root_occ(B,A) # label(sos_45) # label(axiom). [clausify(34)].
% 2.72/3.04 127 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | occurrence_of(f15(B,A),tptp1) # label(sos_46) # label(axiom). [clausify(35)].
% 2.72/3.04 132 atomic(f9(A,B)) | occurrence_of(f4(A,f9(A,B)),f9(A,B)) | -leaf_occ(A,B). [resolve(39,a,37,b)].
% 2.72/3.04 136 -min_precedes(A,B,C) | min_precedes(B,f8(B,C),C) | atomic(C) | occurrence_of(f4(B,C),C). [resolve(44,a,39,a)].
% 2.72/3.04 137 -min_precedes(A,B,C) | min_precedes(B,f8(B,C),C) | atomic(C) | leaf_occ(B,f4(B,C)). [resolve(44,a,40,a)].
% 2.72/3.04 167 -occurrence_of(A,tptp0) | arboreal(f13(A)). [resolve(59,b,61,a)].
% 2.72/3.04 169 -occurrence_of(A,tptp0) | min_precedes(f13(A),f14(A),tptp0). [resolve(59,b,63,a)].
% 2.72/3.04 177 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | arboreal(f15(B,A)). [resolve(66,e,62,a)].
% 2.72/3.04 178 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | min_precedes(B,f15(B,A),tptp0). [resolve(66,e,63,a)].
% 2.72/3.04 189 occurrence_of(A,f5(A)) | -occurrence_of(A,B). [resolve(74,a,75,b)].
% 2.72/3.04 190 occurrence_of(A,f5(A)) | -subactivity_occurrence(A,B). [resolve(74,a,76,b)].
% 2.72/3.04 221 root_occ(f13(c1),c1). [resolve(110,a,90,a)].
% 2.72/3.04 229 arboreal(f13(c1)). [resolve(167,a,90,a)].
% 2.72/3.04 231 min_precedes(f13(c1),f14(c1),tptp0). [resolve(169,a,90,a)].
% 2.72/3.04 249 subactivity_occurrence(f13(c1),c1). [resolve(221,a,104,a)].
% 2.72/3.04 277 leaf_occ(f13(c1),c1) | min_precedes(f13(c1),f15(f13(c1),c1),tptp0). [resolve(249,a,178,b),unit_del(a,90),unit_del(b,229)].
% 2.72/3.04 278 leaf_occ(f13(c1),c1) | arboreal(f15(f13(c1),c1)). [resolve(249,a,177,b),unit_del(a,90),unit_del(b,229)].
% 2.72/3.04 282 leaf_occ(f13(c1),c1) | occurrence_of(f15(f13(c1),c1),tptp1). [resolve(249,a,127,b),unit_del(a,90),unit_del(b,229)].
% 2.72/3.04 346 -occurrence_of(A,tptp0) | -leaf_occ(f13(c1),A). [resolve(231,a,101,c)].
% 2.72/3.04 580 arboreal(f15(f13(c1),c1)). [resolve(278,a,346,b),unit_del(b,90)].
% 2.72/3.04 602 leaf_occ(f13(c1),c1) | min_precedes(f15(f13(c1),c1),f8(f15(f13(c1),c1),tptp0),tptp0) | leaf_occ(f15(f13(c1),c1),f4(f15(f13(c1),c1),tptp0)). [resolve(277,b,137,a),unit_del(c,91)].
% 2.72/3.04 603 leaf_occ(f13(c1),c1) | min_precedes(f15(f13(c1),c1),f8(f15(f13(c1),c1),tptp0),tptp0) | occurrence_of(f4(f15(f13(c1),c1),tptp0),tptp0). [resolve(277,b,136,a),unit_del(c,91)].
% 2.72/3.04 610 leaf_occ(f13(c1),c1) | subactivity_occurrence(f15(f13(c1),c1),f3(tptp0,f13(c1),f15(f13(c1),c1))). [resolve(277,b,119,a)].
% 2.72/3.04 612 leaf_occ(f13(c1),c1) | occurrence_of(f3(tptp0,f13(c1),f15(f13(c1),c1)),tptp0). [resolve(277,b,117,a)].
% 2.72/3.04 614 leaf_occ(f13(c1),c1) | -occurrence_of(A,tptp0) | -root_occ(f15(f13(c1),c1),A). [resolve(277,b,102,c)].
% 2.72/3.04 717 occurrence_of(f15(f13(c1),c1),tptp1). [resolve(282,a,346,b),unit_del(b,90)].
% 2.72/3.04 718 occurrence_of(f15(f13(c1),c1),f5(f15(f13(c1),c1))). [resolve(717,a,189,b)].
% 2.72/3.04 719 -occurrence_of(f15(f13(c1),c1),A) | tptp1 = A. [resolve(717,a,114,b)].
% 2.72/3.04 805 f5(f15(f13(c1),c1)) = tptp1. [resolve(718,a,719,a),flip(a)].
% 2.72/3.04 1632 occurrence_of(f3(tptp0,f13(c1),f15(f13(c1),c1)),tptp0). [resolve(612,a,346,b),unit_del(b,90)].
% 2.72/3.04 2376 leaf_occ(f13(c1),c1) | leaf_occ(f15(f13(c1),c1),f4(f15(f13(c1),c1),tptp0)) | -occurrence_of(A,tptp0) | -leaf_occ(f15(f13(c1),c1),A). [resolve(602,b,101,c)].
% 2.72/3.04 2425 leaf_occ(f13(c1),c1) | occurrence_of(f4(f15(f13(c1),c1),tptp0),tptp0) | -occurrence_of(A,tptp0) | -leaf_occ(f15(f13(c1),c1),A). [resolve(603,b,101,c)].
% 2.72/3.04 2445 leaf_occ(f13(c1),c1) | leaf_occ(f15(f13(c1),c1),f3(tptp0,f13(c1),f15(f13(c1),c1))) | root_occ(f15(f13(c1),c1),f3(tptp0,f13(c1),f15(f13(c1),c1))). [resolve(610,b,125,b),unit_del(b,1632),unit_del(c,580)].
% 2.72/3.04 9671 leaf_occ(f13(c1),c1) | leaf_occ(f15(f13(c1),c1),f3(tptp0,f13(c1),f15(f13(c1),c1))). [resolve(2445,c,614,c),merge(c),unit_del(c,1632)].
% 2.72/3.04 9675 leaf_occ(f13(c1),c1) | occurrence_of(f4(f15(f13(c1),c1),tptp0),tptp0). [resolve(9671,b,2425,d),merge(b),unit_del(c,1632)].
% 2.72/3.04 9676 leaf_occ(f13(c1),c1) | leaf_occ(f15(f13(c1),c1),f4(f15(f13(c1),c1),tptp0)). [resolve(9671,b,2376,d),merge(b),unit_del(c,1632)].
% 2.72/3.04 9691 occurrence_of(f4(f15(f13(c1),c1),tptp0),tptp0). [resolve(9675,a,346,b),unit_del(b,90)].
% 2.72/3.04 9717 -occurrence_of(f4(f15(f13(c1),c1),tptp0),A) | tptp0 = A. [resolve(9691,a,114,b)].
% 2.72/3.04 9718 leaf_occ(f14(f4(f15(f13(c1),c1),tptp0)),f4(f15(f13(c1),c1),tptp0)). [resolve(9691,a,111,a)].
% 2.72/3.04 9754 atomic(f9(f14(f4(f15(f13(c1),c1),tptp0)),f4(f15(f13(c1),c1),tptp0))) | occurrence_of(f4(f14(f4(f15(f13(c1),c1),tptp0)),f9(f14(f4(f15(f13(c1),c1),tptp0)),f4(f15(f13(c1),c1),tptp0))),f9(f14(f4(f15(f13(c1),c1),tptp0)),f4(f15(f13(c1),c1),tptp0))). [resolve(9718,a,132,c)].
% 2.72/3.04 9755 -occurrence_of(f4(f15(f13(c1),c1),tptp0),A) | atomic(A) | -leaf_occ(B,f4(f15(f13(c1),c1),tptp0)) | f14(f4(f15(f13(c1),c1),tptp0)) = B. [resolve(9718,a,124,d)].
% 2.72/3.04 9756 occurrence_of(f4(f15(f13(c1),c1),tptp0),f9(f14(f4(f15(f13(c1),c1),tptp0)),f4(f15(f13(c1),c1),tptp0))). [resolve(9718,a,112,a)].
% 2.72/3.04 10015 f9(f14(f4(f15(f13(c1),c1),tptp0)),f4(f15(f13(c1),c1),tptp0)) = tptp0. [resolve(9756,a,9717,a),flip(a)].
% 2.72/3.04 10016 occurrence_of(f4(f14(f4(f15(f13(c1),c1),tptp0)),tptp0),tptp0). [back_rewrite(9754),rewrite([10015(14),10015(23),10015(25)]),unit_del(a,91)].
% 2.72/3.04 10033 occurrence_of(f14(f4(f14(f4(f15(f13(c1),c1),tptp0)),tptp0)),tptp3) | occurrence_of(f14(f4(f14(f4(f15(f13(c1),c1),tptp0)),tptp0)),tptp2). [resolve(10016,a,121,a)].
% 2.72/3.04 10036 leaf_occ(f14(f4(f14(f4(f15(f13(c1),c1),tptp0)),tptp0)),f4(f14(f4(f15(f13(c1),c1),tptp0)),tptp0)). [resolve(10016,a,111,a)].
% 2.72/3.04 10110 subactivity_occurrence(f14(f4(f14(f4(f15(f13(c1),c1),tptp0)),tptp0)),f4(f14(f4(f15(f13(c1),c1),tptp0)),tptp0)). [resolve(10036,a,103,a)].
% 2.72/3.04 10143 occurrence_of(f14(f4(f14(f4(f15(f13(c1),c1),tptp0)),tptp0)),f5(f14(f4(f14(f4(f15(f13(c1),c1),tptp0)),tptp0)))). [resolve(10110,a,190,b)].
% 2.72/3.04 10472 -occurrence_of(f14(f4(f14(f4(f15(f13(c1),c1),tptp0)),tptp0)),A) | f5(f14(f4(f14(f4(f15(f13(c1),c1),tptp0)),tptp0))) = A. [resolve(10143,a,114,b)].
% 2.72/3.04 11291 f5(f14(f4(f14(f4(f15(f13(c1),c1),tptp0)),tptp0))) = tptp3 | occurrence_of(f14(f4(f14(f4(f15(f13(c1),c1),tptp0)),tptp0)),tptp2). [resolve(10472,a,10033,a)].
% 2.72/3.04 11376 f5(f14(f4(f14(f4(f15(f13(c1),c1),tptp0)),tptp0))) = tptp3 | f5(f14(f4(f14(f4(f15(f13(c1),c1),tptp0)),tptp0))) = tptp2. [resolve(11291,b,10472,a)].
% 2.72/3.04 12646 -occurrence_of(f4(f15(f13(c1),c1),tptp0),A) | atomic(A) | f14(f4(f15(f13(c1),c1),tptp0)) = f15(f13(c1),c1) | leaf_occ(f13(c1),c1). [resolve(9755,c,9676,b)].
% 2.72/3.04 12647 f14(f4(f15(f13(c1),c1),tptp0)) = f15(f13(c1),c1) | leaf_occ(f13(c1),c1). [resolve(12646,a,9691,a),unit_del(a,91)].
% 2.72/3.04 12657 f14(f4(f15(f13(c1),c1),tptp0)) = f15(f13(c1),c1). [resolve(12647,b,346,b),unit_del(b,90)].
% 2.72/3.04 12734 $F. [back_rewrite(11376),rewrite([12657(7),12657(7),805(5),12657(10),12657(10),805(8)]),flip(a),flip(b),unit_del(a,96),unit_del(b,98)].
% 2.72/3.04
% 2.72/3.04 % SZS output end Refutation
% 2.72/3.04 ============================== end of proof ==========================
% 2.72/3.04
% 2.72/3.04 ============================== STATISTICS ============================
% 2.72/3.04
% 2.72/3.04 Given=2828. Generated=24780. Kept=12644. proofs=1.
% 2.72/3.04 Usable=1471. Sos=3814. Demods=74. Limbo=77, Disabled=7455. Hints=0.
% 2.72/3.04 Megabytes=28.32.
% 2.72/3.04 User_CPU=2.00, System_CPU=0.02, Wall_clock=2.
% 2.72/3.04
% 2.72/3.04 ============================== end of statistics =====================
% 2.72/3.04
% 2.72/3.04 ============================== end of search =========================
% 2.72/3.04
% 2.72/3.04 THEOREM PROVED
% 2.72/3.04 % SZS status Theorem
% 2.72/3.04
% 2.72/3.04 Exiting with 1 proof.
% 2.72/3.04
% 2.72/3.04 Process 12693 exit (max_proofs) Mon Jun 13 02:42:27 2022
% 2.72/3.04 Prover9 interrupted
%------------------------------------------------------------------------------