TSTP Solution File: PRO009+4 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : PRO009+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n019.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:57 EDT 2022
% Result : Theorem 3.13s 3.31s
% Output : Refutation 3.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 22
% Syntax : Number of clauses : 47 ( 25 unt; 6 nHn; 47 RR)
% Number of literals : 85 ( 9 equ; 36 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-3 aty)
% Number of variables : 41 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ occurrence_of(A,B)
| atomic(B)
| root(dollar_f1(B,A),B) ),
file('PRO009+4.p',unknown),
[] ).
cnf(2,axiom,
( ~ occurrence_of(A,B)
| atomic(B)
| subactivity_occurrence(dollar_f1(B,A),A) ),
file('PRO009+4.p',unknown),
[] ).
cnf(15,axiom,
( ~ occurrence_of(A,B)
| ~ occurrence_of(A,C)
| B = C ),
file('PRO009+4.p',unknown),
[] ).
cnf(18,axiom,
( ~ subactivity_occurrence(A,B)
| activity_occurrence(A) ),
file('PRO009+4.p',unknown),
[] ).
cnf(21,axiom,
( ~ activity_occurrence(A)
| occurrence_of(A,dollar_f5(A)) ),
file('PRO009+4.p',unknown),
[] ).
cnf(35,axiom,
( ~ leaf_occ(A,B)
| subactivity_occurrence(A,B) ),
file('PRO009+4.p',unknown),
[] ).
cnf(41,axiom,
( root_occ(A,B)
| ~ occurrence_of(B,C)
| ~ subactivity_occurrence(A,B)
| ~ root(A,C) ),
file('PRO009+4.p',unknown),
[] ).
cnf(47,axiom,
( ~ min_precedes(A,B,C)
| root(dollar_f11(A,B,C),C) ),
file('PRO009+4.p',unknown),
[] ).
cnf(48,axiom,
( ~ min_precedes(A,B,C)
| min_precedes(dollar_f11(A,B,C),B,C) ),
file('PRO009+4.p',unknown),
[] ).
cnf(52,axiom,
( ~ next_subocc(A,B,C)
| min_precedes(A,B,C) ),
file('PRO009+4.p',unknown),
[] ).
cnf(56,axiom,
( ~ min_precedes(A,B,C)
| ~ occurrence_of(D,C)
| ~ subactivity_occurrence(B,D)
| subactivity_occurrence(A,D) ),
file('PRO009+4.p',unknown),
[] ).
cnf(58,axiom,
( ~ occurrence_of(A,B)
| ~ root_occ(C,A)
| ~ root_occ(D,A)
| C = D ),
file('PRO009+4.p',unknown),
[] ).
cnf(61,axiom,
( ~ occurrence_of(A,tptp0)
| occurrence_of(dollar_f15(A),tptp3) ),
file('PRO009+4.p',unknown),
[] ).
cnf(62,axiom,
( ~ occurrence_of(A,tptp0)
| root_occ(dollar_f15(A),A) ),
file('PRO009+4.p',unknown),
[] ).
cnf(65,axiom,
( ~ occurrence_of(A,tptp0)
| occurrence_of(dollar_f13(A),tptp2)
| occurrence_of(dollar_f13(A),tptp1) ),
file('PRO009+4.p',unknown),
[] ).
cnf(66,axiom,
( ~ occurrence_of(A,tptp0)
| next_subocc(dollar_f14(A),dollar_f13(A),tptp0) ),
file('PRO009+4.p',unknown),
[] ).
cnf(67,axiom,
( ~ occurrence_of(A,tptp0)
| leaf_occ(dollar_f13(A),A) ),
file('PRO009+4.p',unknown),
[] ).
cnf(68,axiom,
~ atomic(tptp0),
file('PRO009+4.p',unknown),
[] ).
cnf(74,axiom,
tptp2 != tptp1,
file('PRO009+4.p',unknown),
[] ).
cnf(75,axiom,
( ~ occurrence_of(A,tptp3)
| ~ root_occ(A,dollar_c1)
| ~ occurrence_of(B,tptp2)
| ~ min_precedes(A,B,tptp0)
| ~ leaf_occ(B,dollar_c1) ),
file('PRO009+4.p',unknown),
[] ).
cnf(76,axiom,
( ~ occurrence_of(A,tptp3)
| ~ root_occ(A,dollar_c1)
| ~ occurrence_of(B,tptp1)
| ~ min_precedes(A,B,tptp0)
| ~ leaf_occ(B,dollar_c1) ),
file('PRO009+4.p',unknown),
[] ).
cnf(90,axiom,
occurrence_of(dollar_c1,tptp0),
file('PRO009+4.p',unknown),
[] ).
cnf(124,plain,
leaf_occ(dollar_f13(dollar_c1),dollar_c1),
inference(hyper,[status(thm)],[90,67]),
[iquote('hyper,90,67')] ).
cnf(125,plain,
next_subocc(dollar_f14(dollar_c1),dollar_f13(dollar_c1),tptp0),
inference(hyper,[status(thm)],[90,66]),
[iquote('hyper,90,66')] ).
cnf(126,plain,
( occurrence_of(dollar_f13(dollar_c1),tptp2)
| occurrence_of(dollar_f13(dollar_c1),tptp1) ),
inference(hyper,[status(thm)],[90,65]),
[iquote('hyper,90,65')] ).
cnf(129,plain,
root_occ(dollar_f15(dollar_c1),dollar_c1),
inference(hyper,[status(thm)],[90,62]),
[iquote('hyper,90,62')] ).
cnf(130,plain,
occurrence_of(dollar_f15(dollar_c1),tptp3),
inference(hyper,[status(thm)],[90,61]),
[iquote('hyper,90,61')] ).
cnf(132,plain,
subactivity_occurrence(dollar_f1(tptp0,dollar_c1),dollar_c1),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[90,2]),68]),
[iquote('hyper,90,2,unit_del,68')] ).
cnf(133,plain,
root(dollar_f1(tptp0,dollar_c1),tptp0),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[90,1]),68]),
[iquote('hyper,90,1,unit_del,68')] ).
cnf(164,plain,
subactivity_occurrence(dollar_f13(dollar_c1),dollar_c1),
inference(hyper,[status(thm)],[124,35]),
[iquote('hyper,124,35')] ).
cnf(375,plain,
activity_occurrence(dollar_f13(dollar_c1)),
inference(hyper,[status(thm)],[164,18]),
[iquote('hyper,164,18')] ).
cnf(394,plain,
occurrence_of(dollar_f13(dollar_c1),dollar_f5(dollar_f13(dollar_c1))),
inference(hyper,[status(thm)],[375,21]),
[iquote('hyper,375,21')] ).
cnf(592,plain,
root_occ(dollar_f1(tptp0,dollar_c1),dollar_c1),
inference(hyper,[status(thm)],[133,41,90,132]),
[iquote('hyper,133,41,90,132')] ).
cnf(696,plain,
dollar_f15(dollar_c1) = dollar_f1(tptp0,dollar_c1),
inference(hyper,[status(thm)],[592,58,90,129]),
[iquote('hyper,592,58,90,129')] ).
cnf(724,plain,
occurrence_of(dollar_f1(tptp0,dollar_c1),tptp3),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[130]),696]),
[iquote('back_demod,130,demod,696')] ).
cnf(773,plain,
min_precedes(dollar_f14(dollar_c1),dollar_f13(dollar_c1),tptp0),
inference(hyper,[status(thm)],[125,52]),
[iquote('hyper,125,52')] ).
cnf(986,plain,
min_precedes(dollar_f11(dollar_f14(dollar_c1),dollar_f13(dollar_c1),tptp0),dollar_f13(dollar_c1),tptp0),
inference(hyper,[status(thm)],[773,48]),
[iquote('hyper,773,48')] ).
cnf(987,plain,
root(dollar_f11(dollar_f14(dollar_c1),dollar_f13(dollar_c1),tptp0),tptp0),
inference(hyper,[status(thm)],[773,47]),
[iquote('hyper,773,47')] ).
cnf(1818,plain,
( occurrence_of(dollar_f13(dollar_c1),tptp1)
| dollar_f5(dollar_f13(dollar_c1)) = tptp2 ),
inference(hyper,[status(thm)],[126,15,394]),
[iquote('hyper,126,15,394')] ).
cnf(1820,plain,
( occurrence_of(dollar_f13(dollar_c1),tptp2)
| dollar_f5(dollar_f13(dollar_c1)) = tptp1 ),
inference(hyper,[status(thm)],[126,15,394]),
[iquote('hyper,126,15,394')] ).
cnf(1862,plain,
subactivity_occurrence(dollar_f11(dollar_f14(dollar_c1),dollar_f13(dollar_c1),tptp0),dollar_c1),
inference(hyper,[status(thm)],[986,56,90,164]),
[iquote('hyper,986,56,90,164')] ).
cnf(1864,plain,
root_occ(dollar_f11(dollar_f14(dollar_c1),dollar_f13(dollar_c1),tptp0),dollar_c1),
inference(hyper,[status(thm)],[1862,41,90,987]),
[iquote('hyper,1862,41,90,987')] ).
cnf(1868,plain,
dollar_f11(dollar_f14(dollar_c1),dollar_f13(dollar_c1),tptp0) = dollar_f1(tptp0,dollar_c1),
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[1864,58,90,592])]),
[iquote('hyper,1864,58,90,592,flip.1')] ).
cnf(1869,plain,
min_precedes(dollar_f1(tptp0,dollar_c1),dollar_f13(dollar_c1),tptp0),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[986]),1868]),
[iquote('back_demod,986,demod,1868')] ).
cnf(1871,plain,
dollar_f5(dollar_f13(dollar_c1)) = tptp2,
inference(hyper,[status(thm)],[1869,76,724,592,1818,124]),
[iquote('hyper,1869,76,724,592,1818,124')] ).
cnf(1873,plain,
tptp2 = tptp1,
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[1869,75,724,592,1820,124]),1871]),
[iquote('hyper,1869,75,724,592,1820,124,demod,1871')] ).
cnf(1875,plain,
$false,
inference(binary,[status(thm)],[1873,74]),
[iquote('binary,1873.1,74.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : PRO009+4 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n019.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:59:52 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.91/2.13 ----- Otter 3.3f, August 2004 -----
% 1.91/2.13 The process was started by sandbox on n019.cluster.edu,
% 1.91/2.13 Wed Jul 27 04:59:52 2022
% 1.91/2.13 The command was "./otter". The process ID is 4119.
% 1.91/2.13
% 1.91/2.13 set(prolog_style_variables).
% 1.91/2.13 set(auto).
% 1.91/2.13 dependent: set(auto1).
% 1.91/2.13 dependent: set(process_input).
% 1.91/2.13 dependent: clear(print_kept).
% 1.91/2.13 dependent: clear(print_new_demod).
% 1.91/2.13 dependent: clear(print_back_demod).
% 1.91/2.13 dependent: clear(print_back_sub).
% 1.91/2.13 dependent: set(control_memory).
% 1.91/2.13 dependent: assign(max_mem, 12000).
% 1.91/2.13 dependent: assign(pick_given_ratio, 4).
% 1.91/2.13 dependent: assign(stats_level, 1).
% 1.91/2.13 dependent: assign(max_seconds, 10800).
% 1.91/2.13 clear(print_given).
% 1.91/2.13
% 1.91/2.13 formula_list(usable).
% 1.91/2.13 all A (A=A).
% 1.91/2.13 all X0 X1 (occurrence_of(X1,X0)& -atomic(X0)-> (exists X2 (root(X2,X0)&subactivity_occurrence(X2,X1)))).
% 1.91/2.13 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.91/2.13 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.91/2.13 all X12 X13 (occurrence_of(X13,X12)->activity(X12)&activity_occurrence(X13)).
% 1.91/2.13 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.91/2.13 all X18 X19 (root(X19,X18)-> (exists X20 (subactivity(X20,X18)&atocc(X19,X20)))).
% 1.91/2.13 all X21 X22 X23 (min_precedes(X22,X23,X21)-> (exists X24 (occurrence_of(X24,X21)&subactivity_occurrence(X22,X24)&subactivity_occurrence(X23,X24)))).
% 1.91/2.13 all X25 X26 (leaf(X25,X26)& -atomic(X26)-> (exists X27 (occurrence_of(X27,X26)&leaf_occ(X25,X27)))).
% 1.91/2.13 all X28 X29 X30 (occurrence_of(X28,X29)&occurrence_of(X28,X30)->X29=X30).
% 1.91/2.13 all X31 X32 X33 (occurrence_of(X31,X33)&leaf_occ(X32,X31)-> -(exists X34 min_precedes(X32,X34,X33))).
% 1.91/2.13 all X35 X36 X37 (occurrence_of(X35,X37)&root_occ(X36,X35)-> -(exists X38 min_precedes(X38,X36,X37))).
% 1.91/2.13 all X39 X40 (subactivity_occurrence(X39,X40)->activity_occurrence(X39)&activity_occurrence(X40)).
% 1.91/2.13 all X41 (activity_occurrence(X41)-> (exists X42 (activity(X42)&occurrence_of(X41,X42)))).
% 1.91/2.13 all X43 (legal(X43)->arboreal(X43)).
% 1.91/2.13 all X44 X45 (atocc(X44,X45)<-> (exists X46 (subactivity(X45,X46)&atomic(X46)&occurrence_of(X44,X46)))).
% 1.91/2.13 all X47 X48 (leaf(X47,X48)<-> (root(X47,X48)| (exists X49 min_precedes(X49,X47,X48)))& -(exists X50 min_precedes(X47,X50,X48))).
% 1.91/2.13 all X51 X52 (occurrence_of(X51,X52)-> (arboreal(X51)<->atomic(X52))).
% 1.91/2.13 all X53 X54 (root(X53,X54)->legal(X53)).
% 1.91/2.13 all X55 X56 (leaf_occ(X55,X56)<-> (exists X57 (occurrence_of(X56,X57)&subactivity_occurrence(X55,X56)&leaf(X55,X57)))).
% 1.91/2.13 all X58 X59 (root_occ(X58,X59)<-> (exists X60 (occurrence_of(X59,X60)&subactivity_occurrence(X58,X59)&root(X58,X60)))).
% 1.91/2.13 all X61 X62 (earlier(X61,X62)-> -earlier(X62,X61)).
% 1.91/2.13 all X63 X64 (precedes(X63,X64)<->earlier(X63,X64)&legal(X64)).
% 1.91/2.13 all X65 X66 X67 (min_precedes(X65,X66,X67)-> -root(X66,X67)).
% 1.91/2.13 all X68 X69 X70 (min_precedes(X68,X69,X70)-> (exists X71 (root(X71,X70)&min_precedes(X71,X69,X70)))).
% 1.91/2.13 all X72 X73 X74 (min_precedes(X72,X73,X74)->precedes(X72,X73)).
% 1.91/2.13 all X75 X76 X77 (next_subocc(X75,X76,X77)->arboreal(X75)&arboreal(X76)).
% 1.91/2.13 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.91/2.13 all X82 X83 X84 X85 (min_precedes(X82,X83,X84)&occurrence_of(X85,X84)&subactivity_occurrence(X83,X85)->subactivity_occurrence(X82,X85)).
% 1.91/2.13 all X86 X87 X88 X89 (occurrence_of(X88,X89)& -atomic(X89)&leaf_occ(X86,X88)&leaf_occ(X87,X88)->X86=X87).
% 1.91/2.13 all X90 X91 X92 X93 (occurrence_of(X92,X93)&root_occ(X90,X92)&root_occ(X91,X92)->X90=X91).
% 1.91/2.13 all X94 X95 X96 (earlier(X94,X95)&earlier(X95,X96)->earlier(X94,X96)).
% 1.91/2.13 all X97 X98 X99 X100 (min_precedes(X97,X98,X100)&min_precedes(X97,X99,X100)&precedes(X98,X99)->min_precedes(X98,X99,X100)).
% 1.91/2.13 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,tptp2)|occurrence_of(X104,tptp1))&next_subocc(X103,X104,tptp0)&leaf_occ(X104,X101)))).
% 1.91/2.13 activity(tptp0).
% 1.91/2.13 -atomic(tptp0).
% 1.91/2.13 atomic(tptp4).
% 1.91/2.13 atomic(tptp2).
% 1.91/2.13 atomic(tptp1).
% 1.91/2.13 atomic(tptp3).
% 1.91/2.13 tptp4!=tptp3.
% 1.91/2.13 tptp4!=tptp2.
% 1.91/2.13 tptp4!=tptp1.
% 1.91/2.13 tptp3!=tptp2.
% 1.91/2.13 tptp3!=tptp1.
% 1.91/2.13 tptp2!=tptp1.
% 1.91/2.13 -(all X105 (occurrence_of(X105,tptp0)-> (exists X106 X107 (occurrence_of(X106,tptp3)&root_occ(X106,X105)& (occurrence_of(X107,tptp2)|occurrence_of(X107,tptp1))&min_precedes(X106,X107,tptp0)&leaf_occ(X107,X105))))).
% 1.91/2.13 end_of_list.
% 1.91/2.13
% 1.91/2.13 -------> usable clausifies to:
% 1.91/2.13
% 1.91/2.13 list(usable).
% 1.91/2.13 0 [] A=A.
% 1.91/2.13 0 [] -occurrence_of(X1,X0)|atomic(X0)|root($f1(X0,X1),X0).
% 1.91/2.13 0 [] -occurrence_of(X1,X0)|atomic(X0)|subactivity_occurrence($f1(X0,X1),X1).
% 1.91/2.13 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.91/2.13 0 [] -occurrence_of(X9,X8)| -subactivity_occurrence(X10,X9)| -leaf_occ(X11,X9)| -arboreal(X10)|min_precedes(X10,X11,X8)|X11=X10.
% 1.91/2.13 0 [] -occurrence_of(X13,X12)|activity(X12).
% 1.91/2.13 0 [] -occurrence_of(X13,X12)|activity_occurrence(X13).
% 1.91/2.13 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.91/2.13 0 [] -root(X19,X18)|subactivity($f2(X18,X19),X18).
% 1.91/2.13 0 [] -root(X19,X18)|atocc(X19,$f2(X18,X19)).
% 1.91/2.13 0 [] -min_precedes(X22,X23,X21)|occurrence_of($f3(X21,X22,X23),X21).
% 1.91/2.13 0 [] -min_precedes(X22,X23,X21)|subactivity_occurrence(X22,$f3(X21,X22,X23)).
% 1.91/2.13 0 [] -min_precedes(X22,X23,X21)|subactivity_occurrence(X23,$f3(X21,X22,X23)).
% 1.91/2.13 0 [] -leaf(X25,X26)|atomic(X26)|occurrence_of($f4(X25,X26),X26).
% 1.91/2.13 0 [] -leaf(X25,X26)|atomic(X26)|leaf_occ(X25,$f4(X25,X26)).
% 1.91/2.13 0 [] -occurrence_of(X28,X29)| -occurrence_of(X28,X30)|X29=X30.
% 1.91/2.13 0 [] -occurrence_of(X31,X33)| -leaf_occ(X32,X31)| -min_precedes(X32,X34,X33).
% 1.91/2.13 0 [] -occurrence_of(X35,X37)| -root_occ(X36,X35)| -min_precedes(X38,X36,X37).
% 1.91/2.13 0 [] -subactivity_occurrence(X39,X40)|activity_occurrence(X39).
% 1.91/2.13 0 [] -subactivity_occurrence(X39,X40)|activity_occurrence(X40).
% 1.91/2.13 0 [] -activity_occurrence(X41)|activity($f5(X41)).
% 1.91/2.13 0 [] -activity_occurrence(X41)|occurrence_of(X41,$f5(X41)).
% 1.91/2.13 0 [] -legal(X43)|arboreal(X43).
% 1.91/2.13 0 [] -atocc(X44,X45)|subactivity(X45,$f6(X44,X45)).
% 1.91/2.13 0 [] -atocc(X44,X45)|atomic($f6(X44,X45)).
% 1.91/2.13 0 [] -atocc(X44,X45)|occurrence_of(X44,$f6(X44,X45)).
% 1.91/2.13 0 [] atocc(X44,X45)| -subactivity(X45,X46)| -atomic(X46)| -occurrence_of(X44,X46).
% 1.91/2.13 0 [] -leaf(X47,X48)|root(X47,X48)|min_precedes($f7(X47,X48),X47,X48).
% 1.91/2.13 0 [] -leaf(X47,X48)| -min_precedes(X47,X50,X48).
% 1.91/2.13 0 [] leaf(X47,X48)| -root(X47,X48)|min_precedes(X47,$f8(X47,X48),X48).
% 1.91/2.13 0 [] leaf(X47,X48)| -min_precedes(X49,X47,X48)|min_precedes(X47,$f8(X47,X48),X48).
% 1.91/2.13 0 [] -occurrence_of(X51,X52)| -arboreal(X51)|atomic(X52).
% 1.91/2.13 0 [] -occurrence_of(X51,X52)|arboreal(X51)| -atomic(X52).
% 1.91/2.13 0 [] -root(X53,X54)|legal(X53).
% 1.91/2.13 0 [] -leaf_occ(X55,X56)|occurrence_of(X56,$f9(X55,X56)).
% 1.91/2.13 0 [] -leaf_occ(X55,X56)|subactivity_occurrence(X55,X56).
% 1.91/2.13 0 [] -leaf_occ(X55,X56)|leaf(X55,$f9(X55,X56)).
% 1.91/2.13 0 [] leaf_occ(X55,X56)| -occurrence_of(X56,X57)| -subactivity_occurrence(X55,X56)| -leaf(X55,X57).
% 1.91/2.13 0 [] -root_occ(X58,X59)|occurrence_of(X59,$f10(X58,X59)).
% 1.91/2.13 0 [] -root_occ(X58,X59)|subactivity_occurrence(X58,X59).
% 1.91/2.13 0 [] -root_occ(X58,X59)|root(X58,$f10(X58,X59)).
% 1.91/2.13 0 [] root_occ(X58,X59)| -occurrence_of(X59,X60)| -subactivity_occurrence(X58,X59)| -root(X58,X60).
% 1.91/2.13 0 [] -earlier(X61,X62)| -earlier(X62,X61).
% 1.91/2.13 0 [] -precedes(X63,X64)|earlier(X63,X64).
% 1.91/2.13 0 [] -precedes(X63,X64)|legal(X64).
% 1.91/2.13 0 [] precedes(X63,X64)| -earlier(X63,X64)| -legal(X64).
% 1.91/2.13 0 [] -min_precedes(X65,X66,X67)| -root(X66,X67).
% 1.91/2.13 0 [] -min_precedes(X68,X69,X70)|root($f11(X68,X69,X70),X70).
% 1.91/2.13 0 [] -min_precedes(X68,X69,X70)|min_precedes($f11(X68,X69,X70),X69,X70).
% 1.91/2.13 0 [] -min_precedes(X72,X73,X74)|precedes(X72,X73).
% 1.91/2.13 0 [] -next_subocc(X75,X76,X77)|arboreal(X75).
% 1.91/2.13 0 [] -next_subocc(X75,X76,X77)|arboreal(X76).
% 1.91/2.13 0 [] -next_subocc(X78,X79,X80)|min_precedes(X78,X79,X80).
% 1.91/2.13 0 [] -next_subocc(X78,X79,X80)| -min_precedes(X78,X81,X80)| -min_precedes(X81,X79,X80).
% 1.91/2.13 0 [] next_subocc(X78,X79,X80)| -min_precedes(X78,X79,X80)|min_precedes(X78,$f12(X78,X79,X80),X80).
% 1.91/2.13 0 [] next_subocc(X78,X79,X80)| -min_precedes(X78,X79,X80)|min_precedes($f12(X78,X79,X80),X79,X80).
% 1.91/2.13 0 [] -min_precedes(X82,X83,X84)| -occurrence_of(X85,X84)| -subactivity_occurrence(X83,X85)|subactivity_occurrence(X82,X85).
% 1.91/2.13 0 [] -occurrence_of(X88,X89)|atomic(X89)| -leaf_occ(X86,X88)| -leaf_occ(X87,X88)|X86=X87.
% 1.91/2.13 0 [] -occurrence_of(X92,X93)| -root_occ(X90,X92)| -root_occ(X91,X92)|X90=X91.
% 1.91/2.13 0 [] -earlier(X94,X95)| -earlier(X95,X96)|earlier(X94,X96).
% 1.91/2.13 0 [] -min_precedes(X97,X98,X100)| -min_precedes(X97,X99,X100)| -precedes(X98,X99)|min_precedes(X98,X99,X100).
% 1.91/2.13 0 [] -occurrence_of(X101,tptp0)|occurrence_of($f15(X101),tptp3).
% 1.91/2.13 0 [] -occurrence_of(X101,tptp0)|root_occ($f15(X101),X101).
% 1.91/2.13 0 [] -occurrence_of(X101,tptp0)|occurrence_of($f14(X101),tptp4).
% 1.91/2.13 0 [] -occurrence_of(X101,tptp0)|next_subocc($f15(X101),$f14(X101),tptp0).
% 1.91/2.13 0 [] -occurrence_of(X101,tptp0)|occurrence_of($f13(X101),tptp2)|occurrence_of($f13(X101),tptp1).
% 1.91/2.13 0 [] -occurrence_of(X101,tptp0)|next_subocc($f14(X101),$f13(X101),tptp0).
% 1.91/2.13 0 [] -occurrence_of(X101,tptp0)|leaf_occ($f13(X101),X101).
% 1.91/2.13 0 [] activity(tptp0).
% 1.91/2.13 0 [] -atomic(tptp0).
% 1.91/2.13 0 [] atomic(tptp4).
% 1.91/2.13 0 [] atomic(tptp2).
% 1.91/2.13 0 [] atomic(tptp1).
% 1.91/2.13 0 [] atomic(tptp3).
% 1.91/2.13 0 [] tptp4!=tptp3.
% 1.91/2.13 0 [] tptp4!=tptp2.
% 1.91/2.13 0 [] tptp4!=tptp1.
% 1.91/2.13 0 [] tptp3!=tptp2.
% 1.91/2.13 0 [] tptp3!=tptp1.
% 1.91/2.13 0 [] tptp2!=tptp1.
% 1.91/2.13 0 [] occurrence_of($c1,tptp0).
% 1.91/2.13 0 [] -occurrence_of(X106,tptp3)| -root_occ(X106,$c1)| -occurrence_of(X107,tptp2)| -min_precedes(X106,X107,tptp0)| -leaf_occ(X107,$c1).
% 1.91/2.13 0 [] -occurrence_of(X106,tptp3)| -root_occ(X106,$c1)| -occurrence_of(X107,tptp1)| -min_precedes(X106,X107,tptp0)| -leaf_occ(X107,$c1).
% 1.91/2.13 end_of_list.
% 1.91/2.13
% 1.91/2.13 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 1.91/2.13
% 1.91/2.13 This ia a non-Horn set with equality. The strategy will be
% 1.91/2.13 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.91/2.13 deletion, with positive clauses in sos and nonpositive
% 1.91/2.13 clauses in usable.
% 1.91/2.13
% 1.91/2.13 dependent: set(knuth_bendix).
% 1.91/2.13 dependent: set(anl_eq).
% 1.91/2.13 dependent: set(para_from).
% 1.91/2.13 dependent: set(para_into).
% 1.91/2.13 dependent: clear(para_from_right).
% 1.91/2.13 dependent: clear(para_into_right).
% 1.91/2.13 dependent: set(para_from_vars).
% 1.91/2.13 dependent: set(eq_units_both_ways).
% 1.91/2.13 dependent: set(dynamic_demod_all).
% 1.91/2.13 dependent: set(dynamic_demod).
% 1.91/2.13 dependent: set(order_eq).
% 1.91/2.13 dependent: set(back_demod).
% 1.91/2.13 dependent: set(lrpo).
% 1.91/2.13 dependent: set(hyper_res).
% 1.91/2.13 dependent: set(unit_deletion).
% 1.91/2.13 dependent: set(factor).
% 1.91/2.13
% 1.91/2.13 ------------> process usable:
% 1.91/2.13 ** KEPT (pick-wt=10): 1 [] -occurrence_of(A,B)|atomic(B)|root($f1(B,A),B).
% 1.91/2.13 ** KEPT (pick-wt=10): 2 [] -occurrence_of(A,B)|atomic(B)|subactivity_occurrence($f1(B,A),A).
% 1.91/2.13 ** 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.91/2.13 ** 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.91/2.13 ** KEPT (pick-wt=5): 5 [] -occurrence_of(A,B)|activity(B).
% 1.91/2.13 ** KEPT (pick-wt=5): 6 [] -occurrence_of(A,B)|activity_occurrence(A).
% 1.91/2.13 ** 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.91/2.13 ** KEPT (pick-wt=8): 8 [] -root(A,B)|subactivity($f2(B,A),B).
% 1.91/2.13 ** KEPT (pick-wt=8): 9 [] -root(A,B)|atocc(A,$f2(B,A)).
% 1.91/2.13 ** KEPT (pick-wt=10): 10 [] -min_precedes(A,B,C)|occurrence_of($f3(C,A,B),C).
% 1.91/2.13 ** KEPT (pick-wt=10): 11 [] -min_precedes(A,B,C)|subactivity_occurrence(A,$f3(C,A,B)).
% 1.91/2.13 ** KEPT (pick-wt=10): 12 [] -min_precedes(A,B,C)|subactivity_occurrence(B,$f3(C,A,B)).
% 1.91/2.13 ** KEPT (pick-wt=10): 13 [] -leaf(A,B)|atomic(B)|occurrence_of($f4(A,B),B).
% 1.91/2.13 ** KEPT (pick-wt=10): 14 [] -leaf(A,B)|atomic(B)|leaf_occ(A,$f4(A,B)).
% 1.91/2.13 ** KEPT (pick-wt=9): 15 [] -occurrence_of(A,B)| -occurrence_of(A,C)|B=C.
% 1.91/2.13 ** KEPT (pick-wt=10): 16 [] -occurrence_of(A,B)| -leaf_occ(C,A)| -min_precedes(C,D,B).
% 1.91/2.13 ** KEPT (pick-wt=10): 17 [] -occurrence_of(A,B)| -root_occ(C,A)| -min_precedes(D,C,B).
% 1.91/2.13 ** KEPT (pick-wt=5): 18 [] -subactivity_occurrence(A,B)|activity_occurrence(A).
% 1.91/2.13 ** KEPT (pick-wt=5): 19 [] -subactivity_occurrence(A,B)|activity_occurrence(B).
% 1.91/2.13 ** KEPT (pick-wt=5): 20 [] -activity_occurrence(A)|activity($f5(A)).
% 1.91/2.13 ** KEPT (pick-wt=6): 21 [] -activity_occurrence(A)|occurrence_of(A,$f5(A)).
% 1.91/2.13 ** KEPT (pick-wt=4): 22 [] -legal(A)|arboreal(A).
% 1.91/2.13 ** KEPT (pick-wt=8): 23 [] -atocc(A,B)|subactivity(B,$f6(A,B)).
% 1.91/2.13 ** KEPT (pick-wt=7): 24 [] -atocc(A,B)|atomic($f6(A,B)).
% 1.91/2.13 ** KEPT (pick-wt=8): 25 [] -atocc(A,B)|occurrence_of(A,$f6(A,B)).
% 1.91/2.13 ** KEPT (pick-wt=11): 26 [] atocc(A,B)| -subactivity(B,C)| -atomic(C)| -occurrence_of(A,C).
% 1.91/2.13 ** KEPT (pick-wt=12): 27 [] -leaf(A,B)|root(A,B)|min_precedes($f7(A,B),A,B).
% 1.91/2.13 ** KEPT (pick-wt=7): 28 [] -leaf(A,B)| -min_precedes(A,C,B).
% 1.91/2.13 ** KEPT (pick-wt=12): 29 [] leaf(A,B)| -root(A,B)|min_precedes(A,$f8(A,B),B).
% 1.91/2.13 ** KEPT (pick-wt=13): 30 [] leaf(A,B)| -min_precedes(C,A,B)|min_precedes(A,$f8(A,B),B).
% 1.91/2.13 ** KEPT (pick-wt=7): 31 [] -occurrence_of(A,B)| -arboreal(A)|atomic(B).
% 1.91/2.13 ** KEPT (pick-wt=7): 32 [] -occurrence_of(A,B)|arboreal(A)| -atomic(B).
% 1.91/2.13 ** KEPT (pick-wt=5): 33 [] -root(A,B)|legal(A).
% 1.91/2.13 ** KEPT (pick-wt=8): 34 [] -leaf_occ(A,B)|occurrence_of(B,$f9(A,B)).
% 1.91/2.13 ** KEPT (pick-wt=6): 35 [] -leaf_occ(A,B)|subactivity_occurrence(A,B).
% 1.91/2.13 ** KEPT (pick-wt=8): 36 [] -leaf_occ(A,B)|leaf(A,$f9(A,B)).
% 1.91/2.13 ** KEPT (pick-wt=12): 37 [] leaf_occ(A,B)| -occurrence_of(B,C)| -subactivity_occurrence(A,B)| -leaf(A,C).
% 1.91/2.13 ** KEPT (pick-wt=8): 38 [] -root_occ(A,B)|occurrence_of(B,$f10(A,B)).
% 1.91/2.13 ** KEPT (pick-wt=6): 39 [] -root_occ(A,B)|subactivity_occurrence(A,B).
% 1.91/2.13 ** KEPT (pick-wt=8): 40 [] -root_occ(A,B)|root(A,$f10(A,B)).
% 1.91/2.13 ** KEPT (pick-wt=12): 41 [] root_occ(A,B)| -occurrence_of(B,C)| -subactivity_occurrence(A,B)| -root(A,C).
% 1.91/2.13 ** KEPT (pick-wt=6): 42 [] -earlier(A,B)| -earlier(B,A).
% 1.91/2.13 ** KEPT (pick-wt=6): 43 [] -precedes(A,B)|earlier(A,B).
% 1.91/2.13 ** KEPT (pick-wt=5): 44 [] -precedes(A,B)|legal(B).
% 1.91/2.13 ** KEPT (pick-wt=8): 45 [] precedes(A,B)| -earlier(A,B)| -legal(B).
% 1.91/2.13 ** KEPT (pick-wt=7): 46 [] -min_precedes(A,B,C)| -root(B,C).
% 1.91/2.13 ** KEPT (pick-wt=10): 47 [] -min_precedes(A,B,C)|root($f11(A,B,C),C).
% 1.91/2.13 ** KEPT (pick-wt=11): 48 [] -min_precedes(A,B,C)|min_precedes($f11(A,B,C),B,C).
% 1.91/2.13 ** KEPT (pick-wt=7): 49 [] -min_precedes(A,B,C)|precedes(A,B).
% 1.91/2.13 ** KEPT (pick-wt=6): 50 [] -next_subocc(A,B,C)|arboreal(A).
% 1.91/2.13 ** KEPT (pick-wt=6): 51 [] -next_subocc(A,B,C)|arboreal(B).
% 1.91/2.13 ** KEPT (pick-wt=8): 52 [] -next_subocc(A,B,C)|min_precedes(A,B,C).
% 1.91/2.13 ** KEPT (pick-wt=12): 53 [] -next_subocc(A,B,C)| -min_precedes(A,D,C)| -min_precedes(D,B,C).
% 1.91/2.13 ** KEPT (pick-wt=15): 54 [] next_subocc(A,B,C)| -min_precedes(A,B,C)|min_precedes(A,$f12(A,B,C),C).
% 1.91/2.13 ** KEPT (pick-wt=15): 55 [] next_subocc(A,B,C)| -min_precedes(A,B,C)|min_precedes($f12(A,B,C),B,C).
% 1.91/2.13 ** KEPT (pick-wt=13): 56 [] -min_precedes(A,B,C)| -occurrence_of(D,C)| -subactivity_occurrence(B,D)|subactivity_occurrence(A,D).
% 1.91/2.13 ** KEPT (pick-wt=14): 57 [] -occurrence_of(A,B)|atomic(B)| -leaf_occ(C,A)| -leaf_occ(D,A)|C=D.
% 1.91/2.13 ** KEPT (pick-wt=12): 58 [] -occurrence_of(A,B)| -root_occ(C,A)| -root_occ(D,A)|C=D.
% 1.91/2.13 ** KEPT (pick-wt=9): 59 [] -earlier(A,B)| -earlier(B,C)|earlier(A,C).
% 1.91/2.13 ** KEPT (pick-wt=15): 60 [] -min_precedes(A,B,C)| -min_precedes(A,D,C)| -precedes(B,D)|min_precedes(B,D,C).
% 1.91/2.13 ** KEPT (pick-wt=7): 61 [] -occurrence_of(A,tptp0)|occurrence_of($f15(A),tptp3).
% 1.91/2.13 ** KEPT (pick-wt=7): 62 [] -occurrence_of(A,tptp0)|root_occ($f15(A),A).
% 1.91/2.13 ** KEPT (pick-wt=7): 63 [] -occurrence_of(A,tptp0)|occurrence_of($f14(A),tptp4).
% 1.91/2.13 ** KEPT (pick-wt=9): 64 [] -occurrence_of(A,tptp0)|next_subocc($f15(A),$f14(A),tptp0).
% 1.91/2.13 ** KEPT (pick-wt=11): 65 [] -occurrence_of(A,tptp0)|occurrence_of($f13(A),tptp2)|occurrence_of($f13(A),tptp1).
% 1.91/2.13 ** KEPT (pick-wt=9): 66 [] -occurrence_of(A,tptp0)|next_subocc($f14(A),$f13(A),tptp0).
% 1.91/2.13 ** KEPT (pick-wt=7): 67 [] -occurrence_of(A,tptp0)|leaf_occ($f13(A),A).
% 1.91/2.13 ** KEPT (pick-wt=2): 68 [] -atomic(tptp0).
% 1.91/2.13 ** KEPT (pick-wt=3): 69 [] tptp4!=tptp3.
% 1.91/2.13 ** KEPT (pick-wt=3): 70 [] tptp4!=tptp2.
% 1.91/2.13 ** KEPT (pick-wt=3): 71 [] tptp4!=tptp1.
% 1.91/2.13 ** KEPT (pick-wt=3): 72 [] tptp3!=tptp2.
% 1.91/2.13 ** KEPT (pick-wt=3): 73 [] tptp3!=tptp1.
% 1.91/2.13 ** KEPT (pick-wt=3): 74 [] tptp2!=tptp1.
% 1.91/2.13 ** KEPT (pick-wt=16): 75 [] -occurrence_of(A,tptp3)| -root_occ(A,$c1)| -occurrence_of(B,tptp2)| -min_precedes(A,B,tptp0)| -leaf_occ(B,$c1).
% 1.91/2.13 ** KEPT (pick-wt=16): 76 [] -occurrence_of(A,tptp3)| -root_occ(A,$c1)| -occurrence_of(B,tptp1)| -min_precedes(A,B,tptp0)| -leaf_occ(B,$c1).
% 3.13/3.31
% 3.13/3.31 ------------> process sos:
% 3.13/3.31 ** KEPT (pick-wt=3): 84 [] A=A.
% 3.13/3.31 ** KEPT (pick-wt=2): 85 [] activity(tptp0).
% 3.13/3.31 ** KEPT (pick-wt=2): 86 [] atomic(tptp4).
% 3.13/3.31 ** KEPT (pick-wt=2): 87 [] atomic(tptp2).
% 3.13/3.31 ** KEPT (pick-wt=2): 88 [] atomic(tptp1).
% 3.13/3.31 ** KEPT (pick-wt=2): 89 [] atomic(tptp3).
% 3.13/3.31 ** KEPT (pick-wt=3): 90 [] occurrence_of($c1,tptp0).
% 3.13/3.31 Following clause subsumed by 84 during input processing: 0 [copy,84,flip.1] A=A.
% 3.13/3.31 84 back subsumes 82.
% 3.13/3.31 84 back subsumes 81.
% 3.13/3.31 84 back subsumes 78.
% 3.13/3.31 84 back subsumes 77.
% 3.13/3.31
% 3.13/3.31 ======= end of input processing =======
% 3.13/3.31
% 3.13/3.31 =========== start of search ===========
% 3.13/3.31
% 3.13/3.31
% 3.13/3.31 Resetting weight limit to 11.
% 3.13/3.31
% 3.13/3.31
% 3.13/3.31 Resetting weight limit to 11.
% 3.13/3.31
% 3.13/3.31 sos_size=1553
% 3.13/3.31
% 3.13/3.31 -------- PROOF --------
% 3.13/3.31
% 3.13/3.31 ----> UNIT CONFLICT at 1.18 sec ----> 1875 [binary,1873.1,74.1] $F.
% 3.13/3.31
% 3.13/3.31 Length of proof is 24. Level of proof is 9.
% 3.13/3.31
% 3.13/3.31 ---------------- PROOF ----------------
% 3.13/3.31 % SZS status Theorem
% 3.13/3.31 % SZS output start Refutation
% See solution above
% 3.13/3.31 ------------ end of proof -------------
% 3.13/3.31
% 3.13/3.31
% 3.13/3.31 Search stopped by max_proofs option.
% 3.13/3.31
% 3.13/3.31
% 3.13/3.31 Search stopped by max_proofs option.
% 3.13/3.31
% 3.13/3.31 ============ end of search ============
% 3.13/3.31
% 3.13/3.31 -------------- statistics -------------
% 3.13/3.31 clauses given 213
% 3.13/3.31 clauses generated 8052
% 3.13/3.31 clauses kept 1865
% 3.13/3.31 clauses forward subsumed 3232
% 3.13/3.31 clauses back subsumed 20
% 3.13/3.31 Kbytes malloced 4882
% 3.13/3.31
% 3.13/3.31 ----------- times (seconds) -----------
% 3.13/3.31 user CPU time 1.18 (0 hr, 0 min, 1 sec)
% 3.13/3.31 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 3.13/3.31 wall-clock time 3 (0 hr, 0 min, 3 sec)
% 3.13/3.31
% 3.13/3.31 That finishes the proof of the theorem.
% 3.13/3.31
% 3.13/3.31 Process 4119 finished Wed Jul 27 04:59:55 2022
% 3.13/3.31 Otter interrupted
% 3.13/3.31 PROOF FOUND
%------------------------------------------------------------------------------