TSTP Solution File: PRO014+2 by Otter---3.3

View Problem - Process Solution

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

% Computer : n029.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:59 EDT 2022

% Result   : Theorem 2.25s 2.44s
% Output   : Refutation 2.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   25 (  14 unt;   7 nHn;  25 RR)
%            Number of literals    :   62 (   0 equ;  32 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   1 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   6 con; 0-2 aty)
%            Number of variables   :   23 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ min_precedes(A,B,C)
    | ~ min_precedes(B,D,C)
    | min_precedes(A,D,C) ),
    file('PRO014+2.p',unknown),
    [] ).

cnf(5,axiom,
    ( ~ next_subocc(A,B,C)
    | min_precedes(A,B,C) ),
    file('PRO014+2.p',unknown),
    [] ).

cnf(64,axiom,
    ( ~ occurrence_of(A,tptp0)
    | ~ subactivity_occurrence(B,A)
    | ~ arboreal(B)
    | leaf_occ(B,A)
    | occurrence_of(dollar_f17(B,A),tptp3) ),
    file('PRO014+2.p',unknown),
    [] ).

cnf(65,axiom,
    ( ~ occurrence_of(A,tptp0)
    | ~ subactivity_occurrence(B,A)
    | ~ arboreal(B)
    | leaf_occ(B,A)
    | next_subocc(B,dollar_f17(B,A),tptp0) ),
    file('PRO014+2.p',unknown),
    [] ).

cnf(67,axiom,
    ( ~ occurrence_of(A,tptp0)
    | ~ subactivity_occurrence(B,A)
    | ~ arboreal(B)
    | leaf_occ(B,A)
    | next_subocc(dollar_f17(B,A),dollar_f16(B,A),tptp0) ),
    file('PRO014+2.p',unknown),
    [] ).

cnf(68,axiom,
    ( ~ occurrence_of(A,tptp0)
    | ~ subactivity_occurrence(B,A)
    | ~ arboreal(B)
    | leaf_occ(B,A)
    | occurrence_of(dollar_f15(B,A),tptp2)
    | occurrence_of(dollar_f15(B,A),tptp1) ),
    file('PRO014+2.p',unknown),
    [] ).

cnf(69,axiom,
    ( ~ occurrence_of(A,tptp0)
    | ~ subactivity_occurrence(B,A)
    | ~ arboreal(B)
    | leaf_occ(B,A)
    | next_subocc(dollar_f16(B,A),dollar_f15(B,A),tptp0) ),
    file('PRO014+2.p',unknown),
    [] ).

cnf(70,axiom,
    ( ~ occurrence_of(A,tptp0)
    | ~ subactivity_occurrence(B,A)
    | ~ arboreal(B)
    | leaf_occ(B,A)
    | leaf(dollar_f15(B,A),tptp0) ),
    file('PRO014+2.p',unknown),
    [] ).

cnf(78,axiom,
    ~ leaf_occ(dollar_c2,dollar_c1),
    file('PRO014+2.p',unknown),
    [] ).

cnf(79,axiom,
    ( ~ occurrence_of(A,tptp3)
    | ~ next_subocc(dollar_c2,A,tptp0)
    | ~ occurrence_of(B,tptp2)
    | ~ min_precedes(A,B,tptp0)
    | ~ leaf(B,tptp0) ),
    file('PRO014+2.p',unknown),
    [] ).

cnf(80,axiom,
    ( ~ occurrence_of(A,tptp3)
    | ~ next_subocc(dollar_c2,A,tptp0)
    | ~ occurrence_of(B,tptp1)
    | ~ min_precedes(A,B,tptp0)
    | ~ leaf(B,tptp0) ),
    file('PRO014+2.p',unknown),
    [] ).

cnf(93,axiom,
    occurrence_of(dollar_c1,tptp0),
    file('PRO014+2.p',unknown),
    [] ).

cnf(94,axiom,
    subactivity_occurrence(dollar_c2,dollar_c1),
    file('PRO014+2.p',unknown),
    [] ).

cnf(95,axiom,
    arboreal(dollar_c2),
    file('PRO014+2.p',unknown),
    [] ).

cnf(139,plain,
    leaf(dollar_f15(dollar_c2,dollar_c1),tptp0),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[94,70,93,95]),78]),
    [iquote('hyper,94,70,93,95,unit_del,78')] ).

cnf(140,plain,
    next_subocc(dollar_f16(dollar_c2,dollar_c1),dollar_f15(dollar_c2,dollar_c1),tptp0),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[94,69,93,95]),78]),
    [iquote('hyper,94,69,93,95,unit_del,78')] ).

cnf(141,plain,
    ( occurrence_of(dollar_f15(dollar_c2,dollar_c1),tptp2)
    | occurrence_of(dollar_f15(dollar_c2,dollar_c1),tptp1) ),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[94,68,93,95]),78]),
    [iquote('hyper,94,68,93,95,unit_del,78')] ).

cnf(142,plain,
    next_subocc(dollar_f17(dollar_c2,dollar_c1),dollar_f16(dollar_c2,dollar_c1),tptp0),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[94,67,93,95]),78]),
    [iquote('hyper,94,67,93,95,unit_del,78')] ).

cnf(144,plain,
    next_subocc(dollar_c2,dollar_f17(dollar_c2,dollar_c1),tptp0),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[94,65,93,95]),78]),
    [iquote('hyper,94,65,93,95,unit_del,78')] ).

cnf(145,plain,
    occurrence_of(dollar_f17(dollar_c2,dollar_c1),tptp3),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[94,64,93,95]),78]),
    [iquote('hyper,94,64,93,95,unit_del,78')] ).

cnf(1196,plain,
    min_precedes(dollar_f16(dollar_c2,dollar_c1),dollar_f15(dollar_c2,dollar_c1),tptp0),
    inference(hyper,[status(thm)],[140,5]),
    [iquote('hyper,140,5')] ).

cnf(1200,plain,
    min_precedes(dollar_f17(dollar_c2,dollar_c1),dollar_f16(dollar_c2,dollar_c1),tptp0),
    inference(hyper,[status(thm)],[142,5]),
    [iquote('hyper,142,5')] ).

cnf(1227,plain,
    min_precedes(dollar_f17(dollar_c2,dollar_c1),dollar_f15(dollar_c2,dollar_c1),tptp0),
    inference(hyper,[status(thm)],[1200,1,1196]),
    [iquote('hyper,1200,1,1196')] ).

cnf(1286,plain,
    occurrence_of(dollar_f15(dollar_c2,dollar_c1),tptp1),
    inference(hyper,[status(thm)],[141,79,145,144,1227,139]),
    [iquote('hyper,141,79,145,144,1227,139')] ).

cnf(1288,plain,
    $false,
    inference(hyper,[status(thm)],[1286,80,145,144,1227,139]),
    [iquote('hyper,1286,80,145,144,1227,139')] ).

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