TSTP Solution File: SEU361+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU361+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n025.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:52 EDT 2022
% Result : Theorem 3.00s 3.16s
% Output : Refutation 3.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 15
% Syntax : Number of clauses : 26 ( 17 unt; 2 nHn; 23 RR)
% Number of literals : 50 ( 7 equ; 25 neg)
% Maximal clause size : 8 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 18 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
( ~ rel_str(A)
| bottom_of_relstr(A) = join_on_relstr(A,empty_set) ),
file('SEU361+1.p',unknown),
[] ).
cnf(4,axiom,
( ~ rel_str(A)
| element(join_on_relstr(A,B),the_carrier(A)) ),
file('SEU361+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ antisymmetric_relstr(A)
| ~ rel_str(A)
| ~ element(B,the_carrier(A))
| B != join_on_relstr(A,C)
| ~ ex_sup_of_relstr_set(A,C)
| ~ element(D,the_carrier(A))
| ~ relstr_set_smaller(A,C,D)
| related(A,B,D) ),
file('SEU361+1.p',unknown),
[] ).
cnf(21,axiom,
( empty_carrier(A)
| ~ antisymmetric_relstr(A)
| ~ lower_bounded_relstr(A)
| ~ rel_str(A)
| ex_sup_of_relstr_set(A,empty_set) ),
file('SEU361+1.p',unknown),
[] ).
cnf(23,axiom,
~ empty_carrier(dollar_c8),
file('SEU361+1.p',unknown),
[] ).
cnf(24,axiom,
~ related(dollar_c8,bottom_of_relstr(dollar_c8),dollar_c7),
file('SEU361+1.p',unknown),
[] ).
cnf(26,axiom,
( ~ rel_str(A)
| ~ element(B,the_carrier(A))
| relstr_set_smaller(A,empty_set,B) ),
file('SEU361+1.p',unknown),
[] ).
cnf(29,axiom,
( ~ empty(A)
| A = B
| ~ empty(B) ),
file('SEU361+1.p',unknown),
[] ).
cnf(33,axiom,
A = A,
file('SEU361+1.p',unknown),
[] ).
cnf(37,axiom,
empty(empty_set),
file('SEU361+1.p',unknown),
[] ).
cnf(39,axiom,
empty(dollar_c4),
file('SEU361+1.p',unknown),
[] ).
cnf(41,axiom,
antisymmetric_relstr(dollar_c8),
file('SEU361+1.p',unknown),
[] ).
cnf(42,axiom,
lower_bounded_relstr(dollar_c8),
file('SEU361+1.p',unknown),
[] ).
cnf(43,axiom,
rel_str(dollar_c8),
file('SEU361+1.p',unknown),
[] ).
cnf(44,axiom,
element(dollar_c7,the_carrier(dollar_c8)),
file('SEU361+1.p',unknown),
[] ).
cnf(76,plain,
empty_set = dollar_c4,
inference(hyper,[status(thm)],[39,29,37]),
[iquote('hyper,39,29,37')] ).
cnf(89,plain,
( ~ rel_str(A)
| ~ element(B,the_carrier(A))
| relstr_set_smaller(A,dollar_c4,B) ),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[26]),76]),
[iquote('back_demod,26,demod,76')] ).
cnf(91,plain,
( empty_carrier(A)
| ~ antisymmetric_relstr(A)
| ~ lower_bounded_relstr(A)
| ~ rel_str(A)
| ex_sup_of_relstr_set(A,dollar_c4) ),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[21]),76]),
[iquote('back_demod,21,demod,76')] ).
cnf(92,plain,
( ~ rel_str(A)
| bottom_of_relstr(A) = join_on_relstr(A,dollar_c4) ),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[3]),76]),
[iquote('back_demod,3,demod,76')] ).
cnf(108,plain,
element(join_on_relstr(dollar_c8,A),the_carrier(dollar_c8)),
inference(hyper,[status(thm)],[43,4]),
[iquote('hyper,43,4')] ).
cnf(2119,plain,
bottom_of_relstr(dollar_c8) = join_on_relstr(dollar_c8,dollar_c4),
inference(hyper,[status(thm)],[92,43]),
[iquote('hyper,92,43')] ).
cnf(2247,plain,
~ related(dollar_c8,join_on_relstr(dollar_c8,dollar_c4),dollar_c7),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[24]),2119]),
[iquote('back_demod,24,demod,2119')] ).
cnf(2408,plain,
relstr_set_smaller(dollar_c8,dollar_c4,dollar_c7),
inference(hyper,[status(thm)],[89,43,44]),
[iquote('hyper,89,43,44')] ).
cnf(2508,plain,
ex_sup_of_relstr_set(dollar_c8,dollar_c4),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[91,41,42,43]),23]),
[iquote('hyper,91,41,42,43,unit_del,23')] ).
cnf(2517,plain,
related(dollar_c8,join_on_relstr(dollar_c8,dollar_c4),dollar_c7),
inference(hyper,[status(thm)],[2508,14,41,43,108,33,44,2408]),
[iquote('hyper,2508,14,41,43,108,33,44,2408')] ).
cnf(2518,plain,
$false,
inference(binary,[status(thm)],[2517,2247]),
[iquote('binary,2517.1,2247.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEU361+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n025.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 08:01:15 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.01/2.21 ----- Otter 3.3f, August 2004 -----
% 2.01/2.21 The process was started by sandbox2 on n025.cluster.edu,
% 2.01/2.21 Wed Jul 27 08:01:15 2022
% 2.01/2.21 The command was "./otter". The process ID is 17948.
% 2.01/2.21
% 2.01/2.21 set(prolog_style_variables).
% 2.01/2.21 set(auto).
% 2.01/2.21 dependent: set(auto1).
% 2.01/2.21 dependent: set(process_input).
% 2.01/2.21 dependent: clear(print_kept).
% 2.01/2.21 dependent: clear(print_new_demod).
% 2.01/2.21 dependent: clear(print_back_demod).
% 2.01/2.21 dependent: clear(print_back_sub).
% 2.01/2.21 dependent: set(control_memory).
% 2.01/2.21 dependent: assign(max_mem, 12000).
% 2.01/2.21 dependent: assign(pick_given_ratio, 4).
% 2.01/2.21 dependent: assign(stats_level, 1).
% 2.01/2.21 dependent: assign(max_seconds, 10800).
% 2.01/2.21 clear(print_given).
% 2.01/2.21
% 2.01/2.21 formula_list(usable).
% 2.01/2.21 all A (A=A).
% 2.01/2.21 all A B (in(A,B)-> -in(B,A)).
% 2.01/2.21 all A (empty(A)->finite(A)).
% 2.01/2.21 all A (rel_str(A)->bottom_of_relstr(A)=join_on_relstr(A,empty_set)).
% 2.01/2.21 $T.
% 2.01/2.21 all A B (rel_str(A)->element(join_on_relstr(A,B),the_carrier(A))).
% 2.01/2.21 all A (rel_str(A)->element(bottom_of_relstr(A),the_carrier(A))).
% 2.01/2.21 all A (rel_str(A)->one_sorted_str(A)).
% 2.01/2.21 $T.
% 2.01/2.21 $T.
% 2.01/2.21 $T.
% 2.01/2.21 exists A rel_str(A).
% 2.01/2.21 exists A one_sorted_str(A).
% 2.01/2.21 all A exists B element(B,A).
% 2.01/2.21 all A (-empty_carrier(A)&one_sorted_str(A)-> -empty(the_carrier(A))).
% 2.01/2.21 empty(empty_set).
% 2.01/2.21 exists A (-empty(A)&finite(A)).
% 2.01/2.21 exists A empty(A).
% 2.01/2.21 exists A (-empty(A)).
% 2.01/2.21 exists A (one_sorted_str(A)& -empty_carrier(A)).
% 2.01/2.21 all A B (in(A,B)->element(A,B)).
% 2.01/2.21 all A B (element(A,B)->empty(B)|in(A,B)).
% 2.01/2.21 all A (antisymmetric_relstr(A)&rel_str(A)-> (all B (element(B,the_carrier(A))-> (all C ((B=join_on_relstr(A,C)&ex_sup_of_relstr_set(A,C)->relstr_set_smaller(A,C,B)& (all D (element(D,the_carrier(A))-> (relstr_set_smaller(A,C,D)->related(A,B,D)))))& (relstr_set_smaller(A,C,B)& (all D (element(D,the_carrier(A))-> (relstr_set_smaller(A,C,D)->related(A,B,D))))->B=join_on_relstr(A,C)&ex_sup_of_relstr_set(A,C))))))).
% 2.01/2.21 all A (-empty_carrier(A)&antisymmetric_relstr(A)&lower_bounded_relstr(A)&rel_str(A)->ex_sup_of_relstr_set(A,empty_set)&ex_inf_of_relstr_set(A,the_carrier(A))).
% 2.01/2.21 -(all A (-empty_carrier(A)&antisymmetric_relstr(A)&lower_bounded_relstr(A)&rel_str(A)-> (all B (element(B,the_carrier(A))->related(A,bottom_of_relstr(A),B))))).
% 2.01/2.21 all A (empty(A)->A=empty_set).
% 2.01/2.21 all A (rel_str(A)-> (all B (element(B,the_carrier(A))->relstr_set_smaller(A,empty_set,B)&relstr_element_smaller(A,empty_set,B)))).
% 2.01/2.21 all A B (-(in(A,B)&empty(B))).
% 2.01/2.21 all A B (-(empty(A)&A!=B&empty(B))).
% 2.01/2.21 end_of_list.
% 2.01/2.21
% 2.01/2.21 -------> usable clausifies to:
% 2.01/2.21
% 2.01/2.21 list(usable).
% 2.01/2.21 0 [] A=A.
% 2.01/2.21 0 [] -in(A,B)| -in(B,A).
% 2.01/2.21 0 [] -empty(A)|finite(A).
% 2.01/2.21 0 [] -rel_str(A)|bottom_of_relstr(A)=join_on_relstr(A,empty_set).
% 2.01/2.21 0 [] $T.
% 2.01/2.21 0 [] -rel_str(A)|element(join_on_relstr(A,B),the_carrier(A)).
% 2.01/2.21 0 [] -rel_str(A)|element(bottom_of_relstr(A),the_carrier(A)).
% 2.01/2.21 0 [] -rel_str(A)|one_sorted_str(A).
% 2.01/2.21 0 [] $T.
% 2.01/2.21 0 [] $T.
% 2.01/2.21 0 [] $T.
% 2.01/2.21 0 [] rel_str($c1).
% 2.01/2.21 0 [] one_sorted_str($c2).
% 2.01/2.21 0 [] element($f1(A),A).
% 2.01/2.21 0 [] empty_carrier(A)| -one_sorted_str(A)| -empty(the_carrier(A)).
% 2.01/2.21 0 [] empty(empty_set).
% 2.01/2.21 0 [] -empty($c3).
% 2.01/2.21 0 [] finite($c3).
% 2.01/2.21 0 [] empty($c4).
% 2.01/2.21 0 [] -empty($c5).
% 2.01/2.21 0 [] one_sorted_str($c6).
% 2.01/2.21 0 [] -empty_carrier($c6).
% 2.01/2.21 0 [] -in(A,B)|element(A,B).
% 2.01/2.21 0 [] -element(A,B)|empty(B)|in(A,B).
% 2.01/2.21 0 [] -antisymmetric_relstr(A)| -rel_str(A)| -element(B,the_carrier(A))|B!=join_on_relstr(A,C)| -ex_sup_of_relstr_set(A,C)|relstr_set_smaller(A,C,B).
% 2.01/2.21 0 [] -antisymmetric_relstr(A)| -rel_str(A)| -element(B,the_carrier(A))|B!=join_on_relstr(A,C)| -ex_sup_of_relstr_set(A,C)| -element(D,the_carrier(A))| -relstr_set_smaller(A,C,D)|related(A,B,D).
% 2.01/2.21 0 [] -antisymmetric_relstr(A)| -rel_str(A)| -element(B,the_carrier(A))| -relstr_set_smaller(A,C,B)|element($f2(A,B,C),the_carrier(A))|B=join_on_relstr(A,C).
% 2.01/2.21 0 [] -antisymmetric_relstr(A)| -rel_str(A)| -element(B,the_carrier(A))| -relstr_set_smaller(A,C,B)|element($f2(A,B,C),the_carrier(A))|ex_sup_of_relstr_set(A,C).
% 2.01/2.21 0 [] -antisymmetric_relstr(A)| -rel_str(A)| -element(B,the_carrier(A))| -relstr_set_smaller(A,C,B)|relstr_set_smaller(A,C,$f2(A,B,C))|B=join_on_relstr(A,C).
% 2.01/2.21 0 [] -antisymmetric_relstr(A)| -rel_str(A)| -element(B,the_carrier(A))| -relstr_set_smaller(A,C,B)|relstr_set_smaller(A,C,$f2(A,B,C))|ex_sup_of_relstr_set(A,C).
% 2.01/2.21 0 [] -antisymmetric_relstr(A)| -rel_str(A)| -element(B,the_carrier(A))| -relstr_set_smaller(A,C,B)| -related(A,B,$f2(A,B,C))|B=join_on_relstr(A,C).
% 2.01/2.21 0 [] -antisymmetric_relstr(A)| -rel_str(A)| -element(B,the_carrier(A))| -relstr_set_smaller(A,C,B)| -related(A,B,$f2(A,B,C))|ex_sup_of_relstr_set(A,C).
% 2.01/2.21 0 [] empty_carrier(A)| -antisymmetric_relstr(A)| -lower_bounded_relstr(A)| -rel_str(A)|ex_sup_of_relstr_set(A,empty_set).
% 2.01/2.21 0 [] empty_carrier(A)| -antisymmetric_relstr(A)| -lower_bounded_relstr(A)| -rel_str(A)|ex_inf_of_relstr_set(A,the_carrier(A)).
% 2.01/2.21 0 [] -empty_carrier($c8).
% 2.01/2.21 0 [] antisymmetric_relstr($c8).
% 2.01/2.21 0 [] lower_bounded_relstr($c8).
% 2.01/2.21 0 [] rel_str($c8).
% 2.01/2.21 0 [] element($c7,the_carrier($c8)).
% 2.01/2.21 0 [] -related($c8,bottom_of_relstr($c8),$c7).
% 2.01/2.21 0 [] -empty(A)|A=empty_set.
% 2.01/2.21 0 [] -rel_str(A)| -element(B,the_carrier(A))|relstr_set_smaller(A,empty_set,B).
% 2.01/2.21 0 [] -rel_str(A)| -element(B,the_carrier(A))|relstr_element_smaller(A,empty_set,B).
% 2.01/2.21 0 [] -in(A,B)| -empty(B).
% 2.01/2.21 0 [] -empty(A)|A=B| -empty(B).
% 2.01/2.21 end_of_list.
% 2.01/2.21
% 2.01/2.21 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 2.01/2.21
% 2.01/2.21 This ia a non-Horn set with equality. The strategy will be
% 2.01/2.21 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.01/2.21 deletion, with positive clauses in sos and nonpositive
% 2.01/2.21 clauses in usable.
% 2.01/2.21
% 2.01/2.21 dependent: set(knuth_bendix).
% 2.01/2.21 dependent: set(anl_eq).
% 2.01/2.21 dependent: set(para_from).
% 2.01/2.21 dependent: set(para_into).
% 2.01/2.21 dependent: clear(para_from_right).
% 2.01/2.21 dependent: clear(para_into_right).
% 2.01/2.21 dependent: set(para_from_vars).
% 2.01/2.21 dependent: set(eq_units_both_ways).
% 2.01/2.21 dependent: set(dynamic_demod_all).
% 2.01/2.21 dependent: set(dynamic_demod).
% 2.01/2.21 dependent: set(order_eq).
% 2.01/2.21 dependent: set(back_demod).
% 2.01/2.21 dependent: set(lrpo).
% 2.01/2.21 dependent: set(hyper_res).
% 2.01/2.21 dependent: set(unit_deletion).
% 2.01/2.21 dependent: set(factor).
% 2.01/2.21
% 2.01/2.21 ------------> process usable:
% 2.01/2.21 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 2.01/2.21 ** KEPT (pick-wt=4): 2 [] -empty(A)|finite(A).
% 2.01/2.21 ** KEPT (pick-wt=8): 3 [] -rel_str(A)|bottom_of_relstr(A)=join_on_relstr(A,empty_set).
% 2.01/2.21 ** KEPT (pick-wt=8): 4 [] -rel_str(A)|element(join_on_relstr(A,B),the_carrier(A)).
% 2.01/2.21 ** KEPT (pick-wt=7): 5 [] -rel_str(A)|element(bottom_of_relstr(A),the_carrier(A)).
% 2.01/2.21 ** KEPT (pick-wt=4): 6 [] -rel_str(A)|one_sorted_str(A).
% 2.01/2.21 ** KEPT (pick-wt=7): 7 [] empty_carrier(A)| -one_sorted_str(A)| -empty(the_carrier(A)).
% 2.01/2.21 ** KEPT (pick-wt=2): 8 [] -empty($c3).
% 2.01/2.21 ** KEPT (pick-wt=2): 9 [] -empty($c5).
% 2.01/2.21 ** KEPT (pick-wt=2): 10 [] -empty_carrier($c6).
% 2.01/2.21 ** KEPT (pick-wt=6): 11 [] -in(A,B)|element(A,B).
% 2.01/2.21 ** KEPT (pick-wt=8): 12 [] -element(A,B)|empty(B)|in(A,B).
% 2.01/2.21 ** KEPT (pick-wt=20): 13 [] -antisymmetric_relstr(A)| -rel_str(A)| -element(B,the_carrier(A))|B!=join_on_relstr(A,C)| -ex_sup_of_relstr_set(A,C)|relstr_set_smaller(A,C,B).
% 2.01/2.21 ** KEPT (pick-wt=28): 14 [] -antisymmetric_relstr(A)| -rel_str(A)| -element(B,the_carrier(A))|B!=join_on_relstr(A,C)| -ex_sup_of_relstr_set(A,C)| -element(D,the_carrier(A))| -relstr_set_smaller(A,C,D)|related(A,B,D).
% 2.01/2.21 ** KEPT (pick-wt=24): 15 [] -antisymmetric_relstr(A)| -rel_str(A)| -element(B,the_carrier(A))| -relstr_set_smaller(A,C,B)|element($f2(A,B,C),the_carrier(A))|B=join_on_relstr(A,C).
% 2.01/2.21 ** KEPT (pick-wt=22): 16 [] -antisymmetric_relstr(A)| -rel_str(A)| -element(B,the_carrier(A))| -relstr_set_smaller(A,C,B)|element($f2(A,B,C),the_carrier(A))|ex_sup_of_relstr_set(A,C).
% 2.01/2.21 ** KEPT (pick-wt=24): 17 [] -antisymmetric_relstr(A)| -rel_str(A)| -element(B,the_carrier(A))| -relstr_set_smaller(A,C,B)|relstr_set_smaller(A,C,$f2(A,B,C))|B=join_on_relstr(A,C).
% 2.01/2.21 ** KEPT (pick-wt=22): 18 [] -antisymmetric_relstr(A)| -rel_str(A)| -element(B,the_carrier(A))| -relstr_set_smaller(A,C,B)|relstr_set_smaller(A,C,$f2(A,B,C))|ex_sup_of_relstr_set(A,C).
% 2.01/2.21 ** KEPT (pick-wt=24): 19 [] -antisymmetric_relstr(A)| -rel_str(A)| -element(B,the_carrier(A))| -relstr_set_smaller(A,C,B)| -related(A,B,$f2(A,B,C))|B=join_on_relstr(A,C).
% 2.01/2.21 ** KEPT (pick-wt=22): 20 [] -antisymmetric_relstr(A)| -rel_str(A)| -element(B,the_carrier(A))| -relstr_set_smaller(A,C,B)| -related(A,B,$f2(A,B,C))|ex_sup_of_relstr_set(A,C).
% 2.01/2.21 ** KEPT (pick-wt=11): 21 [] empty_carrier(A)| -antisymmetric_relstr(A)| -lower_bounded_relstr(A)| -rel_str(A)|ex_sup_of_relstr_set(A,empty_set).
% 2.01/2.21 ** KEPT (pick-wt=12): 22 [] empty_carrier(A)| -antisymmetric_relstr(A)| -lower_bounded_relstr(A)| -rel_str(A)|ex_inf_of_relstr_set(A,the_carrier(A)).
% 3.00/3.16 ** KEPT (pick-wt=2): 23 [] -empty_carrier($c8).
% 3.00/3.16 ** KEPT (pick-wt=5): 24 [] -related($c8,bottom_of_relstr($c8),$c7).
% 3.00/3.16 ** KEPT (pick-wt=5): 25 [] -empty(A)|A=empty_set.
% 3.00/3.16 ** KEPT (pick-wt=10): 26 [] -rel_str(A)| -element(B,the_carrier(A))|relstr_set_smaller(A,empty_set,B).
% 3.00/3.16 ** KEPT (pick-wt=10): 27 [] -rel_str(A)| -element(B,the_carrier(A))|relstr_element_smaller(A,empty_set,B).
% 3.00/3.16 ** KEPT (pick-wt=5): 28 [] -in(A,B)| -empty(B).
% 3.00/3.16 ** KEPT (pick-wt=7): 29 [] -empty(A)|A=B| -empty(B).
% 3.00/3.16
% 3.00/3.16 ------------> process sos:
% 3.00/3.16 ** KEPT (pick-wt=3): 33 [] A=A.
% 3.00/3.16 ** KEPT (pick-wt=2): 34 [] rel_str($c1).
% 3.00/3.16 ** KEPT (pick-wt=2): 35 [] one_sorted_str($c2).
% 3.00/3.16 ** KEPT (pick-wt=4): 36 [] element($f1(A),A).
% 3.00/3.16 ** KEPT (pick-wt=2): 37 [] empty(empty_set).
% 3.00/3.16 ** KEPT (pick-wt=2): 38 [] finite($c3).
% 3.00/3.16 ** KEPT (pick-wt=2): 39 [] empty($c4).
% 3.00/3.16 ** KEPT (pick-wt=2): 40 [] one_sorted_str($c6).
% 3.00/3.16 ** KEPT (pick-wt=2): 41 [] antisymmetric_relstr($c8).
% 3.00/3.16 ** KEPT (pick-wt=2): 42 [] lower_bounded_relstr($c8).
% 3.00/3.16 ** KEPT (pick-wt=2): 43 [] rel_str($c8).
% 3.00/3.16 ** KEPT (pick-wt=4): 44 [] element($c7,the_carrier($c8)).
% 3.00/3.16 Following clause subsumed by 33 during input processing: 0 [copy,33,flip.1] A=A.
% 3.00/3.16 33 back subsumes 32.
% 3.00/3.16
% 3.00/3.16 ======= end of input processing =======
% 3.00/3.16
% 3.00/3.16 =========== start of search ===========
% 3.00/3.16
% 3.00/3.16
% 3.00/3.16 Resetting weight limit to 8.
% 3.00/3.16
% 3.00/3.16
% 3.00/3.16 Resetting weight limit to 8.
% 3.00/3.16
% 3.00/3.16 sos_size=2184
% 3.00/3.16
% 3.00/3.16 -------- PROOF --------
% 3.00/3.16
% 3.00/3.16 ----> UNIT CONFLICT at 0.95 sec ----> 2518 [binary,2517.1,2247.1] $F.
% 3.00/3.16
% 3.00/3.16 Length of proof is 10. Level of proof is 4.
% 3.00/3.16
% 3.00/3.16 ---------------- PROOF ----------------
% 3.00/3.16 % SZS status Theorem
% 3.00/3.16 % SZS output start Refutation
% See solution above
% 3.00/3.16 ------------ end of proof -------------
% 3.00/3.16
% 3.00/3.16
% 3.00/3.16 Search stopped by max_proofs option.
% 3.00/3.16
% 3.00/3.16
% 3.00/3.16 Search stopped by max_proofs option.
% 3.00/3.16
% 3.00/3.16 ============ end of search ============
% 3.00/3.16
% 3.00/3.16 -------------- statistics -------------
% 3.00/3.16 clauses given 122
% 3.00/3.16 clauses generated 3995
% 3.00/3.16 clauses kept 2513
% 3.00/3.16 clauses forward subsumed 1679
% 3.00/3.16 clauses back subsumed 26
% 3.00/3.16 Kbytes malloced 4882
% 3.00/3.16
% 3.00/3.16 ----------- times (seconds) -----------
% 3.00/3.16 user CPU time 0.95 (0 hr, 0 min, 0 sec)
% 3.00/3.16 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 3.00/3.16 wall-clock time 3 (0 hr, 0 min, 3 sec)
% 3.00/3.16
% 3.00/3.16 That finishes the proof of the theorem.
% 3.00/3.16
% 3.00/3.16 Process 17948 finished Wed Jul 27 08:01:18 2022
% 3.00/3.16 Otter interrupted
% 3.00/3.16 PROOF FOUND
%------------------------------------------------------------------------------