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