TSTP Solution File: SEU375+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU375+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n012.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:15:56 EDT 2022
% Result : Theorem 1.97s 2.16s
% Output : Refutation 1.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 23
% Syntax : Number of clauses : 38 ( 27 unt; 3 nHn; 37 RR)
% Number of literals : 71 ( 5 equ; 33 neg)
% Maximal clause size : 13 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-1 aty)
% Number of variables : 24 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(6,axiom,
( ~ one_sorted_str(A)
| ~ net_str(B,A)
| ~ subnetstr(C,A,B)
| ~ full_subnetstr(C,A,B)
| full_subrelstr(C,B) ),
file('SEU375+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ one_sorted_str(A)
| ~ net_str(B,A)
| ~ subnetstr(C,A,B)
| ~ full_subnetstr(C,A,B)
| subrelstr(C,B) ),
file('SEU375+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ rel_str(A)
| one_sorted_str(A) ),
file('SEU375+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ one_sorted_str(A)
| ~ net_str(B,A)
| rel_str(B) ),
file('SEU375+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ one_sorted_str(A)
| ~ net_str(B,A)
| ~ subnetstr(C,A,B)
| net_str(C,A) ),
file('SEU375+1.p',unknown),
[] ).
cnf(16,axiom,
( empty_carrier(A)
| ~ one_sorted_str(A)
| ~ empty(the_carrier(A)) ),
file('SEU375+1.p',unknown),
[] ).
cnf(21,axiom,
~ empty_carrier(dollar_c16),
file('SEU375+1.p',unknown),
[] ).
cnf(22,axiom,
~ related(dollar_c16,dollar_c13,dollar_c12),
file('SEU375+1.p',unknown),
[] ).
cnf(23,axiom,
( ~ element(A,B)
| empty(B)
| in(A,B) ),
file('SEU375+1.p',unknown),
[] ).
cnf(24,axiom,
( ~ rel_str(A)
| ~ full_subrelstr(B,A)
| ~ subrelstr(B,A)
| ~ element(C,the_carrier(A))
| ~ element(D,the_carrier(A))
| ~ element(E,the_carrier(B))
| ~ element(F,the_carrier(B))
| E != C
| F != D
| ~ related(A,C,D)
| ~ in(E,the_carrier(B))
| ~ in(F,the_carrier(B))
| related(B,E,F) ),
file('SEU375+1.p',unknown),
[] ).
cnf(26,axiom,
( ~ in(A,B)
| ~ empty(B) ),
file('SEU375+1.p',unknown),
[] ).
cnf(42,axiom,
A = A,
file('SEU375+1.p',unknown),
[] ).
cnf(69,axiom,
one_sorted_str(dollar_c18),
file('SEU375+1.p',unknown),
[] ).
cnf(70,axiom,
net_str(dollar_c17,dollar_c18),
file('SEU375+1.p',unknown),
[] ).
cnf(71,axiom,
full_subnetstr(dollar_c16,dollar_c18,dollar_c17),
file('SEU375+1.p',unknown),
[] ).
cnf(72,axiom,
subnetstr(dollar_c16,dollar_c18,dollar_c17),
file('SEU375+1.p',unknown),
[] ).
cnf(73,axiom,
element(dollar_c15,the_carrier(dollar_c17)),
file('SEU375+1.p',unknown),
[] ).
cnf(74,axiom,
element(dollar_c14,the_carrier(dollar_c17)),
file('SEU375+1.p',unknown),
[] ).
cnf(75,axiom,
element(dollar_c13,the_carrier(dollar_c16)),
file('SEU375+1.p',unknown),
[] ).
cnf(76,axiom,
element(dollar_c12,the_carrier(dollar_c16)),
file('SEU375+1.p',unknown),
[] ).
cnf(78,axiom,
dollar_c15 = dollar_c13,
file('SEU375+1.p',unknown),
[] ).
cnf(80,axiom,
dollar_c14 = dollar_c12,
file('SEU375+1.p',unknown),
[] ).
cnf(81,axiom,
related(dollar_c17,dollar_c15,dollar_c14),
file('SEU375+1.p',unknown),
[] ).
cnf(82,plain,
related(dollar_c17,dollar_c13,dollar_c12),
inference(demod,[status(thm),theory(equality)],[inference(copy,[status(thm)],[81]),78,80]),
[iquote('copy,81,demod,78,80')] ).
cnf(83,plain,
element(dollar_c13,the_carrier(dollar_c17)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[73]),78]),
[iquote('back_demod,73,demod,78')] ).
cnf(84,plain,
element(dollar_c12,the_carrier(dollar_c17)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[74]),80]),
[iquote('back_demod,74,demod,80')] ).
cnf(116,plain,
rel_str(dollar_c17),
inference(hyper,[status(thm)],[70,10,69]),
[iquote('hyper,70,10,69')] ).
cnf(128,plain,
net_str(dollar_c16,dollar_c18),
inference(hyper,[status(thm)],[72,12,69,70]),
[iquote('hyper,72,12,69,70')] ).
cnf(129,plain,
subrelstr(dollar_c16,dollar_c17),
inference(hyper,[status(thm)],[72,7,69,70,71]),
[iquote('hyper,72,7,69,70,71')] ).
cnf(130,plain,
full_subrelstr(dollar_c16,dollar_c17),
inference(hyper,[status(thm)],[72,6,69,70,71]),
[iquote('hyper,72,6,69,70,71')] ).
cnf(134,plain,
( empty(the_carrier(dollar_c16))
| in(dollar_c13,the_carrier(dollar_c16)) ),
inference(hyper,[status(thm)],[75,23]),
[iquote('hyper,75,23')] ).
cnf(139,plain,
rel_str(dollar_c16),
inference(hyper,[status(thm)],[128,10,69]),
[iquote('hyper,128,10,69')] ).
cnf(143,plain,
one_sorted_str(dollar_c16),
inference(hyper,[status(thm)],[139,9]),
[iquote('hyper,139,9')] ).
cnf(149,plain,
( empty(the_carrier(dollar_c16))
| in(dollar_c12,the_carrier(dollar_c16)) ),
inference(hyper,[status(thm)],[76,23]),
[iquote('hyper,76,23')] ).
cnf(617,plain,
in(dollar_c13,the_carrier(dollar_c16)),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[134,16,143]),21]),
[iquote('hyper,134,16,143,unit_del,21')] ).
cnf(936,plain,
in(dollar_c12,the_carrier(dollar_c16)),
inference(hyper,[status(thm)],[149,26,617]),
[iquote('hyper,149,26,617')] ).
cnf(937,plain,
related(dollar_c16,dollar_c13,dollar_c12),
inference(hyper,[status(thm)],[936,24,116,130,129,83,84,75,76,42,42,82,617]),
[iquote('hyper,936,24,116,130,129,83,84,75,76,42,42,82,617')] ).
cnf(938,plain,
$false,
inference(binary,[status(thm)],[937,22]),
[iquote('binary,937.1,22.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.11 % Problem : SEU375+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n012.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 08:02:35 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.86/2.10 ----- Otter 3.3f, August 2004 -----
% 1.86/2.10 The process was started by sandbox on n012.cluster.edu,
% 1.86/2.10 Wed Jul 27 08:02:35 2022
% 1.86/2.10 The command was "./otter". The process ID is 6484.
% 1.86/2.10
% 1.86/2.10 set(prolog_style_variables).
% 1.86/2.10 set(auto).
% 1.86/2.10 dependent: set(auto1).
% 1.86/2.10 dependent: set(process_input).
% 1.86/2.10 dependent: clear(print_kept).
% 1.86/2.10 dependent: clear(print_new_demod).
% 1.86/2.10 dependent: clear(print_back_demod).
% 1.86/2.10 dependent: clear(print_back_sub).
% 1.86/2.10 dependent: set(control_memory).
% 1.86/2.10 dependent: assign(max_mem, 12000).
% 1.86/2.10 dependent: assign(pick_given_ratio, 4).
% 1.86/2.10 dependent: assign(stats_level, 1).
% 1.86/2.10 dependent: assign(max_seconds, 10800).
% 1.86/2.10 clear(print_given).
% 1.86/2.10
% 1.86/2.10 formula_list(usable).
% 1.86/2.10 all A (A=A).
% 1.86/2.10 all A B (in(A,B)-> -in(B,A)).
% 1.86/2.10 all A (empty(A)->function(A)).
% 1.86/2.10 all A (empty(A)->relation(A)).
% 1.86/2.10 all A (rel_str(A)-> (empty_carrier(A)->v1_yellow_3(A))).
% 1.86/2.10 all A (relation(A)&empty(A)&function(A)->relation(A)&function(A)&one_to_one(A)).
% 1.86/2.10 all A (rel_str(A)-> (-v1_yellow_3(A)-> -empty_carrier(A))).
% 1.86/2.10 all A (one_sorted_str(A)-> (all B (net_str(B,A)-> (all C (subnetstr(C,A,B)-> (full_subnetstr(C,A,B)<->full_subrelstr(C,B)&subrelstr(C,B))))))).
% 1.86/2.10 $T.
% 1.86/2.10 all A (rel_str(A)->one_sorted_str(A)).
% 1.86/2.10 $T.
% 1.86/2.10 all A (one_sorted_str(A)-> (all B (net_str(B,A)->rel_str(B)))).
% 1.86/2.10 $T.
% 1.86/2.10 all A (rel_str(A)-> (all B (subrelstr(B,A)->rel_str(B)))).
% 1.86/2.10 all A B (one_sorted_str(A)&net_str(B,A)-> (all C (subnetstr(C,A,B)->net_str(C,A)))).
% 1.86/2.10 $T.
% 1.86/2.10 exists A rel_str(A).
% 1.86/2.10 exists A one_sorted_str(A).
% 1.86/2.10 all A (one_sorted_str(A)-> (exists B net_str(B,A))).
% 1.86/2.10 all A exists B element(B,A).
% 1.86/2.10 all A (rel_str(A)-> (exists B subrelstr(B,A))).
% 1.86/2.10 all A B (one_sorted_str(A)&net_str(B,A)-> (exists C subnetstr(C,A,B))).
% 1.86/2.10 empty(empty_set).
% 1.86/2.10 relation(empty_set).
% 1.86/2.10 relation_empty_yielding(empty_set).
% 1.86/2.10 all A (-empty_carrier(A)&one_sorted_str(A)-> -empty(the_carrier(A))).
% 1.86/2.10 empty(empty_set).
% 1.86/2.10 relation(empty_set).
% 1.86/2.10 exists A (relation(A)&function(A)).
% 1.86/2.10 exists A (relation(A)&relation_empty_yielding(A)&function(A)).
% 1.86/2.10 exists A (empty(A)&relation(A)).
% 1.86/2.10 exists A (relation(A)&empty(A)&function(A)).
% 1.86/2.10 exists A (-empty(A)&relation(A)).
% 1.86/2.10 exists A (relation(A)&function(A)&one_to_one(A)).
% 1.86/2.10 exists A (relation(A)&relation_empty_yielding(A)).
% 1.86/2.10 exists A (one_sorted_str(A)& -empty_carrier(A)).
% 1.86/2.10 exists A (relation(A)&relation_empty_yielding(A)&function(A)).
% 1.86/2.10 all A B (in(A,B)->element(A,B)).
% 1.86/2.10 -(all A (one_sorted_str(A)-> (all B (-empty_carrier(B)&net_str(B,A)-> (all C (-empty_carrier(C)&full_subnetstr(C,A,B)&subnetstr(C,A,B)-> (all D (element(D,the_carrier(B))-> (all E (element(E,the_carrier(B))-> (all F (element(F,the_carrier(C))-> (all G (element(G,the_carrier(C))-> (D=F&E=G&related(B,D,E)->related(C,F,G)))))))))))))))).
% 1.86/2.10 all A B (element(A,B)->empty(B)|in(A,B)).
% 1.86/2.10 all A (rel_str(A)-> (all B (full_subrelstr(B,A)&subrelstr(B,A)-> (all C (element(C,the_carrier(A))-> (all D (element(D,the_carrier(A))-> (all E (element(E,the_carrier(B))-> (all F (element(F,the_carrier(B))-> (E=C&F=D&related(A,C,D)&in(E,the_carrier(B))&in(F,the_carrier(B))->related(B,E,F))))))))))))).
% 1.86/2.10 all A (empty(A)->A=empty_set).
% 1.86/2.10 all A B (-(in(A,B)&empty(B))).
% 1.86/2.10 all A B (-(empty(A)&A!=B&empty(B))).
% 1.86/2.10 end_of_list.
% 1.86/2.10
% 1.86/2.10 -------> usable clausifies to:
% 1.86/2.10
% 1.86/2.10 list(usable).
% 1.86/2.10 0 [] A=A.
% 1.86/2.10 0 [] -in(A,B)| -in(B,A).
% 1.86/2.10 0 [] -empty(A)|function(A).
% 1.86/2.10 0 [] -empty(A)|relation(A).
% 1.86/2.10 0 [] -rel_str(A)| -empty_carrier(A)|v1_yellow_3(A).
% 1.86/2.10 0 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 1.86/2.10 0 [] -rel_str(A)|v1_yellow_3(A)| -empty_carrier(A).
% 1.86/2.10 0 [] -one_sorted_str(A)| -net_str(B,A)| -subnetstr(C,A,B)| -full_subnetstr(C,A,B)|full_subrelstr(C,B).
% 1.86/2.10 0 [] -one_sorted_str(A)| -net_str(B,A)| -subnetstr(C,A,B)| -full_subnetstr(C,A,B)|subrelstr(C,B).
% 1.86/2.10 0 [] -one_sorted_str(A)| -net_str(B,A)| -subnetstr(C,A,B)|full_subnetstr(C,A,B)| -full_subrelstr(C,B)| -subrelstr(C,B).
% 1.86/2.10 0 [] $T.
% 1.86/2.10 0 [] -rel_str(A)|one_sorted_str(A).
% 1.86/2.10 0 [] $T.
% 1.86/2.10 0 [] -one_sorted_str(A)| -net_str(B,A)|rel_str(B).
% 1.86/2.10 0 [] $T.
% 1.86/2.10 0 [] -rel_str(A)| -subrelstr(B,A)|rel_str(B).
% 1.86/2.10 0 [] -one_sorted_str(A)| -net_str(B,A)| -subnetstr(C,A,B)|net_str(C,A).
% 1.86/2.10 0 [] $T.
% 1.86/2.10 0 [] rel_str($c1).
% 1.86/2.10 0 [] one_sorted_str($c2).
% 1.86/2.10 0 [] -one_sorted_str(A)|net_str($f1(A),A).
% 1.86/2.10 0 [] element($f2(A),A).
% 1.86/2.10 0 [] -rel_str(A)|subrelstr($f3(A),A).
% 1.86/2.10 0 [] -one_sorted_str(A)| -net_str(B,A)|subnetstr($f4(A,B),A,B).
% 1.86/2.10 0 [] empty(empty_set).
% 1.86/2.10 0 [] relation(empty_set).
% 1.86/2.10 0 [] relation_empty_yielding(empty_set).
% 1.86/2.10 0 [] empty_carrier(A)| -one_sorted_str(A)| -empty(the_carrier(A)).
% 1.86/2.10 0 [] empty(empty_set).
% 1.86/2.10 0 [] relation(empty_set).
% 1.86/2.10 0 [] relation($c3).
% 1.86/2.10 0 [] function($c3).
% 1.86/2.10 0 [] relation($c4).
% 1.86/2.10 0 [] relation_empty_yielding($c4).
% 1.86/2.10 0 [] function($c4).
% 1.86/2.10 0 [] empty($c5).
% 1.86/2.10 0 [] relation($c5).
% 1.86/2.10 0 [] relation($c6).
% 1.86/2.10 0 [] empty($c6).
% 1.86/2.10 0 [] function($c6).
% 1.86/2.10 0 [] -empty($c7).
% 1.86/2.10 0 [] relation($c7).
% 1.86/2.10 0 [] relation($c8).
% 1.86/2.10 0 [] function($c8).
% 1.86/2.10 0 [] one_to_one($c8).
% 1.86/2.10 0 [] relation($c9).
% 1.86/2.10 0 [] relation_empty_yielding($c9).
% 1.86/2.10 0 [] one_sorted_str($c10).
% 1.86/2.10 0 [] -empty_carrier($c10).
% 1.86/2.10 0 [] relation($c11).
% 1.86/2.10 0 [] relation_empty_yielding($c11).
% 1.86/2.10 0 [] function($c11).
% 1.86/2.10 0 [] -in(A,B)|element(A,B).
% 1.86/2.10 0 [] one_sorted_str($c18).
% 1.86/2.10 0 [] -empty_carrier($c17).
% 1.86/2.10 0 [] net_str($c17,$c18).
% 1.86/2.10 0 [] -empty_carrier($c16).
% 1.86/2.10 0 [] full_subnetstr($c16,$c18,$c17).
% 1.86/2.10 0 [] subnetstr($c16,$c18,$c17).
% 1.86/2.10 0 [] element($c15,the_carrier($c17)).
% 1.86/2.10 0 [] element($c14,the_carrier($c17)).
% 1.86/2.10 0 [] element($c13,the_carrier($c16)).
% 1.86/2.10 0 [] element($c12,the_carrier($c16)).
% 1.86/2.10 0 [] $c15=$c13.
% 1.86/2.10 0 [] $c14=$c12.
% 1.86/2.10 0 [] related($c17,$c15,$c14).
% 1.86/2.10 0 [] -related($c16,$c13,$c12).
% 1.86/2.10 0 [] -element(A,B)|empty(B)|in(A,B).
% 1.86/2.10 0 [] -rel_str(A)| -full_subrelstr(B,A)| -subrelstr(B,A)| -element(C,the_carrier(A))| -element(D,the_carrier(A))| -element(E,the_carrier(B))| -element(F,the_carrier(B))|E!=C|F!=D| -related(A,C,D)| -in(E,the_carrier(B))| -in(F,the_carrier(B))|related(B,E,F).
% 1.86/2.10 0 [] -empty(A)|A=empty_set.
% 1.86/2.10 0 [] -in(A,B)| -empty(B).
% 1.86/2.10 0 [] -empty(A)|A=B| -empty(B).
% 1.86/2.10 end_of_list.
% 1.86/2.10
% 1.86/2.10 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=13.
% 1.86/2.10
% 1.86/2.10 This ia a non-Horn set with equality. The strategy will be
% 1.86/2.10 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.86/2.10 deletion, with positive clauses in sos and nonpositive
% 1.86/2.10 clauses in usable.
% 1.86/2.10
% 1.86/2.10 dependent: set(knuth_bendix).
% 1.86/2.10 dependent: set(anl_eq).
% 1.86/2.10 dependent: set(para_from).
% 1.86/2.10 dependent: set(para_into).
% 1.86/2.10 dependent: clear(para_from_right).
% 1.86/2.10 dependent: clear(para_into_right).
% 1.86/2.10 dependent: set(para_from_vars).
% 1.86/2.10 dependent: set(eq_units_both_ways).
% 1.86/2.10 dependent: set(dynamic_demod_all).
% 1.86/2.10 dependent: set(dynamic_demod).
% 1.86/2.10 dependent: set(order_eq).
% 1.86/2.10 dependent: set(back_demod).
% 1.86/2.10 dependent: set(lrpo).
% 1.86/2.10 dependent: set(hyper_res).
% 1.86/2.10 dependent: set(unit_deletion).
% 1.86/2.10 dependent: set(factor).
% 1.86/2.10
% 1.86/2.10 ------------> process usable:
% 1.86/2.10 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.86/2.10 ** KEPT (pick-wt=4): 2 [] -empty(A)|function(A).
% 1.86/2.10 ** KEPT (pick-wt=4): 3 [] -empty(A)|relation(A).
% 1.86/2.10 ** KEPT (pick-wt=6): 4 [] -rel_str(A)| -empty_carrier(A)|v1_yellow_3(A).
% 1.86/2.10 ** KEPT (pick-wt=8): 5 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 1.86/2.10 Following clause subsumed by 4 during input processing: 0 [] -rel_str(A)|v1_yellow_3(A)| -empty_carrier(A).
% 1.86/2.10 ** KEPT (pick-wt=16): 6 [] -one_sorted_str(A)| -net_str(B,A)| -subnetstr(C,A,B)| -full_subnetstr(C,A,B)|full_subrelstr(C,B).
% 1.86/2.10 ** KEPT (pick-wt=16): 7 [] -one_sorted_str(A)| -net_str(B,A)| -subnetstr(C,A,B)| -full_subnetstr(C,A,B)|subrelstr(C,B).
% 1.86/2.10 ** KEPT (pick-wt=19): 8 [] -one_sorted_str(A)| -net_str(B,A)| -subnetstr(C,A,B)|full_subnetstr(C,A,B)| -full_subrelstr(C,B)| -subrelstr(C,B).
% 1.86/2.10 ** KEPT (pick-wt=4): 9 [] -rel_str(A)|one_sorted_str(A).
% 1.86/2.10 ** KEPT (pick-wt=7): 10 [] -one_sorted_str(A)| -net_str(B,A)|rel_str(B).
% 1.86/2.10 ** KEPT (pick-wt=7): 11 [] -rel_str(A)| -subrelstr(B,A)|rel_str(B).
% 1.86/2.10 ** KEPT (pick-wt=12): 12 [] -one_sorted_str(A)| -net_str(B,A)| -subnetstr(C,A,B)|net_str(C,A).
% 1.86/2.10 ** KEPT (pick-wt=6): 13 [] -one_sorted_str(A)|net_str($f1(A),A).
% 1.86/2.10 ** KEPT (pick-wt=6): 14 [] -rel_str(A)|subrelstr($f3(A),A).
% 1.86/2.10 ** KEPT (pick-wt=11): 15 [] -one_sorted_str(A)| -net_str(B,A)|subnetstr($f4(A,B),A,B).
% 1.86/2.10 ** KEPT (pick-wt=7): 16 [] empty_carrier(A)| -one_sorted_str(A)| -empty(the_carrier(A)).
% 1.86/2.10 ** KEPT (pick-wt=2): 17 [] -empty($c7).
% 1.86/2.10 ** KEPT (pick-wt=2): 18 [] -empty_carrier($c10).
% 1.86/2.10 ** KEPT (pick-wt=6): 19 [] -in(A,B)|element(A,B).
% 1.86/2.10 ** KEPT (pick-wt=2): 20 [] -empty_carrier($c17).
% 1.86/2.10 ** KEPT (pick-wt=2): 21 [] -empty_carrier($c16).
% 1.86/2.10 ** KEPT (pick-wt=4): 22 [] -related($c16,$c13,$c12).
% 1.86/2.10 ** KEPT (pick-wt=8): 23 [] -element(A,B)|empty(B)|in(A,B).
% 1.97/2.16 ** KEPT (pick-wt=46): 24 [] -rel_str(A)| -full_subrelstr(B,A)| -subrelstr(B,A)| -element(C,the_carrier(A))| -element(D,the_carrier(A))| -element(E,the_carrier(B))| -element(F,the_carrier(B))|E!=C|F!=D| -related(A,C,D)| -in(E,the_carrier(B))| -in(F,the_carrier(B))|related(B,E,F).
% 1.97/2.16 ** KEPT (pick-wt=5): 25 [] -empty(A)|A=empty_set.
% 1.97/2.16 ** KEPT (pick-wt=5): 26 [] -in(A,B)| -empty(B).
% 1.97/2.16 ** KEPT (pick-wt=7): 27 [] -empty(A)|A=B| -empty(B).
% 1.97/2.16
% 1.97/2.16 ------------> process sos:
% 1.97/2.16 ** KEPT (pick-wt=3): 42 [] A=A.
% 1.97/2.16 ** KEPT (pick-wt=2): 43 [] rel_str($c1).
% 1.97/2.16 ** KEPT (pick-wt=2): 44 [] one_sorted_str($c2).
% 1.97/2.16 ** KEPT (pick-wt=4): 45 [] element($f2(A),A).
% 1.97/2.16 ** KEPT (pick-wt=2): 46 [] empty(empty_set).
% 1.97/2.16 ** KEPT (pick-wt=2): 47 [] relation(empty_set).
% 1.97/2.16 ** KEPT (pick-wt=2): 48 [] relation_empty_yielding(empty_set).
% 1.97/2.16 Following clause subsumed by 46 during input processing: 0 [] empty(empty_set).
% 1.97/2.16 Following clause subsumed by 47 during input processing: 0 [] relation(empty_set).
% 1.97/2.16 ** KEPT (pick-wt=2): 49 [] relation($c3).
% 1.97/2.16 ** KEPT (pick-wt=2): 50 [] function($c3).
% 1.97/2.16 ** KEPT (pick-wt=2): 51 [] relation($c4).
% 1.97/2.16 ** KEPT (pick-wt=2): 52 [] relation_empty_yielding($c4).
% 1.97/2.16 ** KEPT (pick-wt=2): 53 [] function($c4).
% 1.97/2.16 ** KEPT (pick-wt=2): 54 [] empty($c5).
% 1.97/2.16 ** KEPT (pick-wt=2): 55 [] relation($c5).
% 1.97/2.16 ** KEPT (pick-wt=2): 56 [] relation($c6).
% 1.97/2.16 ** KEPT (pick-wt=2): 57 [] empty($c6).
% 1.97/2.16 ** KEPT (pick-wt=2): 58 [] function($c6).
% 1.97/2.16 ** KEPT (pick-wt=2): 59 [] relation($c7).
% 1.97/2.16 ** KEPT (pick-wt=2): 60 [] relation($c8).
% 1.97/2.16 ** KEPT (pick-wt=2): 61 [] function($c8).
% 1.97/2.16 ** KEPT (pick-wt=2): 62 [] one_to_one($c8).
% 1.97/2.16 ** KEPT (pick-wt=2): 63 [] relation($c9).
% 1.97/2.16 ** KEPT (pick-wt=2): 64 [] relation_empty_yielding($c9).
% 1.97/2.16 ** KEPT (pick-wt=2): 65 [] one_sorted_str($c10).
% 1.97/2.16 ** KEPT (pick-wt=2): 66 [] relation($c11).
% 1.97/2.16 ** KEPT (pick-wt=2): 67 [] relation_empty_yielding($c11).
% 1.97/2.16 ** KEPT (pick-wt=2): 68 [] function($c11).
% 1.97/2.16 ** KEPT (pick-wt=2): 69 [] one_sorted_str($c18).
% 1.97/2.16 ** KEPT (pick-wt=3): 70 [] net_str($c17,$c18).
% 1.97/2.16 ** KEPT (pick-wt=4): 71 [] full_subnetstr($c16,$c18,$c17).
% 1.97/2.16 ** KEPT (pick-wt=4): 72 [] subnetstr($c16,$c18,$c17).
% 1.97/2.16 ** KEPT (pick-wt=4): 73 [] element($c15,the_carrier($c17)).
% 1.97/2.16 ** KEPT (pick-wt=4): 74 [] element($c14,the_carrier($c17)).
% 1.97/2.16 ** KEPT (pick-wt=4): 75 [] element($c13,the_carrier($c16)).
% 1.97/2.16 ** KEPT (pick-wt=4): 76 [] element($c12,the_carrier($c16)).
% 1.97/2.16 ** KEPT (pick-wt=3): 77 [] $c15=$c13.
% 1.97/2.16 ---> New Demodulator: 78 [new_demod,77] $c15=$c13.
% 1.97/2.16 ** KEPT (pick-wt=3): 79 [] $c14=$c12.
% 1.97/2.16 ---> New Demodulator: 80 [new_demod,79] $c14=$c12.
% 1.97/2.16 ** KEPT (pick-wt=4): 82 [copy,81,demod,78,80] related($c17,$c13,$c12).
% 1.97/2.16 Following clause subsumed by 42 during input processing: 0 [copy,42,flip.1] A=A.
% 1.97/2.16 42 back subsumes 36.
% 1.97/2.16 >>>> Starting back demodulation with 78.
% 1.97/2.16 >> back demodulating 73 with 78.
% 1.97/2.16 >>>> Starting back demodulation with 80.
% 1.97/2.16 >> back demodulating 74 with 80.
% 1.97/2.16
% 1.97/2.16 ======= end of input processing =======
% 1.97/2.16
% 1.97/2.16 =========== start of search ===========
% 1.97/2.16
% 1.97/2.16 -------- PROOF --------
% 1.97/2.16
% 1.97/2.16 ----> UNIT CONFLICT at 0.07 sec ----> 938 [binary,937.1,22.1] $F.
% 1.97/2.16
% 1.97/2.16 Length of proof is 14. Level of proof is 6.
% 1.97/2.16
% 1.97/2.16 ---------------- PROOF ----------------
% 1.97/2.16 % SZS status Theorem
% 1.97/2.16 % SZS output start Refutation
% See solution above
% 1.97/2.16 ------------ end of proof -------------
% 1.97/2.16
% 1.97/2.16
% 1.97/2.16 Search stopped by max_proofs option.
% 1.97/2.16
% 1.97/2.16
% 1.97/2.16 Search stopped by max_proofs option.
% 1.97/2.16
% 1.97/2.16 ============ end of search ============
% 1.97/2.16
% 1.97/2.16 -------------- statistics -------------
% 1.97/2.16 clauses given 197
% 1.97/2.16 clauses generated 1953
% 1.97/2.16 clauses kept 932
% 1.97/2.16 clauses forward subsumed 1076
% 1.97/2.16 clauses back subsumed 59
% 1.97/2.16 Kbytes malloced 2929
% 1.97/2.16
% 1.97/2.16 ----------- times (seconds) -----------
% 1.97/2.16 user CPU time 0.07 (0 hr, 0 min, 0 sec)
% 1.97/2.16 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.97/2.16 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.97/2.16
% 1.97/2.16 That finishes the proof of the theorem.
% 1.97/2.16
% 1.97/2.16 Process 6484 finished Wed Jul 27 08:02:37 2022
% 1.97/2.16 Otter interrupted
% 1.97/2.16 PROOF FOUND
%------------------------------------------------------------------------------