TSTP Solution File: SEU137+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU137+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n028.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:52 EDT 2022
% Result : Theorem 23.02s 23.22s
% Output : Refutation 23.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 15
% Syntax : Number of clauses : 30 ( 14 unt; 8 nHn; 19 RR)
% Number of literals : 69 ( 23 equ; 21 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 53 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(5,axiom,
( A = set_union2(B,C)
| ~ in(dollar_f1(B,C,A),A)
| ~ in(dollar_f1(B,C,A),B) ),
file('SEU137+1.p',unknown),
[] ).
cnf(6,axiom,
( A = set_union2(B,C)
| ~ in(dollar_f1(B,C,A),A)
| ~ in(dollar_f1(B,C,A),C) ),
file('SEU137+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ subset(A,B)
| ~ in(C,A)
| in(C,B) ),
file('SEU137+1.p',unknown),
[] ).
cnf(9,axiom,
( A != set_difference(B,C)
| ~ in(D,A)
| in(D,B) ),
file('SEU137+1.p',unknown),
[] ).
cnf(10,axiom,
( A != set_difference(B,C)
| ~ in(D,A)
| ~ in(D,C) ),
file('SEU137+1.p',unknown),
[] ).
cnf(11,axiom,
( A != set_difference(B,C)
| in(D,A)
| ~ in(D,B)
| in(D,C) ),
file('SEU137+1.p',unknown),
[] ).
cnf(18,axiom,
dollar_c3 != set_union2(dollar_c4,set_difference(dollar_c3,dollar_c4)),
file('SEU137+1.p',unknown),
[] ).
cnf(19,plain,
set_union2(dollar_c4,set_difference(dollar_c3,dollar_c4)) != dollar_c3,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[18])]),
[iquote('copy,18,flip.1')] ).
cnf(22,axiom,
( ~ empty(A)
| A = B
| ~ empty(B) ),
file('SEU137+1.p',unknown),
[] ).
cnf(32,axiom,
A = A,
file('SEU137+1.p',unknown),
[] ).
cnf(34,axiom,
( A = set_union2(B,C)
| in(dollar_f1(B,C,A),A)
| in(dollar_f1(B,C,A),B)
| in(dollar_f1(B,C,A),C) ),
file('SEU137+1.p',unknown),
[] ).
cnf(37,axiom,
empty(empty_set),
file('SEU137+1.p',unknown),
[] ).
cnf(39,axiom,
set_union2(A,A) = A,
file('SEU137+1.p',unknown),
[] ).
cnf(40,axiom,
empty(dollar_c1),
file('SEU137+1.p',unknown),
[] ).
cnf(45,axiom,
set_difference(A,empty_set) = A,
file('SEU137+1.p',unknown),
[] ).
cnf(47,axiom,
subset(dollar_c4,dollar_c3),
file('SEU137+1.p',unknown),
[] ).
cnf(63,plain,
empty_set = dollar_c1,
inference(hyper,[status(thm)],[40,22,37]),
[iquote('hyper,40,22,37')] ).
cnf(74,plain,
set_difference(A,dollar_c1) = A,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[45]),63]),
[iquote('back_demod,45,demod,63')] ).
cnf(117,plain,
( set_union2(A,B) = C
| ~ in(dollar_f1(A,B,C),C)
| ~ in(dollar_f1(A,B,C),B) ),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[39,6]),39,39,39]),
[iquote('para_into,38.1.1,6.1.1,demod,39,39,39')] ).
cnf(118,plain,
( set_union2(A,B) = C
| ~ in(dollar_f1(A,B,C),C)
| ~ in(dollar_f1(A,B,C),A) ),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[39,5]),39,39,39]),
[iquote('para_into,38.1.1,5.1.1,demod,39,39,39')] ).
cnf(139,plain,
( A = set_union2(B,C)
| in(dollar_f1(B,C,A),B)
| in(dollar_f1(B,C,A),C)
| in(dollar_f1(B,C,A),set_difference(A,D))
| in(dollar_f1(B,C,A),D) ),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[34,11,74]),74]),
[iquote('hyper,34,11,73,demod,74')] ).
cnf(150,plain,
( A = set_union2(dollar_c4,B)
| in(dollar_f1(dollar_c4,B,A),A)
| in(dollar_f1(dollar_c4,B,A),B)
| in(dollar_f1(dollar_c4,B,A),dollar_c3) ),
inference(hyper,[status(thm)],[34,7,47]),
[iquote('hyper,34,7,47')] ).
cnf(157,plain,
( A = set_union2(B,set_difference(C,D))
| in(dollar_f1(B,set_difference(C,D),A),A)
| in(dollar_f1(B,set_difference(C,D),A),B)
| in(dollar_f1(B,set_difference(C,D),A),C) ),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[34,9,74]),74,74,74,74]),
[iquote('hyper,34,9,73,demod,74,74,74,74')] ).
cnf(168,plain,
( set_union2(A,set_difference(B,C)) = B
| in(dollar_f1(A,set_difference(B,C),B),A)
| in(dollar_f1(A,set_difference(B,C),B),set_difference(B,C))
| in(dollar_f1(A,set_difference(B,C),B),C) ),
inference(flip,[status(thm),theory(equality)],[inference(factor,[status(thm)],[139])]),
[iquote('factor,139.3.4,flip.1')] ).
cnf(198,plain,
( set_union2(dollar_c4,A) = dollar_c3
| in(dollar_f1(dollar_c4,A,dollar_c3),dollar_c3)
| in(dollar_f1(dollar_c4,A,dollar_c3),A) ),
inference(flip,[status(thm),theory(equality)],[inference(factor,[status(thm)],[150])]),
[iquote('factor,150.2.4,flip.1')] ).
cnf(217,plain,
( set_union2(A,set_difference(B,C)) = B
| in(dollar_f1(A,set_difference(B,C),B),B)
| in(dollar_f1(A,set_difference(B,C),B),A) ),
inference(flip,[status(thm),theory(equality)],[inference(factor,[status(thm)],[157])]),
[iquote('factor,157.2.4,flip.1')] ).
cnf(2526,plain,
in(dollar_f1(dollar_c4,set_difference(dollar_c3,dollar_c4),dollar_c3),dollar_c3),
inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[217,10,32,198]),19,19])]),
[iquote('hyper,217,10,32,198,unit_del,19,19,factor_simp')] ).
cnf(2527,plain,
in(dollar_f1(dollar_c4,set_difference(dollar_c3,dollar_c4),dollar_c3),dollar_c4),
inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[2526,117,168]),19,19])]),
[iquote('hyper,2526,117,168,unit_del,19,19,factor_simp')] ).
cnf(2528,plain,
set_union2(dollar_c4,set_difference(dollar_c3,dollar_c4)) = dollar_c3,
inference(hyper,[status(thm)],[2527,118,2526]),
[iquote('hyper,2527,118,2526')] ).
cnf(2530,plain,
$false,
inference(binary,[status(thm)],[2528,19]),
[iquote('binary,2528.1,19.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEU137+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n028.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:00:48 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.74/1.96 ----- Otter 3.3f, August 2004 -----
% 1.74/1.96 The process was started by sandbox on n028.cluster.edu,
% 1.74/1.96 Wed Jul 27 08:00:49 2022
% 1.74/1.96 The command was "./otter". The process ID is 974.
% 1.74/1.96
% 1.74/1.96 set(prolog_style_variables).
% 1.74/1.96 set(auto).
% 1.74/1.96 dependent: set(auto1).
% 1.74/1.96 dependent: set(process_input).
% 1.74/1.96 dependent: clear(print_kept).
% 1.74/1.96 dependent: clear(print_new_demod).
% 1.74/1.96 dependent: clear(print_back_demod).
% 1.74/1.96 dependent: clear(print_back_sub).
% 1.74/1.96 dependent: set(control_memory).
% 1.74/1.96 dependent: assign(max_mem, 12000).
% 1.74/1.96 dependent: assign(pick_given_ratio, 4).
% 1.74/1.96 dependent: assign(stats_level, 1).
% 1.74/1.96 dependent: assign(max_seconds, 10800).
% 1.74/1.96 clear(print_given).
% 1.74/1.96
% 1.74/1.96 formula_list(usable).
% 1.74/1.96 all A (A=A).
% 1.74/1.96 all A B (in(A,B)-> -in(B,A)).
% 1.74/1.96 all A B (set_union2(A,B)=set_union2(B,A)).
% 1.74/1.96 all A B C (C=set_union2(A,B)<-> (all D (in(D,C)<->in(D,A)|in(D,B)))).
% 1.74/1.96 all A B (subset(A,B)<-> (all C (in(C,A)->in(C,B)))).
% 1.74/1.96 all A B C (C=set_difference(A,B)<-> (all D (in(D,C)<->in(D,A)& -in(D,B)))).
% 1.74/1.96 $T.
% 1.74/1.96 $T.
% 1.74/1.96 $T.
% 1.74/1.96 empty(empty_set).
% 1.74/1.96 all A B (-empty(A)-> -empty(set_union2(A,B))).
% 1.74/1.96 all A B (-empty(A)-> -empty(set_union2(B,A))).
% 1.74/1.96 all A B (set_union2(A,A)=A).
% 1.74/1.96 exists A empty(A).
% 1.74/1.96 exists A (-empty(A)).
% 1.74/1.96 all A B subset(A,A).
% 1.74/1.96 all A (set_union2(A,empty_set)=A).
% 1.74/1.96 all A B ((all C (in(C,A)<->in(C,B)))->A=B).
% 1.74/1.96 all A (set_difference(A,empty_set)=A).
% 1.74/1.96 -(all A B (subset(A,B)->B=set_union2(A,set_difference(B,A)))).
% 1.74/1.96 all A (set_difference(empty_set,A)=empty_set).
% 1.74/1.96 all A (empty(A)->A=empty_set).
% 1.74/1.96 all A B (-(in(A,B)&empty(B))).
% 1.74/1.96 all A B (-(empty(A)&A!=B&empty(B))).
% 1.74/1.96 end_of_list.
% 1.74/1.96
% 1.74/1.96 -------> usable clausifies to:
% 1.74/1.96
% 1.74/1.96 list(usable).
% 1.74/1.96 0 [] A=A.
% 1.74/1.96 0 [] -in(A,B)| -in(B,A).
% 1.74/1.96 0 [] set_union2(A,B)=set_union2(B,A).
% 1.74/1.96 0 [] C!=set_union2(A,B)| -in(D,C)|in(D,A)|in(D,B).
% 1.74/1.96 0 [] C!=set_union2(A,B)|in(D,C)| -in(D,A).
% 1.74/1.96 0 [] C!=set_union2(A,B)|in(D,C)| -in(D,B).
% 1.74/1.96 0 [] C=set_union2(A,B)|in($f1(A,B,C),C)|in($f1(A,B,C),A)|in($f1(A,B,C),B).
% 1.74/1.96 0 [] C=set_union2(A,B)| -in($f1(A,B,C),C)| -in($f1(A,B,C),A).
% 1.74/1.96 0 [] C=set_union2(A,B)| -in($f1(A,B,C),C)| -in($f1(A,B,C),B).
% 1.74/1.96 0 [] -subset(A,B)| -in(C,A)|in(C,B).
% 1.74/1.96 0 [] subset(A,B)|in($f2(A,B),A).
% 1.74/1.96 0 [] subset(A,B)| -in($f2(A,B),B).
% 1.74/1.96 0 [] C!=set_difference(A,B)| -in(D,C)|in(D,A).
% 1.74/1.96 0 [] C!=set_difference(A,B)| -in(D,C)| -in(D,B).
% 1.74/1.96 0 [] C!=set_difference(A,B)|in(D,C)| -in(D,A)|in(D,B).
% 1.74/1.96 0 [] C=set_difference(A,B)|in($f3(A,B,C),C)|in($f3(A,B,C),A).
% 1.74/1.96 0 [] C=set_difference(A,B)|in($f3(A,B,C),C)| -in($f3(A,B,C),B).
% 1.74/1.96 0 [] C=set_difference(A,B)| -in($f3(A,B,C),C)| -in($f3(A,B,C),A)|in($f3(A,B,C),B).
% 1.74/1.96 0 [] $T.
% 1.74/1.96 0 [] $T.
% 1.74/1.96 0 [] $T.
% 1.74/1.96 0 [] empty(empty_set).
% 1.74/1.96 0 [] empty(A)| -empty(set_union2(A,B)).
% 1.74/1.96 0 [] empty(A)| -empty(set_union2(B,A)).
% 1.74/1.96 0 [] set_union2(A,A)=A.
% 1.74/1.96 0 [] empty($c1).
% 1.74/1.96 0 [] -empty($c2).
% 1.74/1.96 0 [] subset(A,A).
% 1.74/1.96 0 [] set_union2(A,empty_set)=A.
% 1.74/1.96 0 [] in($f4(A,B),A)|in($f4(A,B),B)|A=B.
% 1.74/1.96 0 [] -in($f4(A,B),A)| -in($f4(A,B),B)|A=B.
% 1.74/1.96 0 [] set_difference(A,empty_set)=A.
% 1.74/1.96 0 [] subset($c4,$c3).
% 1.74/1.96 0 [] $c3!=set_union2($c4,set_difference($c3,$c4)).
% 1.74/1.96 0 [] set_difference(empty_set,A)=empty_set.
% 1.74/1.96 0 [] -empty(A)|A=empty_set.
% 1.74/1.96 0 [] -in(A,B)| -empty(B).
% 1.74/1.96 0 [] -empty(A)|A=B| -empty(B).
% 1.74/1.96 end_of_list.
% 1.74/1.96
% 1.74/1.96 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 1.74/1.96
% 1.74/1.96 This ia a non-Horn set with equality. The strategy will be
% 1.74/1.96 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.74/1.96 deletion, with positive clauses in sos and nonpositive
% 1.74/1.96 clauses in usable.
% 1.74/1.96
% 1.74/1.96 dependent: set(knuth_bendix).
% 1.74/1.96 dependent: set(anl_eq).
% 1.74/1.96 dependent: set(para_from).
% 1.74/1.96 dependent: set(para_into).
% 1.74/1.96 dependent: clear(para_from_right).
% 1.74/1.96 dependent: clear(para_into_right).
% 1.74/1.96 dependent: set(para_from_vars).
% 1.74/1.96 dependent: set(eq_units_both_ways).
% 1.74/1.96 dependent: set(dynamic_demod_all).
% 1.74/1.96 dependent: set(dynamic_demod).
% 1.74/1.96 dependent: set(order_eq).
% 1.74/1.96 dependent: set(back_demod).
% 1.74/1.96 dependent: set(lrpo).
% 1.74/1.96 dependent: set(hyper_res).
% 1.74/1.96 dependent: set(unit_deletion).
% 1.74/1.96 dependent: set(factor).
% 1.74/1.96
% 1.74/1.96 ------------> process usable:
% 1.74/1.96 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.74/1.96 ** KEPT (pick-wt=14): 2 [] A!=set_union2(B,C)| -in(D,A)|in(D,B)|in(D,C).
% 1.74/1.96 ** KEPT (pick-wt=11): 3 [] A!=set_union2(B,C)|in(D,A)| -in(D,B).
% 1.74/1.96 ** KEPT (pick-wt=11): 4 [] A!=set_union2(B,C)|in(D,A)| -in(D,C).
% 1.74/1.96 ** KEPT (pick-wt=17): 5 [] A=set_union2(B,C)| -in($f1(B,C,A),A)| -in($f1(B,C,A),B).
% 23.02/23.22 ** KEPT (pick-wt=17): 6 [] A=set_union2(B,C)| -in($f1(B,C,A),A)| -in($f1(B,C,A),C).
% 23.02/23.22 ** KEPT (pick-wt=9): 7 [] -subset(A,B)| -in(C,A)|in(C,B).
% 23.02/23.22 ** KEPT (pick-wt=8): 8 [] subset(A,B)| -in($f2(A,B),B).
% 23.02/23.22 ** KEPT (pick-wt=11): 9 [] A!=set_difference(B,C)| -in(D,A)|in(D,B).
% 23.02/23.22 ** KEPT (pick-wt=11): 10 [] A!=set_difference(B,C)| -in(D,A)| -in(D,C).
% 23.02/23.22 ** KEPT (pick-wt=14): 11 [] A!=set_difference(B,C)|in(D,A)| -in(D,B)|in(D,C).
% 23.02/23.22 ** KEPT (pick-wt=17): 12 [] A=set_difference(B,C)|in($f3(B,C,A),A)| -in($f3(B,C,A),C).
% 23.02/23.22 ** KEPT (pick-wt=23): 13 [] A=set_difference(B,C)| -in($f3(B,C,A),A)| -in($f3(B,C,A),B)|in($f3(B,C,A),C).
% 23.02/23.22 ** KEPT (pick-wt=6): 14 [] empty(A)| -empty(set_union2(A,B)).
% 23.02/23.22 ** KEPT (pick-wt=6): 15 [] empty(A)| -empty(set_union2(B,A)).
% 23.02/23.22 ** KEPT (pick-wt=2): 16 [] -empty($c2).
% 23.02/23.22 ** KEPT (pick-wt=13): 17 [] -in($f4(A,B),A)| -in($f4(A,B),B)|A=B.
% 23.02/23.22 ** KEPT (pick-wt=7): 19 [copy,18,flip.1] set_union2($c4,set_difference($c3,$c4))!=$c3.
% 23.02/23.22 ** KEPT (pick-wt=5): 20 [] -empty(A)|A=empty_set.
% 23.02/23.22 ** KEPT (pick-wt=5): 21 [] -in(A,B)| -empty(B).
% 23.02/23.22 ** KEPT (pick-wt=7): 22 [] -empty(A)|A=B| -empty(B).
% 23.02/23.22
% 23.02/23.22 ------------> process sos:
% 23.02/23.22 ** KEPT (pick-wt=3): 32 [] A=A.
% 23.02/23.22 ** KEPT (pick-wt=7): 33 [] set_union2(A,B)=set_union2(B,A).
% 23.02/23.22 ** KEPT (pick-wt=23): 34 [] A=set_union2(B,C)|in($f1(B,C,A),A)|in($f1(B,C,A),B)|in($f1(B,C,A),C).
% 23.02/23.22 ** KEPT (pick-wt=8): 35 [] subset(A,B)|in($f2(A,B),A).
% 23.02/23.22 ** KEPT (pick-wt=17): 36 [] A=set_difference(B,C)|in($f3(B,C,A),A)|in($f3(B,C,A),B).
% 23.02/23.22 ** KEPT (pick-wt=2): 37 [] empty(empty_set).
% 23.02/23.22 ** KEPT (pick-wt=5): 38 [] set_union2(A,A)=A.
% 23.02/23.22 ---> New Demodulator: 39 [new_demod,38] set_union2(A,A)=A.
% 23.02/23.22 ** KEPT (pick-wt=2): 40 [] empty($c1).
% 23.02/23.22 ** KEPT (pick-wt=3): 41 [] subset(A,A).
% 23.02/23.22 ** KEPT (pick-wt=5): 42 [] set_union2(A,empty_set)=A.
% 23.02/23.22 ---> New Demodulator: 43 [new_demod,42] set_union2(A,empty_set)=A.
% 23.02/23.22 ** KEPT (pick-wt=13): 44 [] in($f4(A,B),A)|in($f4(A,B),B)|A=B.
% 23.02/23.22 ** KEPT (pick-wt=5): 45 [] set_difference(A,empty_set)=A.
% 23.02/23.22 ---> New Demodulator: 46 [new_demod,45] set_difference(A,empty_set)=A.
% 23.02/23.22 ** KEPT (pick-wt=3): 47 [] subset($c4,$c3).
% 23.02/23.22 ** KEPT (pick-wt=5): 48 [] set_difference(empty_set,A)=empty_set.
% 23.02/23.22 ---> New Demodulator: 49 [new_demod,48] set_difference(empty_set,A)=empty_set.
% 23.02/23.22 Following clause subsumed by 32 during input processing: 0 [copy,32,flip.1] A=A.
% 23.02/23.22 32 back subsumes 31.
% 23.02/23.22 32 back subsumes 30.
% 23.02/23.22 Following clause subsumed by 33 during input processing: 0 [copy,33,flip.1] set_union2(A,B)=set_union2(B,A).
% 23.02/23.22 >>>> Starting back demodulation with 39.
% 23.02/23.22 >> back demodulating 24 with 39.
% 23.02/23.22 >>>> Starting back demodulation with 43.
% 23.02/23.22 >>>> Starting back demodulation with 46.
% 23.02/23.22 >>>> Starting back demodulation with 49.
% 23.02/23.22
% 23.02/23.22 ======= end of input processing =======
% 23.02/23.22
% 23.02/23.22 =========== start of search ===========
% 23.02/23.22
% 23.02/23.22
% 23.02/23.22 Resetting weight limit to 11.
% 23.02/23.22
% 23.02/23.22
% 23.02/23.22 Resetting weight limit to 11.
% 23.02/23.22
% 23.02/23.22 sos_size=1738
% 23.02/23.22
% 23.02/23.22
% 23.02/23.22 Resetting weight limit to 9.
% 23.02/23.22
% 23.02/23.22
% 23.02/23.22 Resetting weight limit to 9.
% 23.02/23.22
% 23.02/23.22 sos_size=1809
% 23.02/23.22
% 23.02/23.22 -- HEY sandbox, WE HAVE A PROOF!! --
% 23.02/23.22
% 23.02/23.22 ----> UNIT CONFLICT at 21.25 sec ----> 2530 [binary,2528.1,19.1] $F.
% 23.02/23.22
% 23.02/23.22 Length of proof is 14. Level of proof is 7.
% 23.02/23.22
% 23.02/23.22 ---------------- PROOF ----------------
% 23.02/23.22 % SZS status Theorem
% 23.02/23.22 % SZS output start Refutation
% See solution above
% 23.02/23.22 ------------ end of proof -------------
% 23.02/23.22
% 23.02/23.22
% 23.02/23.22 Search stopped by max_proofs option.
% 23.02/23.22
% 23.02/23.22
% 23.02/23.22 Search stopped by max_proofs option.
% 23.02/23.22
% 23.02/23.22 ============ end of search ============
% 23.02/23.22
% 23.02/23.22 -------------- statistics -------------
% 23.02/23.22 clauses given 638
% 23.02/23.22 clauses generated 604153
% 23.02/23.22 clauses kept 2518
% 23.02/23.22 clauses forward subsumed 41619
% 23.02/23.22 clauses back subsumed 355
% 23.02/23.22 Kbytes malloced 5859
% 23.02/23.22
% 23.02/23.22 ----------- times (seconds) -----------
% 23.02/23.22 user CPU time 21.25 (0 hr, 0 min, 21 sec)
% 23.02/23.22 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 23.02/23.22 wall-clock time 22 (0 hr, 0 min, 22 sec)
% 23.02/23.22
% 23.02/23.22 That finishes the proof of the theorem.
% 23.02/23.22
% 23.02/23.22 Process 974 finished Wed Jul 27 08:01:11 2022
% 23.02/23.22 Otter interrupted
% 23.02/23.22 PROOF FOUND
%------------------------------------------------------------------------------