TSTP Solution File: PRO011+4 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : PRO011+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n021.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  : 300s
% DateTime : Wed Jul 27 13:10:58 EDT 2022

% Result   : Theorem 3.07s 3.24s
% Output   : Refutation 3.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   15 (   8 unt;   2 nHn;  13 RR)
%            Number of literals    :   24 (   2 equ;   8 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   2 con; 0-2 aty)
%            Number of variables   :   14 (   1 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(15,axiom,
    ( ~ occurrence_of(A,B)
    | ~ occurrence_of(A,C)
    | B = C ),
    file('PRO011+4.p',unknown),
    [] ).

cnf(28,axiom,
    ( ~ leaf(A,B)
    | ~ min_precedes(A,C,B) ),
    file('PRO011+4.p',unknown),
    [] ).

cnf(34,axiom,
    ( ~ leaf_occ(A,B)
    | occurrence_of(B,dollar_f9(A,B)) ),
    file('PRO011+4.p',unknown),
    [] ).

cnf(36,axiom,
    ( ~ leaf_occ(A,B)
    | leaf(A,dollar_f9(A,B)) ),
    file('PRO011+4.p',unknown),
    [] ).

cnf(67,axiom,
    ( ~ occurrence_of(A,tptp0)
    | leaf_occ(dollar_f13(A),A) ),
    file('PRO011+4.p',unknown),
    [] ).

cnf(91,axiom,
    ( ~ leaf_occ(A,dollar_c1)
    | min_precedes(B,dollar_f16(B,A),tptp0)
    | min_precedes(B,dollar_f17(B,A),tptp0) ),
    file('PRO011+4.p',unknown),
    [] ).

cnf(105,axiom,
    occurrence_of(dollar_c1,tptp0),
    file('PRO011+4.p',unknown),
    [] ).

cnf(139,plain,
    leaf_occ(dollar_f13(dollar_c1),dollar_c1),
    inference(hyper,[status(thm)],[105,67]),
    [iquote('hyper,105,67')] ).

cnf(178,plain,
    ( min_precedes(A,dollar_f16(A,dollar_f13(dollar_c1)),tptp0)
    | min_precedes(A,dollar_f17(A,dollar_f13(dollar_c1)),tptp0) ),
    inference(hyper,[status(thm)],[139,91]),
    [iquote('hyper,139,91')] ).

cnf(193,plain,
    leaf(dollar_f13(dollar_c1),dollar_f9(dollar_f13(dollar_c1),dollar_c1)),
    inference(hyper,[status(thm)],[139,36]),
    [iquote('hyper,139,36')] ).

cnf(195,plain,
    occurrence_of(dollar_c1,dollar_f9(dollar_f13(dollar_c1),dollar_c1)),
    inference(hyper,[status(thm)],[139,34]),
    [iquote('hyper,139,34')] ).

cnf(846,plain,
    dollar_f9(dollar_f13(dollar_c1),dollar_c1) = tptp0,
    inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[195,15,105])]),
    [iquote('hyper,195,15,105,flip.1')] ).

cnf(847,plain,
    leaf(dollar_f13(dollar_c1),tptp0),
    inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[193]),846]),
    [iquote('back_demod,193,demod,846')] ).

cnf(1819,plain,
    min_precedes(dollar_f13(dollar_c1),dollar_f17(dollar_f13(dollar_c1),dollar_f13(dollar_c1)),tptp0),
    inference(hyper,[status(thm)],[178,28,847]),
    [iquote('hyper,178,28,847')] ).

