TSTP Solution File: SEU280+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU280+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n016.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:27 EDT 2022
% Result : Theorem 1.59s 1.81s
% Output : Refutation 1.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 16
% Syntax : Number of clauses : 42 ( 8 unt; 28 nHn; 30 RR)
% Number of literals : 104 ( 41 equ; 27 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-2 aty)
% Number of variables : 42 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ in(dollar_f1(A),A)
| ~ in(dollar_f1(A),dollar_c1)
| ~ ordinal(dollar_f1(A)) ),
file('SEU280+1.p',unknown),
[] ).
cnf(6,axiom,
( dollar_f4(A) = dollar_f3(A)
| ~ in(B,dollar_f6(A))
| in(dollar_f5(A,B),A) ),
file('SEU280+1.p',unknown),
[] ).
cnf(7,axiom,
( dollar_f4(A) = dollar_f3(A)
| ~ in(B,dollar_f6(A))
| dollar_f5(A,B) = B ),
file('SEU280+1.p',unknown),
[] ).
cnf(8,axiom,
( dollar_f4(A) = dollar_f3(A)
| ~ in(B,dollar_f6(A))
| ordinal(B) ),
file('SEU280+1.p',unknown),
[] ).
cnf(9,axiom,
( dollar_f4(A) = dollar_f3(A)
| in(B,dollar_f6(A))
| ~ in(C,A)
| C != B
| ~ ordinal(B) ),
file('SEU280+1.p',unknown),
[] ).
cnf(14,axiom,
( dollar_f4(A) = dollar_f2(A)
| ~ in(B,dollar_f6(A))
| in(dollar_f5(A,B),A) ),
file('SEU280+1.p',unknown),
[] ).
cnf(15,axiom,
( dollar_f4(A) = dollar_f2(A)
| ~ in(B,dollar_f6(A))
| dollar_f5(A,B) = B ),
file('SEU280+1.p',unknown),
[] ).
cnf(16,axiom,
( dollar_f4(A) = dollar_f2(A)
| ~ in(B,dollar_f6(A))
| ordinal(B) ),
file('SEU280+1.p',unknown),
[] ).
cnf(17,axiom,
( dollar_f4(A) = dollar_f2(A)
| in(B,dollar_f6(A))
| ~ in(C,A)
| C != B
| ~ ordinal(B) ),
file('SEU280+1.p',unknown),
[] ).
cnf(22,axiom,
( dollar_f3(A) != dollar_f2(A)
| ~ in(B,dollar_f6(A))
| in(dollar_f5(A,B),A) ),
file('SEU280+1.p',unknown),
[] ).
cnf(23,axiom,
( dollar_f3(A) != dollar_f2(A)
| ~ in(B,dollar_f6(A))
| dollar_f5(A,B) = B ),
file('SEU280+1.p',unknown),
[] ).
cnf(24,axiom,
( dollar_f3(A) != dollar_f2(A)
| ~ in(B,dollar_f6(A))
| ordinal(B) ),
file('SEU280+1.p',unknown),
[] ).
cnf(25,axiom,
( dollar_f3(A) != dollar_f2(A)
| in(B,dollar_f6(A))
| ~ in(C,A)
| C != B
| ~ ordinal(B) ),
file('SEU280+1.p',unknown),
[] ).
cnf(31,axiom,
A = A,
file('SEU280+1.p',unknown),
[] ).
cnf(32,axiom,
( in(dollar_f1(A),A)
| in(dollar_f1(A),dollar_c1) ),
file('SEU280+1.p',unknown),
[] ).
cnf(33,axiom,
( in(dollar_f1(A),A)
| ordinal(dollar_f1(A)) ),
file('SEU280+1.p',unknown),
[] ).
cnf(42,plain,
( in(dollar_f1(dollar_f6(A)),dollar_c1)
| dollar_f4(A) = dollar_f2(A)
| dollar_f5(A,dollar_f1(dollar_f6(A))) = dollar_f1(dollar_f6(A)) ),
inference(hyper,[status(thm)],[32,15]),
[iquote('hyper,32,15')] ).
cnf(43,plain,
( in(dollar_f1(dollar_f6(A)),dollar_c1)
| dollar_f4(A) = dollar_f2(A)
| in(dollar_f5(A,dollar_f1(dollar_f6(A))),A) ),
inference(hyper,[status(thm)],[32,14]),
[iquote('hyper,32,14')] ).
cnf(48,plain,
( in(dollar_f1(dollar_f6(A)),dollar_c1)
| dollar_f4(A) = dollar_f3(A)
| dollar_f5(A,dollar_f1(dollar_f6(A))) = dollar_f1(dollar_f6(A)) ),
inference(hyper,[status(thm)],[32,7]),
[iquote('hyper,32,7')] ).
cnf(49,plain,
( in(dollar_f1(dollar_f6(A)),dollar_c1)
| dollar_f4(A) = dollar_f3(A)
| in(dollar_f5(A,dollar_f1(dollar_f6(A))),A) ),
inference(hyper,[status(thm)],[32,6]),
[iquote('hyper,32,6')] ).
cnf(51,plain,
( in(dollar_f1(A),A)
| dollar_f4(dollar_c1) = dollar_f2(dollar_c1)
| in(dollar_f1(A),dollar_f6(dollar_c1)) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[33,17,32,31])]),
[iquote('hyper,33,17,32,31,factor_simp')] ).
cnf(53,plain,
( in(dollar_f1(A),A)
| dollar_f4(dollar_c1) = dollar_f3(dollar_c1)
| in(dollar_f1(A),dollar_f6(dollar_c1)) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[33,9,32,31])]),
[iquote('hyper,33,9,32,31,factor_simp')] ).
cnf(57,plain,
( in(dollar_f1(dollar_f6(dollar_c1)),dollar_f6(dollar_c1))
| dollar_f4(dollar_c1) = dollar_f2(dollar_c1) ),
inference(factor,[status(thm)],[51]),
[iquote('factor,51.1.3')] ).
cnf(59,plain,
( in(dollar_f1(dollar_f6(dollar_c1)),dollar_f6(dollar_c1))
| dollar_f4(dollar_c1) = dollar_f3(dollar_c1) ),
inference(factor,[status(thm)],[53]),
[iquote('factor,53.1.3')] ).
cnf(80,plain,
( dollar_f4(dollar_c1) = dollar_f2(dollar_c1)
| ordinal(dollar_f1(dollar_f6(dollar_c1))) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[57,16])]),
[iquote('hyper,57,16,factor_simp')] ).
cnf(130,plain,
( dollar_f4(dollar_c1) = dollar_f3(dollar_c1)
| ordinal(dollar_f1(dollar_f6(dollar_c1))) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[59,8])]),
[iquote('hyper,59,8,factor_simp')] ).
cnf(133,plain,
( in(dollar_f1(dollar_f6(dollar_c1)),dollar_f6(dollar_c1))
| dollar_f3(dollar_c1) = dollar_f2(dollar_c1) ),
inference(factor_simp,[status(thm)],[inference(para_into,[status(thm),theory(equality)],[59,57])]),
[iquote('para_into,59.2.1,57.2.1,factor_simp')] ).
cnf(142,plain,
( dollar_f3(dollar_c1) = dollar_f2(dollar_c1)
| ordinal(dollar_f1(dollar_f6(dollar_c1))) ),
inference(factor_simp,[status(thm)],[inference(para_into,[status(thm),theory(equality)],[130,80])]),
[iquote('para_into,130.1.1,80.1.1,factor_simp')] ).
cnf(201,plain,
( in(dollar_f1(dollar_f6(A)),dollar_c1)
| dollar_f4(A) = dollar_f2(A)
| in(dollar_f1(dollar_f6(A)),A) ),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(para_into,[status(thm),theory(equality)],[43,42])])]),
[iquote('para_into,43.3.1,42.3.1,factor_simp,factor_simp')] ).
cnf(203,plain,
( in(dollar_f1(dollar_f6(dollar_c1)),dollar_c1)
| dollar_f4(dollar_c1) = dollar_f2(dollar_c1) ),
inference(factor,[status(thm)],[201]),
[iquote('factor,201.1.3')] ).
cnf(224,plain,
dollar_f4(dollar_c1) = dollar_f2(dollar_c1),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[203,1,57,80])])]),
[iquote('hyper,203,1,57,80,factor_simp,factor_simp')] ).
cnf(233,plain,
( dollar_f3(dollar_c1) = dollar_f2(dollar_c1)
| ~ in(A,dollar_f6(dollar_c1))
| ordinal(A) ),
inference(para_into,[status(thm),theory(equality)],[224,8]),
[iquote('para_into,223.1.1,8.1.1')] ).
cnf(251,plain,
( ~ in(A,dollar_f6(dollar_c1))
| ordinal(A) ),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[233,24]),31])])]),
[iquote('para_from,233.1.1,24.1.1,unit_del,31,factor_simp,factor_simp')] ).
cnf(303,plain,
( in(dollar_f1(dollar_f6(A)),dollar_c1)
| dollar_f4(A) = dollar_f3(A)
| in(dollar_f1(dollar_f6(A)),A) ),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(para_into,[status(thm),theory(equality)],[49,48])])]),
[iquote('para_into,49.3.1,48.3.1,factor_simp,factor_simp')] ).
cnf(304,plain,
( in(dollar_f1(dollar_f6(dollar_c1)),dollar_c1)
| dollar_f3(dollar_c1) = dollar_f2(dollar_c1) ),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(factor,[status(thm)],[303]),224])]),
[iquote('factor,303.1.3,demod,224,flip.2')] ).
cnf(305,plain,
dollar_f3(dollar_c1) = dollar_f2(dollar_c1),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[304,1,133,142])])]),
[iquote('hyper,304,1,133,142,factor_simp,factor_simp')] ).
cnf(315,plain,
( in(dollar_f1(A),dollar_f6(dollar_c1))
| in(dollar_f1(A),A) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[305,25,32,31,33])]),
[iquote('hyper,305,25,32,31,33,factor_simp')] ).
cnf(322,plain,
in(dollar_f1(dollar_f6(dollar_c1)),dollar_f6(dollar_c1)),
inference(factor,[status(thm)],[315]),
[iquote('factor,315.1.2')] ).
cnf(327,plain,
ordinal(dollar_f1(dollar_f6(dollar_c1))),
inference(hyper,[status(thm)],[322,251]),
[iquote('hyper,322,251')] ).
cnf(329,plain,
dollar_f5(dollar_c1,dollar_f1(dollar_f6(dollar_c1))) = dollar_f1(dollar_f6(dollar_c1)),
inference(hyper,[status(thm)],[322,23,305]),
[iquote('hyper,322,23,305')] ).
cnf(330,plain,
in(dollar_f1(dollar_f6(dollar_c1)),dollar_c1),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[322,22,305]),329]),
[iquote('hyper,322,22,305,demod,329')] ).
cnf(339,plain,
$false,
inference(hyper,[status(thm)],[330,1,322,327]),
[iquote('hyper,330,1,322,327')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU280+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.13 % Command : otter-tptp-script %s
% 0.14/0.34 % Computer : n016.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Wed Jul 27 08:15:52 EDT 2022
% 0.14/0.34 % CPUTime :
% 1.59/1.79 ----- Otter 3.3f, August 2004 -----
% 1.59/1.79 The process was started by sandbox2 on n016.cluster.edu,
% 1.59/1.79 Wed Jul 27 08:15:52 2022
% 1.59/1.79 The command was "./otter". The process ID is 25301.
% 1.59/1.79
% 1.59/1.79 set(prolog_style_variables).
% 1.59/1.79 set(auto).
% 1.59/1.79 dependent: set(auto1).
% 1.59/1.79 dependent: set(process_input).
% 1.59/1.79 dependent: clear(print_kept).
% 1.59/1.79 dependent: clear(print_new_demod).
% 1.59/1.79 dependent: clear(print_back_demod).
% 1.59/1.79 dependent: clear(print_back_sub).
% 1.59/1.79 dependent: set(control_memory).
% 1.59/1.79 dependent: assign(max_mem, 12000).
% 1.59/1.79 dependent: assign(pick_given_ratio, 4).
% 1.59/1.79 dependent: assign(stats_level, 1).
% 1.59/1.79 dependent: assign(max_seconds, 10800).
% 1.59/1.79 clear(print_given).
% 1.59/1.79
% 1.59/1.79 formula_list(usable).
% 1.59/1.79 all A (A=A).
% 1.59/1.79 -(all A exists B all C (in(C,B)<->in(C,A)&ordinal(C))).
% 1.59/1.79 all A (epsilon_transitive(A)&epsilon_connected(A)->ordinal(A)).
% 1.59/1.79 exists A (epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 1.59/1.79 all A B (in(A,B)-> -in(B,A)).
% 1.59/1.79 all A (ordinal(A)->epsilon_transitive(A)&epsilon_connected(A)).
% 1.59/1.79 all A ((all B C D (B=C&ordinal(C)&B=D&ordinal(D)->C=D))-> (exists B all C (in(C,B)<-> (exists D (in(D,A)&D=C&ordinal(C)))))).
% 1.59/1.79 end_of_list.
% 1.59/1.79
% 1.59/1.79 -------> usable clausifies to:
% 1.59/1.79
% 1.59/1.79 list(usable).
% 1.59/1.79 0 [] A=A.
% 1.59/1.79 0 [] in($f1(B),B)|in($f1(B),$c1).
% 1.59/1.79 0 [] in($f1(B),B)|ordinal($f1(B)).
% 1.59/1.79 0 [] -in($f1(B),B)| -in($f1(B),$c1)| -ordinal($f1(B)).
% 1.59/1.79 0 [] -epsilon_transitive(A)| -epsilon_connected(A)|ordinal(A).
% 1.59/1.79 0 [] epsilon_transitive($c2).
% 1.59/1.79 0 [] epsilon_connected($c2).
% 1.59/1.79 0 [] ordinal($c2).
% 1.59/1.79 0 [] -in(A,B)| -in(B,A).
% 1.59/1.79 0 [] -ordinal(A)|epsilon_transitive(A).
% 1.59/1.79 0 [] -ordinal(A)|epsilon_connected(A).
% 1.59/1.79 0 [] $f4(A)=$f3(A)| -in(C,$f6(A))|in($f5(A,C),A).
% 1.59/1.79 0 [] $f4(A)=$f3(A)| -in(C,$f6(A))|$f5(A,C)=C.
% 1.59/1.79 0 [] $f4(A)=$f3(A)| -in(C,$f6(A))|ordinal(C).
% 1.59/1.79 0 [] $f4(A)=$f3(A)|in(C,$f6(A))| -in(D,A)|D!=C| -ordinal(C).
% 1.59/1.79 0 [] ordinal($f3(A))| -in(C,$f6(A))|in($f5(A,C),A).
% 1.59/1.79 0 [] ordinal($f3(A))| -in(C,$f6(A))|$f5(A,C)=C.
% 1.59/1.79 0 [] ordinal($f3(A))| -in(C,$f6(A))|ordinal(C).
% 1.59/1.79 0 [] ordinal($f3(A))|in(C,$f6(A))| -in(D,A)|D!=C| -ordinal(C).
% 1.59/1.79 0 [] $f4(A)=$f2(A)| -in(C,$f6(A))|in($f5(A,C),A).
% 1.59/1.79 0 [] $f4(A)=$f2(A)| -in(C,$f6(A))|$f5(A,C)=C.
% 1.59/1.79 0 [] $f4(A)=$f2(A)| -in(C,$f6(A))|ordinal(C).
% 1.59/1.79 0 [] $f4(A)=$f2(A)|in(C,$f6(A))| -in(D,A)|D!=C| -ordinal(C).
% 1.59/1.79 0 [] ordinal($f2(A))| -in(C,$f6(A))|in($f5(A,C),A).
% 1.59/1.79 0 [] ordinal($f2(A))| -in(C,$f6(A))|$f5(A,C)=C.
% 1.59/1.79 0 [] ordinal($f2(A))| -in(C,$f6(A))|ordinal(C).
% 1.59/1.79 0 [] ordinal($f2(A))|in(C,$f6(A))| -in(D,A)|D!=C| -ordinal(C).
% 1.59/1.79 0 [] $f3(A)!=$f2(A)| -in(C,$f6(A))|in($f5(A,C),A).
% 1.59/1.79 0 [] $f3(A)!=$f2(A)| -in(C,$f6(A))|$f5(A,C)=C.
% 1.59/1.79 0 [] $f3(A)!=$f2(A)| -in(C,$f6(A))|ordinal(C).
% 1.59/1.79 0 [] $f3(A)!=$f2(A)|in(C,$f6(A))| -in(D,A)|D!=C| -ordinal(C).
% 1.59/1.79 end_of_list.
% 1.59/1.79
% 1.59/1.79 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 1.59/1.79
% 1.59/1.79 This ia a non-Horn set with equality. The strategy will be
% 1.59/1.79 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.59/1.79 deletion, with positive clauses in sos and nonpositive
% 1.59/1.79 clauses in usable.
% 1.59/1.79
% 1.59/1.79 dependent: set(knuth_bendix).
% 1.59/1.79 dependent: set(anl_eq).
% 1.59/1.79 dependent: set(para_from).
% 1.59/1.79 dependent: set(para_into).
% 1.59/1.79 dependent: clear(para_from_right).
% 1.59/1.79 dependent: clear(para_into_right).
% 1.59/1.79 dependent: set(para_from_vars).
% 1.59/1.79 dependent: set(eq_units_both_ways).
% 1.59/1.79 dependent: set(dynamic_demod_all).
% 1.59/1.79 dependent: set(dynamic_demod).
% 1.59/1.79 dependent: set(order_eq).
% 1.59/1.79 dependent: set(back_demod).
% 1.59/1.79 dependent: set(lrpo).
% 1.59/1.79 dependent: set(hyper_res).
% 1.59/1.79 dependent: set(unit_deletion).
% 1.59/1.79 dependent: set(factor).
% 1.59/1.79
% 1.59/1.79 ------------> process usable:
% 1.59/1.79 ** KEPT (pick-wt=11): 1 [] -in($f1(A),A)| -in($f1(A),$c1)| -ordinal($f1(A)).
% 1.59/1.79 ** KEPT (pick-wt=6): 2 [] -epsilon_transitive(A)| -epsilon_connected(A)|ordinal(A).
% 1.59/1.79 ** KEPT (pick-wt=6): 3 [] -in(A,B)| -in(B,A).
% 1.59/1.79 ** KEPT (pick-wt=4): 4 [] -ordinal(A)|epsilon_transitive(A).
% 1.59/1.79 ** KEPT (pick-wt=4): 5 [] -ordinal(A)|epsilon_connected(A).
% 1.59/1.79 ** KEPT (pick-wt=14): 6 [] $f4(A)=$f3(A)| -in(B,$f6(A))|in($f5(A,B),A).
% 1.59/1.79 ** KEPT (pick-wt=14): 7 [] $f4(A)=$f3(A)| -in(B,$f6(A))|$f5(A,B)=B.
% 1.59/1.79 ** KEPT (pick-wt=11): 8 [] $f4(A)=$f3(A)| -in(B,$f6(A))|ordinal(B).
% 1.59/1.79 ** KEPT (pick-wt=17): 9 [] $f4(A)=$f3(A)|in(B,$f6(A))| -in(C,A)|C!=B| -ordinal(B).
% 1.59/1.79 ** KEPT (pick-wt=12): 10 [] ordinal($f3(A))| -in(B,$f6(A))|in($f5(A,B),A).
% 1.59/1.79 ** KEPT (pick-wt=12): 11 [] ordinal($f3(A))| -in(B,$f6(A))|$f5(A,B)=B.
% 1.59/1.81 ** KEPT (pick-wt=9): 12 [] ordinal($f3(A))| -in(B,$f6(A))|ordinal(B).
% 1.59/1.81 ** KEPT (pick-wt=15): 13 [] ordinal($f3(A))|in(B,$f6(A))| -in(C,A)|C!=B| -ordinal(B).
% 1.59/1.81 ** KEPT (pick-wt=14): 14 [] $f4(A)=$f2(A)| -in(B,$f6(A))|in($f5(A,B),A).
% 1.59/1.81 ** KEPT (pick-wt=14): 15 [] $f4(A)=$f2(A)| -in(B,$f6(A))|$f5(A,B)=B.
% 1.59/1.81 ** KEPT (pick-wt=11): 16 [] $f4(A)=$f2(A)| -in(B,$f6(A))|ordinal(B).
% 1.59/1.81 ** KEPT (pick-wt=17): 17 [] $f4(A)=$f2(A)|in(B,$f6(A))| -in(C,A)|C!=B| -ordinal(B).
% 1.59/1.81 ** KEPT (pick-wt=12): 18 [] ordinal($f2(A))| -in(B,$f6(A))|in($f5(A,B),A).
% 1.59/1.81 ** KEPT (pick-wt=12): 19 [] ordinal($f2(A))| -in(B,$f6(A))|$f5(A,B)=B.
% 1.59/1.81 ** KEPT (pick-wt=9): 20 [] ordinal($f2(A))| -in(B,$f6(A))|ordinal(B).
% 1.59/1.81 ** KEPT (pick-wt=15): 21 [] ordinal($f2(A))|in(B,$f6(A))| -in(C,A)|C!=B| -ordinal(B).
% 1.59/1.81 ** KEPT (pick-wt=14): 22 [] $f3(A)!=$f2(A)| -in(B,$f6(A))|in($f5(A,B),A).
% 1.59/1.81 ** KEPT (pick-wt=14): 23 [] $f3(A)!=$f2(A)| -in(B,$f6(A))|$f5(A,B)=B.
% 1.59/1.81 ** KEPT (pick-wt=11): 24 [] $f3(A)!=$f2(A)| -in(B,$f6(A))|ordinal(B).
% 1.59/1.81 ** KEPT (pick-wt=17): 25 [] $f3(A)!=$f2(A)|in(B,$f6(A))| -in(C,A)|C!=B| -ordinal(B).
% 1.59/1.81
% 1.59/1.81 ------------> process sos:
% 1.59/1.81 ** KEPT (pick-wt=3): 31 [] A=A.
% 1.59/1.81 ** KEPT (pick-wt=8): 32 [] in($f1(A),A)|in($f1(A),$c1).
% 1.59/1.81 ** KEPT (pick-wt=7): 33 [] in($f1(A),A)|ordinal($f1(A)).
% 1.59/1.81 ** KEPT (pick-wt=2): 34 [] epsilon_transitive($c2).
% 1.59/1.81 ** KEPT (pick-wt=2): 35 [] epsilon_connected($c2).
% 1.59/1.81 ** KEPT (pick-wt=2): 36 [] ordinal($c2).
% 1.59/1.81 Following clause subsumed by 31 during input processing: 0 [copy,31,flip.1] A=A.
% 1.59/1.81
% 1.59/1.81 ======= end of input processing =======
% 1.59/1.81
% 1.59/1.81 =========== start of search ===========
% 1.59/1.81
% 1.59/1.81 -------- PROOF --------
% 1.59/1.81
% 1.59/1.81 -----> EMPTY CLAUSE at 0.02 sec ----> 339 [hyper,330,1,322,327] $F.
% 1.59/1.81
% 1.59/1.81 Length of proof is 25. Level of proof is 10.
% 1.59/1.81
% 1.59/1.81 ---------------- PROOF ----------------
% 1.59/1.81 % SZS status Theorem
% 1.59/1.81 % SZS output start Refutation
% See solution above
% 1.59/1.81 ------------ end of proof -------------
% 1.59/1.81
% 1.59/1.81
% 1.59/1.81 Search stopped by max_proofs option.
% 1.59/1.81
% 1.59/1.81
% 1.59/1.81 Search stopped by max_proofs option.
% 1.59/1.81
% 1.59/1.81 ============ end of search ============
% 1.59/1.81
% 1.59/1.81 -------------- statistics -------------
% 1.59/1.81 clauses given 74
% 1.59/1.81 clauses generated 1772
% 1.59/1.81 clauses kept 335
% 1.59/1.81 clauses forward subsumed 1532
% 1.59/1.81 clauses back subsumed 114
% 1.59/1.81 Kbytes malloced 976
% 1.59/1.81
% 1.59/1.81 ----------- times (seconds) -----------
% 1.59/1.81 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 1.59/1.81 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.59/1.81 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.59/1.81
% 1.59/1.81 That finishes the proof of the theorem.
% 1.59/1.81
% 1.59/1.81 Process 25301 finished Wed Jul 27 08:15:53 2022
% 1.59/1.81 Otter interrupted
% 1.59/1.81 PROOF FOUND
%------------------------------------------------------------------------------