TSTP Solution File: PRO009+4 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PRO009+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n007.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:09 EDT 2022
% Result : Theorem 0.99s 1.24s
% Output : Refutation 0.99s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : PRO009+4 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n007.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 13 03:04:38 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.42/1.00 ============================== Prover9 ===============================
% 0.42/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.42/1.00 Process 3653 was started by sandbox2 on n007.cluster.edu,
% 0.42/1.00 Mon Jun 13 03:04:39 2022
% 0.42/1.00 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_3500_n007.cluster.edu".
% 0.42/1.00 ============================== end of head ===========================
% 0.42/1.00
% 0.42/1.00 ============================== INPUT =================================
% 0.42/1.00
% 0.42/1.00 % Reading from file /tmp/Prover9_3500_n007.cluster.edu
% 0.42/1.00
% 0.42/1.00 set(prolog_style_variables).
% 0.42/1.00 set(auto2).
% 0.42/1.00 % set(auto2) -> set(auto).
% 0.42/1.00 % set(auto) -> set(auto_inference).
% 0.42/1.00 % set(auto) -> set(auto_setup).
% 0.42/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.42/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/1.00 % set(auto) -> set(auto_limits).
% 0.42/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/1.00 % set(auto) -> set(auto_denials).
% 0.42/1.00 % set(auto) -> set(auto_process).
% 0.42/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.42/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.42/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.42/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.42/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.42/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.42/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.42/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.42/1.00 % set(auto2) -> assign(stats, some).
% 0.42/1.00 % set(auto2) -> clear(echo_input).
% 0.42/1.00 % set(auto2) -> set(quiet).
% 0.42/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.42/1.00 % set(auto2) -> clear(print_given).
% 0.42/1.00 assign(lrs_ticks,-1).
% 0.42/1.00 assign(sos_limit,10000).
% 0.42/1.00 assign(order,kbo).
% 0.42/1.00 set(lex_order_vars).
% 0.42/1.00 clear(print_given).
% 0.42/1.00
% 0.42/1.00 % formulas(sos). % not echoed (46 formulas)
% 0.42/1.00
% 0.42/1.00 ============================== end of input ==========================
% 0.42/1.00
% 0.42/1.00 % From the command line: assign(max_seconds, 300).
% 0.42/1.00
% 0.42/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/1.00
% 0.42/1.00 % Formulas that are not ordinary clauses:
% 0.42/1.00 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.42/1.00 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.42/1.00 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.42/1.00 4 (all X12 all X13 (occurrence_of(X13,X12) -> activity(X12) & activity_occurrence(X13))) # label(sos_03) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 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.42/1.00 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.42/1.00 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.42/1.00 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.42/1.00 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.42/1.00 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.42/1.00 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.42/1.00 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.42/1.00 13 (all X41 (activity_occurrence(X41) -> (exists X42 (activity(X42) & occurrence_of(X41,X42))))) # label(sos_12) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 14 (all X43 (legal(X43) -> arboreal(X43))) # label(sos_13) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 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.42/1.00 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.42/1.00 17 (all X51 all X52 (occurrence_of(X51,X52) -> (arboreal(X51) <-> atomic(X52)))) # label(sos_16) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 18 (all X53 all X54 (root(X53,X54) -> legal(X53))) # label(sos_17) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 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.42/1.00 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.42/1.00 21 (all X61 all X62 (earlier(X61,X62) -> -earlier(X62,X61))) # label(sos_20) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 22 (all X63 all X64 (precedes(X63,X64) <-> earlier(X63,X64) & legal(X64))) # label(sos_21) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 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.42/1.00 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.42/1.00 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.42/1.00 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.42/1.00 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.42/1.00 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.42/1.00 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.42/1.00 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.42/1.00 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.42/1.00 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.42/1.00 33 (all X101 (occurrence_of(X101,tptp0) -> (exists X102 exists X103 exists X104 (occurrence_of(X102,tptp3) & root_occ(X102,X101) & occurrence_of(X103,tptp4) & next_subocc(X102,X103,tptp0) & (occurrence_of(X104,tptp2) | occurrence_of(X104,tptp1)) & next_subocc(X103,X104,tptp0) & leaf_occ(X104,X101))))) # label(sos_32) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 34 -(all X105 (occurrence_of(X105,tptp0) -> (exists X106 exists X107 (occurrence_of(X106,tptp3) & root_occ(X106,X105) & (occurrence_of(X107,tptp2) | occurrence_of(X107,tptp1)) & min_precedes(X106,X107,tptp0) & leaf_occ(X107,X105))))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.42/1.00
% 0.42/1.00 ============================== end of process non-clausal formulas ===
% 0.42/1.00
% 0.42/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.42/1.00
% 0.42/1.00 ============================== PREDICATE ELIMINATION =================
% 0.42/1.00 35 -leaf_occ(A,B) | leaf(A,f9(A,B)) # label(sos_18) # label(axiom). [clausify(19)].
% 0.42/1.00 36 -leaf(A,B) | -min_precedes(A,C,B) # label(sos_15) # label(axiom). [clausify(16)].
% 0.42/1.00 Derived: -leaf_occ(A,B) | -min_precedes(A,C,f9(A,B)). [resolve(35,b,36,a)].
% 0.42/1.00 37 -leaf(A,B) | atomic(B) | occurrence_of(f4(A,B),B) # label(sos_07) # label(axiom). [clausify(8)].
% 0.42/1.00 Derived: atomic(f9(A,B)) | occurrence_of(f4(A,f9(A,B)),f9(A,B)) | -leaf_occ(A,B). [resolve(37,a,35,b)].
% 0.42/1.00 38 -leaf(A,B) | atomic(B) | leaf_occ(A,f4(A,B)) # label(sos_07) # label(axiom). [clausify(8)].
% 0.42/1.00 Derived: atomic(f9(A,B)) | leaf_occ(A,f4(A,f9(A,B))) | -leaf_occ(A,B). [resolve(38,a,35,b)].
% 0.42/1.00 39 -leaf(A,B) | root(A,B) | min_precedes(f7(A,B),A,B) # label(sos_15) # label(axiom). [clausify(16)].
% 0.42/1.00 Derived: root(A,f9(A,B)) | min_precedes(f7(A,f9(A,B)),A,f9(A,B)) | -leaf_occ(A,B). [resolve(39,a,35,b)].
% 0.42/1.00 40 leaf(A,B) | -root(A,B) | min_precedes(A,f8(A,B),B) # label(sos_15) # label(axiom). [clausify(16)].
% 0.42/1.00 Derived: -root(A,B) | min_precedes(A,f8(A,B),B) | -min_precedes(A,C,B). [resolve(40,a,36,a)].
% 0.42/1.00 Derived: -root(A,B) | min_precedes(A,f8(A,B),B) | atomic(B) | occurrence_of(f4(A,B),B). [resolve(40,a,37,a)].
% 0.42/1.00 Derived: -root(A,B) | min_precedes(A,f8(A,B),B) | atomic(B) | leaf_occ(A,f4(A,B)). [resolve(40,a,38,a)].
% 0.42/1.00 41 leaf_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -leaf(A,C) # label(sos_18) # label(axiom). [clausify(19)].
% 0.42/1.00 Derived: leaf_occ(A,B) | -occurrence_of(B,f9(A,C)) | -subactivity_occurrence(A,B) | -leaf_occ(A,C). [resolve(41,d,35,b)].
% 0.42/1.00 Derived: leaf_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -root(A,C) | min_precedes(A,f8(A,C),C). [resolve(41,d,40,a)].
% 0.42/1.00 42 leaf(A,B) | -min_precedes(C,A,B) | min_precedes(A,f8(A,B),B) # label(sos_15) # label(axiom). [clausify(16)].
% 0.42/1.00 Derived: -min_precedes(A,B,C) | min_precedes(B,f8(B,C),C) | -min_precedes(B,D,C). [resolve(42,a,36,a)].
% 0.42/1.00 Derived: -min_precedes(A,B,C) | min_precedes(B,f8(B,C),C) | atomic(C) | occurrence_of(f4(B,C),C). [resolve(42,a,37,a)].
% 0.42/1.00 Derived: -min_precedes(A,B,C) | min_precedes(B,f8(B,C),C) | atomic(C) | leaf_occ(B,f4(B,C)). [resolve(42,a,38,a)].
% 0.42/1.00 Derived: -min_precedes(A,B,C) | min_precedes(B,f8(B,C),C) | root(B,C) | min_precedes(f7(B,C),B,C). [resolve(42,a,39,a)].
% 0.42/1.00 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(42,a,41,d)].
% 0.42/1.00 43 -root_occ(A,B) | root(A,f10(A,B)) # label(sos_19) # label(axiom). [clausify(20)].
% 0.42/1.00 44 -min_precedes(A,B,C) | -root(B,C) # label(sos_22) # label(axiom). [clausify(23)].
% 0.42/1.00 45 -root(A,B) | legal(A) # label(sos_17) # label(axiom). [clausify(18)].
% 0.42/1.00 46 -root(A,B) | subactivity(f2(B,A),B) # label(sos_05) # label(axiom). [clausify(6)].
% 0.42/1.00 47 -root(A,B) | atocc(A,f2(B,A)) # label(sos_05) # label(axiom). [clausify(6)].
% 0.42/1.00 Derived: -root_occ(A,B) | -min_precedes(C,A,f10(A,B)). [resolve(43,b,44,b)].
% 0.42/1.00 Derived: -root_occ(A,B) | legal(A). [resolve(43,b,45,a)].
% 0.42/1.00 Derived: -root_occ(A,B) | subactivity(f2(f10(A,B),A),f10(A,B)). [resolve(43,b,46,a)].
% 0.42/1.00 Derived: -root_occ(A,B) | atocc(A,f2(f10(A,B),A)). [resolve(43,b,47,a)].
% 0.42/1.00 48 -occurrence_of(A,B) | atomic(B) | root(f1(B,A),B) # label(sos) # label(axiom). [clausify(1)].
% 0.42/1.00 Derived: -occurrence_of(A,B) | atomic(B) | -min_precedes(C,f1(B,A),B). [resolve(48,c,44,b)].
% 0.42/1.00 Derived: -occurrence_of(A,B) | atomic(B) | legal(f1(B,A)). [resolve(48,c,45,a)].
% 0.42/1.00 Derived: -occurrence_of(A,B) | atomic(B) | subactivity(f2(B,f1(B,A)),B). [resolve(48,c,46,a)].
% 0.42/1.00 Derived: -occurrence_of(A,B) | atomic(B) | atocc(f1(B,A),f2(B,f1(B,A))). [resolve(48,c,47,a)].
% 0.42/1.00 49 -min_precedes(A,B,C) | root(f11(A,B,C),C) # label(sos_23) # label(axiom). [clausify(24)].
% 0.42/1.00 Derived: -min_precedes(A,B,C) | -min_precedes(D,f11(A,B,C),C). [resolve(49,b,44,b)].
% 0.42/1.00 Derived: -min_precedes(A,B,C) | legal(f11(A,B,C)). [resolve(49,b,45,a)].
% 0.42/1.00 Derived: -min_precedes(A,B,C) | subactivity(f2(C,f11(A,B,C)),C). [resolve(49,b,46,a)].
% 0.42/1.00 Derived: -min_precedes(A,B,C) | atocc(f11(A,B,C),f2(C,f11(A,B,C))). [resolve(49,b,47,a)].
% 0.42/1.00 50 root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -root(A,C) # label(sos_19) # label(axiom). [clausify(20)].
% 0.42/1.00 Derived: root_occ(A,B) | -occurrence_of(B,f10(A,C)) | -subactivity_occurrence(A,B) | -root_occ(A,C). [resolve(50,d,43,b)].
% 0.42/1.00 Derived: root_occ(f1(A,B),C) | -occurrence_of(C,A) | -subactivity_occurrence(f1(A,B),C) | -occurrence_of(B,A) | atomic(A). [resolve(50,d,48,c)].
% 0.42/1.00 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(50,d,49,b)].
% 0.42/1.00 51 root(A,f9(A,B)) | min_precedes(f7(A,f9(A,B)),A,f9(A,B)) | -leaf_occ(A,B). [resolve(39,a,35,b)].
% 0.42/1.00 Derived: min_precedes(f7(A,f9(A,B)),A,f9(A,B)) | -leaf_occ(A,B) | -min_precedes(C,A,f9(A,B)). [resolve(51,a,44,b)].
% 0.42/1.00 Derived: min_precedes(f7(A,f9(A,B)),A,f9(A,B)) | -leaf_occ(A,B) | legal(A). [resolve(51,a,45,a)].
% 0.42/1.00 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(51,a,46,a)].
% 0.42/1.00 Derived: min_precedes(f7(A,f9(A,B)),A,f9(A,B)) | -leaf_occ(A,B) | atocc(A,f2(f9(A,B),A)). [resolve(51,a,47,a)].
% 0.42/1.00 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(51,a,50,d)].
% 0.42/1.00 52 -root(A,B) | min_precedes(A,f8(A,B),B) | -min_precedes(A,C,B). [resolve(40,a,36,a)].
% 0.42/1.00 Derived: min_precedes(A,f8(A,f10(A,B)),f10(A,B)) | -min_precedes(A,C,f10(A,B)) | -root_occ(A,B). [resolve(52,a,43,b)].
% 0.42/1.00 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(52,a,48,c)].
% 0.42/1.00 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(52,a,49,b)].
% 0.42/1.00 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(52,a,51,a)].
% 0.42/1.00 53 -root(A,B) | min_precedes(A,f8(A,B),B) | atomic(B) | occurrence_of(f4(A,B),B). [resolve(40,a,37,a)].
% 0.42/1.00 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(53,a,43,b)].
% 0.42/1.00 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(53,a,48,c)].
% 0.42/1.00 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(53,a,49,b)].
% 0.42/1.00 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(53,a,51,a)].
% 0.42/1.00 54 -root(A,B) | min_precedes(A,f8(A,B),B) | atomic(B) | leaf_occ(A,f4(A,B)). [resolve(40,a,38,a)].
% 0.42/1.00 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(54,a,43,b)].
% 0.42/1.00 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(54,a,48,c)].
% 0.42/1.00 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(54,a,49,b)].
% 0.42/1.00 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(54,a,51,a)].
% 0.42/1.00 55 leaf_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -root(A,C) | min_precedes(A,f8(A,C),C). [resolve(41,d,40,a)].
% 0.42/1.00 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(55,d,43,b)].
% 0.42/1.00 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(55,d,48,c)].
% 0.42/1.00 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(55,d,49,b)].
% 0.42/1.00 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(55,d,51,a)].
% 0.42/1.00 56 -min_precedes(A,B,C) | min_precedes(B,f8(B,C),C) | root(B,C) | min_precedes(f7(B,C),B,C). [resolve(42,a,39,a)].
% 0.42/1.00 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(56,c,44,b)].
% 0.42/1.00 57 -occurrence_of(A,tptp0) | next_subocc(f13(A),f14(A),tptp0) # label(sos_32) # label(axiom). [clausify(33)].
% 0.42/1.00 58 -next_subocc(A,B,C) | -min_precedes(A,D,C) | -min_precedes(D,B,C) # label(sos_26) # label(axiom). [clausify(27)].
% 0.42/1.00 59 -next_subocc(A,B,C) | arboreal(A) # label(sos_25) # label(axiom). [clausify(26)].
% 0.42/1.00 60 -next_subocc(A,B,C) | arboreal(B) # label(sos_25) # label(axiom). [clausify(26)].
% 0.42/1.00 61 -next_subocc(A,B,C) | min_precedes(A,B,C) # label(sos_26) # label(axiom). [clausify(27)].
% 0.42/1.00 Derived: -occurrence_of(A,tptp0) | -min_precedes(f13(A),B,tptp0) | -min_precedes(B,f14(A),tptp0). [resolve(57,b,58,a)].
% 0.42/1.00 Derived: -occurrence_of(A,tptp0) | arboreal(f13(A)). [resolve(57,b,59,a)].
% 0.42/1.00 Derived: -occurrence_of(A,tptp0) | arboreal(f14(A)). [resolve(57,b,60,a)].
% 0.42/1.00 Derived: -occurrence_of(A,tptp0) | min_precedes(f13(A),f14(A),tptp0). [resolve(57,b,61,a)].
% 0.42/1.00 62 -occurrence_of(A,tptp0) | next_subocc(f14(A),f15(A),tptp0) # label(sos_32) # label(axiom). [clausify(33)].
% 0.42/1.00 Derived: -occurrence_of(A,tptp0) | -min_precedes(f14(A),B,tptp0) | -min_precedes(B,f15(A),tptp0). [resolve(62,b,58,a)].
% 0.42/1.00 Derived: -occurrence_of(A,tptp0) | arboreal(f15(A)). [resolve(62,b,60,a)].
% 0.42/1.00 Derived: -occurrence_of(A,tptp0) | min_precedes(f14(A),f15(A),tptp0). [resolve(62,b,61,a)].
% 0.42/1.00 63 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.42/1.00 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(63,a,58,a)].
% 0.42/1.00 Derived: -min_precedes(A,B,C) | min_precedes(A,f12(A,B,C),C) | arboreal(A). [resolve(63,a,59,a)].
% 0.42/1.00 Derived: -min_precedes(A,B,C) | min_precedes(A,f12(A,B,C),C) | arboreal(B). [resolve(63,a,60,a)].
% 0.42/1.00 64 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.42/1.00 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(64,a,58,a)].
% 0.42/1.00 Derived: -min_precedes(A,B,C) | min_precedes(f12(A,B,C),B,C) | arboreal(A). [resolve(64,a,59,a)].
% 0.42/1.00 Derived: -min_precedes(A,B,C) | min_precedes(f12(A,B,C),B,C) | arboreal(B). [resolve(64,a,60,a)].
% 0.42/1.01 65 -precedes(A,B) | legal(B) # label(sos_21) # label(axiom). [clausify(22)].
% 0.42/1.01 66 -legal(A) | arboreal(A) # label(sos_13) # label(axiom). [clausify(14)].
% 0.42/1.01 Derived: -precedes(A,B) | arboreal(B). [resolve(65,b,66,a)].
% 0.42/1.01 67 precedes(A,B) | -earlier(A,B) | -legal(B) # label(sos_21) # label(axiom). [clausify(22)].
% 0.42/1.01 Derived: precedes(A,B) | -earlier(A,B) | -precedes(C,B). [resolve(67,c,65,b)].
% 0.42/1.01 68 -root_occ(A,B) | legal(A). [resolve(43,b,45,a)].
% 0.42/1.01 Derived: -root_occ(A,B) | arboreal(A). [resolve(68,b,66,a)].
% 0.42/1.01 Derived: -root_occ(A,B) | precedes(C,A) | -earlier(C,A). [resolve(68,b,67,c)].
% 0.42/1.01 69 -occurrence_of(A,B) | atomic(B) | legal(f1(B,A)). [resolve(48,c,45,a)].
% 0.42/1.01 Derived: -occurrence_of(A,B) | atomic(B) | arboreal(f1(B,A)). [resolve(69,c,66,a)].
% 0.42/1.01 Derived: -occurrence_of(A,B) | atomic(B) | precedes(C,f1(B,A)) | -earlier(C,f1(B,A)). [resolve(69,c,67,c)].
% 0.42/1.01 70 -min_precedes(A,B,C) | legal(f11(A,B,C)). [resolve(49,b,45,a)].
% 0.42/1.01 Derived: -min_precedes(A,B,C) | arboreal(f11(A,B,C)). [resolve(70,b,66,a)].
% 0.42/1.02 Derived: -min_precedes(A,B,C) | precedes(D,f11(A,B,C)) | -earlier(D,f11(A,B,C)). [resolve(70,b,67,c)].
% 0.42/1.02 71 min_precedes(f7(A,f9(A,B)),A,f9(A,B)) | -leaf_occ(A,B) | legal(A). [resolve(51,a,45,a)].
% 0.42/1.02 Derived: min_precedes(f7(A,f9(A,B)),A,f9(A,B)) | -leaf_occ(A,B) | arboreal(A). [resolve(71,c,66,a)].
% 0.42/1.02 Derived: min_precedes(f7(A,f9(A,B)),A,f9(A,B)) | -leaf_occ(A,B) | precedes(C,A) | -earlier(C,A). [resolve(71,c,67,c)].
% 0.42/1.02 72 -activity_occurrence(A) | occurrence_of(A,f5(A)) # label(sos_12) # label(axiom). [clausify(13)].
% 0.42/1.02 73 -occurrence_of(A,B) | activity_occurrence(A) # label(sos_03) # label(axiom). [clausify(4)].
% 0.42/1.02 74 -subactivity_occurrence(A,B) | activity_occurrence(A) # label(sos_11) # label(axiom). [clausify(12)].
% 0.42/1.02 75 -subactivity_occurrence(A,B) | activity_occurrence(B) # label(sos_11) # label(axiom). [clausify(12)].
% 0.42/1.02 Derived: occurrence_of(A,f5(A)) | -occurrence_of(A,B). [resolve(72,a,73,b)].
% 0.42/1.02 Derived: occurrence_of(A,f5(A)) | -subactivity_occurrence(A,B). [resolve(72,a,74,b)].
% 0.42/1.02 Derived: occurrence_of(A,f5(A)) | -subactivity_occurrence(B,A). [resolve(72,a,75,b)].
% 0.42/1.02 76 atocc(A,B) | -subactivity(B,C) | -atomic(C) | -occurrence_of(A,C) # label(sos_14) # label(axiom). [clausify(15)].
% 0.42/1.02 77 -atocc(A,B) | atomic(f6(A,B)) # label(sos_14) # label(axiom). [clausify(15)].
% 0.42/1.02 78 -atocc(A,B) | subactivity(B,f6(A,B)) # label(sos_14) # label(axiom). [clausify(15)].
% 0.42/1.02 79 -atocc(A,B) | occurrence_of(A,f6(A,B)) # label(sos_14) # label(axiom). [clausify(15)].
% 0.42/1.02 Derived: -subactivity(A,B) | -atomic(B) | -occurrence_of(C,B) | atomic(f6(C,A)). [resolve(76,a,77,a)].
% 0.42/1.02 Derived: -subactivity(A,B) | -atomic(B) | -occurrence_of(C,B) | subactivity(A,f6(C,A)). [resolve(76,a,78,a)].
% 0.42/1.02 Derived: -subactivity(A,B) | -atomic(B) | -occurrence_of(C,B) | occurrence_of(C,f6(C,A)). [resolve(76,a,79,a)].
% 0.42/1.02 80 -root_occ(A,B) | atocc(A,f2(f10(A,B),A)). [resolve(43,b,47,a)].
% 0.42/1.02 Derived: -root_occ(A,B) | atomic(f6(A,f2(f10(A,B),A))). [resolve(80,b,77,a)].
% 0.42/1.02 Derived: -root_occ(A,B) | subactivity(f2(f10(A,B),A),f6(A,f2(f10(A,B),A))). [resolve(80,b,78,a)].
% 0.42/1.02 Derived: -root_occ(A,B) | occurrence_of(A,f6(A,f2(f10(A,B),A))). [resolve(80,b,79,a)].
% 0.42/1.02 81 -occurrence_of(A,B) | atomic(B) | atocc(f1(B,A),f2(B,f1(B,A))). [resolve(48,c,47,a)].
% 0.42/1.02 Derived: -occurrence_of(A,B) | atomic(B) | atomic(f6(f1(B,A),f2(B,f1(B,A)))). [resolve(81,c,77,a)].
% 0.42/1.02 Derived: -occurrence_of(A,B) | atomic(B) | subactivity(f2(B,f1(B,A)),f6(f1(B,A),f2(B,f1(B,A)))). [resolve(81,c,78,a)].
% 0.42/1.02 Derived: -occurrence_of(A,B) | atomic(B) | occurrence_of(f1(B,A),f6(f1(B,A),f2(B,f1(B,A)))). [resolve(81,c,79,a)].
% 0.42/1.02 82 -min_precedes(A,B,C) | atocc(f11(A,B,C),f2(C,f11(A,B,C))). [resolve(49,b,47,a)].
% 0.42/1.02 Derived: -min_precedes(A,B,C) | atomic(f6(f11(A,B,C),f2(C,f11(A,B,C)))). [resolve(82,b,77,a)].
% 0.42/1.02 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(82,b,78,a)].
% 0.42/1.02 Derived: -min_precedes(A,B,C) | occurrence_of(f11(A,B,C),f6(f11(A,B,C),f2(C,f11(A,B,C)))). [resolve(82,b,79,a)].
% 0.42/1.02 83 min_precedes(f7(A,f9(A,B)),A,f9(A,B)) | -leaf_occ(A,B) | atocc(A,f2(f9(A,B),A)). [resolve(51,a,47,a)].
% 0.42/1.02 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(83,c,77,a)].
% 0.42/1.02 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(83,c,78,a)].
% 0.42/1.02 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(83,c,79,a)].
% 0.42/1.02
% 0.42/1.02 ============================== end predicate elimination =============
% 0.42/1.02
% 0.42/1.02 Auto_denials: (non-Horn, no changes).
% 0.42/1.02
% 0.42/1.02 Term ordering decisions:
% 0.42/1.02 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. f5=1. f13=1. f14=1. f15=1. f3=1. f11=1. f12=1.
% 0.42/1.02
% 0.42/1.02 ============================== end of process initial clauses ========
% 0.42/1.02
% 0.42/1.02 ============================== CLAUSES FOR SEARCH ====================
% 0.42/1.02
% 0.42/1.02 ============================== end of clauses for search =============
% 0.42/1.02
% 0.42/1.02 ============================== SEARCH ================================
% 0.42/1.02
% 0.42/1.02 % Starting search at 0.04 seconds.
% 0.99/1.24
% 0.99/1.24 ============================== PROOF =================================
% 0.99/1.24 % SZS status Theorem
% 0.99/1.24 % SZS output start Refutation
% 0.99/1.24
% 0.99/1.24 % Proof 1 at 0.25 (+ 0.00) seconds.
% 0.99/1.24 % Length of proof is 67.
% 0.99/1.24 % Level of proof is 10.
% 0.99/1.24 % Maximum clause weight is 20.000.
% 0.99/1.24 % Given clauses 587.
% 0.99/1.24
% 0.99/1.24 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.99/1.24 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.99/1.24 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.99/1.24 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.99/1.24 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.99/1.24 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.99/1.24 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.99/1.24 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.99/1.24 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.99/1.24 33 (all X101 (occurrence_of(X101,tptp0) -> (exists X102 exists X103 exists X104 (occurrence_of(X102,tptp3) & root_occ(X102,X101) & occurrence_of(X103,tptp4) & next_subocc(X102,X103,tptp0) & (occurrence_of(X104,tptp2) | occurrence_of(X104,tptp1)) & next_subocc(X103,X104,tptp0) & leaf_occ(X104,X101))))) # label(sos_32) # label(axiom) # label(non_clause). [assumption].
% 0.99/1.24 34 -(all X105 (occurrence_of(X105,tptp0) -> (exists X106 exists X107 (occurrence_of(X106,tptp3) & root_occ(X106,X105) & (occurrence_of(X107,tptp2) | occurrence_of(X107,tptp1)) & min_precedes(X106,X107,tptp0) & leaf_occ(X107,X105))))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.99/1.24 35 -leaf_occ(A,B) | leaf(A,f9(A,B)) # label(sos_18) # label(axiom). [clausify(19)].
% 0.99/1.24 36 -leaf(A,B) | -min_precedes(A,C,B) # label(sos_15) # label(axiom). [clausify(16)].
% 0.99/1.24 39 -leaf(A,B) | root(A,B) | min_precedes(f7(A,B),A,B) # label(sos_15) # label(axiom). [clausify(16)].
% 0.99/1.24 42 leaf(A,B) | -min_precedes(C,A,B) | min_precedes(A,f8(A,B),B) # label(sos_15) # label(axiom). [clausify(16)].
% 0.99/1.24 43 -root_occ(A,B) | root(A,f10(A,B)) # label(sos_19) # label(axiom). [clausify(20)].
% 0.99/1.24 44 -min_precedes(A,B,C) | -root(B,C) # label(sos_22) # label(axiom). [clausify(23)].
% 0.99/1.24 56 -min_precedes(A,B,C) | min_precedes(B,f8(B,C),C) | root(B,C) | min_precedes(f7(B,C),B,C). [resolve(42,a,39,a)].
% 0.99/1.24 57 -occurrence_of(A,tptp0) | next_subocc(f13(A),f14(A),tptp0) # label(sos_32) # label(axiom). [clausify(33)].
% 0.99/1.24 59 -next_subocc(A,B,C) | arboreal(A) # label(sos_25) # label(axiom). [clausify(26)].
% 0.99/1.24 61 -next_subocc(A,B,C) | min_precedes(A,B,C) # label(sos_26) # label(axiom). [clausify(27)].
% 0.99/1.24 62 -occurrence_of(A,tptp0) | next_subocc(f14(A),f15(A),tptp0) # label(sos_32) # label(axiom). [clausify(33)].
% 0.99/1.24 88 occurrence_of(c1,tptp0) # label(goals) # label(negated_conjecture). [clausify(34)].
% 0.99/1.24 99 -occurrence_of(A,tptp3) | -root_occ(A,c1) | -occurrence_of(B,tptp2) | -min_precedes(A,B,tptp0) | -leaf_occ(B,c1) # label(goals) # label(negated_conjecture). [clausify(34)].
% 0.99/1.24 100 -occurrence_of(A,tptp3) | -root_occ(A,c1) | -occurrence_of(B,tptp1) | -min_precedes(A,B,tptp0) | -leaf_occ(B,c1) # label(goals) # label(negated_conjecture). [clausify(34)].
% 0.99/1.24 102 -root_occ(A,B) | subactivity_occurrence(A,B) # label(sos_19) # label(axiom). [clausify(20)].
% 0.99/1.24 107 -occurrence_of(A,tptp0) | occurrence_of(f13(A),tptp3) # label(sos_32) # label(axiom). [clausify(33)].
% 0.99/1.24 108 -occurrence_of(A,tptp0) | root_occ(f13(A),A) # label(sos_32) # label(axiom). [clausify(33)].
% 0.99/1.24 110 -occurrence_of(A,tptp0) | leaf_occ(f15(A),A) # label(sos_32) # label(axiom). [clausify(33)].
% 0.99/1.24 111 -leaf_occ(A,B) | occurrence_of(B,f9(A,B)) # label(sos_18) # label(axiom). [clausify(19)].
% 0.99/1.24 112 -root_occ(A,B) | occurrence_of(B,f10(A,B)) # label(sos_19) # label(axiom). [clausify(20)].
% 0.99/1.24 113 -occurrence_of(A,B) | -occurrence_of(A,C) | C = B # label(sos_08) # label(axiom). [clausify(9)].
% 0.99/1.24 119 -min_precedes(A,B,C) | min_precedes(f11(A,B,C),B,C) # label(sos_23) # label(axiom). [clausify(24)].
% 0.99/1.24 120 -occurrence_of(A,tptp0) | occurrence_of(f15(A),tptp2) | occurrence_of(f15(A),tptp1) # label(sos_32) # label(axiom). [clausify(33)].
% 0.99/1.24 125 -occurrence_of(A,B) | -subactivity_occurrence(C,A) | -leaf_occ(D,A) | -arboreal(C) | min_precedes(C,D,B) | D = C # label(sos_02) # label(axiom). [clausify(3)].
% 0.99/1.24 128 -leaf_occ(A,B) | -min_precedes(A,C,f9(A,B)). [resolve(35,b,36,a)].
% 0.99/1.24 136 -root_occ(A,B) | -min_precedes(C,A,f10(A,B)). [resolve(43,b,44,b)].
% 0.99/1.24 162 -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(56,c,44,b)].
% 0.99/1.24 164 -occurrence_of(A,tptp0) | arboreal(f13(A)). [resolve(57,b,59,a)].
% 0.99/1.24 169 -occurrence_of(A,tptp0) | min_precedes(f14(A),f15(A),tptp0). [resolve(62,b,61,a)].
% 0.99/1.24 209 -min_precedes(A,B,C) | min_precedes(B,f8(B,C),C) | min_precedes(f7(B,C),B,C). [factor(162,a,d)].
% 0.99/1.24 217 occurrence_of(f13(c1),tptp3). [resolve(107,a,88,a)].
% 0.99/1.24 218 root_occ(f13(c1),c1). [resolve(108,a,88,a)].
% 0.99/1.24 220 leaf_occ(f15(c1),c1). [resolve(110,a,88,a)].
% 0.99/1.24 221 -occurrence_of(c1,A) | tptp0 = A. [resolve(113,a,88,a),flip(b)].
% 0.99/1.24 223 occurrence_of(f15(c1),tptp2) | occurrence_of(f15(c1),tptp1). [resolve(120,a,88,a)].
% 0.99/1.24 227 arboreal(f13(c1)). [resolve(164,a,88,a)].
% 0.99/1.24 231 min_precedes(f14(c1),f15(c1),tptp0). [resolve(169,a,88,a)].
% 0.99/1.24 248 occurrence_of(c1,f10(f13(c1),c1)). [resolve(218,a,112,a)].
% 0.99/1.24 249 subactivity_occurrence(f13(c1),c1). [resolve(218,a,102,a)].
% 0.99/1.24 259 occurrence_of(c1,f9(f15(c1),c1)). [resolve(220,a,111,a)].
% 0.99/1.24 282 -occurrence_of(c1,A) | -leaf_occ(B,c1) | min_precedes(f13(c1),B,A) | f13(c1) = B. [resolve(249,a,125,b),flip(e),unit_del(c,227)].
% 0.99/1.24 353 min_precedes(f15(c1),f8(f15(c1),tptp0),tptp0) | min_precedes(f7(f15(c1),tptp0),f15(c1),tptp0). [resolve(231,a,209,a)].
% 0.99/1.24 445 f10(f13(c1),c1) = tptp0. [resolve(248,a,221,a),flip(a)].
% 0.99/1.24 505 f9(f15(c1),c1) = tptp0. [resolve(259,a,221,a),flip(a)].
% 0.99/1.24 522 -min_precedes(A,f13(c1),tptp0). [para(445(a,1),136(b,3)),unit_del(a,218)].
% 0.99/1.24 524 -min_precedes(f15(c1),A,tptp0). [para(505(a,1),128(b,3)),unit_del(a,220)].
% 0.99/1.24 528 min_precedes(f7(f15(c1),tptp0),f15(c1),tptp0). [back_unit_del(353),unit_del(a,524)].
% 0.99/1.24 638 -occurrence_of(c1,A) | min_precedes(f13(c1),f15(c1),A) | f15(c1) = f13(c1). [resolve(282,b,220,a),flip(c)].
% 0.99/1.24 663 min_precedes(f11(f7(f15(c1),tptp0),f15(c1),tptp0),f15(c1),tptp0). [resolve(528,a,119,a)].
% 0.99/1.24 1483 min_precedes(f11(f11(f7(f15(c1),tptp0),f15(c1),tptp0),f15(c1),tptp0),f15(c1),tptp0). [resolve(663,a,119,a)].
% 0.99/1.24 2105 min_precedes(f13(c1),f15(c1),tptp0) | f15(c1) = f13(c1). [resolve(638,a,88,a)].
% 0.99/1.24 2130 f15(c1) = f13(c1) | -occurrence_of(f15(c1),tptp1). [resolve(2105,a,100,d),unit_del(b,217),unit_del(c,218),unit_del(e,220)].
% 0.99/1.24 2131 f15(c1) = f13(c1) | -occurrence_of(f15(c1),tptp2). [resolve(2105,a,99,d),unit_del(b,217),unit_del(c,218),unit_del(e,220)].
% 0.99/1.24 2134 f15(c1) = f13(c1) | occurrence_of(f15(c1),tptp1). [resolve(2131,b,223,a)].
% 0.99/1.24 2135 f15(c1) = f13(c1). [resolve(2134,b,2130,b),merge(b)].
% 0.99/1.24 2363 $F. [back_rewrite(1483),rewrite([2135(2),2135(6),2135(10),2135(14)]),unit_del(a,522)].
% 0.99/1.24
% 0.99/1.24 % SZS output end Refutation
% 0.99/1.24 ============================== end of proof ==========================
% 0.99/1.24
% 0.99/1.24 ============================== STATISTICS ============================
% 0.99/1.24
% 0.99/1.24 Given=587. Generated=3688. Kept=2277. proofs=1.
% 0.99/1.24 Usable=500. Sos=673. Demods=15. Limbo=228, Disabled=1050. Hints=0.
% 0.99/1.24 Megabytes=3.94.
% 0.99/1.24 User_CPU=0.26, System_CPU=0.00, Wall_clock=0.
% 0.99/1.24
% 0.99/1.24 ============================== end of statistics =====================
% 0.99/1.24
% 0.99/1.24 ============================== end of search =========================
% 0.99/1.24
% 0.99/1.24 THEOREM PROVED
% 0.99/1.24 % SZS status Theorem
% 0.99/1.24
% 0.99/1.24 Exiting with 1 proof.
% 0.99/1.24
% 0.99/1.24 Process 3653 exit (max_proofs) Mon Jun 13 03:04:39 2022
% 0.99/1.24 Prover9 interrupted
%------------------------------------------------------------------------------