TSTP Solution File: PRO011+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PRO011+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n024.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:11 EDT 2022
% Result : Theorem 0.79s 1.13s
% Output : Refutation 0.79s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : PRO011+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.35 % Computer : n024.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:03:48 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.75/1.04 ============================== Prover9 ===============================
% 0.75/1.04 Prover9 (32) version 2009-11A, November 2009.
% 0.75/1.04 Process 25330 was started by sandbox2 on n024.cluster.edu,
% 0.75/1.04 Mon Jun 13 01:03:49 2022
% 0.75/1.04 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_25177_n024.cluster.edu".
% 0.75/1.04 ============================== end of head ===========================
% 0.75/1.04
% 0.75/1.04 ============================== INPUT =================================
% 0.75/1.04
% 0.75/1.04 % Reading from file /tmp/Prover9_25177_n024.cluster.edu
% 0.75/1.04
% 0.75/1.04 set(prolog_style_variables).
% 0.75/1.04 set(auto2).
% 0.75/1.04 % set(auto2) -> set(auto).
% 0.75/1.04 % set(auto) -> set(auto_inference).
% 0.75/1.04 % set(auto) -> set(auto_setup).
% 0.75/1.04 % set(auto_setup) -> set(predicate_elim).
% 0.75/1.04 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.75/1.04 % set(auto) -> set(auto_limits).
% 0.75/1.04 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.75/1.04 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.75/1.04 % set(auto) -> set(auto_denials).
% 0.75/1.04 % set(auto) -> set(auto_process).
% 0.75/1.04 % set(auto2) -> assign(new_constants, 1).
% 0.75/1.04 % set(auto2) -> assign(fold_denial_max, 3).
% 0.75/1.04 % set(auto2) -> assign(max_weight, "200.000").
% 0.75/1.04 % set(auto2) -> assign(max_hours, 1).
% 0.75/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.75/1.04 % set(auto2) -> assign(max_seconds, 0).
% 0.75/1.04 % set(auto2) -> assign(max_minutes, 5).
% 0.75/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.75/1.04 % set(auto2) -> set(sort_initial_sos).
% 0.75/1.04 % set(auto2) -> assign(sos_limit, -1).
% 0.75/1.04 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.75/1.04 % set(auto2) -> assign(max_megs, 400).
% 0.75/1.04 % set(auto2) -> assign(stats, some).
% 0.75/1.04 % set(auto2) -> clear(echo_input).
% 0.75/1.04 % set(auto2) -> set(quiet).
% 0.75/1.04 % set(auto2) -> clear(print_initial_clauses).
% 0.75/1.04 % set(auto2) -> clear(print_given).
% 0.75/1.04 assign(lrs_ticks,-1).
% 0.75/1.04 assign(sos_limit,10000).
% 0.75/1.04 assign(order,kbo).
% 0.75/1.04 set(lex_order_vars).
% 0.75/1.04 clear(print_given).
% 0.75/1.04
% 0.75/1.04 % formulas(sos). % not echoed (49 formulas)
% 0.75/1.04
% 0.75/1.04 ============================== end of input ==========================
% 0.75/1.04
% 0.75/1.04 % From the command line: assign(max_seconds, 300).
% 0.75/1.04
% 0.75/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.75/1.04
% 0.75/1.04 % Formulas that are not ordinary clauses:
% 0.75/1.04 1 (all X0 all X1 (occurrence_of(X1,X0) -> activity(X0) & activity_occurrence(X1))) # label(sos) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 2 (all X2 (activity_occurrence(X2) -> (exists X3 (activity(X3) & occurrence_of(X2,X3))))) # label(sos_01) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 3 (all X4 all X5 all X6 (occurrence_of(X4,X5) & occurrence_of(X4,X6) -> X5 = X6)) # label(sos_02) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 4 (all X7 (activity(X7) -> subactivity(X7,X7))) # label(sos_03) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 5 (all X8 all X9 (earlier(X8,X9) -> -earlier(X9,X8))) # label(sos_04) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 6 (all X10 all X11 all X12 (earlier(X10,X11) & earlier(X11,X12) -> earlier(X10,X12))) # label(sos_05) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 7 (all X13 all X14 all X15 (earlier(X13,X14) & earlier(X15,X14) -> earlier(X15,X13) | earlier(X13,X15) | X13 = X15)) # label(sos_06) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 8 (all X16 all X17 (occurrence_of(X16,X17) -> (arboreal(X16) <-> atomic(X17)))) # label(sos_07) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 9 (all X18 (legal(X18) -> arboreal(X18))) # label(sos_08) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 10 (all X19 all X20 (legal(X19) & earlier(X20,X19) -> legal(X20))) # label(sos_09) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 11 (all X21 all X22 (precedes(X21,X22) <-> earlier(X21,X22) & legal(X22))) # label(sos_10) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 12 (all X23 all X24 all X25 (min_precedes(X24,X25,X23) -> (exists X26 exists X27 (subactivity(X26,X23) & subactivity(X27,X23) & atocc(X24,X26) & atocc(X25,X27))))) # label(sos_11) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 13 (all X28 all X29 (root(X29,X28) -> (exists X30 (subactivity(X30,X28) & atocc(X29,X30))))) # label(sos_12) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 14 (all X31 all X32 all X33 (min_precedes(X31,X32,X33) -> (exists X34 (root(X34,X33) & min_precedes(X34,X32,X33))))) # label(sos_13) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 15 (all X35 all X36 all X37 (min_precedes(X35,X36,X37) -> -root(X36,X37))) # label(sos_14) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 16 (all X38 all X39 all X40 (min_precedes(X38,X39,X40) -> precedes(X38,X39))) # label(sos_15) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 17 (all X41 all X42 (root(X41,X42) -> legal(X41))) # label(sos_16) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 18 (all X43 all X44 (atocc(X43,X44) & legal(X43) -> root(X43,X44))) # label(sos_17) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 19 (all X45 all X46 all X47 all X48 (min_precedes(X45,X46,X48) & min_precedes(X45,X47,X48) & precedes(X46,X47) -> min_precedes(X46,X47,X48))) # label(sos_18) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 20 (all X49 all X50 all X51 (min_precedes(X49,X50,X51) -> -atomic(X51))) # label(sos_19) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 21 (all X52 all X53 all X54 all X55 (min_precedes(X53,X52,X55) & min_precedes(X54,X52,X55) & precedes(X53,X54) -> min_precedes(X53,X54,X55))) # label(sos_20) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 22 (all X56 all X57 (leaf(X56,X57) <-> (root(X56,X57) | (exists X58 min_precedes(X58,X56,X57))) & -(exists X59 min_precedes(X56,X59,X57)))) # label(sos_21) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 23 (all X60 all X61 all X62 (next_subocc(X60,X61,X62) <-> min_precedes(X60,X61,X62) & -(exists X63 (min_precedes(X60,X63,X62) & min_precedes(X63,X61,X62))))) # label(sos_22) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 24 (all X64 all X65 (atocc(X64,X65) <-> (exists X66 (subactivity(X65,X66) & atomic(X66) & occurrence_of(X64,X66))))) # label(sos_23) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 25 (all X67 all X68 (subactivity_occurrence(X67,X68) -> activity_occurrence(X67) & activity_occurrence(X68))) # label(sos_24) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 26 (all X69 all X70 all X71 (min_precedes(X70,X71,X69) -> (exists X72 (occurrence_of(X72,X69) & subactivity_occurrence(X70,X72) & subactivity_occurrence(X71,X72))))) # label(sos_25) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 27 (all X73 all X74 (root(X74,X73) & -atomic(X73) -> (exists X75 (occurrence_of(X75,X73) & subactivity_occurrence(X74,X75))))) # label(sos_26) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 28 (all X76 all X77 (occurrence_of(X77,X76) & -atomic(X76) -> (exists X78 (root(X78,X76) & subactivity_occurrence(X78,X77))))) # label(sos_27) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 29 (all X79 all X80 all X81 all X82 (occurrence_of(X80,X79) & arboreal(X81) & arboreal(X82) & subactivity_occurrence(X81,X80) & subactivity_occurrence(X82,X80) -> min_precedes(X81,X82,X79) | min_precedes(X82,X81,X79) | X81 = X82)) # label(sos_28) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 30 (all X83 all X84 all X85 all X86 (min_precedes(X83,X84,X85) & occurrence_of(X86,X85) & subactivity_occurrence(X84,X86) -> subactivity_occurrence(X83,X86))) # label(sos_29) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 31 (all X87 all X88 all X89 all X90 (occurrence_of(X89,X87) & occurrence_of(X90,X88) & -atomic(X87) & subactivity_occurrence(X89,X90) -> subactivity(X87,X88))) # label(sos_30) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 32 (all X91 all X92 all X93 (subactivity_occurrence(X91,X92) & subactivity_occurrence(X92,X93) -> subactivity_occurrence(X91,X93))) # label(sos_31) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 33 (all X94 all X95 all X96 all X97 (occurrence_of(X96,X94) & occurrence_of(X97,X95) & subactivity(X94,X95) & -subactivity_occurrence(X96,X97) -> (exists X98 (subactivity_occurrence(X98,X97) & -subactivity_occurrence(X98,X96))))) # label(sos_32) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 34 (all X99 all X100 (root_occ(X99,X100) <-> (exists X101 (occurrence_of(X100,X101) & subactivity_occurrence(X99,X100) & root(X99,X101))))) # label(sos_33) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 35 (all X102 all X103 (leaf_occ(X102,X103) <-> (exists X104 (occurrence_of(X103,X104) & subactivity_occurrence(X102,X103) & leaf(X102,X104))))) # label(sos_34) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 36 (all X105 (occurrence_of(X105,tptp0) -> (exists X106 exists X107 exists X108 (occurrence_of(X106,tptp3) & root_occ(X106,X105) & occurrence_of(X107,tptp4) & next_subocc(X106,X107,tptp0) & (occurrence_of(X108,tptp1) | occurrence_of(X108,tptp2)) & next_subocc(X107,X108,tptp0) & leaf_occ(X108,X105))))) # label(sos_35) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 37 -(all X109 (occurrence_of(X109,tptp0) -> (exists X110 exists X111 (leaf_occ(X111,X109) & (occurrence_of(X111,tptp1) -> -(exists X112 (occurrence_of(X112,tptp2) & subactivity_occurrence(X112,X109) & min_precedes(X110,X112,tptp0)))) & (occurrence_of(X111,tptp2) -> -(exists X113 (occurrence_of(X113,tptp1) & subactivity_occurrence(X113,X109) & min_precedes(X110,X113,tptp0)))))))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.75/1.04
% 0.75/1.04 ============================== end of process non-clausal formulas ===
% 0.75/1.04
% 0.75/1.04 ============================== PROCESS INITIAL CLAUSES ===============
% 0.75/1.04
% 0.75/1.04 ============================== PREDICATE ELIMINATION =================
% 0.75/1.04 38 -activity(A) | subactivity(A,A) # label(sos_03) # label(axiom). [clausify(4)].
% 0.75/1.04 39 -occurrence_of(A,B) | activity(B) # label(sos) # label(axiom). [clausify(1)].
% 0.75/1.04 40 -activity_occurrence(A) | activity(f1(A)) # label(sos_01) # label(axiom). [clausify(2)].
% 0.75/1.04 Derived: subactivity(A,A) | -occurrence_of(B,A). [resolve(38,a,39,b)].
% 0.75/1.04 Derived: subactivity(f1(A),f1(A)) | -activity_occurrence(A). [resolve(38,a,40,b)].
% 0.75/1.04 41 activity(tptp0) # label(sos_36) # label(axiom). [assumption].
% 0.75/1.04 Derived: subactivity(tptp0,tptp0). [resolve(41,a,38,a)].
% 0.75/1.04 42 -activity_occurrence(A) | occurrence_of(A,f1(A)) # label(sos_01) # label(axiom). [clausify(2)].
% 0.75/1.04 43 -occurrence_of(A,B) | activity_occurrence(A) # label(sos) # label(axiom). [clausify(1)].
% 0.75/1.04 Derived: occurrence_of(A,f1(A)) | -occurrence_of(A,B). [resolve(42,a,43,b)].
% 0.75/1.04 44 -subactivity_occurrence(A,B) | activity_occurrence(A) # label(sos_24) # label(axiom). [clausify(25)].
% 0.75/1.04 Derived: -subactivity_occurrence(A,B) | occurrence_of(A,f1(A)). [resolve(44,b,42,a)].
% 0.75/1.04 45 -subactivity_occurrence(A,B) | activity_occurrence(B) # label(sos_24) # label(axiom). [clausify(25)].
% 0.75/1.04 Derived: -subactivity_occurrence(A,B) | occurrence_of(B,f1(B)). [resolve(45,b,42,a)].
% 0.75/1.04 46 subactivity(f1(A),f1(A)) | -activity_occurrence(A). [resolve(38,a,40,b)].
% 0.75/1.04 Derived: subactivity(f1(A),f1(A)) | -occurrence_of(A,B). [resolve(46,b,43,b)].
% 0.75/1.04 Derived: subactivity(f1(A),f1(A)) | -subactivity_occurrence(A,B). [resolve(46,b,44,b)].
% 0.75/1.04 Derived: subactivity(f1(A),f1(A)) | -subactivity_occurrence(B,A). [resolve(46,b,45,b)].
% 0.75/1.04 47 precedes(A,B) | -earlier(A,B) | -legal(B) # label(sos_10) # label(axiom). [clausify(11)].
% 0.75/1.04 48 -precedes(A,B) | earlier(A,B) # label(sos_10) # label(axiom). [clausify(11)].
% 0.75/1.04 49 -precedes(A,B) | legal(B) # label(sos_10) # label(axiom). [clausify(11)].
% 0.75/1.04 50 -min_precedes(A,B,C) | precedes(A,B) # label(sos_15) # label(axiom). [clausify(16)].
% 0.75/1.04 Derived: -min_precedes(A,B,C) | earlier(A,B). [resolve(50,b,48,a)].
% 0.75/1.04 Derived: -min_precedes(A,B,C) | legal(B). [resolve(50,b,49,a)].
% 0.75/1.04 51 -min_precedes(A,B,C) | -min_precedes(A,D,C) | -precedes(B,D) | min_precedes(B,D,C) # label(sos_18) # label(axiom). [clausify(19)].
% 0.75/1.04 Derived: -min_precedes(A,B,C) | -min_precedes(A,D,C) | min_precedes(B,D,C) | -earlier(B,D) | -legal(D). [resolve(51,c,47,a)].
% 0.75/1.04 Derived: -min_precedes(A,B,C) | -min_precedes(A,D,C) | min_precedes(B,D,C) | -min_precedes(B,D,E). [resolve(51,c,50,b)].
% 0.75/1.04 52 -min_precedes(A,B,C) | -min_precedes(D,B,C) | -precedes(A,D) | min_precedes(A,D,C) # label(sos_20) # label(axiom). [clausify(21)].
% 0.75/1.04 Derived: -min_precedes(A,B,C) | -min_precedes(D,B,C) | min_precedes(A,D,C) | -earlier(A,D) | -legal(D). [resolve(52,c,47,a)].
% 0.75/1.04 Derived: -min_precedes(A,B,C) | -min_precedes(D,B,C) | min_precedes(A,D,C) | -min_precedes(A,D,E). [resolve(52,c,50,b)].
% 0.75/1.04 53 atocc(A,B) | -subactivity(B,C) | -atomic(C) | -occurrence_of(A,C) # label(sos_23) # label(axiom). [clausify(24)].
% 0.75/1.04 54 -min_precedes(A,B,C) | subactivity(f2(C,A,B),C) # label(sos_11) # label(axiom). [clausify(12)].
% 0.75/1.04 55 -min_precedes(A,B,C) | subactivity(f3(C,A,B),C) # label(sos_11) # label(axiom). [clausify(12)].
% 0.75/1.04 56 -root(A,B) | subactivity(f4(B,A),B) # label(sos_12) # label(axiom). [clausify(13)].
% 0.75/1.04 57 -atocc(A,B) | subactivity(B,f9(A,B)) # label(sos_23) # label(axiom). [clausify(24)].
% 0.75/1.04 Derived: atocc(A,f2(B,C,D)) | -atomic(B) | -occurrence_of(A,B) | -min_precedes(C,D,B). [resolve(53,b,54,b)].
% 0.75/1.04 Derived: atocc(A,f3(B,C,D)) | -atomic(B) | -occurrence_of(A,B) | -min_precedes(C,D,B). [resolve(53,b,55,b)].
% 0.75/1.04 Derived: atocc(A,f4(B,C)) | -atomic(B) | -occurrence_of(A,B) | -root(C,B). [resolve(53,b,56,b)].
% 0.75/1.04 Derived: atocc(A,B) | -atomic(f9(C,B)) | -occurrence_of(A,f9(C,B)) | -atocc(C,B). [resolve(53,b,57,b)].
% 0.75/1.04 58 -occurrence_of(A,B) | -occurrence_of(C,D) | atomic(B) | -subactivity_occurrence(A,C) | subactivity(B,D) # label(sos_30) # label(axiom). [clausify(31)].
% 0.75/1.04 Derived: -occurrence_of(A,B) | -occurrence_of(C,D) | atomic(B) | -subactivity_occurrence(A,C) | atocc(E,B) | -atomic(D) | -occurrence_of(E,D). [resolve(58,e,53,b)].
% 0.75/1.04 59 -occurrence_of(A,B) | -occurrence_of(C,D) | -subactivity(B,D) | subactivity_occurrence(A,C) | subactivity_occurrence(f13(B,D,A,C),C) # label(sos_32) # label(axiom). [clausify(33)].
% 0.75/1.04 Derived: -occurrence_of(A,f2(B,C,D)) | -occurrence_of(E,B) | subactivity_occurrence(A,E) | subactivity_occurrence(f13(f2(B,C,D),B,A,E),E) | -min_precedes(C,D,B). [resolve(59,c,54,b)].
% 0.75/1.04 Derived: -occurrence_of(A,f3(B,C,D)) | -occurrence_of(E,B) | subactivity_occurrence(A,E) | subactivity_occurrence(f13(f3(B,C,D),B,A,E),E) | -min_precedes(C,D,B). [resolve(59,c,55,b)].
% 0.75/1.04 Derived: -occurrence_of(A,f4(B,C)) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | subactivity_occurrence(f13(f4(B,C),B,A,D),D) | -root(C,B). [resolve(59,c,56,b)].
% 0.75/1.04 Derived: -occurrence_of(A,B) | -occurrence_of(C,f9(D,B)) | subactivity_occurrence(A,C) | subactivity_occurrence(f13(B,f9(D,B),A,C),C) | -atocc(D,B). [resolve(59,c,57,b)].
% 0.75/1.04 Derived: -occurrence_of(A,B) | -occurrence_of(C,D) | subactivity_occurrence(A,C) | subactivity_occurrence(f13(B,D,A,C),C) | -occurrence_of(E,B) | -occurrence_of(F,D) | atomic(B) | -subactivity_occurrence(E,F). [resolve(59,c,58,e)].
% 0.75/1.04 60 -occurrence_of(A,B) | -occurrence_of(C,D) | -subactivity(B,D) | subactivity_occurrence(A,C) | -subactivity_occurrence(f13(B,D,A,C),A) # label(sos_32) # label(axiom). [clausify(33)].
% 0.75/1.04 Derived: -occurrence_of(A,f2(B,C,D)) | -occurrence_of(E,B) | subactivity_occurrence(A,E) | -subactivity_occurrence(f13(f2(B,C,D),B,A,E),A) | -min_precedes(C,D,B). [resolve(60,c,54,b)].
% 0.75/1.04 Derived: -occurrence_of(A,f3(B,C,D)) | -occurrence_of(E,B) | subactivity_occurrence(A,E) | -subactivity_occurrence(f13(f3(B,C,D),B,A,E),A) | -min_precedes(C,D,B). [resolve(60,c,55,b)].
% 0.75/1.04 Derived: -occurrence_of(A,f4(B,C)) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | -subactivity_occurrence(f13(f4(B,C),B,A,D),A) | -root(C,B). [resolve(60,c,56,b)].
% 0.75/1.04 Derived: -occurrence_of(A,B) | -occurrence_of(C,f9(D,B)) | subactivity_occurrence(A,C) | -subactivity_occurrence(f13(B,f9(D,B),A,C),A) | -atocc(D,B). [resolve(60,c,57,b)].
% 0.75/1.04 Derived: -occurrence_of(A,B) | -occurrence_of(C,D) | subactivity_occurrence(A,C) | -subactivity_occurrence(f13(B,D,A,C),A) | -occurrence_of(E,B) | -occurrence_of(F,D) | atomic(B) | -subactivity_occurrence(E,F). [resolve(60,c,58,e)].
% 0.75/1.04 61 subactivity(A,A) | -occurrence_of(B,A). [resolve(38,a,39,b)].
% 0.75/1.04 Derived: -occurrence_of(A,B) | atocc(C,B) | -atomic(B) | -occurrence_of(C,B). [resolve(61,a,53,b)].
% 0.75/1.04 Derived: -occurrence_of(A,B) | -occurrence_of(C,B) | -occurrence_of(D,B) | subactivity_occurrence(C,D) | subactivity_occurrence(f13(B,B,C,D),D). [resolve(61,a,59,c)].
% 0.75/1.04 Derived: -occurrence_of(A,B) | -occurrence_of(C,B) | -occurrence_of(D,B) | subactivity_occurrence(C,D) | -subactivity_occurrence(f13(B,B,C,D),C). [resolve(61,a,60,c)].
% 0.75/1.04 62 subactivity(tptp0,tptp0). [resolve(41,a,38,a)].
% 0.75/1.04 63 subactivity(f1(A),f1(A)) | -occurrence_of(A,B). [resolve(46,b,43,b)].
% 0.75/1.05 64 subactivity(f1(A),f1(A)) | -subactivity_occurrence(A,B). [resolve(46,b,44,b)].
% 0.75/1.05 65 subactivity(f1(A),f1(A)) | -subactivity_occurrence(B,A). [resolve(46,b,45,b)].
% 0.75/1.05 66 -min_precedes(A,B,C) | root(f5(A,B,C),C) # label(sos_13) # label(axiom). [clausify(14)].
% 0.75/1.05 67 -root(A,B) | atocc(A,f4(B,A)) # label(sos_12) # label(axiom). [clausify(13)].
% 0.75/1.05 Derived: -min_precedes(A,B,C) | atocc(f5(A,B,C),f4(C,f5(A,B,C))). [resolve(66,b,67,a)].
% 0.75/1.05 68 -min_precedes(A,B,C) | -root(B,C) # label(sos_14) # label(axiom). [clausify(15)].
% 0.75/1.05 Derived: -min_precedes(A,f5(B,C,D),D) | -min_precedes(B,C,D). [resolve(68,b,66,b)].
% 0.75/1.05 69 -root(A,B) | legal(A) # label(sos_16) # label(axiom). [clausify(17)].
% 0.75/1.05 Derived: legal(f5(A,B,C)) | -min_precedes(A,B,C). [resolve(69,a,66,b)].
% 0.75/1.05 70 -atocc(A,B) | -legal(A) | root(A,B) # label(sos_17) # label(axiom). [clausify(18)].
% 0.75/1.05 Derived: -atocc(A,B) | -legal(A) | atocc(A,f4(B,A)). [resolve(70,c,67,a)].
% 0.75/1.05 Derived: -atocc(A,B) | -legal(A) | -min_precedes(C,A,B). [resolve(70,c,68,b)].
% 0.75/1.05 71 -leaf(A,B) | root(A,B) | min_precedes(f6(A,B),A,B) # label(sos_21) # label(axiom). [clausify(22)].
% 0.75/1.05 Derived: -leaf(A,B) | min_precedes(f6(A,B),A,B) | atocc(A,f4(B,A)). [resolve(71,b,67,a)].
% 0.75/1.05 Derived: -leaf(A,B) | min_precedes(f6(A,B),A,B) | -min_precedes(C,A,B). [resolve(71,b,68,b)].
% 0.75/1.05 Derived: -leaf(A,B) | min_precedes(f6(A,B),A,B) | legal(A). [resolve(71,b,69,a)].
% 0.75/1.05 72 leaf(A,B) | -root(A,B) | min_precedes(A,f7(A,B),B) # label(sos_21) # label(axiom). [clausify(22)].
% 0.75/1.05 Derived: leaf(f5(A,B,C),C) | min_precedes(f5(A,B,C),f7(f5(A,B,C),C),C) | -min_precedes(A,B,C). [resolve(72,b,66,b)].
% 0.75/1.05 Derived: leaf(A,B) | min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A). [resolve(72,b,70,c)].
% 0.75/1.05 73 -root(A,B) | atomic(B) | occurrence_of(f11(B,A),B) # label(sos_26) # label(axiom). [clausify(27)].
% 0.75/1.05 Derived: atomic(A) | occurrence_of(f11(A,f5(B,C,A)),A) | -min_precedes(B,C,A). [resolve(73,a,66,b)].
% 0.75/1.05 Derived: atomic(A) | occurrence_of(f11(A,B),A) | -atocc(B,A) | -legal(B). [resolve(73,a,70,c)].
% 0.75/1.05 Derived: atomic(A) | occurrence_of(f11(A,B),A) | -leaf(B,A) | min_precedes(f6(B,A),B,A). [resolve(73,a,71,b)].
% 0.75/1.05 74 -root(A,B) | atomic(B) | subactivity_occurrence(A,f11(B,A)) # label(sos_26) # label(axiom). [clausify(27)].
% 0.75/1.05 Derived: atomic(A) | subactivity_occurrence(f5(B,C,A),f11(A,f5(B,C,A))) | -min_precedes(B,C,A). [resolve(74,a,66,b)].
% 0.75/1.05 Derived: atomic(A) | subactivity_occurrence(B,f11(A,B)) | -atocc(B,A) | -legal(B). [resolve(74,a,70,c)].
% 0.75/1.05 Derived: atomic(A) | subactivity_occurrence(B,f11(A,B)) | -leaf(B,A) | min_precedes(f6(B,A),B,A). [resolve(74,a,71,b)].
% 0.75/1.05 75 -occurrence_of(A,B) | atomic(B) | root(f12(B,A),B) # label(sos_27) # label(axiom). [clausify(28)].
% 0.75/1.05 Derived: -occurrence_of(A,B) | atomic(B) | atocc(f12(B,A),f4(B,f12(B,A))). [resolve(75,c,67,a)].
% 0.75/1.05 Derived: -occurrence_of(A,B) | atomic(B) | -min_precedes(C,f12(B,A),B). [resolve(75,c,68,b)].
% 0.75/1.05 Derived: -occurrence_of(A,B) | atomic(B) | legal(f12(B,A)). [resolve(75,c,69,a)].
% 0.75/1.05 Derived: -occurrence_of(A,B) | atomic(B) | leaf(f12(B,A),B) | min_precedes(f12(B,A),f7(f12(B,A),B),B). [resolve(75,c,72,b)].
% 0.75/1.05 Derived: -occurrence_of(A,B) | atomic(B) | atomic(B) | occurrence_of(f11(B,f12(B,A)),B). [resolve(75,c,73,a)].
% 0.75/1.05 Derived: -occurrence_of(A,B) | atomic(B) | atomic(B) | subactivity_occurrence(f12(B,A),f11(B,f12(B,A))). [resolve(75,c,74,a)].
% 0.75/1.05 76 -root_occ(A,B) | root(A,f14(A,B)) # label(sos_33) # label(axiom). [clausify(34)].
% 0.75/1.05 Derived: -root_occ(A,B) | atocc(A,f4(f14(A,B),A)). [resolve(76,b,67,a)].
% 0.75/1.05 Derived: -root_occ(A,B) | -min_precedes(C,A,f14(A,B)). [resolve(76,b,68,b)].
% 0.75/1.05 Derived: -root_occ(A,B) | legal(A). [resolve(76,b,69,a)].
% 0.75/1.05 Derived: -root_occ(A,B) | leaf(A,f14(A,B)) | min_precedes(A,f7(A,f14(A,B)),f14(A,B)). [resolve(76,b,72,b)].
% 0.75/1.05 Derived: -root_occ(A,B) | atomic(f14(A,B)) | occurrence_of(f11(f14(A,B),A),f14(A,B)). [resolve(76,b,73,a)].
% 0.75/1.05 Derived: -root_occ(A,B) | atomic(f14(A,B)) | subactivity_occurrence(A,f11(f14(A,B),A)). [resolve(76,b,74,a)].
% 0.75/1.05 77 root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -root(A,C) # label(sos_33) # label(axiom). [clausify(34)].
% 0.75/1.05 Derived: root_occ(f5(A,B,C),D) | -occurrence_of(D,C) | -subactivity_occurrence(f5(A,B,C),D) | -min_precedes(A,B,C). [resolve(77,d,66,b)].
% 0.75/1.05 Derived: root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -atocc(A,C) | -legal(A). [resolve(77,d,70,c)].
% 0.75/1.05 Derived: root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -leaf(A,C) | min_precedes(f6(A,C),A,C). [resolve(77,d,71,b)].
% 0.75/1.05 Derived: root_occ(f12(A,B),C) | -occurrence_of(C,A) | -subactivity_occurrence(f12(A,B),C) | -occurrence_of(B,A) | atomic(A). [resolve(77,d,75,c)].
% 0.75/1.05 Derived: root_occ(A,B) | -occurrence_of(B,f14(A,C)) | -subactivity_occurrence(A,B) | -root_occ(A,C). [resolve(77,d,76,b)].
% 0.75/1.05 78 atocc(A,f4(B,C)) | -atomic(B) | -occurrence_of(A,B) | -root(C,B). [resolve(53,b,56,b)].
% 0.75/1.05 Derived: atocc(A,f4(B,f5(C,D,B))) | -atomic(B) | -occurrence_of(A,B) | -min_precedes(C,D,B). [resolve(78,d,66,b)].
% 0.75/1.05 Derived: atocc(A,f4(B,C)) | -atomic(B) | -occurrence_of(A,B) | -atocc(C,B) | -legal(C). [resolve(78,d,70,c)].
% 0.75/1.05 Derived: atocc(A,f4(B,C)) | -atomic(B) | -occurrence_of(A,B) | -leaf(C,B) | min_precedes(f6(C,B),C,B). [resolve(78,d,71,b)].
% 0.75/1.05 Derived: atocc(A,f4(f14(B,C),B)) | -atomic(f14(B,C)) | -occurrence_of(A,f14(B,C)) | -root_occ(B,C). [resolve(78,d,76,b)].
% 0.75/1.05 79 -occurrence_of(A,f4(B,C)) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | subactivity_occurrence(f13(f4(B,C),B,A,D),D) | -root(C,B). [resolve(59,c,56,b)].
% 0.75/1.05 Derived: -occurrence_of(A,f4(B,f5(C,D,B))) | -occurrence_of(E,B) | subactivity_occurrence(A,E) | subactivity_occurrence(f13(f4(B,f5(C,D,B)),B,A,E),E) | -min_precedes(C,D,B). [resolve(79,e,66,b)].
% 0.75/1.05 Derived: -occurrence_of(A,f4(B,C)) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | subactivity_occurrence(f13(f4(B,C),B,A,D),D) | -atocc(C,B) | -legal(C). [resolve(79,e,70,c)].
% 0.75/1.05 Derived: -occurrence_of(A,f4(B,C)) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | subactivity_occurrence(f13(f4(B,C),B,A,D),D) | -leaf(C,B) | min_precedes(f6(C,B),C,B). [resolve(79,e,71,b)].
% 0.75/1.05 Derived: -occurrence_of(A,f4(B,f12(B,C))) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | subactivity_occurrence(f13(f4(B,f12(B,C)),B,A,D),D) | -occurrence_of(C,B) | atomic(B). [resolve(79,e,75,c)].
% 0.75/1.05 Derived: -occurrence_of(A,f4(f14(B,C),B)) | -occurrence_of(D,f14(B,C)) | subactivity_occurrence(A,D) | subactivity_occurrence(f13(f4(f14(B,C),B),f14(B,C),A,D),D) | -root_occ(B,C). [resolve(79,e,76,b)].
% 0.75/1.05 80 -occurrence_of(A,f4(B,C)) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | -subactivity_occurrence(f13(f4(B,C),B,A,D),A) | -root(C,B). [resolve(60,c,56,b)].
% 0.75/1.05 Derived: -occurrence_of(A,f4(B,f5(C,D,B))) | -occurrence_of(E,B) | subactivity_occurrence(A,E) | -subactivity_occurrence(f13(f4(B,f5(C,D,B)),B,A,E),A) | -min_precedes(C,D,B). [resolve(80,e,66,b)].
% 0.75/1.05 Derived: -occurrence_of(A,f4(B,C)) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | -subactivity_occurrence(f13(f4(B,C),B,A,D),A) | -atocc(C,B) | -legal(C). [resolve(80,e,70,c)].
% 0.75/1.05 Derived: -occurrence_of(A,f4(B,C)) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | -subactivity_occurrence(f13(f4(B,C),B,A,D),A) | -leaf(C,B) | min_precedes(f6(C,B),C,B). [resolve(80,e,71,b)].
% 0.75/1.05 Derived: -occurrence_of(A,f4(B,f12(B,C))) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | -subactivity_occurrence(f13(f4(B,f12(B,C)),B,A,D),A) | -occurrence_of(C,B) | atomic(B). [resolve(80,e,75,c)].
% 0.75/1.05 Derived: -occurrence_of(A,f4(f14(B,C),B)) | -occurrence_of(D,f14(B,C)) | subactivity_occurrence(A,D) | -subactivity_occurrence(f13(f4(f14(B,C),B),f14(B,C),A,D),A) | -root_occ(B,C). [resolve(80,e,76,b)].
% 0.75/1.05 81 leaf(A,B) | -min_precedes(C,A,B) | min_precedes(A,f7(A,B),B) # label(sos_21) # label(axiom). [clausify(22)].
% 0.75/1.05 82 -leaf(A,B) | -min_precedes(A,C,B) # label(sos_21) # label(axiom). [clausify(22)].
% 0.75/1.05 Derived: -min_precedes(A,B,C) | min_precedes(B,f7(B,C),C) | -min_precedes(B,D,C). [resolve(81,a,82,a)].
% 0.75/1.05 83 -leaf_occ(A,B) | leaf(A,f15(A,B)) # label(sos_34) # label(axiom). [clausify(35)].
% 0.75/1.05 Derived: -leaf_occ(A,B) | -min_precedes(A,C,f15(A,B)). [resolve(83,b,82,a)].
% 0.75/1.05 84 leaf_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -leaf(A,C) # label(sos_34) # label(axiom). [clausify(35)].
% 0.75/1.05 Derived: leaf_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -min_precedes(D,A,C) | min_precedes(A,f7(A,C),C). [resolve(84,d,81,a)].
% 0.75/1.05 Derived: leaf_occ(A,B) | -occurrence_of(B,f15(A,C)) | -subactivity_occurrence(A,B) | -leaf_occ(A,C). [resolve(84,d,83,b)].
% 0.75/1.05 85 -leaf(A,B) | min_precedes(f6(A,B),A,B) | atocc(A,f4(B,A)). [resolve(71,b,67,a)].
% 0.75/1.05 Derived: min_precedes(f6(A,B),A,B) | atocc(A,f4(B,A)) | -min_precedes(C,A,B) | min_precedes(A,f7(A,B),B). [resolve(85,a,81,a)].
% 0.75/1.05 Derived: min_precedes(f6(A,f15(A,B)),A,f15(A,B)) | atocc(A,f4(f15(A,B),A)) | -leaf_occ(A,B). [resolve(85,a,83,b)].
% 0.75/1.05 86 -leaf(A,B) | min_precedes(f6(A,B),A,B) | -min_precedes(C,A,B). [resolve(71,b,68,b)].
% 0.75/1.05 Derived: min_precedes(f6(A,B),A,B) | -min_precedes(C,A,B) | -min_precedes(D,A,B) | min_precedes(A,f7(A,B),B). [resolve(86,a,81,a)].
% 0.75/1.05 Derived: min_precedes(f6(A,f15(A,B)),A,f15(A,B)) | -min_precedes(C,A,f15(A,B)) | -leaf_occ(A,B). [resolve(86,a,83,b)].
% 0.75/1.05 87 -leaf(A,B) | min_precedes(f6(A,B),A,B) | legal(A). [resolve(71,b,69,a)].
% 0.75/1.05 Derived: min_precedes(f6(A,f15(A,B)),A,f15(A,B)) | legal(A) | -leaf_occ(A,B). [resolve(87,a,83,b)].
% 0.75/1.05 88 leaf(f5(A,B,C),C) | min_precedes(f5(A,B,C),f7(f5(A,B,C),C),C) | -min_precedes(A,B,C). [resolve(72,b,66,b)].
% 0.75/1.05 Derived: min_precedes(f5(A,B,C),f7(f5(A,B,C),C),C) | -min_precedes(A,B,C) | -min_precedes(f5(A,B,C),D,C). [resolve(88,a,82,a)].
% 0.75/1.05 Derived: min_precedes(f5(A,B,C),f7(f5(A,B,C),C),C) | -min_precedes(A,B,C) | leaf_occ(f5(A,B,C),D) | -occurrence_of(D,C) | -subactivity_occurrence(f5(A,B,C),D). [resolve(88,a,84,d)].
% 0.75/1.05 Derived: min_precedes(f5(A,B,C),f7(f5(A,B,C),C),C) | -min_precedes(A,B,C) | min_precedes(f6(f5(A,B,C),C),f5(A,B,C),C) | atocc(f5(A,B,C),f4(C,f5(A,B,C))). [resolve(88,a,85,a)].
% 0.75/1.05 Derived: min_precedes(f5(A,B,C),f7(f5(A,B,C),C),C) | -min_precedes(A,B,C) | min_precedes(f6(f5(A,B,C),C),f5(A,B,C),C) | legal(f5(A,B,C)). [resolve(88,a,87,a)].
% 0.75/1.05 89 leaf(A,B) | min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A). [resolve(72,b,70,c)].
% 0.75/1.05 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A) | -min_precedes(A,C,B). [resolve(89,a,82,a)].
% 0.75/1.05 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A) | leaf_occ(A,C) | -occurrence_of(C,B) | -subactivity_occurrence(A,C). [resolve(89,a,84,d)].
% 0.75/1.05 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A) | min_precedes(f6(A,B),A,B) | atocc(A,f4(B,A)). [resolve(89,a,85,a)].
% 0.75/1.05 90 atomic(A) | occurrence_of(f11(A,B),A) | -leaf(B,A) | min_precedes(f6(B,A),B,A). [resolve(73,a,71,b)].
% 0.75/1.05 Derived: atomic(f15(A,B)) | occurrence_of(f11(f15(A,B),A),f15(A,B)) | min_precedes(f6(A,f15(A,B)),A,f15(A,B)) | -leaf_occ(A,B). [resolve(90,c,83,b)].
% 0.75/1.05 Derived: atomic(A) | occurrence_of(f11(A,f5(B,C,A)),A) | min_precedes(f6(f5(B,C,A),A),f5(B,C,A),A) | min_precedes(f5(B,C,A),f7(f5(B,C,A),A),A) | -min_precedes(B,C,A). [resolve(90,c,88,a)].
% 0.75/1.05 Derived: atomic(A) | occurrence_of(f11(A,B),A) | min_precedes(f6(B,A),B,A) | min_precedes(B,f7(B,A),A) | -atocc(B,A) | -legal(B). [resolve(90,c,89,a)].
% 0.75/1.05 91 atomic(A) | subactivity_occurrence(B,f11(A,B)) | -leaf(B,A) | min_precedes(f6(B,A),B,A). [resolve(74,a,71,b)].
% 0.75/1.05 Derived: atomic(f15(A,B)) | subactivity_occurrence(A,f11(f15(A,B),A)) | min_precedes(f6(A,f15(A,B)),A,f15(A,B)) | -leaf_occ(A,B). [resolve(91,c,83,b)].
% 0.75/1.05 Derived: atomic(A) | subactivity_occurrence(f5(B,C,A),f11(A,f5(B,C,A))) | min_precedes(f6(f5(B,C,A),A),f5(B,C,A),A) | min_precedes(f5(B,C,A),f7(f5(B,C,A),A),A) | -min_precedes(B,C,A). [resolve(91,c,88,a)].
% 0.75/1.05 Derived: atomic(A) | subactivity_occurrence(B,f11(A,B)) | min_precedes(f6(B,A),B,A) | min_precedes(B,f7(B,A),A) | -atocc(B,A) | -legal(B). [resolve(91,c,89,a)].
% 0.75/1.05 92 -occurrence_of(A,B) | atomic(B) | leaf(f12(B,A),B) | min_precedes(f12(B,A),f7(f12(B,A),B),B). [resolve(75,c,72,b)].
% 0.75/1.05 Derived: -occurrence_of(A,B) | atomic(B) | min_precedes(f12(B,A),f7(f12(B,A),B),B) | -min_precedes(f12(B,A),C,B). [resolve(92,c,82,a)].
% 0.75/1.05 Derived: -occurrence_of(A,B) | atomic(B) | min_precedes(f12(B,A),f7(f12(B,A),B),B) | leaf_occ(f12(B,A),C) | -occurrence_of(C,B) | -subactivity_occurrence(f12(B,A),C). [resolve(92,c,84,d)].
% 0.75/1.05 Derived: -occurrence_of(A,B) | atomic(B) | min_precedes(f12(B,A),f7(f12(B,A),B),B) | min_precedes(f6(f12(B,A),B),f12(B,A),B) | atocc(f12(B,A),f4(B,f12(B,A))). [resolve(92,c,85,a)].
% 0.75/1.05 Derived: -occurrence_of(A,B) | atomic(B) | min_precedes(f12(B,A),f7(f12(B,A),B),B) | min_precedes(f6(f12(B,A),B),f12(B,A),B) | legal(f12(B,A)). [resolve(92,c,87,a)].
% 0.75/1.05 93 -root_occ(A,B) | leaf(A,f14(A,B)) | min_precedes(A,f7(A,f14(A,B)),f14(A,B)). [resolve(76,b,72,b)].
% 0.75/1.05 Derived: -root_occ(A,B) | min_precedes(A,f7(A,f14(A,B)),f14(A,B)) | -min_precedes(A,C,f14(A,B)). [resolve(93,b,82,a)].
% 0.75/1.05 Derived: -root_occ(A,B) | min_precedes(A,f7(A,f14(A,B)),f14(A,B)) | leaf_occ(A,C) | -occurrence_of(C,f14(A,B)) | -subactivity_occurrence(A,C). [resolve(93,b,84,d)].
% 0.75/1.05 Derived: -root_occ(A,B) | min_precedes(A,f7(A,f14(A,B)),f14(A,B)) | min_precedes(f6(A,f14(A,B)),A,f14(A,B)) | atocc(A,f4(f14(A,B),A)). [resolve(93,b,85,a)].
% 0.75/1.05 Derived: -root_occ(A,B) | min_precedes(A,f7(A,f14(A,B)),f14(A,B)) | min_precedes(f6(A,f14(A,B)),A,f14(A,B)) | legal(A). [resolve(93,b,87,a)].
% 0.75/1.05 94 root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -leaf(A,C) | min_precedes(f6(A,C),A,C). [resolve(77,d,71,b)].
% 0.75/1.05 Derived: root_occ(A,B) | -occurrence_of(B,f15(A,C)) | -subactivity_occurrence(A,B) | min_precedes(f6(A,f15(A,C)),A,f15(A,C)) | -leaf_occ(A,C). [resolve(94,d,83,b)].
% 0.75/1.05 Derived: root_occ(f5(A,B,C),D) | -occurrence_of(D,C) | -subactivity_occurrence(f5(A,B,C),D) | min_precedes(f6(f5(A,B,C),C),f5(A,B,C),C) | min_precedes(f5(A,B,C),f7(f5(A,B,C),C),C) | -min_precedes(A,B,C). [resolve(94,d,88,a)].
% 0.75/1.05 Derived: root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | min_precedes(f6(A,C),A,C) | min_precedes(A,f7(A,C),C) | -atocc(A,C) | -legal(A). [resolve(94,d,89,a)].
% 0.75/1.05 95 atocc(A,f4(B,C)) | -atomic(B) | -occurrence_of(A,B) | -leaf(C,B) | min_precedes(f6(C,B),C,B). [resolve(78,d,71,b)].
% 0.75/1.05 Derived: atocc(A,f4(f15(B,C),B)) | -atomic(f15(B,C)) | -occurrence_of(A,f15(B,C)) | min_precedes(f6(B,f15(B,C)),B,f15(B,C)) | -leaf_occ(B,C). [resolve(95,d,83,b)].
% 0.75/1.05 Derived: atocc(A,f4(B,f5(C,D,B))) | -atomic(B) | -occurrence_of(A,B) | min_precedes(f6(f5(C,D,B),B),f5(C,D,B),B) | min_precedes(f5(C,D,B),f7(f5(C,D,B),B),B) | -min_precedes(C,D,B). [resolve(95,d,88,a)].
% 0.75/1.05 Derived: atocc(A,f4(B,C)) | -atomic(B) | -occurrence_of(A,B) | min_precedes(f6(C,B),C,B) | min_precedes(C,f7(C,B),B) | -atocc(C,B) | -legal(C). [resolve(95,d,89,a)].
% 0.75/1.05 96 -occurrence_of(A,f4(B,C)) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | subactivity_occurrence(f13(f4(B,C),B,A,D),D) | -leaf(C,B) | min_precedes(f6(C,B),C,B). [resolve(79,e,71,b)].
% 0.75/1.05 Derived: -occurrence_of(A,f4(f15(B,C),B)) | -occurrence_of(D,f15(B,C)) | subactivity_occurrence(A,D) | subactivity_occurrence(f13(f4(f15(B,C),B),f15(B,C),A,D),D) | min_precedes(f6(B,f15(B,C)),B,f15(B,C)) | -leaf_occ(B,C). [resolve(96,e,83,b)].
% 0.75/1.05 Derived: -occurrence_of(A,f4(B,f5(C,D,B))) | -occurrence_of(E,B) | subactivity_occurrence(A,E) | subactivity_occurrence(f13(f4(B,f5(C,D,B)),B,A,E),E) | min_precedes(f6(f5(C,D,B),B),f5(C,D,B),B) | min_precedes(f5(C,D,B),f7(f5(C,D,B),B),B) | -min_precedes(C,D,B). [resolve(96,e,88,a)].
% 0.75/1.05 Derived: -occurrence_of(A,f4(B,C)) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | subactivity_occurrence(f13(f4(B,C),B,A,D),D) | min_precedes(f6(C,B),C,B) | min_precedes(C,f7(C,B),B) | -atocc(C,B) | -legal(C). [resolve(96,e,89,a)].
% 0.75/1.05 97 -occurrence_of(A,f4(B,C)) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | -subactivity_occurrence(f13(f4(B,C),B,A,D),A) | -leaf(C,B) | min_precedes(f6(C,B),C,B). [resolve(80,e,71,b)].
% 0.75/1.05 Derived: -occurrence_of(A,f4(f15(B,C),B)) | -occurrence_of(D,f15(B,C)) | subactivity_occurrence(A,D) | -subactivity_occurrence(f13(f4(f15(B,C),B),f15(B,C),A,D),A) | min_precedes(f6(B,f15(B,C)),B,f15(B,C)) | -leaf_occ(B,C). [resolve(97,e,83,b)].
% 0.75/1.05 Derived: -occurrence_of(A,f4(B,f5(C,D,B))) | -occurrence_of(E,B) | subactivity_occurrence(A,E) | -subactivity_occurrence(f13(f4(B,f5(C,D,B)),B,A,E),A) | min_precedes(f6(f5(C,D,B),B),f5(C,D,B),B) | min_precedes(f5(C,D,B),f7(f5(C,D,B),B),B) | -min_precedes(C,D,B). [resolve(97,e,88,a)].
% 0.79/1.13 Derived: -occurrence_of(A,f4(B,C)) | -occurrence_of(D,B) | subactivity_occurrence(A,D) | -subactivity_occurrence(f13(f4(B,C),B,A,D),A) | min_precedes(f6(C,B),C,B) | min_precedes(C,f7(C,B),B) | -atocc(C,B) | -legal(C). [resolve(97,e,89,a)].
% 0.79/1.13 98 next_subocc(A,B,C) | -min_precedes(A,B,C) | min_precedes(A,f8(A,B,C),C) # label(sos_22) # label(axiom). [clausify(23)].
% 0.79/1.13 99 -next_subocc(A,B,C) | min_precedes(A,B,C) # label(sos_22) # label(axiom). [clausify(23)].
% 0.79/1.13 100 -next_subocc(A,B,C) | -min_precedes(A,D,C) | -min_precedes(D,B,C) # label(sos_22) # label(axiom). [clausify(23)].
% 0.79/1.13 Derived: -min_precedes(A,B,C) | min_precedes(A,f8(A,B,C),C) | -min_precedes(A,D,C) | -min_precedes(D,B,C). [resolve(98,a,100,a)].
% 0.79/1.13 101 next_subocc(A,B,C) | -min_precedes(A,B,C) | min_precedes(f8(A,B,C),B,C) # label(sos_22) # label(axiom). [clausify(23)].
% 0.79/1.13 Derived: -min_precedes(A,B,C) | min_precedes(f8(A,B,C),B,C) | -min_precedes(A,D,C) | -min_precedes(D,B,C). [resolve(101,a,100,a)].
% 0.79/1.13 102 -occurrence_of(A,tptp0) | next_subocc(f16(A),f17(A),tptp0) # label(sos_35) # label(axiom). [clausify(36)].
% 0.79/1.13 Derived: -occurrence_of(A,tptp0) | min_precedes(f16(A),f17(A),tptp0). [resolve(102,b,99,a)].
% 0.79/1.13 Derived: -occurrence_of(A,tptp0) | -min_precedes(f16(A),B,tptp0) | -min_precedes(B,f17(A),tptp0). [resolve(102,b,100,a)].
% 0.79/1.13 103 -occurrence_of(A,tptp0) | next_subocc(f17(A),f18(A),tptp0) # label(sos_35) # label(axiom). [clausify(36)].
% 0.79/1.13 Derived: -occurrence_of(A,tptp0) | min_precedes(f17(A),f18(A),tptp0). [resolve(103,b,99,a)].
% 0.79/1.13 Derived: -occurrence_of(A,tptp0) | -min_precedes(f17(A),B,tptp0) | -min_precedes(B,f18(A),tptp0). [resolve(103,b,100,a)].
% 0.79/1.13
% 0.79/1.13 ============================== end predicate elimination =============
% 0.79/1.13
% 0.79/1.13 Auto_denials: (non-Horn, no changes).
% 0.79/1.13
% 0.79/1.13 Term ordering decisions:
% 0.79/1.13 Function symbol KB weights: tptp0=1. tptp1=1. tptp2=1. tptp3=1. tptp4=1. c1=1. f4=1. f6=1. f7=1. f9=1. f11=1. f12=1. f14=1. f15=1. f19=1. f20=1. f1=1. f16=1. f17=1. f18=1. f2=1. f3=1. f5=1. f8=1. f10=1. f13=1.
% 0.79/1.13
% 0.79/1.13 ============================== end of process initial clauses ========
% 0.79/1.13
% 0.79/1.13 ============================== CLAUSES FOR SEARCH ====================
% 0.79/1.13
% 0.79/1.13 ============================== end of clauses for search =============
% 0.79/1.13
% 0.79/1.13 ============================== SEARCH ================================
% 0.79/1.13
% 0.79/1.13 % Starting search at 0.05 seconds.
% 0.79/1.13
% 0.79/1.13 ============================== PROOF =================================
% 0.79/1.13 % SZS status Theorem
% 0.79/1.13 % SZS output start Refutation
% 0.79/1.13
% 0.79/1.13 % Proof 1 at 0.11 (+ 0.01) seconds.
% 0.79/1.13 % Length of proof is 20.
% 0.79/1.13 % Level of proof is 6.
% 0.79/1.13 % Maximum clause weight is 15.000.
% 0.79/1.13 % Given clauses 237.
% 0.79/1.13
% 0.79/1.13 3 (all X4 all X5 all X6 (occurrence_of(X4,X5) & occurrence_of(X4,X6) -> X5 = X6)) # label(sos_02) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.13 22 (all X56 all X57 (leaf(X56,X57) <-> (root(X56,X57) | (exists X58 min_precedes(X58,X56,X57))) & -(exists X59 min_precedes(X56,X59,X57)))) # label(sos_21) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.13 35 (all X102 all X103 (leaf_occ(X102,X103) <-> (exists X104 (occurrence_of(X103,X104) & subactivity_occurrence(X102,X103) & leaf(X102,X104))))) # label(sos_34) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.13 36 (all X105 (occurrence_of(X105,tptp0) -> (exists X106 exists X107 exists X108 (occurrence_of(X106,tptp3) & root_occ(X106,X105) & occurrence_of(X107,tptp4) & next_subocc(X106,X107,tptp0) & (occurrence_of(X108,tptp1) | occurrence_of(X108,tptp2)) & next_subocc(X107,X108,tptp0) & leaf_occ(X108,X105))))) # label(sos_35) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.13 37 -(all X109 (occurrence_of(X109,tptp0) -> (exists X110 exists X111 (leaf_occ(X111,X109) & (occurrence_of(X111,tptp1) -> -(exists X112 (occurrence_of(X112,tptp2) & subactivity_occurrence(X112,X109) & min_precedes(X110,X112,tptp0)))) & (occurrence_of(X111,tptp2) -> -(exists X113 (occurrence_of(X113,tptp1) & subactivity_occurrence(X113,X109) & min_precedes(X110,X113,tptp0)))))))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.79/1.13 82 -leaf(A,B) | -min_precedes(A,C,B) # label(sos_21) # label(axiom). [clausify(22)].
% 0.79/1.13 83 -leaf_occ(A,B) | leaf(A,f15(A,B)) # label(sos_34) # label(axiom). [clausify(35)].
% 0.79/1.13 104 -occurrence_of(A,B) | -occurrence_of(A,C) | C = B # label(sos_02) # label(axiom). [clausify(3)].
% 0.79/1.13 127 -leaf_occ(A,B) | occurrence_of(B,f15(A,B)) # label(sos_34) # label(axiom). [clausify(35)].
% 0.79/1.13 133 -occurrence_of(A,tptp0) | leaf_occ(f18(A),A) # label(sos_35) # label(axiom). [clausify(36)].
% 0.79/1.13 146 occurrence_of(c1,tptp0) # label(goals) # label(negated_conjecture). [clausify(37)].
% 0.79/1.13 162 -leaf_occ(A,c1) | min_precedes(B,f19(B,A),tptp0) | min_precedes(B,f20(B,A),tptp0) # label(goals) # label(negated_conjecture). [clausify(37)].
% 0.79/1.13 221 -leaf_occ(A,B) | -min_precedes(A,C,f15(A,B)). [resolve(83,b,82,a)].
% 0.79/1.13 276 leaf_occ(f18(c1),c1). [resolve(146,a,133,a)].
% 0.79/1.13 283 -occurrence_of(c1,A) | tptp0 = A. [resolve(146,a,104,b)].
% 0.79/1.13 304 min_precedes(A,f19(A,f18(c1)),tptp0) | min_precedes(A,f20(A,f18(c1)),tptp0). [resolve(276,a,162,a)].
% 0.79/1.13 320 occurrence_of(c1,f15(f18(c1),c1)). [resolve(276,a,127,a)].
% 0.79/1.13 609 f15(f18(c1),c1) = tptp0. [resolve(320,a,283,a),flip(a)].
% 0.79/1.13 665 -min_precedes(f18(c1),A,tptp0). [para(609(a,1),221(b,3)),unit_del(a,276)].
% 0.79/1.13 746 $F. [resolve(304,b,665,a),unit_del(a,665)].
% 0.79/1.13
% 0.79/1.13 % SZS output end Refutation
% 0.79/1.13 ============================== end of proof ==========================
% 0.79/1.13
% 0.79/1.13 ============================== STATISTICS ============================
% 0.79/1.13
% 0.79/1.13 Given=237. Generated=1036. Kept=639. proofs=1.
% 0.79/1.13 Usable=226. Sos=259. Demods=5. Limbo=3, Disabled=381. Hints=0.
% 0.79/1.13 Megabytes=1.10.
% 0.79/1.13 User_CPU=0.11, System_CPU=0.01, Wall_clock=0.
% 0.79/1.13
% 0.79/1.13 ============================== end of statistics =====================
% 0.79/1.13
% 0.79/1.13 ============================== end of search =========================
% 0.79/1.13
% 0.79/1.13 THEOREM PROVED
% 0.79/1.13 % SZS status Theorem
% 0.79/1.13
% 0.79/1.13 Exiting with 1 proof.
% 0.79/1.13
% 0.79/1.13 Process 25330 exit (max_proofs) Mon Jun 13 01:03:49 2022
% 0.79/1.14 Prover9 interrupted
%------------------------------------------------------------------------------