TSTP Solution File: SET931+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SET931+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n018.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:14:33 EDT 2022
% Result : Theorem 15.53s 15.79s
% Output : Refutation 15.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of clauses : 43 ( 10 unt; 10 nHn; 32 RR)
% Number of literals : 94 ( 74 equ; 43 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 31 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ subset(A,unordered_pair(B,C))
| A = empty_set
| A = singleton(B)
| A = singleton(C)
| A = unordered_pair(B,C) ),
file('SET931+1.p',unknown),
[] ).
cnf(2,axiom,
( subset(A,unordered_pair(B,C))
| A != empty_set ),
file('SET931+1.p',unknown),
[] ).
cnf(3,axiom,
( subset(A,unordered_pair(B,C))
| A != singleton(B) ),
file('SET931+1.p',unknown),
[] ).
cnf(5,axiom,
( subset(A,unordered_pair(B,C))
| A != unordered_pair(B,C) ),
file('SET931+1.p',unknown),
[] ).
cnf(7,axiom,
( set_difference(A,B) != empty_set
| subset(A,B) ),
file('SET931+1.p',unknown),
[] ).
cnf(8,axiom,
( set_difference(A,B) = empty_set
| ~ subset(A,B) ),
file('SET931+1.p',unknown),
[] ).
cnf(9,axiom,
( set_difference(dollar_c5,unordered_pair(dollar_c4,dollar_c3)) != empty_set
| dollar_c5 != empty_set ),
file('SET931+1.p',unknown),
[] ).
cnf(10,plain,
( set_difference(dollar_c5,unordered_pair(dollar_c4,dollar_c3)) != empty_set
| empty_set != dollar_c5 ),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[9])]),
[iquote('copy,9,flip.2')] ).
cnf(11,axiom,
( set_difference(dollar_c5,unordered_pair(dollar_c4,dollar_c3)) != empty_set
| dollar_c5 != singleton(dollar_c4) ),
file('SET931+1.p',unknown),
[] ).
cnf(12,plain,
( set_difference(dollar_c5,unordered_pair(dollar_c4,dollar_c3)) != empty_set
| singleton(dollar_c4) != dollar_c5 ),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[11])]),
[iquote('copy,11,flip.2')] ).
cnf(13,axiom,
( set_difference(dollar_c5,unordered_pair(dollar_c4,dollar_c3)) != empty_set
| dollar_c5 != singleton(dollar_c3) ),
file('SET931+1.p',unknown),
[] ).
cnf(14,plain,
( set_difference(dollar_c5,unordered_pair(dollar_c4,dollar_c3)) != empty_set
| singleton(dollar_c3) != dollar_c5 ),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[13])]),
[iquote('copy,13,flip.2')] ).
cnf(15,axiom,
( set_difference(dollar_c5,unordered_pair(dollar_c4,dollar_c3)) != empty_set
| dollar_c5 != unordered_pair(dollar_c4,dollar_c3) ),
file('SET931+1.p',unknown),
[] ).
cnf(16,plain,
( set_difference(dollar_c5,unordered_pair(dollar_c4,dollar_c3)) != empty_set
| unordered_pair(dollar_c4,dollar_c3) != dollar_c5 ),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[15])]),
[iquote('copy,15,flip.2')] ).
cnf(18,axiom,
A = A,
file('SET931+1.p',unknown),
[] ).
cnf(19,axiom,
unordered_pair(A,B) = unordered_pair(B,A),
file('SET931+1.p',unknown),
[] ).
cnf(23,axiom,
( set_difference(dollar_c5,unordered_pair(dollar_c4,dollar_c3)) = empty_set
| dollar_c5 = empty_set
| dollar_c5 = singleton(dollar_c4)
| dollar_c5 = singleton(dollar_c3)
| dollar_c5 = unordered_pair(dollar_c4,dollar_c3) ),
file('SET931+1.p',unknown),
[] ).
cnf(24,plain,
( set_difference(dollar_c5,unordered_pair(dollar_c4,dollar_c3)) = empty_set
| empty_set = dollar_c5
| singleton(dollar_c4) = dollar_c5
| singleton(dollar_c3) = dollar_c5
| unordered_pair(dollar_c4,dollar_c3) = dollar_c5 ),
inference(flip,[status(thm),theory(equality)],[inference(flip,[status(thm),theory(equality)],[inference(flip,[status(thm),theory(equality)],[inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[23])])])])]),
[iquote('copy,23,flip.2,flip.3,flip.4,flip.5')] ).
cnf(26,plain,
subset(singleton(A),unordered_pair(A,B)),
inference(hyper,[status(thm)],[18,3]),
[iquote('hyper,18,3')] ).
cnf(27,plain,
subset(empty_set,unordered_pair(A,B)),
inference(hyper,[status(thm)],[18,2]),
[iquote('hyper,18,2')] ).
cnf(35,plain,
set_difference(empty_set,unordered_pair(A,B)) = empty_set,
inference(hyper,[status(thm)],[27,8]),
[iquote('hyper,27,8')] ).
cnf(40,plain,
subset(unordered_pair(A,B),unordered_pair(B,A)),
inference(hyper,[status(thm)],[19,5]),
[iquote('hyper,19,5')] ).
cnf(48,plain,
( set_difference(dollar_c5,unordered_pair(dollar_c4,dollar_c3)) != empty_set
| unordered_pair(dollar_c3,dollar_c4) != dollar_c5 ),
inference(para_from,[status(thm),theory(equality)],[19,16]),
[iquote('para_from,19.1.1,16.2.1')] ).
cnf(50,plain,
( set_difference(dollar_c5,unordered_pair(dollar_c3,dollar_c4)) != empty_set
| singleton(dollar_c3) != dollar_c5 ),
inference(para_from,[status(thm),theory(equality)],[19,14]),
[iquote('para_from,19.1.1,14.1.1.2')] ).
cnf(51,plain,
( set_difference(dollar_c5,unordered_pair(dollar_c3,dollar_c4)) != empty_set
| singleton(dollar_c4) != dollar_c5 ),
inference(para_from,[status(thm),theory(equality)],[19,12]),
[iquote('para_from,19.1.1,12.1.1.2')] ).
cnf(52,plain,
( set_difference(dollar_c5,unordered_pair(dollar_c3,dollar_c4)) != empty_set
| empty_set != dollar_c5 ),
inference(para_from,[status(thm),theory(equality)],[19,10]),
[iquote('para_from,19.1.1,10.1.1.2')] ).
cnf(86,plain,
( empty_set = dollar_c5
| singleton(dollar_c4) = dollar_c5
| singleton(dollar_c3) = dollar_c5
| unordered_pair(dollar_c4,dollar_c3) = dollar_c5
| subset(dollar_c5,unordered_pair(dollar_c4,dollar_c3)) ),
inference(hyper,[status(thm)],[24,7]),
[iquote('hyper,24,7')] ).
cnf(452,plain,
( singleton(dollar_c3) != dollar_c5
| ~ subset(dollar_c5,unordered_pair(dollar_c3,dollar_c4)) ),
inference(unit_del,[status(thm)],[inference(para_into,[status(thm),theory(equality)],[50,8]),18]),
[iquote('para_into,50.1.1,8.1.1,unit_del,18')] ).
cnf(580,plain,
( singleton(dollar_c4) != dollar_c5
| ~ subset(dollar_c5,unordered_pair(dollar_c3,dollar_c4)) ),
inference(unit_del,[status(thm)],[inference(para_into,[status(thm),theory(equality)],[51,8]),18]),
[iquote('para_into,51.1.1,8.1.1,unit_del,18')] ).
cnf(714,plain,
( singleton(dollar_c4) != dollar_c5
| ~ subset(dollar_c5,unordered_pair(dollar_c4,dollar_c3)) ),
inference(para_into,[status(thm),theory(equality)],[580,19]),
[iquote('para_into,580.2.2,19.1.1')] ).
cnf(795,plain,
( unordered_pair(dollar_c3,dollar_c4) != dollar_c5
| ~ subset(dollar_c5,unordered_pair(dollar_c4,dollar_c3)) ),
inference(unit_del,[status(thm)],[inference(para_into,[status(thm),theory(equality)],[48,8]),18]),
[iquote('para_into,48.1.1,8.1.1,unit_del,18')] ).
cnf(833,plain,
( unordered_pair(dollar_c4,dollar_c3) != dollar_c5
| ~ subset(dollar_c5,unordered_pair(dollar_c4,dollar_c3)) ),
inference(para_into,[status(thm),theory(equality)],[795,19]),
[iquote('para_into,795.1.1,19.1.1')] ).
cnf(1006,plain,
( unordered_pair(dollar_c4,dollar_c3) != dollar_c5
| ~ subset(dollar_c5,unordered_pair(dollar_c3,dollar_c4)) ),
inference(para_into,[status(thm),theory(equality)],[833,19]),
[iquote('para_into,833.2.2,19.1.1')] ).
cnf(3478,plain,
( empty_set = dollar_c5
| singleton(dollar_c4) = dollar_c5
| singleton(dollar_c3) = dollar_c5
| unordered_pair(dollar_c4,dollar_c3) = dollar_c5 ),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[86,1])])])])]),
[iquote('hyper,86,1,factor_simp,factor_simp,factor_simp,factor_simp')] ).
cnf(3505,plain,
( subset(dollar_c5,unordered_pair(dollar_c3,dollar_c4))
| empty_set = dollar_c5
| singleton(dollar_c4) = dollar_c5
| singleton(dollar_c3) = dollar_c5 ),
inference(para_from,[status(thm),theory(equality)],[3478,40]),
[iquote('para_from,3478.4.1,40.1.1')] ).
cnf(4113,plain,
( empty_set = dollar_c5
| singleton(dollar_c4) = dollar_c5
| singleton(dollar_c3) = dollar_c5 ),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[3505,1006,3478])])])]),
[iquote('hyper,3505,1006,3478,factor_simp,factor_simp,factor_simp')] ).
cnf(4122,plain,
( subset(dollar_c5,unordered_pair(dollar_c4,A))
| empty_set = dollar_c5
| singleton(dollar_c3) = dollar_c5 ),
inference(para_from,[status(thm),theory(equality)],[4113,26]),
[iquote('para_from,4113.2.1,26.1.1')] ).
cnf(4136,plain,
( empty_set = dollar_c5
| singleton(dollar_c3) = dollar_c5 ),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[4122,714,4113])])]),
[iquote('hyper,4122,714,4113,factor_simp,factor_simp')] ).
cnf(4164,plain,
( subset(dollar_c5,unordered_pair(dollar_c3,A))
| empty_set = dollar_c5 ),
inference(para_from,[status(thm),theory(equality)],[4136,26]),
[iquote('para_from,4136.2.1,26.1.1')] ).
cnf(4178,plain,
empty_set = dollar_c5,
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[4164,452,4136])]),
[iquote('hyper,4164,452,4136,factor_simp')] ).
cnf(4271,plain,
set_difference(dollar_c5,unordered_pair(dollar_c3,dollar_c4)) != dollar_c5,
inference(unit_del,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[52]),4178,4178]),18]),
[iquote('back_demod,52,demod,4178,4178,unit_del,18')] ).
cnf(4273,plain,
set_difference(dollar_c5,unordered_pair(A,B)) = dollar_c5,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[35]),4178,4178]),
[iquote('back_demod,35,demod,4178,4178')] ).
cnf(4275,plain,
$false,
inference(binary,[status(thm)],[4273,4271]),
[iquote('binary,4273.1,4271.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET931+1 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n018.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jul 27 10:49:46 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.73/1.95 ----- Otter 3.3f, August 2004 -----
% 1.73/1.95 The process was started by sandbox2 on n018.cluster.edu,
% 1.73/1.95 Wed Jul 27 10:49:46 2022
% 1.73/1.95 The command was "./otter". The process ID is 5326.
% 1.73/1.95
% 1.73/1.95 set(prolog_style_variables).
% 1.73/1.95 set(auto).
% 1.73/1.95 dependent: set(auto1).
% 1.73/1.95 dependent: set(process_input).
% 1.73/1.95 dependent: clear(print_kept).
% 1.73/1.95 dependent: clear(print_new_demod).
% 1.73/1.95 dependent: clear(print_back_demod).
% 1.73/1.95 dependent: clear(print_back_sub).
% 1.73/1.95 dependent: set(control_memory).
% 1.73/1.95 dependent: assign(max_mem, 12000).
% 1.73/1.95 dependent: assign(pick_given_ratio, 4).
% 1.73/1.95 dependent: assign(stats_level, 1).
% 1.73/1.95 dependent: assign(max_seconds, 10800).
% 1.73/1.95 clear(print_given).
% 1.73/1.95
% 1.73/1.95 formula_list(usable).
% 1.73/1.95 all A (A=A).
% 1.73/1.95 all A B (unordered_pair(A,B)=unordered_pair(B,A)).
% 1.73/1.95 empty(empty_set).
% 1.73/1.95 all A B C (subset(A,unordered_pair(B,C))<-> -(A!=empty_set&A!=singleton(B)&A!=singleton(C)&A!=unordered_pair(B,C))).
% 1.73/1.95 exists A empty(A).
% 1.73/1.95 exists A (-empty(A)).
% 1.73/1.95 all A B subset(A,A).
% 1.73/1.95 all A B (set_difference(A,B)=empty_set<->subset(A,B)).
% 1.73/1.95 -(all A B C (set_difference(A,unordered_pair(B,C))=empty_set<-> -(A!=empty_set&A!=singleton(B)&A!=singleton(C)&A!=unordered_pair(B,C)))).
% 1.73/1.95 end_of_list.
% 1.73/1.95
% 1.73/1.95 -------> usable clausifies to:
% 1.73/1.95
% 1.73/1.95 list(usable).
% 1.73/1.95 0 [] A=A.
% 1.73/1.95 0 [] unordered_pair(A,B)=unordered_pair(B,A).
% 1.73/1.95 0 [] empty(empty_set).
% 1.73/1.95 0 [] -subset(A,unordered_pair(B,C))|A=empty_set|A=singleton(B)|A=singleton(C)|A=unordered_pair(B,C).
% 1.73/1.95 0 [] subset(A,unordered_pair(B,C))|A!=empty_set.
% 1.73/1.95 0 [] subset(A,unordered_pair(B,C))|A!=singleton(B).
% 1.73/1.95 0 [] subset(A,unordered_pair(B,C))|A!=singleton(C).
% 1.73/1.95 0 [] subset(A,unordered_pair(B,C))|A!=unordered_pair(B,C).
% 1.73/1.95 0 [] empty($c1).
% 1.73/1.95 0 [] -empty($c2).
% 1.73/1.95 0 [] subset(A,A).
% 1.73/1.95 0 [] set_difference(A,B)!=empty_set|subset(A,B).
% 1.73/1.95 0 [] set_difference(A,B)=empty_set| -subset(A,B).
% 1.73/1.95 0 [] set_difference($c5,unordered_pair($c4,$c3))=empty_set|$c5=empty_set|$c5=singleton($c4)|$c5=singleton($c3)|$c5=unordered_pair($c4,$c3).
% 1.73/1.95 0 [] set_difference($c5,unordered_pair($c4,$c3))!=empty_set|$c5!=empty_set.
% 1.73/1.95 0 [] set_difference($c5,unordered_pair($c4,$c3))!=empty_set|$c5!=singleton($c4).
% 1.73/1.95 0 [] set_difference($c5,unordered_pair($c4,$c3))!=empty_set|$c5!=singleton($c3).
% 1.73/1.95 0 [] set_difference($c5,unordered_pair($c4,$c3))!=empty_set|$c5!=unordered_pair($c4,$c3).
% 1.73/1.95 end_of_list.
% 1.73/1.95
% 1.73/1.95 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 1.73/1.95
% 1.73/1.95 This ia a non-Horn set with equality. The strategy will be
% 1.73/1.95 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.73/1.95 deletion, with positive clauses in sos and nonpositive
% 1.73/1.95 clauses in usable.
% 1.73/1.95
% 1.73/1.95 dependent: set(knuth_bendix).
% 1.73/1.95 dependent: set(anl_eq).
% 1.73/1.95 dependent: set(para_from).
% 1.73/1.95 dependent: set(para_into).
% 1.73/1.95 dependent: clear(para_from_right).
% 1.73/1.95 dependent: clear(para_into_right).
% 1.73/1.95 dependent: set(para_from_vars).
% 1.73/1.95 dependent: set(eq_units_both_ways).
% 1.73/1.95 dependent: set(dynamic_demod_all).
% 1.73/1.95 dependent: set(dynamic_demod).
% 1.73/1.95 dependent: set(order_eq).
% 1.73/1.95 dependent: set(back_demod).
% 1.73/1.95 dependent: set(lrpo).
% 1.73/1.95 dependent: set(hyper_res).
% 1.73/1.95 dependent: set(unit_deletion).
% 1.73/1.95 dependent: set(factor).
% 1.73/1.95
% 1.73/1.95 ------------> process usable:
% 1.73/1.95 ** KEPT (pick-wt=21): 1 [] -subset(A,unordered_pair(B,C))|A=empty_set|A=singleton(B)|A=singleton(C)|A=unordered_pair(B,C).
% 1.73/1.95 ** KEPT (pick-wt=8): 2 [] subset(A,unordered_pair(B,C))|A!=empty_set.
% 1.73/1.95 ** KEPT (pick-wt=9): 3 [] subset(A,unordered_pair(B,C))|A!=singleton(B).
% 1.73/1.95 ** KEPT (pick-wt=9): 4 [] subset(A,unordered_pair(B,C))|A!=singleton(C).
% 1.73/1.95 ** KEPT (pick-wt=10): 5 [] subset(A,unordered_pair(B,C))|A!=unordered_pair(B,C).
% 1.73/1.95 ** KEPT (pick-wt=2): 6 [] -empty($c2).
% 1.73/1.95 ** KEPT (pick-wt=8): 7 [] set_difference(A,B)!=empty_set|subset(A,B).
% 1.73/1.95 ** KEPT (pick-wt=8): 8 [] set_difference(A,B)=empty_set| -subset(A,B).
% 1.73/1.95 ** KEPT (pick-wt=10): 10 [copy,9,flip.2] set_difference($c5,unordered_pair($c4,$c3))!=empty_set|empty_set!=$c5.
% 1.73/1.95 ** KEPT (pick-wt=11): 12 [copy,11,flip.2] set_difference($c5,unordered_pair($c4,$c3))!=empty_set|singleton($c4)!=$c5.
% 1.73/1.95 ** KEPT (pick-wt=11): 14 [copy,13,flip.2] set_difference($c5,unordered_pair($c4,$c3))!=empty_set|singleton($c3)!=$c5.
% 1.73/1.95 ** KEPT (pick-wt=12): 16 [copy,15,flip.2] set_difference($c5,unordered_pair($c4,$c3))!=empty_set|unordered_pair($c4,$c3)!=$c5.
% 1.73/1.95
% 1.73/1.95 ------------> process sos:
% 15.53/15.79 ** KEPT (pick-wt=3): 18 [] A=A.
% 15.53/15.79 ** KEPT (pick-wt=7): 19 [] unordered_pair(A,B)=unordered_pair(B,A).
% 15.53/15.79 ** KEPT (pick-wt=2): 20 [] empty(empty_set).
% 15.53/15.79 ** KEPT (pick-wt=2): 21 [] empty($c1).
% 15.53/15.79 ** KEPT (pick-wt=3): 22 [] subset(A,A).
% 15.53/15.79 ** KEPT (pick-wt=23): 24 [copy,23,flip.2,flip.3,flip.4,flip.5] set_difference($c5,unordered_pair($c4,$c3))=empty_set|empty_set=$c5|singleton($c4)=$c5|singleton($c3)=$c5|unordered_pair($c4,$c3)=$c5.
% 15.53/15.79 Following clause subsumed by 18 during input processing: 0 [copy,18,flip.1] A=A.
% 15.53/15.79 Following clause subsumed by 19 during input processing: 0 [copy,19,flip.1] unordered_pair(A,B)=unordered_pair(B,A).
% 15.53/15.79
% 15.53/15.79 ======= end of input processing =======
% 15.53/15.79
% 15.53/15.79 =========== start of search ===========
% 15.53/15.79
% 15.53/15.79
% 15.53/15.79 Resetting weight limit to 22.
% 15.53/15.79
% 15.53/15.79
% 15.53/15.79 Resetting weight limit to 22.
% 15.53/15.79
% 15.53/15.79 sos_size=2953
% 15.53/15.79
% 15.53/15.79
% 15.53/15.79 Resetting weight limit to 21.
% 15.53/15.79
% 15.53/15.79
% 15.53/15.79 Resetting weight limit to 21.
% 15.53/15.79
% 15.53/15.79 sos_size=3095
% 15.53/15.79
% 15.53/15.79
% 15.53/15.79 Resetting weight limit to 20.
% 15.53/15.79
% 15.53/15.79
% 15.53/15.79 Resetting weight limit to 20.
% 15.53/15.79
% 15.53/15.79 sos_size=3144
% 15.53/15.79
% 15.53/15.79
% 15.53/15.79 Resetting weight limit to 19.
% 15.53/15.79
% 15.53/15.79
% 15.53/15.79 Resetting weight limit to 19.
% 15.53/15.79
% 15.53/15.79 sos_size=3184
% 15.53/15.79
% 15.53/15.79
% 15.53/15.79 Resetting weight limit to 18.
% 15.53/15.79
% 15.53/15.79
% 15.53/15.79 Resetting weight limit to 18.
% 15.53/15.79
% 15.53/15.79 sos_size=3277
% 15.53/15.79
% 15.53/15.79
% 15.53/15.79 Resetting weight limit to 17.
% 15.53/15.79
% 15.53/15.79
% 15.53/15.79 Resetting weight limit to 17.
% 15.53/15.79
% 15.53/15.79 sos_size=3159
% 15.53/15.79
% 15.53/15.79 -- HEY sandbox2, WE HAVE A PROOF!! --
% 15.53/15.79
% 15.53/15.79 ----> UNIT CONFLICT at 13.83 sec ----> 4275 [binary,4273.1,4271.1] $F.
% 15.53/15.79
% 15.53/15.79 Length of proof is 29. Level of proof is 11.
% 15.53/15.79
% 15.53/15.79 ---------------- PROOF ----------------
% 15.53/15.79 % SZS status Theorem
% 15.53/15.79 % SZS output start Refutation
% See solution above
% 15.53/15.79 ------------ end of proof -------------
% 15.53/15.79
% 15.53/15.79
% 15.53/15.79 Search stopped by max_proofs option.
% 15.53/15.79
% 15.53/15.79
% 15.53/15.79 Search stopped by max_proofs option.
% 15.53/15.79
% 15.53/15.79 ============ end of search ============
% 15.53/15.79
% 15.53/15.79 -------------- statistics -------------
% 15.53/15.79 clauses given 330
% 15.53/15.79 clauses generated 173207
% 15.53/15.79 clauses kept 4258
% 15.53/15.79 clauses forward subsumed 6866
% 15.53/15.79 clauses back subsumed 1050
% 15.53/15.79 Kbytes malloced 5859
% 15.53/15.79
% 15.53/15.79 ----------- times (seconds) -----------
% 15.53/15.79 user CPU time 13.83 (0 hr, 0 min, 13 sec)
% 15.53/15.79 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 15.53/15.79 wall-clock time 16 (0 hr, 0 min, 16 sec)
% 15.53/15.79
% 15.53/15.79 That finishes the proof of the theorem.
% 15.53/15.79
% 15.53/15.79 Process 5326 finished Wed Jul 27 10:50:02 2022
% 15.53/15.79 Otter interrupted
% 15.53/15.79 PROOF FOUND
%------------------------------------------------------------------------------