%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU374+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n024.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.74s 1.92s
% Output : Refutation 1.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 16
% Syntax : Number of clauses : 24 ( 20 unt; 0 nHn; 23 RR)
% Number of literals : 42 ( 5 equ; 20 neg)
% Maximal clause size : 10 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-1 aty)
% Number of variables : 15 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(6,axiom,
( ~ one_sorted_str(A)
| ~ net_str(B,A)
| ~ net_str(C,A)
| ~ subnetstr(C,A,B)
| subrelstr(C,B) ),
file('SEU374+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ one_sorted_str(A)
| ~ net_str(B,A)
| rel_str(B) ),
file('SEU374+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ one_sorted_str(A)
| ~ net_str(B,A)
| ~ subnetstr(C,A,B)
| net_str(C,A) ),
file('SEU374+1.p',unknown),
[] ).
cnf(32,axiom,
~ related(dollar_c16,dollar_c14,dollar_c13),
file('SEU374+1.p',unknown),
[] ).
cnf(38,axiom,
( ~ rel_str(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(B,E,F)
| related(A,C,D) ),
file('SEU374+1.p',unknown),
[] ).
cnf(60,axiom,
A = A,
file('SEU374+1.p',unknown),
[] ).
cnf(92,axiom,
one_sorted_str(dollar_c17),
file('SEU374+1.p',unknown),
[] ).
cnf(93,axiom,
net_str(dollar_c16,dollar_c17),
file('SEU374+1.p',unknown),
[] ).
cnf(94,axiom,
subnetstr(dollar_c15,dollar_c17,dollar_c16),
file('SEU374+1.p',unknown),
[] ).
cnf(95,axiom,
element(dollar_c14,the_carrier(dollar_c16)),
file('SEU374+1.p',unknown),
[] ).
cnf(96,axiom,
element(dollar_c13,the_carrier(dollar_c16)),
file('SEU374+1.p',unknown),
[] ).
cnf(97,axiom,
element(dollar_c12,the_carrier(dollar_c15)),
file('SEU374+1.p',unknown),
[] ).
cnf(98,axiom,
element(dollar_c11,the_carrier(dollar_c15)),
file('SEU374+1.p',unknown),
[] ).
cnf(100,axiom,
dollar_c14 = dollar_c12,
file('SEU374+1.p',unknown),
[] ).
cnf(102,axiom,
dollar_c13 = dollar_c11,
file('SEU374+1.p',unknown),
[] ).
cnf(103,axiom,
related(dollar_c15,dollar_c12,dollar_c11),
file('SEU374+1.p',unknown),
[] ).
cnf(104,plain,
element(dollar_c12,the_carrier(dollar_c16)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[95]),100]),
[iquote('back_demod,95,demod,100')] ).
cnf(105,plain,
~ related(dollar_c16,dollar_c12,dollar_c11),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[32]),100,102]),
[iquote('back_demod,32,demod,100,102')] ).
cnf(106,plain,
element(dollar_c11,the_carrier(dollar_c16)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[96]),102]),
[iquote('back_demod,96,demod,102')] ).
cnf(197,plain,
rel_str(dollar_c16),
inference(hyper,[status(thm)],[93,12,92]),
[iquote('hyper,93,12,92')] ).
cnf(205,plain,
net_str(dollar_c15,dollar_c17),
inference(hyper,[status(thm)],[94,14,92,93]),
[iquote('hyper,94,14,92,93')] ).
cnf(221,plain,
subrelstr(dollar_c15,dollar_c16),
inference(hyper,[status(thm)],[205,6,92,93,94]),
[iquote('hyper,205,6,92,93,94')] ).
cnf(245,plain,
related(dollar_c16,dollar_c12,dollar_c11),
inference(hyper,[status(thm)],[106,38,197,221,104,97,98,60,60,103]),
[iquote('hyper,106,38,197,221,104,97,98,60,60,103')] ).
cnf(246,plain,
$false,
inference(binary,[status(thm)],[245,105]),
[iquote('binary,245.1,105.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEU374+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n024.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 07:35:25 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.70/1.91 ----- Otter 3.3f, August 2004 -----
% 1.70/1.91 The process was started by sandbox2 on n024.cluster.edu,
% 1.70/1.91 Wed Jul 27 07:35:25 2022
% 1.70/1.91 The command was "./otter". The process ID is 29187.
% 1.70/1.91
% 1.70/1.91 set(prolog_style_variables).
% 1.70/1.91 set(auto).
% 1.70/1.91 dependent: set(auto1).
% 1.70/1.91 dependent: set(process_input).
% 1.70/1.91 dependent: clear(print_kept).
% 1.70/1.91 dependent: clear(print_new_demod).
% 1.70/1.91 dependent: clear(print_back_demod).
% 1.70/1.91 dependent: clear(print_back_sub).
% 1.70/1.91 dependent: set(control_memory).
% 1.70/1.91 dependent: assign(max_mem, 12000).
% 1.70/1.91 dependent: assign(pick_given_ratio, 4).
% 1.70/1.91 dependent: assign(stats_level, 1).
% 1.70/1.91 dependent: assign(max_seconds, 10800).
% 1.70/1.91 clear(print_given).
% 1.70/1.91
% 1.70/1.91 formula_list(usable).
% 1.70/1.91 all A (A=A).
% 1.70/1.91 all A B (in(A,B)-> -in(B,A)).
% 1.70/1.91 all A (empty(A)->function(A)).
% 1.70/1.91 all A (empty(A)->relation(A)).
% 1.70/1.91 all A B C (element(C,powerset(cartesian_product2(A,B)))->relation(C)).
% 1.70/1.91 all A (relation(A)&empty(A)&function(A)->relation(A)&function(A)&one_to_one(A)).
% 1.70/1.91 all A (one_sorted_str(A)-> (all B (net_str(B,A)-> (all C (net_str(C,A)-> (subnetstr(C,A,B)<->subrelstr(C,B)&the_mapping(A,C)=relation_dom_restr_as_relation_of(the_carrier(B),the_carrier(A),the_mapping(A,B),the_carrier(C)))))))).
% 1.70/1.91 $T.
% 1.70/1.91 $T.
% 1.70/1.91 $T.
% 1.70/1.91 all A B (relation(A)->relation(relation_dom_restriction(A,B))).
% 1.70/1.91 all A B C D (relation_of2(C,A,B)->relation_of2_as_subset(relation_dom_restr_as_relation_of(A,B,C,D),A,B)).
% 1.70/1.91 all A (rel_str(A)->one_sorted_str(A)).
% 1.70/1.91 $T.
% 1.70/1.91 all A (one_sorted_str(A)-> (all B (net_str(B,A)->rel_str(B)))).
% 1.70/1.91 $T.
% 1.70/1.91 $T.
% 1.70/1.91 all A (rel_str(A)-> (all B (subrelstr(B,A)->rel_str(B)))).
% 1.70/1.91 all A B (one_sorted_str(A)&net_str(B,A)-> (all C (subnetstr(C,A,B)->net_str(C,A)))).
% 1.70/1.91 all A B C (relation_of2_as_subset(C,A,B)->element(C,powerset(cartesian_product2(A,B)))).
% 1.70/1.91 $T.
% 1.70/1.91 all A B (one_sorted_str(A)&net_str(B,A)->function(the_mapping(A,B))&quasi_total(the_mapping(A,B),the_carrier(B),the_carrier(A))&relation_of2_as_subset(the_mapping(A,B),the_carrier(B),the_carrier(A))).
% 1.70/1.91 exists A rel_str(A).
% 1.70/1.91 exists A one_sorted_str(A).
% 1.70/1.91 all A (one_sorted_str(A)-> (exists B net_str(B,A))).
% 1.70/1.91 all A B exists C relation_of2(C,A,B).
% 1.70/1.91 all A exists B element(B,A).
% 1.70/1.91 all A (rel_str(A)-> (exists B subrelstr(B,A))).
% 1.70/1.91 all A B (one_sorted_str(A)&net_str(B,A)-> (exists C subnetstr(C,A,B))).
% 1.70/1.91 all A B exists C relation_of2_as_subset(C,A,B).
% 1.70/1.91 empty(empty_set).
% 1.70/1.91 relation(empty_set).
% 1.70/1.91 relation_empty_yielding(empty_set).
% 1.70/1.91 all A B (relation(A)&relation_empty_yielding(A)->relation(relation_dom_restriction(A,B))&relation_empty_yielding(relation_dom_restriction(A,B))).
% 1.70/1.91 all A (-empty(powerset(A))).
% 1.70/1.91 all A B (relation(A)&function(A)->relation(relation_dom_restriction(A,B))&function(relation_dom_restriction(A,B))).
% 1.70/1.91 empty(empty_set).
% 1.70/1.91 relation(empty_set).
% 1.70/1.91 all A B (-empty(A)& -empty(B)-> -empty(cartesian_product2(A,B))).
% 1.70/1.91 exists A (relation(A)&function(A)).
% 1.70/1.91 exists A (relation(A)&relation_empty_yielding(A)&function(A)).
% 1.70/1.91 exists A (empty(A)&relation(A)).
% 1.70/1.91 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)))).
% 1.70/1.91 exists A (relation(A)&empty(A)&function(A)).
% 1.70/1.91 exists A (-empty(A)&relation(A)).
% 1.70/1.91 all A exists B (element(B,powerset(A))&empty(B)).
% 1.70/1.91 exists A (relation(A)&function(A)&one_to_one(A)).
% 1.70/1.91 exists A (relation(A)&relation_empty_yielding(A)).
% 1.70/1.91 exists A (relation(A)&relation_empty_yielding(A)&function(A)).
% 1.70/1.91 all A B C D (relation_of2(C,A,B)->relation_dom_restr_as_relation_of(A,B,C,D)=relation_dom_restriction(C,D)).
% 1.70/1.91 all A B C (relation_of2_as_subset(C,A,B)<->relation_of2(C,A,B)).
% 1.70/1.91 all A B subset(A,A).
% 1.70/1.91 all A B (in(A,B)->element(A,B)).
% 1.70/1.91 -(all A (one_sorted_str(A)-> (all B (net_str(B,A)-> (all C (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(C,F,G)->related(B,D,E)))))))))))))))).
% 1.70/1.91 all A B (element(A,B)->empty(B)|in(A,B)).
% 1.70/1.91 all A B (element(A,powerset(B))<->subset(A,B)).
% 1.70/1.91 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 1.70/1.91 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 1.70/1.91 all A (rel_str(A)-> (all B (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(B,E,F)->related(A,C,D))))))))))))).
% 1.70/1.91 all A (empty(A)->A=empty_set).
% 1.70/1.91 all A B (-(in(A,B)&empty(B))).
% 1.70/1.91 all A B (-(empty(A)&A!=B&empty(B))).
% 1.70/1.91 end_of_list.
% 1.70/1.91
% 1.70/1.91 -------> usable clausifies to:
% 1.70/1.91
% 1.70/1.91 list(usable).
% 1.70/1.91 0 [] A=A.
% 1.70/1.91 0 [] -in(A,B)| -in(B,A).
% 1.70/1.91 0 [] -empty(A)|function(A).
% 1.70/1.91 0 [] -empty(A)|relation(A).
% 1.70/1.91 0 [] -element(C,powerset(cartesian_product2(A,B)))|relation(C).
% 1.70/1.91 0 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 1.70/1.91 0 [] -one_sorted_str(A)| -net_str(B,A)| -net_str(C,A)| -subnetstr(C,A,B)|subrelstr(C,B).
% 1.70/1.91 0 [] -one_sorted_str(A)| -net_str(B,A)| -net_str(C,A)| -subnetstr(C,A,B)|the_mapping(A,C)=relation_dom_restr_as_relation_of(the_carrier(B),the_carrier(A),the_mapping(A,B),the_carrier(C)).
% 1.70/1.91 0 [] -one_sorted_str(A)| -net_str(B,A)| -net_str(C,A)|subnetstr(C,A,B)| -subrelstr(C,B)|the_mapping(A,C)!=relation_dom_restr_as_relation_of(the_carrier(B),the_carrier(A),the_mapping(A,B),the_carrier(C)).
% 1.70/1.91 0 [] $T.
% 1.70/1.91 0 [] $T.
% 1.70/1.91 0 [] $T.
% 1.70/1.91 0 [] -relation(A)|relation(relation_dom_restriction(A,B)).
% 1.70/1.91 0 [] -relation_of2(C,A,B)|relation_of2_as_subset(relation_dom_restr_as_relation_of(A,B,C,D),A,B).
% 1.70/1.91 0 [] -rel_str(A)|one_sorted_str(A).
% 1.70/1.91 0 [] $T.
% 1.70/1.91 0 [] -one_sorted_str(A)| -net_str(B,A)|rel_str(B).
% 1.70/1.91 0 [] $T.
% 1.70/1.91 0 [] $T.
% 1.70/1.91 0 [] -rel_str(A)| -subrelstr(B,A)|rel_str(B).
% 1.70/1.91 0 [] -one_sorted_str(A)| -net_str(B,A)| -subnetstr(C,A,B)|net_str(C,A).
% 1.70/1.91 0 [] -relation_of2_as_subset(C,A,B)|element(C,powerset(cartesian_product2(A,B))).
% 1.70/1.91 0 [] $T.
% 1.70/1.91 0 [] -one_sorted_str(A)| -net_str(B,A)|function(the_mapping(A,B)).
% 1.70/1.91 0 [] -one_sorted_str(A)| -net_str(B,A)|quasi_total(the_mapping(A,B),the_carrier(B),the_carrier(A)).
% 1.70/1.91 0 [] -one_sorted_str(A)| -net_str(B,A)|relation_of2_as_subset(the_mapping(A,B),the_carrier(B),the_carrier(A)).
% 1.70/1.91 0 [] rel_str($c1).
% 1.70/1.91 0 [] one_sorted_str($c2).
% 1.70/1.91 0 [] -one_sorted_str(A)|net_str($f1(A),A).
% 1.70/1.91 0 [] relation_of2($f2(A,B),A,B).
% 1.70/1.91 0 [] element($f3(A),A).
% 1.70/1.91 0 [] -rel_str(A)|subrelstr($f4(A),A).
% 1.70/1.91 0 [] -one_sorted_str(A)| -net_str(B,A)|subnetstr($f5(A,B),A,B).
% 1.70/1.91 0 [] relation_of2_as_subset($f6(A,B),A,B).
% 1.70/1.91 0 [] empty(empty_set).
% 1.70/1.91 0 [] relation(empty_set).
% 1.70/1.91 0 [] relation_empty_yielding(empty_set).
% 1.70/1.91 0 [] -relation(A)| -relation_empty_yielding(A)|relation(relation_dom_restriction(A,B)).
% 1.70/1.91 0 [] -relation(A)| -relation_empty_yielding(A)|relation_empty_yielding(relation_dom_restriction(A,B)).
% 1.70/1.91 0 [] -empty(powerset(A)).
% 1.70/1.91 0 [] -relation(A)| -function(A)|relation(relation_dom_restriction(A,B)).
% 1.70/1.91 0 [] -relation(A)| -function(A)|function(relation_dom_restriction(A,B)).
% 1.70/1.91 0 [] empty(empty_set).
% 1.70/1.91 0 [] relation(empty_set).
% 1.70/1.91 0 [] empty(A)|empty(B)| -empty(cartesian_product2(A,B)).
% 1.70/1.91 0 [] relation($c3).
% 1.70/1.91 0 [] function($c3).
% 1.70/1.91 0 [] relation($c4).
% 1.70/1.91 0 [] relation_empty_yielding($c4).
% 1.70/1.91 0 [] function($c4).
% 1.70/1.91 0 [] empty($c5).
% 1.70/1.91 0 [] relation($c5).
% 1.70/1.91 0 [] empty(A)|element($f7(A),powerset(A)).
% 1.70/1.91 0 [] empty(A)| -empty($f7(A)).
% 1.70/1.91 0 [] relation($c6).
% 1.70/1.91 0 [] empty($c6).
% 1.70/1.91 0 [] function($c6).
% 1.70/1.91 0 [] -empty($c7).
% 1.70/1.91 0 [] relation($c7).
% 1.70/1.91 0 [] element($f8(A),powerset(A)).
% 1.70/1.91 0 [] empty($f8(A)).
% 1.70/1.91 0 [] relation($c8).
% 1.70/1.91 0 [] function($c8).
% 1.70/1.91 0 [] one_to_one($c8).
% 1.70/1.91 0 [] relation($c9).
% 1.70/1.91 0 [] relation_empty_yielding($c9).
% 1.70/1.91 0 [] relation($c10).
% 1.70/1.91 0 [] relation_empty_yielding($c10).
% 1.70/1.91 0 [] function($c10).
% 1.70/1.91 0 [] -relation_of2(C,A,B)|relation_dom_restr_as_relation_of(A,B,C,D)=relation_dom_restriction(C,D).
% 1.70/1.91 0 [] -relation_of2_as_subset(C,A,B)|relation_of2(C,A,B).
% 1.70/1.91 0 [] relation_of2_as_subset(C,A,B)| -relation_of2(C,A,B).
% 1.70/1.91 0 [] subset(A,A).
% 1.70/1.91 0 [] -in(A,B)|element(A,B).
% 1.70/1.91 0 [] one_sorted_str($c17).
% 1.70/1.91 0 [] net_str($c16,$c17).
% 1.70/1.91 0 [] subnetstr($c15,$c17,$c16).
% 1.70/1.91 0 [] element($c14,the_carrier($c16)).
% 1.70/1.91 0 [] element($c13,the_carrier($c16)).
% 1.70/1.91 0 [] element($c12,the_carrier($c15)).
% 1.70/1.91 0 [] element($c11,the_carrier($c15)).
% 1.70/1.91 0 [] $c14=$c12.
% 1.70/1.91 0 [] $c13=$c11.
% 1.70/1.91 0 [] related($c15,$c12,$c11).
% 1.70/1.91 0 [] -related($c16,$c14,$c13).
% 1.70/1.91 0 [] -element(A,B)|empty(B)|in(A,B).
% 1.70/1.91 0 [] -element(A,powerset(B))|subset(A,B).
% 1.70/1.91 0 [] element(A,powerset(B))| -subset(A,B).
% 1.70/1.91 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.70/1.91 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.70/1.91 0 [] -rel_str(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(B,E,F)|related(A,C,D).
% 1.74/1.91 0 [] -empty(A)|A=empty_set.
% 1.74/1.91 0 [] -in(A,B)| -empty(B).
% 1.74/1.91 0 [] -empty(A)|A=B| -empty(B).
% 1.74/1.91 end_of_list.
% 1.74/1.91
% 1.74/1.91 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=10.
% 1.74/1.91
% 1.74/1.91 This ia a non-Horn set with equality. The strategy will be
% 1.74/1.91 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.74/1.91 deletion, with positive clauses in sos and nonpositive
% 1.74/1.91 clauses in usable.
% 1.74/1.91
% 1.74/1.91 dependent: set(knuth_bendix).
% 1.74/1.91 dependent: set(anl_eq).
% 1.74/1.91 dependent: set(para_from).
% 1.74/1.91 dependent: set(para_into).
% 1.74/1.91 dependent: clear(para_from_right).
% 1.74/1.91 dependent: clear(para_into_right).
% 1.74/1.91 dependent: set(para_from_vars).
% 1.74/1.91 dependent: set(eq_units_both_ways).
% 1.74/1.91 dependent: set(dynamic_demod_all).
% 1.74/1.91 dependent: set(dynamic_demod).
% 1.74/1.91 dependent: set(order_eq).
% 1.74/1.91 dependent: set(back_demod).
% 1.74/1.91 dependent: set(lrpo).
% 1.74/1.91 dependent: set(hyper_res).
% 1.74/1.91 dependent: set(unit_deletion).
% 1.74/1.91 dependent: set(factor).
% 1.74/1.91
% 1.74/1.91 ------------> process usable:
% 1.74/1.91 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.74/1.91 ** KEPT (pick-wt=4): 2 [] -empty(A)|function(A).
% 1.74/1.91 ** KEPT (pick-wt=4): 3 [] -empty(A)|relation(A).
% 1.74/1.91 ** KEPT (pick-wt=8): 4 [] -element(A,powerset(cartesian_product2(B,C)))|relation(A).
% 1.74/1.91 ** KEPT (pick-wt=8): 5 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 1.74/1.91 ** KEPT (pick-wt=15): 6 [] -one_sorted_str(A)| -net_str(B,A)| -net_str(C,A)| -subnetstr(C,A,B)|subrelstr(C,B).
% 1.74/1.91 ** KEPT (pick-wt=26): 7 [] -one_sorted_str(A)| -net_str(B,A)| -net_str(C,A)| -subnetstr(C,A,B)|the_mapping(A,C)=relation_dom_restr_as_relation_of(the_carrier(B),the_carrier(A),the_mapping(A,B),the_carrier(C)).
% 1.74/1.91 ** KEPT (pick-wt=29): 8 [] -one_sorted_str(A)| -net_str(B,A)| -net_str(C,A)|subnetstr(C,A,B)| -subrelstr(C,B)|the_mapping(A,C)!=relation_dom_restr_as_relation_of(the_carrier(B),the_carrier(A),the_mapping(A,B),the_carrier(C)).
% 1.74/1.91 ** KEPT (pick-wt=6): 9 [] -relation(A)|relation(relation_dom_restriction(A,B)).
% 1.74/1.91 ** KEPT (pick-wt=12): 10 [] -relation_of2(A,B,C)|relation_of2_as_subset(relation_dom_restr_as_relation_of(B,C,A,D),B,C).
% 1.74/1.91 ** KEPT (pick-wt=4): 11 [] -rel_str(A)|one_sorted_str(A).
% 1.74/1.91 ** KEPT (pick-wt=7): 12 [] -one_sorted_str(A)| -net_str(B,A)|rel_str(B).
% 1.74/1.91 ** KEPT (pick-wt=7): 13 [] -rel_str(A)| -subrelstr(B,A)|rel_str(B).
% 1.74/1.91 ** KEPT (pick-wt=12): 14 [] -one_sorted_str(A)| -net_str(B,A)| -subnetstr(C,A,B)|net_str(C,A).
% 1.74/1.91 ** KEPT (pick-wt=10): 15 [] -relation_of2_as_subset(A,B,C)|element(A,powerset(cartesian_product2(B,C))).
% 1.74/1.91 ** KEPT (pick-wt=9): 16 [] -one_sorted_str(A)| -net_str(B,A)|function(the_mapping(A,B)).
% 1.74/1.91 ** KEPT (pick-wt=13): 17 [] -one_sorted_str(A)| -net_str(B,A)|quasi_total(the_mapping(A,B),the_carrier(B),the_carrier(A)).
% 1.74/1.91 ** KEPT (pick-wt=13): 18 [] -one_sorted_str(A)| -net_str(B,A)|relation_of2_as_subset(the_mapping(A,B),the_carrier(B),the_carrier(A)).
% 1.74/1.91 ** KEPT (pick-wt=6): 19 [] -one_sorted_str(A)|net_str($f1(A),A).
% 1.74/1.91 ** KEPT (pick-wt=6): 20 [] -rel_str(A)|subrelstr($f4(A),A).
% 1.74/1.91 ** KEPT (pick-wt=11): 21 [] -one_sorted_str(A)| -net_str(B,A)|subnetstr($f5(A,B),A,B).
% 1.74/1.91 Following clause subsumed by 9 during input processing: 0 [] -relation(A)| -relation_empty_yielding(A)|relation(relation_dom_restriction(A,B)).
% 1.74/1.91 ** KEPT (pick-wt=8): 22 [] -relation(A)| -relation_empty_yielding(A)|relation_empty_yielding(relation_dom_restriction(A,B)).
% 1.74/1.91 ** KEPT (pick-wt=3): 23 [] -empty(powerset(A)).
% 1.74/1.91 Following clause subsumed by 9 during input processing: 0 [] -relation(A)| -function(A)|relation(relation_dom_restriction(A,B)).
% 1.74/1.91 ** KEPT (pick-wt=8): 24 [] -relation(A)| -function(A)|function(relation_dom_restriction(A,B)).
% 1.74/1.91 ** KEPT (pick-wt=8): 25 [] empty(A)|empty(B)| -empty(cartesian_product2(A,B)).
% 1.74/1.91 ** KEPT (pick-wt=5): 26 [] empty(A)| -empty($f7(A)).
% 1.74/1.91 ** KEPT (pick-wt=2): 27 [] -empty($c7).
% 1.74/1.91 ** KEPT (pick-wt=13): 28 [] -relation_of2(A,B,C)|relation_dom_restr_as_relation_of(B,C,A,D)=relation_dom_restriction(A,D).
% 1.74/1.91 ** KEPT (pick-wt=8): 29 [] -relation_of2_as_subset(A,B,C)|relation_of2(A,B,C).
% 1.74/1.91 ** KEPT (pick-wt=8): 30 [] relation_of2_as_subset(A,B,C)| -relation_of2(A,B,C).
% 1.74/1.91 ** KEPT (pick-wt=6): 31 [] -in(A,B)|element(A,B).
% 1.74/1.91 ** KEPT (pick-wt=4): 32 [] -related($c16,$c14,$c13).
% 1.74/1.91 ** KEPT (pick-wt=8): 33 [] -element(A,B)|empty(B)|in(A,B).
% 1.74/1.91 ** KEPT (pick-wt=7): 34 [] -element(A,powerset(B))|subset(A,B).
% 1.74/1.92 ** KEPT (pick-wt=7): 35 [] element(A,powerset(B))| -subset(A,B).
% 1.74/1.92 ** KEPT (pick-wt=10): 36 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.74/1.92 ** KEPT (pick-wt=9): 37 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.74/1.92 ** KEPT (pick-wt=35): 38 [] -rel_str(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(B,E,F)|related(A,C,D).
% 1.74/1.92 ** KEPT (pick-wt=5): 39 [] -empty(A)|A=empty_set.
% 1.74/1.92 ** KEPT (pick-wt=5): 40 [] -in(A,B)| -empty(B).
% 1.74/1.92 ** KEPT (pick-wt=7): 41 [] -empty(A)|A=B| -empty(B).
% 1.74/1.92
% 1.74/1.92 ------------> process sos:
% 1.74/1.92 ** KEPT (pick-wt=3): 60 [] A=A.
% 1.74/1.92 ** KEPT (pick-wt=2): 61 [] rel_str($c1).
% 1.74/1.92 ** KEPT (pick-wt=2): 62 [] one_sorted_str($c2).
% 1.74/1.92 ** KEPT (pick-wt=6): 63 [] relation_of2($f2(A,B),A,B).
% 1.74/1.92 ** KEPT (pick-wt=4): 64 [] element($f3(A),A).
% 1.74/1.92 ** KEPT (pick-wt=6): 65 [] relation_of2_as_subset($f6(A,B),A,B).
% 1.74/1.92 ** KEPT (pick-wt=2): 66 [] empty(empty_set).
% 1.74/1.92 ** KEPT (pick-wt=2): 67 [] relation(empty_set).
% 1.74/1.92 ** KEPT (pick-wt=2): 68 [] relation_empty_yielding(empty_set).
% 1.74/1.92 Following clause subsumed by 66 during input processing: 0 [] empty(empty_set).
% 1.74/1.92 Following clause subsumed by 67 during input processing: 0 [] relation(empty_set).
% 1.74/1.92 ** KEPT (pick-wt=2): 69 [] relation($c3).
% 1.74/1.92 ** KEPT (pick-wt=2): 70 [] function($c3).
% 1.74/1.92 ** KEPT (pick-wt=2): 71 [] relation($c4).
% 1.74/1.92 ** KEPT (pick-wt=2): 72 [] relation_empty_yielding($c4).
% 1.74/1.92 ** KEPT (pick-wt=2): 73 [] function($c4).
% 1.74/1.92 ** KEPT (pick-wt=2): 74 [] empty($c5).
% 1.74/1.92 ** KEPT (pick-wt=2): 75 [] relation($c5).
% 1.74/1.92 ** KEPT (pick-wt=7): 76 [] empty(A)|element($f7(A),powerset(A)).
% 1.74/1.92 ** KEPT (pick-wt=2): 77 [] relation($c6).
% 1.74/1.92 ** KEPT (pick-wt=2): 78 [] empty($c6).
% 1.74/1.92 ** KEPT (pick-wt=2): 79 [] function($c6).
% 1.74/1.92 ** KEPT (pick-wt=2): 80 [] relation($c7).
% 1.74/1.92 ** KEPT (pick-wt=5): 81 [] element($f8(A),powerset(A)).
% 1.74/1.92 ** KEPT (pick-wt=3): 82 [] empty($f8(A)).
% 1.74/1.92 ** KEPT (pick-wt=2): 83 [] relation($c8).
% 1.74/1.92 ** KEPT (pick-wt=2): 84 [] function($c8).
% 1.74/1.92 ** KEPT (pick-wt=2): 85 [] one_to_one($c8).
% 1.74/1.92 ** KEPT (pick-wt=2): 86 [] relation($c9).
% 1.74/1.92 ** KEPT (pick-wt=2): 87 [] relation_empty_yielding($c9).
% 1.74/1.92 ** KEPT (pick-wt=2): 88 [] relation($c10).
% 1.74/1.92 ** KEPT (pick-wt=2): 89 [] relation_empty_yielding($c10).
% 1.74/1.92 ** KEPT (pick-wt=2): 90 [] function($c10).
% 1.74/1.92 ** KEPT (pick-wt=3): 91 [] subset(A,A).
% 1.74/1.92 ** KEPT (pick-wt=2): 92 [] one_sorted_str($c17).
% 1.74/1.92 ** KEPT (pick-wt=3): 93 [] net_str($c16,$c17).
% 1.74/1.92 ** KEPT (pick-wt=4): 94 [] subnetstr($c15,$c17,$c16).
% 1.74/1.92 ** KEPT (pick-wt=4): 95 [] element($c14,the_carrier($c16)).
% 1.74/1.92 ** KEPT (pick-wt=4): 96 [] element($c13,the_carrier($c16)).
% 1.74/1.92 ** KEPT (pick-wt=4): 97 [] element($c12,the_carrier($c15)).
% 1.74/1.92 ** KEPT (pick-wt=4): 98 [] element($c11,the_carrier($c15)).
% 1.74/1.92 ** KEPT (pick-wt=3): 99 [] $c14=$c12.
% 1.74/1.92 ---> New Demodulator: 100 [new_demod,99] $c14=$c12.
% 1.74/1.92 ** KEPT (pick-wt=3): 101 [] $c13=$c11.
% 1.74/1.92 ---> New Demodulator: 102 [new_demod,101] $c13=$c11.
% 1.74/1.92 ** KEPT (pick-wt=4): 103 [] related($c15,$c12,$c11).
% 1.74/1.92 Following clause subsumed by 60 during input processing: 0 [copy,60,flip.1] A=A.
% 1.74/1.92 60 back subsumes 54.
% 1.74/1.92 >>>> Starting back demodulation with 100.
% 1.74/1.92 >> back demodulating 95 with 100.
% 1.74/1.92 >> back demodulating 32 with 100.
% 1.74/1.92 >>>> Starting back demodulation with 102.
% 1.74/1.92 >> back demodulating 96 with 102.
% 1.74/1.92
% 1.74/1.92 ======= end of input processing =======
% 1.74/1.92
% 1.74/1.92 =========== start of search ===========
% 1.74/1.92
% 1.74/1.92 -------- PROOF --------
% 1.74/1.92
% 1.74/1.92 ----> UNIT CONFLICT at 0.01 sec ----> 246 [binary,245.1,105.1] $F.
% 1.74/1.92
% 1.74/1.92 Length of proof is 7. Level of proof is 3.
% 1.74/1.92
% 1.74/1.92 ---------------- PROOF ----------------
% 1.74/1.92 % SZS status Theorem
% 1.74/1.92 % SZS output start Refutation
% See solution above
% 1.74/1.92 ------------ end of proof -------------
% 1.74/1.92
% 1.74/1.92
% 1.74/1.92 Search stopped by max_proofs option.
% 1.74/1.92
% 1.74/1.92
% 1.74/1.92 Search stopped by max_proofs option.
% 1.74/1.92
% 1.74/1.92 ============ end of search ============
% 1.74/1.92
% 1.74/1.92 -------------- statistics -------------
% 1.74/1.92 clauses given 55
% 1.74/1.92 clauses generated 277
% 1.74/1.92 clauses kept 238
% 1.74/1.92 clauses forward subsumed 134
% 1.74/1.92 clauses back subsumed 4
% 1.74/1.92 Kbytes malloced 1953
% 1.74/1.92
% 1.74/1.92 ----------- times (seconds) -----------
% 1.74/1.92 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.74/1.92 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.74/1.92 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.74/1.92
% 1.74/1.92 That finishes the proof of the theorem.
% 1.74/1.92
% 1.74/1.92 Process 29187 finished Wed Jul 27 07:35:26 2022
% 1.74/1.92 Otter interrupted
% 1.74/1.92 PROOF FOUND
%------------------------------------------------------------------------------