TSTP Solution File: PRO017+2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PRO017+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n020.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 10.97s 11.28s
% Output : Refutation 10.97s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : PRO017+2 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n020.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 13 02:24:35 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.75/1.05 ============================== Prover9 ===============================
% 0.75/1.05 Prover9 (32) version 2009-11A, November 2009.
% 0.75/1.05 Process 26495 was started by sandbox on n020.cluster.edu,
% 0.75/1.05 Mon Jun 13 02:24:35 2022
% 0.75/1.05 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_26342_n020.cluster.edu".
% 0.75/1.05 ============================== end of head ===========================
% 0.75/1.05
% 0.75/1.05 ============================== INPUT =================================
% 0.75/1.05
% 0.75/1.05 % Reading from file /tmp/Prover9_26342_n020.cluster.edu
% 0.75/1.05
% 0.75/1.05 set(prolog_style_variables).
% 0.75/1.05 set(auto2).
% 0.75/1.05 % set(auto2) -> set(auto).
% 0.75/1.05 % set(auto) -> set(auto_inference).
% 0.75/1.05 % set(auto) -> set(auto_setup).
% 0.75/1.05 % set(auto_setup) -> set(predicate_elim).
% 0.75/1.05 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.75/1.05 % set(auto) -> set(auto_limits).
% 0.75/1.05 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.75/1.05 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.75/1.05 % set(auto) -> set(auto_denials).
% 0.75/1.05 % set(auto) -> set(auto_process).
% 0.75/1.05 % set(auto2) -> assign(new_constants, 1).
% 0.75/1.05 % set(auto2) -> assign(fold_denial_max, 3).
% 0.75/1.05 % set(auto2) -> assign(max_weight, "200.000").
% 0.75/1.05 % set(auto2) -> assign(max_hours, 1).
% 0.75/1.05 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.75/1.05 % set(auto2) -> assign(max_seconds, 0).
% 0.75/1.05 % set(auto2) -> assign(max_minutes, 5).
% 0.75/1.05 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.75/1.05 % set(auto2) -> set(sort_initial_sos).
% 0.75/1.05 % set(auto2) -> assign(sos_limit, -1).
% 0.75/1.05 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.75/1.05 % set(auto2) -> assign(max_megs, 400).
% 0.75/1.05 % set(auto2) -> assign(stats, some).
% 0.75/1.05 % set(auto2) -> clear(echo_input).
% 0.75/1.05 % set(auto2) -> set(quiet).
% 0.75/1.05 % set(auto2) -> clear(print_initial_clauses).
% 0.75/1.05 % set(auto2) -> clear(print_given).
% 0.75/1.05 assign(lrs_ticks,-1).
% 0.75/1.05 assign(sos_limit,10000).
% 0.75/1.05 assign(order,kbo).
% 0.75/1.05 set(lex_order_vars).
% 0.75/1.05 clear(print_given).
% 0.75/1.05
% 0.75/1.05 % formulas(sos). % not echoed (46 formulas)
% 0.75/1.05
% 0.75/1.05 ============================== end of input ==========================
% 0.75/1.05
% 0.75/1.05 % From the command line: assign(max_seconds, 300).
% 0.75/1.05
% 0.75/1.05 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.75/1.05
% 0.75/1.05 % Formulas that are not ordinary clauses:
% 0.75/1.05 1 (all X0 all X1 all X2 all X3 (min_precedes(X0,X1,X3) & min_precedes(X1,X2,X3) -> min_precedes(X0,X2,X3))) # label(sos) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 2 (all X4 all X5 all X6 (earlier(X4,X5) & earlier(X5,X6) -> earlier(X4,X6))) # label(sos_01) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 3 (all X7 all X8 all X9 all X10 (occurrence_of(X9,X10) & root_occ(X7,X9) & root_occ(X8,X9) -> X7 = X8)) # label(sos_02) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 4 (all X11 all X12 all X13 all X14 (occurrence_of(X13,X14) & -atomic(X14) & leaf_occ(X11,X13) & leaf_occ(X12,X13) -> X11 = X12)) # label(sos_03) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 5 (all X15 all X16 all X17 (next_subocc(X15,X16,X17) <-> min_precedes(X15,X16,X17) & -(exists X18 (min_precedes(X15,X18,X17) & min_precedes(X18,X16,X17))))) # label(sos_04) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 6 (all X19 all X20 all X21 (next_subocc(X19,X20,X21) -> arboreal(X19) & arboreal(X20))) # label(sos_05) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 7 (all X22 all X23 all X24 (min_precedes(X22,X23,X24) -> precedes(X22,X23))) # label(sos_06) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 8 (all X25 all X26 all X27 (min_precedes(X25,X26,X27) -> -root(X26,X27))) # label(sos_07) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 9 (all X28 all X29 (precedes(X28,X29) <-> earlier(X28,X29) & legal(X29))) # label(sos_08) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 10 (all X30 all X31 (earlier(X30,X31) -> -earlier(X31,X30))) # label(sos_09) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 11 (all X32 all X33 (root_occ(X32,X33) <-> (exists X34 (occurrence_of(X33,X34) & subactivity_occurrence(X32,X33) & root(X32,X34))))) # label(sos_10) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 12 (all X35 all X36 (leaf_occ(X35,X36) <-> (exists X37 (occurrence_of(X36,X37) & subactivity_occurrence(X35,X36) & leaf(X35,X37))))) # label(sos_11) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 13 (all X38 all X39 (root(X38,X39) -> legal(X38))) # label(sos_12) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 14 (all X40 all X41 (occurrence_of(X40,X41) -> (arboreal(X40) <-> atomic(X41)))) # label(sos_13) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 15 (all X42 all X43 (leaf(X42,X43) <-> (root(X42,X43) | (exists X44 min_precedes(X44,X42,X43))) & -(exists X45 min_precedes(X42,X45,X43)))) # label(sos_14) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 16 (all X46 all X47 (atocc(X46,X47) <-> (exists X48 (subactivity(X47,X48) & atomic(X48) & occurrence_of(X46,X48))))) # label(sos_15) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 17 (all X49 all X50 (atocc(X49,X50) & legal(X49) -> root(X49,X50))) # label(sos_16) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 18 (all X51 (legal(X51) -> arboreal(X51))) # label(sos_17) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 19 (all X52 (activity_occurrence(X52) -> (exists X53 (activity(X53) & occurrence_of(X52,X53))))) # label(sos_18) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 20 (all X54 all X55 (subactivity_occurrence(X54,X55) -> activity_occurrence(X54) & activity_occurrence(X55))) # label(sos_19) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 21 (all X56 all X57 all X58 (occurrence_of(X56,X58) & root_occ(X57,X56) -> -(exists X59 min_precedes(X59,X57,X58)))) # label(sos_20) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 22 (all X60 all X61 all X62 (occurrence_of(X60,X62) & leaf_occ(X61,X60) -> -(exists X63 min_precedes(X61,X63,X62)))) # label(sos_21) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 23 (all X64 all X65 all X66 (occurrence_of(X64,X65) & occurrence_of(X64,X66) -> X65 = X66)) # label(sos_22) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 24 (all X67 all X68 (leaf(X67,X68) & -atomic(X68) -> (exists X69 (occurrence_of(X69,X68) & leaf_occ(X67,X69))))) # label(sos_23) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 25 (all X70 all X71 all X72 (min_precedes(X71,X72,X70) -> (exists X73 (occurrence_of(X73,X70) & subactivity_occurrence(X71,X73) & subactivity_occurrence(X72,X73))))) # label(sos_24) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 26 (all X74 all X75 (leaf(X74,X75) & -atomic(X75) -> (exists X76 (occurrence_of(X76,X75) & leaf_occ(X74,X76))))) # label(sos_25) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 27 (all X77 all X78 all X79 (min_precedes(X78,X79,X77) -> (exists X80 exists X81 (subactivity(X80,X77) & subactivity(X81,X77) & atocc(X78,X80) & atocc(X79,X81))))) # label(sos_26) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 28 (all X82 all X83 (root(X83,X82) -> (exists X84 (subactivity(X84,X82) & atocc(X83,X84))))) # label(sos_27) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 29 (all X85 all X86 all X87 all X88 (occurrence_of(X86,X85) & arboreal(X87) & arboreal(X88) & subactivity_occurrence(X87,X86) & subactivity_occurrence(X88,X86) -> min_precedes(X87,X88,X85) | min_precedes(X88,X87,X85) | X87 = X88)) # label(sos_28) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 30 (all X89 all X90 (occurrence_of(X90,X89) -> activity(X89) & activity_occurrence(X90))) # label(sos_29) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 31 (all X91 all X92 (occurrence_of(X92,X91) & -atomic(X91) -> (exists X93 (root(X93,X91) & subactivity_occurrence(X93,X92))))) # label(sos_30) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 32 (all X94 (activity(X94) -> subactivity(X94,X94))) # label(sos_31) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 33 (all X95 all X96 (occurrence_of(X96,tptp0) & subactivity_occurrence(X95,X96) & arboreal(X95) & -leaf_occ(X95,X96) -> (exists X97 exists X98 exists X99 (occurrence_of(X97,tptp3) & next_subocc(X95,X97,tptp0) & occurrence_of(X98,tptp4) & min_precedes(X97,X98,tptp0) & (occurrence_of(X99,tptp2) | occurrence_of(X99,tptp1)) & min_precedes(X98,X99,tptp0) & (all X100 (min_precedes(X97,X100,tptp0) -> X100 = X98 | X100 = X99)))))) # label(sos_32) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 34 -(all X101 all X102 (occurrence_of(X102,tptp0) & subactivity_occurrence(X101,X102) & arboreal(X101) & -leaf_occ(X101,X102) -> (exists X103 exists X104 (occurrence_of(X103,tptp3) & next_subocc(X101,X103,tptp0) & (occurrence_of(X104,tptp2) | occurrence_of(X104,tptp1)) & min_precedes(X103,X104,tptp0) & leaf(X104,tptp0))))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.75/1.05
% 0.75/1.05 ============================== end of process non-clausal formulas ===
% 0.75/1.05
% 0.75/1.05 ============================== PROCESS INITIAL CLAUSES ===============
% 0.75/1.05
% 0.75/1.05 ============================== PREDICATE ELIMINATION =================
% 0.75/1.05 35 -activity(A) | subactivity(A,A) # label(sos_31) # label(axiom). [clausify(32)].
% 0.75/1.05 36 activity(tptp0) # label(sos_33) # label(axiom). [assumption].
% 0.75/1.05 37 -activity_occurrence(A) | activity(f7(A)) # label(sos_18) # label(axiom). [clausify(19)].
% 0.75/1.05 38 -occurrence_of(A,B) | activity(B) # label(sos_29) # label(axiom). [clausify(30)].
% 0.75/1.05 Derived: subactivity(tptp0,tptp0). [resolve(35,a,36,a)].
% 0.75/1.05 Derived: subactivity(f7(A),f7(A)) | -activity_occurrence(A). [resolve(35,a,37,b)].
% 0.75/1.05 Derived: subactivity(A,A) | -occurrence_of(B,A). [resolve(35,a,38,b)].
% 0.75/1.05 39 -root_occ(A,B) | root(A,f2(A,B)) # label(sos_10) # label(axiom). [clausify(11)].
% 0.75/1.05 40 -min_precedes(A,B,C) | -root(B,C) # label(sos_07) # label(axiom). [clausify(8)].
% 0.75/1.05 41 -root(A,B) | legal(A) # label(sos_12) # label(axiom). [clausify(13)].
% 0.75/1.05 Derived: -root_occ(A,B) | -min_precedes(C,A,f2(A,B)). [resolve(39,b,40,b)].
% 0.75/1.05 Derived: -root_occ(A,B) | legal(A). [resolve(39,b,41,a)].
% 0.75/1.05 42 -atocc(A,B) | -legal(A) | root(A,B) # label(sos_16) # label(axiom). [clausify(17)].
% 0.75/1.05 Derived: -atocc(A,B) | -legal(A) | -min_precedes(C,A,B). [resolve(42,c,40,b)].
% 0.75/1.05 43 -root(A,B) | subactivity(f13(B,A),B) # label(sos_27) # label(axiom). [clausify(28)].
% 0.75/1.05 Derived: subactivity(f13(f2(A,B),A),f2(A,B)) | -root_occ(A,B). [resolve(43,a,39,b)].
% 0.75/1.05 Derived: subactivity(f13(A,B),A) | -atocc(B,A) | -legal(B). [resolve(43,a,42,c)].
% 0.75/1.05 44 -root(A,B) | atocc(A,f13(B,A)) # label(sos_27) # label(axiom). [clausify(28)].
% 0.75/1.05 Derived: atocc(A,f13(f2(A,B),A)) | -root_occ(A,B). [resolve(44,a,39,b)].
% 0.75/1.05 Derived: atocc(A,f13(B,A)) | -atocc(A,B) | -legal(A). [resolve(44,a,42,c)].
% 0.75/1.05 45 -occurrence_of(A,B) | atomic(B) | root(f14(B,A),B) # label(sos_30) # label(axiom). [clausify(31)].
% 0.75/1.05 Derived: -occurrence_of(A,B) | atomic(B) | -min_precedes(C,f14(B,A),B). [resolve(45,c,40,b)].
% 0.75/1.05 Derived: -occurrence_of(A,B) | atomic(B) | legal(f14(B,A)). [resolve(45,c,41,a)].
% 0.75/1.05 Derived: -occurrence_of(A,B) | atomic(B) | subactivity(f13(B,f14(B,A)),B). [resolve(45,c,43,a)].
% 0.75/1.05 Derived: -occurrence_of(A,B) | atomic(B) | atocc(f14(B,A),f13(B,f14(B,A))). [resolve(45,c,44,a)].
% 0.75/1.05 46 root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -root(A,C) # label(sos_10) # label(axiom). [clausify(11)].
% 0.75/1.05 Derived: root_occ(A,B) | -occurrence_of(B,f2(A,C)) | -subactivity_occurrence(A,B) | -root_occ(A,C). [resolve(46,d,39,b)].
% 0.75/1.05 Derived: root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -atocc(A,C) | -legal(A). [resolve(46,d,42,c)].
% 0.75/1.05 Derived: root_occ(f14(A,B),C) | -occurrence_of(C,A) | -subactivity_occurrence(f14(A,B),C) | -occurrence_of(B,A) | atomic(A). [resolve(46,d,45,c)].
% 0.75/1.05 47 -leaf(A,B) | root(A,B) | min_precedes(f4(A,B),A,B) # label(sos_14) # label(axiom). [clausify(15)].
% 0.75/1.05 Derived: -leaf(A,B) | min_precedes(f4(A,B),A,B) | -min_precedes(C,A,B). [resolve(47,b,40,b)].
% 0.75/1.05 Derived: -leaf(A,B) | min_precedes(f4(A,B),A,B) | legal(A). [resolve(47,b,41,a)].
% 0.75/1.05 Derived: -leaf(A,B) | min_precedes(f4(A,B),A,B) | subactivity(f13(B,A),B). [resolve(47,b,43,a)].
% 0.75/1.05 Derived: -leaf(A,B) | min_precedes(f4(A,B),A,B) | atocc(A,f13(B,A)). [resolve(47,b,44,a)].
% 0.75/1.05 Derived: -leaf(A,B) | min_precedes(f4(A,B),A,B) | root_occ(A,C) | -occurrence_of(C,B) | -subactivity_occurrence(A,C). [resolve(47,b,46,d)].
% 0.75/1.05 48 leaf(A,B) | -root(A,B) | min_precedes(A,f5(A,B),B) # label(sos_14) # label(axiom). [clausify(15)].
% 0.75/1.05 Derived: leaf(A,f2(A,B)) | min_precedes(A,f5(A,f2(A,B)),f2(A,B)) | -root_occ(A,B). [resolve(48,b,39,b)].
% 0.75/1.05 Derived: leaf(A,B) | min_precedes(A,f5(A,B),B) | -atocc(A,B) | -legal(A). [resolve(48,b,42,c)].
% 0.75/1.05 Derived: leaf(f14(A,B),A) | min_precedes(f14(A,B),f5(f14(A,B),A),A) | -occurrence_of(B,A) | atomic(A). [resolve(48,b,45,c)].
% 0.75/1.05 49 -precedes(A,B) | legal(B) # label(sos_08) # label(axiom). [clausify(9)].
% 0.75/1.05 50 -legal(A) | arboreal(A) # label(sos_17) # label(axiom). [clausify(18)].
% 0.75/1.05 Derived: -precedes(A,B) | arboreal(B). [resolve(49,b,50,a)].
% 0.75/1.05 51 precedes(A,B) | -earlier(A,B) | -legal(B) # label(sos_08) # label(axiom). [clausify(9)].
% 0.75/1.05 Derived: precedes(A,B) | -earlier(A,B) | -precedes(C,B). [resolve(51,c,49,b)].
% 0.75/1.05 52 -root_occ(A,B) | legal(A). [resolve(39,b,41,a)].
% 0.75/1.05 Derived: -root_occ(A,B) | arboreal(A). [resolve(52,b,50,a)].
% 0.75/1.05 Derived: -root_occ(A,B) | precedes(C,A) | -earlier(C,A). [resolve(52,b,51,c)].
% 0.75/1.05 53 -atocc(A,B) | -legal(A) | -min_precedes(C,A,B). [resolve(42,c,40,b)].
% 0.75/1.05 Derived: -atocc(A,B) | -min_precedes(C,A,B) | -precedes(D,A). [resolve(53,b,49,b)].
% 0.75/1.05 Derived: -atocc(A,B) | -min_precedes(C,A,B) | -root_occ(A,D). [resolve(53,b,52,b)].
% 0.75/1.05 54 subactivity(f13(A,B),A) | -atocc(B,A) | -legal(B). [resolve(43,a,42,c)].
% 0.75/1.05 Derived: subactivity(f13(A,B),A) | -atocc(B,A) | -precedes(C,B). [resolve(54,c,49,b)].
% 0.75/1.05 Derived: subactivity(f13(A,B),A) | -atocc(B,A) | -root_occ(B,C). [resolve(54,c,52,b)].
% 0.75/1.05 55 atocc(A,f13(B,A)) | -atocc(A,B) | -legal(A). [resolve(44,a,42,c)].
% 0.75/1.05 Derived: atocc(A,f13(B,A)) | -atocc(A,B) | -precedes(C,A). [resolve(55,c,49,b)].
% 0.75/1.05 Derived: atocc(A,f13(B,A)) | -atocc(A,B) | -root_occ(A,C). [resolve(55,c,52,b)].
% 0.75/1.05 56 -occurrence_of(A,B) | atomic(B) | legal(f14(B,A)). [resolve(45,c,41,a)].
% 0.75/1.05 Derived: -occurrence_of(A,B) | atomic(B) | arboreal(f14(B,A)). [resolve(56,c,50,a)].
% 0.75/1.05 Derived: -occurrence_of(A,B) | atomic(B) | precedes(C,f14(B,A)) | -earlier(C,f14(B,A)). [resolve(56,c,51,c)].
% 0.75/1.05 Derived: -occurrence_of(A,B) | atomic(B) | -atocc(f14(B,A),C) | -min_precedes(D,f14(B,A),C). [resolve(56,c,53,b)].
% 0.75/1.05 Derived: -occurrence_of(A,B) | atomic(B) | subactivity(f13(C,f14(B,A)),C) | -atocc(f14(B,A),C). [resolve(56,c,54,c)].
% 0.75/1.05 Derived: -occurrence_of(A,B) | atomic(B) | atocc(f14(B,A),f13(C,f14(B,A))) | -atocc(f14(B,A),C). [resolve(56,c,55,c)].
% 0.75/1.05 57 root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -atocc(A,C) | -legal(A). [resolve(46,d,42,c)].
% 0.75/1.05 Derived: root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -atocc(A,C) | -precedes(D,A). [resolve(57,e,49,b)].
% 0.75/1.05 Derived: root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -atocc(A,C) | -root_occ(A,D). [resolve(57,e,52,b)].
% 0.75/1.05 Derived: root_occ(f14(A,B),C) | -occurrence_of(C,D) | -subactivity_occurrence(f14(A,B),C) | -atocc(f14(A,B),D) | -occurrence_of(B,A) | atomic(A). [resolve(57,e,56,c)].
% 0.75/1.05 58 -leaf(A,B) | min_precedes(f4(A,B),A,B) | legal(A). [resolve(47,b,41,a)].
% 0.75/1.05 Derived: -leaf(A,B) | min_precedes(f4(A,B),A,B) | arboreal(A). [resolve(58,c,50,a)].
% 0.75/1.05 Derived: -leaf(A,B) | min_precedes(f4(A,B),A,B) | precedes(C,A) | -earlier(C,A). [resolve(58,c,51,c)].
% 0.75/1.05 Derived: -leaf(A,B) | min_precedes(f4(A,B),A,B) | -atocc(A,C) | -min_precedes(D,A,C). [resolve(58,c,53,b)].
% 0.75/1.05 Derived: -leaf(A,B) | min_precedes(f4(A,B),A,B) | subactivity(f13(C,A),C) | -atocc(A,C). [resolve(58,c,54,c)].
% 0.75/1.05 Derived: -leaf(A,B) | min_precedes(f4(A,B),A,B) | atocc(A,f13(C,A)) | -atocc(A,C). [resolve(58,c,55,c)].
% 0.75/1.05 Derived: -leaf(A,B) | min_precedes(f4(A,B),A,B) | root_occ(A,C) | -occurrence_of(C,D) | -subactivity_occurrence(A,C) | -atocc(A,D). [resolve(58,c,57,e)].
% 0.75/1.05 59 leaf(A,B) | min_precedes(A,f5(A,B),B) | -atocc(A,B) | -legal(A). [resolve(48,b,42,c)].
% 0.75/1.05 Derived: leaf(A,B) | min_precedes(A,f5(A,B),B) | -atocc(A,B) | -precedes(C,A). [resolve(59,d,49,b)].
% 0.75/1.05 Derived: leaf(A,B) | min_precedes(A,f5(A,B),B) | -atocc(A,B) | -root_occ(A,C). [resolve(59,d,52,b)].
% 0.75/1.05 Derived: leaf(f14(A,B),C) | min_precedes(f14(A,B),f5(f14(A,B),C),C) | -atocc(f14(A,B),C) | -occurrence_of(B,A) | atomic(A). [resolve(59,d,56,c)].
% 0.75/1.05 Derived: leaf(A,B) | min_precedes(A,f5(A,B),B) | -atocc(A,B) | -leaf(A,C) | min_precedes(f4(A,C),A,C). [resolve(59,d,58,c)].
% 0.75/1.05 60 -activity_occurrence(A) | occurrence_of(A,f7(A)) # label(sos_18) # label(axiom). [clausify(19)].
% 0.75/1.05 61 -subactivity_occurrence(A,B) | activity_occurrence(A) # label(sos_19) # label(axiom). [clausify(20)].
% 0.75/1.06 62 -subactivity_occurrence(A,B) | activity_occurrence(B) # label(sos_19) # label(axiom). [clausify(20)].
% 0.75/1.06 63 -occurrence_of(A,B) | activity_occurrence(A) # label(sos_29) # label(axiom). [clausify(30)].
% 0.75/1.06 Derived: occurrence_of(A,f7(A)) | -subactivity_occurrence(A,B). [resolve(60,a,61,b)].
% 0.75/1.06 Derived: occurrence_of(A,f7(A)) | -subactivity_occurrence(B,A). [resolve(60,a,62,b)].
% 0.75/1.06 Derived: occurrence_of(A,f7(A)) | -occurrence_of(A,B). [resolve(60,a,63,b)].
% 0.75/1.06 64 subactivity(f7(A),f7(A)) | -activity_occurrence(A). [resolve(35,a,37,b)].
% 0.75/1.06 Derived: subactivity(f7(A),f7(A)) | -subactivity_occurrence(A,B). [resolve(64,b,61,b)].
% 0.75/1.06 Derived: subactivity(f7(A),f7(A)) | -subactivity_occurrence(B,A). [resolve(64,b,62,b)].
% 0.75/1.06 Derived: subactivity(f7(A),f7(A)) | -occurrence_of(A,B). [resolve(64,b,63,b)].
% 0.75/1.06 65 atocc(A,B) | -subactivity(B,C) | -atomic(C) | -occurrence_of(A,C) # label(sos_15) # label(axiom). [clausify(16)].
% 0.75/1.06 66 -atocc(A,B) | subactivity(B,f6(A,B)) # label(sos_15) # label(axiom). [clausify(16)].
% 0.75/1.06 67 -min_precedes(A,B,C) | subactivity(f11(C,A,B),C) # label(sos_26) # label(axiom). [clausify(27)].
% 0.75/1.06 68 -min_precedes(A,B,C) | subactivity(f12(C,A,B),C) # label(sos_26) # label(axiom). [clausify(27)].
% 0.75/1.06 Derived: atocc(A,B) | -atomic(f6(C,B)) | -occurrence_of(A,f6(C,B)) | -atocc(C,B). [resolve(65,b,66,b)].
% 0.75/1.06 Derived: atocc(A,f11(B,C,D)) | -atomic(B) | -occurrence_of(A,B) | -min_precedes(C,D,B). [resolve(65,b,67,b)].
% 0.75/1.06 Derived: atocc(A,f12(B,C,D)) | -atomic(B) | -occurrence_of(A,B) | -min_precedes(C,D,B). [resolve(65,b,68,b)].
% 0.75/1.06 69 subactivity(tptp0,tptp0). [resolve(35,a,36,a)].
% 0.75/1.06 Derived: atocc(A,tptp0) | -atomic(tptp0) | -occurrence_of(A,tptp0). [resolve(69,a,65,b)].
% 0.75/1.06 70 subactivity(A,A) | -occurrence_of(B,A). [resolve(35,a,38,b)].
% 0.75/1.06 Derived: -occurrence_of(A,B) | atocc(C,B) | -atomic(B) | -occurrence_of(C,B). [resolve(70,a,65,b)].
% 0.75/1.06 71 subactivity(f13(f2(A,B),A),f2(A,B)) | -root_occ(A,B). [resolve(43,a,39,b)].
% 0.75/1.06 Derived: -root_occ(A,B) | atocc(C,f13(f2(A,B),A)) | -atomic(f2(A,B)) | -occurrence_of(C,f2(A,B)). [resolve(71,a,65,b)].
% 0.75/1.06 72 -occurrence_of(A,B) | atomic(B) | subactivity(f13(B,f14(B,A)),B). [resolve(45,c,43,a)].
% 0.75/1.06 73 -leaf(A,B) | min_precedes(f4(A,B),A,B) | subactivity(f13(B,A),B). [resolve(47,b,43,a)].
% 0.75/1.06 Derived: -leaf(A,B) | min_precedes(f4(A,B),A,B) | atocc(C,f13(B,A)) | -atomic(B) | -occurrence_of(C,B). [resolve(73,c,65,b)].
% 0.75/1.06 74 subactivity(f13(A,B),A) | -atocc(B,A) | -precedes(C,B). [resolve(54,c,49,b)].
% 0.75/1.06 Derived: -atocc(A,B) | -precedes(C,A) | atocc(D,f13(B,A)) | -atomic(B) | -occurrence_of(D,B). [resolve(74,a,65,b)].
% 0.75/1.06 75 subactivity(f13(A,B),A) | -atocc(B,A) | -root_occ(B,C). [resolve(54,c,52,b)].
% 0.75/1.06 Derived: -atocc(A,B) | -root_occ(A,C) | atocc(D,f13(B,A)) | -atomic(B) | -occurrence_of(D,B). [resolve(75,a,65,b)].
% 0.75/1.06 76 -occurrence_of(A,B) | atomic(B) | subactivity(f13(C,f14(B,A)),C) | -atocc(f14(B,A),C). [resolve(56,c,54,c)].
% 0.75/1.06 Derived: -occurrence_of(A,B) | atomic(B) | -atocc(f14(B,A),C) | atocc(D,f13(C,f14(B,A))) | -atomic(C) | -occurrence_of(D,C). [resolve(76,c,65,b)].
% 0.75/1.06 77 -leaf(A,B) | min_precedes(f4(A,B),A,B) | subactivity(f13(C,A),C) | -atocc(A,C). [resolve(58,c,54,c)].
% 0.75/1.06 Derived: -leaf(A,B) | min_precedes(f4(A,B),A,B) | -atocc(A,C) | atocc(D,f13(C,A)) | -atomic(C) | -occurrence_of(D,C). [resolve(77,c,65,b)].
% 0.75/1.06 78 subactivity(f7(A),f7(A)) | -subactivity_occurrence(A,B). [resolve(64,b,61,b)].
% 0.75/1.06 79 subactivity(f7(A),f7(A)) | -subactivity_occurrence(B,A). [resolve(64,b,62,b)].
% 0.75/1.06 80 subactivity(f7(A),f7(A)) | -occurrence_of(A,B). [resolve(64,b,63,b)].
% 0.75/1.06
% 0.75/1.06 ============================== end predicate elimination =============
% 0.75/1.06
% 0.75/1.06 Auto_denials: (non-Horn, no changes).
% 0.75/1.06
% 0.75/1.06 Term ordering decisions:
% 0.75/1.06
% 0.75/1.06 % Assigning unary symbol f7 kb_weight 0 and highest precedence (37).
% 0.75/1.06 Function symbol KB weights: tptp0=1. tptp1=1. tptp2=1. tptp3=1. tptp4=1. c1=1. c2=1. f2=1. f3=1. f4=1. f5=1. f6=1. f8=1. f10=1. f13=1. f14=1. f15=1. f16=1. f17=1. f1=1. f9=1. f11=1. f12=1. f7=0.
% 0.75/1.06
% 0.75/1.06 ============================== end of process initial clauses ========
% 0.75/1.06
% 0.75/1.06 ============================== CLAUSES FOR SEARCH ====================
% 10.97/11.28
% 10.97/11.28 ============================== end of clauses for search =============
% 10.97/11.28
% 10.97/11.28 ============================== SEARCH ================================
% 10.97/11.28
% 10.97/11.28 % Starting search at 0.02 seconds.
% 10.97/11.28
% 10.97/11.28 Low Water (keep): wt=38.000, iters=3657
% 10.97/11.28
% 10.97/11.28 Low Water (keep): wt=36.000, iters=3550
% 10.97/11.28
% 10.97/11.28 Low Water (keep): wt=35.000, iters=3476
% 10.97/11.28
% 10.97/11.28 Low Water (keep): wt=33.000, iters=5589
% 10.97/11.28
% 10.97/11.28 Low Water (keep): wt=30.000, iters=4779
% 10.97/11.28
% 10.97/11.28 Low Water (keep): wt=27.000, iters=3978
% 10.97/11.28
% 10.97/11.28 Low Water (keep): wt=26.000, iters=3359
% 10.97/11.28
% 10.97/11.28 Low Water (keep): wt=25.000, iters=3337
% 10.97/11.28
% 10.97/11.28 ============================== PROOF =================================
% 10.97/11.28 % SZS status Theorem
% 10.97/11.28 % SZS output start Refutation
% 10.97/11.28
% 10.97/11.28 % Proof 1 at 10.17 (+ 0.07) seconds.
% 10.97/11.28 % Length of proof is 87.
% 10.97/11.28 % Level of proof is 18.
% 10.97/11.28 % Maximum clause weight is 27.000.
% 10.97/11.28 % Given clauses 9362.
% 10.97/11.28
% 10.97/11.28 1 (all X0 all X1 all X2 all X3 (min_precedes(X0,X1,X3) & min_precedes(X1,X2,X3) -> min_precedes(X0,X2,X3))) # label(sos) # label(axiom) # label(non_clause). [assumption].
% 10.97/11.28 7 (all X22 all X23 all X24 (min_precedes(X22,X23,X24) -> precedes(X22,X23))) # label(sos_06) # label(axiom) # label(non_clause). [assumption].
% 10.97/11.28 9 (all X28 all X29 (precedes(X28,X29) <-> earlier(X28,X29) & legal(X29))) # label(sos_08) # label(axiom) # label(non_clause). [assumption].
% 10.97/11.28 10 (all X30 all X31 (earlier(X30,X31) -> -earlier(X31,X30))) # label(sos_09) # label(axiom) # label(non_clause). [assumption].
% 10.97/11.28 15 (all X42 all X43 (leaf(X42,X43) <-> (root(X42,X43) | (exists X44 min_precedes(X44,X42,X43))) & -(exists X45 min_precedes(X42,X45,X43)))) # label(sos_14) # label(axiom) # label(non_clause). [assumption].
% 10.97/11.28 16 (all X46 all X47 (atocc(X46,X47) <-> (exists X48 (subactivity(X47,X48) & atomic(X48) & occurrence_of(X46,X48))))) # label(sos_15) # label(axiom) # label(non_clause). [assumption].
% 10.97/11.28 17 (all X49 all X50 (atocc(X49,X50) & legal(X49) -> root(X49,X50))) # label(sos_16) # label(axiom) # label(non_clause). [assumption].
% 10.97/11.28 23 (all X64 all X65 all X66 (occurrence_of(X64,X65) & occurrence_of(X64,X66) -> X65 = X66)) # label(sos_22) # label(axiom) # label(non_clause). [assumption].
% 10.97/11.28 28 (all X82 all X83 (root(X83,X82) -> (exists X84 (subactivity(X84,X82) & atocc(X83,X84))))) # label(sos_27) # label(axiom) # label(non_clause). [assumption].
% 10.97/11.28 30 (all X89 all X90 (occurrence_of(X90,X89) -> activity(X89) & activity_occurrence(X90))) # label(sos_29) # label(axiom) # label(non_clause). [assumption].
% 10.97/11.28 32 (all X94 (activity(X94) -> subactivity(X94,X94))) # label(sos_31) # label(axiom) # label(non_clause). [assumption].
% 10.97/11.28 33 (all X95 all X96 (occurrence_of(X96,tptp0) & subactivity_occurrence(X95,X96) & arboreal(X95) & -leaf_occ(X95,X96) -> (exists X97 exists X98 exists X99 (occurrence_of(X97,tptp3) & next_subocc(X95,X97,tptp0) & occurrence_of(X98,tptp4) & min_precedes(X97,X98,tptp0) & (occurrence_of(X99,tptp2) | occurrence_of(X99,tptp1)) & min_precedes(X98,X99,tptp0) & (all X100 (min_precedes(X97,X100,tptp0) -> X100 = X98 | X100 = X99)))))) # label(sos_32) # label(axiom) # label(non_clause). [assumption].
% 10.97/11.28 34 -(all X101 all X102 (occurrence_of(X102,tptp0) & subactivity_occurrence(X101,X102) & arboreal(X101) & -leaf_occ(X101,X102) -> (exists X103 exists X104 (occurrence_of(X103,tptp3) & next_subocc(X101,X103,tptp0) & (occurrence_of(X104,tptp2) | occurrence_of(X104,tptp1)) & min_precedes(X103,X104,tptp0) & leaf(X104,tptp0))))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 10.97/11.28 35 -activity(A) | subactivity(A,A) # label(sos_31) # label(axiom). [clausify(32)].
% 10.97/11.28 38 -occurrence_of(A,B) | activity(B) # label(sos_29) # label(axiom). [clausify(30)].
% 10.97/11.28 42 -atocc(A,B) | -legal(A) | root(A,B) # label(sos_16) # label(axiom). [clausify(17)].
% 10.97/11.28 44 -root(A,B) | atocc(A,f13(B,A)) # label(sos_27) # label(axiom). [clausify(28)].
% 10.97/11.28 49 -precedes(A,B) | legal(B) # label(sos_08) # label(axiom). [clausify(9)].
% 10.97/11.28 55 atocc(A,f13(B,A)) | -atocc(A,B) | -legal(A). [resolve(44,a,42,c)].
% 10.97/11.28 65 atocc(A,B) | -subactivity(B,C) | -atomic(C) | -occurrence_of(A,C) # label(sos_15) # label(axiom). [clausify(16)].
% 10.97/11.28 70 subactivity(A,A) | -occurrence_of(B,A). [resolve(35,a,38,b)].
% 10.97/11.28 82 atomic(tptp2) # label(sos_36) # label(axiom). [assumption].
% 10.97/11.28 85 arboreal(c1) # label(goals) # label(negated_conjecture). [clausify(34)].
% 10.97/11.28 86 occurrence_of(c2,tptp0) # label(goals) # label(negated_conjecture). [clausify(34)].
% 10.97/11.28 87 subactivity_occurrence(c1,c2) # label(goals) # label(negated_conjecture). [clausify(34)].
% 10.97/11.28 95 -leaf_occ(c1,c2) # label(goals) # label(negated_conjecture). [clausify(34)].
% 10.97/11.28 96 -earlier(A,B) | -earlier(B,A) # label(sos_09) # label(axiom). [clausify(10)].
% 10.97/11.28 101 -occurrence_of(A,tptp3) | -next_subocc(c1,A,tptp0) | -occurrence_of(B,tptp2) | -min_precedes(A,B,tptp0) | -leaf(B,tptp0) # label(goals) # label(negated_conjecture). [clausify(34)].
% 10.97/11.28 102 -occurrence_of(A,tptp3) | -next_subocc(c1,A,tptp0) | -occurrence_of(B,tptp1) | -min_precedes(A,B,tptp0) | -leaf(B,tptp0) # label(goals) # label(negated_conjecture). [clausify(34)].
% 10.97/11.28 105 -precedes(A,B) | earlier(A,B) # label(sos_08) # label(axiom). [clausify(9)].
% 10.97/11.28 108 -min_precedes(A,B,C) | precedes(A,B) # label(sos_06) # label(axiom). [clausify(7)].
% 10.97/11.28 116 -atocc(A,B) | occurrence_of(A,f6(A,B)) # label(sos_15) # label(axiom). [clausify(16)].
% 10.97/11.28 118 -occurrence_of(A,B) | -occurrence_of(A,C) | C = B # label(sos_22) # label(axiom). [clausify(23)].
% 10.97/11.28 129 -min_precedes(A,B,C) | -min_precedes(B,D,C) | min_precedes(A,D,C) # label(sos) # label(axiom). [clausify(1)].
% 10.97/11.28 132 leaf(A,B) | -min_precedes(C,A,B) | min_precedes(A,f5(A,B),B) # label(sos_14) # label(axiom). [clausify(15)].
% 10.97/11.28 136 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | occurrence_of(f15(B,A),tptp3) # label(sos_32) # label(axiom). [clausify(33)].
% 10.97/11.28 138 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | next_subocc(B,f15(B,A),tptp0) # label(sos_32) # label(axiom). [clausify(33)].
% 10.97/11.28 139 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | min_precedes(f15(B,A),f16(B,A),tptp0) # label(sos_32) # label(axiom). [clausify(33)].
% 10.97/11.28 140 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | min_precedes(f16(B,A),f17(B,A),tptp0) # label(sos_32) # label(axiom). [clausify(33)].
% 10.97/11.28 141 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | occurrence_of(f17(B,A),tptp2) | occurrence_of(f17(B,A),tptp1) # label(sos_32) # label(axiom). [clausify(33)].
% 10.97/11.28 143 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | -min_precedes(f15(B,A),C,tptp0) | C = f16(B,A) | C = f17(B,A) # label(sos_32) # label(axiom). [clausify(33)].
% 10.97/11.28 144 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | -min_precedes(f15(B,A),C,tptp0) | f16(B,A) = C | f17(B,A) = C. [copy(143),flip(f),flip(g)].
% 10.97/11.28 162 atocc(A,f13(B,A)) | -atocc(A,B) | -precedes(C,A). [resolve(55,c,49,b)].
% 10.97/11.28 186 -occurrence_of(A,B) | atocc(C,B) | -atomic(B) | -occurrence_of(C,B). [resolve(70,a,65,b)].
% 10.97/11.28 193 -earlier(A,A). [factor(96,a,b)].
% 10.97/11.28 196 -occurrence_of(A,B) | atocc(A,B) | -atomic(B). [factor(186,a,d)].
% 10.97/11.28 200 occurrence_of(f15(c1,c2),tptp3). [resolve(136,b,87,a),unit_del(a,86),unit_del(b,85),unit_del(c,95)].
% 10.97/11.28 202 next_subocc(c1,f15(c1,c2),tptp0). [resolve(138,b,87,a),unit_del(a,86),unit_del(b,85),unit_del(c,95)].
% 10.97/11.28 203 min_precedes(f15(c1,c2),f16(c1,c2),tptp0). [resolve(139,b,87,a),unit_del(a,86),unit_del(b,85),unit_del(c,95)].
% 10.97/11.28 204 min_precedes(f16(c1,c2),f17(c1,c2),tptp0). [resolve(140,b,87,a),unit_del(a,86),unit_del(b,85),unit_del(c,95)].
% 10.97/11.28 205 occurrence_of(f17(c1,c2),tptp2) | occurrence_of(f17(c1,c2),tptp1). [resolve(141,b,87,a),unit_del(a,86),unit_del(b,85),unit_del(c,95)].
% 10.97/11.28 264 -occurrence_of(A,tptp1) | -min_precedes(f15(c1,c2),A,tptp0) | -leaf(A,tptp0). [resolve(202,a,102,b),unit_del(a,200)].
% 10.97/11.28 265 -occurrence_of(A,tptp2) | -min_precedes(f15(c1,c2),A,tptp0) | -leaf(A,tptp0). [resolve(202,a,101,b),unit_del(a,200)].
% 10.97/11.28 304 -min_precedes(f16(c1,c2),A,tptp0) | min_precedes(f15(c1,c2),A,tptp0). [resolve(203,a,129,a)].
% 10.97/11.28 329 leaf(f17(c1,c2),tptp0) | min_precedes(f17(c1,c2),f5(f17(c1,c2),tptp0),tptp0). [resolve(204,a,132,b)].
% 10.97/11.28 337 precedes(f16(c1,c2),f17(c1,c2)). [resolve(204,a,108,a)].
% 10.97/11.28 355 occurrence_of(f17(c1,c2),tptp1) | atocc(f17(c1,c2),tptp2). [resolve(205,a,196,a),unit_del(c,82)].
% 10.97/11.28 357 occurrence_of(f17(c1,c2),tptp1) | -occurrence_of(f17(c1,c2),A) | tptp2 = A. [resolve(205,a,118,b)].
% 10.97/11.28 362 atocc(f17(c1,c2),f13(A,f17(c1,c2))) | -atocc(f17(c1,c2),A). [resolve(337,a,162,c)].
% 10.97/11.28 364 earlier(f16(c1,c2),f17(c1,c2)). [resolve(337,a,105,a)].
% 10.97/11.28 669 min_precedes(f15(c1,c2),f17(c1,c2),tptp0). [resolve(304,a,204,a)].
% 10.97/11.28 671 -occurrence_of(f17(c1,c2),tptp2) | -leaf(f17(c1,c2),tptp0). [resolve(669,a,265,b)].
% 10.97/11.28 672 -occurrence_of(f17(c1,c2),tptp1) | -leaf(f17(c1,c2),tptp0). [resolve(669,a,264,b)].
% 10.97/11.28 676 -min_precedes(f17(c1,c2),A,tptp0) | min_precedes(f15(c1,c2),A,tptp0). [resolve(669,a,129,a)].
% 10.97/11.28 876 leaf(f17(c1,c2),tptp0) | precedes(f17(c1,c2),f5(f17(c1,c2),tptp0)). [resolve(329,b,108,a)].
% 10.97/11.28 960 min_precedes(f15(c1,c2),f5(f17(c1,c2),tptp0),tptp0) | leaf(f17(c1,c2),tptp0). [resolve(676,a,329,b)].
% 10.97/11.28 1030 atocc(f17(c1,c2),f13(tptp2,f17(c1,c2))) | occurrence_of(f17(c1,c2),tptp1). [resolve(362,b,355,b)].
% 10.97/11.28 1721 leaf(f17(c1,c2),tptp0) | earlier(f17(c1,c2),f5(f17(c1,c2),tptp0)). [resolve(876,b,105,a)].
% 10.97/11.28 1738 occurrence_of(f17(c1,c2),tptp1) | atocc(f17(c1,c2),f13(f13(tptp2,f17(c1,c2)),f17(c1,c2))). [resolve(1030,a,362,b)].
% 10.97/11.28 1878 leaf(f17(c1,c2),tptp0) | -earlier(f5(f17(c1,c2),tptp0),f17(c1,c2)). [resolve(1721,b,96,b)].
% 10.97/11.28 2153 leaf(f17(c1,c2),tptp0) | f5(f17(c1,c2),tptp0) = f16(c1,c2) | f5(f17(c1,c2),tptp0) = f17(c1,c2). [resolve(960,a,144,e),flip(f),flip(g),unit_del(b,86),unit_del(c,87),unit_del(d,85),unit_del(e,95)].
% 10.97/11.28 5445 occurrence_of(f17(c1,c2),tptp1) | occurrence_of(f17(c1,c2),f6(f17(c1,c2),f13(f13(tptp2,f17(c1,c2)),f17(c1,c2)))). [resolve(1738,b,116,a)].
% 10.97/11.28 14086 f5(f17(c1,c2),tptp0) = f16(c1,c2) | f5(f17(c1,c2),tptp0) = f17(c1,c2) | -occurrence_of(f17(c1,c2),tptp1). [resolve(2153,a,672,b)].
% 10.97/11.28 14087 f5(f17(c1,c2),tptp0) = f16(c1,c2) | f5(f17(c1,c2),tptp0) = f17(c1,c2) | -occurrence_of(f17(c1,c2),tptp2). [resolve(2153,a,671,b)].
% 10.97/11.28 17005 occurrence_of(f17(c1,c2),tptp1) | f6(f17(c1,c2),f13(f13(tptp2,f17(c1,c2)),f17(c1,c2))) = tptp2. [resolve(5445,b,357,b),flip(c),merge(b)].
% 10.97/11.28 20024 f5(f17(c1,c2),tptp0) = f16(c1,c2) | f5(f17(c1,c2),tptp0) = f17(c1,c2) | occurrence_of(f17(c1,c2),tptp1). [resolve(14087,c,205,a)].
% 10.97/11.28 21110 f5(f17(c1,c2),tptp0) = f16(c1,c2) | f5(f17(c1,c2),tptp0) = f17(c1,c2). [resolve(20024,c,14086,c),merge(c),merge(d)].
% 10.97/11.28 21113 f5(f17(c1,c2),tptp0) = f16(c1,c2) | leaf(f17(c1,c2),tptp0). [para(21110(b,1),1721(b,2)),unit_del(c,193)].
% 10.97/11.28 21206 f5(f17(c1,c2),tptp0) = f16(c1,c2) | -occurrence_of(f17(c1,c2),tptp1). [resolve(21113,b,672,b)].
% 10.97/11.28 21207 f5(f17(c1,c2),tptp0) = f16(c1,c2) | -occurrence_of(f17(c1,c2),tptp2). [resolve(21113,b,671,b)].
% 10.97/11.28 21269 f5(f17(c1,c2),tptp0) = f16(c1,c2) | occurrence_of(f17(c1,c2),tptp1). [resolve(21207,b,205,a)].
% 10.97/11.28 21270 f5(f17(c1,c2),tptp0) = f16(c1,c2). [resolve(21269,b,21206,b),merge(b)].
% 10.97/11.28 22115 leaf(f17(c1,c2),tptp0). [back_rewrite(1878),rewrite([21270(10)]),unit_del(b,364)].
% 10.97/11.28 22123 -occurrence_of(f17(c1,c2),tptp1). [back_unit_del(672),unit_del(b,22115)].
% 10.97/11.28 22124 -occurrence_of(f17(c1,c2),tptp2). [back_unit_del(671),unit_del(b,22115)].
% 10.97/11.28 22193 f6(f17(c1,c2),f13(f13(tptp2,f17(c1,c2)),f17(c1,c2))) = tptp2. [back_unit_del(17005),unit_del(a,22123)].
% 10.97/11.28 22361 $F. [back_unit_del(5445),rewrite([22193(21)]),unit_del(a,22123),unit_del(b,22124)].
% 10.97/11.28
% 10.97/11.28 % SZS output end Refutation
% 10.97/11.28 ============================== end of proof ==========================
% 10.97/11.28
% 10.97/11.28 ============================== STATISTICS ============================
% 10.97/11.28
% 10.97/11.28 Given=9362. Generated=93693. Kept=22279. proofs=1.
% 10.97/11.28 Usable=7217. Sos=7893. Demods=176. Limbo=238, Disabled=7089. Hints=0.
% 10.97/11.28 Megabytes=36.77.
% 10.97/11.28 User_CPU=10.17, System_CPU=0.07, Wall_clock=11.
% 10.97/11.28
% 10.97/11.28 ============================== end of statistics =====================
% 10.97/11.28
% 10.97/11.28 ============================== end of search =========================
% 10.97/11.28
% 10.97/11.28 THEOREM PROVED
% 10.97/11.28 % SZS status Theorem
% 10.97/11.28
% 10.97/11.28 Exiting with 1 proof.
% 10.97/11.28
% 10.97/11.28 Process 26495 exit (max_proofs) Mon Jun 13 02:24:46 2022
% 10.97/11.28 Prover9 interrupted
%------------------------------------------------------------------------------