TSTP Solution File: PRO005+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PRO005+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n027.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:05 EDT 2022
% Result : Timeout 300.03s 300.28s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : PRO005+1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.36 % Computer : n027.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Mon Jun 13 04:00:46 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.48/1.01 ============================== Prover9 ===============================
% 0.48/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.48/1.01 Process 15294 was started by sandbox2 on n027.cluster.edu,
% 0.48/1.01 Mon Jun 13 04:00:47 2022
% 0.48/1.01 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_15140_n027.cluster.edu".
% 0.48/1.01 ============================== end of head ===========================
% 0.48/1.01
% 0.48/1.01 ============================== INPUT =================================
% 0.48/1.01
% 0.48/1.01 % Reading from file /tmp/Prover9_15140_n027.cluster.edu
% 0.48/1.01
% 0.48/1.01 set(prolog_style_variables).
% 0.48/1.01 set(auto2).
% 0.48/1.01 % set(auto2) -> set(auto).
% 0.48/1.01 % set(auto) -> set(auto_inference).
% 0.48/1.01 % set(auto) -> set(auto_setup).
% 0.48/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.48/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.48/1.01 % set(auto) -> set(auto_limits).
% 0.48/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.48/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.48/1.01 % set(auto) -> set(auto_denials).
% 0.48/1.01 % set(auto) -> set(auto_process).
% 0.48/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.48/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.48/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.48/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.48/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.48/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.48/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.48/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.48/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.48/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.48/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.48/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.48/1.01 % set(auto2) -> assign(stats, some).
% 0.48/1.01 % set(auto2) -> clear(echo_input).
% 0.48/1.01 % set(auto2) -> set(quiet).
% 0.48/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.48/1.01 % set(auto2) -> clear(print_given).
% 0.48/1.01 assign(lrs_ticks,-1).
% 0.48/1.01 assign(sos_limit,10000).
% 0.48/1.01 assign(order,kbo).
% 0.48/1.01 set(lex_order_vars).
% 0.48/1.01 clear(print_given).
% 0.48/1.01
% 0.48/1.01 % formulas(sos). % not echoed (51 formulas)
% 0.48/1.01
% 0.48/1.01 ============================== end of input ==========================
% 0.48/1.01
% 0.48/1.01 % From the command line: assign(max_seconds, 300).
% 0.48/1.01
% 0.48/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.48/1.01
% 0.48/1.01 % Formulas that are not ordinary clauses:
% 0.48/1.01 1 (all X0 all X1 (occurrence_of(X1,X0) -> activity(X0) & activity_occurrence(X1))) # label(sos) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.01 2 (all X2 (activity_occurrence(X2) -> (exists X3 (activity(X3) & occurrence_of(X2,X3))))) # label(sos_01) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.01 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.48/1.01 4 (all X7 (activity(X7) -> subactivity(X7,X7))) # label(sos_03) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.01 5 (all X8 all X9 (earlier(X8,X9) -> -earlier(X9,X8))) # label(sos_04) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.01 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.48/1.01 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.48/1.01 8 (all X16 all X17 (occurrence_of(X16,X17) -> (arboreal(X16) <-> atomic(X17)))) # label(sos_07) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.01 9 (all X18 (legal(X18) -> arboreal(X18))) # label(sos_08) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.01 10 (all X19 all X20 (legal(X19) & earlier(X20,X19) -> legal(X20))) # label(sos_09) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.01 11 (all X21 all X22 (precedes(X21,X22) <-> earlier(X21,X22) & legal(X22))) # label(sos_10) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.01 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.48/1.01 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.48/1.01 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.48/1.01 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.48/1.01 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.48/1.01 17 (all X41 all X42 (root(X41,X42) -> legal(X41))) # label(sos_16) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.01 18 (all X43 all X44 (atocc(X43,X44) & legal(X43) -> root(X43,X44))) # label(sos_17) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.01 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.48/1.01 20 (all X49 all X50 all X51 (min_precedes(X49,X50,X51) -> -atomic(X51))) # label(sos_19) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.01 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.48/1.01 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.48/1.01 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.48/1.01 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.48/1.01 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.48/1.01 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.48/1.01 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.48/1.01 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.48/1.01 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.48/1.01 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.48/1.01 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.48/1.01 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.48/1.01 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.48/1.01 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.48/1.01 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.48/1.01 36 (all X105 (occurrence_of(X105,tptp0) -> (exists X106 exists X107 (occurrence_of(X106,tptp4) & root_occ(X106,X105) & (occurrence_of(X107,tptp3) | occurrence_of(X107,tptp2)) & leaf_occ(X107,X105) & next_subocc(X106,X107,tptp0))))) # label(sos_35) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.01 37 (all X108 all X109 (occurrence_of(X109,tptp0) & subactivity_occurrence(X108,X109) & arboreal(X108) & -leaf_occ(X108,X109) -> root_occ(X108,X109))) # label(sos_48) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.01 38 (all X110 all X111 (occurrence_of(X111,tptp0) & subactivity_occurrence(X110,X111) & arboreal(X110) & -leaf_occ(X110,X111) -> (exists X112 (occurrence_of(X112,tptp1) & next_subocc(X110,X112,tptp0))))) # label(sos_49) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.01 39 --(exists X113 occurrence_of(X113,tptp0)) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.48/1.01
% 0.48/1.01 ============================== end of process non-clausal formulas ===
% 0.48/1.01
% 0.48/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.48/1.01
% 0.48/1.01 ============================== PREDICATE ELIMINATION =================
% 0.48/1.01 40 -activity(A) | subactivity(A,A) # label(sos_03) # label(axiom). [clausify(4)].
% 0.48/1.01 41 activity(tptp0) # label(sos_36) # label(axiom). [assumption].
% 0.48/1.01 42 -occurrence_of(A,B) | activity(B) # label(sos) # label(axiom). [clausify(1)].
% 0.48/1.01 43 -activity_occurrence(A) | activity(f1(A)) # label(sos_01) # label(axiom). [clausify(2)].
% 0.48/1.01 Derived: subactivity(tptp0,tptp0). [resolve(40,a,41,a)].
% 0.48/1.01 Derived: subactivity(A,A) | -occurrence_of(B,A). [resolve(40,a,42,b)].
% 0.48/1.01 Derived: subactivity(f1(A),f1(A)) | -activity_occurrence(A). [resolve(40,a,43,b)].
% 0.48/1.01 44 -atocc(A,B) | -legal(A) | root(A,B) # label(sos_17) # label(axiom). [clausify(18)].
% 0.48/1.01 45 -min_precedes(A,B,C) | -root(B,C) # label(sos_14) # label(axiom). [clausify(15)].
% 0.48/1.01 46 -root(A,B) | legal(A) # label(sos_16) # label(axiom). [clausify(17)].
% 0.48/1.01 47 -root(A,B) | subactivity(f4(B,A),B) # label(sos_12) # label(axiom). [clausify(13)].
% 0.48/1.01 48 -root(A,B) | atocc(A,f4(B,A)) # label(sos_12) # label(axiom). [clausify(13)].
% 0.48/1.01 Derived: -atocc(A,B) | -legal(A) | -min_precedes(C,A,B). [resolve(44,c,45,b)].
% 0.48/1.01 Derived: -atocc(A,B) | -legal(A) | subactivity(f4(B,A),B). [resolve(44,c,47,a)].
% 0.48/1.01 Derived: -atocc(A,B) | -legal(A) | atocc(A,f4(B,A)). [resolve(44,c,48,a)].
% 0.48/1.01 49 -root_occ(A,B) | root(A,f14(A,B)) # label(sos_33) # label(axiom). [clausify(34)].
% 0.48/1.01 Derived: -root_occ(A,B) | -min_precedes(C,A,f14(A,B)). [resolve(49,b,45,b)].
% 0.48/1.01 Derived: -root_occ(A,B) | legal(A). [resolve(49,b,46,a)].
% 0.48/1.01 Derived: -root_occ(A,B) | subactivity(f4(f14(A,B),A),f14(A,B)). [resolve(49,b,47,a)].
% 0.48/1.01 Derived: -root_occ(A,B) | atocc(A,f4(f14(A,B),A)). [resolve(49,b,48,a)].
% 0.48/1.01 50 -min_precedes(A,B,C) | root(f5(A,B,C),C) # label(sos_13) # label(axiom). [clausify(14)].
% 0.48/1.01 Derived: -min_precedes(A,B,C) | -min_precedes(D,f5(A,B,C),C). [resolve(50,b,45,b)].
% 0.48/1.01 Derived: -min_precedes(A,B,C) | legal(f5(A,B,C)). [resolve(50,b,46,a)].
% 0.48/1.01 Derived: -min_precedes(A,B,C) | subactivity(f4(C,f5(A,B,C)),C). [resolve(50,b,47,a)].
% 0.48/1.01 Derived: -min_precedes(A,B,C) | atocc(f5(A,B,C),f4(C,f5(A,B,C))). [resolve(50,b,48,a)].
% 0.48/1.01 51 -root(A,B) | atomic(B) | occurrence_of(f11(B,A),B) # label(sos_26) # label(axiom). [clausify(27)].
% 0.48/1.01 Derived: atomic(A) | occurrence_of(f11(A,B),A) | -atocc(B,A) | -legal(B). [resolve(51,a,44,c)].
% 0.48/1.01 Derived: atomic(f14(A,B)) | occurrence_of(f11(f14(A,B),A),f14(A,B)) | -root_occ(A,B). [resolve(51,a,49,b)].
% 0.48/1.01 Derived: atomic(A) | occurrence_of(f11(A,f5(B,C,A)),A) | -min_precedes(B,C,A). [resolve(51,a,50,b)].
% 0.48/1.01 52 -root(A,B) | atomic(B) | subactivity_occurrence(A,f11(B,A)) # label(sos_26) # label(axiom). [clausify(27)].
% 0.48/1.01 Derived: atomic(A) | subactivity_occurrence(B,f11(A,B)) | -atocc(B,A) | -legal(B). [resolve(52,a,44,c)].
% 0.48/1.01 Derived: atomic(f14(A,B)) | subactivity_occurrence(A,f11(f14(A,B),A)) | -root_occ(A,B). [resolve(52,a,49,b)].
% 0.48/1.02 Derived: atomic(A) | subactivity_occurrence(f5(B,C,A),f11(A,f5(B,C,A))) | -min_precedes(B,C,A). [resolve(52,a,50,b)].
% 0.48/1.02 53 -occurrence_of(A,B) | atomic(B) | root(f12(B,A),B) # label(sos_27) # label(axiom). [clausify(28)].
% 0.48/1.02 Derived: -occurrence_of(A,B) | atomic(B) | -min_precedes(C,f12(B,A),B). [resolve(53,c,45,b)].
% 0.48/1.02 Derived: -occurrence_of(A,B) | atomic(B) | legal(f12(B,A)). [resolve(53,c,46,a)].
% 0.48/1.02 Derived: -occurrence_of(A,B) | atomic(B) | subactivity(f4(B,f12(B,A)),B). [resolve(53,c,47,a)].
% 0.48/1.02 Derived: -occurrence_of(A,B) | atomic(B) | atocc(f12(B,A),f4(B,f12(B,A))). [resolve(53,c,48,a)].
% 0.48/1.02 Derived: -occurrence_of(A,B) | atomic(B) | atomic(B) | occurrence_of(f11(B,f12(B,A)),B). [resolve(53,c,51,a)].
% 0.48/1.02 Derived: -occurrence_of(A,B) | atomic(B) | atomic(B) | subactivity_occurrence(f12(B,A),f11(B,f12(B,A))). [resolve(53,c,52,a)].
% 0.48/1.02 54 -leaf(A,B) | root(A,B) | min_precedes(f6(A,B),A,B) # label(sos_21) # label(axiom). [clausify(22)].
% 0.48/1.02 Derived: -leaf(A,B) | min_precedes(f6(A,B),A,B) | -min_precedes(C,A,B). [resolve(54,b,45,b)].
% 0.48/1.02 Derived: -leaf(A,B) | min_precedes(f6(A,B),A,B) | legal(A). [resolve(54,b,46,a)].
% 0.48/1.02 Derived: -leaf(A,B) | min_precedes(f6(A,B),A,B) | subactivity(f4(B,A),B). [resolve(54,b,47,a)].
% 0.48/1.02 Derived: -leaf(A,B) | min_precedes(f6(A,B),A,B) | atocc(A,f4(B,A)). [resolve(54,b,48,a)].
% 0.48/1.02 Derived: -leaf(A,B) | min_precedes(f6(A,B),A,B) | atomic(B) | occurrence_of(f11(B,A),B). [resolve(54,b,51,a)].
% 0.48/1.02 Derived: -leaf(A,B) | min_precedes(f6(A,B),A,B) | atomic(B) | subactivity_occurrence(A,f11(B,A)). [resolve(54,b,52,a)].
% 0.48/1.02 55 leaf(A,B) | -root(A,B) | min_precedes(A,f7(A,B),B) # label(sos_21) # label(axiom). [clausify(22)].
% 0.48/1.02 Derived: leaf(A,B) | min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A). [resolve(55,b,44,c)].
% 0.48/1.02 Derived: leaf(A,f14(A,B)) | min_precedes(A,f7(A,f14(A,B)),f14(A,B)) | -root_occ(A,B). [resolve(55,b,49,b)].
% 0.48/1.02 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(55,b,50,b)].
% 0.48/1.02 Derived: leaf(f12(A,B),A) | min_precedes(f12(A,B),f7(f12(A,B),A),A) | -occurrence_of(B,A) | atomic(A). [resolve(55,b,53,c)].
% 0.48/1.02 56 root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -root(A,C) # label(sos_33) # label(axiom). [clausify(34)].
% 0.48/1.02 Derived: root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -atocc(A,C) | -legal(A). [resolve(56,d,44,c)].
% 0.48/1.02 Derived: root_occ(A,B) | -occurrence_of(B,f14(A,C)) | -subactivity_occurrence(A,B) | -root_occ(A,C). [resolve(56,d,49,b)].
% 0.48/1.02 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(56,d,50,b)].
% 0.48/1.02 Derived: root_occ(f12(A,B),C) | -occurrence_of(C,A) | -subactivity_occurrence(f12(A,B),C) | -occurrence_of(B,A) | atomic(A). [resolve(56,d,53,c)].
% 0.48/1.02 Derived: root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -leaf(A,C) | min_precedes(f6(A,C),A,C). [resolve(56,d,54,b)].
% 0.48/1.02 57 -leaf_occ(A,B) | leaf(A,f15(A,B)) # label(sos_34) # label(axiom). [clausify(35)].
% 0.48/1.02 58 -leaf(A,B) | -min_precedes(A,C,B) # label(sos_21) # label(axiom). [clausify(22)].
% 0.48/1.02 Derived: -leaf_occ(A,B) | -min_precedes(A,C,f15(A,B)). [resolve(57,b,58,a)].
% 0.48/1.02 59 leaf_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -leaf(A,C) # label(sos_34) # label(axiom). [clausify(35)].
% 0.48/1.02 Derived: leaf_occ(A,B) | -occurrence_of(B,f15(A,C)) | -subactivity_occurrence(A,B) | -leaf_occ(A,C). [resolve(59,d,57,b)].
% 0.48/1.02 60 leaf(A,B) | -min_precedes(C,A,B) | min_precedes(A,f7(A,B),B) # label(sos_21) # label(axiom). [clausify(22)].
% 0.48/1.02 Derived: -min_precedes(A,B,C) | min_precedes(B,f7(B,C),C) | -min_precedes(B,D,C). [resolve(60,a,58,a)].
% 0.48/1.02 Derived: -min_precedes(A,B,C) | min_precedes(B,f7(B,C),C) | leaf_occ(B,D) | -occurrence_of(D,C) | -subactivity_occurrence(B,D). [resolve(60,a,59,d)].
% 0.48/1.02 61 -leaf(A,B) | min_precedes(f6(A,B),A,B) | -min_precedes(C,A,B). [resolve(54,b,45,b)].
% 0.48/1.02 Derived: min_precedes(f6(A,f15(A,B)),A,f15(A,B)) | -min_precedes(C,A,f15(A,B)) | -leaf_occ(A,B). [resolve(61,a,57,b)].
% 0.48/1.02 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(61,a,60,a)].
% 0.48/1.02 62 -leaf(A,B) | min_precedes(f6(A,B),A,B) | legal(A). [resolve(54,b,46,a)].
% 0.48/1.02 Derived: min_precedes(f6(A,f15(A,B)),A,f15(A,B)) | legal(A) | -leaf_occ(A,B). [resolve(62,a,57,b)].
% 0.48/1.02 63 -leaf(A,B) | min_precedes(f6(A,B),A,B) | subactivity(f4(B,A),B). [resolve(54,b,47,a)].
% 0.48/1.02 Derived: min_precedes(f6(A,f15(A,B)),A,f15(A,B)) | subactivity(f4(f15(A,B),A),f15(A,B)) | -leaf_occ(A,B). [resolve(63,a,57,b)].
% 0.48/1.02 64 -leaf(A,B) | min_precedes(f6(A,B),A,B) | atocc(A,f4(B,A)). [resolve(54,b,48,a)].
% 0.48/1.02 Derived: min_precedes(f6(A,f15(A,B)),A,f15(A,B)) | atocc(A,f4(f15(A,B),A)) | -leaf_occ(A,B). [resolve(64,a,57,b)].
% 0.48/1.02 65 -leaf(A,B) | min_precedes(f6(A,B),A,B) | atomic(B) | occurrence_of(f11(B,A),B). [resolve(54,b,51,a)].
% 0.48/1.02 Derived: min_precedes(f6(A,f15(A,B)),A,f15(A,B)) | atomic(f15(A,B)) | occurrence_of(f11(f15(A,B),A),f15(A,B)) | -leaf_occ(A,B). [resolve(65,a,57,b)].
% 0.48/1.02 66 -leaf(A,B) | min_precedes(f6(A,B),A,B) | atomic(B) | subactivity_occurrence(A,f11(B,A)). [resolve(54,b,52,a)].
% 0.48/1.02 Derived: min_precedes(f6(A,f15(A,B)),A,f15(A,B)) | atomic(f15(A,B)) | subactivity_occurrence(A,f11(f15(A,B),A)) | -leaf_occ(A,B). [resolve(66,a,57,b)].
% 0.48/1.02 67 leaf(A,B) | min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A). [resolve(55,b,44,c)].
% 0.48/1.02 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A) | -min_precedes(A,C,B). [resolve(67,a,58,a)].
% 0.48/1.02 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(67,a,59,d)].
% 0.48/1.02 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A) | min_precedes(f6(A,B),A,B) | subactivity(f4(B,A),B). [resolve(67,a,63,a)].
% 0.48/1.02 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(67,a,64,a)].
% 0.48/1.02 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A) | min_precedes(f6(A,B),A,B) | atomic(B) | occurrence_of(f11(B,A),B). [resolve(67,a,65,a)].
% 0.48/1.02 Derived: min_precedes(A,f7(A,B),B) | -atocc(A,B) | -legal(A) | min_precedes(f6(A,B),A,B) | atomic(B) | subactivity_occurrence(A,f11(B,A)). [resolve(67,a,66,a)].
% 0.48/1.02 68 leaf(A,f14(A,B)) | min_precedes(A,f7(A,f14(A,B)),f14(A,B)) | -root_occ(A,B). [resolve(55,b,49,b)].
% 0.48/1.02 Derived: min_precedes(A,f7(A,f14(A,B)),f14(A,B)) | -root_occ(A,B) | -min_precedes(A,C,f14(A,B)). [resolve(68,a,58,a)].
% 0.48/1.02 Derived: min_precedes(A,f7(A,f14(A,B)),f14(A,B)) | -root_occ(A,B) | leaf_occ(A,C) | -occurrence_of(C,f14(A,B)) | -subactivity_occurrence(A,C). [resolve(68,a,59,d)].
% 0.48/1.02 Derived: min_precedes(A,f7(A,f14(A,B)),f14(A,B)) | -root_occ(A,B) | min_precedes(f6(A,f14(A,B)),A,f14(A,B)) | legal(A). [resolve(68,a,62,a)].
% 0.48/1.02 Derived: min_precedes(A,f7(A,f14(A,B)),f14(A,B)) | -root_occ(A,B) | min_precedes(f6(A,f14(A,B)),A,f14(A,B)) | subactivity(f4(f14(A,B),A),f14(A,B)). [resolve(68,a,63,a)].
% 0.48/1.02 Derived: min_precedes(A,f7(A,f14(A,B)),f14(A,B)) | -root_occ(A,B) | min_precedes(f6(A,f14(A,B)),A,f14(A,B)) | atocc(A,f4(f14(A,B),A)). [resolve(68,a,64,a)].
% 0.48/1.02 Derived: min_precedes(A,f7(A,f14(A,B)),f14(A,B)) | -root_occ(A,B) | min_precedes(f6(A,f14(A,B)),A,f14(A,B)) | atomic(f14(A,B)) | occurrence_of(f11(f14(A,B),A),f14(A,B)). [resolve(68,a,65,a)].
% 0.48/1.02 Derived: min_precedes(A,f7(A,f14(A,B)),f14(A,B)) | -root_occ(A,B) | min_precedes(f6(A,f14(A,B)),A,f14(A,B)) | atomic(f14(A,B)) | subactivity_occurrence(A,f11(f14(A,B),A)). [resolve(68,a,66,a)].
% 0.48/1.02 69 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(55,b,50,b)].
% 0.48/1.02 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(69,a,58,a)].
% 0.48/1.02 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(69,a,59,d)].
% 0.48/1.02 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(69,a,62,a)].
% 0.48/1.02 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) | subactivity(f4(C,f5(A,B,C)),C). [resolve(69,a,63,a)].
% 0.48/1.02 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(69,a,64,a)].
% 0.48/1.02 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) | atomic(C) | occurrence_of(f11(C,f5(A,B,C)),C). [resolve(69,a,65,a)].
% 0.48/1.02 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) | atomic(C) | subactivity_occurrence(f5(A,B,C),f11(C,f5(A,B,C))). [resolve(69,a,66,a)].
% 0.48/1.02 70 leaf(f12(A,B),A) | min_precedes(f12(A,B),f7(f12(A,B),A),A) | -occurrence_of(B,A) | atomic(A). [resolve(55,b,53,c)].
% 0.48/1.02 Derived: min_precedes(f12(A,B),f7(f12(A,B),A),A) | -occurrence_of(B,A) | atomic(A) | -min_precedes(f12(A,B),C,A). [resolve(70,a,58,a)].
% 0.48/1.02 Derived: min_precedes(f12(A,B),f7(f12(A,B),A),A) | -occurrence_of(B,A) | atomic(A) | leaf_occ(f12(A,B),C) | -occurrence_of(C,A) | -subactivity_occurrence(f12(A,B),C). [resolve(70,a,59,d)].
% 0.48/1.02 Derived: min_precedes(f12(A,B),f7(f12(A,B),A),A) | -occurrence_of(B,A) | atomic(A) | min_precedes(f6(f12(A,B),A),f12(A,B),A) | legal(f12(A,B)). [resolve(70,a,62,a)].
% 0.48/1.02 Derived: min_precedes(f12(A,B),f7(f12(A,B),A),A) | -occurrence_of(B,A) | atomic(A) | min_precedes(f6(f12(A,B),A),f12(A,B),A) | subactivity(f4(A,f12(A,B)),A). [resolve(70,a,63,a)].
% 0.48/1.02 Derived: min_precedes(f12(A,B),f7(f12(A,B),A),A) | -occurrence_of(B,A) | atomic(A) | min_precedes(f6(f12(A,B),A),f12(A,B),A) | atocc(f12(A,B),f4(A,f12(A,B))). [resolve(70,a,64,a)].
% 0.48/1.02 Derived: min_precedes(f12(A,B),f7(f12(A,B),A),A) | -occurrence_of(B,A) | atomic(A) | min_precedes(f6(f12(A,B),A),f12(A,B),A) | atomic(A) | occurrence_of(f11(A,f12(A,B)),A). [resolve(70,a,65,a)].
% 0.48/1.02 Derived: min_precedes(f12(A,B),f7(f12(A,B),A),A) | -occurrence_of(B,A) | atomic(A) | min_precedes(f6(f12(A,B),A),f12(A,B),A) | atomic(A) | subactivity_occurrence(f12(A,B),f11(A,f12(A,B))). [resolve(70,a,66,a)].
% 0.48/1.02 71 root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -leaf(A,C) | min_precedes(f6(A,C),A,C). [resolve(56,d,54,b)].
% 0.48/1.02 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(71,d,57,b)].
% 0.48/1.02 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(71,d,67,a)].
% 0.48/1.02 Derived: root_occ(A,B) | -occurrence_of(B,f14(A,C)) | -subactivity_occurrence(A,B) | min_precedes(f6(A,f14(A,C)),A,f14(A,C)) | min_precedes(A,f7(A,f14(A,C)),f14(A,C)) | -root_occ(A,C). [resolve(71,d,68,a)].
% 0.48/1.02 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(71,d,69,a)].
% 0.48/1.02 Derived: root_occ(f12(A,B),C) | -occurrence_of(C,A) | -subactivity_occurrence(f12(A,B),C) | min_precedes(f6(f12(A,B),A),f12(A,B),A) | min_precedes(f12(A,B),f7(f12(A,B),A),A) | -occurrence_of(B,A) | atomic(A). [resolve(71,d,70,a)].
% 0.48/1.02 72 -occurrence_of(A,tptp0) | next_subocc(f16(A),f17(A),tptp0) # label(sos_35) # label(axiom). [clausify(36)].
% 0.48/1.02 73 -next_subocc(A,B,C) | -min_precedes(A,D,C) | -min_precedes(D,B,C) # label(sos_22) # label(axiom). [clausify(23)].
% 0.48/1.02 74 -next_subocc(A,B,C) | min_precedes(A,B,C) # label(sos_22) # label(axiom). [clausify(23)].
% 0.48/1.02 Derived: -occurrence_of(A,tptp0) | -min_precedes(f16(A),B,tptp0) | -min_precedes(B,f17(A),tptp0). [resolve(72,b,73,a)].
% 0.48/1.02 Derived: -occurrence_of(A,tptp0) | min_precedes(f16(A),f17(A),tptp0). [resolve(72,b,74,a)].
% 0.48/1.02 75 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.48/1.02 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(75,a,73,a)].
% 0.48/1.02 76 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.48/1.02 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(76,a,73,a)].
% 0.48/1.03 77 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | next_subocc(B,f18(B,A),tptp0) # label(sos_49) # label(axiom). [clausify(38)].
% 0.48/1.03 Derived: -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | -min_precedes(B,C,tptp0) | -min_precedes(C,f18(B,A),tptp0). [resolve(77,e,73,a)].
% 0.48/1.03 Derived: -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | min_precedes(B,f18(B,A),tptp0). [resolve(77,e,74,a)].
% 0.48/1.03 78 -activity_occurrence(A) | occurrence_of(A,f1(A)) # label(sos_01) # label(axiom). [clausify(2)].
% 0.48/1.03 79 -occurrence_of(A,B) | activity_occurrence(A) # label(sos) # label(axiom). [clausify(1)].
% 0.48/1.03 80 -subactivity_occurrence(A,B) | activity_occurrence(A) # label(sos_24) # label(axiom). [clausify(25)].
% 0.48/1.03 81 -subactivity_occurrence(A,B) | activity_occurrence(B) # label(sos_24) # label(axiom). [clausify(25)].
% 0.48/1.03 Derived: occurrence_of(A,f1(A)) | -occurrence_of(A,B). [resolve(78,a,79,b)].
% 0.48/1.03 Derived: occurrence_of(A,f1(A)) | -subactivity_occurrence(A,B). [resolve(78,a,80,b)].
% 0.48/1.03 Derived: occurrence_of(A,f1(A)) | -subactivity_occurrence(B,A). [resolve(78,a,81,b)].
% 0.48/1.03 82 subactivity(f1(A),f1(A)) | -activity_occurrence(A). [resolve(40,a,43,b)].
% 0.48/1.03 Derived: subactivity(f1(A),f1(A)) | -occurrence_of(A,B). [resolve(82,b,79,b)].
% 0.48/1.03 Derived: subactivity(f1(A),f1(A)) | -subactivity_occurrence(A,B). [resolve(82,b,80,b)].
% 0.48/1.03 Derived: subactivity(f1(A),f1(A)) | -subactivity_occurrence(B,A). [resolve(82,b,81,b)].
% 0.48/1.03 83 -min_precedes(A,B,C) | precedes(A,B) # label(sos_15) # label(axiom). [clausify(16)].
% 0.48/1.03 84 -precedes(A,B) | legal(B) # label(sos_10) # label(axiom). [clausify(11)].
% 0.48/1.03 85 -precedes(A,B) | earlier(A,B) # label(sos_10) # label(axiom). [clausify(11)].
% 0.48/1.03 Derived: -min_precedes(A,B,C) | legal(B). [resolve(83,b,84,a)].
% 0.48/1.03 Derived: -min_precedes(A,B,C) | earlier(A,B). [resolve(83,b,85,a)].
% 0.48/1.03 86 precedes(A,B) | -earlier(A,B) | -legal(B) # label(sos_10) # label(axiom). [clausify(11)].
% 0.48/1.03 87 -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.48/1.03 Derived: -min_precedes(A,B,C) | -min_precedes(A,D,C) | min_precedes(B,D,C) | -min_precedes(B,D,E). [resolve(87,c,83,b)].
% 0.48/1.03 Derived: -min_precedes(A,B,C) | -min_precedes(A,D,C) | min_precedes(B,D,C) | -earlier(B,D) | -legal(D). [resolve(87,c,86,a)].
% 0.48/1.03 88 -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.48/1.03 Derived: -min_precedes(A,B,C) | -min_precedes(D,B,C) | min_precedes(A,D,C) | -min_precedes(A,D,E). [resolve(88,c,83,b)].
% 0.48/1.03 Derived: -min_precedes(A,B,C) | -min_precedes(D,B,C) | min_precedes(A,D,C) | -earlier(A,D) | -legal(D). [resolve(88,c,86,a)].
% 0.48/1.03 89 atocc(A,B) | -subactivity(B,C) | -atomic(C) | -occurrence_of(A,C) # label(sos_23) # label(axiom). [clausify(24)].
% 0.48/1.03 90 -atocc(A,B) | subactivity(B,f9(A,B)) # label(sos_23) # label(axiom). [clausify(24)].
% 0.48/1.03 91 -min_precedes(A,B,C) | subactivity(f2(C,A,B),C) # label(sos_11) # label(axiom). [clausify(12)].
% 0.48/1.03 92 -min_precedes(A,B,C) | subactivity(f3(C,A,B),C) # label(sos_11) # label(axiom). [clausify(12)].
% 0.48/1.03 Derived: atocc(A,B) | -atomic(f9(C,B)) | -occurrence_of(A,f9(C,B)) | -atocc(C,B). [resolve(89,b,90,b)].
% 0.48/1.03 Derived: atocc(A,f2(B,C,D)) | -atomic(B) | -occurrence_of(A,B) | -min_precedes(C,D,B). [resolve(89,b,91,b)].
% 0.48/1.03 Derived: atocc(A,f3(B,C,D)) | -atomic(B) | -occurrence_of(A,B) | -min_precedes(C,D,B). [resolve(89,b,92,b)].
% 0.48/1.03 93 -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.48/1.03 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(93,e,89,b)].
% 0.48/1.03 94 -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.48/1.03 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(94,c,90,b)].
% 0.48/1.03 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(94,c,91,b)].
% 0.48/1.03 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(94,c,92,b)].
% 0.48/1.03 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(94,c,93,e)].
% 0.48/1.03 95 -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.48/1.03 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(95,c,90,b)].
% 0.48/1.03 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(95,c,91,b)].
% 0.48/1.03 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(95,c,92,b)].
% 0.48/1.03 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(95,c,93,e)].
% 0.48/1.03 96 subactivity(tptp0,tptp0). [resolve(40,a,41,a)].
% 0.48/1.03 Derived: atocc(A,tptp0) | -atomic(tptp0) | -occurrence_of(A,tptp0). [resolve(96,a,89,b)].
% 0.48/1.03 Derived: -occurrence_of(A,tptp0) | -occurrence_of(B,tptp0) | subactivity_occurrence(A,B) | subactivity_occurrence(f13(tptp0,tptp0,A,B),B). [resolve(96,a,94,c)].
% 0.48/1.03 Derived: -occurrence_of(A,tptp0) | -occurrence_of(B,tptp0) | subactivity_occurrence(A,B) | -subactivity_occurrence(f13(tptp0,tptp0,A,B),A). [resolve(96,a,95,c)].
% 0.48/1.03 97 subactivity(A,A) | -occurrence_of(B,A). [resolve(40,a,42,b)].
% 0.48/1.03 Derived: -occurrence_of(A,B) | atocc(C,B) | -atomic(B) | -occurrence_of(C,B). [resolve(97,a,89,b)].
% 0.48/1.03 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(97,a,94,c)].
% 0.48/1.03 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(97,a,95,c)].
% 0.48/1.03 98 -atocc(A,B) | -legal(A) | subactivity(f4(B,A),B). [resolve(44,c,47,a)].
% 0.48/1.03 Derived: -atocc(A,B) | -legal(A) | atocc(C,f4(B,A)) | -atomic(B) | -occurrence_of(C,B). [resolve(98,c,89,b)].
% 0.48/1.03 Derived: -atocc(A,B) | -legal(A) | -occurrence_of(C,f4(B,A)) | -occurrence_of(D,B) | subactivity_occurrence(C,D) | subactivity_occurrence(f13(f4(B,A),B,C,D),D). [resolve(98,c,94,c)].
% 0.48/1.03 Derived: -atocc(A,B) | -legal(A) | -occurrence_of(C,f4(B,A)) | -occurrence_of(D,B) | subactivity_occurrence(C,D) | -subactivity_occurrence(f13(f4(B,A),B,C,D),C). [resolve(98,c,95,c)].
% 0.48/1.03 99 -root_occ(A,B) | subactivity(f4(f14(A,B),A),f14(A,B)). [resolve(49,b,47,a)].
% 0.48/1.03 Derived: -root_occ(A,B) | atocc(C,f4(f14(A,B),A)) | -atomic(f14(A,B)) | -occurrence_of(C,f14(A,B)). [resolve(99,b,89,b)].
% 0.48/1.03 Derived: -root_occ(A,B) | -occurrence_of(C,f4(f14(A,B),A)) | -occurrence_of(D,f14(A,B)) | subactivity_occurrence(C,D) | subactivity_occurrence(f13(f4(f14(A,B),A),f14(A,B),C,D),D). [resolve(99,b,94,c)].
% 0.48/1.03 Derived: -root_occ(A,B) | -occurrence_of(C,f4(f14(A,B),A)) | -occurrence_of(D,f14(A,B)) | subactivity_occurrence(C,D) | -subactivity_occurrence(f13(f4(f14(A,B),A),f14(A,B),C,D),C). [resolve(99,b,95,c)].
% 0.48/1.03 100 -min_precedes(A,B,C) | subactivity(f4(C,f5(A,B,C)),C). [resolve(50,b,47,a)].
% 0.48/1.03 Derived: -min_precedes(A,B,C) | atocc(D,f4(C,f5(A,B,C))) | -atomic(C) | -occurrence_of(D,C). [resolve(100,b,89,b)].
% 0.48/1.03 Derived: -min_precedes(A,B,C) | -occurrence_of(D,f4(Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------