cnf(1822,plain,
    $false,
    inference(hyper,[status(thm)],[1819,28,847]),
    [iquote('hyper,1819,28,847')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : PRO011+4 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n021.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Wed Jul 27 04:52:38 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.92/2.09  ----- Otter 3.3f, August 2004 -----
% 1.92/2.09  The process was started by sandbox2 on n021.cluster.edu,
% 1.92/2.09  Wed Jul 27 04:52:38 2022
% 1.92/2.09  The command was "./otter".  The process ID is 14069.
% 1.92/2.09  
% 1.92/2.09  set(prolog_style_variables).
% 1.92/2.09  set(auto).
% 1.92/2.09     dependent: set(auto1).
% 1.92/2.09     dependent: set(process_input).
% 1.92/2.09     dependent: clear(print_kept).
% 1.92/2.09     dependent: clear(print_new_demod).
% 1.92/2.09     dependent: clear(print_back_demod).
% 1.92/2.09     dependent: clear(print_back_sub).
% 1.92/2.09     dependent: set(control_memory).
% 1.92/2.09     dependent: assign(max_mem, 12000).
% 1.92/2.09     dependent: assign(pick_given_ratio, 4).
% 1.92/2.09     dependent: assign(stats_level, 1).
% 1.92/2.09     dependent: assign(max_seconds, 10800).
% 1.92/2.09  clear(print_given).
% 1.92/2.09  
% 1.92/2.09  formula_list(usable).
% 1.92/2.09  all A (A=A).
% 1.92/2.09  all X0 X1 (occurrence_of(X1,X0)& -atomic(X0)-> (exists X2 (root(X2,X0)&subactivity_occurrence(X2,X1)))).
% 1.92/2.09  all X3 X4 X5 X6 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)).
% 1.92/2.09  all X8 X9 X10 X11 (occurrence_of(X9,X8)&subactivity_occurrence(X10,X9)&leaf_occ(X11,X9)&arboreal(X10)& -min_precedes(X10,X11,X8)->X11=X10).
% 1.92/2.09  all X12 X13 (occurrence_of(X13,X12)->activity(X12)&activity_occurrence(X13)).
% 1.92/2.09  all X14 X15 X16 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).
% 1.92/2.09  all X18 X19 (root(X19,X18)-> (exists X20 (subactivity(X20,X18)&atocc(X19,X20)))).
% 1.92/2.09  all X21 X22 X23 (min_precedes(X22,X23,X21)-> (exists X24 (occurrence_of(X24,X21)&subactivity_occurrence(X22,X24)&subactivity_occurrence(X23,X24)))).
% 1.92/2.09  all X25 X26 (leaf(X25,X26)& -atomic(X26)-> (exists X27 (occurrence_of(X27,X26)&leaf_occ(X25,X27)))).
% 1.92/2.09  all X28 X29 X30 (occurrence_of(X28,X29)&occurrence_of(X28,X30)->X29=X30).
% 1.92/2.09  all X31 X32 X33 (occurrence_of(X31,X33)&leaf_occ(X32,X31)-> -(exists X34 min_precedes(X32,X34,X33))).
% 1.92/2.09  all X35 X36 X37 (occurrence_of(X35,X37)&root_occ(X36,X35)-> -(exists X38 min_precedes(X38,X36,X37))).
% 1.92/2.09  all X39 X40 (subactivity_occurrence(X39,X40)->activity_occurrence(X39)&activity_occurrence(X40)).
% 1.92/2.09  all X41 (activity_occurrence(X41)-> (exists X42 (activity(X42)&occurrence_of(X41,X42)))).
% 1.92/2.09  all X43 (legal(X43)->arboreal(X43)).
% 1.92/2.09  all X44 X45 (atocc(X44,X45)<-> (exists X46 (subactivity(X45,X46)&atomic(X46)&occurrence_of(X44,X46)))).
% 1.92/2.09  all X47 X48 (leaf(X47,X48)<-> (root(X47,X48)| (exists X49 min_precedes(X49,X47,X48)))& -(exists X50 min_precedes(X47,X50,X48))).
% 1.92/2.09  all X51 X52 (occurrence_of(X51,X52)-> (arboreal(X51)<->atomic(X52))).
% 1.92/2.09  all X53 X54 (root(X53,X54)->legal(X53)).
% 1.92/2.09  all X55 X56 (leaf_occ(X55,X56)<-> (exists X57 (occurrence_of(X56,X57)&subactivity_occurrence(X55,X56)&leaf(X55,X57)))).
% 1.92/2.09  all X58 X59 (root_occ(X58,X59)<-> (exists X60 (occurrence_of(X59,X60)&subactivity_occurrence(X58,X59)&root(X58,X60)))).
% 1.92/2.09  all X61 X62 (earlier(X61,X62)-> -earlier(X62,X61)).
% 1.92/2.09  all X63 X64 (precedes(X63,X64)<->earlier(X63,X64)&legal(X64)).
% 1.92/2.09  all X65 X66 X67 (min_precedes(X65,X66,X67)-> -root(X66,X67)).
% 1.92/2.09  all X68 X69 X70 (min_precedes(X68,X69,X70)-> (exists X71 (root(X71,X70)&min_precedes(X71,X69,X70)))).
% 1.92/2.09  all X72 X73 X74 (min_precedes(X72,X73,X74)->precedes(X72,X73)).
% 1.92/2.09  all X75 X76 X77 (next_subocc(X75,X76,X77)->arboreal(X75)&arboreal(X76)).
% 1.92/2.09  all X78 X79 X80 (next_subocc(X78,X79,X80)<->min_precedes(X78,X79,X80)& -(exists X81 (min_precedes(X78,X81,X80)&min_precedes(X81,X79,X80)))).
% 1.92/2.09  all X82 X83 X84 X85 (min_precedes(X82,X83,X84)&occurrence_of(X85,X84)&subactivity_occurrence(X83,X85)->subactivity_occurrence(X82,X85)).
% 1.92/2.09  all X86 X87 X88 X89 (occurrence_of(X88,X89)& -atomic(X89)&leaf_occ(X86,X88)&leaf_occ(X87,X88)->X86=X87).
% 1.92/2.09  all X90 X91 X92 X93 (occurrence_of(X92,X93)&root_occ(X90,X92)&root_occ(X91,X92)->X90=X91).
% 1.92/2.09  all X94 X95 X96 (earlier(X94,X95)&earlier(X95,X96)->earlier(X94,X96)).
% 1.92/2.09  all X97 X98 X99 X100 (min_precedes(X97,X98,X100)&min_precedes(X97,X99,X100)&precedes(X98,X99)->min_precedes(X98,X99,X100)).
% 1.92/2.09  all X101 (occurrence_of(X101,tptp0)-> (exists X102 X103 X104 (occurrence_of(X102,tptp3)&root_occ(X102,X101)&occurrence_of(X103,tptp4)&next_subocc(X102,X103,tptp0)& (occurrence_of(X104,tptp1)|occurrence_of(X104,tptp2))&next_subocc(X103,X104,tptp0)&leaf_occ(X104,X101)))).
% 1.92/2.09  activity(tptp0).
% 1.92/2.09  -atomic(tptp0).
% 1.92/2.09  atomic(tptp4).
% 1.92/2.09  atomic(tptp1).
% 1.92/2.09  atomic(tptp2).
% 1.92/2.09  atomic(tptp3).
% 1.92/2.09  tptp4!=tptp3.
% 1.92/2.09  tptp4!=tptp1.
% 1.92/2.09  tptp4!=tptp2.
% 1.92/2.09  tptp3!=tptp1.
% 1.92/2.09  tptp3!=tptp2.
% 1.92/2.09  tptp1!=tptp2.
% 1.92/2.09  -(all X105 (occurrence_of(X105,tptp0)-> (exists X106 X107 (leaf_occ(X107,X105)& (occurrence_of(X107,tptp1)-> -(exists X108 (occurrence_of(X108,tptp2)&subactivity_occurrence(X108,X105)&min_precedes(X106,X108,tptp0))))& (occurrence_of(X107,tptp2)-> -(exists X109 (occurrence_of(X109,tptp1)&subactivity_occurrence(X109,X105)&min_precedes(X106,X109,tptp0)))))))).
% 1.92/2.09  end_of_list.
% 1.92/2.09  
% 1.92/2.09  -------> usable clausifies to:
% 1.92/2.09  
% 1.92/2.09  list(usable).
% 1.92/2.09  0 [] A=A.
% 1.92/2.09  0 [] -occurrence_of(X1,X0)|atomic(X0)|root($f1(X0,X1),X0).
% 1.92/2.09  0 [] -occurrence_of(X1,X0)|atomic(X0)|subactivity_occurrence($f1(X0,X1),X1).
% 1.92/2.09  0 [] -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).
% 1.92/2.09  0 [] -occurrence_of(X9,X8)| -subactivity_occurrence(X10,X9)| -leaf_occ(X11,X9)| -arboreal(X10)|min_precedes(X10,X11,X8)|X11=X10.
% 1.92/2.09  0 [] -occurrence_of(X13,X12)|activity(X12).
% 1.92/2.09  0 [] -occurrence_of(X13,X12)|activity_occurrence(X13).
% 1.92/2.09  0 [] -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.
% 1.92/2.09  0 [] -root(X19,X18)|subactivity($f2(X18,X19),X18).
% 1.92/2.09  0 [] -root(X19,X18)|atocc(X19,$f2(X18,X19)).
% 1.92/2.09  0 [] -min_precedes(X22,X23,X21)|occurrence_of($f3(X21,X22,X23),X21).
% 1.92/2.09  0 [] -min_precedes(X22,X23,X21)|subactivity_occurrence(X22,$f3(X21,X22,X23)).
% 1.92/2.09  0 [] -min_precedes(X22,X23,X21)|subactivity_occurrence(X23,$f3(X21,X22,X23)).
% 1.92/2.09  0 [] -leaf(X25,X26)|atomic(X26)|occurrence_of($f4(X25,X26),X26).
% 1.92/2.09  0 [] -leaf(X25,X26)|atomic(X26)|leaf_occ(X25,$f4(X25,X26)).
% 1.92/2.09  0 [] -occurrence_of(X28,X29)| -occurrence_of(X28,X30)|X29=X30.
% 1.92/2.09  0 [] -occurrence_of(X31,X33)| -leaf_occ(X32,X31)| -min_precedes(X32,X34,X33).
% 1.92/2.09  0 [] -occurrence_of(X35,X37)| -root_occ(X36,X35)| -min_precedes(X38,X36,X37).
% 1.92/2.09  0 [] -subactivity_occurrence(X39,X40)|activity_occurrence(X39).
% 1.92/2.09  0 [] -subactivity_occurrence(X39,X40)|activity_occurrence(X40).
% 1.92/2.09  0 [] -activity_occurrence(X41)|activity($f5(X41)).
% 1.92/2.09  0 [] -activity_occurrence(X41)|occurrence_of(X41,$f5(X41)).
% 1.92/2.09  0 [] -legal(X43)|arboreal(X43).
% 1.92/2.09  0 [] -atocc(X44,X45)|subactivity(X45,$f6(X44,X45)).
% 1.92/2.09  0 [] -atocc(X44,X45)|atomic($f6(X44,X45)).
% 1.92/2.09  0 [] -atocc(X44,X45)|occurrence_of(X44,$f6(X44,X45)).
% 1.92/2.09  0 [] atocc(X44,X45)| -subactivity(X45,X46)| -atomic(X46)| -occurrence_of(X44,X46).
% 1.92/2.09  0 [] -leaf(X47,X48)|root(X47,X48)|min_precedes($f7(X47,X48),X47,X48).
% 1.92/2.09  0 [] -leaf(X47,X48)| -min_precedes(X47,X50,X48).
% 1.92/2.09  0 [] leaf(X47,X48)| -root(X47,X48)|min_precedes(X47,$f8(X47,X48),X48).
% 1.92/2.09  0 [] leaf(X47,X48)| -min_precedes(X49,X47,X48)|min_precedes(X47,$f8(X47,X48),X48).
% 1.92/2.09  0 [] -occurrence_of(X51,X52)| -arboreal(X51)|atomic(X52).
% 1.92/2.09  0 [] -occurrence_of(X51,X52)|arboreal(X51)| -atomic(X52).
% 1.92/2.09  0 [] -root(X53,X54)|legal(X53).
% 1.92/2.09  0 [] -leaf_occ(X55,X56)|occurrence_of(X56,$f9(X55,X56)).
% 1.92/2.09  0 [] -leaf_occ(X55,X56)|subactivity_occurrence(X55,X56).
% 1.92/2.09  0 [] -leaf_occ(X55,X56)|leaf(X55,$f9(X55,X56)).
% 1.92/2.09  0 [] leaf_occ(X55,X56)| -occurrence_of(X56,X57)| -subactivity_occurrence(X55,X56)| -leaf(X55,X57).
% 1.92/2.09  0 [] -root_occ(X58,X59)|occurrence_of(X59,$f10(X58,X59)).
% 1.92/2.09  0 [] -root_occ(X58,X59)|subactivity_occurrence(X58,X59).
% 1.92/2.09  0 [] -root_occ(X58,X59)|root(X58,$f10(X58,X59)).
% 1.92/2.09  0 [] root_occ(X58,X59)| -occurrence_of(X59,X60)| -subactivity_occurrence(X58,X59)| -root(X58,X60).
% 1.92/2.09  0 [] -earlier(X61,X62)| -earlier(X62,X61).
% 1.92/2.09  0 [] -precedes(X63,X64)|earlier(X63,X64).
% 1.92/2.09  0 [] -precedes(X63,X64)|legal(X64).
% 1.92/2.09  0 [] precedes(X63,X64)| -earlier(X63,X64)| -legal(X64).
% 1.92/2.09  0 [] -min_precedes(X65,X66,X67)| -root(X66,X67).
% 1.92/2.09  0 [] -min_precedes(X68,X69,X70)|root($f11(X68,X69,X70),X70).
% 1.92/2.09  0 [] -min_precedes(X68,X69,X70)|min_precedes($f11(X68,X69,X70),X69,X70).
% 1.92/2.09  0 [] -min_precedes(X72,X73,X74)|precedes(X72,X73).
% 1.92/2.09  0 [] -next_subocc(X75,X76,X77)|arboreal(X75).
% 1.92/2.09  0 [] -next_subocc(X75,X76,X77)|arboreal(X76).
% 1.92/2.09  0 [] -next_subocc(X78,X79,X80)|min_precedes(X78,X79,X80).
% 1.92/2.09  0 [] -next_subocc(X78,X79,X80)| -min_precedes(X78,X81,X80)| -min_precedes(X81,X79,X80).
% 1.92/2.09  0 [] next_subocc(X78,X79,X80)| -min_precedes(X78,X79,X80)|min_precedes(X78,$f12(X78,X79,X80),X80).
% 1.92/2.09  0 [] next_subocc(X78,X79,X80)| -min_precedes(X78,X79,X80)|min_precedes($f12(X78,X79,X80),X79,X80).
% 1.92/2.09  0 [] -min_precedes(X82,X83,X84)| -occurrence_of(X85,X84)| -subactivity_occurrence(X83,X85)|subactivity_occurrence(X82,X85).
% 1.92/2.09  0 [] -occurrence_of(X88,X89)|atomic(X89)| -leaf_occ(X86,X88)| -leaf_occ(X87,X88)|X86=X87.
% 1.92/2.09  0 [] -occurrence_of(X92,X93)| -root_occ(X90,X92)| -root_occ(X91,X92)|X90=X91.
% 1.92/2.09  0 [] -earlier(X94,X95)| -earlier(X95,X96)|earlier(X94,X96).
% 1.92/2.09  0 [] -min_precedes(X97,X98,X100)| -min_precedes(X97,X99,X100)| -precedes(X98,X99)|min_precedes(X98,X99,X100).
% 1.92/2.09  0 [] -occurrence_of(X101,tptp0)|occurrence_of($f15(X101),tptp3).
% 1.92/2.09  0 [] -occurrence_of(X101,tptp0)|root_occ($f15(X101),X101).
% 1.92/2.09  0 [] -occurrence_of(X101,tptp0)|occurrence_of($f14(X101),tptp4).
% 1.92/2.09  0 [] -occurrence_of(X101,tptp0)|next_subocc($f15(X101),$f14(X101),tptp0).
% 1.92/2.09  0 [] -occurrence_of(X101,tptp0)|occurrence_of($f13(X101),tptp1)|occurrence_of($f13(X101),tptp2).
% 1.92/2.09  0 [] -occurrence_of(X101,tptp0)|next_subocc($f14(X101),$f13(X101),tptp0).
% 1.92/2.09  0 [] -occurrence_of(X101,tptp0)|leaf_occ($f13(X101),X101).
% 1.92/2.09  0 [] activity(tptp0).
% 1.92/2.09  0 [] -atomic(tptp0).
% 1.92/2.09  0 [] atomic(tptp4).
% 1.92/2.09  0 [] atomic(tptp1).
% 1.92/2.09  0 [] atomic(tptp2).
% 1.92/2.09  0 [] atomic(tptp3).
% 1.92/2.09  0 [] tptp4!=tptp3.
% 1.92/2.09  0 [] tptp4!=tptp1.
% 1.92/2.09  0 [] tptp4!=tptp2.
% 1.92/2.09  0 [] tptp3!=tptp1.
% 1.92/2.09  0 [] tptp3!=tptp2.
% 1.92/2.09  0 [] tptp1!=tptp2.
% 1.92/2.09  0 [] occurrence_of($c1,tptp0).
% 1.92/2.09  0 [] -leaf_occ(X107,$c1)|occurrence_of(X107,tptp1)|occurrence_of(X107,tptp2).
% 1.92/2.09  0 [] -leaf_occ(X107,$c1)|occurrence_of(X107,tptp1)|occurrence_of($f17(X106,X107),tptp1).
% 1.92/2.09  0 [] -leaf_occ(X107,$c1)|occurrence_of(X107,tptp1)|subactivity_occurrence($f17(X106,X107),$c1).
% 1.92/2.09  0 [] -leaf_occ(X107,$c1)|occurrence_of(X107,tptp1)|min_precedes(X106,$f17(X106,X107),tptp0).
% 1.92/2.09  0 [] -leaf_occ(X107,$c1)|occurrence_of($f16(X106,X107),tptp2)|occurrence_of(X107,tptp2).
% 1.92/2.09  0 [] -leaf_occ(X107,$c1)|occurrence_of($f16(X106,X107),tptp2)|occurrence_of($f17(X106,X107),tptp1).
% 1.92/2.09  0 [] -leaf_occ(X107,$c1)|occurrence_of($f16(X106,X107),tptp2)|subactivity_occurrence($f17(X106,X107),$c1).
% 1.92/2.09  0 [] -leaf_occ(X107,$c1)|occurrence_of($f16(X106,X107),tptp2)|min_precedes(X106,$f17(X106,X107),tptp0).
% 1.92/2.09  0 [] -leaf_occ(X107,$c1)|subactivity_occurrence($f16(X106,X107),$c1)|occurrence_of(X107,tptp2).
% 1.92/2.09  0 [] -leaf_occ(X107,$c1)|subactivity_occurrence($f16(X106,X107),$c1)|occurrence_of($f17(X106,X107),tptp1).
% 1.92/2.09  0 [] -leaf_occ(X107,$c1)|subactivity_occurrence($f16(X106,X107),$c1)|subactivity_occurrence($f17(X106,X107),$c1).
% 1.92/2.09  0 [] -leaf_occ(X107,$c1)|subactivity_occurrence($f16(X106,X107),$c1)|min_precedes(X106,$f17(X106,X107),tptp0).
% 1.92/2.09  0 [] -leaf_occ(X107,$c1)|min_precedes(X106,$f16(X106,X107),tptp0)|occurrence_of(X107,tptp2).
% 1.92/2.09  0 [] -leaf_occ(X107,$c1)|min_precedes(X106,$f16(X106,X107),tptp0)|occurrence_of($f17(X106,X107),tptp1).
% 1.92/2.09  0 [] -leaf_occ(X107,$c1)|min_precedes(X106,$f16(X106,X107),tptp0)|subactivity_occurrence($f17(X106,X107),$c1).
% 1.92/2.09  0 [] -leaf_occ(X107,$c1)|min_precedes(X106,$f16(X106,X107),tptp0)|min_precedes(X106,$f17(X106,X107),tptp0).
% 1.92/2.09  end_of_list.
% 1.92/2.09  
% 1.92/2.09  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 1.92/2.09  
% 1.92/2.09  This ia a non-Horn set with equality.  The strategy will be
% 1.92/2.09  Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.92/2.09  deletion, with positive clauses in sos and nonpositive
% 1.92/2.09  clauses in usable.
% 1.92/2.09  
% 1.92/2.09     dependent: set(knuth_bendix).
% 1.92/2.09     dependent: set(anl_eq).
% 1.92/2.09     dependent: set(para_from).
% 1.92/2.09     dependent: set(para_into).
% 1.92/2.09     dependent: clear(para_from_right).
% 1.92/2.09     dependent: clear(para_into_right).
% 1.92/2.09     dependent: set(para_from_vars).
% 1.92/2.09     dependent: set(eq_units_both_ways).
% 1.92/2.09     dependent: set(dynamic_demod_all).
% 1.92/2.09     dependent: set(dynamic_demod).
% 1.92/2.09     dependent: set(order_eq).
% 1.92/2.09     dependent: set(back_demod).
% 1.92/2.09     dependent: set(lrpo).
% 1.92/2.09     dependent: set(hyper_res).
% 1.92/2.09     dependent: set(unit_deletion).
% 1.92/2.09     dependent: set(factor).
% 1.92/2.09  
% 1.92/2.09  ------------> process usable:
% 1.92/2.09  ** KEPT (pick-wt=10): 1 [] -occurrence_of(A,B)|atomic(B)|root($f1(B,A),B).
% 1.92/2.09  ** KEPT (pick-wt=10): 2 [] -occurrence_of(A,B)|atomic(B)|subactivity_occurrence($f1(B,A),A).
% 1.92/2.09  ** KEPT (pick-wt=23): 3 [] -occurrence_of(A,B)| -root_occ(C,A)| -leaf_occ(D,A)| -subactivity_occurrence(E,A)| -min_precedes(C,E,B)|E=D|min_precedes(E,D,B).
% 1.92/2.10  ** KEPT (pick-wt=18): 4 [] -occurrence_of(A,B)| -subactivity_occurrence(C,A)| -leaf_occ(D,A)| -arboreal(C)|min_precedes(C,D,B)|D=C.
% 1.92/2.10  ** KEPT (pick-wt=5): 5 [] -occurrence_of(A,B)|activity(B).
% 1.92/2.10  ** KEPT (pick-wt=5): 6 [] -occurrence_of(A,B)|activity_occurrence(A).
% 1.92/2.10  ** KEPT (pick-wt=24): 7 [] -occurrence_of(A,B)| -arboreal(C)| -arboreal(D)| -subactivity_occurrence(C,A)| -subactivity_occurrence(D,A)|min_precedes(C,D,B)|min_precedes(D,C,B)|C=D.
% 1.92/2.10  ** KEPT (pick-wt=8): 8 [] -root(A,B)|subactivity($f2(B,A),B).
% 1.92/2.10  ** KEPT (pick-wt=8): 9 [] -root(A,B)|atocc(A,$f2(B,A)).
% 1.92/2.10  ** KEPT (pick-wt=10): 10 [] -min_precedes(A,B,C)|occurrence_of($f3(C,A,B),C).
% 1.92/2.10  ** KEPT (pick-wt=10): 11 [] -min_precedes(A,B,C)|subactivity_occurrence(A,$f3(C,A,B)).
% 1.92/2.10  ** KEPT (pick-wt=10): 12 [] -min_precedes(A,B,C)|subactivity_occurrence(B,$f3(C,A,B)).
% 1.92/2.10  ** KEPT (pick-wt=10): 13 [] -leaf(A,B)|atomic(B)|occurrence_of($f4(A,B),B).
% 1.92/2.10  ** KEPT (pick-wt=10): 14 [] -leaf(A,B)|atomic(B)|leaf_occ(A,$f4(A,B)).
% 1.92/2.10  ** KEPT (pick-wt=9): 15 [] -occurrence_of(A,B)| -occurrence_of(A,C)|B=C.
% 1.92/2.10  ** KEPT (pick-wt=10): 16 [] -occurrence_of(A,B)| -leaf_occ(C,A)| -min_precedes(C,D,B).
% 1.92/2.10  ** KEPT (pick-wt=10): 17 [] -occurrence_of(A,B)| -root_occ(C,A)| -min_precedes(D,C,B).
% 1.92/2.10  ** KEPT (pick-wt=5): 18 [] -subactivity_occurrence(A,B)|activity_occurrence(A).
% 1.92/2.10  ** KEPT (pick-wt=5): 19 [] -subactivity_occurrence(A,B)|activity_occurrence(B).
% 1.92/2.10  ** KEPT (pick-wt=5): 20 [] -activity_occurrence(A)|activity($f5(A)).
% 1.92/2.10  ** KEPT (pick-wt=6): 21 [] -activity_occurrence(A)|occurrence_of(A,$f5(A)).
% 1.92/2.10  ** KEPT (pick-wt=4): 22 [] -legal(A)|arboreal(A).
% 1.92/2.10  ** KEPT (pick-wt=8): 23 [] -atocc(A,B)|subactivity(B,$f6(A,B)).
% 1.92/2.10  ** KEPT (pick-wt=7): 24 [] -atocc(A,B)|atomic($f6(A,B)).
% 1.92/2.10  ** KEPT (pick-wt=8): 25 [] -atocc(A,B)|occurrence_of(A,$f6(A,B)).
% 1.92/2.10  ** KEPT (pick-wt=11): 26 [] atocc(A,B)| -subactivity(B,C)| -atomic(C)| -occurrence_of(A,C).
% 1.92/2.10  ** KEPT (pick-wt=12): 27 [] -leaf(A,B)|root(A,B)|min_precedes($f7(A,B),A,B).
% 1.92/2.10  ** KEPT (pick-wt=7): 28 [] -leaf(A,B)| -min_precedes(A,C,B).
% 1.92/2.10  ** KEPT (pick-wt=12): 29 [] leaf(A,B)| -root(A,B)|min_precedes(A,$f8(A,B),B).
% 1.92/2.10  ** KEPT (pick-wt=13): 30 [] leaf(A,B)| -min_precedes(C,A,B)|min_precedes(A,$f8(A,B),B).
% 1.92/2.10  ** KEPT (pick-wt=7): 31 [] -occurrence_of(A,B)| -arboreal(A)|atomic(B).
% 1.92/2.10  ** KEPT (pick-wt=7): 32 [] -occurrence_of(A,B)|arboreal(A)| -atomic(B).
% 1.92/2.10  ** KEPT (pick-wt=5): 33 [] -root(A,B)|legal(A).
% 1.92/2.10  ** KEPT (pick-wt=8): 34 [] -leaf_occ(A,B)|occurrence_of(B,$f9(A,B)).
% 1.92/2.10  ** KEPT (pick-wt=6): 35 [] -leaf_occ(A,B)|subactivity_occurrence(A,B).
% 1.92/2.10  ** KEPT (pick-wt=8): 36 [] -leaf_occ(A,B)|leaf(A,$f9(A,B)).
% 1.92/2.10  ** KEPT (pick-wt=12): 37 [] leaf_occ(A,B)| -occurrence_of(B,C)| -subactivity_occurrence(A,B)| -leaf(A,C).
% 1.92/2.10  ** KEPT (pick-wt=8): 38 [] -root_occ(A,B)|occurrence_of(B,$f10(A,B)).
% 1.92/2.10  ** KEPT (pick-wt=6): 39 [] -root_occ(A,B)|subactivity_occurrence(A,B).
% 1.92/2.10  ** KEPT (pick-wt=8): 40 [] -root_occ(A,B)|root(A,$f10(A,B)).
% 1.92/2.10  ** KEPT (pick-wt=12): 41 [] root_occ(A,B)| -occurrence_of(B,C)| -subactivity_occurrence(A,B)| -root(A,C).
% 1.92/2.10  ** KEPT (pick-wt=6): 42 [] -earlier(A,B)| -earlier(B,A).
% 1.92/2.10  ** KEPT (pick-wt=6): 43 [] -precedes(A,B)|earlier(A,B).
% 1.92/2.10  ** KEPT (pick-wt=5): 44 [] -precedes(A,B)|legal(B).
% 1.92/2.10  ** KEPT (pick-wt=8): 45 [] precedes(A,B)| -earlier(A,B)| -legal(B).
% 1.92/2.10  ** KEPT (pick-wt=7): 46 [] -min_precedes(A,B,C)| -root(B,C).
% 1.92/2.10  ** KEPT (pick-wt=10): 47 [] -min_precedes(A,B,C)|root($f11(A,B,C),C).
% 1.92/2.10  ** KEPT (pick-wt=11): 48 [] -min_precedes(A,B,C)|min_precedes($f11(A,B,C),B,C).
% 1.92/2.10  ** KEPT (pick-wt=7): 49 [] -min_precedes(A,B,C)|precedes(A,B).
% 1.92/2.10  ** KEPT (pick-wt=6): 50 [] -next_subocc(A,B,C)|arboreal(A).
% 1.92/2.10  ** KEPT (pick-wt=6): 51 [] -next_subocc(A,B,C)|arboreal(B).
% 1.92/2.10  ** KEPT (pick-wt=8): 52 [] -next_subocc(A,B,C)|min_precedes(A,B,C).
% 1.92/2.10  ** KEPT (pick-wt=12): 53 [] -next_subocc(A,B,C)| -min_precedes(A,D,C)| -min_precedes(D,B,C).
% 1.92/2.10  ** KEPT (pick-wt=15): 54 [] next_subocc(A,B,C)| -min_precedes(A,B,C)|min_precedes(A,$f12(A,B,C),C).
% 1.92/2.10  ** KEPT (pick-wt=15): 55 [] next_subocc(A,B,C)| -min_precedes(A,B,C)|min_precedes($f12(A,B,C),B,C).
% 1.92/2.10  ** KEPT (pick-wt=13): 56 [] -min_precedes(A,B,C)| -occurrence_of(D,C)| -subactivity_occurrence(B,D)|subactivity_occurrence(A,D).
% 3.07/3.24  ** KEPT (pick-wt=14): 57 [] -occurrence_of(A,B)|atomic(B)| -leaf_occ(C,A)| -leaf_occ(D,A)|C=D.
% 3.07/3.24  ** KEPT (pick-wt=12): 58 [] -occurrence_of(A,B)| -root_occ(C,A)| -root_occ(D,A)|C=D.
% 3.07/3.24  ** KEPT (pick-wt=9): 59 [] -earlier(A,B)| -earlier(B,C)|earlier(A,C).
% 3.07/3.24  ** KEPT (pick-wt=15): 60 [] -min_precedes(A,B,C)| -min_precedes(A,D,C)| -precedes(B,D)|min_precedes(B,D,C).
% 3.07/3.24  ** KEPT (pick-wt=7): 61 [] -occurrence_of(A,tptp0)|occurrence_of($f15(A),tptp3).
% 3.07/3.24  ** KEPT (pick-wt=7): 62 [] -occurrence_of(A,tptp0)|root_occ($f15(A),A).
% 3.07/3.24  ** KEPT (pick-wt=7): 63 [] -occurrence_of(A,tptp0)|occurrence_of($f14(A),tptp4).
% 3.07/3.24  ** KEPT (pick-wt=9): 64 [] -occurrence_of(A,tptp0)|next_subocc($f15(A),$f14(A),tptp0).
% 3.07/3.24  ** KEPT (pick-wt=11): 65 [] -occurrence_of(A,tptp0)|occurrence_of($f13(A),tptp1)|occurrence_of($f13(A),tptp2).
% 3.07/3.24  ** KEPT (pick-wt=9): 66 [] -occurrence_of(A,tptp0)|next_subocc($f14(A),$f13(A),tptp0).
% 3.07/3.24  ** KEPT (pick-wt=7): 67 [] -occurrence_of(A,tptp0)|leaf_occ($f13(A),A).
% 3.07/3.24  ** KEPT (pick-wt=2): 68 [] -atomic(tptp0).
% 3.07/3.24  ** KEPT (pick-wt=3): 69 [] tptp4!=tptp3.
% 3.07/3.24  ** KEPT (pick-wt=3): 70 [] tptp4!=tptp1.
% 3.07/3.24  ** KEPT (pick-wt=3): 71 [] tptp4!=tptp2.
% 3.07/3.24  ** KEPT (pick-wt=3): 72 [] tptp3!=tptp1.
% 3.07/3.24  ** KEPT (pick-wt=3): 73 [] tptp3!=tptp2.
% 3.07/3.24  ** KEPT (pick-wt=3): 75 [copy,74,flip.1] tptp2!=tptp1.
% 3.07/3.24  ** KEPT (pick-wt=9): 76 [] -leaf_occ(A,$c1)|occurrence_of(A,tptp1)|occurrence_of(A,tptp2).
% 3.07/3.24  ** KEPT (pick-wt=11): 77 [] -leaf_occ(A,$c1)|occurrence_of(A,tptp1)|occurrence_of($f17(B,A),tptp1).
% 3.07/3.24  ** KEPT (pick-wt=11): 78 [] -leaf_occ(A,$c1)|occurrence_of(A,tptp1)|subactivity_occurrence($f17(B,A),$c1).
% 3.07/3.24  ** KEPT (pick-wt=12): 79 [] -leaf_occ(A,$c1)|occurrence_of(A,tptp1)|min_precedes(B,$f17(B,A),tptp0).
% 3.07/3.24  ** KEPT (pick-wt=11): 80 [] -leaf_occ(A,$c1)|occurrence_of($f16(B,A),tptp2)|occurrence_of(A,tptp2).
% 3.07/3.24  ** KEPT (pick-wt=13): 81 [] -leaf_occ(A,$c1)|occurrence_of($f16(B,A),tptp2)|occurrence_of($f17(B,A),tptp1).
% 3.07/3.24  ** KEPT (pick-wt=13): 82 [] -leaf_occ(A,$c1)|occurrence_of($f16(B,A),tptp2)|subactivity_occurrence($f17(B,A),$c1).
% 3.07/3.24  ** KEPT (pick-wt=14): 83 [] -leaf_occ(A,$c1)|occurrence_of($f16(B,A),tptp2)|min_precedes(B,$f17(B,A),tptp0).
% 3.07/3.24  ** KEPT (pick-wt=11): 84 [] -leaf_occ(A,$c1)|subactivity_occurrence($f16(B,A),$c1)|occurrence_of(A,tptp2).
% 3.07/3.24  ** KEPT (pick-wt=13): 85 [] -leaf_occ(A,$c1)|subactivity_occurrence($f16(B,A),$c1)|occurrence_of($f17(B,A),tptp1).
% 3.07/3.24  ** KEPT (pick-wt=13): 86 [] -leaf_occ(A,$c1)|subactivity_occurrence($f16(B,A),$c1)|subactivity_occurrence($f17(B,A),$c1).
% 3.07/3.24  ** KEPT (pick-wt=14): 87 [] -leaf_occ(A,$c1)|subactivity_occurrence($f16(B,A),$c1)|min_precedes(B,$f17(B,A),tptp0).
% 3.07/3.24  ** KEPT (pick-wt=12): 88 [] -leaf_occ(A,$c1)|min_precedes(B,$f16(B,A),tptp0)|occurrence_of(A,tptp2).
% 3.07/3.24  ** KEPT (pick-wt=14): 89 [] -leaf_occ(A,$c1)|min_precedes(B,$f16(B,A),tptp0)|occurrence_of($f17(B,A),tptp1).
% 3.07/3.24  ** KEPT (pick-wt=14): 90 [] -leaf_occ(A,$c1)|min_precedes(B,$f16(B,A),tptp0)|subactivity_occurrence($f17(B,A),$c1).
% 3.07/3.24  ** KEPT (pick-wt=15): 91 [] -leaf_occ(A,$c1)|min_precedes(B,$f16(B,A),tptp0)|min_precedes(B,$f17(B,A),tptp0).
% 3.07/3.24  
% 3.07/3.24  ------------> process sos:
% 3.07/3.24  ** KEPT (pick-wt=3): 99 [] A=A.
% 3.07/3.24  ** KEPT (pick-wt=2): 100 [] activity(tptp0).
% 3.07/3.24  ** KEPT (pick-wt=2): 101 [] atomic(tptp4).
% 3.07/3.24  ** KEPT (pick-wt=2): 102 [] atomic(tptp1).
% 3.07/3.24  ** KEPT (pick-wt=2): 103 [] atomic(tptp2).
% 3.07/3.24  ** KEPT (pick-wt=2): 104 [] atomic(tptp3).
% 3.07/3.24  ** KEPT (pick-wt=3): 105 [] occurrence_of($c1,tptp0).
% 3.07/3.24    Following clause subsumed by 99 during input processing: 0 [copy,99,flip.1] A=A.
% 3.07/3.24  99 back subsumes 97.
% 3.07/3.24  99 back subsumes 96.
% 3.07/3.24  99 back subsumes 93.
% 3.07/3.24  99 back subsumes 92.
% 3.07/3.24  
% 3.07/3.24  ======= end of input processing =======
% 3.07/3.24  
% 3.07/3.24  =========== start of search ===========
% 3.07/3.24  
% 3.07/3.24  
% 3.07/3.24  Resetting weight limit to 10.
% 3.07/3.24  
% 3.07/3.24  
% 3.07/3.24  Resetting weight limit to 10.
% 3.07/3.24  
% 3.07/3.24  sos_size=1452
% 3.07/3.24  
% 3.07/3.24  -------- PROOF -------- 
% 3.07/3.24  
% 3.07/3.24  -----> EMPTY CLAUSE at   1.15 sec ----> 1822 [hyper,1819,28,847] $F.
% 3.07/3.24  
% 3.07/3.24  Length of proof is 7.  Level of proof is 5.
% 3.07/3.24  
% 3.07/3.24  ---------------- PROOF ----------------
% 3.07/3.24  % SZS status Theorem
% 3.07/3.24  % SZS output start Refutation
% See solution above
% 3.07/3.24  ------------ end of proof -------------
% 3.07/3.24  
% 3.07/3.24  
% 3.07/3.24  Search stopped by max_proofs option.
% 3.07/3.24  
% 3.07/3.24  
% 3.07/3.24  Search stopped by max_proofs option.
% 3.07/3.24  
% 3.07/3.24  ============ end of search ============
% 3.07/3.24  
% 3.07/3.24  -------------- statistics -------------
% 3.07/3.24  clauses given                257
% 3.07/3.24  clauses generated           9660
% 3.07/3.24  clauses kept                1810
% 3.07/3.24  clauses forward subsumed    3186
% 3.07/3.24  clauses back subsumed         20
% 3.07/3.24  Kbytes malloced             5859
% 3.07/3.24  
% 3.07/3.24  ----------- times (seconds) -----------
% 3.07/3.24  user CPU time          1.15          (0 hr, 0 min, 1 sec)
% 3.07/3.24  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 3.07/3.24  wall-clock time        3             (0 hr, 0 min, 3 sec)
% 3.07/3.24  
% 3.07/3.24  That finishes the proof of the theorem.
% 3.07/3.24  
% 3.07/3.24  Process 14069 finished Wed Jul 27 04:52:41 2022
% 3.07/3.24  Otter interrupted
% 3.07/3.24  PROOF FOUND
%------------------------------------------------------------------------------