%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : NUM411+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n020.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:08:15 EDT 2022
% Result : Theorem 2.25s 2.43s
% Output : Refutation 2.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 16 ( 10 unt; 0 nHn; 16 RR)
% Number of literals : 29 ( 0 equ; 14 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 13 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(11,axiom,
( ~ relation(A)
| ~ function(A)
| ~ transfinite_se_quence(A)
| ~ transfinite_se_quence_of(A,B)
| subset(relation_rng(A),B) ),
file('NUM411+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ relation(A)
| ~ function(A)
| ~ transfinite_se_quence(A)
| transfinite_se_quence_of(A,B)
| ~ subset(relation_rng(A),B) ),
file('NUM411+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ transfinite_se_quence_of(A,B)
| relation(A) ),
file('NUM411+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ transfinite_se_quence_of(A,B)
| function(A) ),
file('NUM411+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ transfinite_se_quence_of(A,B)
| transfinite_se_quence(A) ),
file('NUM411+1.p',unknown),
[] ).
cnf(24,axiom,
( ~ subset(A,B)
| ~ subset(B,C)
| subset(A,C) ),
file('NUM411+1.p',unknown),
[] ).
cnf(28,axiom,
~ transfinite_se_quence_of(dollar_c15,dollar_c16),
file('NUM411+1.p',unknown),
[] ).
cnf(84,axiom,
subset(dollar_c17,dollar_c16),
file('NUM411+1.p',unknown),
[] ).
cnf(85,axiom,
transfinite_se_quence_of(dollar_c15,dollar_c17),
file('NUM411+1.p',unknown),
[] ).
cnf(126,plain,
transfinite_se_quence(dollar_c15),
inference(hyper,[status(thm)],[85,15]),
[iquote('hyper,85,15')] ).
cnf(127,plain,
function(dollar_c15),
inference(hyper,[status(thm)],[85,14]),
[iquote('hyper,85,14')] ).
cnf(128,plain,
relation(dollar_c15),
inference(hyper,[status(thm)],[85,13]),
[iquote('hyper,85,13')] ).
cnf(133,plain,
subset(relation_rng(dollar_c15),dollar_c17),
inference(hyper,[status(thm)],[128,11,127,126,85]),
[iquote('hyper,128,11,127,126,85')] ).
cnf(160,plain,
subset(relation_rng(dollar_c15),dollar_c16),
inference(hyper,[status(thm)],[133,24,84]),
[iquote('hyper,133,24,84')] ).
cnf(197,plain,
transfinite_se_quence_of(dollar_c15,dollar_c16),
inference(hyper,[status(thm)],[160,12,128,127,126]),
[iquote('hyper,160,12,128,127,126')] ).
cnf(198,plain,
$false,
inference(binary,[status(thm)],[197,28]),
[iquote('binary,197.1,28.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM411+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Jul 27 09:35:08 EDT 2022
% 0.13/0.34 % CPUTime :
% 2.25/2.43 ----- Otter 3.3f, August 2004 -----
% 2.25/2.43 The process was started by sandbox2 on n020.cluster.edu,
% 2.25/2.43 Wed Jul 27 09:35:08 2022
% 2.25/2.43 The command was "./otter". The process ID is 18351.
% 2.25/2.43
% 2.25/2.43 set(prolog_style_variables).
% 2.25/2.43 set(auto).
% 2.25/2.43 dependent: set(auto1).
% 2.25/2.43 dependent: set(process_input).
% 2.25/2.43 dependent: clear(print_kept).
% 2.25/2.43 dependent: clear(print_new_demod).
% 2.25/2.43 dependent: clear(print_back_demod).
% 2.25/2.43 dependent: clear(print_back_sub).
% 2.25/2.43 dependent: set(control_memory).
% 2.25/2.43 dependent: assign(max_mem, 12000).
% 2.25/2.43 dependent: assign(pick_given_ratio, 4).
% 2.25/2.43 dependent: assign(stats_level, 1).
% 2.25/2.43 dependent: assign(max_seconds, 10800).
% 2.25/2.43 clear(print_given).
% 2.25/2.43
% 2.25/2.43 formula_list(usable).
% 2.25/2.43 all A (A=A).
% 2.25/2.43 all A B (in(A,B)-> -in(B,A)).
% 2.25/2.43 all A (empty(A)->function(A)).
% 2.25/2.43 all A (ordinal(A)->epsilon_transitive(A)&epsilon_connected(A)).
% 2.25/2.43 all A (empty(A)->relation(A)).
% 2.25/2.43 all A (relation(A)&empty(A)&function(A)->relation(A)&function(A)&one_to_one(A)).
% 2.25/2.43 all A (epsilon_transitive(A)&epsilon_connected(A)->ordinal(A)).
% 2.25/2.43 all A (empty(A)->epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 2.25/2.43 all A B (relation(B)&function(B)&transfinite_se_quence(B)-> (transfinite_se_quence_of(B,A)<->subset(relation_rng(B),A))).
% 2.25/2.43 all A B (transfinite_se_quence_of(B,A)->relation(B)&function(B)&transfinite_se_quence(B)).
% 2.25/2.43 all A exists B transfinite_se_quence_of(B,A).
% 2.25/2.43 all A exists B element(B,A).
% 2.25/2.43 empty(empty_set).
% 2.25/2.43 relation(empty_set).
% 2.25/2.43 relation_empty_yielding(empty_set).
% 2.25/2.43 empty(empty_set).
% 2.25/2.43 relation(empty_set).
% 2.25/2.43 relation_empty_yielding(empty_set).
% 2.25/2.43 function(empty_set).
% 2.25/2.43 one_to_one(empty_set).
% 2.25/2.43 empty(empty_set).
% 2.25/2.43 epsilon_transitive(empty_set).
% 2.25/2.43 epsilon_connected(empty_set).
% 2.25/2.43 ordinal(empty_set).
% 2.25/2.43 empty(empty_set).
% 2.25/2.43 relation(empty_set).
% 2.25/2.43 all A (relation(A)&relation_non_empty(A)&function(A)->with_non_empty_elements(relation_rng(A))).
% 2.25/2.43 all A (-empty(A)&relation(A)-> -empty(relation_rng(A))).
% 2.25/2.43 all A (empty(A)->empty(relation_rng(A))&relation(relation_rng(A))).
% 2.25/2.43 exists A (relation(A)&function(A)).
% 2.25/2.43 exists A (epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 2.25/2.43 exists A (empty(A)&relation(A)).
% 2.25/2.43 exists A empty(A).
% 2.25/2.43 exists A (relation(A)&empty(A)&function(A)).
% 2.25/2.43 exists A (relation(A)&function(A)&one_to_one(A)&empty(A)&epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 2.25/2.43 exists A (-empty(A)&relation(A)).
% 2.25/2.43 exists A (-empty(A)).
% 2.25/2.43 exists A (relation(A)&function(A)&one_to_one(A)).
% 2.25/2.43 exists A (-empty(A)&epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 2.25/2.43 exists A (relation(A)&relation_empty_yielding(A)).
% 2.25/2.43 exists A (relation(A)&relation_empty_yielding(A)&function(A)).
% 2.25/2.43 exists A (relation(A)&function(A)&transfinite_se_quence(A)).
% 2.25/2.43 exists A (relation(A)&relation_non_empty(A)&function(A)).
% 2.25/2.43 all A B subset(A,A).
% 2.25/2.43 all A B (in(A,B)->element(A,B)).
% 2.25/2.43 all A B C (subset(A,B)&subset(B,C)->subset(A,C)).
% 2.25/2.43 all A B (element(A,B)->empty(B)|in(A,B)).
% 2.25/2.43 all A B (element(A,powerset(B))<->subset(A,B)).
% 2.25/2.43 -(all A B (subset(A,B)-> (all C (transfinite_se_quence_of(C,A)->transfinite_se_quence_of(C,B))))).
% 2.25/2.43 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 2.25/2.43 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 2.25/2.43 all A (empty(A)->A=empty_set).
% 2.25/2.43 all A B (-(in(A,B)&empty(B))).
% 2.25/2.43 all A B (-(empty(A)&A!=B&empty(B))).
% 2.25/2.43 end_of_list.
% 2.25/2.43
% 2.25/2.43 -------> usable clausifies to:
% 2.25/2.43
% 2.25/2.43 list(usable).
% 2.25/2.43 0 [] A=A.
% 2.25/2.43 0 [] -in(A,B)| -in(B,A).
% 2.25/2.43 0 [] -empty(A)|function(A).
% 2.25/2.43 0 [] -ordinal(A)|epsilon_transitive(A).
% 2.25/2.43 0 [] -ordinal(A)|epsilon_connected(A).
% 2.25/2.43 0 [] -empty(A)|relation(A).
% 2.25/2.43 0 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 2.25/2.43 0 [] -epsilon_transitive(A)| -epsilon_connected(A)|ordinal(A).
% 2.25/2.43 0 [] -empty(A)|epsilon_transitive(A).
% 2.25/2.43 0 [] -empty(A)|epsilon_connected(A).
% 2.25/2.43 0 [] -empty(A)|ordinal(A).
% 2.25/2.43 0 [] -relation(B)| -function(B)| -transfinite_se_quence(B)| -transfinite_se_quence_of(B,A)|subset(relation_rng(B),A).
% 2.25/2.43 0 [] -relation(B)| -function(B)| -transfinite_se_quence(B)|transfinite_se_quence_of(B,A)| -subset(relation_rng(B),A).
% 2.25/2.43 0 [] -transfinite_se_quence_of(B,A)|relation(B).
% 2.25/2.43 0 [] -transfinite_se_quence_of(B,A)|function(B).
% 2.25/2.43 0 [] -transfinite_se_quence_of(B,A)|transfinite_se_quence(B).
% 2.25/2.43 0 [] transfinite_se_quence_of($f1(A),A).
% 2.25/2.43 0 [] element($f2(A),A).
% 2.25/2.43 0 [] empty(empty_set).
% 2.25/2.43 0 [] relation(empty_set).
% 2.25/2.43 0 [] relation_empty_yielding(empty_set).
% 2.25/2.43 0 [] empty(empty_set).
% 2.25/2.43 0 [] relation(empty_set).
% 2.25/2.43 0 [] relation_empty_yielding(empty_set).
% 2.25/2.43 0 [] function(empty_set).
% 2.25/2.43 0 [] one_to_one(empty_set).
% 2.25/2.43 0 [] empty(empty_set).
% 2.25/2.43 0 [] epsilon_transitive(empty_set).
% 2.25/2.43 0 [] epsilon_connected(empty_set).
% 2.25/2.43 0 [] ordinal(empty_set).
% 2.25/2.43 0 [] empty(empty_set).
% 2.25/2.43 0 [] relation(empty_set).
% 2.25/2.43 0 [] -relation(A)| -relation_non_empty(A)| -function(A)|with_non_empty_elements(relation_rng(A)).
% 2.25/2.43 0 [] empty(A)| -relation(A)| -empty(relation_rng(A)).
% 2.25/2.43 0 [] -empty(A)|empty(relation_rng(A)).
% 2.25/2.43 0 [] -empty(A)|relation(relation_rng(A)).
% 2.25/2.43 0 [] relation($c1).
% 2.25/2.43 0 [] function($c1).
% 2.25/2.43 0 [] epsilon_transitive($c2).
% 2.25/2.43 0 [] epsilon_connected($c2).
% 2.25/2.43 0 [] ordinal($c2).
% 2.25/2.43 0 [] empty($c3).
% 2.25/2.43 0 [] relation($c3).
% 2.25/2.43 0 [] empty($c4).
% 2.25/2.43 0 [] relation($c5).
% 2.25/2.43 0 [] empty($c5).
% 2.25/2.43 0 [] function($c5).
% 2.25/2.43 0 [] relation($c6).
% 2.25/2.43 0 [] function($c6).
% 2.25/2.43 0 [] one_to_one($c6).
% 2.25/2.43 0 [] empty($c6).
% 2.25/2.43 0 [] epsilon_transitive($c6).
% 2.25/2.43 0 [] epsilon_connected($c6).
% 2.25/2.43 0 [] ordinal($c6).
% 2.25/2.43 0 [] -empty($c7).
% 2.25/2.43 0 [] relation($c7).
% 2.25/2.43 0 [] -empty($c8).
% 2.25/2.43 0 [] relation($c9).
% 2.25/2.43 0 [] function($c9).
% 2.25/2.43 0 [] one_to_one($c9).
% 2.25/2.43 0 [] -empty($c10).
% 2.25/2.43 0 [] epsilon_transitive($c10).
% 2.25/2.43 0 [] epsilon_connected($c10).
% 2.25/2.43 0 [] ordinal($c10).
% 2.25/2.43 0 [] relation($c11).
% 2.25/2.43 0 [] relation_empty_yielding($c11).
% 2.25/2.43 0 [] relation($c12).
% 2.25/2.43 0 [] relation_empty_yielding($c12).
% 2.25/2.43 0 [] function($c12).
% 2.25/2.43 0 [] relation($c13).
% 2.25/2.43 0 [] function($c13).
% 2.25/2.43 0 [] transfinite_se_quence($c13).
% 2.25/2.43 0 [] relation($c14).
% 2.25/2.43 0 [] relation_non_empty($c14).
% 2.25/2.43 0 [] function($c14).
% 2.25/2.43 0 [] subset(A,A).
% 2.25/2.43 0 [] -in(A,B)|element(A,B).
% 2.25/2.43 0 [] -subset(A,B)| -subset(B,C)|subset(A,C).
% 2.25/2.43 0 [] -element(A,B)|empty(B)|in(A,B).
% 2.25/2.43 0 [] -element(A,powerset(B))|subset(A,B).
% 2.25/2.43 0 [] element(A,powerset(B))| -subset(A,B).
% 2.25/2.43 0 [] subset($c17,$c16).
% 2.25/2.43 0 [] transfinite_se_quence_of($c15,$c17).
% 2.25/2.43 0 [] -transfinite_se_quence_of($c15,$c16).
% 2.25/2.43 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.25/2.43 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.25/2.43 0 [] -empty(A)|A=empty_set.
% 2.25/2.43 0 [] -in(A,B)| -empty(B).
% 2.25/2.43 0 [] -empty(A)|A=B| -empty(B).
% 2.25/2.43 end_of_list.
% 2.25/2.43
% 2.25/2.43 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 2.25/2.43
% 2.25/2.43 This ia a non-Horn set with equality. The strategy will be
% 2.25/2.43 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.25/2.43 deletion, with positive clauses in sos and nonpositive
% 2.25/2.43 clauses in usable.
% 2.25/2.43
% 2.25/2.43 dependent: set(knuth_bendix).
% 2.25/2.43 dependent: set(anl_eq).
% 2.25/2.43 dependent: set(para_from).
% 2.25/2.43 dependent: set(para_into).
% 2.25/2.43 dependent: clear(para_from_right).
% 2.25/2.43 dependent: clear(para_into_right).
% 2.25/2.43 dependent: set(para_from_vars).
% 2.25/2.43 dependent: set(eq_units_both_ways).
% 2.25/2.43 dependent: set(dynamic_demod_all).
% 2.25/2.43 dependent: set(dynamic_demod).
% 2.25/2.43 dependent: set(order_eq).
% 2.25/2.43 dependent: set(back_demod).
% 2.25/2.43 dependent: set(lrpo).
% 2.25/2.43 dependent: set(hyper_res).
% 2.25/2.43 dependent: set(unit_deletion).
% 2.25/2.43 dependent: set(factor).
% 2.25/2.43
% 2.25/2.43 ------------> process usable:
% 2.25/2.43 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 2.25/2.43 ** KEPT (pick-wt=4): 2 [] -empty(A)|function(A).
% 2.25/2.43 ** KEPT (pick-wt=4): 3 [] -ordinal(A)|epsilon_transitive(A).
% 2.25/2.43 ** KEPT (pick-wt=4): 4 [] -ordinal(A)|epsilon_connected(A).
% 2.25/2.43 ** KEPT (pick-wt=4): 5 [] -empty(A)|relation(A).
% 2.25/2.43 ** KEPT (pick-wt=8): 6 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 2.25/2.43 ** KEPT (pick-wt=6): 7 [] -epsilon_transitive(A)| -epsilon_connected(A)|ordinal(A).
% 2.25/2.43 ** KEPT (pick-wt=4): 8 [] -empty(A)|epsilon_transitive(A).
% 2.25/2.43 ** KEPT (pick-wt=4): 9 [] -empty(A)|epsilon_connected(A).
% 2.25/2.43 ** KEPT (pick-wt=4): 10 [] -empty(A)|ordinal(A).
% 2.25/2.43 ** KEPT (pick-wt=13): 11 [] -relation(A)| -function(A)| -transfinite_se_quence(A)| -transfinite_se_quence_of(A,B)|subset(relation_rng(A),B).
% 2.25/2.43 ** KEPT (pick-wt=13): 12 [] -relation(A)| -function(A)| -transfinite_se_quence(A)|transfinite_se_quence_of(A,B)| -subset(relation_rng(A),B).
% 2.25/2.43 ** KEPT (pick-wt=5): 13 [] -transfinite_se_quence_of(A,B)|relation(A).
% 2.25/2.43 ** KEPT (pick-wt=5): 14 [] -transfinite_se_quence_of(A,B)|function(A).
% 2.25/2.43 ** KEPT (pick-wt=5): 15 [] -transfinite_se_quence_of(A,B)|transfinite_se_quence(A).
% 2.25/2.43 ** KEPT (pick-wt=9): 16 [] -relation(A)| -relation_non_empty(A)| -function(A)|with_non_empty_elements(relation_rng(A)).
% 2.25/2.43 ** KEPT (pick-wt=7): 17 [] empty(A)| -relation(A)| -empty(relation_rng(A)).
% 2.25/2.43 ** KEPT (pick-wt=5): 18 [] -empty(A)|empty(relation_rng(A)).
% 2.25/2.43 ** KEPT (pick-wt=5): 19 [] -empty(A)|relation(relation_rng(A)).
% 2.25/2.43 ** KEPT (pick-wt=2): 20 [] -empty($c7).
% 2.25/2.43 ** KEPT (pick-wt=2): 21 [] -empty($c8).
% 2.25/2.43 ** KEPT (pick-wt=2): 22 [] -empty($c10).
% 2.25/2.43 ** KEPT (pick-wt=6): 23 [] -in(A,B)|element(A,B).
% 2.25/2.43 ** KEPT (pick-wt=9): 24 [] -subset(A,B)| -subset(B,C)|subset(A,C).
% 2.25/2.43 ** KEPT (pick-wt=8): 25 [] -element(A,B)|empty(B)|in(A,B).
% 2.25/2.43 ** KEPT (pick-wt=7): 26 [] -element(A,powerset(B))|subset(A,B).
% 2.25/2.43 ** KEPT (pick-wt=7): 27 [] element(A,powerset(B))| -subset(A,B).
% 2.25/2.43 ** KEPT (pick-wt=3): 28 [] -transfinite_se_quence_of($c15,$c16).
% 2.25/2.43 ** KEPT (pick-wt=10): 29 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.25/2.43 ** KEPT (pick-wt=9): 30 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.25/2.43 ** KEPT (pick-wt=5): 31 [] -empty(A)|A=empty_set.
% 2.25/2.43 ** KEPT (pick-wt=5): 32 [] -in(A,B)| -empty(B).
% 2.25/2.43 ** KEPT (pick-wt=7): 33 [] -empty(A)|A=B| -empty(B).
% 2.25/2.43
% 2.25/2.43 ------------> process sos:
% 2.25/2.43 ** KEPT (pick-wt=3): 36 [] A=A.
% 2.25/2.43 ** KEPT (pick-wt=4): 37 [] transfinite_se_quence_of($f1(A),A).
% 2.25/2.43 ** KEPT (pick-wt=4): 38 [] element($f2(A),A).
% 2.25/2.43 ** KEPT (pick-wt=2): 39 [] empty(empty_set).
% 2.25/2.43 ** KEPT (pick-wt=2): 40 [] relation(empty_set).
% 2.25/2.43 ** KEPT (pick-wt=2): 41 [] relation_empty_yielding(empty_set).
% 2.25/2.43 Following clause subsumed by 39 during input processing: 0 [] empty(empty_set).
% 2.25/2.43 Following clause subsumed by 40 during input processing: 0 [] relation(empty_set).
% 2.25/2.43 Following clause subsumed by 41 during input processing: 0 [] relation_empty_yielding(empty_set).
% 2.25/2.43 ** KEPT (pick-wt=2): 42 [] function(empty_set).
% 2.25/2.43 ** KEPT (pick-wt=2): 43 [] one_to_one(empty_set).
% 2.25/2.43 Following clause subsumed by 39 during input processing: 0 [] empty(empty_set).
% 2.25/2.43 ** KEPT (pick-wt=2): 44 [] epsilon_transitive(empty_set).
% 2.25/2.43 ** KEPT (pick-wt=2): 45 [] epsilon_connected(empty_set).
% 2.25/2.43 ** KEPT (pick-wt=2): 46 [] ordinal(empty_set).
% 2.25/2.43 Following clause subsumed by 39 during input processing: 0 [] empty(empty_set).
% 2.25/2.43 Following clause subsumed by 40 during input processing: 0 [] relation(empty_set).
% 2.25/2.43 ** KEPT (pick-wt=2): 47 [] relation($c1).
% 2.25/2.43 ** KEPT (pick-wt=2): 48 [] function($c1).
% 2.25/2.43 ** KEPT (pick-wt=2): 49 [] epsilon_transitive($c2).
% 2.25/2.43 ** KEPT (pick-wt=2): 50 [] epsilon_connected($c2).
% 2.25/2.43 ** KEPT (pick-wt=2): 51 [] ordinal($c2).
% 2.25/2.43 ** KEPT (pick-wt=2): 52 [] empty($c3).
% 2.25/2.43 ** KEPT (pick-wt=2): 53 [] relation($c3).
% 2.25/2.43 ** KEPT (pick-wt=2): 54 [] empty($c4).
% 2.25/2.43 ** KEPT (pick-wt=2): 55 [] relation($c5).
% 2.25/2.43 ** KEPT (pick-wt=2): 56 [] empty($c5).
% 2.25/2.43 ** KEPT (pick-wt=2): 57 [] function($c5).
% 2.25/2.43 ** KEPT (pick-wt=2): 58 [] relation($c6).
% 2.25/2.43 ** KEPT (pick-wt=2): 59 [] function($c6).
% 2.25/2.43 ** KEPT (pick-wt=2): 60 [] one_to_one($c6).
% 2.25/2.43 ** KEPT (pick-wt=2): 61 [] empty($c6).
% 2.25/2.43 ** KEPT (pick-wt=2): 62 [] epsilon_transitive($c6).
% 2.25/2.43 ** KEPT (pick-wt=2): 63 [] epsilon_connected($c6).
% 2.25/2.43 ** KEPT (pick-wt=2): 64 [] ordinal($c6).
% 2.25/2.43 ** KEPT (pick-wt=2): 65 [] relation($c7).
% 2.25/2.43 ** KEPT (pick-wt=2): 66 [] relation($c9).
% 2.25/2.43 ** KEPT (pick-wt=2): 67 [] function($c9).
% 2.25/2.43 ** KEPT (pick-wt=2): 68 [] one_to_one($c9).
% 2.25/2.43 ** KEPT (pick-wt=2): 69 [] epsilon_transitive($c10).
% 2.25/2.43 ** KEPT (pick-wt=2): 70 [] epsilon_connected($c10).
% 2.25/2.43 ** KEPT (pick-wt=2): 71 [] ordinal($c10).
% 2.25/2.43 ** KEPT (pick-wt=2): 72 [] relation($c11).
% 2.25/2.43 ** KEPT (pick-wt=2): 73 [] relation_empty_yielding($c11).
% 2.25/2.43 ** KEPT (pick-wt=2): 74 [] relation($c12).
% 2.25/2.43 ** KEPT (pick-wt=2): 75 [] relation_empty_yielding($c12).
% 2.25/2.43 ** KEPT (pick-wt=2): 76 [] function($c12).
% 2.25/2.43 ** KEPT (pick-wt=2): 77 [] relation($c13).
% 2.25/2.43 ** KEPT (pick-wt=2): 78 [] function($c13).
% 2.25/2.43 ** KEPT (pick-wt=2): 79 [] transfinite_se_quence($c13).
% 2.25/2.43 ** KEPT (pick-wt=2): 80 [] relation($c14).
% 2.25/2.43 ** KEPT (pick-wt=2): 81 [] relation_non_empty($c14).
% 2.25/2.43 ** KEPT (pick-wt=2): 82 [] function($c14).
% 2.25/2.43 ** KEPT (pick-wt=3): 83 [] subset(A,A).
% 2.25/2.43 ** KEPT (pick-wt=3): 84 [] subset($c17,$c16).
% 2.25/2.43 ** KEPT (pick-wt=3): 85 [] transfinite_se_quence_of($c15,$c17).
% 2.25/2.43 Following clause subsumed by 36 during input processing: 0 [copy,36,flip.1] A=A.
% 2.25/2.43 36 back subsumes 35.
% 2.25/2.43
% 2.25/2.43 ======= end of input processing =======
% 2.25/2.43
% 2.25/2.43 =========== start of search ===========
% 2.25/2.43
% 2.25/2.43 -------- PROOF --------
% 2.25/2.43
% 2.25/2.43 ----> UNIT CONFLICT at 0.00 sec ----> 198 [binary,197.1,28.1] $F.
% 2.25/2.43
% 2.25/2.43 Length of proof is 6. Level of proof is 4.
% 2.25/2.43
% 2.25/2.43 ---------------- PROOF ----------------
% 2.25/2.43 % SZS status Theorem
% 2.25/2.43 % SZS output start Refutation
% See solution above
% 2.25/2.43 ------------ end of proof -------------
% 2.25/2.43
% 2.25/2.43
% 2.25/2.43 Search stopped by max_proofs option.
% 2.25/2.43
% 2.25/2.43
% 2.25/2.43 Search stopped by max_proofs option.
% 2.25/2.43
% 2.25/2.43 ============ end of search ============
% 2.25/2.43
% 2.25/2.43 -------------- statistics -------------
% 2.25/2.43 clauses given 77
% 2.25/2.43 clauses generated 307
% 2.25/2.43 clauses kept 192
% 2.25/2.43 clauses forward subsumed 229
% 2.25/2.43 clauses back subsumed 2
% 2.25/2.43 Kbytes malloced 1953
% 2.25/2.43
% 2.25/2.43 ----------- times (seconds) -----------
% 2.25/2.43 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.25/2.43 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.25/2.43 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.25/2.43
% 2.25/2.43 That finishes the proof of the theorem.
% 2.25/2.43
% 2.25/2.43 Process 18351 finished Wed Jul 27 09:35:10 2022
% 2.25/2.43 Otter interrupted
% 2.25/2.43 PROOF FOUND
%------------------------------------------------------------------------------