TSTP Solution File: PRO014+4 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PRO014+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n032.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:14 EDT 2022
% Result : Theorem 0.95s 1.24s
% Output : Refutation 0.95s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : PRO014+4 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.11 % Command : tptp2X_and_run_prover9 %d %s
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 600
% 0.10/0.30 % DateTime : Mon Jun 13 02:15:41 EDT 2022
% 0.10/0.30 % CPUTime :
% 0.52/0.86 ============================== Prover9 ===============================
% 0.52/0.86 Prover9 (32) version 2009-11A, November 2009.
% 0.52/0.86 Process 4343 was started by sandbox2 on n032.cluster.edu,
% 0.52/0.86 Mon Jun 13 02:15:42 2022
% 0.52/0.86 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_4190_n032.cluster.edu".
% 0.52/0.86 ============================== end of head ===========================
% 0.52/0.86
% 0.52/0.86 ============================== INPUT =================================
% 0.52/0.86
% 0.52/0.86 % Reading from file /tmp/Prover9_4190_n032.cluster.edu
% 0.52/0.86
% 0.52/0.86 set(prolog_style_variables).
% 0.52/0.86 set(auto2).
% 0.52/0.86 % set(auto2) -> set(auto).
% 0.52/0.86 % set(auto) -> set(auto_inference).
% 0.52/0.86 % set(auto) -> set(auto_setup).
% 0.52/0.86 % set(auto_setup) -> set(predicate_elim).
% 0.52/0.86 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.52/0.86 % set(auto) -> set(auto_limits).
% 0.52/0.86 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.52/0.86 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.52/0.86 % set(auto) -> set(auto_denials).
% 0.52/0.86 % set(auto) -> set(auto_process).
% 0.52/0.86 % set(auto2) -> assign(new_constants, 1).
% 0.52/0.86 % set(auto2) -> assign(fold_denial_max, 3).
% 0.52/0.86 % set(auto2) -> assign(max_weight, "200.000").
% 0.52/0.86 % set(auto2) -> assign(max_hours, 1).
% 0.52/0.86 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.52/0.86 % set(auto2) -> assign(max_seconds, 0).
% 0.52/0.86 % set(auto2) -> assign(max_minutes, 5).
% 0.52/0.86 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.52/0.86 % set(auto2) -> set(sort_initial_sos).
% 0.52/0.86 % set(auto2) -> assign(sos_limit, -1).
% 0.52/0.86 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.52/0.86 % set(auto2) -> assign(max_megs, 400).
% 0.52/0.86 % set(auto2) -> assign(stats, some).
% 0.52/0.86 % set(auto2) -> clear(echo_input).
% 0.52/0.86 % set(auto2) -> set(quiet).
% 0.52/0.86 % set(auto2) -> clear(print_initial_clauses).
% 0.52/0.86 % set(auto2) -> clear(print_given).
% 0.52/0.86 assign(lrs_ticks,-1).
% 0.52/0.86 assign(sos_limit,10000).
% 0.52/0.86 assign(order,kbo).
% 0.52/0.86 set(lex_order_vars).
% 0.52/0.86 clear(print_given).
% 0.52/0.86
% 0.52/0.86 % formulas(sos). % not echoed (46 formulas)
% 0.52/0.86
% 0.52/0.86 ============================== end of input ==========================
% 0.52/0.86
% 0.52/0.86 % From the command line: assign(max_seconds, 300).
% 0.52/0.86
% 0.52/0.86 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.52/0.86
% 0.52/0.86 % Formulas that are not ordinary clauses:
% 0.52/0.86 1 (all X0 all X1 (occurrence_of(X1,X0) & -atomic(X0) -> (exists X2 (root(X2,X0) & subactivity_occurrence(X2,X1))))) # label(sos) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.86 2 (all X3 all X4 all X5 all X6 all X7 (occurrence_of(X4,X3) & root_occ(X6,X4) & leaf_occ(X7,X4) & subactivity_occurrence(X5,X4) & min_precedes(X6,X5,X3) & X5 != X7 -> min_precedes(X5,X7,X3))) # label(sos_01) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.86 3 (all X8 all X9 all X10 all X11 (occurrence_of(X9,X8) & subactivity_occurrence(X10,X9) & leaf_occ(X11,X9) & arboreal(X10) & -min_precedes(X10,X11,X8) -> X11 = X10)) # label(sos_02) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.86 4 (all X12 all X13 (occurrence_of(X13,X12) -> activity(X12) & activity_occurrence(X13))) # label(sos_03) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.86 5 (all X14 all X15 all X16 all X17 (occurrence_of(X15,X14) & arboreal(X16) & arboreal(X17) & subactivity_occurrence(X16,X15) & subactivity_occurrence(X17,X15) -> min_precedes(X16,X17,X14) | min_precedes(X17,X16,X14) | X16 = X17)) # label(sos_04) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.86 6 (all X18 all X19 (root(X19,X18) -> (exists X20 (subactivity(X20,X18) & atocc(X19,X20))))) # label(sos_05) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.86 7 (all X21 all X22 all X23 (min_precedes(X22,X23,X21) -> (exists X24 (occurrence_of(X24,X21) & subactivity_occurrence(X22,X24) & subactivity_occurrence(X23,X24))))) # label(sos_06) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.86 8 (all X25 all X26 (leaf(X25,X26) & -atomic(X26) -> (exists X27 (occurrence_of(X27,X26) & leaf_occ(X25,X27))))) # label(sos_07) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.86 9 (all X28 all X29 all X30 (occurrence_of(X28,X29) & occurrence_of(X28,X30) -> X29 = X30)) # label(sos_08) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.86 10 (all X31 all X32 all X33 (occurrence_of(X31,X33) & leaf_occ(X32,X31) -> -(exists X34 min_precedes(X32,X34,X33)))) # label(sos_09) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.86 11 (all X35 all X36 all X37 (occurrence_of(X35,X37) & root_occ(X36,X35) -> -(exists X38 min_precedes(X38,X36,X37)))) # label(sos_10) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.86 12 (all X39 all X40 (subactivity_occurrence(X39,X40) -> activity_occurrence(X39) & activity_occurrence(X40))) # label(sos_11) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.86 13 (all X41 (activity_occurrence(X41) -> (exists X42 (activity(X42) & occurrence_of(X41,X42))))) # label(sos_12) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.86 14 (all X43 (legal(X43) -> arboreal(X43))) # label(sos_13) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.86 15 (all X44 all X45 (atocc(X44,X45) <-> (exists X46 (subactivity(X45,X46) & atomic(X46) & occurrence_of(X44,X46))))) # label(sos_14) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.86 16 (all X47 all X48 (leaf(X47,X48) <-> (root(X47,X48) | (exists X49 min_precedes(X49,X47,X48))) & -(exists X50 min_precedes(X47,X50,X48)))) # label(sos_15) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.86 17 (all X51 all X52 (occurrence_of(X51,X52) -> (arboreal(X51) <-> atomic(X52)))) # label(sos_16) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.86 18 (all X53 all X54 (root(X53,X54) -> legal(X53))) # label(sos_17) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.86 19 (all X55 all X56 (leaf_occ(X55,X56) <-> (exists X57 (occurrence_of(X56,X57) & subactivity_occurrence(X55,X56) & leaf(X55,X57))))) # label(sos_18) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.86 20 (all X58 all X59 (root_occ(X58,X59) <-> (exists X60 (occurrence_of(X59,X60) & subactivity_occurrence(X58,X59) & root(X58,X60))))) # label(sos_19) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.86 21 (all X61 all X62 (earlier(X61,X62) -> -earlier(X62,X61))) # label(sos_20) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.86 22 (all X63 all X64 (precedes(X63,X64) <-> earlier(X63,X64) & legal(X64))) # label(sos_21) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.86 23 (all X65 all X66 all X67 (min_precedes(X65,X66,X67) -> -root(X66,X67))) # label(sos_22) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.86 24 (all X68 all X69 all X70 (min_precedes(X68,X69,X70) -> (exists X71 (root(X71,X70) & min_precedes(X71,X69,X70))))) # label(sos_23) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.86 25 (all X72 all X73 all X74 (min_precedes(X72,X73,X74) -> precedes(X72,X73))) # label(sos_24) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.86 26 (all X75 all X76 all X77 (next_subocc(X75,X76,X77) -> arboreal(X75) & arboreal(X76))) # label(sos_25) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.86 27 (all X78 all X79 all X80 (next_subocc(X78,X79,X80) <-> min_precedes(X78,X79,X80) & -(exists X81 (min_precedes(X78,X81,X80) & min_precedes(X81,X79,X80))))) # label(sos_26) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.86 28 (all X82 all X83 all X84 all X85 (min_precedes(X82,X83,X84) & occurrence_of(X85,X84) & subactivity_occurrence(X83,X85) -> subactivity_occurrence(X82,X85))) # label(sos_27) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.86 29 (all X86 all X87 all X88 all X89 (occurrence_of(X88,X89) & -atomic(X89) & leaf_occ(X86,X88) & leaf_occ(X87,X88) -> X86 = X87)) # label(sos_28) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.86 30 (all X90 all X91 all X92 all X93 (occurrence_of(X92,X93) & root_occ(X90,X92) & root_occ(X91,X92) -> X90 = X91)) # label(sos_29) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.86 31 (all X94 all X95 all X96 (earlier(X94,X95) & earlier(X95,X96) -> earlier(X94,X96))) # label(sos_30) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.86 32 (all X97 all X98 all X99 all X100 (min_precedes(X97,X98,X100) & min_precedes(X97,X99,X100) & precedes(X98,X99) -> min_precedes(X98,X99,X100))) # label(sos_31) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.86 33 (all X101 all X102 (occurrence_of(X102,tptp0) & subactivity_occurrence(X101,X102) & arboreal(X101) & -leaf_occ(X101,X102) -> (exists X103 exists X104 exists X105 (occurrence_of(X103,tptp3) & next_subocc(X101,X103,tptp0) & occurrence_of(X104,tptp4) & next_subocc(X103,X104,tptp0) & (occurrence_of(X105,tptp2) | occurrence_of(X105,tptp1)) & next_subocc(X104,X105,tptp0) & leaf(X105,tptp0))))) # label(sos_32) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.86 34 -(all X106 all X107 (occurrence_of(X107,tptp0) & subactivity_occurrence(X106,X107) & arboreal(X106) & -leaf_occ(X106,X107) -> (exists X108 exists X109 (occurrence_of(X108,tptp3) & next_subocc(X106,X108,tptp0) & (occurrence_of(X109,tptp2) | occurrence_of(X109,tptp1)) & min_precedes(X108,X109,tptp0) & leaf(X109,tptp0))))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.52/0.86
% 0.52/0.86 ============================== end of process non-clausal formulas ===
% 0.52/0.86
% 0.52/0.86 ============================== PROCESS INITIAL CLAUSES ===============
% 0.52/0.86
% 0.52/0.86 ============================== PREDICATE ELIMINATION =================
% 0.52/0.86 35 -root_occ(A,B) | root(A,f10(A,B)) # label(sos_19) # label(axiom). [clausify(20)].
% 0.52/0.86 36 -min_precedes(A,B,C) | -root(B,C) # label(sos_22) # label(axiom). [clausify(23)].
% 0.52/0.86 37 -root(A,B) | legal(A) # label(sos_17) # label(axiom). [clausify(18)].
% 0.52/0.86 38 -root(A,B) | subactivity(f2(B,A),B) # label(sos_05) # label(axiom). [clausify(6)].
% 0.52/0.86 39 -root(A,B) | atocc(A,f2(B,A)) # label(sos_05) # label(axiom). [clausify(6)].
% 0.52/0.86 Derived: -root_occ(A,B) | -min_precedes(C,A,f10(A,B)). [resolve(35,b,36,b)].
% 0.52/0.86 Derived: -root_occ(A,B) | legal(A). [resolve(35,b,37,a)].
% 0.52/0.86 Derived: -root_occ(A,B) | subactivity(f2(f10(A,B),A),f10(A,B)). [resolve(35,b,38,a)].
% 0.52/0.86 Derived: -root_occ(A,B) | atocc(A,f2(f10(A,B),A)). [resolve(35,b,39,a)].
% 0.52/0.86 40 -occurrence_of(A,B) | atomic(B) | root(f1(B,A),B) # label(sos) # label(axiom). [clausify(1)].
% 0.52/0.86 Derived: -occurrence_of(A,B) | atomic(B) | -min_precedes(C,f1(B,A),B). [resolve(40,c,36,b)].
% 0.52/0.86 Derived: -occurrence_of(A,B) | atomic(B) | legal(f1(B,A)). [resolve(40,c,37,a)].
% 0.52/0.86 Derived: -occurrence_of(A,B) | atomic(B) | subactivity(f2(B,f1(B,A)),B). [resolve(40,c,38,a)].
% 0.52/0.86 Derived: -occurrence_of(A,B) | atomic(B) | atocc(f1(B,A),f2(B,f1(B,A))). [resolve(40,c,39,a)].
% 0.52/0.86 41 -min_precedes(A,B,C) | root(f11(A,B,C),C) # label(sos_23) # label(axiom). [clausify(24)].
% 0.52/0.86 Derived: -min_precedes(A,B,C) | -min_precedes(D,f11(A,B,C),C). [resolve(41,b,36,b)].
% 0.52/0.86 Derived: -min_precedes(A,B,C) | legal(f11(A,B,C)). [resolve(41,b,37,a)].
% 0.52/0.86 Derived: -min_precedes(A,B,C) | subactivity(f2(C,f11(A,B,C)),C). [resolve(41,b,38,a)].
% 0.52/0.86 Derived: -min_precedes(A,B,C) | atocc(f11(A,B,C),f2(C,f11(A,B,C))). [resolve(41,b,39,a)].
% 0.52/0.86 42 -leaf(A,B) | root(A,B) | min_precedes(f7(A,B),A,B) # label(sos_15) # label(axiom). [clausify(16)].
% 0.52/0.86 Derived: -leaf(A,B) | min_precedes(f7(A,B),A,B) | -min_precedes(C,A,B). [resolve(42,b,36,b)].
% 0.52/0.86 Derived: -leaf(A,B) | min_precedes(f7(A,B),A,B) | legal(A). [resolve(42,b,37,a)].
% 0.52/0.86 Derived: -leaf(A,B) | min_precedes(f7(A,B),A,B) | subactivity(f2(B,A),B). [resolve(42,b,38,a)].
% 0.52/0.86 Derived: -leaf(A,B) | min_precedes(f7(A,B),A,B) | atocc(A,f2(B,A)). [resolve(42,b,39,a)].
% 0.52/0.86 43 leaf(A,B) | -root(A,B) | min_precedes(A,f8(A,B),B) # label(sos_15) # label(axiom). [clausify(16)].
% 0.52/0.86 Derived: leaf(A,f10(A,B)) | min_precedes(A,f8(A,f10(A,B)),f10(A,B)) | -root_occ(A,B). [resolve(43,b,35,b)].
% 0.52/0.86 Derived: leaf(f1(A,B),A) | min_precedes(f1(A,B),f8(f1(A,B),A),A) | -occurrence_of(B,A) | atomic(A). [resolve(43,b,40,c)].
% 0.52/0.86 Derived: leaf(f11(A,B,C),C) | min_precedes(f11(A,B,C),f8(f11(A,B,C),C),C) | -min_precedes(A,B,C). [resolve(43,b,41,b)].
% 0.52/0.86 44 root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -root(A,C) # label(sos_19) # label(axiom). [clausify(20)].
% 0.52/0.86 Derived: root_occ(A,B) | -occurrence_of(B,f10(A,C)) | -subactivity_occurrence(A,B) | -root_occ(A,C). [resolve(44,d,35,b)].
% 0.52/0.86 Derived: root_occ(f1(A,B),C) | -occurrence_of(C,A) | -subactivity_occurrence(f1(A,B),C) | -occurrence_of(B,A) | atomic(A). [resolve(44,d,40,c)].
% 0.52/0.86 Derived: root_occ(f11(A,B,C),D) | -occurrence_of(D,C) | -subactivity_occurrence(f11(A,B,C),D) | -min_precedes(A,B,C). [resolve(44,d,41,b)].
% 0.52/0.86 Derived: root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -leaf(A,C) | min_precedes(f7(A,C),A,C). [resolve(44,d,42,b)].
% 0.52/0.86 45 -precedes(A,B) | legal(B) # label(sos_21) # label(axiom). [clausify(22)].
% 0.52/0.87 46 -legal(A) | arboreal(A) # label(sos_13) # label(axiom). [clausify(14)].
% 0.52/0.87 Derived: -precedes(A,B) | arboreal(B). [resolve(45,b,46,a)].
% 0.52/0.87 47 precedes(A,B) | -earlier(A,B) | -legal(B) # label(sos_21) # label(axiom). [clausify(22)].
% 0.52/0.87 Derived: precedes(A,B) | -earlier(A,B) | -precedes(C,B). [resolve(47,c,45,b)].
% 0.52/0.87 48 -root_occ(A,B) | legal(A). [resolve(35,b,37,a)].
% 0.52/0.87 Derived: -root_occ(A,B) | arboreal(A). [resolve(48,b,46,a)].
% 0.52/0.87 Derived: -root_occ(A,B) | precedes(C,A) | -earlier(C,A). [resolve(48,b,47,c)].
% 0.52/0.87 49 -occurrence_of(A,B) | atomic(B) | legal(f1(B,A)). [resolve(40,c,37,a)].
% 0.52/0.87 Derived: -occurrence_of(A,B) | atomic(B) | arboreal(f1(B,A)). [resolve(49,c,46,a)].
% 0.52/0.87 Derived: -occurrence_of(A,B) | atomic(B) | precedes(C,f1(B,A)) | -earlier(C,f1(B,A)). [resolve(49,c,47,c)].
% 0.52/0.87 50 -min_precedes(A,B,C) | legal(f11(A,B,C)). [resolve(41,b,37,a)].
% 0.52/0.87 Derived: -min_precedes(A,B,C) | arboreal(f11(A,B,C)). [resolve(50,b,46,a)].
% 0.52/0.87 Derived: -min_precedes(A,B,C) | precedes(D,f11(A,B,C)) | -earlier(D,f11(A,B,C)). [resolve(50,b,47,c)].
% 0.52/0.87 51 -leaf(A,B) | min_precedes(f7(A,B),A,B) | legal(A). [resolve(42,b,37,a)].
% 0.52/0.87 Derived: -leaf(A,B) | min_precedes(f7(A,B),A,B) | arboreal(A). [resolve(51,c,46,a)].
% 0.52/0.87 Derived: -leaf(A,B) | min_precedes(f7(A,B),A,B) | precedes(C,A) | -earlier(C,A). [resolve(51,c,47,c)].
% 0.52/0.87 52 -activity_occurrence(A) | occurrence_of(A,f5(A)) # label(sos_12) # label(axiom). [clausify(13)].
% 0.52/0.87 53 -occurrence_of(A,B) | activity_occurrence(A) # label(sos_03) # label(axiom). [clausify(4)].
% 0.52/0.87 54 -subactivity_occurrence(A,B) | activity_occurrence(A) # label(sos_11) # label(axiom). [clausify(12)].
% 0.52/0.87 55 -subactivity_occurrence(A,B) | activity_occurrence(B) # label(sos_11) # label(axiom). [clausify(12)].
% 0.52/0.87 Derived: occurrence_of(A,f5(A)) | -occurrence_of(A,B). [resolve(52,a,53,b)].
% 0.52/0.87 Derived: occurrence_of(A,f5(A)) | -subactivity_occurrence(A,B). [resolve(52,a,54,b)].
% 0.52/0.87 Derived: occurrence_of(A,f5(A)) | -subactivity_occurrence(B,A). [resolve(52,a,55,b)].
% 0.52/0.87 56 atocc(A,B) | -subactivity(B,C) | -atomic(C) | -occurrence_of(A,C) # label(sos_14) # label(axiom). [clausify(15)].
% 0.52/0.87 57 -atocc(A,B) | atomic(f6(A,B)) # label(sos_14) # label(axiom). [clausify(15)].
% 0.52/0.87 58 -atocc(A,B) | subactivity(B,f6(A,B)) # label(sos_14) # label(axiom). [clausify(15)].
% 0.52/0.87 59 -atocc(A,B) | occurrence_of(A,f6(A,B)) # label(sos_14) # label(axiom). [clausify(15)].
% 0.52/0.87 Derived: -subactivity(A,B) | -atomic(B) | -occurrence_of(C,B) | atomic(f6(C,A)). [resolve(56,a,57,a)].
% 0.52/0.87 Derived: -subactivity(A,B) | -atomic(B) | -occurrence_of(C,B) | subactivity(A,f6(C,A)). [resolve(56,a,58,a)].
% 0.52/0.87 Derived: -subactivity(A,B) | -atomic(B) | -occurrence_of(C,B) | occurrence_of(C,f6(C,A)). [resolve(56,a,59,a)].
% 0.52/0.87 60 -root_occ(A,B) | atocc(A,f2(f10(A,B),A)). [resolve(35,b,39,a)].
% 0.52/0.87 Derived: -root_occ(A,B) | atomic(f6(A,f2(f10(A,B),A))). [resolve(60,b,57,a)].
% 0.52/0.87 Derived: -root_occ(A,B) | subactivity(f2(f10(A,B),A),f6(A,f2(f10(A,B),A))). [resolve(60,b,58,a)].
% 0.52/0.87 Derived: -root_occ(A,B) | occurrence_of(A,f6(A,f2(f10(A,B),A))). [resolve(60,b,59,a)].
% 0.52/0.87 61 -occurrence_of(A,B) | atomic(B) | atocc(f1(B,A),f2(B,f1(B,A))). [resolve(40,c,39,a)].
% 0.57/0.87 Derived: -occurrence_of(A,B) | atomic(B) | atomic(f6(f1(B,A),f2(B,f1(B,A)))). [resolve(61,c,57,a)].
% 0.57/0.87 Derived: -occurrence_of(A,B) | atomic(B) | subactivity(f2(B,f1(B,A)),f6(f1(B,A),f2(B,f1(B,A)))). [resolve(61,c,58,a)].
% 0.57/0.87 Derived: -occurrence_of(A,B) | atomic(B) | occurrence_of(f1(B,A),f6(f1(B,A),f2(B,f1(B,A)))). [resolve(61,c,59,a)].
% 0.57/0.87 62 -min_precedes(A,B,C) | atocc(f11(A,B,C),f2(C,f11(A,B,C))). [resolve(41,b,39,a)].
% 0.57/0.87 Derived: -min_precedes(A,B,C) | atomic(f6(f11(A,B,C),f2(C,f11(A,B,C)))). [resolve(62,b,57,a)].
% 0.57/0.87 Derived: -min_precedes(A,B,C) | subactivity(f2(C,f11(A,B,C)),f6(f11(A,B,C),f2(C,f11(A,B,C)))). [resolve(62,b,58,a)].
% 0.57/0.87 Derived: -min_precedes(A,B,C) | occurrence_of(f11(A,B,C),f6(f11(A,B,C),f2(C,f11(A,B,C)))). [resolve(62,b,59,a)].
% 0.57/0.87 63 -leaf(A,B) | min_precedes(f7(A,B),A,B) | atocc(A,f2(B,A)). [resolve(42,b,39,a)].
% 0.57/0.87 Derived: -leaf(A,B) | min_precedes(f7(A,B),A,B) | atomic(f6(A,f2(B,A))). [resolve(63,c,57,a)].
% 0.57/0.87 Derived: -leaf(A,B) | min_precedes(f7(A,B),A,B) | subactivity(f2(B,A),f6(A,f2(B,A))). [resolve(63,c,58,a)].
% 0.95/1.24 Derived: -leaf(A,B) | min_precedes(f7(A,B),A,B) | occurrence_of(A,f6(A,f2(B,A))). [resolve(63,c,59,a)].
% 0.95/1.24
% 0.95/1.24 ============================== end predicate elimination =============
% 0.95/1.24
% 0.95/1.24 Auto_denials: (non-Horn, no changes).
% 0.95/1.24
% 0.95/1.24 Term ordering decisions:
% 0.95/1.24
% 0.95/1.24 % Assigning unary symbol f5 kb_weight 0 and highest precedence (35).
% 0.95/1.24 Function symbol KB weights: tptp0=1. tptp1=1. tptp2=1. tptp3=1. tptp4=1. c1=1. c2=1. f1=1. f2=1. f4=1. f6=1. f7=1. f8=1. f9=1. f10=1. f13=1. f14=1. f15=1. f3=1. f11=1. f12=1. f5=0.
% 0.95/1.24
% 0.95/1.24 ============================== end of process initial clauses ========
% 0.95/1.24
% 0.95/1.24 ============================== CLAUSES FOR SEARCH ====================
% 0.95/1.24
% 0.95/1.24 ============================== end of clauses for search =============
% 0.95/1.24
% 0.95/1.24 ============================== SEARCH ================================
% 0.95/1.24
% 0.95/1.24 % Starting search at 0.03 seconds.
% 0.95/1.24
% 0.95/1.24 ============================== PROOF =================================
% 0.95/1.24 % SZS status Theorem
% 0.95/1.24 % SZS output start Refutation
% 0.95/1.24
% 0.95/1.24 % Proof 1 at 0.39 (+ 0.01) seconds.
% 0.95/1.24 % Length of proof is 102.
% 0.95/1.24 % Level of proof is 14.
% 0.95/1.24 % Maximum clause weight is 30.000.
% 0.95/1.24 % Given clauses 1033.
% 0.95/1.24
% 0.95/1.24 2 (all X3 all X4 all X5 all X6 all X7 (occurrence_of(X4,X3) & root_occ(X6,X4) & leaf_occ(X7,X4) & subactivity_occurrence(X5,X4) & min_precedes(X6,X5,X3) & X5 != X7 -> min_precedes(X5,X7,X3))) # label(sos_01) # label(axiom) # label(non_clause). [assumption].
% 0.95/1.24 7 (all X21 all X22 all X23 (min_precedes(X22,X23,X21) -> (exists X24 (occurrence_of(X24,X21) & subactivity_occurrence(X22,X24) & subactivity_occurrence(X23,X24))))) # label(sos_06) # label(axiom) # label(non_clause). [assumption].
% 0.95/1.24 16 (all X47 all X48 (leaf(X47,X48) <-> (root(X47,X48) | (exists X49 min_precedes(X49,X47,X48))) & -(exists X50 min_precedes(X47,X50,X48)))) # label(sos_15) # label(axiom) # label(non_clause). [assumption].
% 0.95/1.24 19 (all X55 all X56 (leaf_occ(X55,X56) <-> (exists X57 (occurrence_of(X56,X57) & subactivity_occurrence(X55,X56) & leaf(X55,X57))))) # label(sos_18) # label(axiom) # label(non_clause). [assumption].
% 0.95/1.24 20 (all X58 all X59 (root_occ(X58,X59) <-> (exists X60 (occurrence_of(X59,X60) & subactivity_occurrence(X58,X59) & root(X58,X60))))) # label(sos_19) # label(axiom) # label(non_clause). [assumption].
% 0.95/1.24 22 (all X63 all X64 (precedes(X63,X64) <-> earlier(X63,X64) & legal(X64))) # label(sos_21) # label(axiom) # label(non_clause). [assumption].
% 0.95/1.24 23 (all X65 all X66 all X67 (min_precedes(X65,X66,X67) -> -root(X66,X67))) # label(sos_22) # label(axiom) # label(non_clause). [assumption].
% 0.95/1.24 24 (all X68 all X69 all X70 (min_precedes(X68,X69,X70) -> (exists X71 (root(X71,X70) & min_precedes(X71,X69,X70))))) # label(sos_23) # label(axiom) # label(non_clause). [assumption].
% 0.95/1.24 25 (all X72 all X73 all X74 (min_precedes(X72,X73,X74) -> precedes(X72,X73))) # label(sos_24) # label(axiom) # label(non_clause). [assumption].
% 0.95/1.24 27 (all X78 all X79 all X80 (next_subocc(X78,X79,X80) <-> min_precedes(X78,X79,X80) & -(exists X81 (min_precedes(X78,X81,X80) & min_precedes(X81,X79,X80))))) # label(sos_26) # label(axiom) # label(non_clause). [assumption].
% 0.95/1.24 28 (all X82 all X83 all X84 all X85 (min_precedes(X82,X83,X84) & occurrence_of(X85,X84) & subactivity_occurrence(X83,X85) -> subactivity_occurrence(X82,X85))) # label(sos_27) # label(axiom) # label(non_clause). [assumption].
% 0.95/1.24 31 (all X94 all X95 all X96 (earlier(X94,X95) & earlier(X95,X96) -> earlier(X94,X96))) # label(sos_30) # label(axiom) # label(non_clause). [assumption].
% 0.95/1.24 32 (all X97 all X98 all X99 all X100 (min_precedes(X97,X98,X100) & min_precedes(X97,X99,X100) & precedes(X98,X99) -> min_precedes(X98,X99,X100))) # label(sos_31) # label(axiom) # label(non_clause). [assumption].
% 0.95/1.24 33 (all X101 all X102 (occurrence_of(X102,tptp0) & subactivity_occurrence(X101,X102) & arboreal(X101) & -leaf_occ(X101,X102) -> (exists X103 exists X104 exists X105 (occurrence_of(X103,tptp3) & next_subocc(X101,X103,tptp0) & occurrence_of(X104,tptp4) & next_subocc(X103,X104,tptp0) & (occurrence_of(X105,tptp2) | occurrence_of(X105,tptp1)) & next_subocc(X104,X105,tptp0) & leaf(X105,tptp0))))) # label(sos_32) # label(axiom) # label(non_clause). [assumption].
% 0.95/1.24 34 -(all X106 all X107 (occurrence_of(X107,tptp0) & subactivity_occurrence(X106,X107) & arboreal(X106) & -leaf_occ(X106,X107) -> (exists X108 exists X109 (occurrence_of(X108,tptp3) & next_subocc(X106,X108,tptp0) & (occurrence_of(X109,tptp2) | occurrence_of(X109,tptp1)) & min_precedes(X108,X109,tptp0) & leaf(X109,tptp0))))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.95/1.24 36 -min_precedes(A,B,C) | -root(B,C) # label(sos_22) # label(axiom). [clausify(23)].
% 0.95/1.24 41 -min_precedes(A,B,C) | root(f11(A,B,C),C) # label(sos_23) # label(axiom). [clausify(24)].
% 0.95/1.24 42 -leaf(A,B) | root(A,B) | min_precedes(f7(A,B),A,B) # label(sos_15) # label(axiom). [clausify(16)].
% 0.95/1.24 44 root_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -root(A,C) # label(sos_19) # label(axiom). [clausify(20)].
% 0.95/1.24 45 -precedes(A,B) | legal(B) # label(sos_21) # label(axiom). [clausify(22)].
% 0.95/1.24 47 precedes(A,B) | -earlier(A,B) | -legal(B) # label(sos_21) # label(axiom). [clausify(22)].
% 0.95/1.24 68 arboreal(c1) # label(goals) # label(negated_conjecture). [clausify(34)].
% 0.95/1.24 69 occurrence_of(c2,tptp0) # label(goals) # label(negated_conjecture). [clausify(34)].
% 0.95/1.24 70 subactivity_occurrence(c1,c2) # label(goals) # label(negated_conjecture). [clausify(34)].
% 0.95/1.24 78 -leaf_occ(c1,c2) # label(goals) # label(negated_conjecture). [clausify(34)].
% 0.95/1.24 83 -next_subocc(A,B,C) | -min_precedes(A,D,C) | -min_precedes(D,B,C) # label(sos_26) # label(axiom). [clausify(27)].
% 0.95/1.24 84 -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)].
% 0.95/1.24 85 -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)].
% 0.95/1.24 88 -precedes(A,B) | earlier(A,B) # label(sos_21) # label(axiom). [clausify(22)].
% 0.95/1.24 93 -min_precedes(A,B,C) | precedes(A,B) # label(sos_24) # label(axiom). [clausify(25)].
% 0.95/1.24 97 -next_subocc(A,B,C) | min_precedes(A,B,C) # label(sos_26) # label(axiom). [clausify(27)].
% 0.95/1.24 99 -earlier(A,B) | -earlier(B,C) | earlier(A,C) # label(sos_30) # label(axiom). [clausify(31)].
% 0.95/1.24 101 -min_precedes(A,B,C) | occurrence_of(f3(C,A,B),C) # label(sos_06) # label(axiom). [clausify(7)].
% 0.95/1.24 103 -min_precedes(A,B,C) | subactivity_occurrence(B,f3(C,A,B)) # label(sos_06) # label(axiom). [clausify(7)].
% 0.95/1.24 106 -min_precedes(A,B,C) | min_precedes(f11(A,B,C),B,C) # label(sos_23) # label(axiom). [clausify(24)].
% 0.95/1.24 107 leaf_occ(A,B) | -occurrence_of(B,C) | -subactivity_occurrence(A,B) | -leaf(A,C) # label(sos_18) # label(axiom). [clausify(19)].
% 0.95/1.24 110 -min_precedes(A,B,C) | -occurrence_of(D,C) | -subactivity_occurrence(B,D) | subactivity_occurrence(A,D) # label(sos_27) # label(axiom). [clausify(28)].
% 0.95/1.24 114 -min_precedes(A,B,C) | -min_precedes(A,D,C) | -precedes(B,D) | min_precedes(B,D,C) # label(sos_31) # label(axiom). [clausify(32)].
% 0.95/1.24 115 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | occurrence_of(f13(B,A),tptp3) # label(sos_32) # label(axiom). [clausify(33)].
% 0.95/1.24 117 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | leaf(f15(B,A),tptp0) # label(sos_32) # label(axiom). [clausify(33)].
% 0.95/1.24 118 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | next_subocc(B,f13(B,A),tptp0) # label(sos_32) # label(axiom). [clausify(33)].
% 0.95/1.24 120 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | next_subocc(f13(B,A),f14(B,A),tptp0) # label(sos_32) # label(axiom). [clausify(33)].
% 0.95/1.24 121 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | next_subocc(f14(B,A),f15(B,A),tptp0) # label(sos_32) # label(axiom). [clausify(33)].
% 0.95/1.24 122 -occurrence_of(A,tptp0) | -subactivity_occurrence(B,A) | -arboreal(B) | leaf_occ(B,A) | occurrence_of(f15(B,A),tptp2) | occurrence_of(f15(B,A),tptp1) # label(sos_32) # label(axiom). [clausify(33)].
% 0.95/1.24 123 -occurrence_of(A,B) | -root_occ(C,A) | -leaf_occ(D,A) | -subactivity_occurrence(E,A) | -min_precedes(C,E,B) | D = E | min_precedes(E,D,B) # label(sos_01) # label(axiom). [clausify(2)].
% 0.95/1.24 131 -leaf(A,B) | min_precedes(f7(A,B),A,B) | -min_precedes(C,A,B). [resolve(42,b,36,b)].
% 0.95/1.24 138 root_occ(f11(A,B,C),D) | -occurrence_of(D,C) | -subactivity_occurrence(f11(A,B,C),D) | -min_precedes(A,B,C). [resolve(44,d,41,b)].
% 0.95/1.24 141 precedes(A,B) | -earlier(A,B) | -precedes(C,B). [resolve(47,c,45,b)].
% 0.95/1.24 170 -min_precedes(A,B,C) | -precedes(B,B) | min_precedes(B,B,C). [factor(114,a,b)].
% 0.95/1.24 175 occurrence_of(f13(c1,c2),tptp3). [resolve(115,b,70,a),unit_del(a,69),unit_del(b,68),unit_del(c,78)].
% 0.95/1.24 177 leaf(f15(c1,c2),tptp0). [resolve(117,b,70,a),unit_del(a,69),unit_del(b,68),unit_del(c,78)].
% 0.95/1.24 178 next_subocc(c1,f13(c1,c2),tptp0). [resolve(118,b,70,a),unit_del(a,69),unit_del(b,68),unit_del(c,78)].
% 0.95/1.24 179 next_subocc(f13(c1,c2),f14(c1,c2),tptp0). [resolve(120,b,70,a),unit_del(a,69),unit_del(b,68),unit_del(c,78)].
% 0.95/1.24 180 next_subocc(f14(c1,c2),f15(c1,c2),tptp0). [resolve(121,b,70,a),unit_del(a,69),unit_del(b,68),unit_del(c,78)].
% 0.95/1.24 181 occurrence_of(f15(c1,c2),tptp2) | occurrence_of(f15(c1,c2),tptp1). [resolve(122,b,70,a),unit_del(a,69),unit_del(b,68),unit_del(c,78)].
% 0.95/1.24 239 leaf_occ(f15(c1,c2),A) | -occurrence_of(A,tptp0) | -subactivity_occurrence(f15(c1,c2),A). [resolve(177,a,107,d)].
% 0.95/1.24 250 min_precedes(c1,f13(c1,c2),tptp0). [resolve(178,a,97,a)].
% 0.95/1.24 251 -occurrence_of(A,tptp1) | -min_precedes(f13(c1,c2),A,tptp0) | -leaf(A,tptp0). [resolve(178,a,85,b),unit_del(a,175)].
% 0.95/1.24 252 -occurrence_of(A,tptp2) | -min_precedes(f13(c1,c2),A,tptp0) | -leaf(A,tptp0). [resolve(178,a,84,b),unit_del(a,175)].
% 0.95/1.24 254 min_precedes(f13(c1,c2),f14(c1,c2),tptp0). [resolve(179,a,97,a)].
% 0.95/1.24 255 -min_precedes(f13(c1,c2),A,tptp0) | -min_precedes(A,f14(c1,c2),tptp0). [resolve(179,a,83,a)].
% 0.95/1.24 257 -precedes(f13(c1,c2),f13(c1,c2)) | min_precedes(f13(c1,c2),f13(c1,c2),tptp0). [resolve(250,a,170,a)].
% 0.95/1.24 263 root_occ(f11(c1,f13(c1,c2),tptp0),A) | -occurrence_of(A,tptp0) | -subactivity_occurrence(f11(c1,f13(c1,c2),tptp0),A). [resolve(250,a,138,d)].
% 0.95/1.24 272 min_precedes(f11(c1,f13(c1,c2),tptp0),f13(c1,c2),tptp0). [resolve(250,a,106,a)].
% 0.95/1.24 276 precedes(c1,f13(c1,c2)). [resolve(250,a,93,a)].
% 0.95/1.24 280 earlier(c1,f13(c1,c2)). [resolve(276,a,88,a)].
% 0.95/1.24 282 -earlier(f13(c1,c2),A) | earlier(c1,A). [resolve(280,a,99,a)].
% 0.95/1.24 284 min_precedes(f14(c1,c2),f15(c1,c2),tptp0). [resolve(180,a,97,a)].
% 0.95/1.24 356 -min_precedes(f13(c1,c2),f13(c1,c2),tptp0). [resolve(254,a,255,b)].
% 0.95/1.24 372 -occurrence_of(A,tptp0) | -subactivity_occurrence(f14(c1,c2),A) | subactivity_occurrence(f13(c1,c2),A). [resolve(254,a,110,a)].
% 0.95/1.24 378 precedes(f13(c1,c2),f14(c1,c2)). [resolve(254,a,93,a)].
% 0.95/1.24 382 -precedes(f13(c1,c2),f13(c1,c2)). [back_unit_del(257),unit_del(b,356)].
% 0.95/1.24 384 earlier(f13(c1,c2),f14(c1,c2)). [resolve(378,a,88,a)].
% 0.95/1.24 386 -earlier(f14(c1,c2),A) | earlier(f13(c1,c2),A). [resolve(384,a,99,a)].
% 0.95/1.24 409 earlier(c1,f14(c1,c2)). [resolve(282,a,384,a)].
% 0.95/1.24 414 -earlier(f14(c1,c2),A) | earlier(c1,A). [resolve(409,a,99,a)].
% 0.95/1.24 426 min_precedes(f7(f15(c1,c2),tptp0),f15(c1,c2),tptp0). [resolve(284,a,131,c),unit_del(a,177)].
% 0.95/1.24 430 -occurrence_of(A,tptp0) | -subactivity_occurrence(f15(c1,c2),A) | subactivity_occurrence(f14(c1,c2),A). [resolve(284,a,110,a)].
% 0.95/1.24 435 precedes(f14(c1,c2),f15(c1,c2)). [resolve(284,a,93,a)].
% 0.95/1.24 440 earlier(f14(c1,c2),f15(c1,c2)). [resolve(435,a,88,a)].
% 0.95/1.24 444 earlier(c1,f15(c1,c2)). [resolve(414,a,440,a)].
% 0.95/1.24 447 precedes(c1,f15(c1,c2)) | -precedes(A,f15(c1,c2)). [resolve(444,a,141,b)].
% 0.95/1.24 538 earlier(f13(c1,c2),f15(c1,c2)). [resolve(386,a,440,a)].
% 0.95/1.24 541 precedes(f13(c1,c2),f15(c1,c2)) | -precedes(A,f15(c1,c2)). [resolve(538,a,141,b)].
% 0.95/1.24 566 subactivity_occurrence(f15(c1,c2),f3(tptp0,f7(f15(c1,c2),tptp0),f15(c1,c2))). [resolve(426,a,103,a)].
% 0.95/1.24 568 occurrence_of(f3(tptp0,f7(f15(c1,c2),tptp0),f15(c1,c2)),tptp0). [resolve(426,a,101,a)].
% 0.95/1.24 569 precedes(f7(f15(c1,c2),tptp0),f15(c1,c2)). [resolve(426,a,93,a)].
% 0.95/1.24 634 precedes(c1,f15(c1,c2)). [resolve(447,b,569,a)].
% 0.95/1.24 647 -occurrence_of(A,tptp0) | -root_occ(f11(c1,f13(c1,c2),tptp0),A) | -leaf_occ(B,A) | -subactivity_occurrence(f13(c1,c2),A) | f13(c1,c2) = B | min_precedes(f13(c1,c2),B,tptp0). [resolve(272,a,123,e),flip(e)].
% 0.95/1.24 652 -occurrence_of(A,tptp0) | -subactivity_occurrence(f13(c1,c2),A) | subactivity_occurrence(f11(c1,f13(c1,c2),tptp0),A). [resolve(272,a,110,a)].
% 0.95/1.24 759 precedes(f13(c1,c2),f15(c1,c2)). [resolve(541,b,634,a)].
% 0.95/1.24 1354 subactivity_occurrence(f14(c1,c2),f3(tptp0,f7(f15(c1,c2),tptp0),f15(c1,c2))). [resolve(566,a,430,b),unit_del(a,568)].
% 0.95/1.24 1355 leaf_occ(f15(c1,c2),f3(tptp0,f7(f15(c1,c2),tptp0),f15(c1,c2))). [resolve(566,a,239,c),unit_del(b,568)].
% 0.95/1.24 1463 subactivity_occurrence(f13(c1,c2),f3(tptp0,f7(f15(c1,c2),tptp0),f15(c1,c2))). [resolve(1354,a,372,b),unit_del(a,568)].
% 0.95/1.24 2038 subactivity_occurrence(f11(c1,f13(c1,c2),tptp0),f3(tptp0,f7(f15(c1,c2),tptp0),f15(c1,c2))). [resolve(652,b,1463,a),unit_del(a,568)].
% 0.95/1.24 2760 root_occ(f11(c1,f13(c1,c2),tptp0),f3(tptp0,f7(f15(c1,c2),tptp0),f15(c1,c2))). [resolve(2038,a,263,c),unit_del(b,568)].
% 0.95/1.24 3085 f15(c1,c2) = f13(c1,c2) | min_precedes(f13(c1,c2),f15(c1,c2),tptp0). [resolve(647,c,1355,a),flip(d),unit_del(a,568),unit_del(b,2760),unit_del(c,1463)].
% 0.95/1.24 3113 f15(c1,c2) = f13(c1,c2) | -occurrence_of(f15(c1,c2),tptp2). [resolve(3085,b,252,b),unit_del(c,177)].
% 0.95/1.24 3114 f15(c1,c2) = f13(c1,c2) | -occurrence_of(f15(c1,c2),tptp1). [resolve(3085,b,251,b),unit_del(c,177)].
% 0.95/1.24 3133 f15(c1,c2) = f13(c1,c2) | occurrence_of(f15(c1,c2),tptp1). [resolve(3113,b,181,a)].
% 0.95/1.24 3136 f15(c1,c2) = f13(c1,c2). [resolve(3133,b,3114,b),merge(b)].
% 0.95/1.24 3712 $F. [back_rewrite(759),rewrite([3136(6)]),unit_del(a,382)].
% 0.95/1.24
% 0.95/1.24 % SZS output end Refutation
% 0.95/1.24 ============================== end of proof ==========================
% 0.95/1.24
% 0.95/1.24 ============================== STATISTICS ============================
% 0.95/1.24
% 0.95/1.24 Given=1033. Generated=5692. Kept=3648. proofs=1.
% 0.95/1.24 Usable=861. Sos=1322. Demods=14. Limbo=576, Disabled=1025. Hints=0.
% 0.95/1.24 Megabytes=7.29.
% 0.95/1.24 User_CPU=0.39, System_CPU=0.01, Wall_clock=0.
% 0.95/1.24
% 0.95/1.24 ============================== end of statistics =====================
% 0.95/1.24
% 0.95/1.24 ============================== end of search =========================
% 0.95/1.24
% 0.95/1.24 THEOREM PROVED
% 0.95/1.24 % SZS status Theorem
% 0.95/1.24
% 0.95/1.24 Exiting with 1 proof.
% 0.95/1.24
% 0.95/1.24 Process 4343 exit (max_proofs) Mon Jun 13 02:15:42 2022
% 0.95/1.24 Prover9 interrupted
%------------------------------------------------------------------------------