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