TSTP Solution File: PRO003+4 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PRO003+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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:04 EDT 2022
% Result : Theorem 3.83s 4.17s
% Output : Refutation 3.83s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : PRO003+4 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.35 % Computer : n028.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Mon Jun 13 01:39:52 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.46/1.06 ============================== Prover9 ===============================
% 0.46/1.06 Prover9 (32) version 2009-11A, November 2009.
% 0.46/1.06 Process 21799 was started by sandbox2 on n028.cluster.edu,
% 0.46/1.06 Mon Jun 13 01:39:52 2022
% 0.46/1.06 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_21646_n028.cluster.edu".
% 0.46/1.06 ============================== end of head ===========================
% 0.46/1.06
% 0.46/1.06 ============================== INPUT =================================
% 0.46/1.06
% 0.46/1.06 % Reading from file /tmp/Prover9_21646_n028.cluster.edu
% 0.46/1.06
% 0.46/1.06 set(prolog_style_variables).
% 0.46/1.06 set(auto2).
% 0.46/1.06 % set(auto2) -> set(auto).
% 0.46/1.06 % set(auto) -> set(auto_inference).
% 0.46/1.06 % set(auto) -> set(auto_setup).
% 0.46/1.06 % set(auto_setup) -> set(predicate_elim).
% 0.46/1.06 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.46/1.06 % set(auto) -> set(auto_limits).
% 0.46/1.06 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.46/1.06 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.46/1.06 % set(auto) -> set(auto_denials).
% 0.46/1.06 % set(auto) -> set(auto_process).
% 0.46/1.06 % set(auto2) -> assign(new_constants, 1).
% 0.46/1.06 % set(auto2) -> assign(fold_denial_max, 3).
% 0.46/1.06 % set(auto2) -> assign(max_weight, "200.000").
% 0.46/1.06 % set(auto2) -> assign(max_hours, 1).
% 0.46/1.06 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.46/1.06 % set(auto2) -> assign(max_seconds, 0).
% 0.46/1.06 % set(auto2) -> assign(max_minutes, 5).
% 0.46/1.06 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.46/1.06 % set(auto2) -> set(sort_initial_sos).
% 0.46/1.06 % set(auto2) -> assign(sos_limit, -1).
% 0.46/1.06 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.46/1.06 % set(auto2) -> assign(max_megs, 400).
% 0.46/1.06 % set(auto2) -> assign(stats, some).
% 0.46/1.06 % set(auto2) -> clear(echo_input).
% 0.46/1.06 % set(auto2) -> set(quiet).
% 0.46/1.06 % set(auto2) -> clear(print_initial_clauses).
% 0.46/1.06 % set(auto2) -> clear(print_given).
% 0.46/1.06 assign(lrs_ticks,-1).
% 0.46/1.06 assign(sos_limit,10000).
% 0.46/1.06 assign(order,kbo).
% 0.46/1.06 set(lex_order_vars).
% 0.46/1.06 clear(print_given).
% 0.46/1.06
% 0.46/1.06 % formulas(sos). % not echoed (47 formulas)
% 0.46/1.06
% 0.46/1.06 ============================== end of input ==========================
% 0.46/1.06
% 0.46/1.06 % From the command line: assign(max_seconds, 300).
% 0.46/1.06
% 0.46/1.06 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.46/1.06
% 0.46/1.06 % Formulas that are not ordinary clauses:
% 0.46/1.06 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.46/1.06 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.46/1.06 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.46/1.06 4 (all X12 all X13 (occurrence_of(X13,X12) -> activity(X12) & activity_occurrence(X13))) # label(sos_03) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.06 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.46/1.06 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.46/1.06 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.46/1.06 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.46/1.06 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.46/1.06 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.46/1.06 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.46/1.06 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.46/1.06 13 (all X41 (activity_occurrence(X41) -> (exists X42 (activity(X42) & occurrence_of(X41,X42))))) # label(sos_12) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.06 14 (all X43 (legal(X43) -> arboreal(X43))) # label(sos_13) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.06 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.46/1.06 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.46/1.06 17 (all X51 all X52 (occurrence_of(X51,X52) -> (arboreal(X51) <-> atomic(X52)))) # label(sos_16) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.06 18 (all X53 all X54 (root(X53,X54) -> legal(X53))) # label(sos_17) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.06 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.46/1.06 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.46/1.06 21 (all X61 all X62 (earlier(X61,X62) -> -earlier(X62,X61))) # label(sos_20) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.06 22 (all X63 all X64 (precedes(X63,X64) <-> earlier(X63,X64) & legal(X64))) # label(sos_21) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.06 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.46/1.06 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.46/1.06 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.46/1.06 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.46/1.06 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.46/1.06 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.46/1.06 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.46/1.06 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.46/1.06 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.46/1.06 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.46/1.06 33 (all X101 (occurrence_of(X101,tptp0) -> (exists X102 exists X103 (occurrence_of(X102,tptp4) & root_occ(X102,X101) & occurrence_of(X103,tptp3) & leaf_occ(X103,X101) & next_subocc(X102,X103,tptp0))))) # label(sos_32) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.06 34 (all X104 all X105 (occurrence_of(X105,tptp0) & root_occ(X104,X105) -> (exists X106 (occurrence_of(X106,tptp1) & next_subocc(X104,X106,tptp0))))) # label(sos_45) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.06 35 --(exists X107 occurrence_of(X107,tptp0)) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.46/1.06
% 0.46/1.06 ============================== end of process non-clausal formulas ===
% 0.46/1.06
% 0.46/1.06 ============================== PROCESS INITIAL CLAUSES ===============
% 0.46/1.06
% 0.46/1.06 ============================== PREDICATE ELIMINATION =================
% 0.46/1.06 36 -leaf_occ(A,B) | leaf(A,f9(A,B)) # label(sos_18) # label(axiom). [clausify(19)].
% 0.46/1.06 37 -leaf(A,B) | -min_precedes(A,C,B) # label(sos_15) # label(axiom). [clausify(16)].
% 0.46/1.06 Derived: -leaf_occ(A,B) | -min_precedes(A,C,f9(A,B)). [resolve(36,b,37,a)].
% 0.46/1.06 38 -leaf(A,B) | atomic(B) | occurrence_of(f4(A,B),B) # label(sos_07) # label(axiom). [clausify(8)].
% 0.46/1.06 Derived: atomic(f9(A,B)) | occurrence_of(f4(A,f9(A,B)),f9(A,B)) | -leaf_occ(A,B). [resolve(38,a,36,b)].
% 0.46/1.06 39 -leaf(A,B) | atomic(B) | leaf_occ(A,f4(A,B)) # label(sos_07) # label(axiom). [clausify(8)].
% 0.46/1.06 Derived: atomic(f9(A,B)) | leaf_occ(A,f4(A,f9(A,B))) | -leaf_occ(A,B). [resolve(39,a,36,b)].
% 0.46/1.06 40 -leaf(A,B) | root(A,B) | min_precedes(f7(A,B),A,B) # label(sos_15) # label(axiom). [clausify(16)].
% 0.46/1.06 Derived: root(A,f9(A,B)) | min_precedes(f7(A,f9(A,B)),A,f9(A,B)) | -leaf_occ(A,B). [resolve(40,a,36,b)].
% 0.46/1.06 41 leaf(A,B) | -root(A,B) | min_precedes(A,f8(A,B),B) # label(sos_15) # label(axiom). [clausify(16)].
% 0.46/1.06 Derived: -root(A,B) | min_precedes(A,f8(A,B),B) | -min_precedes(A,C,B). [resolve(41,a,37,a)].
% 0.46/1.06 Derived: -root(A,B) | min_precedes(A,f8(A,B),B) | atomic(B) | occurrence_of(f4(A,B),B). [resolve(41,a,38,a)].
% 0.46/1.06 Derived: -root(A,B) | min_precedes(A,f8(A,B),B) | atomic(B) | leaf_occ(A,f4(A,B)). [resolve(41,a,39,a)].
% 0.46/1.06 42 leaf_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -leaf(A,C) # label(sos_18) # label(axiom). [clausify(19)].
% 0.46/1.06 Derived: leaf_occ(A,B) | -occurrence_of(B,f9(A,C)) | -subactivity_occurrence(A,B) | -leaf_occ(A,C). [resolve(42,d,36,b)].
% 0.46/1.06 Derived: leaf_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -root(A,C) | min_precedes(A,f8(A,C),C). [resolve(42,d,41,a)].
% 0.46/1.06 43 leaf(A,B) | -min_precedes(C,A,B) | min_precedes(A,f8(A,B),B) # label(sos_15) # label(axiom). [clausify(16)].
% 0.46/1.06 Derived: -min_precedes(A,B,C) | min_precedes(B,f8(B,C),C) | -min_precedes(B,D,C). [resolve(43,a,37,a)].
% 0.46/1.06 Derived: -min_precedes(A,B,C) | min_precedes(B,f8(B,C),C) | atomic(C) | occurrence_of(f4(B,C),C). [resolve(43,a,38,a)].
% 0.46/1.06 Derived: -min_precedes(A,B,C) | min_precedes(B,f8(B,C),C) | atomic(C) | leaf_occ(B,f4(B,C)). [resolve(43,a,39,a)].
% 0.46/1.06 Derived: -min_precedes(A,B,C) | min_precedes(B,f8(B,C),C) | root(B,C) | min_precedes(f7(B,C),B,C). [resolve(43,a,40,a)].
% 0.46/1.06 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(43,a,42,d)].
% 0.46/1.06 44 -root_occ(A,B) | root(A,f10(A,B)) # label(sos_19) # label(axiom). [clausify(20)].
% 0.46/1.06 45 -min_precedes(A,B,C) | -root(B,C) # label(sos_22) # label(axiom). [clausify(23)].
% 0.46/1.06 46 -root(A,B) | legal(A) # label(sos_17) # label(axiom). [clausify(18)].
% 0.46/1.06 47 -root(A,B) | subactivity(f2(B,A),B) # label(sos_05) # label(axiom). [clausify(6)].
% 0.46/1.06 48 -root(A,B) | atocc(A,f2(B,A)) # label(sos_05) # label(axiom). [clausify(6)].
% 0.46/1.06 Derived: -root_occ(A,B) | -min_precedes(C,A,f10(A,B)). [resolve(44,b,45,b)].
% 0.46/1.06 Derived: -root_occ(A,B) | legal(A). [resolve(44,b,46,a)].
% 0.46/1.06 Derived: -root_occ(A,B) | subactivity(f2(f10(A,B),A),f10(A,B)). [resolve(44,b,47,a)].
% 0.46/1.06 Derived: -root_occ(A,B) | atocc(A,f2(f10(A,B),A)). [resolve(44,b,48,a)].
% 0.46/1.06 49 -occurrence_of(A,B) | atomic(B) | root(f1(B,A),B) # label(sos) # label(axiom). [clausify(1)].
% 0.46/1.06 Derived: -occurrence_of(A,B) | atomic(B) | -min_precedes(C,f1(B,A),B). [resolve(49,c,45,b)].
% 0.46/1.06 Derived: -occurrence_of(A,B) | atomic(B) | legal(f1(B,A)). [resolve(49,c,46,a)].
% 0.46/1.06 Derived: -occurrence_of(A,B) | atomic(B) | subactivity(f2(B,f1(B,A)),B). [resolve(49,c,47,a)].
% 0.46/1.06 Derived: -occurrence_of(A,B) | atomic(B) | atocc(f1(B,A),f2(B,f1(B,A))). [resolve(49,c,48,a)].
% 0.46/1.06 50 -min_precedes(A,B,C) | root(f11(A,B,C),C) # label(sos_23) # label(axiom). [clausify(24)].
% 0.46/1.06 Derived: -min_precedes(A,B,C) | -min_precedes(D,f11(A,B,C),C). [resolve(50,b,45,b)].
% 0.46/1.06 Derived: -min_precedes(A,B,C) | legal(f11(A,B,C)). [resolve(50,b,46,a)].
% 0.46/1.06 Derived: -min_precedes(A,B,C) | subactivity(f2(C,f11(A,B,C)),C). [resolve(50,b,47,a)].
% 0.46/1.06 Derived: -min_precedes(A,B,C) | atocc(f11(A,B,C),f2(C,f11(A,B,C))). [resolve(50,b,48,a)].
% 0.46/1.06 51 root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -root(A,C) # label(sos_19) # label(axiom). [clausify(20)].
% 0.46/1.06 Derived: root_occ(A,B) | -occurrence_of(B,f10(A,C)) | -subactivity_occurrence(A,B) | -root_occ(A,C). [resolve(51,d,44,b)].
% 0.46/1.06 Derived: root_occ(f1(A,B),C) | -occurrence_of(C,A) | -subactivity_occurrence(f1(A,B),C) | -occurrence_of(B,A) | atomic(A). [resolve(51,d,49,c)].
% 0.46/1.06 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(51,d,50,b)].
% 0.46/1.06 52 root(A,f9(A,B)) | min_precedes(f7(A,f9(A,B)),A,f9(A,B)) | -leaf_occ(A,B). [resolve(40,a,36,b)].
% 0.46/1.06 Derived: min_precedes(f7(A,f9(A,B)),A,f9(A,B)) | -leaf_occ(A,B) | -min_precedes(C,A,f9(A,B)). [resolve(52,a,45,b)].
% 0.46/1.06 Derived: min_precedes(f7(A,f9(A,B)),A,f9(A,B)) | -leaf_occ(A,B) | legal(A). [resolve(52,a,46,a)].
% 0.46/1.06 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(52,a,47,a)].
% 0.46/1.06 Derived: min_precedes(f7(A,f9(A,B)),A,f9(A,B)) | -leaf_occ(A,B) | atocc(A,f2(f9(A,B),A)). [resolve(52,a,48,a)].
% 0.46/1.06 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(52,a,51,d)].
% 0.46/1.06 53 -root(A,B) | min_precedes(A,f8(A,B),B) | -min_precedes(A,C,B). [resolve(41,a,37,a)].
% 0.46/1.06 Derived: min_precedes(A,f8(A,f10(A,B)),f10(A,B)) | -min_precedes(A,C,f10(A,B)) | -root_occ(A,B). [resolve(53,a,44,b)].
% 0.46/1.06 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(53,a,49,c)].
% 0.46/1.06 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(53,a,50,b)].
% 0.46/1.06 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(53,a,52,a)].
% 0.46/1.06 54 -root(A,B) | min_precedes(A,f8(A,B),B) | atomic(B) | occurrence_of(f4(A,B),B). [resolve(41,a,38,a)].
% 0.46/1.06 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(54,a,44,b)].
% 0.46/1.06 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(54,a,49,c)].
% 0.46/1.06 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(54,a,50,b)].
% 0.46/1.06 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(54,a,52,a)].
% 0.46/1.06 55 -root(A,B) | min_precedes(A,f8(A,B),B) | atomic(B) | leaf_occ(A,f4(A,B)). [resolve(41,a,39,a)].
% 0.46/1.06 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(55,a,44,b)].
% 0.46/1.06 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(55,a,49,c)].
% 0.46/1.06 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(55,a,50,b)].
% 0.46/1.06 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(55,a,52,a)].
% 0.46/1.06 56 leaf_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -root(A,C) | min_precedes(A,f8(A,C),C). [resolve(42,d,41,a)].
% 0.46/1.06 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(56,d,44,b)].
% 0.46/1.07 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(56,d,49,c)].
% 0.46/1.07 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(56,d,50,b)].
% 0.46/1.07 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(56,d,52,a)].
% 0.46/1.07 57 -min_precedes(A,B,C) | min_precedes(B,f8(B,C),C) | root(B,C) | min_precedes(f7(B,C),B,C). [resolve(43,a,40,a)].
% 0.46/1.07 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(57,c,45,b)].
% 0.46/1.07 58 -occurrence_of(A,tptp0) | next_subocc(f13(A),f14(A),tptp0) # label(sos_32) # label(axiom). [clausify(33)].
% 0.46/1.07 59 -next_subocc(A,B,C) | -min_precedes(A,D,C) | -min_precedes(D,B,C) # label(sos_26) # label(axiom). [clausify(27)].
% 0.46/1.07 60 -next_subocc(A,B,C) | arboreal(A) # label(sos_25) # label(axiom). [clausify(26)].
% 0.46/1.07 61 -next_subocc(A,B,C) | arboreal(B) # label(sos_25) # label(axiom). [clausify(26)].
% 0.46/1.07 62 -next_subocc(A,B,C) | min_precedes(A,B,C) # label(sos_26) # label(axiom). [clausify(27)].
% 0.46/1.07 Derived: -occurrence_of(A,tptp0) | -min_precedes(f13(A),B,tptp0) | -min_precedes(B,f14(A),tptp0). [resolve(58,b,59,a)].
% 0.46/1.07 Derived: -occurrence_of(A,tptp0) | arboreal(f13(A)). [resolve(58,b,60,a)].
% 0.46/1.07 Derived: -occurrence_of(A,tptp0) | arboreal(f14(A)). [resolve(58,b,61,a)].
% 0.46/1.07 Derived: -occurrence_of(A,tptp0) | min_precedes(f13(A),f14(A),tptp0). [resolve(58,b,62,a)].
% 0.46/1.07 63 -occurrence_of(A,tptp0) | -root_occ(B,A) | next_subocc(B,f15(B,A),tptp0) # label(sos_45) # label(axiom). [clausify(34)].
% 0.46/1.07 Derived: -occurrence_of(A,tptp0) | -root_occ(B,A) | -min_precedes(B,C,tptp0) | -min_precedes(C,f15(B,A),tptp0). [resolve(63,c,59,a)].
% 0.46/1.07 Derived: -occurrence_of(A,tptp0) | -root_occ(B,A) | arboreal(B). [resolve(63,c,60,a)].
% 0.46/1.07 Derived: -occurrence_of(A,tptp0) | -root_occ(B,A) | arboreal(f15(B,A)). [resolve(63,c,61,a)].
% 0.46/1.07 Derived: -occurrence_of(A,tptp0) | -root_occ(B,A) | min_precedes(B,f15(B,A),tptp0). [resolve(63,c,62,a)].
% 0.46/1.07 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.46/1.07 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,59,a)].
% 0.46/1.07 Derived: -min_precedes(A,B,C) | min_precedes(A,f12(A,B,C),C) | arboreal(A). [resolve(64,a,60,a)].
% 0.46/1.07 Derived: -min_precedes(A,B,C) | min_precedes(A,f12(A,B,C),C) | arboreal(B). [resolve(64,a,61,a)].
% 0.46/1.07 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.46/1.07 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,59,a)].
% 0.46/1.07 Derived: -min_precedes(A,B,C) | min_precedes(f12(A,B,C),B,C) | arboreal(A). [resolve(65,a,60,a)].
% 0.46/1.07 Derived: -min_precedes(A,B,C) | min_precedes(f12(A,B,C),B,C) | arboreal(B). [resolve(65,a,61,a)].
% 0.46/1.07 66 -precedes(A,B) | legal(B) # label(sos_21) # label(axiom). [clausify(22)].
% 0.46/1.07 67 -legal(A) | arboreal(A) # label(sos_13) # label(axiom). [clausify(14)].
% 0.46/1.07 Derived: -precedes(A,B) | arboreal(B). [resolve(66,b,67,a)].
% 0.46/1.07 68 precedes(A,B) | -earlier(A,B) | -legal(B) # label(sos_21) # label(axiom). [clausify(22)].
% 0.46/1.07 Derived: precedes(A,B) | -earlier(A,B) | -precedes(C,B). [resolve(68,c,66,b)].
% 0.46/1.07 69 -root_occ(A,B) | legal(A). [resolve(44,b,46,a)].
% 0.46/1.07 Derived: -root_occ(A,B) | arboreal(A). [resolve(69,b,67,a)].
% 0.46/1.07 Derived: -root_occ(A,B) | precedes(C,A) | -earlier(C,A). [resolve(69,b,68,c)].
% 0.46/1.07 70 -occurrence_of(A,B) | atomic(B) | legal(f1(B,A)). [resolve(49,c,46,a)].
% 0.46/1.07 Derived: -occurrence_of(A,B) | atomic(B) | arboreal(f1(B,A)). [resolve(70,c,67,a)].
% 0.46/1.07 Derived: -occurrence_of(A,B) | atomic(B) | precedes(C,f1(B,A)) | -earlier(C,f1(B,A)). [resolve(70,c,68,c)].
% 0.46/1.07 71 -min_precedes(A,B,C) | legal(f11(A,B,C)). [resolve(50,b,46,a)].
% 0.46/1.08 Derived: -min_precedes(A,B,C) | arboreal(f11(A,B,C)). [resolve(71,b,67,a)].
% 0.46/1.08 Derived: -min_precedes(A,B,C) | precedes(D,f11(A,B,C)) | -earlier(D,f11(A,B,C)). [resolve(71,b,68,c)].
% 0.46/1.08 72 min_precedes(f7(A,f9(A,B)),A,f9(A,B)) | -leaf_occ(A,B) | legal(A). [resolve(52,a,46,a)].
% 0.46/1.08 Derived: min_precedes(f7(A,f9(A,B)),A,f9(A,B)) | -leaf_occ(A,B) | arboreal(A). [resolve(72,c,67,a)].
% 0.46/1.08 Derived: min_precedes(f7(A,f9(A,B)),A,f9(A,B)) | -leaf_occ(A,B) | precedes(C,A) | -earlier(C,A). [resolve(72,c,68,c)].
% 0.46/1.08 73 -activity_occurrence(A) | occurrence_of(A,f5(A)) # label(sos_12) # label(axiom). [clausify(13)].
% 0.46/1.08 74 -occurrence_of(A,B) | activity_occurrence(A) # label(sos_03) # label(axiom). [clausify(4)].
% 0.46/1.08 75 -subactivity_occurrence(A,B) | activity_occurrence(A) # label(sos_11) # label(axiom). [clausify(12)].
% 0.46/1.08 76 -subactivity_occurrence(A,B) | activity_occurrence(B) # label(sos_11) # label(axiom). [clausify(12)].
% 0.46/1.08 Derived: occurrence_of(A,f5(A)) | -occurrence_of(A,B). [resolve(73,a,74,b)].
% 0.46/1.08 Derived: occurrence_of(A,f5(A)) | -subactivity_occurrence(A,B). [resolve(73,a,75,b)].
% 0.46/1.08 Derived: occurrence_of(A,f5(A)) | -subactivity_occurrence(B,A). [resolve(73,a,76,b)].
% 0.46/1.08 77 atocc(A,B) | -subactivity(B,C) | -atomic(C) | -occurrence_of(A,C) # label(sos_14) # label(axiom). [clausify(15)].
% 0.46/1.08 78 -atocc(A,B) | atomic(f6(A,B)) # label(sos_14) # label(axiom). [clausify(15)].
% 0.46/1.08 79 -atocc(A,B) | subactivity(B,f6(A,B)) # label(sos_14) # label(axiom). [clausify(15)].
% 0.46/1.08 80 -atocc(A,B) | occurrence_of(A,f6(A,B)) # label(sos_14) # label(axiom). [clausify(15)].
% 0.46/1.08 Derived: -subactivity(A,B) | -atomic(B) | -occurrence_of(C,B) | atomic(f6(C,A)). [resolve(77,a,78,a)].
% 0.46/1.08 Derived: -subactivity(A,B) | -atomic(B) | -occurrence_of(C,B) | subactivity(A,f6(C,A)). [resolve(77,a,79,a)].
% 0.46/1.08 Derived: -subactivity(A,B) | -atomic(B) | -occurrence_of(C,B) | occurrence_of(C,f6(C,A)). [resolve(77,a,80,a)].
% 0.46/1.08 81 -root_occ(A,B) | atocc(A,f2(f10(A,B),A)). [resolve(44,b,48,a)].
% 0.46/1.08 Derived: -root_occ(A,B) | atomic(f6(A,f2(f10(A,B),A))). [resolve(81,b,78,a)].
% 0.46/1.08 Derived: -root_occ(A,B) | subactivity(f2(f10(A,B),A),f6(A,f2(f10(A,B),A))). [resolve(81,b,79,a)].
% 0.46/1.08 Derived: -root_occ(A,B) | occurrence_of(A,f6(A,f2(f10(A,B),A))). [resolve(81,b,80,a)].
% 0.46/1.08 82 -occurrence_of(A,B) | atomic(B) | atocc(f1(B,A),f2(B,f1(B,A))). [resolve(49,c,48,a)].
% 0.46/1.08 Derived: -occurrence_of(A,B) | atomic(B) | atomic(f6(f1(B,A),f2(B,f1(B,A)))). [resolve(82,c,78,a)].
% 0.46/1.08 Derived: -occurrence_of(A,B) | atomic(B) | subactivity(f2(B,f1(B,A)),f6(f1(B,A),f2(B,f1(B,A)))). [resolve(82,c,79,a)].
% 0.46/1.08 Derived: -occurrence_of(A,B) | atomic(B) | occurrence_of(f1(B,A),f6(f1(B,A),f2(B,f1(B,A)))). [resolve(82,c,80,a)].
% 0.46/1.08 83 -min_precedes(A,B,C) | atocc(f11(A,B,C),f2(C,f11(A,B,C))). [resolve(50,b,48,a)].
% 0.46/1.08 Derived: -min_precedes(A,B,C) | atomic(f6(f11(A,B,C),f2(C,f11(A,B,C)))). [resolve(83,b,78,a)].
% 0.46/1.08 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(83,b,79,a)].
% 0.46/1.08 Derived: -min_precedes(A,B,C) | occurrence_of(f11(A,B,C),f6(f11(A,B,C),f2(C,f11(A,B,C)))). [resolve(83,b,80,a)].
% 0.46/1.08 84 min_precedes(f7(A,f9(A,B)),A,f9(A,B)) | -leaf_occ(A,B) | atocc(A,f2(f9(A,B),A)). [resolve(52,a,48,a)].
% 0.46/1.08 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(84,c,78,a)].
% 0.46/1.08 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(84,c,79,a)].
% 0.46/1.08 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(84,c,80,a)].
% 0.46/1.08
% 0.46/1.08 ============================== end predicate elimination =============
% 0.46/1.08
% 0.46/1.08 Auto_denials: (non-Horn, no changes).
% 0.46/1.08
% 0.46/1.08 Term ordering decisions:
% 0.46/1.08 Function symbol KB weights: tptp0=1. tptp1=1. tptp3=1. tptp4=1. tptp2=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.
% 0.46/1.08
% 0.46/1.08 ============================== end of process initial clauses ========
% 0.46/1.08
% 0.46/1.08 ============================== CLAUSES FOR SEARCH ====================
% 0.46/1.08
% 0.46/1.08 ============================== end of clauses for search =============
% 0.46/1.08
% 0.46/1.08 ============================== SEARCH ================================
% 3.83/4.17
% 3.83/4.17 % Starting search at 0.04 seconds.
% 3.83/4.17
% 3.83/4.17 Low Water (keep): wt=137.000, iters=3883
% 3.83/4.17
% 3.83/4.17 Low Water (keep): wt=87.000, iters=3521
% 3.83/4.17
% 3.83/4.17 Low Water (keep): wt=80.000, iters=3403
% 3.83/4.17
% 3.83/4.17 Low Water (keep): wt=78.000, iters=3342
% 3.83/4.17
% 3.83/4.17 Low Water (keep): wt=75.000, iters=3486
% 3.83/4.17
% 3.83/4.17 Low Water (keep): wt=73.000, iters=3413
% 3.83/4.17
% 3.83/4.17 Low Water (keep): wt=72.000, iters=3647
% 3.83/4.17
% 3.83/4.17 Low Water (keep): wt=69.000, iters=3645
% 3.83/4.17
% 3.83/4.17 Low Water (keep): wt=65.000, iters=3427
% 3.83/4.17
% 3.83/4.17 Low Water (keep): wt=64.000, iters=3387
% 3.83/4.17
% 3.83/4.17 Low Water (keep): wt=61.000, iters=3445
% 3.83/4.17
% 3.83/4.17 Low Water (keep): wt=60.000, iters=3397
% 3.83/4.17
% 3.83/4.17 Low Water (keep): wt=59.000, iters=3380
% 3.83/4.17
% 3.83/4.17 Low Water (keep): wt=57.000, iters=3391
% 3.83/4.17
% 3.83/4.17 Low Water (keep): wt=56.000, iters=3344
% 3.83/4.17
% 3.83/4.17 Low Water (keep): wt=55.000, iters=3409
% 3.83/4.17
% 3.83/4.17 Low Water (keep): wt=53.000, iters=3348
% 3.83/4.17
% 3.83/4.17 Low Water (keep): wt=52.000, iters=3391
% 3.83/4.17
% 3.83/4.17 Low Water (keep): wt=50.000, iters=3344
% 3.83/4.17
% 3.83/4.17 Low Water (keep): wt=48.000, iters=3519
% 3.83/4.17
% 3.83/4.17 ============================== PROOF =================================
% 3.83/4.17 % SZS status Theorem
% 3.83/4.17 % SZS output start Refutation
% 3.83/4.17
% 3.83/4.17 % Proof 1 at 3.09 (+ 0.04) seconds.
% 3.83/4.17 % Length of proof is 71.
% 3.83/4.17 % Level of proof is 14.
% 3.83/4.17 % Maximum clause weight is 29.000.
% 3.83/4.17 % Given clauses 3995.
% 3.83/4.17
% 3.83/4.17 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].
% 3.83/4.17 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].
% 3.83/4.17 4 (all X12 all X13 (occurrence_of(X13,X12) -> activity(X12) & activity_occurrence(X13))) # label(sos_03) # label(axiom) # label(non_clause). [assumption].
% 3.83/4.17 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].
% 3.83/4.17 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].
% 3.83/4.17 13 (all X41 (activity_occurrence(X41) -> (exists X42 (activity(X42) & occurrence_of(X41,X42))))) # label(sos_12) # label(axiom) # label(non_clause). [assumption].
% 3.83/4.17 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].
% 3.83/4.17 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].
% 3.83/4.17 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].
% 3.83/4.17 33 (all X101 (occurrence_of(X101,tptp0) -> (exists X102 exists X103 (occurrence_of(X102,tptp4) & root_occ(X102,X101) & occurrence_of(X103,tptp3) & leaf_occ(X103,X101) & next_subocc(X102,X103,tptp0))))) # label(sos_32) # label(axiom) # label(non_clause). [assumption].
% 3.83/4.17 34 (all X104 all X105 (occurrence_of(X105,tptp0) & root_occ(X104,X105) -> (exists X106 (occurrence_of(X106,tptp1) & next_subocc(X104,X106,tptp0))))) # label(sos_45) # label(axiom) # label(non_clause). [assumption].
% 3.83/4.17 35 --(exists X107 occurrence_of(X107,tptp0)) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 3.83/4.17 49 -occurrence_of(A,B) | atomic(B) | root(f1(B,A),B) # label(sos) # label(axiom). [clausify(1)].
% 3.83/4.17 51 root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -root(A,C) # label(sos_19) # label(axiom). [clausify(20)].
% 3.83/4.17 58 -occurrence_of(A,tptp0) | next_subocc(f13(A),f14(A),tptp0) # label(sos_32) # label(axiom). [clausify(33)].
% 3.83/4.17 59 -next_subocc(A,B,C) | -min_precedes(A,D,C) | -min_precedes(D,B,C) # label(sos_26) # label(axiom). [clausify(27)].
% 3.83/4.17 62 -next_subocc(A,B,C) | min_precedes(A,B,C) # label(sos_26) # label(axiom). [clausify(27)].
% 3.83/4.17 63 -occurrence_of(A,tptp0) | -root_occ(B,A) | next_subocc(B,f15(B,A),tptp0) # label(sos_45) # label(axiom). [clausify(34)].
% 3.83/4.17 73 -activity_occurrence(A) | occurrence_of(A,f5(A)) # label(sos_12) # label(axiom). [clausify(13)].
% 3.83/4.17 74 -occurrence_of(A,B) | activity_occurrence(A) # label(sos_03) # label(axiom). [clausify(4)].
% 3.83/4.17 89 occurrence_of(c1,tptp0) # label(goals) # label(negated_conjecture). [clausify(35)].
% 3.83/4.17 90 -atomic(tptp0) # label(sos_34) # label(axiom). [assumption].
% 3.83/4.17 95 tptp1 != tptp3 # label(sos_42) # label(axiom). [assumption].
% 3.83/4.17 96 tptp3 != tptp1. [copy(95),flip(a)].
% 3.83/4.17 111 -occurrence_of(A,tptp0) | root_occ(f13(A),A) # label(sos_32) # label(axiom). [clausify(33)].
% 3.83/4.17 112 -occurrence_of(A,tptp0) | occurrence_of(f14(A),tptp3) # label(sos_32) # label(axiom). [clausify(33)].
% 3.83/4.17 113 -occurrence_of(A,tptp0) | leaf_occ(f14(A),A) # label(sos_32) # label(axiom). [clausify(33)].
% 3.83/4.17 116 -occurrence_of(A,B) | -occurrence_of(A,C) | C = B # label(sos_08) # label(axiom). [clausify(9)].
% 3.83/4.17 118 -occurrence_of(A,B) | atomic(B) | subactivity_occurrence(f1(B,A),A) # label(sos) # label(axiom). [clausify(1)].
% 3.83/4.17 119 -min_precedes(A,B,C) | occurrence_of(f3(C,A,B),C) # label(sos_06) # label(axiom). [clausify(7)].
% 3.83/4.17 120 -min_precedes(A,B,C) | subactivity_occurrence(A,f3(C,A,B)) # label(sos_06) # label(axiom). [clausify(7)].
% 3.83/4.17 121 -min_precedes(A,B,C) | subactivity_occurrence(B,f3(C,A,B)) # label(sos_06) # label(axiom). [clausify(7)].
% 3.83/4.17 123 -occurrence_of(A,tptp0) | -root_occ(B,A) | occurrence_of(f15(B,A),tptp1) # label(sos_45) # label(axiom). [clausify(34)].
% 3.83/4.17 124 -occurrence_of(A,B) | -root_occ(C,A) | -root_occ(D,A) | D = C # label(sos_29) # label(axiom). [clausify(30)].
% 3.83/4.17 129 -occurrence_of(A,B) | -root_occ(C,A) | -leaf_occ(D,A) | -subactivity_occurrence(E,A) | -min_precedes(C,E,B) | D = E | min_precedes(E,D,B) # label(sos_01) # label(axiom). [clausify(2)].
% 3.83/4.17 146 root_occ(f1(A,B),C) | -occurrence_of(C,A) | -subactivity_occurrence(f1(A,B),C) | -occurrence_of(B,A) | atomic(A). [resolve(51,d,49,c)].
% 3.83/4.17 166 -occurrence_of(A,tptp0) | -min_precedes(f13(A),B,tptp0) | -min_precedes(B,f14(A),tptp0). [resolve(58,b,59,a)].
% 3.83/4.17 173 -occurrence_of(A,tptp0) | -root_occ(B,A) | min_precedes(B,f15(B,A),tptp0). [resolve(63,c,62,a)].
% 3.83/4.17 190 occurrence_of(A,f5(A)) | -occurrence_of(A,B). [resolve(73,a,74,b)].
% 3.83/4.17 211 root_occ(f1(A,B),B) | -occurrence_of(B,A) | -subactivity_occurrence(f1(A,B),B) | atomic(A). [factor(146,b,d)].
% 3.83/4.17 222 root_occ(f13(c1),c1). [resolve(111,a,89,a)].
% 3.83/4.17 226 subactivity_occurrence(f1(tptp0,c1),c1). [resolve(118,a,89,a),unit_del(a,90)].
% 3.83/4.17 243 min_precedes(f13(c1),f15(f13(c1),c1),tptp0). [resolve(222,a,173,b),unit_del(a,89)].
% 3.83/4.17 248 -occurrence_of(c1,A) | -root_occ(B,c1) | f13(c1) = B. [resolve(222,a,124,c)].
% 3.83/4.17 249 occurrence_of(f15(f13(c1),c1),tptp1). [resolve(222,a,123,b),unit_del(a,89)].
% 3.83/4.17 291 root_occ(f1(tptp0,c1),c1). [resolve(226,a,211,c),unit_del(b,89),unit_del(c,90)].
% 3.83/4.17 402 occurrence_of(f15(f13(c1),c1),f5(f15(f13(c1),c1))). [resolve(249,a,190,b)].
% 3.83/4.17 403 -occurrence_of(f15(f13(c1),c1),A) | tptp1 = A. [resolve(249,a,116,b)].
% 3.83/4.17 526 -occurrence_of(A,tptp0) | -root_occ(f13(c1),A) | -leaf_occ(B,A) | -subactivity_occurrence(f15(f13(c1),c1),A) | f15(f13(c1),c1) = B | min_precedes(f15(f13(c1),c1),B,tptp0). [resolve(243,a,129,e),flip(e)].
% 3.83/4.17 531 subactivity_occurrence(f15(f13(c1),c1),f3(tptp0,f13(c1),f15(f13(c1),c1))). [resolve(243,a,121,a)].
% 3.83/4.17 532 subactivity_occurrence(f13(c1),f3(tptp0,f13(c1),f15(f13(c1),c1))). [resolve(243,a,120,a)].
% 3.83/4.17 533 occurrence_of(f3(tptp0,f13(c1),f15(f13(c1),c1)),tptp0). [resolve(243,a,119,a)].
% 3.83/4.17 547 -occurrence_of(c1,A) | f1(tptp0,c1) = f13(c1). [resolve(248,b,291,a),flip(b)].
% 3.83/4.17 637 f1(tptp0,c1) = f13(c1). [resolve(547,a,89,a)].
% 3.83/4.17 710 root_occ(f13(c1),A) | -occurrence_of(A,tptp0) | -subactivity_occurrence(f13(c1),A). [para(637(a,1),146(c,1)),rewrite([637(3)]),unit_del(d,89),unit_del(e,90)].
% 3.83/4.17 750 f5(f15(f13(c1),c1)) = tptp1. [resolve(402,a,403,a),flip(a)].
% 3.83/4.17 793 leaf_occ(f14(f3(tptp0,f13(c1),f15(f13(c1),c1))),f3(tptp0,f13(c1),f15(f13(c1),c1))). [resolve(533,a,113,a)].
% 3.83/4.17 794 occurrence_of(f14(f3(tptp0,f13(c1),f15(f13(c1),c1))),tptp3). [resolve(533,a,112,a)].
% 3.83/4.17 795 root_occ(f13(f3(tptp0,f13(c1),f15(f13(c1),c1))),f3(tptp0,f13(c1),f15(f13(c1),c1))). [resolve(533,a,111,a)].
% 3.83/4.17 866 root_occ(f13(c1),f3(tptp0,f13(c1),f15(f13(c1),c1))). [resolve(710,c,532,a),unit_del(b,533)].
% 3.83/4.17 902 occurrence_of(f14(f3(tptp0,f13(c1),f15(f13(c1),c1))),f5(f14(f3(tptp0,f13(c1),f15(f13(c1),c1))))). [resolve(794,a,190,b)].
% 3.83/4.17 903 -occurrence_of(f14(f3(tptp0,f13(c1),f15(f13(c1),c1))),A) | tptp3 = A. [resolve(794,a,116,b)].
% 3.83/4.17 1100 -occurrence_of(f3(tptp0,f13(c1),f15(f13(c1),c1)),A) | -root_occ(B,f3(tptp0,f13(c1),f15(f13(c1),c1))) | f13(c1) = B. [resolve(866,a,124,c)].
% 3.83/4.17 1709 -leaf_occ(A,f3(tptp0,f13(c1),f15(f13(c1),c1))) | f15(f13(c1),c1) = A | min_precedes(f15(f13(c1),c1),A,tptp0). [resolve(526,d,531,a),unit_del(a,533),unit_del(b,866)].
% 3.83/4.17 3387 f5(f14(f3(tptp0,f13(c1),f15(f13(c1),c1)))) = tptp3. [resolve(902,a,903,a),flip(a)].
% 3.83/4.17 4495 -occurrence_of(f3(tptp0,f13(c1),f15(f13(c1),c1)),A) | f13(f3(tptp0,f13(c1),f15(f13(c1),c1))) = f13(c1). [resolve(1100,b,795,a),flip(b)].
% 3.83/4.17 6285 f13(f3(tptp0,f13(c1),f15(f13(c1),c1))) = f13(c1). [resolve(4495,a,533,a)].
% 3.83/4.17 6332 -min_precedes(f13(c1),A,tptp0) | -min_precedes(A,f14(f3(tptp0,f13(c1),f15(f13(c1),c1))),tptp0). [para(6285(a,1),166(b,1)),unit_del(a,533)].
% 3.83/4.17 6857 f14(f3(tptp0,f13(c1),f15(f13(c1),c1))) = f15(f13(c1),c1) | min_precedes(f15(f13(c1),c1),f14(f3(tptp0,f13(c1),f15(f13(c1),c1))),tptp0). [resolve(1709,a,793,a),flip(a)].
% 3.83/4.17 15719 f14(f3(tptp0,f13(c1),f15(f13(c1),c1))) = f15(f13(c1),c1). [resolve(6857,b,6332,b),unit_del(b,243)].
% 3.83/4.17 16151 $F. [back_rewrite(3387),rewrite([15719(9),750(5)]),flip(a),unit_del(a,96)].
% 3.83/4.17
% 3.83/4.17 % SZS output end Refutation
% 3.83/4.17 ============================== end of proof ==========================
% 3.83/4.17
% 3.83/4.17 ============================== STATISTICS ============================
% 3.83/4.17
% 3.83/4.17 Given=3995. Generated=33875. Kept=16060. proofs=1.
% 3.83/4.17 Usable=2773. Sos=6739. Demods=85. Limbo=432, Disabled=6289. Hints=0.
% 3.83/4.17 Megabytes=37.26.
% 3.83/4.17 User_CPU=3.09, System_CPU=0.04, Wall_clock=4.
% 3.83/4.17
% 3.83/4.17 ============================== end of statistics =====================
% 3.83/4.17
% 3.83/4.17 ============================== end of search =========================
% 3.83/4.17
% 3.83/4.17 THEOREM PROVED
% 3.83/4.17 % SZS status Theorem
% 3.83/4.17
% 3.83/4.17 Exiting with 1 proof.
% 3.83/4.17
% 3.83/4.17 Process 21799 exit (max_proofs) Mon Jun 13 01:39:56 2022
% 3.83/4.17 Prover9 interrupted
%------------------------------------------------------------------------------