TSTP Solution File: PRO017+4 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PRO017+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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:16 EDT 2022
% Result : Theorem 228.29s 228.64s
% Output : Refutation 228.29s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : PRO017+4 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n025.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jun 13 02:59:38 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.43/1.03 ============================== Prover9 ===============================
% 0.43/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.03 Process 28880 was started by sandbox2 on n025.cluster.edu,
% 0.43/1.03 Mon Jun 13 02:59:39 2022
% 0.43/1.03 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_28727_n025.cluster.edu".
% 0.43/1.03 ============================== end of head ===========================
% 0.43/1.03
% 0.43/1.03 ============================== INPUT =================================
% 0.43/1.03
% 0.43/1.03 % Reading from file /tmp/Prover9_28727_n025.cluster.edu
% 0.43/1.03
% 0.43/1.03 set(prolog_style_variables).
% 0.43/1.03 set(auto2).
% 0.43/1.03 % set(auto2) -> set(auto).
% 0.43/1.03 % set(auto) -> set(auto_inference).
% 0.43/1.03 % set(auto) -> set(auto_setup).
% 0.43/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.43/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/1.03 % set(auto) -> set(auto_limits).
% 0.43/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/1.03 % set(auto) -> set(auto_denials).
% 0.43/1.03 % set(auto) -> set(auto_process).
% 0.43/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.43/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.43/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.43/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.43/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.43/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.43/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.43/1.03 % set(auto2) -> assign(stats, some).
% 0.43/1.03 % set(auto2) -> clear(echo_input).
% 0.43/1.03 % set(auto2) -> set(quiet).
% 0.43/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.43/1.03 % set(auto2) -> clear(print_given).
% 0.43/1.03 assign(lrs_ticks,-1).
% 0.43/1.03 assign(sos_limit,10000).
% 0.43/1.03 assign(order,kbo).
% 0.43/1.03 set(lex_order_vars).
% 0.43/1.03 clear(print_given).
% 0.43/1.03
% 0.43/1.03 % formulas(sos). % not echoed (46 formulas)
% 0.43/1.03
% 0.43/1.03 ============================== end of input ==========================
% 0.43/1.03
% 0.43/1.03 % From the command line: assign(max_seconds, 300).
% 0.43/1.03
% 0.43/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/1.03
% 0.43/1.03 % Formulas that are not ordinary clauses:
% 0.43/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.43/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.43/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.43/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.43/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.43/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.43/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.43/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.43/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.43/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.76/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.76/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.76/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.76/1.03 14 (all X43 (legal(X43) -> arboreal(X43))) # label(sos_13) # label(axiom) # label(non_clause). [assumption].
% 0.76/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.76/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.76/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.76/1.03 18 (all X53 all X54 (root(X53,X54) -> legal(X53))) # label(sos_17) # label(axiom) # label(non_clause). [assumption].
% 0.76/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.76/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.76/1.03 21 (all X61 all X62 (earlier(X61,X62) -> -earlier(X62,X61))) # label(sos_20) # label(axiom) # label(non_clause). [assumption].
% 0.76/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.76/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.76/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.76/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.76/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.76/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.76/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.76/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.76/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.76/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.76/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.76/1.03 33 (all X101 all X102 (occurrence_of(X102,tptp0) & subactivity_occurrence(X101,X102) & arboreal(X101) & -leaf_occ(X101,X102) -> (exists X103 exists X104 exists X105 (occurrence_of(X103,tptp3) & next_subocc(X101,X103,tptp0) & occurrence_of(X104,tptp4) & min_precedes(X103,X104,tptp0) & (occurrence_of(X105,tptp2) | occurrence_of(X105,tptp1)) & min_precedes(X104,X105,tptp0) & (all X106 (min_precedes(X103,X106,tptp0) -> X106 = X104 | X106 = X105)))))) # label(sos_32) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 34 -(all X107 all X108 (occurrence_of(X108,tptp0) & subactivity_occurrence(X107,X108) & arboreal(X107) & -leaf_occ(X107,X108) -> (exists X109 exists X110 (occurrence_of(X109,tptp3) & next_subocc(X107,X109,tptp0) & (occurrence_of(X110,tptp2) | occurrence_of(X110,tptp1)) & min_precedes(X109,X110,tptp0) & leaf(X110,tptp0))))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.76/1.03
% 0.76/1.03 ============================== end of process non-clausal formulas ===
% 0.76/1.03
% 0.76/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.76/1.03
% 0.76/1.03 ============================== PREDICATE ELIMINATION =================
% 0.76/1.03 35 -root_occ(A,B) | root(A,f10(A,B)) # label(sos_19) # label(axiom). [clausify(20)].
% 0.76/1.03 36 -min_precedes(A,B,C) | -root(B,C) # label(sos_22) # label(axiom). [clausify(23)].
% 0.76/1.03 37 -root(A,B) | legal(A) # label(sos_17) # label(axiom). [clausify(18)].
% 0.76/1.03 38 -root(A,B) | subactivity(f2(B,A),B) # label(sos_05) # label(axiom). [clausify(6)].
% 0.76/1.03 39 -root(A,B) | atocc(A,f2(B,A)) # label(sos_05) # label(axiom). [clausify(6)].
% 0.76/1.03 Derived: -root_occ(A,B) | -min_precedes(C,A,f10(A,B)). [resolve(35,b,36,b)].
% 0.76/1.03 Derived: -root_occ(A,B) | legal(A). [resolve(35,b,37,a)].
% 0.76/1.03 Derived: -root_occ(A,B) | subactivity(f2(f10(A,B),A),f10(A,B)). [resolve(35,b,38,a)].
% 0.76/1.03 Derived: -root_occ(A,B) | atocc(A,f2(f10(A,B),A)). [resolve(35,b,39,a)].
% 0.76/1.03 40 -occurrence_of(A,B) | atomic(B) | root(f1(B,A),B) # label(sos) # label(axiom). [clausify(1)].
% 0.76/1.03 Derived: -occurrence_of(A,B) | atomic(B) | -min_precedes(C,f1(B,A),B). [resolve(40,c,36,b)].
% 0.76/1.03 Derived: -occurrence_of(A,B) | atomic(B) | legal(f1(B,A)). [resolve(40,c,37,a)].
% 0.76/1.03 Derived: -occurrence_of(A,B) | atomic(B) | subactivity(f2(B,f1(B,A)),B). [resolve(40,c,38,a)].
% 0.76/1.03 Derived: -occurrence_of(A,B) | atomic(B) | atocc(f1(B,A),f2(B,f1(B,A))). [resolve(40,c,39,a)].
% 0.76/1.03 41 -min_precedes(A,B,C) | root(f11(A,B,C),C) # label(sos_23) # label(axiom). [clausify(24)].
% 0.76/1.03 Derived: -min_precedes(A,B,C) | -min_precedes(D,f11(A,B,C),C). [resolve(41,b,36,b)].
% 0.76/1.03 Derived: -min_precedes(A,B,C) | legal(f11(A,B,C)). [resolve(41,b,37,a)].
% 0.76/1.03 Derived: -min_precedes(A,B,C) | subactivity(f2(C,f11(A,B,C)),C). [resolve(41,b,38,a)].
% 0.76/1.03 Derived: -min_precedes(A,B,C) | atocc(f11(A,B,C),f2(C,f11(A,B,C))). [resolve(41,b,39,a)].
% 0.76/1.03 42 -leaf(A,B) | root(A,B) | min_precedes(f7(A,B),A,B) # label(sos_15) # label(axiom). [clausify(16)].
% 0.76/1.03 Derived: -leaf(A,B) | min_precedes(f7(A,B),A,B) | -min_precedes(C,A,B). [resolve(42,b,36,b)].
% 0.76/1.03 Derived: -leaf(A,B) | min_precedes(f7(A,B),A,B) | legal(A). [resolve(42,b,37,a)].
% 0.76/1.03 Derived: -leaf(A,B) | min_precedes(f7(A,B),A,B) | subactivity(f2(B,A),B). [resolve(42,b,38,a)].
% 0.76/1.03 Derived: -leaf(A,B) | min_precedes(f7(A,B),A,B) | atocc(A,f2(B,A)). [resolve(42,b,39,a)].
% 0.76/1.03 43 leaf(A,B) | -root(A,B) | min_precedes(A,f8(A,B),B) # label(sos_15) # label(axiom). [clausify(16)].
% 0.76/1.03 Derived: leaf(A,f10(A,B)) | min_precedes(A,f8(A,f10(A,B)),f10(A,B)) | -root_occ(A,B). [resolve(43,b,35,b)].
% 0.76/1.03 Derived: leaf(f1(A,B),A) | min_precedes(f1(A,B),f8(f1(A,B),A),A) | -occurrence_of(B,A) | atomic(A). [resolve(43,b,40,c)].
% 0.76/1.03 Derived: leaf(f11(A,B,C),C) | min_precedes(f11(A,B,C),f8(f11(A,B,C),C),C) | -min_precedes(A,B,C). [resolve(43,b,41,b)].
% 0.76/1.03 44 root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -root(A,C) # label(sos_19) # label(axiom). [clausify(20)].
% 0.76/1.03 Derived: root_occ(A,B) | -occurrence_of(B,f10(A,C)) | -subactivity_occurrence(A,B) | -root_occ(A,C). [resolve(44,d,35,b)].
% 0.76/1.03 Derived: root_occ(f1(A,B),C) | -occurrence_of(C,A) | -subactivity_occurrence(f1(A,B),C) | -occurrence_of(B,A) | atomic(A). [resolve(44,d,40,c)].
% 0.76/1.03 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(44,d,41,b)].
% 0.76/1.03 Derived: root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -leaf(A,C) | min_precedes(f7(A,C),A,C). [resolve(44,d,42,b)].
% 0.76/1.04 45 -precedes(A,B) | legal(B) # label(sos_21) # label(axiom). [clausify(22)].
% 0.76/1.04 46 -legal(A) | arboreal(A) # label(sos_13) # label(axiom). [clausify(14)].
% 0.76/1.04 Derived: -precedes(A,B) | arboreal(B). [resolve(45,b,46,a)].
% 0.76/1.04 47 precedes(A,B) | -earlier(A,B) | -legal(B) # label(sos_21) # label(axiom). [clausify(22)].
% 0.76/1.04 Derived: precedes(A,B) | -earlier(A,B) | -precedes(C,B). [resolve(47,c,45,b)].
% 0.76/1.04 48 -root_occ(A,B) | legal(A). [resolve(35,b,37,a)].
% 0.76/1.04 Derived: -root_occ(A,B) | arboreal(A). [resolve(48,b,46,a)].
% 0.76/1.04 Derived: -root_occ(A,B) | precedes(C,A) | -earlier(C,A). [resolve(48,b,47,c)].
% 0.76/1.04 49 -occurrence_of(A,B) | atomic(B) | legal(f1(B,A)). [resolve(40,c,37,a)].
% 0.76/1.04 Derived: -occurrence_of(A,B) | atomic(B) | arboreal(f1(B,A)). [resolve(49,c,46,a)].
% 0.76/1.04 Derived: -occurrence_of(A,B) | atomic(B) | precedes(C,f1(B,A)) | -earlier(C,f1(B,A)). [resolve(49,c,47,c)].
% 0.76/1.04 50 -min_precedes(A,B,C) | legal(f11(A,B,C)). [resolve(41,b,37,a)].
% 0.76/1.04 Derived: -min_precedes(A,B,C) | arboreal(f11(A,B,C)). [resolve(50,b,46,a)].
% 0.76/1.04 Derived: -min_precedes(A,B,C) | precedes(D,f11(A,B,C)) | -earlier(D,f11(A,B,C)). [resolve(50,b,47,c)].
% 0.76/1.04 51 -leaf(A,B) | min_precedes(f7(A,B),A,B) | legal(A). [resolve(42,b,37,a)].
% 0.76/1.04 Derived: -leaf(A,B) | min_precedes(f7(A,B),A,B) | arboreal(A). [resolve(51,c,46,a)].
% 0.76/1.04 Derived: -leaf(A,B) | min_precedes(f7(A,B),A,B) | precedes(C,A) | -earlier(C,A). [resolve(51,c,47,c)].
% 0.76/1.04 52 -activity_occurrence(A) | occurrence_of(A,f5(A)) # label(sos_12) # label(axiom). [clausify(13)].
% 0.76/1.04 53 -occurrence_of(A,B) | activity_occurrence(A) # label(sos_03) # label(axiom). [clausify(4)].
% 0.76/1.04 54 -subactivity_occurrence(A,B) | activity_occurrence(A) # label(sos_11) # label(axiom). [clausify(12)].
% 0.76/1.04 55 -subactivity_occurrence(A,B) | activity_occurrence(B) # label(sos_11) # label(axiom). [clausify(12)].
% 0.76/1.04 Derived: occurrence_of(A,f5(A)) | -occurrence_of(A,B). [resolve(52,a,53,b)].
% 0.76/1.04 Derived: occurrence_of(A,f5(A)) | -subactivity_occurrence(A,B). [resolve(52,a,54,b)].
% 0.76/1.04 Derived: occurrence_of(A,f5(A)) | -subactivity_occurrence(B,A). [resolve(52,a,55,b)].
% 0.76/1.04 56 atocc(A,B) | -subactivity(B,C) | -atomic(C) | -occurrence_of(A,C) # label(sos_14) # label(axiom). [clausify(15)].
% 0.76/1.04 57 -atocc(A,B) | atomic(f6(A,B)) # label(sos_14) # label(axiom). [clausify(15)].
% 0.76/1.04 58 -atocc(A,B) | subactivity(B,f6(A,B)) # label(sos_14) # label(axiom). [clausify(15)].
% 0.76/1.04 59 -atocc(A,B) | occurrence_of(A,f6(A,B)) # label(sos_14) # label(axiom). [clausify(15)].
% 0.76/1.04 Derived: -subactivity(A,B) | -atomic(B) | -occurrence_of(C,B) | atomic(f6(C,A)). [resolve(56,a,57,a)].
% 0.76/1.04 Derived: -subactivity(A,B) | -atomic(B) | -occurrence_of(C,B) | subactivity(A,f6(C,A)). [resolve(56,a,58,a)].
% 0.76/1.04 Derived: -subactivity(A,B) | -atomic(B) | -occurrence_of(C,B) | occurrence_of(C,f6(C,A)). [resolve(56,a,59,a)].
% 0.76/1.04 60 -root_occ(A,B) | atocc(A,f2(f10(A,B),A)). [resolve(35,b,39,a)].
% 0.76/1.04 Derived: -root_occ(A,B) | atomic(f6(A,f2(f10(A,B),A))). [resolve(60,b,57,a)].
% 0.76/1.04 Derived: -root_occ(A,B) | subactivity(f2(f10(A,B),A),f6(A,f2(f10(A,B),A))). [resolve(60,b,58,a)].
% 0.76/1.04 Derived: -root_occ(A,B) | occurrence_of(A,f6(A,f2(f10(A,B),A))). [resolve(60,b,59,a)].
% 0.76/1.04 61 -occurrence_of(A,B) | atomic(B) | atocc(f1(B,A),f2(B,f1(B,A))). [resolve(40,c,39,a)].
% 0.76/1.04 Derived: -occurrence_of(A,B) | atomic(B) | atomic(f6(f1(B,A),f2(B,f1(B,A)))). [resolve(61,c,57,a)].
% 0.76/1.04 Derived: -occurrence_of(A,B) | atomic(B) | subactivity(f2(B,f1(B,A)),f6(f1(B,A),f2(B,f1(B,A)))). [resolve(61,c,58,a)].
% 0.76/1.04 Derived: -occurrence_of(A,B) | atomic(B) | occurrence_of(f1(B,A),f6(f1(B,A),f2(B,f1(B,A)))). [resolve(61,c,59,a)].
% 0.76/1.04 62 -min_precedes(A,B,C) | atocc(f11(A,B,C),f2(C,f11(A,B,C))). [resolve(41,b,39,a)].
% 0.76/1.04 Derived: -min_precedes(A,B,C) | atomic(f6(f11(A,B,C),f2(C,f11(A,B,C)))). [resolve(62,b,57,a)].
% 0.76/1.04 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(62,b,58,a)].
% 0.76/1.04 Derived: -min_precedes(A,B,C) | occurrence_of(f11(A,B,C),f6(f11(A,B,C),f2(C,f11(A,B,C)))). [resolve(62,b,59,a)].
% 0.76/1.04 63 -leaf(A,B) | min_precedes(f7(A,B),A,B) | atocc(A,f2(B,A)). [resolve(42,b,39,a)].
% 0.76/1.04 Derived: -leaf(A,B) | min_precedes(f7(A,B),A,B) | atomic(f6(A,f2(B,A))). [resolve(63,c,57,a)].
% 228.29/228.64 Derived: -leaf(A,B) | min_precedes(f7(A,B),A,B) | subactivity(f2(B,A),f6(A,f2(B,A))). [resolve(63,c,58,a)].
% 228.29/228.64 Derived: -leaf(A,B) | min_precedes(f7(A,B),A,B) | occurrence_of(A,f6(A,f2(B,A))). [resolve(63,c,59,a)].
% 228.29/228.64
% 228.29/228.64 ============================== end predicate elimination =============
% 228.29/228.64
% 228.29/228.64 Auto_denials: (non-Horn, no changes).
% 228.29/228.64
% 228.29/228.64 Term ordering decisions:
% 228.29/228.64
% 228.29/228.64 % Assigning unary symbol f5 kb_weight 0 and highest precedence (35).
% 228.29/228.64 Function symbol KB weights: tptp0=1. tptp1=1. tptp2=1. tptp3=1. tptp4=1. c1=1. c2=1. f1=1. f2=1. f4=1. f6=1. f7=1. f8=1. f9=1. f10=1. f13=1. f14=1. f15=1. f3=1. f11=1. f12=1. f5=0.
% 228.29/228.64
% 228.29/228.64 ============================== end of process initial clauses ========
% 228.29/228.64
% 228.29/228.64 ============================== CLAUSES FOR SEARCH ====================
% 228.29/228.64
% 228.29/228.64 ============================== end of clauses for search =============
% 228.29/228.64
% 228.29/228.64 ============================== SEARCH ================================
% 228.29/228.64
% 228.29/228.64 % Starting search at 0.03 seconds.
% 228.29/228.64
% 228.29/228.64 Low Water (keep): wt=73.000, iters=3810
% 228.29/228.64
% 228.29/228.64 Low Water (keep): wt=58.000, iters=3387
% 228.29/228.64
% 228.29/228.64 Low Water (keep): wt=53.000, iters=3432
% 228.29/228.64
% 228.29/228.64 Low Water (keep): wt=46.000, iters=3472
% 228.29/228.64
% 228.29/228.64 Low Water (keep): wt=43.000, iters=3459
% 228.29/228.64
% 228.29/228.64 Low Water (keep): wt=36.000, iters=3754
% 228.29/228.64
% 228.29/228.64 Low Water (keep): wt=35.000, iters=3647
% 228.29/228.64
% 228.29/228.64 Low Water (keep): wt=34.000, iters=3863
% 228.29/228.64
% 228.29/228.64 Low Water (keep): wt=33.000, iters=3660
% 228.29/228.64
% 228.29/228.64 Low Water (keep): wt=32.000, iters=3534
% 228.29/228.64
% 228.29/228.64 Low Water (keep): wt=31.000, iters=3442
% 228.29/228.64
% 228.29/228.64 Low Water (displace): id=7744, wt=175.000
% 228.29/228.64
% 228.29/228.64 Low Water (displace): id=7745, wt=173.000
% 228.29/228.64
% 228.29/228.64 Low Water (displace): id=7741, wt=160.000
% 228.29/228.64
% 228.29/228.64 Low Water (displace): id=7738, wt=154.000
% 228.29/228.64
% 228.29/228.64 Low Water (displace): id=7736, wt=151.000
% 228.29/228.64
% 228.29/228.64 Low Water (displace): id=7734, wt=150.000
% 228.29/228.64
% 228.29/228.64 Low Water (displace): id=7747, wt=127.000
% 228.29/228.64
% 228.29/228.64 Low Water (displace): id=7748, wt=123.000
% 228.29/228.64
% 228.29/228.64 Low Water (displace): id=7749, wt=122.000
% 228.29/228.64
% 228.29/228.64 Low Water (displace): id=7897, wt=121.000
% 228.29/228.64
% 228.29/228.64 Low Water (displace): id=7750, wt=120.000
% 228.29/228.64
% 228.29/228.64 Low Water (displace): id=7891, wt=119.000
% 228.29/228.64
% 228.29/228.64 Low Water (displace): id=7788, wt=118.000
% 228.29/228.64
% 228.29/228.64 Low Water (displace): id=6299, wt=117.000
% 228.29/228.64
% 228.29/228.64 Low Water (displace): id=23588, wt=34.000
% 228.29/228.64
% 228.29/228.64 Low Water (displace): id=23631, wt=31.000
% 228.29/228.64
% 228.29/228.64 Low Water (displace): id=23633, wt=30.000
% 228.29/228.64
% 228.29/228.64 Low Water (displace): id=23719, wt=29.000
% 228.29/228.64
% 228.29/228.64 Low Water (displace): id=23739, wt=27.000
% 228.29/228.64
% 228.29/228.64 Low Water (displace): id=23761, wt=25.000
% 228.29/228.64
% 228.29/228.64 Low Water (keep): wt=30.000, iters=3871
% 228.29/228.64
% 228.29/228.64 Low Water (keep): wt=29.000, iters=3334
% 228.29/228.64
% 228.29/228.64 Low Water (displace): id=25138, wt=24.000
% 228.29/228.64
% 228.29/228.64 Low Water (displace): id=26064, wt=22.000
% 228.29/228.64
% 228.29/228.64 Low Water (displace): id=26097, wt=20.000
% 228.29/228.64
% 228.29/228.64 Low Water (displace): id=26204, wt=19.000
% 228.29/228.64
% 228.29/228.64 Low Water (displace): id=31688, wt=18.000
% 228.29/228.64
% 228.29/228.64 Low Water (displace): id=33231, wt=17.000
% 228.29/228.64
% 228.29/228.64 Low Water (keep): wt=28.000, iters=3429
% 228.29/228.64
% 228.29/228.64 ============================== PROOF =================================
% 228.29/228.64 % SZS status Theorem
% 228.29/228.64 % SZS output start Refutation
% 228.29/228.64
% 228.29/228.64 % Proof 1 at 227.07 (+ 0.53) seconds.
% 228.29/228.64 % Length of proof is 68.
% 228.29/228.64 % Level of proof is 11.
% 228.29/228.64 % Maximum clause weight is 38.000.
% 228.29/228.64 % Given clauses 37526.
% 228.29/228.64
% 228.29/228.64 4 (all X12 all X13 (occurrence_of(X13,X12) -> activity(X12) & activity_occurrence(X13))) # label(sos_03) # label(axiom) # label(non_clause). [assumption].
% 228.29/228.64 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].
% 228.29/228.64 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].
% 228.29/228.64 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].
% 228.29/228.64 12 (all X39 all X40 (subactivity_occurrence(X39,X40) -> activity_occurrence(X39) & activity_occurrence(X40))) # label(sos_11) # label(axiom) # label(non_clause). [assumption].
% 228.29/228.64 13 (all X41 (activity_occurrence(X41) -> (exists X42 (activity(X42) & occurrence_of(X41,X42))))) # label(sos_12) # label(axiom) # label(non_clause). [assumption].
% 228.29/228.64 17 (all X51 all X52 (occurrence_of(X51,X52) -> (arboreal(X51) <-> atomic(X52)))) # label(sos_16) # label(axiom) # label(non_clause). [assumption].
% 228.29/228.64 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].
% 228.29/228.64 33 (all X101 all X102 (occurrence_of(X102,tptp0) & subactivity_occurrence(X101,X102) & arboreal(X101) & -leaf_occ(X101,X102) -> (exists X103 exists X104 exists X105 (occurrence_of(X103,tptp3) & next_subocc(X101,X103,tptp0) & occurrence_of(X104,tptp4) & min_precedes(X103,X104,tptp0) & (occurrence_of(X105,tptp2) | occurrence_of(X105,tptp1)) & min_precedes(X104,X105,tptp0) & (all X106 (min_precedes(X103,X106,tptp0) -> X106 = X104 | X106 = X105)))))) # label(sos_32) # label(axiom) # label(non_clause). [assumption].
% 228.29/228.64 34 -(all X107 all X108 (occurrence_of(X108,tptp0) & subactivity_occurrence(X107,X108) & arboreal(X107) & -leaf_occ(X107,X108) -> (exists X109 exists X110 (occurrence_of(X109,tptp3) & next_subocc(X107,X109,tptp0) & (occurrence_of(X110,tptp2) | occurrence_of(X110,tptp1)) & min_precedes(X109,X110,tptp0) & leaf(X110,tptp0))))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 228.29/228.64 52 -activity_occurrence(A) | occurrence_of(A,f5(A)) # label(sos_12) # label(axiom). [clausify(13)].
% 228.29/228.64 53 -occurrence_of(A,B) | activity_occurrence(A) # label(sos_03) # label(axiom). [clausify(4)].
% 228.29/228.64 54 -subactivity_occurrence(A,B) | activity_occurrence(A) # label(sos_11) # label(axiom). [clausify(12)].
% 228.29/228.64 67 atomic(tptp3) # label(sos_38) # label(axiom). [assumption].
% 228.29/228.64 68 arboreal(c1) # label(goals) # label(negated_conjecture). [clausify(34)].
% 228.29/228.64 69 occurrence_of(c2,tptp0) # label(goals) # label(negated_conjecture). [clausify(34)].
% 228.29/228.64 70 subactivity_occurrence(c1,c2) # label(goals) # label(negated_conjecture). [clausify(34)].
% 228.29/228.64 72 tptp4 != tptp3 # label(sos_39) # label(axiom). [assumption].
% 228.29/228.64 75 tptp3 != tptp2 # label(sos_42) # label(axiom). [assumption].
% 228.29/228.64 76 tptp3 != tptp1 # label(sos_43) # label(axiom). [assumption].
% 228.29/228.64 78 -leaf_occ(c1,c2) # label(goals) # label(negated_conjecture). [clausify(34)].
% 228.29/228.64 81 -occurrence_of(A,B) | -leaf_occ(C,A) | -min_precedes(C,D,B) # label(sos_09) # label(axiom). [clausify(10)].
% 228.29/228.64 92 -occurrence_of(A,B) | arboreal(A) | -atomic(B) # label(sos_16) # label(axiom). [clausify(17)].
% 228.29/228.64 97 -next_subocc(A,B,C) | min_precedes(A,B,C) # label(sos_26) # label(axiom). [clausify(27)].
% 228.29/228.64 98 -occurrence_of(A,B) | -occurrence_of(A,C) | C = B # label(sos_08) # label(axiom). [clausify(9)].
% 228.29/228.64 101 -min_precedes(A,B,C) | occurrence_of(f3(C,A,B),C) # label(sos_06) # label(axiom). [clausify(7)].
% 228.29/228.64 103 -min_precedes(A,B,C) | subactivity_occurrence(B,f3(C,A,B)) # label(sos_06) # label(axiom). [clausify(7)].
% 228.29/228.64 115 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | occurrence_of(f13(B,A),tptp3) # label(sos_32) # label(axiom). [clausify(33)].
% 228.29/228.64 116 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | occurrence_of(f14(B,A),tptp4) # label(sos_32) # label(axiom). [clausify(33)].
% 228.29/228.64 117 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | next_subocc(B,f13(B,A),tptp0) # label(sos_32) # label(axiom). [clausify(33)].
% 228.29/228.64 119 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | min_precedes(f13(B,A),f14(B,A),tptp0) # label(sos_32) # label(axiom). [clausify(33)].
% 228.29/228.64 120 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | min_precedes(f14(B,A),f15(B,A),tptp0) # label(sos_32) # label(axiom). [clausify(33)].
% 228.29/228.64 121 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | occurrence_of(f15(B,A),tptp2) | occurrence_of(f15(B,A),tptp1) # label(sos_32) # label(axiom). [clausify(33)].
% 228.29/228.64 124 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | -min_precedes(f13(B,A),C,tptp0) | C = f14(B,A) | C = f15(B,A) # label(sos_32) # label(axiom). [clausify(33)].
% 228.29/228.64 125 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | -min_precedes(f13(B,A),C,tptp0) | f14(B,A) = C | f15(B,A) = C. [copy(124),flip(f),flip(g)].
% 228.29/228.65 151 occurrence_of(A,f5(A)) | -occurrence_of(A,B). [resolve(52,a,53,b)].
% 228.29/228.65 152 occurrence_of(A,f5(A)) | -subactivity_occurrence(A,B). [resolve(52,a,54,b)].
% 228.29/228.65 176 occurrence_of(f13(c1,c2),tptp3). [resolve(115,b,70,a),unit_del(a,69),unit_del(b,68),unit_del(c,78)].
% 228.29/228.65 177 occurrence_of(f14(c1,c2),tptp4). [resolve(116,b,70,a),unit_del(a,69),unit_del(b,68),unit_del(c,78)].
% 228.29/228.65 178 next_subocc(c1,f13(c1,c2),tptp0). [resolve(117,b,70,a),unit_del(a,69),unit_del(b,68),unit_del(c,78)].
% 228.29/228.65 179 min_precedes(f13(c1,c2),f14(c1,c2),tptp0). [resolve(119,b,70,a),unit_del(a,69),unit_del(b,68),unit_del(c,78)].
% 228.29/228.65 180 min_precedes(f14(c1,c2),f15(c1,c2),tptp0). [resolve(120,b,70,a),unit_del(a,69),unit_del(b,68),unit_del(c,78)].
% 228.29/228.65 181 occurrence_of(f15(c1,c2),tptp2) | occurrence_of(f15(c1,c2),tptp1). [resolve(121,b,70,a),unit_del(a,69),unit_del(b,68),unit_del(c,78)].
% 228.29/228.65 228 arboreal(f13(c1,c2)). [resolve(176,a,92,a),unit_del(b,67)].
% 228.29/228.65 229 occurrence_of(f14(c1,c2),f5(f14(c1,c2))). [resolve(177,a,151,b)].
% 228.29/228.65 230 -occurrence_of(f14(c1,c2),A) | tptp4 = A. [resolve(177,a,98,b)].
% 228.29/228.65 240 min_precedes(c1,f13(c1,c2),tptp0). [resolve(178,a,97,a)].
% 228.29/228.65 260 subactivity_occurrence(f13(c1,c2),f3(tptp0,c1,f13(c1,c2))). [resolve(240,a,103,a)].
% 228.29/228.65 262 occurrence_of(f3(tptp0,c1,f13(c1,c2)),tptp0). [resolve(240,a,101,a)].
% 228.29/228.65 289 -occurrence_of(A,tptp0) | -leaf_occ(f13(c1,c2),A). [resolve(179,a,81,c)].
% 228.29/228.65 313 subactivity_occurrence(f15(c1,c2),f3(tptp0,f14(c1,c2),f15(c1,c2))). [resolve(180,a,103,a)].
% 228.29/228.65 389 f5(f14(c1,c2)) = tptp4. [resolve(230,a,229,a),flip(a)].
% 228.29/228.65 433 leaf_occ(f13(c1,c2),f3(tptp0,c1,f13(c1,c2))) | next_subocc(f13(c1,c2),f13(f13(c1,c2),f3(tptp0,c1,f13(c1,c2))),tptp0). [resolve(260,a,117,b),unit_del(a,262),unit_del(b,228)].
% 228.29/228.65 435 leaf_occ(f13(c1,c2),f3(tptp0,c1,f13(c1,c2))) | occurrence_of(f13(f13(c1,c2),f3(tptp0,c1,f13(c1,c2))),tptp3). [resolve(260,a,115,b),unit_del(a,262),unit_del(b,228)].
% 228.29/228.65 680 occurrence_of(f15(c1,c2),f5(f15(c1,c2))). [resolve(313,a,152,b)].
% 228.29/228.65 695 -occurrence_of(f15(c1,c2),A) | f5(f15(c1,c2)) = A. [resolve(680,a,98,b)].
% 228.29/228.65 701 f5(f15(c1,c2)) = tptp2 | occurrence_of(f15(c1,c2),tptp1). [resolve(695,a,181,a)].
% 228.29/228.65 702 f5(f15(c1,c2)) = tptp2 | f5(f15(c1,c2)) = tptp1. [resolve(701,b,695,a)].
% 228.29/228.65 1736 leaf_occ(f13(c1,c2),f3(tptp0,c1,f13(c1,c2))) | min_precedes(f13(c1,c2),f13(f13(c1,c2),f3(tptp0,c1,f13(c1,c2))),tptp0). [resolve(433,b,97,a)].
% 228.29/228.65 1760 occurrence_of(f13(f13(c1,c2),f3(tptp0,c1,f13(c1,c2))),tptp3). [resolve(435,a,289,b),unit_del(b,262)].
% 228.29/228.65 1761 occurrence_of(f13(f13(c1,c2),f3(tptp0,c1,f13(c1,c2))),f5(f13(f13(c1,c2),f3(tptp0,c1,f13(c1,c2))))). [resolve(1760,a,151,b)].
% 228.29/228.65 1762 -occurrence_of(f13(f13(c1,c2),f3(tptp0,c1,f13(c1,c2))),A) | tptp3 = A. [resolve(1760,a,98,b)].
% 228.29/228.65 6930 f5(f13(f13(c1,c2),f3(tptp0,c1,f13(c1,c2)))) = tptp3. [resolve(1761,a,1762,a),flip(a)].
% 228.29/228.65 12827 leaf_occ(f13(c1,c2),f3(tptp0,c1,f13(c1,c2))) | f13(f13(c1,c2),f3(tptp0,c1,f13(c1,c2))) = f14(c1,c2) | f13(f13(c1,c2),f3(tptp0,c1,f13(c1,c2))) = f15(c1,c2). [resolve(1736,b,125,e),flip(f),flip(g),unit_del(b,69),unit_del(c,70),unit_del(d,68),unit_del(e,78)].
% 228.29/228.65 42163 f13(f13(c1,c2),f3(tptp0,c1,f13(c1,c2))) = f14(c1,c2) | f13(f13(c1,c2),f3(tptp0,c1,f13(c1,c2))) = f15(c1,c2). [resolve(12827,a,289,b),unit_del(c,262)].
% 228.29/228.65 56666 f13(f13(c1,c2),f3(tptp0,c1,f13(c1,c2))) = f14(c1,c2) | f5(f15(c1,c2)) = tptp3. [para(42163(b,1),6930(a,1,1))].
% 228.29/228.65 56685 f5(f15(c1,c2)) = tptp3. [para(56666(a,1),6930(a,1,1)),rewrite([389(10)]),unit_del(b,72)].
% 228.29/228.65 56783 $F. [back_rewrite(702),rewrite([56685(4),56685(7)]),unit_del(a,75),unit_del(b,76)].
% 228.29/228.65
% 228.29/228.65 % SZS output end Refutation
% 228.29/228.65 ============================== end of proof ==========================
% 228.29/228.65
% 228.29/228.65 ============================== STATISTICS ============================
% 228.29/228.65
% 228.29/228.65 Given=37526. Generated=849695. Kept=56718. proofs=1.
% 228.29/228.65 Usable=32207. Sos=6685. Demods=122. Limbo=98, Disabled=17864. Hints=0.
% 228.29/228.65 Megabytes=84.63.
% 228.29/228.65 User_CPU=227.07, System_CPU=0.53, Wall_clock=227.
% 228.29/228.65
% 228.29/228.65 ============================== end of statistics =====================
% 228.29/228.65
% 228.29/228.65 ============================== end of search =========================
% 228.29/228.65
% 228.29/228.65 THEOREM PROVED
% 228.29/228.65 % SZS status Theorem
% 228.29/228.65
% 228.29/228.65 Exiting with 1 proof.
% 228.29/228.65
% 228.29/228.65 Process 28880 exit (max_proofs) Mon Jun 13 03:03:27 2022
% 228.29/228.65 Prover9 interrupted
%------------------------------------------------------------------------------